A calculus of module systems

Journal of Functional Programming

Volumn 12, Issue 2, 2002, Pages 91-132

  Ancona, Davide ^a   Zucca, Elena ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MODULE SYSTEMS;

COMPUTER SOFTWARE; OBJECT ORIENTED PROGRAMMING; RECURSIVE FUNCTIONS; SEMANTICS; SYNTACTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0035994605     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796801004257     Document Type: Article

References (44)

1. A Theory of Objects
2. An algebraic framework for separate type-checking
3. MIX(FL): A kernel language of mixin modules
4. Overriding operators in a mixin-based framework
5. An algebra of mixin modules
6. A theory of mixin modules: Basic and derived operators
7. A primitive calculus for module systems
8. True modules for Java classes
9. Jam: A smooth extension of Java with mixins
10. Lambda calculus with explicit recursion
11. An application framework for module composition tools
12. A core calculus of classes and mixins
13. Mixin-based inheritance
14. Extending Smalltalk with mixins
15. Modularity meets inheritance
16. Program fragments, linking, and modularization
17. What is a recursive module?
18. Weak and strong confluent calculi of explicit substitutions
19. A fragment calculus - Towards a model of separate compilation, linking and binary compatibility
20. Mixin modules
21. Parameterized modules, recursive modules, and mixin modules
22. Modular object-oriented programming with units and mixins. Intl
23. Units: Cool modules for HOT languages
24. Classes and mixins
25. Type-safe linking and modular assembly language
26. A type theoretic approach to higher-order modules with sharing
27. Higher-order modules and the phase distinction
28. Modules mixins: Typage et compilation
29. Term rewriting systems: A tutorial
30. Manifest types, modules and separate compilation
31. A modular module system
32. Encapsulation and composition as orthogonal operators on mixins: A solution to multiple inheritance problems
33. A calculus for link-time compilation
34. Objects as closures: Abstract semantics of object-oriented languages
35. Privacy via subsumption
36. Confluent equational reasoning for linking with first-class primitive modules