Recasting ML^F

Recasting ML^F (2007)

Cached

Download Links

by Didier Le Botlan , Didier Rémy

Citations:

BibTeX

@MISC{Botlan07recastingml^f,
    author = {Didier Le Botlan and Didier Rémy},
    title = { Recasting ML^F},
    year = {2007}
}

Bookmark

OpenURL

Abstract

Citations

873	A theory of type polymorphism in programming - Milner - 1978
578	Types and Programming Languages - Pierce - 2002
337	Towards a theory of types structure - Reynolds - 1974
150	Local type inference - Pierce, Turner
137	The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition - Barendregt - 1984
109	Unification under a mixed prefix - Miller - 1992
97	Bounded quantification is undecidable - Pierce - 1994
95	Higher-order unification via explicit substitutions - Hardin, Kirchner
95	Polymorphic type inference and containment - Mitchell - 1988
79	Partial polymorphic type inference and higher-order unification - Pfenning - 1988
78	Practical type inference for arbitrary-rank types - Jones, Vytiniotis, et al. - 2007
77	The essence of principal typings - Wells - 2002
70	A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus - Kfoury, Wells - 1994
64	Programming with Intersection Types and Bounded Polymorphism - Pierce - 1991
58	Polymorphic type inference and abstract data types - Läufer, Odersky - 1994
53	Colored local type inference - Odersky, Zenger, et al. - 2001
51	Programming objects with ML-ART: An extension to ML with abstract and record types - Rémy - 1994
51	Typability and type checking in system F are equivalent and undecidable. Annals of Pure and Applied Logic - Wells - 1999
32	Stratified type inference for generalized algebraic data types - Pottier, Régis-Gianas
29	Boxy types: inference for higher-rank types and impredicativity - Vytiniotis, Weirich, et al. - 2006
26	On the undecidability of partial polymorphic type reconstruction - Pfenning - 1993
24	Rank-2 type systems and recursive definitions - Jim - 1995
21	partial type-inference for System F based on type-containment - Simple - 2005
20	Partial polymorphic type inference is undecidable - Boehm - 1985
20	System E: Expansion variables for flexible typing with linear and non-linear types and intersection types - Carlier, Polakow, et al. - 2004
19	Qualified types for MLF - Leijen, Löh - 2005
14	An implementation of FSub - Cardelli - 1993
14	A graphical presentation of MLF types with a linear-time unification algorithm - Rémy, Yakobowski - 2007
12	HMF: Simple type inference for first-class polymorphism - Leijen - 2008
11	A polar type system - Jim - 2000
11	Type reconstruction with first-class polymorphic values - Gifford - 1989
9	Della Rocca. Characterization of typings in polymorphic type discipline - Giannini, Ronchi - 1988
9	A type directed translation of MLF to System F - Leijen - 2007
9	Flexible types: robust type inference for first-class polymorphism - Leijen - 2009
7	A logical algorithm for ML type inference - McAllester - 2003
7	Type Inference for System F with and without the Eta Rule - Wells - 1996
4	Le Botlan and Didier Rémy. MLF: Raising ML to the power of System-F - Didier - 2003
4	Graphical types and constraints: second-order polymorphism and inference - Yakobowski - 2008
3	Discrete polymorphism - Leivant - 1990
3	Rémy and Boris Yakobowski. A church-style intermediate language for MLF. Available at http://gallium.inria.fr/ ∼remy/mlf/xmlf.pdf - Didier - 2008
2	Garrigue and Didier Rémy. Extending ML with Semi-Explicit higher-order polymorphism - Jacques - 1999
2	Lexically scoped type variables. Available at http://research.microsoft.com/ ∼simonpj/papers/scoped-tyvars - Jones, Shields - 2004
2	6228 Rémy & Le Botlan ⊲ Martin Odersky and Konstantin Läufer. Putting type annotations to work - n° - 1996
2	The essence of ML type inference. Extended preliminary version of (Pottier and Rémy - Pottier, Rémy - 2005