A reduction semantics for call-by-value mixin modules - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2002

A reduction semantics for call-by-value mixin modules

(1) , (1) ,
1
Joe B. Wells
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-4682.pdf (434.27 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071903 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071903 , version 1

Cite

Tom Hirschowitz, Xavier Leroy, Joe B. Wells. A reduction semantics for call-by-value mixin modules. [Research Report] RR-4682, INRIA. 2002. ⟨inria-00071903⟩
99 View
113 Download

Share

Gmail Facebook Twitter LinkedIn More