Article

From structures and functors to modules and units

Authors:

Matthew FlattAuthors Info & Claims

ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming

Pages 87 - 98

https://doi.org/10.1145/1159803.1159815

Published: 16 September 2006 Publication History

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]

D. Ancona, F. Damiani, S. Drossopoulou, and E. Zucca. Polymorphic bytecode: compositional compilation for Java-like languages. In Proc. Principles of Programming Languages, 2005.]]

Digital Library

[2]

D. Ancona and E. Zucca. True modules for Java-like languages. In Proc. European Conference on Object-Oriented Programming, 2001.]]

Digital Library

[3]

D. Ancona and E. Zucca. A calculus of module systems. J. Funct. Program., 12(2):91--132, 2002.]]

Digital Library

[4]

M. Blume and A. W. Appel. Hierarchical modularity. ACM Trans. Program. Lang. Syst., 21(4):813--847, 1999.]]

Digital Library

[5]

G. Boudol. The recursive record semantics of objects revisited. J. Funct. Program., 14(3):263--315, 2004.]]

Digital Library

[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.]]

Digital Library

[8]

D. Dreyer. A type system for well-founded recursion. In Proc. Principles of Programming Languages, 2004.]]

Digital Library

[9]

D. Dreyer. Recursive type generativity. In Proc. International Conference on Functional Programming, 2005.]]

Digital Library

[10]

D. Dreyer. Understanding and Evolving the ML Module System. PhD thesis, Carnegie Mellon University, 2005.]]

Digital Library

[11]

D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proc. Principles of Programming Languages, 2003.]]

Digital Library

[12]

D. Duggan and C. Sourelis. Mixin modules. In Proc. International Conference on Functional Programming, 1996.]]

Digital Library

[13]

M. Flatt and M. Felleisen. Units: Cool modules for HOT languages. In Proc. Programming Language Design and Implementation, 1998.]]

Digital Library

[14]

R. Harper and M. Lillibridge. A type-theoretic approach to higherorder modules with sharing. In Proc. Principles of Programming Languages, 1994.]]

Digital Library

[15]

T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. ACM Trans. Program. Lang. Syst., 27(5):857--881, 2005.]]

Digital Library

[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 Declaritive Programming, 2003.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[23]

R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Massachusetts, 1997.]]

Digital Library

[24]

M. Odersky and M. Zenger. Scalable component abstractions. In Proc. Object Oriented Programming, Systems, Languages, and Applications, 2005.]]

Digital Library

[25]

C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.]]

Digital Library

[26]

C.V. Russo. Recursive structures for Standard ML. In Proc. International Conference on Functional Programming, 2001.]]

Digital Library

[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.]]

Digital Library

[31]

O. Waddell and R.K. Dybvig. Extending the scope of syntactic abstraction. In Proc. Principles of Programming Languages, 1999.]]

Digital Library

[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.]]

Digital Library

Cited By

Leyzberg DRamachandran AScassellati B(2018)The Effect of Personalization in Longer-Term Robot TutoringACM Transactions on Human-Robot Interaction10.1145/32834537:3(1-19)Online publication date: 5-Dec-2018
https://dl.acm.org/doi/10.1145/3283453
Che YCulbertson HTang CAich SOkamura A(2018)Facilitating Human-Mobile Robot Communication via Haptic Feedback and Gesture TeleoperationACM Transactions on Human-Robot Interaction10.1145/32435037:3(1-23)Online publication date: 16-Nov-2018
https://dl.acm.org/doi/10.1145/3243503
Nikolaidis SKwon MForlizzi JSrinivasa S(2018)Planning with Verbal Communication for Human-Robot CollaborationACM Transactions on Human-Robot Interaction10.1145/32033057:3(1-21)Online publication date: 16-Nov-2018
https://dl.acm.org/doi/10.1145/3203305
Show More Cited By

Index Terms

From structures and functors to modules and units
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Modules / packages

Recommendations

From structures and functors to modules and units
Proceedings of the 2006 ICFP conference

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 ...
Generalized Lowen functors
Topology

According to their value ranges, L-topological spaces form different categories. Clearly, the investigation on their relationships is certainly important and necessary. Lowen was one of the first authors who had studied the relation between the category ...
Results on the use of category theory for the study of lattice-valued finite state machines

In this paper, we introduce the concepts of category of lattice-valued finite state machines, category of quasi-lattice-valued transformation semigroups, category of quasi-lattice-valued transformation monoids, category of lattice-valued transformation ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming

September 2006

308 pages

ISBN:1595933093

DOI:10.1145/1159803

General Chair:
John Reppy
University of Chicago, USA
,
Program Chair:
Julia Lawall
University of Copenhagen, Denmark

ACM SIGPLAN Notices Volume 41, Issue 9
Proceedings of the 2006 ICFP conference
September 2006
296 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1160074
Issue’s Table of Contents

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 September 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICFP06

Sponsor:

ICFP06: ACM SIGPLAN International Conference on Functional Programming

September 16 - 21, 2006

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
368
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Leyzberg DRamachandran AScassellati B(2018)The Effect of Personalization in Longer-Term Robot TutoringACM Transactions on Human-Robot Interaction10.1145/32834537:3(1-19)Online publication date: 5-Dec-2018
https://dl.acm.org/doi/10.1145/3283453
Che YCulbertson HTang CAich SOkamura A(2018)Facilitating Human-Mobile Robot Communication via Haptic Feedback and Gesture TeleoperationACM Transactions on Human-Robot Interaction10.1145/32435037:3(1-23)Online publication date: 16-Nov-2018
https://dl.acm.org/doi/10.1145/3243503
Nikolaidis SKwon MForlizzi JSrinivasa S(2018)Planning with Verbal Communication for Human-Robot CollaborationACM Transactions on Human-Robot Interaction10.1145/32033057:3(1-21)Online publication date: 16-Nov-2018
https://dl.acm.org/doi/10.1145/3203305
Luiz ALung LCorreia M(2014)MITRAACM SIGMOD Record10.1145/2627692.262769943:1(32-38)Online publication date: 13-May-2014
https://dl.acm.org/doi/10.1145/2627692.2627699
McGregor A(2014)Graph stream algorithmsACM SIGMOD Record10.1145/2627692.262769443:1(9-20)Online publication date: 13-May-2014
https://dl.acm.org/doi/10.1145/2627692.2627694
Kilpatrick SDreyer DPeyton Jones SMarlow S(2014)BackpackACM SIGPLAN Notices10.1145/2578855.253588449:1(19-31)Online publication date: 8-Jan-2014
https://dl.acm.org/doi/10.1145/2578855.2535884
Kilpatrick SDreyer DPeyton Jones SMarlow SJagannathan SSewell P(2014)BackpackProceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2535838.2535884(19-31)Online publication date: 11-Jan-2014
https://dl.acm.org/doi/10.1145/2535838.2535884
Rossberg ADreyer D(2013)Mixin’ Up the ML Module SystemACM Transactions on Programming Languages and Systems10.1145/2450136.245013735:1(1-84)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1145/2450136.2450137
Im HNakata KGarrigue JPark S(2011)A syntactic type system for recursive modulesACM SIGPLAN Notices10.1145/2076021.204814146:10(993-1012)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2076021.2048141
Im HNakata KGarrigue JPark SLopes CFisher K(2011)A syntactic type system for recursive modulesProceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications10.1145/2048066.2048141(993-1012)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2048066.2048141
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents