✦ LIBER ✦

Determinization of conditional term rewriting systems

✍ Scribed by Nagashima, Masanori; Sakai, Masahiko; Sakabe, Toshiki

Book ID: 119375410
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 591 KB
Volume: 464
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reachability in Conditional Term Rewriti

Reachability in Conditional Term Rewriting Systems

✍ Guillaume Feuillade; Thomas Genet 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 844 KB

In this paper, we study the reachability problem for conditional term rewriting systems. Given two ground terms \(s\) and \(t\), our practical aim is to prove \(s 力_{\mathcal{R}}^{*} t\) for some join conditional term rewriting system \(\mathcal{R}\) (possibly not terminating and not confluent). The

Characterizing and proving operational t

Characterizing and proving operational termination of deterministic conditional term rewriting systems

✍ Felix Schernhammer; Bernhard Gramlich 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Constructor equivalent term rewriting sy

Constructor equivalent term rewriting systems

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

Complexity analysis of term-rewriting sy

Complexity analysis of term-rewriting systems

✍ C. Choppy; S. Kaplan; M. Soria 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 659 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

Murg term rewrite systems

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