Obtaining coroutines with continuations
Computer Languages
Computer Languages
Control delimiters and their hierarchies
Lisp and Symbolic Computation
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Lisp and Symbolic Computation - Special issue on continuations—part I
Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
Representing control in the presence of one-shot continuations
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Revised5 report on the algorithmic language scheme
ACM SIGPLAN Notices
Lisp and Symbolic Computation
Final shift for call/cc:: direct implementation of shift and reset
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Implementation Strategies for First-Class Continuations
Higher-Order and Symbolic Computation
Continuation-Based Multiprocessing Revisited
Higher-Order and Symbolic Computation
Continuations: A Mathematical Semantics for Handling FullJumps
Higher-Order and Symbolic Computation
Extensible Denotational Language Specifications
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Cooperative Task Management Without Manual Stack Management
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
An Implementation of Scheduler Activations on the NetBSD Operating System
Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Monadic encapsulation of effects: a revised approach (extended version)
Journal of Functional Programming
Journal of Functional Programming
Higher-Order and Symbolic Computation
Acute: high-level programming language design for distributed computation
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A principled approach to operating system construction in Haskell
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Backtracking, interleaving, and terminating monad transformers: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Running the manual: an approach to high-assurance microkernel development
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
Types as Graphs: Continuations in Type Logical Grammar
Journal of Logic, Language and Information
Implementation and use of the PLT scheme Web server
Higher-Order and Symbolic Computation
Convergence in language design: a case of lightning striking four times in the same place
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Distributed control flow with classical modal logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Are high-level languages suitable for robust telecoms software?
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
Scrap your zippers: a generic zipper for heterogeneous types
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Typing control operators in the CPS hierarchy
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Subtyping delimited continuations
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Delimited continuations are the meanings of delimited evaluation contexts in programming languages. We show they offer a uniform view of many scenarios that arise in systems programming, such as a request for a system service, an event handler for input/output, a snapshot of a process, a file system being read and updated, and a Web page. Explicitly recognizing these uses of delimited continuations helps us design a system of concurrent, isolated transactions where desirable features such as snapshots, undo, copy-on-write, reconciliation, and interposition fall out by default. It also lets us take advantage of efficient implementation techniques from programming-language research. The Zipper File System prototypes these ideas.