Representing Control in the Presence of First-Class Continuations Export

@inproceedings{citeulike:5821491, 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.}, author = {Hieb, Robert and Dybvig, R. Kent and Bruggeman, Carl}, booktitle = {In Proceedings of the SIGPLAN \&\#039;90 Conference on Programming Language Design and Implementation}, citeulike-article-id = {5821491}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6828}, keywords = {scheme, untyped}, pages = {66--77}, posted-at = {2009-09-22 17:01:50}, priority = {2}, title = {Representing Control in the Presence of First-Class Continuations}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6828}, volume = {25}, year = {1990} }

TY - CONF ID - citeulike:5821491 L3 - citeulike-article-id:5821491 N2 - 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. EP - 77 TI - Representing Control in the Presence of First-Class Continuations VL - 25 T2 - In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation SP - 66 KW - scheme KW - untyped AU - Hieb, Robert AU - Dybvig, Kent AU - Bruggeman, Carl PY - 1990/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6828 ER -