## An operational foundation for delimited continuations in the CPS hierarchy (2005)

### Cached

### Download Links

- [arxiv.org]
- [arxiv.org]
- [arxiv.org]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

Venue: | Logical Methods in Computer Science |

Citations: | 18 - 15 self |

### BibTeX

@INPROCEEDINGS{Biernacki05anoperational,

author = {Dariusz Biernacki and Olivier Danvy},

title = {An operational foundation for delimited continuations in the CPS hierarchy},

booktitle = {Logical Methods in Computer Science},

year = {2005}

}

### Years of Citing Articles

### OpenURL

### Abstract

Vol. 1 (2:5) 2005, pp. 1–39 www.lmcs-online.org

### Citations

82 |
How computers should think
- Belnap
- 1977
(Show Context)
Citation Context ...se, and ⋆2 is ∨. Multi-valued logic: In general, for each n > 2 we can consider a suitable n-valued logic [47]; for example, in case n = 4, the language corresponds to that of Belnap’s bilattice FOUR =-=[11]-=-. It is also possible to modify the normalization function to work for less regular logical structures (e.g., other bilattices). Monads: In general, the language corresponds to that of layered monads ... |

66 | A functional correspondence between evaluators and abstract machines
- Ager, Biernacki, et al.
- 2003
(Show Context)
Citation Context ...e start with the original evaluator for shift1 and reset1. This evaluator uses two layers of continuations: a continuation and a meta-continuation. We then defunctionalize it into an abstract machine =-=[1]-=- and we construct the corresponding reduction semantics [30], as pioneered by Felleisen and Friedman [33]. The development scales to shiftn and resetn. It is reusable for any control operators that ar... |

38 | A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Ager, Danvy, et al.
- 2003
(Show Context)
Citation Context ...n a list xs and a predicate p, we want 1. to find the first prefix of xs whose last element satisfies p, and 2. to find all such prefixes of xs. For example, given the predicate λm.m > 2 and the list =-=[0,3,1,4,2,5]-=-, the first prefix is [0,3] and the list of all the prefixes is [[0,3],[0,3,1,4],[0,3,1,4, 2, 5]]. In Section 3.1, we start with a simple solution that uses a first-order accumulator. This simple solu... |

34 | A functional correspondence between call-by-need evaluators and lazy abstract machines
- Ager, Danvy, et al.
- 2004
(Show Context)
Citation Context ...n a list xs and a predicate p, we want 1. to find the first prefix of xs whose last element satisfies p, and 2. to find all such prefixes of xs. For example, given the predicate λm.m > 2 and the list =-=[0,3,1,4,2,5]-=-, the first prefix is [0,3] and the list of all the prefixes is [[0,3],[0,3,1,4],[0,3,1,4, 2, 5]]. In Section 3.1, we start with a simple solution that uses a first-order accumulator. This simple solu... |

31 |
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums, in: POPL’04
- Balat, Cosmo, et al.
- 2004
(Show Context)
Citation Context ...here is a large number proposing a variety of control operators [5,37,40,41,49,52,53,65,70,74,80] which have found applications in models of control, concurrency, and type-directed partial evaluation =-=[8,52,75]-=-. Of the former, there is the work revolving around the family of control operators shift and reset [27–29,32,42,43,55,56,66,80] which have found applications in non-deterministic programming, code ge... |

31 |
Design and correctness of program transformations based on control-flow analysis
- Banerjee, Heintze, et al.
- 2001
(Show Context)
Citation Context ...bservable results: Theorem 1. For any program t and any integer value m, evaluate(t) = m if and only if eval e (t) = m. Proof. The theorem follows directly from the correctness of defunctionalization =-=[10,67]-=-. The environment-based abstract machine can serve both as a foundation for implementing functional languages with control operators for delimited continuations and as a stepping stone in theoretical ... |

24 |
A type-theoretic foundation of continuations and prompts
- Ariola, Herbelin, et al.
- 2004
(Show Context)
Citation Context ...s: those that use continuation-passing style (CPS) and those that rely on operational intuitions about control instead. Of the latter, there is a large number proposing a variety of control operators =-=[5,37,40,41,49,52,53,65,70,74,80]-=- which have found applications in models of control, concurrency, and type-directed partial evaluation [8,52,75]. Of the former, there is the work revolving around the family of control operators shif... |

21 |
Categorical reconstruction of a reductionfree normalization proof
- Altenkirch, Hofmann, et al.
- 1995
(Show Context)
Citation Context ...n a list xs and a predicate p, we want 1. to find the first prefix of xs whose last element satisfies p, and 2. to find all such prefixes of xs. For example, given the predicate λm.m > 2 and the list =-=[0,3,1,4,2,5]-=-, the first prefix is [0,3] and the list of all the prefixes is [[0,3],[0,3,1,4],[0,3,1,4, 2, 5]]. In Section 3.1, we start with a simple solution that uses a first-order accumulator. This simple solu... |

14 | Memoization in type-directed partial evaluation
- Balat, Danvy
- 2002
(Show Context)
Citation Context ...eloped in intuitionistic type theory [20,63], proof theory [12,13], category theory [4], and partial evaluation [22,23], where it has emerged as a new field of application for delimited continuations =-=[9,23,34,44,48,51,78]-=-. 6.2. The free monoid. A source term in the free monoid is either a variable, the unit element, or the product of two terms: term ∋ t ::= x | ε | t ⋆ t ′ The product is associative and the unit eleme... |

13 |
Helmut Schwichtenberg. Normalization by evaluation
- Berger, Eberl
- 1998
(Show Context)
Citation Context ...4]: eval : term → value reify : value → term nf normalize : term → term nf normalize = reify ◦ eval Normalization by evaluation has been developed in intuitionistic type theory [20, 63], proof theory =-=[12,13]-=-, category theory [4], and partial evaluation [22,23], where it has emerged as a new field of application for delimited continuations [9,23,34,44,48,51,78]. 6.2. The free monoid. A source term in the ... |

10 | Offline partial evaluation for shift and reset - Asai - 2003 |