A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus (1993)

by A. J. Kfoury , J. B. Wells
Citations:78 - 14 self

Documents Related by Co-Citation

94 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
86 Polymorphic Type Inference – D Leivant - 1983
103 Polymorphic type inference and containment – J C Mitchell - 1984
52 Principality and Decidable Type Inference for Finite-Rank Intersection Types – A. J. Kfoury, J. B. Wells - 1999
47 Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems – S van Bakel - 1993
27 On the undecidability of partial polymorphic type reconstruction – Frank Pfenning - 1992
9 Typability is undecidable for F+eta – J. B. Wells - 1995
363 Towards a theory of type structure – J C Reynolds - 1974
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
357 Principal type-schemes for functional programs. Pages 207–212 of – Luis Damas, Robin Milner - 1982
135 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
164 Solving Equations in Abstract Algebras: a Rule-Based Survey of Unification – J-P Jouannaud, C Kirchner - 1991
33 Functional characters of solvable terms – M Coppo, M Dezani-Ciancaglini, B Venneri - 1981
59 Principal type schemes for an extended type theory – Ronchi della Rocca, S, B Venneri - 1984
58 Typability and Type Checking in System F Are Equivalent and Undecidable – J. B. Wells - 1998
234 Principal type schemes for functional programs – R Milner - 1982
54 A modular, polyvariant, and type-based closure analysis – Anindya Banerjee
16 Type reconstruction in Fω – P Urzyczyn - 1997
237 Interprétation Fonctionnelle et Elimination des Coupures dans l’Arithmétique d’Ordre Supérieur – J-Y Girard - 1972