✦ LIBER ✦

Complexity analysis of term-rewriting systems

✍ Scribed by C. Choppy; S. Kaplan; M. Soria

Book ID: 107948614
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 659 KB
Volume: 67
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90005-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The derivational complexity of string re

The derivational complexity of string rewriting systems

✍ Yuji Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Constructor equivalent term rewriting sy

Constructor equivalent term rewriting systems

✍ Iréne Durand; Bruno Salinier 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 399 KB

System Presentation: An Analyser of Rewr

System Presentation: An Analyser of Rewriting Systems Complexity

✍ J.-Y. Moyen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 281 KB

Confluence of Curried Term-Rewriting Sys

Confluence of Curried Term-Rewriting Systems

✍ Stefan Kahrs 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Term rewriting systems operate on first-order terms. Presenting such terms in curried form is usually regarded as a trivial change of notation. However, in the absence of a type-discipline, or in the presence of a more powerful type-discipline than simply typed \(\lambda\)-calculus, the change is no

Determinization of conditional term rewr

Determinization of conditional term rewriting systems

✍ Nagashima, Masanori; Sakai, Masahiko; Sakabe, Toshiki 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Murg term rewrite systems

✍ Sándor Vágvölgyi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 209 KB