|
88
|
What Are Principal Typings and What Are They Good For?
– Trevor Jim
- 1995
|
|
82
|
Polymorphic type inference
– Daniel Leivant
- 1983
|
|
96
|
Polymorphic type inference and containment
– J-C MITCHELL
- 1988
|
|
50
|
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
– S van Bakel
- 1993
|
|
26
|
On the undecidability of partial polymorphic type reconstruction
– Frank Pfenning
- 1992
|
|
9
|
Typability is undecidable for F+eta
– J. B. Wells
- 1995
|
|
339
|
Towards a theory of type structure
– J C Reynolds
|
|
323
|
Principal type-schemes for functional programs
– Luis Damas, Robin Milner
- 1982
|
|
91
|
Putting Type Annotations to Work
– Martin Odersky, Konstantin Läufer
- 1996
|
|
129
|
Type Inference with Polymorphic Recursion
– Fritz Henglein
- 1991
|
|
158
|
Solving Equations in Abstract Algebras: A RuleBased Survey of Unification
– J P Jouannaud, C Kirchner
- 1991
|
|
55
|
Principal type schemes for an extended type theory
– S Ronchi Della Rocca, B Venneri
- 1984
|
|
32
|
Functional characters of solvable terms
– M Coppo, M Dezani-Ciancaglini, B Venneri
- 1981
|
|
51
|
Typability and Type Checking in System F Are Equivalent and Undecidable
– J. B. Wells
- 1998
|
|
221
|
Principal type schemes for functional programs
– L Damas, H Milner
- 1982
|
|
53
|
A modular, polyvariant, and type-based closure analysis
– Anindya Banerjee
|
|
16
|
Type reconstruction in Fω
– P Urzyczyn
- 1997
|
|
221
|
Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII
– Jean-Yves Girard
- 1972
|
