Sciweavers

201 search results - page 3 / 41
» Typed Dynamic Control Operators for Delimited Continuations
Sort
View
PPDP
2009
Springer
13 years 9 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
ICFP
2009
ACM
14 years 6 months ago
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...
Tiark Rompf, Ingo Maier, Martin Odersky
FOSSACS
2010
Springer
14 years 3 days ago
A Hierarchy for Delimited Continuations in Call-by-Name
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
Alexis Saurin
ICFP
2003
ACM
14 years 5 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
CSL
2004
Springer
13 years 10 months ago
Axioms for Delimited Continuations in the CPS Hierarchy
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard call-by-value CPS translation, Danvy ...
Yukiyoshi Kameyama