A reduction semantics for call-by-value mixin modules

Abstract : Module systems are important for software engineering: they facilitate code reuse without compromising the correctness of programs. However, they still lack some flexibility: first, they do not allow mutually recursive definitions to span module boundaries ; second, definitions inside modules are bound early, and cannot be overridden later, as opposed to inheritance and overriding in class-based object-oriented languages, which follow the late binding semantics. This paper examines an alternative, hybrid idea of modularization concept, called mixin modules. We develop a language of call-by-value mixin modules with a reduction semantics, and a sound type system for it, guaranteeing that programs will run correctly.
Type de document :
Rapport
[Research Report] RR-4682, INRIA. 2002
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00071903
Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 23 mai 2006 - 19:12:41
Dernière modification le : samedi 17 septembre 2016 - 01:35:24
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:43:40

Fichiers

Identifiants

  • HAL Id : inria-00071903, version 1

Collections

Citation

Tom Hirschowitz, Xavier Leroy, Joe B. Wells. A reduction semantics for call-by-value mixin modules. [Research Report] RR-4682, INRIA. 2002. 〈inria-00071903〉

Partager

Métriques

Consultations de la notice

124

Téléchargements de fichiers

134