Representing Control in the Presence of First-Class Continuations

Representing Control in the Presence of First-Class Continuations (1990)

Cached

Download Links

[www.cs.indiana.edu.]
[www.cs.indiana.edu]

Other Repositories/Bibliography

DBLP

by Robert Hieb , R. Kent Dybvig , Carl Bruggeman

Venue:	In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation
Citations:	70 - 11 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Representing Control in the Presence of First-Class Continuations	user correction - Legacy Corrections
AUTHOR NAME	Robert Hieb	SVM HeaderParse 0.1
AUTHOR AFFIL	Indiana University; Computer Science Department	SVM HeaderParse 0.2
AUTHOR ADDR	Lindley Hall 101; Bloomington IN 47405	SVM HeaderParse 0.1
AUTHOR NAME	R. Kent Dybvig	SVM HeaderParse 0.1
AUTHOR AFFIL	Indiana University; Computer Science Department	SVM HeaderParse 0.2
AUTHOR ADDR	Lindley Hall 101; Bloomington IN 47405	SVM HeaderParse 0.1
AUTHOR NAME	Carl Bruggeman	SVM HeaderParse 0.1
AUTHOR AFFIL	Indiana University; Computer Science Department	SVM HeaderParse 0.2
AUTHOR ADDR	Lindley Hall 101; Bloomington IN 47405	SVM HeaderParse 0.1
ABSTRACT	Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a heap has proven unsatisfactory because of increased frame linkage costs, increased garbage collection overhead, and decreased locality of reference. However, simply allocating activation records on a stack and copying them when a continuation is created results in unbounded copying overhead. This paper describes a new approach based on stack allocation that does not require the stack to be copied when a continuation is created and that allows us to place a small upper bound on the amount copied when a continuation is reinstated. This new approach is faster than the naive stack allocation approach, and it does not suffer from the problems associated with unbounded copying. For continuation-intensive programs, our approach is at worst a constant factor slower than the heap allocation approach, and for typical programs, it is significantly faster. An important additional benefit is that recovery from stack overflow is handled gracefully and efficiently.	user correction - Legacy Corrections
YEAR	1990	INFERENCE
VENUE	In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	66--77	INFERENCE
VOLUME	25	INFERENCE
CITATIONS	16 found	ParsCit 1.0