Documents Related by Co-Citation

21 Partial polymorphic type inference is undecidable – H-J Boehm - 1985
102 Polymorphic type inference and containment – John C Mitchell - 1988
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
361 Towards a theory of type structure, in – J C Reynolds - 1974
61 Polymorphic Type Inference and Abstract Data Types – Konstantin Läufer, Martin Odersky - 1994
166 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
1559 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
43 Extracting F# 's programs from proofs in the Calculus of Constructions – C Paulin-Mohring - 1989
356 Principal type-schemes for functional programs – L Damas, R Milner - 1982
25 Typability and Type Checking in the Second-Order - Calculus Are Equivalent and Undecidable. submitted to APAP – Joe Wells - 1996
16 An implementation of FSub – L Cardelli - 1993
102 Higher-order Unification via Explicit Substitutions (Extended Abstract) – Gilles Dowek, Thérèse Hardin, Claude Kirchner - 1995
54 Programming Objects with ML-ART: An extension to ML with Abstract and Record Types – D Rémy - 1994
935 A theory of type polymorphism in programming – Robin Milner - 1978
16 The new implementation of ALF – Lena Magnusson - 1992
7 Type Inference for System F with and without the Eta Rule – Joe B Wells - 1996
352 Proofs and Types – J-Y Girard, Y Lafont, P Taylor - 1989