37 search results - page 2 / 8 » Partial Inversion of Constructor Term 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...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
FLOPS
2008
Springer
13 years 7 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
TAPSOFT
1989
Springer
13 years 9 months ago
1989
Springer
