H. Abelson
R. K. Dybvig
C. T. Haynes
G. J. Rozas
N. I. Adams IV
D. P. Friedman
E. Kohlbecker
G. L. Steele Jr.
D. H. Bartley
R. Halstead
D. Oxley
G. J. Sussman
G. Brooks
C. Hanson
K. M. Pitman
M. Wand
1998
Revised^5 Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
11
1
7–105
10.1023/A:1010051815785
Kenichi Asai
Yukiyoshi Kameyama
2007
Polymorphic Delimited Continuations
Asian Symposium on Programming Languages and Systems
Lecture Notes in Computer Science
4807
Springer
239–254
10.1007/978-3-540-76637-7_16
Egidio Astesiano
1991
Inductive and Operational Semantics
Formal Description of Programming Concepts
IFIP State-of-the-Art Reports
Springer
51–136
ISBN 978-3-540-53961-2
Malgorzata Biernacka
Dariusz Biernacki
Olivier Danvy
2005
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
Logical Methods in Computer Science
1
2
1–39
10.2168/LMCS-1(2:5)2005
Dariusz Biernacki
Olivier Danvy
2006
A Simple Proof of a Folklore Theorem about Delimited Control
Journal of Functional Programming
16
3
269–280
10.1017/S0956796805005782
Dariusz Biernacki
Olivier Danvy
Chung-chieh Shan
2006
On the Static and Dynamic Extents of Delimited Continuations
Science of Computer Programming
60
3
274–297
10.1016/j.scico.2006.01.002
Martin Churchill
Peter D. Mosses
2013
Modular Bisimulation Theory for Computations and Values
International Conference on Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science
7794
Springer
97–112
10.1007/978-3-642-37075-5_7
Martin Churchill
Peter D. Mosses
Neil Sculthorpe
Paolo Torrini
2015
Reusable Components of Semantic Specifications
Transactions on Aspect-Oriented Software Development XII
Lecture Notes in Computer Science
8989
Springer
132–179
10.1007/978-3-662-46734-3_4
William Clinger
1987
The Scheme Environment: Continuations
SIGPLAN Lisp Pointers
1
2
22–28
10.1145/1317193.1317197
Olivier Danvy
2006
An Analytical Approach to Programs as Data Objects
DSc thesis
Department of Computer Science, Aarhus University
http://cs.au.dk/~danvy/DSc/
Olivier Danvy
2008
Defunctionalized Interpreters for Programming Languages
International Conference on Functional Programming
ACM
131–142
10.1145/1411204.1411206
Olivier Danvy
Andrzej Filinski
1989
A Functional Abstraction of Typed Contexts
Technical Report
89/12
DIKU, University of Copenhagen
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.4822
Olivier Danvy
Andrzej Filinski
1990
Abstracting Control
Conference on LISP and Functional Programming
ACM
151–160
10.1145/91556.91622
Olivier Danvy
Andrzej Filinski
1992
Representing Control: A Study of the CPS Transformation
Mathematical Structures in Computer Science
2
4
361–391
10.1017/S0960129500001535
Olivier Danvy
Zhe Yang
1999
An Operational Investigation of the CPS Hierarchy
European Symposium on Programming Languages and Systems
Lecture Notes in Computer Science
1576
Springer
224–242
10.1007/3-540-49099-X_15
R. Kent Dyvbig
Simon Peyton Jones
Amr Sabry
2007
A Monadic Framework for Delimited Continuations
Journal of Functional Programming
17
6
687–730
10.1017/S0956796807006259
Matthias Felleisen
Robert Bruce Findler
Matthew Flatt
2009
Semantics Engineering with PLT Redex
MIT Press
ISBN 9780262062756
Matthias Felleisen
Mitch Wand
Daniel Friedman
Bruce Duba
1988
Abstract Continuations: A Mathematical Semantics for Handling Full Jumps
Conference on LISP and Functional Programming
ACM
52–62
10.1145/62678.62684
Mattias Felleisen
1988
The Theory and Practice of First-Class Prompts
Symposium on Principles of Programming Languages
ACM
180–190
10.1145/73560.73576
Andrzej Filinski
1994
Representing Monads
Symposium on Principles of Programming Languages
ACM
446–457
10.1145/174675.178047
Martin Gasbichler
Michael Sperber
2002
Final Shift for Call/cc: Direct Implementation of Shift and Reset
International Conference on Functional Programming
ACM
271–282
10.1145/581478.581504
Carl A. Gunter
Didier Rémy
Jon G. Riecke
1995
A Generalization of Exceptions and Control in ML-like Languages
International Conference on Functional Programming Languages and Computer Architecture
ACM
12–23
10.1145/224164.224173
Yukiyoshi Kameyama
Masahito Hasegawa
2003
A Sound and Complete Axiomatization of Delimited Continuations
International Conference on Functional Programming
ACM
177–188
10.1145/944705.944722
Yukiyoshi Kameyama
Takuo Yonezawa
2008
Typed Dynamic Control Operators for Delimited Continuations
International Symposium on Functional and Logic Programming
Lecture Notes in Computer Science
4989
Springer
239–254
10.1007/978-3-540-78969-7_18
Peter D. Mosses
2002
Pragmatics of Modular SOS
International Conference on Algebraic Methodology and Software Technology
Lecture Notes in Computer Science
2422
Springer
21–40
10.1007/3-540-45719-4_3
Peter D. Mosses
2004
Modular Structural Operational Semantics
Journal of Logic and Algebraic Programming
60–61
195–228
10.1016/j.jlap.2004.03.008
Peter D. Mosses
Mark J. New
2009
Implicit Propagation in Structural Operational Semantics
Workshop on Structural Operational Semantics
Electronic Notes in Theoretical Computer Science
229(4)
Elsevier
49–66
10.1016/j.entcs.2009.07.073
Peter D. Mosses
Ferdinand Vesely
2014
FunKons: Component-Based Semantics in K
International Workshop on Rewriting Logic and Its Applications
Lecture Notes in Computer Science
8663
Springer
213–229
10.1007/978-3-319-12904-4_12
Gordon D. Plotkin
2004
A Structural Approach to Operational Semantics
Journal of Logic and Algebraic Programming
60–61
17–139
10.1016/j.jlap.2004.05.001
Reprint of Technical Report FN-19, DAIMI, Aarhus University, 1981
Grigore Roşu
Traian Florin Şerbănuţă
2010
An Overview of the K Semantic Framework
Journal of Logic and Algebraic Programming
79
6
397–434
10.1016/j.jlap.2010.03.012
Amr Sabry
Matthias Felleisen
1993
Reasoning About Programs in Continuation-passing Style
LISP and Symbolic Computation
6
3–4
289–360
10.1007/BF01019462
Neil Sculthorpe
Paolo Torrini
Peter D. Mosses
2016
A Modular Structural Operational Semantics for Delimited Continuations: Additional Material
http://www.plancomps.org/woc2016
Chung-chieh Shan
2007
A Static Simulation of Dynamic Delimited Control
Higher-Order and Symbolic Computation
20
4
371–401
10.1007/s10990-007-9010-4
Dorai Sitaram
Matthias Felleisen
1990
Control Delimiters and their Hierarchies
LISP and Symbolic Computation
3
1
67–99
10.1007/BF01806126