Abstract
We consider the problem of Knuth-Bendix-like completion for specifications with conditional equations for the particular case of achieving ground confluence. Inductive theorems of the given specification will be used for proving the convergence of critical pairs. The theorems may have the form of arbitrary first-order formulas, allowing for expressing properties of the theory that could otherwise not be specified equationally. A completion procedure will be given and demonstrated to be useful on examples which previous approaches fail to handle. Finally, an application of these ideas to parameterized specifications will be indicated.
This work is partially supported by the ESPRIT-project PROSPECTRA, ref#390.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8. References
Dershowitz, N.: Applications of the Knuth-Bendix completion procedure. Aerospace Report ATR-83(8478)-2, The Aerospace Corp., El Segundo, Calif., USA, 1983.
Drosten, K.: Towards executable specifications using conditional axioms. Report 83-01, T.U. Braunschweig, 1983.
Ehrig, H., Kreowski, H.-J., Thatcher, J.W., Wagner, E.G., and Wright, J.B.: Parameter passing in algebraic specification languages. LNCS 134, Springer 1981.
Ehrig, H., Wagner, E.G., Thatcher, J.W.: Algebraic specifications with generating constraints. Proc. ICALP 83, LNCS 154, 1983, 188–202.
Fay, M.: First-order unification in equational theories. 4th Workshop on Automated Deduction, Austin, 1979, 161–167.
Fribourg, L.: A strong restriction of the inductive completion procedure. Proc. ICALP 86, LNCS, 105–115.
Hsiang, J. and Dershowitz, N.: A term rewriting theorem prover. Proc. 10th ICALP, 1983, 331–346.
Huet, G.: A complete proof of the correctness of the Knuth-Bendix completion algorithm. JCSS 23 (1981), 11–21.
Hullot, J.M.: Canonical forms and unification. 5th Workshop on Automated Deduction, Les Arcs, 1980, 318–334.
Jouannaud, J.P., and Waldmann, B.: Reductive conditional term rewriting systems. Proc. 3rd TC2 Working Conference on the Formal Description of Prog. Concepts, Ebberup, Denmark, Aug. 1986, North-Holland, to appear.
Kaplan, St.: Conditional rewrite rules. TCS 33 (1984), 175–193.
Kaplan, St.: Fair conditional term rewrite systems: unification, termination and confluence. Report 194, U. de Paris-Sud, Centre d'Orsay, Nov. 1984.
Kapur, D., Narendran, P., and Sivakumar, G.: A path ordering for proving termination of term rewrite systems. LNCS 186, 1985, 173–187.
Lescanne, P.: Computer experiments with the REVE term rewriting system generator. Proc. 10th ACM Symp. on POPL, Austin, Texas, 1983.
Pletat, U., Engels, G., and Ehrich, H.-D.: Operational semantics of algebraic specifications with conditional equations. Proc. 7th CAAP, LNCS, 1982.
Rety, P., Kirchner, C., Kirchner, H., and Lesanne, P.: NARROWER, a new algorithm for unification and its application to logic programming. Conf. on Rewriting Techniques and Applications, Dijon 1985, LNCS 202, 141–157.
Remy, J.L. and Zhang, H.: REVEUR 4: A system for validating conditional algebraic specifications of abstract data types. Proc. 6th ECAI, Pisa 1984, 563–572.
Zhang, H. and Remy, J.L.: Contextual rewriting. Conf. on Rewriting Techniques and Applications, Dijon 1985, LNCS 202
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganzinger, H. (1987). Ground term confluence in parametric conditional equational specifications. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039613
Download citation
DOI: https://doi.org/10.1007/BFb0039613
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17219-2
Online ISBN: 978-3-540-47419-7
eBook Packages: Springer Book Archive