References

  1. Kenichi Asai & Yukiyoshi Kameyama (2007): Polymorphic Delimited Continuations. In: APLAS, Lecture Notes in Ccomputer Science 4807, pp. 239–254, doi:10.1007/978-3-540-76637-7_16.
  2. Andrej Bauer & Matija Pretnar (2015): Programming with Algebraic Effects and Handlers. Journal of Logical and Algebraic Methods in Programming 84(1), pp. 108–123, doi:10.1016/j.jlamp.2014.02.001.
  3. Małgorzata Biernacka, Dariusz Biernacki & Olivier Danvy (2004): An Operational Foundation for Delimited Continuations. In: Hayo Thielecke: CW'04: Proceedings of the 4th ACM SIGPLAN Continuations Workshop, Tech. Rep. CSR-04-1. School of Computer Science, University of Birmingham, pp. 25–33. Available at http://www.cs.bham.ac.uk/~hxt/cw04/bbd.pdf.
  4. Edwin Brady (2013): Programming and reasoning with algebraic effects and dependent types, pp. 133–144, doi:10.1145/2500365.2500581.
  5. Jacques Carette, Oleg Kiselyov & Chung-chieh Shan (2009): Finally Tagless, Partially Evaluated: Tagless Staged Interpreters for Simpler Typed Languages. J. Functional Progr. 19(5), pp. 509–543, doi:10.1017/S0956796809007205.
  6. Robert Cartwright & Matthias Felleisen (1994): Extensible Denotational Language Specifications. In: Masami Hagiya & John C. Mitchell: Theor. Aspects of Comp. Soft., LNCS 789. Springer, Berlin, pp. 244–272, doi:10.1007/3-540-57887-0_99.
  7. Alonzo Church (1940): A Formulation of the Simple Theory of Types. Journal of Symbolic Logic 5(2), pp. 56–68, doi:10.2307/2266170.
  8. William D. Clinger, Anne H. Hartheimer & Eric M. Ost (1999): Implementation Strategies for First-Class Continuations. Higher-Order and Symbolic Computation 12(1), pp. 7–45, doi:10.1023/A:1010016816429.
  9. Olivier Danvy & Andrzej Filinski (1989): A Functional Abstraction of Typed Contexts. Technical Report 89/12. DIKU, University of Copenhagen, Denmark. Available at http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz.
  10. Stephen Dolan, Leo White, KC Sivaramakrishnan, Jeremy Yallop & Anil Madhavapeddy (2015): Effective concurrency through algebraic effects. OCaml Users and Developers Workshop.
  11. R. Kent Dybvig, Simon L. Peyton Jones & Amr Sabry (2007): A Monadic Framework for Delimited Continuations. J. Functional Progr. 17(6), pp. 687–730, doi:10.1017/S0956796807006259.
  12. Matthias Felleisen (1988): The Theory and Practice of First-Class Prompts. In: POPL '88: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. ACM Press, pp. 180–190, doi:10.1145/73560.73576.
  13. Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker & Bruce F. Duba (1986): Reasoning with Continuations. In: Proceedings of the 1st Symposium on Logic in Computer Science, pp. 131–141.
  14. Yannick Forster, Ohad Kammar, Sam Lindley & Matija Pretnar (2017): On the Expressive Power of User-Defined Effects: Effect Handlers, Monadic Reflection, Delimited Control. Proceedings of the ACM on Programming Languages 1, doi:10.1145/3110257.
  15. Gérard Huet & Bernard Lang (1978): Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Informatica 11, pp. 31–55, doi:10.1007/BF00264598.
  16. (2013): ICFP '13: Proceedings of the ACM International Conference on Functional Programming. ACM Press.
  17. Yukiyoshi Kameyama & Masahito Hasegawa (2003): A sound and complete axiomatization of delimited continuations. In: ICFP. ACM Press, pp. 177–188, doi:10.1145/944705.944722.
  18. Ohad Kammar, Sam Lindley & Nicolas Oury (2013): Handlers in action, pp. 145–158, doi:10.1145/2544174.2500590.
  19. Oleg Kiselyov (2005): How to Remove a Dynamic Prompt: Static and Dynamic Delimited Continuation Operators are Equally Expressible. Technical Report 611. Computer Science Department, Indiana University.
  20. Oleg Kiselyov (2012): Delimited control in OCaml, abstractly and concretely. Theoretical Computer Science 435, pp. 56–76, doi:10.1016/j.tcs.2012.02.025.
  21. Oleg Kiselyov (2012): Typed Tagless Final Interpreters. In: Proceedings of the 2010 International Spring School Conference on Generic and Indexed Programming, SSGIP'10. Springer-Verlag, Berlin, Heidelberg, pp. 130–174, doi:10.1007/978-3-642-32202-0_3.
  22. Oleg Kiselyov & Hiromi Ishii (2015): Freer monads, more extensible effects. In: Proceedings of the 8th ACM SIGPLAN symposium on Haskell, Vancouver, BC, Canada, September 3-4, 2015. ACM, pp. 94–105, doi:10.1145/2804302.2804319.
  23. Oleg Kiselyov, Amr Sabry & Cameron Swords (2013): Extensible effects: an alternative to monad transformers. In: Haskell. ACM, pp. 59–70, doi:10.1145/2503778.2503791.
  24. Oleg Kiselyov, Chung-chieh Shan & Amr Sabry (2006): Delimited Dynamic Binding. In: ICFP. ACM Press, pp. 26–37, doi:10.1145/1160074.1159808.
  25. Peter J. Landin (1966): The Next 700 Programming Languages. Communications of the ACM 9(3), pp. 157–166, doi:10.1145/365230.365257.
  26. John Launchbury & Simon L. Peyton Jones (1995): State in Haskell. Lisp and Symbolic Computation 8(4), pp. 293–341, doi:10.1007/BF01018827.
  27. Daan Leijen (2017): Type Directed Compilation of Row-typed Algebraic Effects. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017. ACM, New York, NY, USA, pp. 486–499, doi:10.1145/3009837.3009872.
  28. Dale Miller & Gopalan Nadathur (1987): A Logic Programming Approach to Manipulating Formulas and Programs. In: Seif Haridi: IEEE Symposium on Logic Programming. IEEE Computer Society Press, Washington, DC, pp. 379–388.
  29. Peter D. Mosses (1990): Denotational Semantics. In: J. van Leewen: Handbook of Theoretical Computer Science, chapter 11 B: Formal Models and Semantics. The MIT Press, New York, NY, pp. 577–631.
  30. (2017): Multicore OCaml: A shared memory parallel extension of OCaml. Available at https://github.com/ocamllabs/ocaml-multicore. Accessed: 2017-03-31 15:17:00.
  31. Michel Parigot (1992): λμ-Calculus: An Algorithmic Interpretation of Classical Natural Deduction. In: LPAR, Lecture Notes in AI 624, pp. 190–201, doi:10.1007/BFb0013061.
  32. Gordon Plotkin & Matija Pretnar (2009): Handlers of Algebraic Effects. In: Giuseppe Castagna: Programming Languages and Systems, Lecture Notes in Ccomputer Science 5502. Springer, pp. 80–94, doi:10.1007/978-3-642-00590-9_7.
  33. Gordon D. Plotkin & John Power (2003): Algebraic Operations and Generic Effects. Applied Categorical Structures 11(1), pp. 69–94, doi:10.1023/A:1023064908962.
  34. John C. Reynolds (1972): Definitional Interpreters for Higher-Order Programming Languages. In: Proceedings of the ACM National Conference 2. ACM Press, pp. 717–740. Reprinted as reynolds-definitional-revisited,reynolds-definitional-reprinted.
  35. John C. Reynolds (1998): Definitional Interpreters for Higher-Order Programming Languages. Higher-Order and Symbolic Computation 11(4), pp. 363–397, doi:10.1023/A:1010027404223.
  36. John C. Reynolds (1998): Definitional Interpreters Revisited. Higher-Order and Symbolic Computation 11(4), pp. 355–361, doi:10.1023/A:1010075320153.
  37. David A. Schmidt (1996): Programming Language Semantics. ACM Computing Surveys 28(1), pp. 265–267, doi:10.1145/234313.234419.
  38. Hongwei Xi, Chiyan Chen & Gang Chen (2003): Guarded Recursive Datatype Constructors. In: POPL. ACM Press, pp. 224–235, doi:10.1145/640128.604150.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org