Article

Free access

Separate compilation for Standard ML

Authors:

Andrew W. Appel,

David B. MacQueenAuthors Info & Claims

PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation

Pages 13 - 23

https://doi.org/10.1145/178243.178245

Published: 01 June 1994 Publication History

Abstract

Languages that support abstraction and modular structure, such as Standard ML, Modula, Ada, and (more or less) C++, may have deeply nested dependency hierarchies among source files. In ML the problem is particularly severe because ML's powerful parameterized module (functor) facility entails dependencies among implementation modules, not just among interfaces.

To efficiently compile individual modules in such languages, it is useful (in ML, necessary) to infer, digest, and cache the static environment resulting from the compilation of each module.

Our system provides a simple model of compilation and linkage that supports incremental recompilation (a restricted form of separate compilation) with type-safe linkage. This model is made available to user programs in the form of a set of internal compiler modules, a feature that we call the “visible compiler”. The chief client of this interface is the IRM incremental recompilation manager from CMU.

References

[1]

Rolf Adams, Walter Tichy, and Annette Weiner. The cost of selective recompilation and environment processing. ACM TOSEM, 1994. to appear.

Digital Library

[2]

Andrew W. Appel. Axiomatic bootstrapping: A guide for the compiler hacker. Technical Report CS-TR-451- 94, Princeton University, March 1994.

Digital Library

[3]

Andrew W. Appel and David B. MacQueen. A Standard ML compiler. In Gilles Kahn, editor, Functional Programming Languages and Computer Architecture (LNCS ~7d), pages 301-24, New York, 1987. Springer- Verlag.

Digital Library

[4]

J. G. P. Barnes. Programming in Ads plus Language Reference Manual. Addison-Wesley, New York, 1991.

Digital Library

[5]

Amber Benson and Gary Aitken. OI Programmer's Guide, June 1993.

Digital Library

[6]

Luca Cardelli. Program fragments, linking, and modularization, April 1993.

[7]

S. I. Feldman. Make - a program for maintaining computer programs. In Unix Programmer's Manual, Seventh Edition, Volume ~A. Bell Laboratories, 1979.

[8]

Jurg Gutknecht. Separate compilation in module-2: An approach to efficient symbol files, iEEE Software, pages 29-38, November 1986.

[9]

Samuel P. Harbison. Module.3. Prentice Hall, Englewood Cliffs, N J, 1992.

[10]

Robert Harper, Peter Lee, Frank Pfenning, and Eugene Rollins. Incremental recompilation for standard ml of new jersey. Technical Report CMU-CS-94-116, Department of Computer Science, Carnegie-Mellon University, February 1994.

Digital Library

[11]

Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty First Annual A CM Syrup. on Principles of Prog. Languages, pages 123-137, New York, Jan 1994. ACM Press.

[12]

Bill Kalsow and Eric Muller. SRC Module-3 Version 1.6 manual, February 1991.

[13]

Andrew Koenig. Personal communication, 1993.

[14]

Butler W. Lampson and Eric E. Schmidt. Organizing software in a distributed environment. In A CM SIGPLAN '83 Symposium on Programming Language Issues in Software Systems, pages 1-13, June 1983.

Digital Library

[15]

Peter Lee, Gene Rollins, and Robert Harper. Incremental recompilation for Standard ML. Technical Report (in preparation), Carnegie-Mellon University, 1993.

[16]

Xavier Leroy. Manifest types, modules, and separate compilation. In Twenty First Annual A CM Syrup. on Principles of Prog. Languages, pages 109-122, New York, Jan 1994. ACM Press.

[17]

David B. MacQueen. The implementation of Standard ML modules. In A CM Conf. on Lisp and Functional Programming, pages 212-23, New York, 1988. ACM Press.

Digital Library

[18]

