|
874
|
A theory of type polymorphism in programming
– Robin Milner
- 1978
|
|
42
|
Unification and ML Type Reconstruction
– Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell
- 1991
|
|
47
|
Deciding ML typability is complete for deterministic exponential time
– H G Mairson
- 1990
|
|
82
|
Polymorphic type inference
– Daniel Leivant
- 1983
|
|
339
|
Towards a theory of type structure
– J C Reynolds
|
|
137
|
The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition
– H P Barendregt
- 1984
|
|
12
|
Type reconstruction in finite-rank fragments of the second-order λ-calculus
– A J Kfoury, J Tiuryn
- 1992
|
|
221
|
Principal type schemes for functional programs
– L Damas, H Milner
- 1982
|
|
19
|
The inherent computational complexity of theories of ordered sets
– A R Meyer
- 1974
|
|
50
|
Principality and Decidable Type Inference for Finite-Rank Intersection Types
– A. J. Kfoury, J. B. Wells
- 1999
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
70
|
A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus
– A. J. Kfoury, J. B. Wells
- 1993
|
|
98
|
The principal type scheme of an object in combinatory logic
– J R Hindley
- 1969
|
|
55
|
Principal type schemes for an extended type theory
– S Ronchi Della Rocca, B Venneri
- 1984
|
|
96
|
Polymorphic type inference and containment
– J-C MITCHELL
- 1988
|
|
1497
|
The Definition of Standard ML
– Robin Milner, Mads Tofte, Robert Harper
- 1990
|
|
107
|
An algorithm for optimal lambda calculus reduction
– John Lamping
- 1990
|
|
93
|
The Geometry of Optimal Lambda Reduction
– Georges Gonthier, Martín Abadi, Jean-Jacques Lévy
- 1992
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
