Rigid mixin modules.

Abstract : Mixin modules are a notion of modules that allows cross-module recursion and late binding, two features missing in ML-style modules. Unfortunately, they are easier to define in a call-by-name setting. In a call-by-value setting, mixin modules tend to conflict with the usual static restrictions on recursive definitions. Moreover, the semantics of instantiation has to specify an order of evaluation, which involves a difficult design choice. Previous proposals rely on the dependencies between components to compute a valid order of evaluation. In such systems, mixin module types must carry some information about the dependencies between their components, which makes them rather impractical. In this paper, we propose a new design for mixin modules in a call-by-value setting, which avoids this problem. The formalism we obtain is much simpler than previous notions of mixin modules, although slightly less powerful.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02101793
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:06:26 AM
Last modification on : Wednesday, May 22, 2019 - 1:32:15 AM

File

RR2003-46.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101793, version 1

Collections

Citation

Tom Hirschowitz. Rigid mixin modules.. [Research Report] LIP RR-2003-46, Laboratoire de l'informatique du parallélisme. 2003, 2+26p. ⟨hal-02101793⟩

Share

Metrics

Record views

17

Files downloads

11