Abstract

We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence is that typability in the rank 2 intersection system is DEXPTIME-complete. We introduce a rank 2 system combining intersections and polymorphism, and prove that it types exactly the same terms as the other rank 2 systems. The combined system suggests a new rule for typing recursive definitions. The result is a rank 2 type system with decidable type inference that can type some interesting examples of polymorphic recursion. Finally,we discuss some applications of the type system in data representation optimizations such as unboxing and overloading.

Citations

1497	The Definition of Standard ML - Milner, Tofte, et al. - 1997
428	A note on inductive generalization - Plotkin - 1970
339	Towards a theory of type structure - Reynolds
211	Unification revisited - Lassez, Maher, et al. - 1988
195	Une extension de l’interprétation de Gödel à l’analyse et son application à l’élimination des coupures dans l’analyse et la théorie des types - Girard - 1970
182	The Lambda Calculus: Its Syntax and Semantics, revised Edition - Barendregt - 1984
158	Solving Equations in Abstract Algebras: A RuleBased Survey of Unification - Jouannaud, Kirchner - 1991
129	Type inference with polymorphic recursion - Henglein - 1993
108	Unification Theory - Siekmann - 1989
97	Unification: a multidisciplinary survey - Knight - 1989
93	Transformational systems and the algebraic structure of atomic formulas - Reynolds - 1970
90	A simple applicative language: Mini-ml - Clément, Despeyroux, et al. - 1986
88	Operational semantics and polymorphic type inference - Tofte - 1988
86	Polymorphic Type Schemes and Recursive Definitions - Mycroft - 1984
84	The De nition of Standard ML - Milner, Tofte, et al. - 1997
82	Polymorphic type inference - Leivant - 1983
70	A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus - Kfoury, Wells - 1994
55	Type reconstruction in the presence of polymorphic recursion - Kfoury, Tiuryn, et al. - 1993
47	Deciding ML typability is complete for deterministic exponential time - Mairson - 1990
46	Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems - Bakel - 1993
40	An analysis of ML typability - Kfoury, Tiuryn, et al. - 1994
25	Typability and Type Checking in the Second-Order - Calculus Are Equivalent and Undecidable. submitted to APAP - Wells - 1996
24	The typechecking of programs with implicit type structure - McCracken - 1984
17	Type reconstruction in finite rank fragments of second-order lambda calculus - Kfoury, Tiuryn - 1992
15	Designing unification procedures using transformations: A survey - Gallier, Snyder - 1990
12	Type reconstruction in finite-rank fragments of the second-order λ-calculus - Kfoury, Tiuryn - 1992
10	A proper extension of ML with an effective type-assignment - Kfoury, Tiuryn, et al. - 1988
9	New notions of reduction and non-semantic proofs of -strong normalization in typed -calculi - Kfoury, Wells - 1994
9	Uni cation revisited - Lassez, Maher, et al. - 1988
9	Uni cation theory - Baader, Snyder - 2001
8	Une extension de la th'eorie des types en -calcul - Sall'e - 1978
8	Polymorphic type schemes and recursive de nitions - Mycroft - 1984
6	A new type assignment for lambda-terms - Coppo, Dezani - 1978
6	Embedding a second-order type system into an intersection type system - Yokouchi - 1995
5	and Jorg Siekmann. Unification theory - Baader - 1994
5	Unboxing using specialisation - Hall, Peyton-Jones, et al. - 1996
5	A Proof Theory for General Unification, volume 11 - Snyder - 1991
4	Type reconstruction in nite rank fragments of the second-order -calculus - Kfoury, Tiuryn - 1992
4	Uni cation: a multidisciplinary survey - Knight - 1989
3	A proper extension of ML with an e ective type-assignment - Kfoury, Tiuryn, et al. - 1988
2	and Jörg Siekmann. Uni cation theory - Baader - 1994
1	Designing uni cation procedures using transformations: A survey - Gallier, Snyder - 1992
1	AProof Theory for General Uni cation, volume 11 - Snyder - 1991