✦ LIBER ✦

Termination of just/fair computations in term rewriting

✍ Scribed by Salvador Lucas; José Meseguer

Book ID: 113641730
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 384 KB
Volume: 206
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.11.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total Termination of Term Rewriting is U

Total Termination of Term Rewriting is Undecidable

✍ Hans Zantema 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Decidable call-by-need computations in t

Decidable call-by-need computations in term rewriting

✍ Irène Durand; Aart Middeldorp 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Termination of term rewriting: interpret

Termination of term rewriting: interpretation and type elimination

✍ H. Zantema 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 886 KB

We investigate proving termination of term rewriting systems by interpretation of terms in a well-founded monotone algebra. The well-known polynomial interpretations can be considered as a particular case in this framework. A classification of types of termination, including simple termination, is p

Relative Undecidability in Term Rewritin

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy

✍ Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On termination of the direct sum of term

On termination of the direct sum of term-rewriting systems

✍ Michael Rusinowitch 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 619 KB

Computational semantics of terms rewriti

Computational semantics of terms rewriting systems

✍ G. Boudol 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 118 KB