Relaxing the value restriction (2004)

by Jacques Garrigue
Venue:In International Symposium on Functional and Logic Programming, Nara, LNCS 2998
Citations:12 - 1 self

Documents Related by Co-Citation

92 Simple Imperative Polymorphism – Andrew Wright - 1995
166 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
56 The essence of ML type inference – F Pottier, D Rémy - 2005
18 Extending ML with Semi-Explicit Higher-Order Polymorphism – Jacques Garrigue, Didier Remy - 1997
605 The Definition of Standard ML (Revised – Robin Milner, Mads Tofte, Robert Harper, David Macqueen - 1997
42 Programming with polymorphic variants – Jacques Garrigue - 1998
2 The essence of ML type inference. Extended version of [PR05] (in preparation – François Pottier, Didier Rémy
9 Typability is undecidable for F+eta – J. B. Wells - 1995
5 Lexically-scoped type variables – Simon Peyton Jones, Mark Shields - 2003
21 MLF: Une extension de ML avec polymorphisme de second ordre et instanciation implicite – D LE BOTLAN - 2004
13 The undecidability of Mitchell’s subtyping relation – J B Wells - 1995
23 partial type-inference for System F based on type-containment – Simple
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
22 Typability and type-checking in the second-order λ-calculus are equivalent and undecidable – J B Wells - 1994
56 Colored Local Type Inference – Martin Odersky, Matthias Zenger, Matthias Zenger - 2001
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
22 Botlan and Didier Rémy. MLF: Raising ML to the power of System-F – Didier Le - 2003
19 Finitely stratified polymorphism – D Leivant - 1991
54 Programming objects with ML-ART: an extension to ML with abstract and record types – D Rémy - 1994