References

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

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org