Typability and Type Checking in System F Are Equivalent and Undecidable (1998)

Cached

Download Links

by J. B. Wells
Venue:Annals of Pure and Applied Logic
Citations:58 - 4 self

Active Bibliography

12 Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable – J. B. Wells - 1993
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
5 Recasting ML^F – Didier Le Botlan, Didier Rémy - 2007
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
26 Rank 2 Type Systems and Recursive Definitions – Trevor Jim - 1995
9 Typability is undecidable for F+eta – J. B. Wells - 1995
135 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
86 The Essence of Principal Typings – J. B. Wells - 2002
28 The complexity of type inference for higher-order typed lambda calculi – Fritz Henglein, Harry G. Mairson - 1991
25 Type inference and semi-unification – Friedrich Henglein, Friedrich Henglein - 1988
47 First-class Polymorphism with Type Inference – Mark P. Jones
69 Explicit Polymorphism and CPS Conversion – Robert Harper , Mark Lillibridge - 1992
Type Theory for Programming Languages – Robert Harper - 1994
3 Type-Secure Meta-Programming – Christopher Bentley Dornan - 1998
7 Hierarchies of Decidable Extensions of Bounded Quantification – Sergei Vorobyov - 1994
326 Theorems for free! – Philip Wadler - 1989
27 On the undecidability of partial polymorphic type reconstruction – Frank Pfenning - 1992
12 ML^F - Raising ML to the Power of System F – Didier Le Botlan, Didier Rémy - 2003
10 Raising ML to the Power of System F – Didier Le Botlan, Didier Remy - 2003