What Are Principal Typings and What Are They Good For?

What Are Principal Typings and What Are They Good For? (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Trevor Jim

Citations:

88 - 0 self

BibTeX

@MISC{Jim95whatare,
    author = {Trevor Jim},
    title = {What Are Principal Typings and What Are They Good For?},
    year = {1995}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection types and is closely related to ML. Its principal typing property provides elegant support for separate compilation, including "smartest recompilation" and incremental type inference, and for accurate type error messages. Moreover, it motivates a novel rule for typing recursive definitions that can type many examples of polymorphic recursion.

Citations

288	Subtyping recursive types - Amadio, Cardelli
203	Type inclusion constraints and type inference - Aiken, Wimmers - 1993
200	A filter lambda model and the completeness of type assignment - Barendregt, Coppo, et al. - 1983
158	Solving Equations in Abstract Algebras: A RuleBased Survey of Unification - Jouannaud, Kirchner - 1991
129	Type inference with polymorphic recursion - Henglein - 1993
125	Qualified types: theory and practice - Jones - 1992
104	Lazy functional state threads - Launchbury, Jones - 1994
95	Type inference with simple subtypes - Mitchell - 1991
92	Type Assignment in Programming Languages - Damas - 1984
86	Polymorphic Type Schemes and Recursive Definitions - Mycroft - 1984
82	Polymorphic type inference - Leivant - 1983
76	Type inference for recursively constrained types and its application to object-oriented programming - Eifrig, Smith, et al. - 1995
74	A simple algorithm and proof for type inference - Wand - 1987
70	A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus - Kfoury, Wells - 1994
67	Finding the source of type errors - Wand - 1986
60	Smartest recompilation - Shao, Appel - 1993
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
43	Fully dynamic biconnectivity and transitive closure - Henzinger, King - 1995
41	Type inference with recursive types: syntax and semantics - Coppo, Dezani-Ciancaglini, et al.
40	Principal type schemes for functional programs with overloading and subtyping - Smith - 1994
40	An analysis of ML typability - Kfoury, Tiuryn, et al. - 1994
24	Rank-2 type systems and recursive definitions - Jim - 1995
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
16	On-line graph algorithms for incremental compilation - Marchetti-Spaccamela, Nanni, et al. - 1993
11	Quali ed Types: Theory and Practice - Jones - 1994
10	A proper extension of ML with an effective type-assignment - Kfoury, Tiuryn, et al. - 1988
8	Polymorphic type schemes and recursive de nitions - Mycroft - 1984
6	Embedding a second-order type system into an intersection type system - Yokouchi - 1995
6	A lter lambda model and the completeness of type assignment - Barendregt, K
5	An incremental type inference system for the programming language Id - Gupta - 1990
4	Type reconstruction in nite rank fragments of the second-order -calculus - Kfoury, Tiuryn - 1992
3	Typing in the presence of overloading, subtyping, and recursive types - Kaes - 1992
3	A proper extension of ML with an e ective type-assignment - Kfoury, Tiuryn, et al. - 1988
1	Rank 2 type systems and recursive de nitions - Jim - 1995