26 search results - page 1 / 6 » A Category-theoretic Account of Program Modules |
CALCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoret...
CTCS
1989
Springer
14 years 18 days ago
1989
Springer
The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions i...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a type theory for higher-order modules that accounts for many central issues in module system design, including translucency, applicativity, generativity, and modules a...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
t programming techniques encourage abstraction and reuse through external linking. Some parts of a program, however, must use concrete, internally specified references, so a pure ...
POPL
1990
ACM
14 years 17 days ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...