David B. MacQueen and Mads Tofte. A semantics for higher-order functors. In Proc. European Symposium on Programming (ESOP'9~), page (to appear), April 1994.

Digital Library

[19]

Robin Milner, Mads Torte, and Robert Harper. The Definition of Standard ML. MIT Press, Cambridge, MA, 1990.

Digital Library

[20]

Greg Nelson, editor. Systems Programming with Modula-$. Prentice Hall, Englewood Cliffs, NJ, 1991.

Digital Library

[21]

Mark Rain. Avoiding trickle-down recompilation in the Mary2 implementation. Software--Practice and Experience, 14(12):1149-1157, 1984.

[22]

Ed Satterthwaite. e-mail, October 1993. Personal communication describing work done on the Cedar system at Xerox PARC in 1979-83 by Butler Lampson, Eric Schmidt, and Satterthwaite, but never published.

[23]

Zhong Shao and Andrew W. Appel. Smartest recompilation. In Proc. Twentieth Annual A CM SiGPLAN- SIGACT Symp. on Principles of Programming Languages, pages 439-450. ACM Press, 1993.

Digital Library

[24]

Mads Tofte. Principal signatures for higher-order program modules. In Nineteenth Annual A CM Syrup. on Principles of Prog. Languages, pages 189-199, New York, Jan 1992. ACM Press.

[25]

John von Neumann. First draft of a report on the EDVAC. In William Aspray and Arthur Burks, editors, Papers of John yon Neumann on Computing and Computer Theory, pages 17-82. The MIT Press, Cambridge, Massachusetts, 1945.

Cited By

Chiang TYallop JWhite LXie N(2024)Staged Compilation with Module FunctorsProceedings of the ACM on Programming Languages10.1145/36746498:ICFP(693-727)Online publication date: 15-Aug-2024
https://dl.acm.org/doi/10.1145/3674649
MacQueen DHarper RReppy J(2020)The history of Standard MLProceedings of the ACM on Programming Languages10.1145/33863364:HOPL(1-100)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3386336
Palmskog KCelik AGligoric MTip FBodden E(2018)piCoq: parallel regression proving for large-scale verification projectsProceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3213846.3213877(344-355)Online publication date: 12-Jul-2018
https://dl.acm.org/doi/10.1145/3213846.3213877
Show More Cited By

Index Terms

Separate compilation for Standard ML
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
        Modules / packages
      2. Language types
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

A separate compilation extension to standard ML
ML '06: Proceedings of the 2006 workshop on ML

We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on one another in a way specified by the programmer. A dependency may be ...
Separate compilation for Standard ML

Languages that support abstraction and modular structure, such as Standard ML, Modula, Ada, and (more or less) C++, may have deeply nested dependency hierarchies among source files. In ML the problem is particularly severe because ML's powerful ...
A simple separate compilation mechanism for block-structured languages

A very simple and efficient technique for the introduction of separate compilation facilities into compilers for block-structured languages is presented. Using this technique, programs may be compiled in parts while the compile-time checking advantages ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation

August 1994

360 pages

ISBN:089791662X

DOI:10.1145/178243

Chairmen:
Vivek Sarkar
IBM Santa Teresa Lab.
,
Barbara Ryder
Rutgers Univ., New Brunswick, NJ
,
Mary Lou Soffa
Univ. of Pittsburgh, Pittsburgh, PA

ACM SIGPLAN Notices Volume 29, Issue 6
June 1994
360 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/773473
Guest Editor:
Brent T. Hailpern
Issue’s Table of Contents

Copyright © 1994 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

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI94

Sponsor:

SIGPLAN

PLDI94: ACM SIGPLAN Conference on Programming Language Design and Implementation

June 20 - 24, 1994

Florida, Orlando, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
519
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)19

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chiang TYallop JWhite LXie N(2024)Staged Compilation with Module FunctorsProceedings of the ACM on Programming Languages10.1145/36746498:ICFP(693-727)Online publication date: 15-Aug-2024
https://dl.acm.org/doi/10.1145/3674649
MacQueen DHarper RReppy J(2020)The history of Standard MLProceedings of the ACM on Programming Languages10.1145/33863364:HOPL(1-100)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3386336
Palmskog KCelik AGligoric MTip FBodden E(2018)piCoq: parallel regression proving for large-scale verification projectsProceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3213846.3213877(344-355)Online publication date: 12-Jul-2018
https://dl.acm.org/doi/10.1145/3213846.3213877
Rossberg ATack GKornstaedt LRusso CDreyer D(2007)Status reportProceedings of the 2007 workshop on Workshop on ML10.1145/1292535.1292540(25-36)Online publication date: 2-Oct-2007
https://dl.acm.org/doi/10.1145/1292535.1292540
Tack GKornstaedt LSmolka G(2006)Generic Pickling and MinimizationElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.11.041148:2(79-103)Online publication date: 1-Mar-2006
https://dl.acm.org/doi/10.1016/j.entcs.2005.11.041
Lee PLeone M(2004)Optimizing ML with run-time code generationACM SIGPLAN Notices10.1145/989393.98944839:4(540-553)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989448
Bauer LAppel AFelten E(2003)Mechanisms for secure modular programming in JavaSoftware—Practice & Experience10.1002/spe.51633:5(461-480)Online publication date: 25-Apr-2003
https://dl.acm.org/doi/10.1002/spe.516
Lee OYi KPaek Y(2002)A proof method for the corectness of modularized OCFAInformation Processing Letters10.1016/S0020-0190(01)00223-X81:4(179-185)Online publication date: 28-Feb-2002
https://dl.acm.org/doi/10.1016/S0020-0190%2801%2900223-X
Blume MAppel A(1999)Hierarchical modularityACM Transactions on Programming Languages and Systems10.1145/325478.32551821:4(813-847)Online publication date: 1-Jul-1999
https://dl.acm.org/doi/10.1145/325478.325518
Cardelli LLee PHenglein FJones N(1997)Program fragments, linking, and modularizationProceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/263699.263735(266-277)Online publication date: 1-Jan-1997
https://dl.acm.org/doi/10.1145/263699.263735
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents