Libraries as programs preserved within compiler continuations

Authors:
Mark B. Wells;Margaret A. Hug;Rollo Silver
Affiliations:
New Mexico State University, Laz Cruces, NM;New Mexico State University, Laz Cruces, NM;Science Associates of Lama, San Cristobal, NM
Venue:
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Year:
1985

Citing 11
Cited 2

Polymorphic programming languages: design and implementation

Polymorphic programming languages: design and implementation
A simple separate compilation mechanism for block-structured languages

IEEE Transactions on Software Engineering
Principles of programming languages: design, evaluation, and implementation (2nd ed.)

Principles of programming languages: design, evaluation, and implementation (2nd ed.)
The paradigms of programming

Communications of the ACM
Modules for standard ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Garbage collection in a large LISP system

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Trading data space for reduced time and code space in real-time garbage collection on stock hardware

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Continuations and coroutines

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The scheme 311 compiler an exercise in denotational semantics

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Modcap reference manual

ACM SIGPLAN Notices
Programming in Modula-2

Programming in Modula-2

Identifiers and static name abstraction

ACM SIGPLAN Notices
A concurrent N ≤ 8 Queens' algorithm using modcap

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to library organization for block-structured languages is given that avoids corrupting such structuring with the introduction of “modules”, “units”, or “packages”. The scheme involves retentive block structuring and the preservation of partially compiled programs as compiler continuations. Its chief advantage is language simplicity. Its chief disadvantage is, at the present, its proclivity towards redundant file storage. This can possibly be eliminated by adopting a computational model using a one-level store.