Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling

Sekiguchi, Tatsurou; Sakamoto, Takahiro; Yonezawa, Akinori

doi:10.1007/3-540-45407-1_14

Cited by 12 publications

(13 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sekiguchi et al [26] use exceptions to implement multi-prompt delimited control in Java and C++. Their method relies on source-or byte-code translation, changing method signatures and preventing mixing the translated code with untranslated libraries.…”

Section: Related Workmentioning

confidence: 99%

Delimited Control in OCaml, Abstractly and Concretely: System Description

Kiselyov¹

2010

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. We describe the first implementation of multi-prompt delimited control operators in OCaml that is direct in that it captures only the needed part of the control stack. The implementation is a library that requires no changes to the OCaml compiler or run-time, so it is perfectly compatible with existing OCaml source code and byte-code. The library has been in fruitful practical use for four years. We present the library as an implementation of an abstract machine derived by elaborating the definitional machine. The abstract view lets us distill a minimalistic API, scAPI, sufficient for implementing multiprompt delimited control. We argue that a language system that supports exception and stack-overflow handling supports scAPI. Our library illustrates how to use scAPI to implement multi-prompt delimited control in a typed language. The approach is general and can be used to add multi-prompt delimited control to other existing language systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Delimited Control in OCaml, Abstractly and Concretely: System Description

Kiselyov¹

2010

Functional and Logic Programming

View full text Add to dashboard Cite

show abstract

“…Three pieces of past research bear a strong resemblance to ours: Cartwright and Felleisen's work on extensible denotational semantics [3], Sekiguchi, Sakamoto and Yonezawa's work on checkpointing and transparent migration [29], and Tao's work on migrating Java threads [31].…”

Section: Related Workmentioning

confidence: 99%

Continuations from generalized stack inspection

Pettyjohn

Clements

Marshall

et al. 2005

Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present a novel translation that overcomes this problem. In the first half of the paper, we introduce a theoretical model that shows how to eliminate the capture and the use of first-class continuations in the presence of a generalized stack inspection mechanism. The second half of the paper explains how to translate this model into practice in two different contexts. First, we reformulate the servlet interaction language in the PLT Web server, which heavily relies on first-class continuations. Using our technique, servlet programs can be run directly under the control of non-cooperative web servers such as Apache. Second, we show how to use our new technique to copy and reconstitute the stack on MSIL.Net using exception handlers. This establishes that Scheme's first-class continuations can exist on non-cooperative virtual machines.

show abstract

“…In contrast to these control operators, shift and reset are defined by the CPS translation in a purely functional way. In addition, they have found applications in partial evaluation [24], one-pass CPS translation [10], and normalization by evaluation [7], as well as to represent layered monads [15] and mobile computation [30].…”

Section: Introductionmentioning

confidence: 99%

Axioms for control operators in the CPS hierarchy

Kameyama

2007

Higher-Order Symb Comput

View full text Add to dashboard Cite

Abstract. A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callby-value CPS translation, Danvy and Filinski discovered the CPS hierarchy and proposed a family of control operators, shift and reset, that make it possible to capture successive delimited continuations in a CPS hierarchy.Although shift and reset have found their applications in several areas such as partial evaluation, most studies in the literature have been devoted to the base level of the hierarchy, namely, to level-1 shift and reset. In this article, we investigate the whole family of shift and reset. We give a simple calculus with level-n shift and level-n reset for an arbitrary n > 0. We then give a set of equational axioms for them, and prove that these axioms are sound and complete with respect to the CPS translation. The resulting set of axioms is concise and a natural extension of those for level-1 shift and reset.

show abstract

Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling

Cited by 12 publications

References 16 publications

Delimited Control in OCaml, Abstractly and Concretely: System Description

Delimited Control in OCaml, Abstractly and Concretely: System Description

Continuations from generalized stack inspection

Axioms for control operators in the CPS hierarchy

Contact Info

Product

Resources

About