Typability is undecidable for F+eta (1995)

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

Documents Related by Co-Citation

70 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
96 Polymorphic type inference and containment – J-C MITCHELL - 1988
20 Typability and type-checking in the second-order λ-calculus are equivalent and undecidable – John B Wells - 1994
82 Polymorphic type inference – Daniel Leivant - 1983
51 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
11 The undecidability of Mitchell’s subtyping relation – J B Wells - 1995
88 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
53 A modular, polyvariant, and type-based closure analysis – Anindya Banerjee
339 Towards a theory of type structure – J C Reynolds
221 Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII – Jean-Yves Girard - 1972
18 Finitely stratified polymorphism – D Leivant - 1991
21 MLF: Une extension de ML avec polymorphisme de second ordre et instanciation implicite – D LE BOTLAN - 2004
21 Botlan and Didier Rémy. MLF: Raising ML to the power of System-F – Didier Le
21 partial type-inference for System F based on type-containment – Simple - 2005
79 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
29 Boxy types: inference for higher-rank types and impredicativity – D Vytiniotis, S Weirich, S Peyton Jones - 2006
78 Practical type inference for arbitrary-rank types – Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton-jones - 2005
150 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
53 Colored Local Type Inference – Martin Odersky, Matthias Zenger, Matthias Zenger - 2001