F-ing modules

TLDI'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Types in Language Design and Implementation

Volumn , Issue , 2010, Pages 89-101

  Rossberg, Andreas ^a   Russo, Claudio V ^b   Dreyer, Derek ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Abstract data types; Elaboration; Existential types; First class modules; ML modules; System F; Type systems

Indexed keywords

ABSTRACT DATA TYPES; COMPOSITIONAL TRANSLATION; EXISTENTIAL TYPES; FUNCTORS; HIGHER ORDER; REUSABLE COMPONENTS; STANDARD ML; SYSTEM F; TYPE SYSTEMS; TYPE THEORY;

ABSTRACTING; CALCULATIONS; COMPUTER SOFTWARE REUSABILITY; SEMANTICS; TECHNICAL PRESENTATIONS;

LINGUISTICS;

EID: 77950793227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1708016.1708028     Document Type: Conference Paper

References (45)

1. B. Aydemir, A. Charguéraud, B. C. Pierce, R. Pollack, and S. Weirich. Engineering formal metatheory. In POPL '08.
2. B. Aydemir, S. Weirich, and S. Zdancewic. Abstracting syntax. Technical Report MS-CIS-09-106, U. Penn, 2009.
3. S. K. Biswas. Higher-order functors with transparent signatures. In POPL '95.
4. Coq Development Team. The Coq proof assistant reference manual, v. 8.1. INRIA, 2007. http://coq.inria.fr/.
5. D. Dreyer. A type system for recursive modules. In ICFP '07.
6. D. Dreyer. Understanding and Evolving the ML Module System. PhD thesis, CMU, 2005.
7. D. Dreyer. Recursive type generativity. JFP, 17(4&5):433-471, 2007.
8. D. Dreyer and M. Blume. Principal type schemes for modular programs. In ESOP '07.
9. D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In POPL '03.
10. D. Dreyer, K. Crary, and R. Harper. Moscow ML's higher-order modules are unsound, 17 September 2002. (Types Forum).
11. D. Dreyer and A. Rossberg. Mixin' up the ML module system. In ICFP '08.
12. M. Elsman. Program Modules, Separate Compilation, and Intermodule Optimisation. PhD thesis, U. of Copenhagen, 1999.
13. G. Ghelli and B. Pierce. Bounded existentials and minimal typing. TCS, 193(1-2):75-96, 1998.
14. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
15. R. Harper. Programming in Standard ML. Working draft available at: http://www.cs.cmu.edu/~rwh/smlbook/.
16. R. Harper and M. Lillibridge. A type-theoretic approach to higherorder modules with sharing. In POPL '94.
17. R. Harper and J. C. Mitchell. On the type structure of Standard ML. In TOPLAS, volume 15(2), pages 211-252, 1993.
18. R. Harper, J. C. Mitchell, and E. Moggi. Higher-order modules and the phase distinction. In POPL '90.
19. R. Harper and B. Pierce. Design considerations for ML-style module systems. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 8. MIT Press, 2005.
20. R. Harper and C. Stone. A type-theoretic interpretation of Standard ML. In Proof, Language, and Interaction: Essays in Honor of Robin Milner. MIT Press, 2000.
21. A. Igarashi, B. C. Pierce, and P. Wadler. Featherweight Java: A minimal core calculus for Java and GJ. TOPLAS, 23(3), 2001.
22. M. P. Jones. Using parameterized signatures to express modular structure. In POPL '96.
23. J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation, 8(4):293-341, Dec. 1995.
24. D. K. Lee, K. Crary, and R. Harper. Towards a mechanized metatheory of Standard ML. In POPL '07.
25. X. Leroy. Applicative functors and fully transparent higher-order modules. In POPL '95.
26. X. Leroy. A syntactic theory of type generativity and sharing. JFP, 6(5):1-32, September 1996.
27. X. Leroy. A modular module system. JFP, 10(3):269-303, 2000.
28. M. Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, CMU, 1997.
29. D. MacQueen. Using dependent types to express modular structure. In POPL '86.
30. D. MacQueen and M. Tofte. A semantics for higher-order functors. In ESOP '94.
31. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
32. J. C. Mitchell and G. D. Plotkin. Abstract types have existential type. TOPLAS, 10(3):470-502, July 1988.
33. B. Montagu and D. Rémy. Modeling abstract types in modules with open existential types. In POPL '09.
34. L. C. Paulson. ML for the Working Programmer, 2nd Edition. Cambridge University Press, 1996.
35. S. Peyton Jones. Wearing the hair shirt: a retrospective on Haskell. Invited talk, POPL '03.
36. C. V. Russo. Non-dependent types for Standard ML modules. In PPDP '99.
37. C. V. Russo. Types For Modules. PhD thesis, LFCS, University of Edinburgh, 1998.
38. C. V. Russo. First-class structures for Standard ML. Nordic Journal of Computing, 7(4):348-374, November 2000.
39. C. V. Russo. Types for Modules. ENTCS, 60, 2003. Chapter 10.
40. ω and Haskell, 2004. http://www.cs.rutgers.edu/~ccshan/xlate/xlate.pdf.
41. Z. Shao. Transparent modules with fully syntactic signatures. In ICFP '99.
42. M. Shields and S. Peyton Jones. First-class modules for Haskell. In FOOL 9, 2002.
43. C. A. Stone and R. Harper. Extensional equivalence and singleton types. TOCL, 7(4):676-722, 2006.
44. M. Sulzmann, M. M. T. Chakravarty, S. Peyton Jones, and K. Donnelly. System F with type equality coercions. In TLDI '07.
45. M. Torgersen, E. Ernst, and C. P. Hanser. Wild FJ. In FOOL 12, 2005.