Advertisement

Unification in typed lambda calculus

  • Gérard Huet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 37)

Abstract

This paper discusses the problem of finding common instances to terms in typed λ-calculus. It is shown that here the notion of most general unifier must be extended. Complete sets of unifiers are defined, and their structure with respect to substitution composition is studied.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    Andrews P.B., (1971): “ Resolution in type theory”. Journal of Symbolic Logic 36, 3 pp. 414–432.Google Scholar
  2. [2]
    Church A. (1940): “A formulation of the simple theory of types” Journal of Symbolic Logic 5,1 pp. 56–68.Google Scholar
  3. [3]
    Church A. (1941): “The calculi of lambda-conversion”. Annals of Mathematical Studies n∘6. Princeton University Press.Google Scholar
  4. [4]
    Curry H.B., Feys R., Craig W. (1958): Combinatory Logic, vol 1, North Holland.Google Scholar
  5. [5]
    Darlington J.L., (1971): “A partial mechanization of second-order logic”. Machine Intelligence 6, pp. 91–100. American Elsevier, New York.Google Scholar
  6. [6]
    Darlington J.L. (1973): “Automatic program synthesis in second-order logic”. Proceedings 3rd IJCAI, Stanford August 73.Google Scholar
  7. [7]
    Ernst G.W. (1971): “A matching procedure for type theory”. Personal communication.Google Scholar
  8. [8]
    Gould W.E. (1966): “A matching procedure for ω-order logic”. Scientific report n∘4, AFCRL 666-781. Contrat AF 19(628)-3250.AD 646-560.Google Scholar
  9. [9]
    Guard J.R. (1964): “Automated logic for semi-automated mathematics”. Scientific report n∘1, AFCRL-64-411. Contrat AF 19(628)-3250. AD 602 710.Google Scholar
  10. [10]
    Huet G.P. (1973): “The undecidability of unification in third order logic”. Information and Control 22,3 pp. 257–267.Google Scholar
  11. [11]
    Huet G.P. (1973): “A mechanization of type theory”. Proceedings of 3rd IJCAI, Stanford August 73.Google Scholar
  12. [12]
    Huet G.P. (1975): “A unification algorithm for typed λ-calculus”. Theoretical Computer Science 1,1.Google Scholar
  13. [13]
    Lucchesi C.L. (1972): “The undecidability of the unification problem for third order languages”. Report CSRR 2059, Dept. of Applied Analysis and Computer Science. University of Waterloo.Google Scholar
  14. [14]
    Pietrzykowski T. (1971): “A complete mechanization of second order logic”. Journal of Assoc. for Comp. Mach. 20,2 pp. 333–364.Google Scholar
  15. [15]
    Pietrzykowski T. and Jensen D. (1972): “ A complete mechanization of ω-order type theory”. Association for computing Machinery National Conference 1972, vol.1, pp. 82–92.Google Scholar
  16. [16]
    Plotkin G.D. (1972): “Building-in equational theories”. Machine Intelligence 7, pp. 73–90. American Elsevier. New York.Google Scholar
  17. [17]
    Robinson J.A. (1965): “A machine-oriented logic based on the resolution principle”. Journal of Assoc. for Comp. Mach. 12,1, pp.23–41.Google Scholar
  18. [18]
    Sanchis L.E. (1967): “Functionals defined by recursion”. Notre Dame Journal of Formal Logic VIII, 3 pp. 161–174.Google Scholar
  19. [19]
    Jensen D. & Pietrzykowski T. (1973): “Mechanizing ω-order type theory through unification”. Report CS-73-16, Dept. of Applied Analysis and Computer Science, University of Waterloo.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Gérard Huet
    • 1
  1. 1.IRIA-LaboriaFrance

Personalised recommendations