Advertisement

Type reconstruction in Fω is undecidable

  • Paweł Urzyczyn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 664)

Abstract

We investigate the Girard's calculus Fω as a “Curry style” type assignment system for pure lambda terms. We prove that the type-reconstruction problem for Fω is undecidable (even with quantification restricted to constructor variables of rank 1). In addition, we show an example of a strongly normalizable pure lambda term that is untypable in Fω.

Keywords

Turing Machine Type Inference Lambda Calculus Polymorphic Type Constructor Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Barendregt, H.P., Hemerik, K., Types in lambda calculi and programming languages, Proc. ESOP'90, pp. 1–35.Google Scholar
  2. [2]
    Boehm, H.J., Partial polymorphic type inference is undecidable, Proc. 26th FOCS, 1985, pp. 339–345.Google Scholar
  3. [3]
    Coquand, T., Metamathematical investigations of a calculus of constructions, in: Logic in Computer Science (Odifreddi, ed.), Acad. Press, 1990, pp. 91–122.Google Scholar
  4. [4]
    Gallier, J. H., On Girard's “Candidats de Reductibilité”, in: Logic in Computer Science, (Odifreddi, ed.), Acad. Press, 1990, pp. 123–203.Google Scholar
  5. [5]
    Giannini, P., Ronchi Della Rocca, S., Characterization of typings in polymorphic type discipline, Proc. 3rd LICS, 1988, pp. 61–70.Google Scholar
  6. [6]
    Giannini, P., Ronchi Della Rocca, S., Type inference in polymorphic type discipline, Proc. Theoretical Aspects of Computer Software (Ito, Meyer, eds.), LNCS 526, Springer, Berlin, 1991, pp. 18–37.Google Scholar
  7. [7]
    Giannini, P., Ronchi Della Rocca, S., Honsell, F., Type inference: some results, some problems, manuscript, 1992, to appear in Fundamenta Informaticae.Google Scholar
  8. [8]
    Girard, J.-Y., The system F of variable types fifteen years later Theoret. Comput. Sci., 45 (1986), 159–192.Google Scholar
  9. [9]
    Henglein, F., A lower bound for full polymorphic type inference: Girard/Reynolds typability is DEXPTIME-hard, Technical Report RUU-CS-90-14, University of Utrecht, April 1990.Google Scholar
  10. [10]
    Henglein, F., Mairson, H.G., The complexity of type inference for higher-order typed lambda calculi, Proc. 18th POPL, 1991, pp. 119–130.Google Scholar
  11. [11]
    Kfoury, A.J. and Tiuryn, J., Type reconstruction in finite-rank fragments of the second-order λ-calculus, Information and Computation, vol. 98, No. 2, 1992, 228–257.Google Scholar
  12. [12]
    Kfoury, A.J., Tiuryn, J. and Urzyczyn, P., An analysis of ML typability, to appear in Journal of the ACM (preliminary version in Proc. CAAP/ESOP'90).Google Scholar
  13. [13]
    Kfoury, A.J., Tiuryn, J. and Urzyczyn, P., The undecidability of the semiunification problem, to appear in Information and Computation (preliminary version in Proc. STOC'90).Google Scholar
  14. [14]
    Kanellakis, P.C., Mitchell, J.C., Polymorphic unification and ML typing, Proc. 16th POPL, 1989, pp. 105–115.Google Scholar
  15. [15]
    Kanellakis, P.C., Mairson H.G.; Mitchell J.C., Unification and ML type reconstruction, Chapter 13 in Computational Logic, Essays in Honor of Alan J. Robinson, (J-L. Lassez and G. Plotkin eds), MIT Press, 1991.Google Scholar
  16. [16]
    Krivine, J.L., Un algorithme non typable dans le système F, F.C.R. Acad. Sci. Paris, Série I, 304 (1987), 123–126.Google Scholar
  17. [17]
    Leivant, D., Polymorphic type inference, Proc. 10th POPL, 1983, pp. 88–98.Google Scholar
  18. [18]
    Mairson, H.G., Deciding ML typability is complete for deterministic exponential time, Proc. 17th POPL, 1990, pp. 382–401.Google Scholar
  19. [19]
    Malecki, S., Generic terms having no polymorphic types, Proc. 17th ICALP, LNCS 443, Springer, Berlin, 1990, pp. 46–59.Google Scholar
  20. [20]
    Pfenning, F., Partial polymorphic type inference and higher-order unification, Proc. Lisp and Functional Programming, 1988, pp. 153–163.Google Scholar
  21. [21]
    Pierce, B., Dietzen, S., Michaylov, S., Programming in higher-order typed lambda calculi, Research Report CMU-CS-89-111, Carnegie-Mellon University, 1989.Google Scholar
  22. [22]
    Urzyczyn, P., Type reconstruction in F ω, Research Report BU-CS-92-014, Boston University, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Paweł Urzyczyn
    • 1
  1. 1.Institute of InformaticsUniversity of WarsawWarszawaPoland

Personalised recommendations