Recursive structures for standard ML

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2001, Pages 50-61

  Russo, C V ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Datatypes; Recursive modules; Standard ML; Type theory

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER ARCHITECTURE; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SOFTWARE; DATA STRUCTURES; USER INTERFACES;

DATATYPES; RECURSIVE MODULES; STANDARD MARKUP LANGUAGE; TYPE THEORY;

HIGH LEVEL LANGUAGES;

EID: 0034775933     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/507643.507644     Document Type: Conference Paper

References (19)

1. A primitive calculus of mixin modules
2. What is a recursive module?
3. Toward a practical type theory for recursive modules
4. Mixin modules
5. Parameterized modules, recursive modules, and mixin modules
6. Program modules, separate compilation, and intermodule optimisation
7. Units: Cool modules for HOT languages
8. A type-theoretic approach to higher-order modules with sharing
9. Higher-order modules and the phase distinction
10. Manifest types, modules, and separate compilation
11. Applicative functors and fully transparent higher-order modules
12. The definition of standard ML (revised)
13. Purely functional data structures
14. Types for modules
15. Non-dependent types for standard ML modules
16. First-class structures for standard ML
17. Operational semantics and polymorphic type inference
18. Equational reasoning for linking with first-class primitive modules