Abstract
In symbolic evaluation via general conditional term rewriting systems, recursive evaluation of the premisses of the rules is needed, which leads to intractability. In this paper, a new principle is introduced allowing to control that complexity. This enables the extension of several results for the classical rewriting to the conditional framework. In particular, results about correctness of evaluation procedures, unification in conditional theories, termination and confluence together with Knuth and Bendix procedures are obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Biliography
M. Bergman, P. Deransart, Abstract data types and rewriting systems applications to the programmation of abstract data types in PROLOG, Proc. of 6th CAAP, Genes (1981).
D. Brandt, J.A. Darringer, W.H. Joyner, Completeness of conditional reductions, IBM Res. Center, Yorktown Heights (1978).
J. Bergstra, J. Klop, Conditional rewrite rules: confluence and termination, Report IW 198/82, Amsterdam (1982).
K. Drosten, Toward executable specifications using conditional axioms, Report 83–01, T.U. Braunschweig (1983).
N. Dershowitz, Orderings for term rewriting systems, Proc 20th Symposium on Foundation of Computer Science, pp. 123–131 (1979).
L. Fribourg, Oriented equational clauses as a programming language, Proc. 11th ICALP, Antwerpen (1984).
J. Goguen, How to prove algebraic inductive hypotheses without induction, 5th CAD, Les Arcs- France (1980).
G. Huet, J-M. Hullot, Proofs by induction in equational theories with constructors Report INRIA N.28, Rocquencourt (1980).
G. Huet, D.C. Oppen. Equations and rewrite rules: a survey , Formal languages: Perspective and open problems, R. Book Ed., Academic Press (1980).
S. Kaplan, Un langage de specifications de types abstraits algebriques, These de 3ems cycle, Orsay-France (1983).
S. Kaplan, Conditional rewrite rules, to appear in TCS (1984)
S. Kaplan, Unification, narrowing with fair conditional term rewriting systems, Internal L.R.I. Report (to appear).
D.E. Knuth, P.B. Bendix, Simple word problems in universal algebra, Computational problems in abstract algebra, J. Leech Ed., Pergammon Press (1970).
D.S. Lankford, Some new approaches to the theory and applications of conditional term rewriting systems, (Aug. 79).
M.J. O’Donnei, Computing in systems described by equations, LNCS 58, Springer Verlag (1977).
U. Pletat, G. Engels, H-D. Enrich, Operational semantics of algebraic specifications with conditional equations, 7th CAAP, Lille (1981).
J-L. Remy, Etude des systemes de recriture conditionnels et applications aux types abstraits algebriques, These d’Etat, Nancy-France (1982).
J-L. Remy, H. Zhang, REVEUR4: A system for validating conditional algebraic specifications of parameterized abstract data types, Proc of 2nd ECAI Conference, Pisa (1984).
H. Hussman, Unification in conditional-equational theories, Proc. of the EUROCAL Conf., Linz (1985)
E. Paul, On solving the equality problem in theories defined by Horn clauses, Proc. of the EUROCAL Conf., Linz (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaplan, S. (1985). Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence. In: Kreowski, HJ. (eds) Recent Trends in Data Type Specification. Informatik-Fachberichte, vol 116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09691-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-09691-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16077-9
Online ISBN: 978-3-662-09691-8
eBook Packages: Springer Book Archive