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.
This work was sponsored by the Sonder for schungsbereich 49 — Programmiertechnik at the Technical University of Munich.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Bergstra, J. Klop, Conditional rewrite rules: confluence and termination. Report IW 198/82 Mathematical Centre, Amsterdam 1982
M. Broy, P. Pepper, M. Wirsing, On the algebraic definition of programming languages. Report TUM-18204 Technical University, Munich 1982
P.Deransart, An operational algebraic semantics of PROLOG programs. Internal Report INRIA 1983
K. Drosten, Toward executable specifications using conditional axioms. Report 83-01 Technical University, Braunschweig 1983
M.Fay, First order unification in an equational theory. In: W.H. Joyner (ed.), Proc. 4th Workshop on Automated Deduction, Academic Press 1979
L. Fribourg, Oriented equational clauses as a programming language. Report 84002 Laboratoires de Marcoussis 1984 Short version in: Proc. 11th ICALP, LNCS 172, 162–173, Springer 1984
L.Fribourg, Handling function definitions through innermost superposition and rewriting. Report LITP 84-69. Also to appear in: Proc. RTA 85
J.A. Goguen, J. Meseguer, Equality, types, modules and generics for logic programming. Report CSLI-84-5 Center for the Study of Language and Information, Stanford 1984
G. Huet, D.C.Oppen, Equations and rewrite rules: a survey. In: R.V. Book (ed.), Formal language theory — perspectives and open problems. Academic Press 1980
J.M. Hullot, Canonical forms and unification. Proc. 5th CADE, LNCS 87, 318–334, Springer 1980
H.Hussmann, Unification in conditional-equational theories. Report MIP-8502 Universitaet Passau 1985
H.Hussmann, Rapid prototyping for algebraic specifications — RAP system user's manual. Report MIP-8504 Universitaet Passau 1985
S. Kaplan, Fair conditional term rewriting systems: unification, termination and confluence. Report 194 LRI Orsay, Paris 1984
J.-L.Remy, H.Zhang, REVEUR4: A system for validating algebraic specifications of parameterized abstract data types. Proc. 2nd ECAI Conf. 1984
P.Rety, C.Kirchner, H.Kirchner, NARROWER: a new algorithm for unification and its application to logic programing. To appear in: Proc. RTA 85
M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy, On hierarchies of abstract data types. Acta Informatica 20(1983), 1–33.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hussmann, H. (1985). Unification in conditional-equational theories. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_328
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_328
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive