|
95
|
Polymorphic type inference and containment
– John C Mitchell
- 1988
|
|
20
|
Partial polymorphic type inference is undecidable
– H-J Boehm
- 1985
|
|
79
|
Partial polymorphic type inference and higher-order unification
– Frank Pfenning
- 1988
|
|
70
|
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
– A. J. Kfoury, J. B. Wells
- 1993
|
|
337
|
Towards a theory of types structure
– John C Reynolds
- 1974
|
|
58
|
Polymorphic Type Inference and Abstract Data Types
– Konstantin Läufer, Martin Odersky
- 1994
|
|
1497
|
The Definition of Standard ML
– R Milner, M Tofte, R Harper
- 1990
|
|
91
|
Putting Type Annotations to Work
– Martin Odersky, Konstantin Läufer
- 1996
|
|
150
|
How Good is Local Type Inference?
– Haruo Hosoya, Benjamin C. Pierce
- 1999
|
|
43
|
Extracting F ! 's programs from proofs in the calculus of constructions
– C Paulin-Mohring
- 1989
|
|
322
|
Principal type-schemes for functional programs
– Luis Damas, Robin Milner
- 1982
|
|
14
|
An implementation of FSub
– Luca Cardelli
- 1993
|
|
25
|
Typability and Type Checking in the Second-Order - Calculus Are Equivalent and Undecidable. submitted to APAP
– Joe Wells
- 1996
|
|
95
|
Higher-order Unification via Explicit Substitutions (Extended Abstract)
– Gilles Dowek, Thérèse Hardin, Claude Kirchner
- 1995
|
|
16
|
The new implementation of ALF
– Lena Magnusson
- 1992
|
|
51
|
Programming objects with ML-ART: An extension to ML with abstract and record types
– Didier Rémy
- 1994
|
|
7
|
Type Inference for System F with and without the Eta Rule
– Joe B Wells
- 1996
|
|
61
|
Extracting Constructive Content from Classical Proofs
– C Murthy
- 1990
|
|
325
|
Proofs and Types
– Jean-Yves Girard, Yves Lafont, Paul Taylor
- 1989
|
