First-class stores and partial continuations in a programming language and environment

Authors:
Gregory F Johnson;Dominic Duggan
Affiliations:
Department of Computer Science, University of Maryland, College Park, Maryland, U.S.A.;Department of Computer Science, University of Maryland, College Park, Maryland, U.S.A.
Venue:
Computer Languages
Year:
1994

Citing 12
Cited 0

Making data structures persistent

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Revised report on the algorithmic language scheme

ACM SIGPLAN Notices
Memory allocation and higher-order functions

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
The theory and practice of first-class prompts

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Demonic memory for process histories

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Debugging standard ML without reverse engineering

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
CML: A higher concurrent language

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Constraining control

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Deriving Target Code as a Representation of Continuation Semantics

ACM Transactions on Programming Languages and Systems (TOPLAS)
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept

Communications of the ACM
The next 700 programming languages

Communications of the ACM
A proposal for standard ML

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the GL programming language and its debugger, it is possible at essentially any point during program execution to capture the entire data state (the extant store) or the control state (the sequence of pending function invocations, represented using a new construct called partial continuations). These artifacts of program execution can be bound to identifiers or placed in storage cells and subsequently manipulated either from within the executing program or interactively from the debugging environment. The captured data states and control states can be interactively examined, reasoned about and experimentally executed. This paper describes the design of a language and debugging environment that supports these two capabilities, with particular attention given to the implications of having them both in the same language. For the new features to be useful they must be efficient, and a description is given of the techniques that were used to achieve an acceptable level of efficiency.