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

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

Documents Related by Co-Citation

363 Towards a theory of type structure – J C Reynolds - 1974
288 Interpretation Fonctionelle et Elimination des Coupures dans l'Arithmetique d'Ordre Superieure – J -Y Girard - 1972
19 Automatic synthesis of typed lambda-programs on term algebras – C Böhm, A Berarducci - 1985
58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
237 Interprétation Fonctionnelle et Elimination des Coupures dans l’Arithmétique d’Ordre Supérieur – J-Y Girard - 1972
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
939 A theory of type polymorphism in programming – Robin Milner - 1978
14 Light affine lambda calculus and polytime strong normalization. Archive for Mathematical Logic – Kazushige Terui - 2007
11 Light logic and polynomial time computation – Kazushige Terui - 2002
3 Simona Ronchi della Rocca. Principal typing in elementary affine logic – Paolo Coppola - 2003
3 Kazushige Terui. Verification of Ptime reducibility for system F terms via dual light affine logic – Vincent Atassi, Patrick Baillot
15 Typing lambda-terms in elementary logic with linear constraints – P Coppola, S Martini - 2001
8 A feasible algorithm for typing in elementary affine logic – Patrick Baillot, Kazushige Terui - 2005
19 Soft lambda-calculus: a language for polynomial time computation – Patrick Baillot, Virgile Mogbil - 2004
56 Light Affine Logic – A. Asperti - 1998
15 Checking polynomial time complexity with types – P Baillot - 2002
5 Light affine logic, uniform encodings and polynomial time – Ugo Dal Lago, Patrick Baillot
48 Soft Linear Logic and Polynomial Time – Yves Lafont - 2002