𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Termination of narrowing via termination of rewriting

✍ Scribed by Naoki Nishida; Germán Vidal

Publisher
Springer
Year
2010
Tongue
English
Weight
727 KB
Volume
21
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On termination of confluent one-rule str
On termination of confluent one-rule string-rewriting systems
✍ Kayoko Shikishima-Tsuji; Masashi Katsura; Yuji Kobayashi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 507 KB

The termination of a confluent one-rule string-rewriting system R = (s + I} is reduced to that of another one-rule system K = {s' -B t') such that s' is self-overlap-free &of). A necessary and sufficient condition is given for termination of a one-rule system R = {s --+ t} such that s is sof and s o