✦ LIBER ✦

Termination of Lazy Rewriting Revisited

✍ Scribed by Felix Schernhammer; Bernhard Gramlich

Book ID: 108126928
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 337 KB
Volume: 204
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.03.052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Termination of narrowing via termination

Termination of narrowing via termination of rewriting

✍ Naoki Nishida; Germán Vidal 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 727 KB

Total Termination of Term Rewriting is U

Total Termination of Term Rewriting is Undecidable

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

Decidability of Termination of Grid Stri

Decidability of Termination of Grid String Rewriting Rules

✍ Geser, Alfons 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 177 KB

Proving termination of context-sensitive

Proving termination of context-sensitive rewriting by transformation

✍ Salvador Lucas 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 620 KB

Termination of just/fair computations in

Termination of just/fair computations in term rewriting

✍ Salvador Lucas; José Meseguer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 384 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