Recycling Continuations

Recycling Continuations (1998)

by Jonathan Sobel , Daniel P. Friedman

Citations:

40 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Recycling Continuations	user correction - Legacy Corrections
AUTHOR NAME	Jonathan Sobel	user correction - Legacy Corrections
AUTHOR NAME	Daniel P. Friedman	user correction - Legacy Corrections
ABSTRACT	If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be #recycled." Once they have served their purpose as temporary, intermediate structures for managing program control, the space they occupy can be reused for the structures that the programs produce as their output. To effect this immediate memory reclamation, we use a sequence of correctness-preserving program transformations, demonstrated through a series of simple examples. We then apply the transformations to general anamorphism operators, with the important consequence that all #nite-output anamorphisms can now be run without anystack- or continuationspace overhead. 1 Introduction The runtime architecture for a language implementation keeps track of the continuations of procedure calls using either a stack of call frames or a linked chain of heapallocated continuation structures. One advantage that may be claimed for the stack approach is that deallocatio...	user correction - Legacy Corrections
YEAR	1998	user correction - Legacy Corrections
CITATIONS	8 found	ParsCit 1.0