Unification and ML Type Reconstruction (1991)

Cached

Download Links

by Paris C. Kanellakis , Harry G. Mairson , John C. Mitchell
Citations:42 - 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
605 The Definition of Standard ML (Revised – Robin Milner, Mads Tofte, Robert Harper, David Macqueen - 1997
41 P.Urcyczyn: An Analysis of ML-Typability – J Tiuryn A J Kfoury - 1990
94 Type assignment in programming languages – L Damas - 1985
288 Interpretation Fonctionelle et Elimination des Coupures dans l'Arithmetique d'Ordre Superieure – J -Y Girard - 1972
77 A simple algorithm and proof for type inference – M Wand - 1987
20 The inherent computational complexity of theories of ordered sets – A R Meyer - 1974
26 The typed ^.-calculus is not elementary recursive – R Statman - 1979
108 The principal type scheme of an object in combinatory logic – J Hindley - 1969
187 Soft typing with conditional types – Er Aiken - 1994
298 Control-Flow Analysis of Higher-Order Languages – Olin Shivers - 1991
15 ML typability is DEXPTIME-complete – A J Kfoury, J Tiuryn, P Urzyczyn - 1990
141 The principal type-scheme of an object in combinatory logic – R Hindley - 1969
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
234 Principal type schemes for functional programs – R Milner - 1982
139 Type Systems for Programming Languages – J C Mitchell - 1990
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979