Subcontinuations Export

@article{citeulike:4234163, 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. This article presents a new type of continuation, called asubcontinuation. Just as a traditional continuation represents the rest of a computation ¿from a given point in the computation, a subcontinuation represents the rest of asubcomputation ¿from a given point in the subcomputation. Subcontinuations may be used to control tree-structured concurrency by allowing nonlocal exits to arbitrary points in a process tree and allowing the capture of a subtree of a computation as a composable continuation for later use. In the absence of concurrency the localized control achievable with subcontinuations makes them more useful than traditional continuations.}, author = {Hieb, Robert and Dybvig, Kent R. and Anderson, Claude W.}, citeulike-article-id = {4234163}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF01019946}, citeulike-linkout-1 = {http://www.springerlink.com/content/w4675968gjxn4k87}, comment = {from http://lambda-the-ultimate.org/node/216}, day = {1}, doi = {10.1007/BF01019946}, journal = {LISP and Symbolic Computation}, keywords = {continuation}, month = {January}, number = {1}, pages = {83--109}, posted-at = {2009-03-28 13:47:29}, priority = {0}, title = {Subcontinuations}, url = {http://dx.doi.org/10.1007/BF01019946}, volume = {7}, year = {1994} }

TY - JOUR ID - citeulike:4234163 L3 - citeulike-article-id:4234163 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. This article presents a new type of continuation, called asubcontinuation. Just as a traditional continuation represents the rest of a computation ¿from a given point in the computation, a subcontinuation represents the rest of asubcomputation ¿from a given point in the subcomputation. Subcontinuations may be used to control tree-structured concurrency by allowing nonlocal exits to arbitrary points in a process tree and allowing the capture of a subtree of a computation as a composable continuation for later use. In the absence of concurrency the localized control achievable with subcontinuations makes them more useful than traditional continuations. IS - 1 JF - LISP and Symbolic Computation EP - 109 TI - Subcontinuations VL - 7 SP - 83 KW - continuation N1 - from http://lambda-the-ultimate.org/node/216 AU - Hieb, Robert AU - Dybvig, Kent AU - Anderson, Claude PY - 1994/01/01/ UR - http://dx.doi.org/10.1007/BF01019946 ER -