论文信息 - Unification in Conditional Equational Theories

Unification in Conditional Equational Theories

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.

Heinrich Hußmann | H. Hussmann

[1] Stéphane Kaplan. Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

[2] Laurent Fribourg. Oriented Equational Clauses as a Programming Language , 1984, J. Log. Program..

[3] Pierre Deransart,et al. An Operational Algebraic Semantics of Prolog Programs , 1983, Logic Programming Workshop.

[4] Claude Kirchner,et al. NARROWER: A New Algorithm for Unification and Its Application to Logic Programming , 1985, RTA.

[5] José Meseguer,et al. Equality, Types, Modules and Generics for Logic Programming , 1984, ICLP.

[6] Ronald V. Book,et al. Formal language theory : perspectives and open problems , 1980 .

[7] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[8] Laurent Fribourg,et al. Handling Function Definitions through Innermost Superposition and Rewriting , 1985, RTA.

[9] Jan A. Bergstra,et al. Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[10] Jean-Marie Hullot,et al. Canonical Forms and Unification , 1980, CADE.