Typability is undecidable for F+eta (1995)

by J. B. Wells
Citations:9 - 6 self

Documents Related by Co-Citation

78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
103 Polymorphic type inference and containment – J C Mitchell - 1984
22 Typability and type-checking in the second-order λ-calculus are equivalent and undecidable – J B Wells - 1994
86 Polymorphic Type Inference – D Leivant - 1983
58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
13 The undecidability of Mitchell’s subtyping relation – J B Wells - 1995
54 A modular, polyvariant, and type-based closure analysis – Anindya Banerjee
94 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
237 Interprétation Fonctionnelle et Elimination des Coupures dans l’Arithmétique d’Ordre Supérieur – J-Y Girard - 1972
363 Towards a theory of type structure – J C Reynolds - 1974
19 Finitely stratified polymorphism – D Leivant - 1991
21 MLF: Une extension de ML avec polymorphisme de second ordre et instanciation implicite – D LE BOTLAN - 2004
23 partial type-inference for System F based on type-containment – Simple
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
56 Colored Local Type Inference – Martin Odersky, Matthias Zenger, Matthias Zenger - 2001
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
22 Botlan and Didier Rémy. MLF: Raising ML to the power of System-F – Didier Le - 2003
166 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
91 Practical type inference for arbitrary-rank types – Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton-jones - 2005