363

Towards a theory of type structure
– J C Reynolds
 1974

939

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

10988

Computers and Intractability: A Guide to the Theory of NPcompleteness
– M Garey, D Johnson
 1979

14

FixedParameter Complexity and Cryptography
– Michael R. Fellows, Neal Koblitz
 1993

25

Fixed Parameter Tractability and Completeness II: On Completeness for W [1],” to appear Theor
– R G Downey, M R Fellows

40

Fixed parameter tractability and completeness I: basic theory
– R G Downey, M R Fellows
 1995

155

The Lambda Calculus: its Syntax and Semantics. NorthHolland, Amsterdam, revised edition
– H P Barendregt
 1984

49

Deciding ML typability is complete for deterministic exponential time
– Harry G Mairson
 1990

86

Polymorphic Type Inference
– D Leivant
 1983

12

Type reconstruction in finiterank fragments of the secondorder λcalculus
– A J Kfoury, J Tiuryn
 1992

234

Principal type schemes for functional programs
– R Milner
 1982

1565

The Definition of Standard ML
– Robin Milner, Mads Tofte
 1990

103

Polymorphic type inference and containment
– J C Mitchell
 1984

97

The Geometry of Optimal Lambda Reduction
– Georges Gonthier, Martín Abadi, JeanJacques Lévy
 1992

119

An algorithm for optimal lambda calculus reduction
– John Lamping
 1990

20

The inherent computational complexity of theories of ordered sets
– A R Meyer
 1974

52

Principality and Decidable Type Inference for FiniteRank Intersection Types
– A. J. Kfoury, J. B. Wells
 1999

7

Fixed Parameter Intractability (Extended Abstract
– R G Downey, M R Fellows
 1992
