Typability and type checking in system F are equivalent and undecidable

Annals of Pure and Applied Logic

Volumn 98, Issue 1-3, 1999, Pages 111-156

  Wells, J B ^a,b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Lambda calculus; Semi unification; System f; Typability; Type checking; Type inference

Indexed keywords

EID: 0033617885     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(98)00047-5     Document Type: Article

References (45)

1. H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, Revised Edn., North-Holland, Amsterdam, 1984.
2. H.P. Barendregt, Lambda calculi with types, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, chapter 2, Oxford University Press, Oxford, 1992. pp. 117-309.
3. H.-J. Boehm, Partial polymorphic type inference is undecidable, in: 26th Ann. Symp. on Foundations of Comput. Sci., IEEE Press, New York, 1985, pp. 339-345.
4. L. Cardelli, Typeful programming, in: Formal Description of Programming Concepts, Springer, Berlin, 1991. Also DEC SRC Research Report 45.
5. P. Giannini, F. Honsell, S. Ronchi Della Rocca, A Strongly Normalizable Term Having no Type in the System F (Second Order λ-Calculus), Rapporto interno, Univ. di Torino, 1987.
6. P. Giannini, F. Honsell, S. Ronchi Della Rocca, Type Inference: Some Results, Some Problems, Fund. Inform. 19(1/2) (1993) 87-125.
7. J.-Y. Girard, Interprétation Fonctionnelle et Elimination des Coupures de l'Arithmétique d'Ordre Supérieur, Thèse d'Etat, Université de Paris VII, 1972.
8. J.-Y. Girard, Y. Lafont, P. Taylor, Proofs and types. Cambridge Tracts in Theoretical Computer Science, vol. 7, Cambridge Univ. Press, Cambridge, 1989.
9. W.D. Goldfarb, Undecidability of the second-order unification problem, Theoret. Comput. Sci. 13 (1981) 225-230.
10. P. Giannini, S. Ronchi Della Rocca, Characterization of typings in polymorphic type discipline, in: Proc. 3rd Ann. Symp. Logic in Computer Sci., Edinburgh, Scotland, July 5-8, 1988, pp. 61-70.
11. P. Giannini, S. Ronchi Della Rocca, Type inference in polymorphic type discipline, in: Theoretical Aspects Comput. Softw.: Internat. Conf., Lecture Notes in Computer Science, vol. 526, Springer, Berlin, 1991, pp. 18-37.
12. F. Henglein, H.G. Mairson, The complexity of type inference for higher-order typed lambda calculi, in: Conf. Rec. 18th Ann. ACM Symp. Principles of Programming Languages, Jan. 1991, pp. 119-130. An expanded version appeared as [13].
13. F. Henglein, H.G. Mairson, The complexity of type inference for higher-order typed lambda calculi, J. Funct. Prog. 4 (4) (1994) 435-477. First appeared as [12].
14. R. Hindley, The principal type scheme of an object in combinatory logic, Trans. AMS (1969).
15. P.K. Hooper, The undecidability of the turing machine immortality problem, J. Symbolic Logic 31 (2) (1966) 219-234.
16. P. Hudak, P.L. Wadler, Report on The Functional Programming Language Haskell, Technical Report YALEU/DCS/RR656, Yale University, 1988.
17. T. Jim, Type Inference in System F Plus Subtyping, Manuscript, Dec. 1995.
18. A.J. Kfoury, J. Tiuryn, Type reconstruction in finite-rank fragments of the second-order λ-calculus, Inform. and Comput. 98 (2) (1992) 228-257.
19. A.J. Kfoury, J. Tiuryn, P. Urzyczyn, The undecidability of the semi-unification problem, Inform and Comput. 102 (1) (1993) 83-101.
20. A.J. Kfoury, J.B. Wells, A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus, in: Proc. 1994 ACM Conf. on LISP Funct. Program., 1994.
21. D. Leivant, Polymorphic type inference, in: Conf. Rec. 10th Ann. ACM Symp. on Principles of Programming Languages, 1983, pp. 88-98.
22. D. Leivant, Finitely stratified polymorphism, Inform and Comput. 93 (1) (1991) 93-113.
23. D. MacQueen, R. Sethi, A semantic model of types for applicative languages, in: Proc. ACM Symp. LISP and Funct. Program., 1982, pp. 243-252.
24. N. McCracken, The typechecking of programs with implicit type structure, in: Semantics of Data Types: Int. Symp., Lecture Notes in Computer Science, vol. 173, Springer, Berlin, 1984, pp. 301-315.
25. R. Milner, M. Tofte, R. Harper, The Definition of Standard ML, MIT Press, Cambridge, MA, 1990.
26. M. Minsky, Recursive unsolvability of post's problem of 'tag' and other topics in the theory of turing machines, Ann. Math. 74 (3) (1961) 437-455.
27. J.C. Mitchell, Polymorphic type inference and containment, Inform and Comput. 76(2/3) (1988) 211-249.
28. F. Pfenning, On the undecidability of partial polymorphic type reconstruction, Fund. Inform. 19 (1,2) (1993) 185-199.
29. F. Pfenning, P. Lee, LEAP: A language with eval and polymorphism, in: Proc. 3rd Int. Joint Conf. on Theory and Practice of Software Development, Springer, Berlin, 1989.
30. D. Prawitz, Natural Deduction; A Proof-theoretical Study, Stockholm Studies in Philosophy, No. 3, Almqvist and Wiksell, Stockholm, 1965.
31. Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, 1994.
32. P. Pudlák, On a unification problem related to kreisel's conjecture, Commentationes Mathematicae Universitatis Carolinae 29 (3) (1988) 551-556, Prague, Czechoslovakia.
33. J.C. Reynolds, Towards a theory of type structure, in: Symp. on Programming, Paris, France, Lecture Notes in Computer Science, vol. 19, Springer, Berlin, 1974, pp. 408-425.
34. A. Schubert, Second-order unification and type inference for church-style polymorphism, In: Conf. Rec. POPL '98: 25th ACM Symp. on Principles of Programming Languages, 1998.
35. J. Tiuryn, P. Urzyczyn, The Subtyping Problem for Second-Order Types is Undecidable, Tech. rep., Univ. of Warsaw, Nov. 1995.
36. J. Tiuryn, P. Urzyczyn, The subtyping problem for second-order types is undecidable, in: Proc. 11th Ann. IEEE Symp. on Logic in Computer Sci., 1996. Shorter Proceedings version of [35].
37. D.A. Turner, Miranda: A non-strict functional language with polymorphic types, in: IFIP Int. Conf. Funct. Program. Comput. Arch., Lecture Notes in Computer Science, vol. 201, Springer, Berlin, 1985.
38. P. Urzyczyn, The Emptiness Problem for Intersection Types, Technical Report, Inst. of Informatics, Univ. of Warsaw, Poland, Nov. 1993.
39. (1) is undecidable, in: Proc. Int. Conf. on Typed Lambda Calculi and Applications, 1993, pp. 418-432.
40. P. Urzyczyn, The emptiness problem for intersection types, in: Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, 1994, pp. 300-309.
41. (1), Math. Struct. Comput. Sci. 7 (4) (1997) 329-358.
42. J.B. Wells, Typability and type checking in the second-order λ-calculus are equivalent and undecidable, in: Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, 1994.
43. J.B. Wells, The Undecidability of Mitchell's Subtyping Relation, Tech. Rep., Computer Science Dept., Boston Univ., Dec. 1995.
44. J.B. Wells, Typability is Undecidable for F+eta, Tech. Rep., Computer Science Deptartment, Boston Univ., Mar. 1996.
45. J.B. Wells, Type Inference for System F with and without the Eta Rule, Ph.D. thesis, Boston Univ., 1996.