A Direct Algorithm for Type Inference in the Rank 2 Fragment of the Second-Order λ-Calculus (1994)

by A. J. Kfoury , J. B. Wells
Venue:In Proc. 1994 ACM Conf. LISP Funct. Program
Citations:78 - 14 self

Documents Related by Co-Citation

93 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
85 Polymorphic Type Inference – D Leivant - 1983
102 Polymorphic type inference and containment – John C Mitchell - 1988
51 Principality and Decidable Type Inference for Finite-Rank Intersection Types – A. J. Kfoury, J. B. Wells - 1999
46 Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems – Stephanus Johannes Van Bakel, Prof M. Dezani-ciancaglini, Voor Mijn Moeder Manuscriptcommissie, Della Rocca - 1993
27 On the undecidability of partial polymorphic type reconstruction – Frank Pfenning - 1992
9 Typability is undecidable for F+eta – J. B. Wells - 1995
364 Towards a theory of type structure – J C Reynolds - 1974
359 Principal type-schemes for functional programs – Luis Damas, Robin Milner - 1982
95 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
136 Type Inference with Polymorphic Recursion – Fritz Henglein - 1991
162 Solving equations in abstract algebras: a rule-based survey of unification – J-P Jouannaud, C Kirchner - 1991
33 and B.Venneri (1981), Functional Characters of Solvable Terms, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik – M Dezani-Ciancaglini M Coppo
58 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 – L Damas, R Milner - 1982
54 A modular, polyvariant, and type-based closure analysis – Anindya Banerjee
16 Type reconstruction in Fω – P Urzyczyn - 1997
238 Interprétation fonctionnelle et elimination des coupures de l’arithmétique d’ordre supérieur. Thèse d’état, Université de Paris 7 – J-Y Girard - 1972