ISSN:
1432-0622
Keywords:
Conditional rewriting
;
Conditional narrowing
;
E-unification
;
Constraint logic and functional programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
,
Technology
Notes:
Abstract Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systemsR, E without extravariables whereE is regular andR, E is Church-Rosser moduloE and decreasing moduloE. This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01202035
Permalink
