Typability and Type Checking in System F Are Equivalent and Undecidable (1998)

Cached

Download Links

by J. B. Wells
Venue:Annals of Pure and Applied Logic
Citations:58 - 4 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
939 A theory of type polymorphism in programming – Robin Milner - 1978
94 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
54 A modular, polyvariant, and type-based closure analysis – Anindya Banerjee
702 Types and programming languages – Benjamin C Pierce - 2002
86 Polymorphic Type Inference – D Leivant - 1983
86 The Essence of Principal Typings – J. B. Wells - 2002
9 Typability is undecidable for F+eta – J. B. Wells - 1995
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
102 Bounded Quantification is Undecidable – Benjamin C. Pierce - 1993
363 Towards a theory of type structure – J C Reynolds - 1974
16 Inference of Polymorphic and Conditional Strictness Properties – Thomas P. Jensen - 1998
47 Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems – S van Bakel - 1993
59 Principal type schemes for an extended type theory – Ronchi della Rocca, S, B Venneri - 1984
30 Principal type scheme and unification for intersection type discipline – S Ronchi Della Rocca - 1988
52 Principality and Decidable Type Inference for Finite-Rank Intersection Types – A. J. Kfoury, J. B. Wells - 1999
605 The Definition of Standard ML (Revised – Robin Milner, Mads Tofte, Robert Harper, David Macqueen - 1997
237 Interprétation Fonctionnelle et Elimination des Coupures dans l’Arithmétique d’Ordre Supérieur – J-Y Girard - 1972
170 Towards a practical programming language based on dependent type theory – Ulf Norell - 2007