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

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

Documents Related by Co-Citation

378 Towards a theory of type structure – J C Reynolds - 1974
1184 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1984
985 A theory of type polymorphism in programming – Robin Milner - 1978
299 Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur – Jean-Yves Girard - 1972
669 Light Linear Logic – Jean-yves Girard
552 Lambda Calculi with Types – Henk Barendregt - 1993
760 Types and Programming Languages – Benjamin C Pierce - 2002
1305 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
798 On understanding types, data abstraction, and polymorphism – Luca Cardelli, Peter Wegner - 1985