Hostname: page-component-745bb68f8f-v2bm5 Total loading time: 0 Render date: 2025-02-11T01:27:08.866Z Has data issue: false hasContentIssue false
  • English
  • Français

A theory of mixin modules: basic and derived operators

Published online by Cambridge University Press:  01 August 1998

DAVIDE ANCONA  and
ELENA ZUCCA
DAVIDE ANCONA
Affiliation:
Dipartimento di Informatica e Scienze dell'Informazione, Via Dodecaneso, 35, 16146 Genova (Italy). Email: {davide, zucca}@disi.unige.it
ELENA ZUCCA
Affiliation:
Dipartimento di Informatica e Scienze dell'Informazione, Via Dodecaneso, 35, 16146 Genova (Italy). Email: {davide, zucca}@disi.unige.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Mixins are modules in which some components are deferred, that is, their definition has to be provided by another module. Moreover, in contrast to parameterized modules (like ML functors), mixin modules can be mutually dependent and their composition supports the redefinition of components (overriding). In this paper, we present a formal model of mixins and their basic composition operators. These operators can be viewed as a kernel language with clean semantics in which one can express more complex operators of existing modular languages, including variants of inheritance in object-oriented programming. Our formal model is given in an ‘institution independent’ way, that is, it is parameterized by the semantic framework modelling the underlying core language.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 8 , Issue 4 , August 1998 , pp. 401 - 446
Copyright
1998 Cambridge University Press

Footnotes

This work has been partially supported by Murst 40% (Modelli della computazione e dei linguaggi di programmazione) and CNR (Formalismi per la specifica e la descrizione di sistemi ad oggetti).