Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable (1993)

by J. B. Wells
Citations:12 - 1 self

Active Bibliography

58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
135 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
3 Type Inference and Reconstruction for First Order Dependent Types – Neal Nelson, To Mary Alice, To Sherri - 1995
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
5 Recasting ML^F – Didier Le Botlan, Didier Rémy - 2007
69 Explicit Polymorphism and CPS Conversion – Robert Harper , Mark Lillibridge - 1992
Type Theory for Programming Languages – Robert Harper - 1994
26 Rank 2 Type Systems and Recursive Definitions – Trevor Jim - 1995
3 Type-Secure Meta-Programming – Christopher Bentley Dornan - 1998
9 Typability is undecidable for F+eta – J. B. Wells - 1995
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
22 Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract) – Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells - 1999
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
AT DIFFERENT RANKS – Santiago M. Pericas-geertsen, Assaf J. Kfoury, Ph. D, Santiago M. Pericas-geertsen - 1999