MLF made simple - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2007

MLF made simple

Résumé

We propose MLF---a type system that supersedes both ML and System F and enables complete type inference for partially annotated programs based on first-order unification and let-polymorphism. This variant of MLF is less expressive than the original one, yet it retains all its essential properties. In Curry's style, this variant uses {\Dash\SystemF} types extended with flexible bindings that can be interpreted as sets of System-F types. The type instance relation may be derived from the interpretation. We may also exhibit a translation from MLF to an extension of System F with local-bindings. In Church's style, only function parameters that are used polymorphicallyneed to be annotated as all other type annotations may be inferred.
Fichier principal
Vignette du fichier
mlf-made-simple.pdf (690.51 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00156628 , version 1 (21-06-2007)
inria-00156628 , version 2 (25-06-2007)
inria-00156628 , version 3 (10-07-2007)
inria-00156628 , version 4 (03-12-2008)

Identifiants

  • HAL Id : inria-00156628 , version 1

Citer

Didier Le Botlan, Didier Rémy. MLF made simple. [Research Report] 2007, pp.60. ⟨inria-00156628v1⟩
444 Consultations
607 Téléchargements

Partager

Gmail Facebook X LinkedIn More