Abstract
We propose an ”anti-unification” algorithm to solve inequations in an algebra of terms. It enables us to decide the ”convertibility” property without assuming any linear hypothesis on the left hand sides of the rules. Since this property is connected with the sufficient completeness of algebraic specifications, we may decide of the latter in the same way.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bert D. La Programmation Generique. Thèse d'Etat (1979).
Bert D. Refinement of Generic Specifications with Algebraic Tools. IFIP 1983 (ed. R.EA.Mason).
Bidoit M. Une méthode de présentation des types abstraits: applications. Thèse de troisieme cycle. Orsay (1981)
Comon H. An anti-unification approach to decide the sufficient completeness of algebraic specification. To appear as a LIFIA report.
Ehrig H., Kreowsky H. & Padawitz P. Stepwise specifications and implementations of Abstract Data Types. LNCS 62 (1978) pp 205–226.
Goguen J.A., Thatcher J.W. & Wagner E.G. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. Current trends in programming methodology vol. 4, pp 80–149, Ed. Prentice Hall (1978).
Goguen J.A., Futatsugi K., Jouannaud JP. & Messeguer J. Principles of OBJ2. Proc. POPL 1985.
Guttag J.V., Horowitz E. & Musser D.R. The design of data type specification. Current trends in programming methodology, vol. 1, ch.4. Prentice Hall (1977).
Guttag J.V. and Horning J.J. The Algebraic Specification of Abstract Data Types. Acta Informatica 10 (1978).
Huet G. & Hullot JM. Proofs by induction in equational theories with constructors. JCSS 25–2 (1982).
Huet G. & Oppen D.C. Equations and rewrite Rules: a survey. Technical Report, SRI International, 1980.
Jouannaud JP. & Kounalis E. Proofs by Induction in Equational Theories Without Constructors. CRIN, Nancy, France, May 1985.
Kapur D., Narendran P. & Zhang H. On sufficient completeness and related properties of term rewriting systems. Preprint October 1985.
Kounalis E. & Zhang H. A general Completeness Test for Equational Specifications CRIN Nancy, France, Nov. 1984.
Liskov B. & Zilles S. An introduction to formal specifications of data abstractions. Current trends in programming methodology vol. 1. Prentice Hall (1977).
Martelli A. & Montanari U. An efficient Unification algorithm ACM TOPLAS, vol.4, pp 258–282 (1982).
Meseguer J. & Goguen J.A. Initiality, Induction and Computability. To appear in ”Application of Agebra to Language Definition and Compilation”, M.Nivat & J.Reynolds (eds), Cambridge U.P.
Musser D. Convergent Sets of Rewrite Rules for Abstract Data Types. Report of USC Information Sciences Institute (1979).
Nipkov T. & Weikum G. A decidability result about sufficient completeness of axiomaticaly specified abstract data types. LNCS 145 (1982).
Paterson M.S. & Wegman M.N. Linear Unification. Journal of Computer and Systems Sciences. vol.16, pp 158–167 (1978).
Plaisted D. Semantic Confluence and Completion Methods. Information and Control 65 (1985) pp 182–215.
Remy J.L. Etude de systèmes de réecriture conditionnels & application aux types abstraits algébriques. Thèse, Nancy, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Comon, H. (1986). Sufficient completeness, term rewriting systems and ”anti-unification”. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_85
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive