TY - JOUR
T1 - Rewrite, rewrite, rewrite, rewrite, rewrite, ...
AU - Dershowitz, Nachum
AU - Kaplan, Stéphane
AU - Plaisted, David A.
N1 - Funding Information:
* Preliminary versions [6,7] of ideas in this paper were presented at the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, TX (January 1989) and at the Sixteenth EATCS International Colloquium on Automata, Languages and Programming, Stresa, Italy (July 1989). ** Supported in part by the U.S. National Science Foundation under Grant CCR 90-07195. *** Supported in part by the European Communities under ESPRIT project 432 (METEOR). t Supported in part by the U.S. National Science Foundation under Grant CCR 88-02282.
PY - 1991/6/21
Y1 - 1991/6/21
N2 - We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories. We also consider sufficient completeness of hierarchical systems.
AB - We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories. We also consider sufficient completeness of hierarchical systems.
UR - http://www.scopus.com/inward/record.url?scp=0026171030&partnerID=8YFLogxK
U2 - 10.1016/0304-3975(91)90040-9
DO - 10.1016/0304-3975(91)90040-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0026171030
SN - 0304-3975
VL - 83
SP - 71
EP - 96
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1
ER -