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

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

Documents Related by Co-Citation

337 Towards a theory of types structure – John C Reynolds - 1974
251 Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur – Jean-Yves Girard - 1972
51 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
70 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
220 Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur – J Y Girard - 1972
35 The Standard ML Core language – Robin Milner - 1984
40 An analysis of ML typability – A J Kfoury, J Tiuryn, P Urzyczyn - 1994
18 Finitely stratified polymorphism – Daniel Leivant - 1991
42 Type inference with constrained types – Martin Odersky, Martin Sulzmann, Martin Wehr - 1997
578 Types and Programming Languages – Benjamin C Pierce - 2002
82 Polymorphic type inference – Daniel Leivant - 1983
92 Type Assignment in Programming Languages – L Damas - 1984
97 Bounded Quantification is Undecidable – Benjamin C. Pierce - 1993
88 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
79 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
32 A versatile constraint-based type inference system – F Pottier - 2000
996 The Lambda Calculus, Its Syntax and Semantics – Henk P Barendregt - 1984
11 Parsing Using Combinators – G Hutton - 1998
3 A Formal Basis for the Perception of Programming as a Language Design Activity – Paul A. Bailes, Trevor Chorvat, Ian Peake - 1994