Mixin modules in a call-by-value setting - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Mixin modules in a call-by-value setting

Résumé

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.
Fichier principal
Vignette du fichier
mixins-cbv-esop2002.pdf (389.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00310119 , version 1 (08-08-2008)

Identifiants

Citer

Tom Hirschowitz, Xavier Leroy. Mixin modules in a call-by-value setting. European Symposium on Programming, 2002, Grenoble, France. pp.207-236, ⟨10.1007/3-540-45927-8⟩. ⟨hal-00310119⟩
199 Consultations
241 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More