From structures and functors to modules and units

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

Volumn 2006, Issue , 2006, Pages 87-98

  Owens, Scott ^a   Flatt, Matthew ^a  

^a UNIVERSITY OF UTAH   (United States)

Author keywords

Component; Functor; Module; Structure; Unit

Indexed keywords

EXTERNAL LINKING; INTERNALLY-LINKED MODULE; PROGRAMMING TECHNIQUES; SML-STYLE SYSTEM;

ABSTRACTING; COMPUTER PROGRAMMING; RECURSIVE FUNCTIONS;

DATA STRUCTURES;

EID: 34247236248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159803.1159815     Document Type: Conference Paper

References (32)

1. D. Ancona, F. Damiani, S. Drossopoulou, and E. Zucca. Polymorphic bytecode: compositional compilation for Java-like languages. In Proc. Principles of Programming Languages, 2005.
2. D. Ancona and E. Zucca. True modules for Java-like languages. In Proc. European Conference on Object-Oriented Programming, 2001.
3. D. Ancona and E. Zucca. A calculus of module systems. J. Funct. Program., 12(2):91-132, 2002.
4. M. Blume and A. W. Appel. Hierarchical modularity. ACM Trans. Program. Lang. Syst., 21(4):813-847, 1999.
5. G. Boudol. The recursive record semantics of objects revisited. J. Funct. Program., 14(3):263-315, 2004.
6. H. Cejtin, M. Fluet, S. Jagannathan, and S. Weeks. Formal specification of the ML basis system, http://mlton.org/pages/MLBasis/attachments/mlb-formal. pdf. January 2005.
7. K. Crary, R. Harper, and S. Puri. What is a recursive module? In Proc. Programming Language Design and Implementation, 1999.
8. D. Dreyer. A type system for well-founded recursion. In Proc. Principles of Programming Languages, 2004.
9. D. Dreyer. Recursive type generativity. In Proc. International Conference on Functional Programming, 2005.
10. D. Dreyer. Understanding and Evolving the ML Module System. PhD thesis, Carnegie Mellon University, 2005.
11. D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proc. Principles of Programming Languages, 2003.
12. D. Duggan and C. Sourelis. Mixin modules. In Proc. International Conference on Functional Programming, 1996.
13. M. Flatt and M. Felleisen. Units: Cool modules for HOT languages. In Proc. Programming Language Design and Implementation, 1998.
14. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Proc. Principles of Programming Languages, 1994.
15. T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. ACM Trans. Program. Lang. Syst., 27(5):857-881, 2005.
16. T. Hirschowitz, X. Leroy, and J. B. Wells. Compilation of extended recursion in call-by-value functional languages. In Proc. Principles and Practice of Declarative Programming, 2003.
17. T. Hirschowitz, X. Leroy, and J. B. Wells. Call-by-value mixin modules: Reduction semantics, side effects, types. In Proc. The European Symposium on Programming, 2004.
18. S. P. Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
19. R. Kelsey, J. Rees, and M. Sperber. Scheme48 Reference Manual, 1.3 edition, 2005. http://s48.org/1.3/s48manual.pdf.
20. X. Leroy. Manifest types, modules, and separate compilation. In Proc. Principles of Programming Languages, 1994.
21. X. Leroy. The Objective Caml System, 3.08 edition, 2004. http://caml.inria.fr/pub/docs/manual-ocaml/index.html.
22. H. Makholm and J. B. Wells, type inference, principal typings, and let-polymorphism for first-class mixin modules. In Proc. International Conference on Functional Programming, 2005.
23. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Massachusetts, 1997.
24. M. Odersky and M. Zenger. Scalable component abstractions. In Proc. Object Oriented Programming, Systems, Languages, and Applications, 2005.
25. C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
26. C. V. Russo. Recursive structures for Standard ML. In Proc. International Conference on Functional Programming, 2001.
27. M. Serrano. Bigloo: A "practical Scheme compiler", 2.6e edition, Aug. 2004. http://www-sop.inria.fr/mimosa/fp/Bigloo/doc/bigloo.html.
28. D. Swasey, T. Murphy VII, K. Crary, and R. Harper. A separate compilation extension to Standard ML (working draft). Technical Report CMU-CS-06-104, School of Computer Science, Carnegie Mellon University, January 2006.
29. D. Syme. Initializing mutually referential abstract objects: The value recursion challenge. In Proc. Workshop on ML, 2005.
30. C. Szyperski. Component Software: Beyond Object-Oriented Programming. Addison-Wesley, New York, 1997.
31. O. Waddell and R. K. Dybvig. Extending the scope of syntactic abstraction. In Proc. Principles of Programming Languages, 1999.
32. J. B. Wells and R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In Proc. European Symposium on Programming Languages and Systems, 2000.