Abstract We present a type theory for higher-order modules that accountsfor many central issues in module system design, including translucency, applicativity, generativity, and modules as first-class values.Our type system harmonizes design elements from previous work, resulting in a simple, economical account of modular programming.The main unifying principle is the treatment of abstraction mechanisms as computational effects. Our language is the first to providea complete and practical formalization of all of these critical issues in module system design
. We present a formalisation of modules that are correct , and (correctly) reusable in the sense tha...
There are compelling benefits to using foundational type theory as a framework for programming langu...
Two of the distinguishing features of Standard ML Modules are its term dependent type syntax and the...
We present a type theory for higher-order modules that accounts for many central issues in module sy...
We present a type theory for higher-order modules that accounts for many central issues in module sy...
We present a higher-order module system similar to those found in Standard ML and Objective Caml. Ou...
Abstract The ease of understanding, maintaining, and developing a large program depends crucially on...
AbstractThe programming language Standard ML is an amalgam of two, largely orthogonal, languages. Th...
Recently, Mark Jones introduced first class structures as a means to express modular structure. In t...
The design of a module system for constructing and maintaining large programs is a difficult task th...
AbstractThe programming language Standard ML is an amalgam of two, largely orthogonal, languages. Th...
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfo...
1.1 The need for good notions of higher-order theory....... 2 1.2 Modules for modular higher-order s...
The design of a module system for constructing and maintaining large programs is a dicult task that ...
ML modules are a powerful language mechanism for decomposing programs into reusable com-ponents. Unf...
. We present a formalisation of modules that are correct , and (correctly) reusable in the sense tha...
There are compelling benefits to using foundational type theory as a framework for programming langu...
Two of the distinguishing features of Standard ML Modules are its term dependent type syntax and the...
We present a type theory for higher-order modules that accounts for many central issues in module sy...
We present a type theory for higher-order modules that accounts for many central issues in module sy...
We present a higher-order module system similar to those found in Standard ML and Objective Caml. Ou...
Abstract The ease of understanding, maintaining, and developing a large program depends crucially on...
AbstractThe programming language Standard ML is an amalgam of two, largely orthogonal, languages. Th...
Recently, Mark Jones introduced first class structures as a means to express modular structure. In t...
The design of a module system for constructing and maintaining large programs is a difficult task th...
AbstractThe programming language Standard ML is an amalgam of two, largely orthogonal, languages. Th...
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfo...
1.1 The need for good notions of higher-order theory....... 2 1.2 Modules for modular higher-order s...
The design of a module system for constructing and maintaining large programs is a dicult task that ...
ML modules are a powerful language mechanism for decomposing programs into reusable com-ponents. Unf...
. We present a formalisation of modules that are correct , and (correctly) reusable in the sense tha...
There are compelling benefits to using foundational type theory as a framework for programming langu...
Two of the distinguishing features of Standard ML Modules are its term dependent type syntax and the...