Active Bibliography

135 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
25 Type inference and semi-unification – Friedrich Henglein, Friedrich Henglein - 1988
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
25 Extensions and Applications of Higher-order Unification – Conal M. Elliott - 1990
12 Typability and Type Checking in the Second-Order lambda-Calculus Are Equivalent and Undecidable – J. B. Wells - 1993
2 Towards a Practical Programming Language Based on the Polymorphic Lambda Calculus – Peter Lee, Mark Leone, Spiro Michaylov, Frank Pfenning - 1989
67 Programming with Intersection Types and Bounded Polymorphism – Benjamin C. Pierce - 1991
3 Type Inference and Reconstruction for First Order Dependent Types – Neal Nelson, To Mary Alice, To Sherri - 1995
1 ML Has Principal Typings – Carlos Camarão, Lucília Figueiredo - 2005
Type-Reconstruction wit First-Class Polymorphic Values – James William O'Toole, Jr., David K. Gifford
5 Recasting ML^F – Didier Le Botlan, Didier Rémy - 2007
11 Type Reconstruction with First-Class Polymorphic Values – James William O'Toole, Jr., David K. Gifford - 1989
Type Theory for Programming Languages – Robert Harper - 1994
28 The complexity of type inference for higher-order typed lambda calculi – Fritz Henglein, Harry G. Mairson - 1991
17 Higher-order Unification with Dependent Function Types – Conal M. Elliott - 1989
14 From Hindley-Milner types to first-class structures – Mark P. Jones - 1995
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007