Abstract
A complete unification procedure for confluent conditional term rewriting systems is presented which is a generalization of the narrowing process described by Fay and Hullot. Neither the finite termination property nor syntactical restrictions on conditions are needed. The algorithm can be seen as a new functional logic programming technique, too. The unification procedure has been built into the RAP system, a system supporting rapid prototyping for algebraic specifications.
Cite
CITATION STYLE
Hussmann, H. (1985). Unification in conditional-equational theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 204 LNCS, pp. 543–553). Springer Verlag. https://doi.org/10.1007/3-540-15984-3_328
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
