A type system for higher-order modules

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2003, Pages 236-249

  Dreyer, Derek ^a   Crary, Karl ^a   Harper, Robert ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Abstract data types; Computational effects; Functors; Generativity; Modularity; Singleton types; Type theory

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

RECURSIVE MODULES;

COMPUTER SCIENCE;

EID: 0037629421     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/604131.604151     Document Type: Conference Paper

References (34)

1. David R. Aspinall. Type Systems for Modular Programs and Specifications. PhD thesis, Edinburgh University, Edinburgh, Scotland, December 1997.
2. Luca Cardelli, Jim Donahue, Mick Jordan, Bill Kalso, and Greg Nelson. The Modula-3 type system. In Sixteenth ACM Symposium on Principles of Programming Languages, pages 202-212, Austin, TX, January 1989.
3. Luca Cardelli and Xavier Leroy. Abstract types and the dot notation. In M. Broy and C. B. Jones, editors, Proceedings IFIP TC2 working conference on programming concepts and methods, pages 479-504. North-Holland, 1990. Also available as research report 56, DEC Systems Research Center.
4. Karl Crary. Sound and complete elimination of singleton kinds. In Third Workshop on Types in Compilation, volume 2071 of Lecture Notes in Computer Science, pages 1-25. Springer-Verlag, September 2000. Extended version published as CMU technical report CMU-CS-00-104.
5. Karl Crary, Robert Harper, and Sidd Puri. What is a recursive module? In SIGPLAN '99 Conference on Programming Language Design and Implementation (PLDI), pages 50-63, Atlanta, GA, 1999. ACM SIGPLAN.
6. Derek Dreyer. Moscow ML's higher-order modules are unsound. Posted to the TYPES electronic forum, September 2002.
7. Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules (expanded version). Technical Report CMU-CS-02-122R, School of Computer Science, Carnegie Mellon University, December 2002.
8. Matthew Flatt and Matthias Felleisen. Units: Cool modules for HOT languages. In 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 236-248, Montreal, Canada, June 1998.
9. Giorgio Ghelli and Benjamin Pierce. Bounded existentials and minimal typing. Theoretical Computer Science, 193:75-96, 1998.
10. Warren D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
11. Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 123-137, Portland, OR, January 1994.
12. Robert Harper, John C. Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. In Seventeenth ACM Symposium on Principles of Programming Languages, San Francisco, CA, January 1990.
13. Robert Harper and Chris Stone. A type-theoretic interpretation of Standard ML. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language, and Interaction: Essays in Honor of Robin Milner. MIT Press, 2000.
14. Xavier Leroy. Manifest types, modules, and separate compilation. In Proceedings of the Twenty-first Annual ACM Symposium on Principles of Programming Languages, Portland, ACM, January 1994.
15. Xavier Leroy. Applicative functors and fully transparent higher-order modules. In Conference Record of POPL '95: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 142-153, San Francisco, CA, January 1995.
16. Xavier Leroy. A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5):667-698, 1996.
17. Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269-303, 2000.
18. Mark Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, December 1996.
19. Barbara Liskov and John Guttag. Abstraction and Specification in Program Development. MIT Press, 1986.
20. David MacQueen. Using dependent types to express modular structure. In Thirteenth ACM Symposium on Principles of Programming Languages, 1986.
21. David B. MacQueen and Mads Tofte. A semantics for higher-order functors. In Donald T. Sannella, editor, Programming Languages and Systems - ESOP '94, volume 788 of Lecture Notes in Computer Science, pages 409-423. Springer-Verlag, 1994.
22. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
23. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
24. John Mitchell, Sigurd Meldal, and Neel Madhav. An extension of Standard ML modules with subtyping and inheritance. In Eighteenth ACM Symposium on Principles of Programming Languages, January 1991.
25. John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10(3):470-502, July 1988.
26. Moscow ML. http://www.dina.dk/̃sestoft/mosml.html.
27. Objective Caml. http://www.ocaml.org.
28. Claudio V. Russo. Types for Modules. PhD thesis, Edinburgh University, Edinburgh, Scotland, 1998. LFCS Thesis ECS-LFCS-98-389.
29. Claudio V. Russo. First-class structures for Standard ML. Nordic Journal of Computing, 7(4):348-374, 2000.
30. Claudio V. Russo. Recursive structures for Standard ML. In International Conference on Functional Programming, pages 50-61, Florence, Italy, September 2001.
31. Zhong Shao. Transparent modules with fully syntactic signatures. In International Conference on Functional Programming, pages 220-232, Paris, France, September 1999.
32. Christopher A. Stone. Singleton Kinds and Singleton Types. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, August 2000.
33. Christopher A. Stone and Robert Harper. Deciding type equivalence in a language with singleton kinds. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, pages 214-227, Boston, January 2000.
34. Niklaus Wirth. Programming in Modula-2. Texts and Monographs in Computer Science. Springer-Verlag, 1983.