Subcontinuations Export

@article{citeulike:234386, abstract = {. Continuations have proven to be useful for implementing a variety of control structures, including exception handling facilities and breadth-first searching algorithms. However, traditional continuations are not useful in the presence of concurrency, because the notion of the rest of the computation represented by a continuation does not in general make sense. Traditional continuations can also be difficult to use in nonconcurrent settings, since their global nature is sometimes problematic....}, author = {Hieb, Robert and Dybvig, Kent and Anderson, Claude}, citeulike-article-id = {234386}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.1591}, journal = {Lisp and Symbolic Computation}, keywords = {concurrency, lisp}, number = {1}, pages = {83--110}, posted-at = {2005-06-22 09:36:42}, priority = {2}, title = {Subcontinuations}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.1591}, volume = {7}, year = {1994} }

TY - JOUR ID - citeulike:234386 L3 - citeulike-article-id:234386 N2 - . Continuations have proven to be useful for implementing a variety of control structures, including exception handling facilities and breadth-first searching algorithms. However, traditional continuations are not useful in the presence of concurrency, because the notion of the rest of the computation represented by a continuation does not in general make sense. Traditional continuations can also be difficult to use in nonconcurrent settings, since their global nature is sometimes problematic.... IS - 1 JF - Lisp and Symbolic Computation EP - 110 TI - Subcontinuations VL - 7 SP - 83 KW - concurrency KW - lisp AU - Hieb, Robert AU - Dybvig, Kent AU - Anderson, Claude PY - 1994/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.1591 ER -