Transparent Modules with Fully Syntactic Signatures (1999)
Cached
Download Links
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- [flint.cs.yale.edu]
- [daffy.cs.yale.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 25 - 4 self |
BibTeX
@MISC{Shao99transparentmodules,
author = {Zhong Shao},
title = {Transparent Modules with Fully Syntactic Signatures},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ML-style modules are valuable in the development and maintenance of large software systems, unfortunately, none of the existing languages support them in a fully satisfactory manner. The official SML'97 Definition does not allow higher-order functors, so a module that refers to externally defined functors cannot accurately describe its import interface. MacQueen and ToRe [26] extended SML'97 with fully transparent higher-order functors, but their system does not have a type-theoretic semantics thus fails to support fully syntactic signatures. The systems of manifest types [19, 20] and translucent sums [12] support fully syntactic signatures but they may propagate fewer type equalities than fully transparent functors. This paper presents a module calculus that supports both fully transparent higher-order functors and fully syntactic signa- tures (and thus true separate compilation). We give a simple typetheoretic semantics to our calculus and show how to compile it into an F,-like )-calculus extended with existential types.
