The test programs in this directory were accumulated from the publications listed below.  There is some degree of redundancy, as similar programs sometimes appear in several publications and we have attempted to include all examples from the publications listed.  Unfortunately our current I-MSOS interpreter has poor performance, and consequently we have had to omit a few of the larger test programs.


Abelson98
- Revised [5] Report on the Algorithmic Language Scheme.
  H. Abelson and R. K. Dybvig and C. T. Haynes and G. J. Rozas and N. I. Adams IV and D. P. Friedman and E. Kohlbecker and G. L. Steele Jr. and D. H. Bartley and R. Halstead and D. Oxley and G. J. Sussman and G. Brooks and C. Hanson and K. M. Pitman and M. Wand.
  Higher-Order and Symbolic Computation, 11 (1), pp. 7-105, Kluwer, 1998.

Asai07
- Polymorphic Delimited Continuations.
  Kenichi Asai and Yukiyoshi Kameyama.
  Lecture Notes in Computer Science, 4807, pp. 239-254, 2007.

Biernacka05
- An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
  Malgorzata Biernacka, Dariusz Biernacki and Olivier Danvy.
  Logical Methods in Computer Science, 1 (2:5), pp. 1-39, 2005.

Biernacki06a
- On the Static and Dynamic Extents of Delimited Continuations.
  Dariusz Biernacki and Olivier Danvy and Chung-chieh Shan.
  Science of Computer Programming, 60 (3), pp. 274-297, Elsevier, 2006.

Biernacki06b
- A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.
  Dariusz Biernacki and Olivier Danvy and Kevin Millikin.
  BRICS Report RS-06-15, University of Aarhus, 2006.

Clinger87
- The Scheme Environment: Continuations.
  William Clinger.
  Lisp Pointers, 1 (2), pp. 22-28, ACM, 1987.

Danvy89
- A Functional Abstraction of Typed Contexts.
  Olivier Danvy and Andrzej Filinski.
  Technical Report DIKU 89/12, University of Copenhagen, 1989.

Danvy99
- An Operational Investigation of the CPS Hierarchy.
  Olivier Danvy and Zhe Yang.
  Lecture Notes in Computer Science, 1576, pp. 224-242, Springer, 1999.

Danvy06
- An Analytical Approach to Programs as Data Objects.
  Olivier Danvy.
  DSc thesis, Department of Computer Science, Aarhus University, 2006.

Felleisen88a
- The Theory and Practice of First-class Prompts.
  Mattias Felleisen.
  Symposium on Principles of Programming Languages, pp. 180-190, ACM, 1988.

Felleisen88b
- Abstract Continuations: A Mathematical Semantics for Handling Full Jumps.
  Matthias Felleisen and Mitch Wand and Daniel Friedman and Bruce Duba.
  Conference on LISP and Functional Programming, pp. 52-62, ACM, 1988.

Gasbichler02
- Final Shift for Call/cc: Direct Implementation of Shift and Reset.
  Martin Gasbichler and Michael Sperber.
  International Conference on Functional Programming, pp. 271-282, ACM, 2002.

Gunter95
- A Generalization of Exceptions and Control in ML-like Languages.
  Carl A. Gunter, Didier Remy and Jon G. Riecke.
  International Conference on Functional Programming Languages and Computer Architecture, pp. 12-23, ACM, 1995.

Kiselyov07
- A Substructural Type System for Delimited Continuations.
  Oleg Kiselyov and Chung-chieh Shan.
  Lecture Notes in Computer Science, 4583, pp. 223-239, Springer, 2007.

Miscellaneous
- Assorted examples from wikis and reviewer suggestions.

Sculthorpe15
- A Modular Structural Operational Semantics for Delimited Continuations
  Neil Sculthorpe and Paolo Torrini and Peter D. Mosses
  Workshop on Continuations, 2015.

Shan07
- A Static Simulation of Dynamic Delimited Control,
  Chung-chieh Shan,
  Higher-Order and Symbolic Computation, 20(4), pp. 371-401, Springer, 2007.

Sitaram90
- Control Delimiters and their Hierarchies.
  Dorai Sitaram and Matthias Felleisen.
  LISP and Symbolic Computation, 3(1), pp. 67-99, Kluwer, 1990.
