113 search results - page 3 / 23 » Complete involutive rewriting systems |
RTA
1991
Springer
13 years 9 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
JFLP
2002
13 years 5 months ago
2002
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is...
RTA
1987
Springer
13 years 9 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
RTA
1995
Springer
13 years 9 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...