Results 1 
9 of
9
A Sound and Complete Axiomatization of Delimited Continuations
 In Proc. of 8th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP’03
, 2003
"... The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept as the standard (unlimited) continuation, but it represents part of the rest of the computation, rather than the whole res ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept as the standard (unlimited) continuation, but it represents part of the rest of the computation, rather than the whole rest of computation. In the literature, the semantics of shift and reset has been given by a CPStranslation only. This paper gives a direct axiomatization of calculus with shift and reset, namely, we introduce a set of equations, and prove that it is sound and complete with respect to the CPStranslation. We also introduce a calculus with control operators which is as expressive as the calculus with shift and reset, has a sound and complete axiomatization, and is conservative over Sabry and Felleisen's theory for firstclass continuations.
A Modal Calculus for Effect Handling
, 2003
"... In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope  once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not prov ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope  once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not provide very naturally for the practically important ability to handle effects, and there is a number of previous works directed toward remedying this deficiency. It is mostly based on extending the monadic framework with further extralogical constructs to support handling. In this paper we adopt...
Towards Logical Understanding of Delimited Continuations (Extended Abstract)
 IN CONTINUATIONS WORKSHOP
, 2000
"... ..."
Disjunctive Normal Forms and Local Exceptions
, 2003
"... All classical λterms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specializ ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
All classical λterms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specialized sequent calculus and shown to be correct.
Axiomatizing Higher Level Delimited Continuations
 Computer Science Department, Indiana University
"... In our previous work we gave a sound and complete axiomatization of the control operators for delimited continuations, shift and reset by Danvy and Filinski and their variants. Since the calculus allows only one use of shift and reset, a next step is to investigate the calculus with many different s ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In our previous work we gave a sound and complete axiomatization of the control operators for delimited continuations, shift and reset by Danvy and Filinski and their variants. Since the calculus allows only one use of shift and reset, a next step is to investigate the calculus with many different shift’s and reset’s. In this work, we study the calculus with higherlevel delimited continuation operators, and give a sound and complete axiomatization of the calculus with level1 and level2 control operators for delimited continuations. Due to lack of space, we leave the detailed proof to a separate draft available at:
Axioms for Control Operators in the CPS Hierarchy ∗
"... Abstract. A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callbyvalue CPS translation, Danvy and Filinski discovered the CPS hierarchy and proposed a family of control operators, shift and reset, that mak ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callbyvalue 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 level1 shift and reset. In this article, we investigate the whole family of shift and reset. We give a simple calculus with leveln shift and leveln 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 level1 shift and reset.
A Modal Calculus for Named Control Effects
"... The monadic formulation of exceptions forces a programming stylein which the program itself must specify a total ordering on the evaluation of exceptional computations. Moreover, unless a callbyname strategy is used, values of monadic types must be tested before they are used, in order to determin ..."
Abstract
 Add to MetaCart
The monadic formulation of exceptions forces a programming stylein which the program itself must specify a total ordering on the evaluation of exceptional computations. Moreover, unless a callbyname strategy is used, values of monadic types must be tested before they are used, in order to determine whether they correspondto a raised exception or not. In this