The Complexity of Type Inference for Higher-Order Typed Lambda Calculi (1991)

Cached

Download Links

by Fritz Henglein , Harry G. Mairson
Venue:J. Funct. Programming
Citations:28 - 11 self

Documents Related by Co-Citation

939 A theory of type polymorphism in programming – Robin Milner - 1978
363 Towards a theory of type structure – J C Reynolds - 1974
42 Unification and ML Type Reconstruction – Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell - 1991
49 Deciding ML typability is complete for deterministic exponential time – Harry G Mairson - 1990
86 Polymorphic Type Inference – D Leivant - 1983
234 Principal type schemes for functional programs – R Milner - 1982
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
14 Fixed-Parameter 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. North-Holland, Amsterdam, revised edition – H P Barendregt - 1984
108 The principal type scheme of an object in combinatory logic – J Hindley - 1969
12 Type reconstruction in finite-rank fragments of the second-order λcalculus – A J Kfoury, J Tiuryn - 1992
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
103 Polymorphic type inference and containment – J C Mitchell - 1984
20 The inherent computational complexity of theories of ordered sets – A R Meyer - 1974
7 Fixed Parameter Intractability (Extended Abstract – R G Downey, M R Fellows - 1992
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
353 Proofs and Types – Jean-Yves Girard, Yves Lafont, Paul Taylor - 1989