A type system for recursive modules

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

Volumn , Issue , 2007, Pages 289-302

  Dreyer, Derek ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Abstract data types; Modules; Recursion; Type systems

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

ABSTRACT DATA TYPES; DATA ABSTRACTION;

FUNCTIONAL PROGRAMMING;

EID: 38849102275     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291151.1291196     Document Type: Conference Paper

References (26)

1. Roberto Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993.
2. Karl Crary, Robert Harper, and Sidd Puri. What is a recursive module? In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 50-63, Atlanta, Georgia, 1999.
3. Derek Dreyer. Practical type theory for recursive modules. Technical Report TR-2006-07, University of Chicago, Department of Computer Science, August 2006.
4. Derek Dreyer. A type system, for recursive modules. Technical Report TR-2007-10, University of Chicago, Department of Computer Science, July 2007a.
5. Derek Dreyer. Recursive type generativity. Journal of Functional Programming, 2007b. To appear. Original version published in 2005 ACM SIGPLAN International Conference on Functional Programming (ICFP), pages 41-53, Tallinn, Estonia.
6. Derek Dreyer. Understanding and Evolving the ML Module System. PhD thesis, Carnegie Mellon University, Pittsburgh, Pennsylvania, 2005.
7. Derek Dreyer and Matthias Blume. Principal type schemes for modular programs. In European Symposium on Programming (ESOP), pages 441-457, Braga, Portugal, 2007.
8. Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), New Orleans, 2003.
9. Matthew Flatt and Matthias Felleisen. Units: Cool modules for HOT languages. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 236-248, Montréal, Canada, 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 ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), pages 123-137, Portland, Oregon, 1994.
12. Robert Harper and Benjamin C. Pierce. Design considerations for ML-style module systems. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 8. MIT Press, 2005.
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, pages 341-387. MIT Press, 2000.
14. Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253-289, 1993.
15. Xavier Leroy. Applicative functors and fully transparent higher-order modules. In ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), pages 142-153, San Francisco, California, 1995.
16. Xavier Leroy. Manifest types, modules, and separate compilation. In ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), pages 109-122, Portland, Oregon, 1994.
17. Xavier Leroy. A proposal for recursive modules in Objective Caml, 2003. Available at: http://caml.inria.fr/about/papers.en.html.
18. David MacQueen. Modules for Standard ML. In ACM Symposium on LISP and Functional Programming, pages 198-207, 1984.
19. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
20. John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10 (3):470-502, 1988.
21. Keiko Nakata and Jacques Garrigue. Recursive modules for programming. In ACM SIGPLAN International Conference on Functional Programming (ICFP), pages 74-86, Portland, Oregon, 2006.
22. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
23. Scott Owens and Matthew Flatt. From structures and functors to modules and units. In ACM SIGPLAN International Conference on Functional Programming (ICFP), pages 87-98, Portland, Oregon, 2006.
24. Claudio V. Russo. Recursive structures for Standard ML. In International Conference on Functional Programming (ICFP), pages 50-61, Florence, Italy, 2001.
25. Claudio V. Russo. Types for Modules. PhD thesis, Edinburgh University, Edinburgh, Scotland, 1998. LFCS Thesis ECS-LFCS-98-389.
26. Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1988.