𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A compact fixpoint semantics for term rewriting systems

✍ Scribed by M. Alpuente; M. Comini; S. Escobar; M. Falaschi; J. Iborra

Book ID
108281646
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
716 KB
Volume
411
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Rewriting Semantics for Maude Strategi
A Rewriting Semantics for Maude Strategies
✍ Narciso MartΓ­-Oliet; JosΓ© Meseguer; Alberto Verdejo πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 362 KB
Term Rewrite Systems for Lattice Theory
Term Rewrite Systems for Lattice Theory
✍ Ralph Freese; J. JeΕΎek; J.B. Nation πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 367 KB

It is shown that, even though there is a very well-behaved, natural normal form for lattice theory, there is no finite, convergent \(A C\) term rewrite system for the equational theory of all lattices.

Reachability and confluence are undecida
Reachability and confluence are undecidable for flat term rewriting systems
✍ Florent Jacquemard πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 99 KB

Ground reachability, ground joinability and confluence are shown undecidable for flat term rewriting systems, i.e., systems in which all left and right members of rule have depth at most one.

Omega-Termination is Undecidable for Tot
Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems
✍ Alfons Geser πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 601 KB

We give a complete proof of the fact that the following problem is undecidable: Given: A term rewriting system, where the termination of its rewrite relation is provable by a total reduction order on ground terms, Wanted: Does there exist a strictly monotonic interpretation in the positive integers