MLF made simple

Abstract : 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.
Type de document :
[Research Report] 2007, pp.60
Liste complète des métadonnées
Contributeur : Didier Rémy <>
Soumis le : jeudi 21 juin 2007 - 18:53:51
Dernière modification le : mardi 11 septembre 2018 - 15:18:15
Document(s) archivé(s) le : jeudi 8 avril 2010 - 18:11:21


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00156628, version 1


Didier Le Botlan, Didier Rémy. MLF made simple. [Research Report] 2007, pp.60. 〈inria-00156628v1〉



Consultations de la notice


Téléchargements de fichiers