Mixin modules in a call-by-value setting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2305, Issue , 2002, Pages 6-20

  Hirschowitz, Tom ^a   Leroy, Xavier ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); DIRECTED GRAPHS;

DEPENDENCY GRAPHS; LAMBDA CALCULUS; MODULE SYSTEMS; RECURSIVE DEFINITIONS; REFINED TYPE; SEPARATE COMPILATION;

CALCULATIONS;

EID: 84957094411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45927-8_2     Document Type: Conference Paper

References (21)

1. D. Ancona. Modular formal frameworks for module systems. PhD thesis, Universita di Pisa, 1998.
2. D. Ancona and E. Zucca. A primitive calculus for module systems. In G. Nadathur, editor, Princ. and Practice of Decl. Prog., volume 1702 of LNCS, pages 62–79. Springer-Verlag, 1999.
3. D. Ancona and E. Zucca. A calculus of module systems. Journal of functional programming, 2001. To appear.
4. Z. Ariola and S. Blom. Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic, 2001. To appear.
5. V. Bono, M. Bugliesi, M. Dezani-Ciancaglini, and L. Liquori. Subtyping for extensible, incomplete objects. Fundamenta Informaticae, 38(4):325–364, 1999.
6. G. Boudol. The recursive record semantics of objects revisited. Research report 4199, INRIA, 2001. Preliminary version presented at ESOP’01, LNCS 2028.
7. G. Bracha. The programming language Jigsaw: mixins, modularity and multiple inheritance. PhD thesis, University of Utah, 1992.
8. G. Bracha and W. Cook. Mixin-based inheritance. In OOPSLA90, volume 25(10) of SIGPLAN Notices, pages 303–311. ACM Press, 1990.
9. L. Cardelli. Program fragments, linking, and modularization. In 24th symp. Principles of Progr. Lang, pages 266–277. ACM Press, 1997.
10. G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8(2):173–202, 1987.
11. K. Crary, R. Harper, and S. Puri. What is a recursive module? In Prog. Lang. Design and Impl. 1999, pages 50–63. ACM Press, 1999.
12. D. Dreyer, K. Crary, and R. Harper. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, 2001.
13. D. Duggan and C. Sourelis. Mixin modules. In Int. Conf. on Functional Progr. 96, pages 262–273. ACM Press, 1996.
14. D. Duggan and C. Sourelis. Recursive modules and mixin-based inheritance. Unpublished draft, 2001.
15. M. Flatt and M. Felleisen. Units: cool modules for HOT languages. In Prog. Lang. Design and Impl. 1998, pages 236–248. ACM Press, 1998.
16. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In 21st symp. Principles of Progr. Lang, pages 123–137. ACM Press, 1994.
17. T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting (long version). Available at http://pauillac.inria.fr/~hirschow, 2001.
18. X. Leroy. Manifest types, modules, and separate compilation. In 21st symp. Principles of Progr. Lang, pages 109–122. ACM Press, 1994.
19. M. Lillibridge. Translucent sums: a foundation for higher-order module systems. PhD thesis, School of Computer Science, Carnegie Mellon University, 1997.
20. C. Russo. Recursive structures for Standard ML. In Int. Conf. on Functional Progr. 01, pages 50–61, 2001.
21. J. Wells and R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In Programming Languages and Systems, 9th European Symp. Programming, volume 1782 of LNCS, pages 412–428. Springer-Verlag, 2000.