Bibliographic Details
| Title: |
On the static and dynamic extents of delimited continuations |
| Authors: |
Biernacki, Dariusz1 dabi@brics.dk, Danvy, Olivier1 danvy@brics.dk, Shan, Chung-chieh2 ccshan@cs.rutgers.edu |
| Source: |
Science of Computer Programming. May2006, Vol. 60 Issue 3, p274-297. 24p. |
| Subjects: |
Statics, Dynamics, Search algorithms, Computer systems |
| Abstract: |
Abstract: We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias ) and the dynamic delimited-control operator control (alias ). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum. We also point out where static delimited continuations naturally give rise to the notion of control stack whereas dynamic delimited continuations can be made to account for a notion of ‘control queue’. [Copyright &y& Elsevier] |
|
Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
