Loading...
Please wait, while we are loading the content...
Similar Documents
Applicative Functors and Fully Transparent Higher-Order Modules (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Leroy, Xavier |
| Abstract | We present a variant of the Standard ML module system where parameterized abstract types (i.e. functors returning generarive types) map provably equal arguments to compatible abstract types, instead of generating distinct types at each application as in Standard ML. This extension solves the full transparency problem (how to give syntactic signatures for higher-order functors that express exactly their propagation of type equations), and also provides better sup- port for non-closed code fragments. |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Higher-order Functors Syntactic Signature Type Equation Abstract Type Standard Ml Module System Full Transparency Problem Standard Ml Fully Transparent Higher-order Module Applicative Functors Non-closed Code Fragment Sup Port Equal Argument Generarive Type Distinct Type Compatible Abstract Type |
| Content Type | Text |
