Article

Modules, abstract types, and distributed versioning

Author:

Peter SewellAuthors Info & Claims

POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2001

Pages 236 - 247

https://doi.org/10.1145/360204.360225

Published: 01 January 2001 Publication History

Abstract

In a wide-area distributed system it is often impractical to synchronise software updates, so one must deal with many coexisting versions. We study static typing support for modular wide-area programming, modelling separate compilation/linking and execution of programs that interact along typed channels. Interaction may involve communication of values of abstract types; we provide the developer with fine-grain versioning control of these types to support interoperation of old and new code. The system makes use of a second-class module system with singleton kinds; we give a novel operational semantics for separate compilation/linking and execution and prove soundness.

References

[1]

J. L. Armstrong, M. C. Williams, C. Wikstrom, and S. R. Virding. Concurrent Programming in Erlang. Prentice Hall, 2nd edition, 1995.]]

Digital Library

[2]

Matthias Blume and Andrew W. Appel. Hierarchical modularity. ACM Transactions on Programming Languages and Systems, 21(4):813-847, July 1999.]]

Digital Library

[3]

L. Cardelli. Program fragments, linking, and modularization. In POPL'97, pages 266-277, January 1997.]]

Digital Library

[4]

Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan, Bill Kalsow, and Greg Nelson. Modula-3 report (revised). Technical report, DEC SRC, September 1989. SRC-052.]]

[5]

L. Cardelli and X. Leroy. Abstract types and the dot notation. In Programming Concepts and Methods, IFIP State of the Art Reports, pages 479-504. North Holland, March 1990. Also appeared as SRC Research Report 56.]]

[6]

Sophia Drossopoulou. Towards an abstract model of Java dynamic linking and verification. In Preliminary Proceedings of the Third Workshop on Types in Compilation (TIC 2000). CMU Technical Report CMU-CS-00- 161, September 2000.]]

Digital Library

[7]

Dominic Duggan. Sharing in typed module assembly language. In Preliminary Proceedings of the Third Workshop on Types in Compilation (TIC 2000). CMU Technical Report CMU-CS- 00-161, September 2000.]]

Digital Library

[8]

M. Flatt and M. Felleisen. Units: Cool modules for hot languages. In PLDI 98, pages 236-248, 1998.]]

Digital Library

[9]

Cedric Fournet, Georges Gonthier, Jean- Jacques Levy, Luc Maranget, and Didier Remy. A calculus of mobile agents. In Proceedings of CONCUR '96. LNCS 1119, pages 406-421. Springer-Verlag, August 1996.]]

Digital Library

[10]

Neal Glew and Greg Morrisett. Type-safe linking and modular assembly language. In Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, pages 250-261, New York, NY, January 1999. ACM.]]

Digital Library

[11]

Robert Harper and Mark Lillibridge. A typetheoretic approach to higher-order modules with sharing. In Conference record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 123-137, January 1994.]]

Digital Library

[12]

Michael Hicks and Scott Nettles. Active networking means evolution (or enhanced extensibility required). In Proceedings of the Second International Working Conference on Active Networks, October 2000.]]

Digital Library

[13]

Michael Hicks, Stephanie Weirich, and Karl Crary. Safe and exible dynamic linking of native code. In Preliminary Proceedings of the Third Workshop on Types in Compilation (TIC 2000). CMU Technical Report CMU-CS- 00-161, September 2000.]]

Digital Library

[14]

Xavier Leroy. Manifest types, modules, and separate compilation. In Conference Record of POPL '94: 21ST ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, pages 109-122, New York, NY, January 1994. ACM.]]

Digital Library

[15]

Xavier Leroy. A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5):667-698, 1996.]]

[16]

Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269-303, May 2000.]]

Digital Library

[17]

Mark Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, CMU, 1997. CMU-CS-97-122.]]

[18]

R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1):1-77, 1992.]]

Digital Library

[19]

Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. The MIT Press, Cambridge, Mass., 1990.]]

Digital Library

[20]

Martin Odersky. Polarized name passing. In Proceedings of FSTTCS '95. LNCS 1026, December 1995.]]

Digital Library

[21]

Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409- 454, 1996.]]

[22]

Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the picalculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000.]]

Digital Library

[23]

Claudio V. Russo. Types For Modules. PhD thesis, University of Edinburgh, LFCS, 1998. ECS-LFCS-98-389.]]

[24]

Peter Sewell. Modules, abstract types, and distributed versioning. Technical Report 506, University of Cambridge, 2000. Available from http://www.cl.cam.ac.uk/users/pes20/.]]

[25]

Peter Sewell, Pawel T. Wojciechowski, and Benjamin C. Pierce. Location independence for mobile agents. In Proceedings of the Workshop on Internet Programming Languages (Chicago), May 1998. Full version appeared in LNCS 1686.]]

Digital Library

[26]

Asis Unyapoth and Peter Sewell. Nomadic Pict: Correct communication infrastructure for mobile computation. In Proceedings of POPL 2001, January 2001. To appear.]]

Digital Library

[27]

Pawel T. Wojciechowski. Nomadic Pict: Language and Infrastructure Design for Mobile Computation. PhD thesis, Computer Laboratory, University of Cambridge, June 2000. Available as Technical Report 492.]]

[28]

