✦ LIBER ✦

Constructor equivalent term rewriting systems

✍ Scribed by Iréne Durand; Bruno Salinier

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 399 KB
Volume: 47
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90236-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructor equivalent term rewriting sy

Constructor equivalent term rewriting systems are strongly sequential: a direct proof

✍ Irène Durand; Bruno Salinier 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 737 KB

Modularity of simple termination of term

Modularity of simple termination of term rewriting systems with shared constructors

✍ Masahito Kurihara; Azuma Ohuchi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 640 KB

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-rewriting systems with rule priorit

Term-rewriting systems with rule priorities

✍ J.C.M. Baeten; J.A. Bergstra; J.W. Klop; W.P. Weijland 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Modular term rewriting systems and the t

Modular term rewriting systems and the termination

✍ Masahito Kurihara; Ikuo Kaji 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 313 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.