Program synthesis by completion with dependent subtypes

  • Paul Jacquet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


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.

Key words and phrases

Program Synthesis Conditional and Order Sorted Rewriting 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N. Dershowitz. Computing with Rewrite Systems. Information and Control Vol.65, No 2/3, May/June 1985.Google Scholar
  2. [2]
    J.L. Bates and R.L. Constable. Proofs as programs. TR 82-530, Dept. of Computer Science, Cornell University, March 1983.Google Scholar
  3. [3]
    W. Bibel. Syntax-directed, semantics-supported program synthesis. Artificial Intelligence 14, 1980, pp. 234–261.CrossRefGoogle Scholar
  4. [4]
    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.CrossRefGoogle Scholar
  5. [5]
    G. Smolka and H. Aït-Kaci. Inheritance Hierarchies: Semantics and Unification. MCC Technical report AI-057-87.Google Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    H. Zhang and J-L. Remy. Contextual Rewriting. Proc. 1st. Conference on Rewriting Techniques and Applications.LNCS 202, pp. 46–62, 1985.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    M. Navarro and F. Orejas. On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems. Eurosam 84, Oxford.Google Scholar
  12. [12]
    R.J. Cunningham and A.J.J. Dick. Rewrite Systems on a lattice of types. Acta Informatica 22, 1985, pp. 149–169.CrossRefGoogle Scholar
  13. [13]
    C. Walther. A classification of many-sorted unification problems. Proc. 8nth International Conference on Automated deduction,LNCS 230, 1986, pp. 525–537.Google Scholar
  14. [14]
    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.Google Scholar
  15. [15]
    D.Bert and R.Echaed. Design and implementation of a generic, logic and functional programming anguage. Proc. ESOP'86, LNCS 213, pp. 119–132.Google Scholar
  16. [16]
    M. Schmidt-Schauß. Unification in many-sorted equational theoriesProc. 8nth International Conference on Automated deduction, LNCS 230, 1986, pp. 538–552.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Paul Jacquet
    • 1
  1. 1.LIFIA-IMAG Institut National PolytechniqueGrenoble cedexFrance

Personalised recommendations