Pawel T. Wojciechowski and Peter Sewell. Nomadic Pict: Language and infrastructure design for mobile agents. IEEE Concurrency, 8(2):42-52, April-June 2000. Extended version of a paper in ASA/MA 99.]]

Digital Library

[29]

Steve Zdancewic, Dan Grossman, and Greg Morrisett. Principals in programming languages: A syntactic proof technique. In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP99), volume 34.9 of ACM Sigplan Notices, pages 197-207, N.Y., September 27- 29 1999. ACM Press.]]

Cited By

Ahmed AJamner DSiek JWadler P(2017)Theorems for free for free: parametricity, with and without typesProceedings of the ACM on Programming Languages10.1145/31102831:ICFP(1-28)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110283
Hardock SPetrov IGottstein RBuchmann A(2013)NoFTLProceedings of the VLDB Endowment10.14778/2536274.25362956:12(1278-1281)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.14778/2536274.2536295
Shkapsky AZeng KZaniolo C(2013)Graph queries in a next-generation Datalog systemProceedings of the VLDB Endowment10.14778/2536274.25362906:12(1258-1261)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.14778/2536274.2536290
Show More Cited By

Index Terms

Modules, abstract types, and distributed versioning

Recommendations

Modules, abstract types, and distributed versioning

In a wide-area distributed system it is often impractical to synchronise software updates, so one must deal with many coexisting versions. We study static typing support for modular wide-area programming, modelling separate compilation/linking and ...
Read More
Modeling abstract types in modules with open existential types
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We propose F-zip, a calculus of open existential types that is an extension of System F obtained by decomposing the introduction and elimination of existential types into more atomic constructs. Open existential types model modular type abstraction as ...
Read More
Modeling abstract types in modules with open existential types
POPL '09

We propose F-zip, a calculus of open existential types that is an extension of System F obtained by decomposing the introduction and elimination of existential types into more atomic constructs. Open existential types model modular type abstraction as ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2001

304 pages

ISBN:1581133367

DOI:10.1145/360204

Chairmen:
Chris Hankin
Imperial College, London, U. K.
,
Dave Schmidt
Kansas State Univ., Manhattan

ACM SIGPLAN Notices Volume 36, Issue 3
March 2001
303 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/373243
Editors:
Cindy Norris
Appalachian State Univ., Boone, NC
,
James B. Fenwick
Appalachian State Univ., Boone, NC
Issue’s Table of Contents

Copyright © 2001 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: 01 January 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL01

Sponsor:

POPL01: The 28th Annual ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages

London, United Kingdom

Acceptance Rates

POPL '01 Paper Acceptance Rate 24 of 126 submissions, 19%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

44
Total Citations
View Citations
485
Total Downloads

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

Other Metrics

View Author Metrics

Citations

Cited By

Ahmed AJamner DSiek JWadler P(2017)Theorems for free for free: parametricity, with and without typesProceedings of the ACM on Programming Languages10.1145/31102831:ICFP(1-28)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110283
Hardock SPetrov IGottstein RBuchmann A(2013)NoFTLProceedings of the VLDB Endowment10.14778/2536274.25362956:12(1278-1281)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.14778/2536274.2536295
Shkapsky AZeng KZaniolo C(2013)Graph queries in a next-generation Datalog systemProceedings of the VLDB Endowment10.14778/2536274.25362906:12(1258-1261)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.14778/2536274.2536290
Park HGarcia-Molina HPang RPolyzotis NParameswaran AWidom J(2012)DecoProceedings of the VLDB Endowment10.14778/2367502.23675555:12(1990-1993)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.14778/2367502.2367555
Neis GDreyer DRossberg A(2011)Non-parametric parametricityJournal of Functional Programming10.1017/S095679681100016521:4-5(497-562)Online publication date: 1-Sep-2011
https://dl.acm.org/doi/10.1017/S0956796811000165
Sewell PWojciechowski PUnyapoth A(2010)Nomadic pictACM Transactions on Programming Languages and Systems10.1145/1734206.173420932:4(1-63)Online publication date: 22-Apr-2010
https://dl.acm.org/doi/10.1145/1734206.1734209
Neis GDreyer DRossberg A(2009)Non-parametric parametricityACM SIGPLAN Notices10.1145/1631687.159657244:9(135-148)Online publication date: 31-Aug-2009
https://dl.acm.org/doi/10.1145/1631687.1596572
Neis GDreyer DRossberg AHutton GTolmach A(2009)Non-parametric parametricityProceedings of the 14th ACM SIGPLAN international conference on Functional programming10.1145/1596550.1596572(135-148)Online publication date: 31-Aug-2009
https://dl.acm.org/doi/10.1145/1596550.1596572
Rellermeyer JDuller MAlonso G(2008)Consistently applying updates to compositions of distributed OSGi modulesProceedings of the 1st International Workshop on Hot Topics in Software Upgrades10.1145/1490283.1490295(1-5)Online publication date: 20-Oct-2008
https://dl.acm.org/doi/10.1145/1490283.1490295
Rossberg A(2008)Dynamic Translucency with Abstraction Kinds and Higher-Order CoercionsElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2008.10.019218(313-336)Online publication date: 1-Oct-2008
https://dl.acm.org/doi/10.1016/j.entcs.2008.10.019
Show More Cited By

View Options

Get Access

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