✦ LIBER ✦

Decidable call-by-need computations in term rewriting

✍ Scribed by Irène Durand; Aart Middeldorp

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Termination of just/fair computations in

✍ Salvador Lucas; José Meseguer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Deciding confluence of certain term rewr

✍ Guillem Godoy; Ashish Tiwari; Rakesh Verma 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 362 KB

[Lecture Notes in Computer Science] Cond

✍ Rusinowitch, Michaël; Rémy, Jean-Luc 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 27 KB

A class of ambiguous linear term-rewriti

✍ Tohru Naoi; Masafumi Yamashita; Toshihide Ibaraki; Namio Honda 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 939 KB

A term rewriting characterization of the

✍ Isabel Oitavem 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 124 KB

Enhancing dependency pair method using s

✍ Keiichirou Kusakari; Masahiko Sakai 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 394 KB