Recursive structures for standard ML

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 10, 2001, Pages 50-61

  Russo, Claudio V ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Datatypes; Recursive modules; Standard ML; Type theory

Indexed keywords

EID: 17144408012     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/507669.507644     Document Type: Article

References (19)

1. Ancona, D., and Zucca, E. 1999. A primitive calculus of mixin modules. In Proc. Principles and Practice of Declarative Programming, LNCS vol. 1702 , pages 69-72, Berlin.
2. Crary, K., and Harper, R., and Puri, S. 1999. What is a recursive module? In Proc. ACM SIGPLAN'99 Conf. on Programming Language Design and Implementation, pages 50-63.
3. Dreyer, D., and Harper, R., and Crary, K. 2001. Toward a Practical Type Theory for Recursive Modules. TR CMU-CS-01-112, Computer Science, Carnegie-Mellon University, March..
4. Duggan, D., and Sourelis, C. 1996. Mixin modules. In Proc. ACM SIGPLAN International Conference on Functional Programming, pages 262-273, Philadelphia.
5. Duggan, D., and Sourelis, C. 1998. Parameterized modules, recursive modules, and mixin modules. In Proc. ACM SIGPLAN Workshop on ML, pages 87-96, Baltimore.
6. Elsman, M. 1999. Program Modules, Separate Compilation, and Intermodule Optimisation. PhD thesis. University of Copenhagen.
7. Flatt, M., and Felleisen, M. 1998. Units: cool modules for HOT languages. In Proc. ACM SIGPLAN'98 Conf. on Programming Language Design and Implementation, pages 236-248.
8. Harper, R., Lillibridge, M. 1994. A type-theoretic approach to higher-order modules with sharing. In 21st ACM Symp. Principles of Programming Languages.
9. Harper, R, and Mitchell, J. C., and Moggi, E. 1990. Higher-order modules and the phase distinction. In 17th ACM Symp. Principles of Programming Languages
10. Leroy, X., 1994. Manifest types, modules, and separate compilation. In 21st ACM Symp. Principles of Programming Languages, pages 109-122. ACM Press.
11. Leroy, X., 1995. Applicative functors and fully transparent higher-order modules. In 22nd ACM Symp. Principles of Programming Languages.ACM Press.
12. Milner, R., and Tofte, M., and Harper, R., and MacQueen, D. 1997. The Definition of Standard ML (Revised). MIT Press.
13. Okasaki, C. 1998. Purely Functional Data Structures. Cambridge University Press.
14. Russo, C. V. 1998. Types For Modules. PhD Thesis, LFCS, University of Edinburgh.
15. Russo, C. V. 1999. Non-Dependent Types For Standard ML Modules. In 1999 Int'l Conf. on Principles and Practice of Declarative Programming.
16. Russo, C. V. 2000. First-Class Structures for Standard ML. In Nordic Journal of Computing, 7(4):348, Winter 2000.
17. Sestoft, P., and Romanenko, S., and Russo, C. V. 2000. Moscow ML V2.00.
18. Tofte, M. 1988. Operational Semantics and Polymorphic Type Inference. PhD thesis, Computer Science, University of Edinburgh.
19. Wells, M., and Vestergaard, R. 2000. Equational reasoning for linking with first-class primitive modules. In Programming Languages & Systems, 9th European Symp. Programming, LNCS vol. 1782 , pages 412-428, Berlin.