✦ LIBER ✦

Unification, Rewriting, and Narrowing on Term Graphs

✍ Scribed by Annegret Habel; Detlef Plump

Book ID: 104445325
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 462 KB
Volume: 2
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80187-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Term-Graph Rewrite Strategies

✍ Rachid Echahed 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 281 KB

Clean: a Programming Environment Based o

Clean: a Programming Environment Based on Term Graph Rewriting

✍ M.J. Plasmeijer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Meta-variables as infinite lists in nomi

Meta-variables as infinite lists in nominal terms unification and rewriting

✍ Gabbay, M. J. 📂 Article 📅 2012 🏛 Oxford University Press 🌐 English ⚖ 986 KB

Semagraph: the Theory and Practice of Te

Semagraph: the Theory and Practice of Term Graph Rewriting

✍ Ronan Sleep 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 332 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

On sequential and parallel node-rewritin

On sequential and parallel node-rewriting graph grammars, II

✍ D Janssens; R Verraedt 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 98 KB