Mixin modules in a call-by-value setting

Abstract : The ML module system provides powerful parameterization facilities, but lacks the ability to split mutually recursive definitions across modules, and does not provide enough facilities for incremental programming. A promising approach to solve these issues is Ancona and Zucca's mixin modules calculus CMS. However, the straightforward way to adapt it to ML fails, because it allows arbitrary recursive definitions to appear at any time, which ML does not support.In this paper, we enrich CMS with a refined type system that controls recursive definitions through the use of dependency graphs. We then develop and prove sound a separate compilation scheme, directed by dependency graphs, that translates mixin modules down to a CBV lambda-calculus extended with a non-standard letrec construct.
Type de document :
Communication dans un congrès
European Symposium on Programming, 2002, Grenoble, France. Springer, 2305, pp.207-236, 2002, Lecture Notes in Computer Science. 〈10.1007/3-540-45927-8〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00310119
Contributeur : Tom Hirschowitz <>
Soumis le : vendredi 8 août 2008 - 08:59:54
Dernière modification le : lundi 11 août 2008 - 08:31:06
Document(s) archivé(s) le : jeudi 3 juin 2010 - 18:04:21

Fichier

mixins-cbv-esop2002.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

INRIA | LAMA | UGA

Citation

Tom Hirschowitz, Xavier Leroy. Mixin modules in a call-by-value setting. European Symposium on Programming, 2002, Grenoble, France. Springer, 2305, pp.207-236, 2002, Lecture Notes in Computer Science. 〈10.1007/3-540-45927-8〉. 〈hal-00310119〉

Partager

Métriques

Consultations de
la notice

343

Téléchargements du document

124