Mixin modules in a call-by-value setting

Mixin modules in a call-by-value setting (2002)

by Tom Hirschowitz , Xavier Leroy

Venue:	In European Symposium on Programming
Citations:	62 - 8 self

Datum	Value	Source
TITLE	Mixin modules in a call-by-value setting	SVM HeaderParse 0.2
AUTHOR NAME	Tom Hirschowitz	SVM HeaderParse 0.2
AUTHOR AFFIL	INRIA Rocquencourt	SVM HeaderParse 0.2
AUTHOR ADDR	Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France	SVM HeaderParse 0.2
AUTHOR NAME	Xavier Leroy	SVM HeaderParse 0.2
AUTHOR AFFIL	INRIA Rocquencourt	SVM HeaderParse 0.2
AUTHOR ADDR	Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France	SVM HeaderParse 0.2
ABSTRACT	Abstract. 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 a separate compilation scheme, directed by dependency graphs, that translate mixin modules down to a CBV λ-calculus extended with a non-standard let rec construct. 1	SVM HeaderParse 0.2
YEAR	2002	INFERENCE
VENUE	In European Symposium on Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	6--20	INFERENCE
VOLUME	2305	INFERENCE
CITATIONS	21 found	ParsCit 1.0