𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Term-rewriting systems with rule priorities

✍ Scribed by J.C.M. Baeten; J.A. Bergstra; J.W. Klop; W.P. Weijland

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
463 KB
Volume
67
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Confluence of Curried Term-Rewriting Sys
Confluence of Curried Term-Rewriting Systems
✍ Stefan Kahrs πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 721 KB

Term rewriting systems operate on first-order terms. Presenting such terms in curried form is usually regarded as a trivial change of notation. However, in the absence of a type-discipline, or in the presence of a more powerful type-discipline than simply typed \(\lambda\)-calculus, the change is no

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.

On termination of confluent one-rule str
On termination of confluent one-rule string-rewriting systems
✍ Kayoko Shikishima-Tsuji; Masashi Katsura; Yuji Kobayashi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 507 KB

The termination of a confluent one-rule string-rewriting system R = (s + I} is reduced to that of another one-rule system K = {s' -B t') such that s' is self-overlap-free &of). A necessary and sufficient condition is given for termination of a one-rule system R = {s --+ t} such that s is sof and s o