From structures and functors to modules and units

ABSTRACT

Component programming techniques encourage abstraction and reuse through external linking. Some parts of a program, however, must use concrete, internally specified references, so a pure component system is not a sufficient mechanism for structuring programs. We present the combination of a static, internally-linked module system and a purely abstractive component system. The latter extends our previous model of typed units to properly account for translucency and sharing. We also show how units and modules can express an SML-style system of structures and functors, and we explore the consequences for recursive structures and functors.

REFERENCES

• 1: Davide Ancona , Ferruccio Damiani , Sophia Drossopoulou , Elena Zucca, Polymorphic bytecode: compositional compilation for Java-like languages, Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.26-37, January 12-14, 2005, Long Beach, California, USA
• 2: Davide Ancona , Elena Zucca, True Modules for Java-like Languages, Proceedings of the 15th European Conference on Object-Oriented Programming, p.354-380, June 18-22, 2001
• 3: Davide Ancona , Elena Zucca, A calculus of module systems, Journal of Functional Programming, v.12 n.2, p.91-132, March 2002 [doi>10.1017/S0956796801004257]
• 4: Matthias Blume , Andrew W. Appel, Hierarchical modularity, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.4, p.813-847, July 1999 [doi>10.1145/325478.325518]
• 5: Gérard Boudol, The recursive record semantics of objects revisited, Journal of Functional Programming, v.14 n.3, p.263-315, May 2004 [doi>10.1017/S0956796803004775]
• 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: Karl Crary , Robert Harper , Sidd Puri, What is a recursive module?, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, p.50-63, May 01-04, 1999, Atlanta, Georgia, United States
• 8: Derek Dreyer, A type system for well-founded recursion, Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.293-305, January 14-16, 2004, Venice, Italy
• 9: Derek Dreyer, Recursive type generativity, Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, September 26-28, 2005, Tallinn, Estonia
• 10: Derek Dreyer , Robert Harper , Karl Crary, Understanding and evolving the ml module system, Carnegie Mellon University, Pittsburgh, PA, 2005
• 11: Derek Dreyer , Karl Crary , Robert Harper, A type system for higher-order modules, Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.236-249, January 15-17, 2003, New Orleans, Louisiana, USA
• 12: Dominic Duggan , Constantinos Sourelis, Mixin modules, Proceedings of the first ACM SIGPLAN international conference on Functional programming, p.262-273, May 24-26, 1996, Philadelphia, Pennsylvania, United States
• 13: Matthew Flatt , Matthias Felleisen, Units: cool modules for HOT languages, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, p.236-248, June 17-19, 1998, Montreal, Quebec, Canada
• 14: Robert Harper , Mark Lillibridge, A type-theoretic approach to higher-order modules with sharing, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.123-137, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.176927]
• 15: Tom Hirschowitz , Xavier Leroy, Mixin modules in a call-by-value setting, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.5, p.857-881, September 2005 [doi>10.1145/1086642.1086644]
• 16: Tom Hirschowitz , Xavier Leroy , J. B. Wells, Compilation of extended recursion in call-by-value functional languages, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, p.160-171, August 27-29, 2003, Uppsala, Sweden [doi>10.1145/888251.888267]
• 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: Xavier Leroy, Manifest types, modules, and separate compilation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.109-122, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.176926]
• 21: X. Leroy. The Objective Caml System, 3.08 edition, 2004. http://caml.inria.fr/pub/docs/manual-ocaml/index.html.
• 22: Henning Makholm , J. B. Wells, Type inference, principal typings, and let-polymorphism for first-class mixin modules, Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, September 26-28, 2005, Tallinn, Estonia
• 23: Robin Milner , Mads Tofte , David Macqueen, The Definition of Standard ML, MIT Press, Cambridge, MA, 1997
• 24: Martin Odersky , Matthias Zenger, Scalable component abstractions, Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications, October 16-20, 2005, San Diego, CA, USA
• 25: Chris Okasaki, Purely functional data structures, Cambridge University Press, New York, NY, 1998
• 26: Claudio V. Russo, Recursive structures for standard ML, Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, September 03-05, 2001, Florence, Italy
• 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: Clemens Szyperski, Component software: beyond object-oriented programming, ACM Press/Addison-Wesley Publishing Co., New York, NY, 1998
• 31: Oscar Waddell , R. Kent Dybvig, Extending the scope of syntactic abstraction, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.203-215, January 20-22, 1999, San Antonio, Texas, United States [doi>10.1145/292540.292559]
• 32: J. B. Wells , René Vestergaard, Equational Reasoning for Linking with First-Class Primitive Modules, Proceedings of the 9th European Symposium on Programming Languages and Systems, p.412-428, April 02, 2000

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Modules, packages

General Terms:
Design, Languages

Keywords:
component, functor, module, structure, unit