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 a separate compilation scheme, directed by dependency graphs, that translates mixin modules down to a CBV lambda-calculus extended with a non-standard let rec construct.
Type de document :
Article dans une revue
Liste complète des métadonnées

Contributeur : Tom Hirschowitz <>
Soumis le : vendredi 8 août 2008 - 15:43:44
Dernière modification le : vendredi 25 mai 2018 - 12:02:07
Document(s) archivé(s) le : jeudi 3 juin 2010 - 18:08:35


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




Tom Hirschowitz, Xavier Leroy. Mixin modules in a call-by-value setting. ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2005, 27 (5), pp.857 - 881. ⟨10.1145/1086642.1086644⟩. ⟨hal-00310317⟩



Consultations de la notice


Téléchargements de fichiers