Sciweavers

2 search results - page 1 / 1
» Transparent Modules with Fully Syntactic Signatures
Sort
View
ICFP
1999
ACM
13 years 9 months ago
Transparent Modules with Fully Syntactic Signatures
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 mann...
Zhong Shao
POPL
1995
ACM
13 years 8 months ago
Applicative Functors and Fully Transparent Higher-Order Modules
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
Xavier Leroy