Mixin modules

Dominic Duggan, Constantinos Sourelis

Research output: Contribution to conferencePaperpeer-review

Abstract

Mixin modules are proposed as a new construct for module languages, allowing recursive definitions to span module boundaries. Mixin modules are proposed specifically for the Standard ML language. Several applications are described, including the resolution of cycles in module import dependency graphs, as well as functionality related to Haskell type classes and CLOS generic functions, though without any complications to the core language semantics. Mixin modules require no changes to the core ML type system, and only a very minor change to its run-time semantics. A type system and reduction semantics are provided, and the former is verified to be sound relative to the latter.

Original languageEnglish
Pages262-273
Number of pages12
StatePublished - 1996
EventProceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, ICFP'96 - Philadelphia, PA, USA
Duration: May 24 1996May 26 1996

Conference

ConferenceProceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, ICFP'96
CityPhiladelphia, PA, USA
Period5/24/965/26/96

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Mixin modules'. Together they form a unique fingerprint.

Cite this