HAL: hal-00310119, version 1

DOI: 10.1007/3-540-45927-8

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

European Symposium on Programming, Grenoble : France (2002)

Mixin modules in a call-by-value setting

Tom Hirschowitz 1, Xavier Leroy (  Corresponding author ) 2

(2002)

The ML module system provides powerful parameterization facilities, but lacks the ability to split mutually recursive definitions across modules, and does not provide enough facilities for incremental programming. A promising approach to solve these issues is Ancona and Zucca's mixin modules calculus CMS. However, the straightforward way to adapt it to ML fails, because it allows arbitrary recursive definitions to appear at any time, which ML does not support.In this paper, we enrich CMS with a refined type system that controls recursive definitions through the use of dependency graphs. We then develop and prove sound a separate compilation scheme, directed by dependency graphs, that translates mixin modules down to a CBV lambda-calculus extended with a non-standard letrec construct.

1:	Laboratoire de Mathématiques (LAMA)
	CNRS : UMR5127 – Université de Savoie
2:	GALLIUM (INRIA Rocquencourt)
	INRIA

Subject

:

Computer Science/Programming Languages

Keyword(s): Modularity – functional programming – letrec – compilation – mixin modules

hal-00310119, version 1

http://hal.archives-ouvertes.fr/hal-00310119

oai:hal.archives-ouvertes.fr:hal-00310119

From: Tom Hirschowitz <>

Submitted on: Friday, 8 August 2008 08:59:54

Updated on: Monday, 11 August 2008 08:31:06