|
This paper shows that you can define a module system, independent of the base language (e.g., Ada, ML etc.). Essentially the paper gives a constructive proof, by showing a module system, parametrized by the base language - specifically by the type checker.
The code from the paper, is available in a web appendix.
Posted to Software-Eng by Ehud Lamm on 11/6/01; 12:38:49 PM
|
|
A modular module system
