Typability is undecidable for F+eta (1995)

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

Active Bibliography

58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
12 Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable – J. B. Wells - 1993
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
86 The Essence of Principal Typings – J. B. Wells - 2002
Intersection, Universally Quantified, and Reference Types – Mariangiola Dezani-ciancaglini, Paola Giannini, Simona Ronchi, Della Rocca
2 Semantic Predicate Types and Approximation for Class-based Object Oriented Programming – Steffen Van Bakel, Reuben N. S. Rowe
7 Hierarchies of Decidable Extensions of Bounded Quantification – Sergei Vorobyov - 1994
65 Intersection Types and Computational Effects – Rowan Davies, Frank Pfenning - 2000
Subtyping Parametric and Dependent Types -- An introduction – Gang Chen, Giuseppe Longo - 1996
1 Subtyping Parametric and Dependent Types – Gang Chen, Giuseppe Longo - 1996
Products and Polymorphic Subtypes – Viviana Bono, Jerzy Tiuryn - 2002
52 Principality and Decidable Type Inference for Finite-Rank Intersection Types – A. J. Kfoury, J. B. Wells - 1999
Type soundness – François Pottier
An Optimized Complete Semi-Algorithm for System . . . – Christophe Raffalli, Universit De Savoie - 1999
26 Essential language support for generic programming – Jeremy Siek, Andrew Lumsdaine - 2005
5 Recasting ML^F – Didier Le Botlan, Didier Rémy - 2007
A TYPE SYSTEM FOR CALL-BY-NAME EXCEPTIONS – Sylvain Lebresne - 907
58 Translucent Sums: A Foundation for Higher-Order Module Systems – Mark Lillibridge - 1997
26 Rank 2 Type Systems and Recursive Definitions – Trevor Jim - 1995