✦ LIBER ✦

Characterizing and proving operational termination of deterministic conditional term rewriting systems

✍ Scribed by Felix Schernhammer; Bernhard Gramlich

Book ID: 113720708
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 581 KB
Volume: 79
Category: Article
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2009.08.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modular termination of r-consistent and

Modular termination of r-consistent and left-linear term rewriting systems

✍ Manfred Schmidt-Schauß; Massimo Marchiori; Sven Eric Panitz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 940 KB

Narrowing-based simulation of term rewri

Narrowing-based simulation of term rewriting systems with extra variables and its Termination Proof

✍ Naoki Nishida; Masahiko Sakai; Toshiki Sakabe 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Term rewriting systems (TRSs) extended by allowing to contain extra variables in their rewrite rules are called EV-TRSs. They are ill-natured since every one-step reduction by their rules with extra variables is infinitely branching and they are not terminating. To solve these problems, this paper s

[Lecture Notes in Computer Science] Cond

[Lecture Notes in Computer Science] Conditional and Typed Rewriting Systems Volume 968 || Church-Rosser property and unique normal form property of non-duplicating term rewriting systems

✍ Dershowitz, Nachum; Lindenstrauss, Naomi 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 816 KB

[Lecture Notes in Computer Science] Term

[Lecture Notes in Computer Science] Term Rewriting and Applications Volume 3467 || Termination of Single-Threaded One-Rule Semi-Thue Systems

✍ Giesl, Jürgen 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 250 KB