Abstract
In this paper we explore the possibility of specifying a restricted form of conditional equations within, what we call, a dependent subtypes discipline. Applying recent results on order sorted computation to the lattice structure of dependent subtypes we show how the Knuth-Bendix completion procedure can be used to synthesize a restricted class of programs, a subject which brought about this work.
This work has been partially supported by the CNRS (PRC Programmation et Outils pour l'IA).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. Dershowitz. Computing with Rewrite Systems. Information and Control Vol.65, No 2/3, May/June 1985.
J.L. Bates and R.L. Constable. Proofs as programs. TR 82-530, Dept. of Computer Science, Cornell University, March 1983.
W. Bibel. Syntax-directed, semantics-supported program synthesis. Artificial Intelligence 14, 1980, pp. 234–261.
Z. Manna and R.J. Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming languages and Systems Vol. 2, No. 1, January 1980, pp 90–121.
G. Smolka and H. Aït-Kaci. Inheritance Hierarchies: Semantics and Unification. MCC Technical report AI-057-87.
J-L. Remy and H. Zhang. REVEUR4: A system for validating conditional algebraic specifications of abstract data types. Proc. of 6th ECAI, Pisa, pp. 563–572, 1984.
H. Zhang and J-L. Remy. Contextual Rewriting. Proc. 1st. Conference on Rewriting Techniques and Applications.LNCS 202, pp. 46–62, 1985.
J. Meseguer and J.A. Goguen. Initiality, induction, and computability. in Algebraic methods in semantics, M. Nivat and J.C. Reynolds, eds. Cambridge University Press, 1985, pp 459–541.
G. Huet and D.C. Oppen. Equations and rewrite rules: A survey. in Formal Language Theory: Perspectives and Open Problems. R. Book, ed. Academic Press, New York, 1980, pp 349–405.
J-L. Remy. Etudes des systèmes de réécriture conditionnelles et applications aux types abstraits algébriques. Thèse d'état, Université de Nancy 1, 1982.
M. Navarro and F. Orejas. On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems. Eurosam 84, Oxford.
R.J. Cunningham and A.J.J. Dick. Rewrite Systems on a lattice of types. Acta Informatica 22, 1985, pp. 149–169.
C. Walther. A classification of many-sorted unification problems. Proc. 8nth International Conference on Automated deduction,LNCS 230, 1986, pp. 525–537.
G. Smolka, W. Nutt, J. Meseguer and J.A. Goguen. Order-sorted equational computation. Presented at the Colloquium on the Resolution of Equations in Algebraic Structures. Lakeway, Texas, May 4–6 1987.
D.Bert and R.Echaed. Design and implementation of a generic, logic and functional programming anguage. Proc. ESOP'86, LNCS 213, pp. 119–132.
M. Schmidt-Schauß. Unification in many-sorted equational theoriesProc. 8nth International Conference on Automated deduction, LNCS 230, 1986, pp. 538–552.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacquet, P. (1988). Program synthesis by completion with dependent subtypes. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012856
Download citation
DOI: https://doi.org/10.1007/BFb0012856
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive