𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Confluence of Curried Term-Rewriting Systems

✍ Scribed by Stefan Kahrs


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
721 KB
Volume
19
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis


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 not as trivial as one might first think.

It is shown that currying preserves confluence of arbitrary term rewriting systems. The structure of the proof is similar to Toyama's proof that confluence is a modular property of TRS.


πŸ“œ SIMILAR VOLUMES


Term-rewriting systems with rule priorit
✍ J.C.M. Baeten; J.A. Bergstra; J.W. Klop; W.P. Weijland πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 463 KB
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.