[C99] ISO/IEC, “ISO/IEC 9899:1999 Cor. 3:2007(E).” 2007.
[Culpepper07] Ryan Culpepper, Sam Tobin-Hochstadt, and Matthew Flatt, “Advanced Macrology and the Implementation of Typed Scheme,” Workshop on Scheme and Functional Programming, 2007.
[Danvy90] Olivier Danvy and Andre Filinski, “Abstracting Control,” LISP and Functional Programming, 1990.
[Felleisen88a] Matthias Felleisen, “The theory and practice of first-class prompts,” Principles of Programming Languages, 1988.
[Felleisen88] Matthias Felleisen, Mitch Wand, Dan Friedman, and Bruce Duba, “Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps,” LISP and Functional Programming, 1988.
[Feltey18] Daniel Feltey, Ben Greenman, Christophe Scholliers, Robert Bruce Findler, and Vincent St-Amour, “Collapsible Contracts: Fixing a Pathology of Gradual Typing,” Object-Oriented Programming, Systems, and Languages (OOPSLA), 2018.
[Flatt02] Matthew Flatt, “Composable and Compilable Macros: You Want it When?,” International Conference on Functional Programming (ICFP), 2002.
[Friedman95] Daniel P. Friedman, C. T. Haynes, and R. Kent Dybvig, “Exception system proposal,” web page, 1995.
[Gasbichler02] Martin Gasbichler and Michael Sperber, “Processes vs. User-Level Threads in Scsh,” Workshop on Scheme and Functional Programming, 2002.
[Greenberg15] Michael Greenberg, “Space-Efficient Manifest Contracts,” Principles of Programming Languages (POPL), 2015.
[Gunter95] Carl Gunter, Didier Remy, and Jon Rieke, “A Generalization of Exceptions and Control in ML-like Languages,” Functional Programming Languages and Computer Architecture, 1995.
[Haynes84] Christopher T. Haynes and Daniel P. Friedman, “Engines Build Process Abstractions,” Symposium on LISP and Functional Programming, 1984.
[Hayes97] Barry Hayes, “Ephemerons: a New Finalization Mechanism,” Object-Oriented Languages, Programming, Systems, and Applications, 1997.
[Hieb90] Robert Hieb and R. Kent Dybvig, “Continuations and Concurrency,” Principles and Practice of Parallel Programming, 1990.
[Lamport79] Leslie Lamport, “How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs,” IEEE Transactions on Computers, 179.
[L'Ecuyer02] Pierre L’Ecuyer, Richard Simard, E. Jack Chen, and W. David Kelton, “An Object-Oriented Random-Number Package With Many Long Streams and Substreams,” Operations Research, 50(6), 2002.
[Queinnec91] Queinnec and Serpette, “A Dynamic Extent Control Operator for Partial Continuations,” Principles of Programming Languages, 1991.
[Reppy99] John H. Reppy, Concurrent Programming in ML, Cambridge University Press, 1999.
[Roux14] Pierre Roux, “Innocuous Double Rounding of Basic Arithmetic Operations,” Journal of Formalized Reasoning, 7(1), 2014.
[Sapin18] Simon Sapin, “The WTF-8 Encoding.” 2018.
[Shan04] Ken Shan, “Shift to Control,” Workshop on Scheme and Functional Programming, 2004.
[Sperber07] Michael Sperber, R. Kent Dybvig, Matthew Flatt, and Anton van Straaten (editors), “The Revised6 Report on the Algorithmic Language Scheme.” 2007.
[Sitaram90] Dorai Sitaram and Matthias Felleisen, “Control Delimiters and Their Hierarchies,” Lisp and Symbolic Computation, 1990.
[Sitaram93] Dorai Sitaram, “Handling Control,” Programming Language Design and Implementation, 1993.
[SRFI-42] Sebastian Egner, “SRFI-42: Eager Comprehensions,” SRFI, 2003.
[Strickland12] T. Stephen Strickland, Sam Tobin-Hochstadt, Matthew Flatt, and Robert Bruce Findler, “Chaperones and Impersonators: Run-time Support for Reasonable Interposition,” Object-Oriented Programming, Systems, and Languages (OOPSLA), 2012.