| [1] |
Bruce F. Duba, Robert Harper, and Dave MacQueen, ``Typing
First-Class Continuations in ML'', in 18th
ACM Symp. on Principles of Programming Languages,
pp. 163-173, 1991.
|
| [2] |
William Clinger,
http://www.ccs.neu.edu/home/will/Temp/uwesc.sch.
|
| [3] |
Matthias Felleisen, ``On the Expressive Power of
Programming Languages'', in European Symp. on
Programming, 1990, pp. 134-151.
|
| [4] |
Matthew Flatt, ``Composable and Compilable Macros: You Want It When?'', in International Conf. on Functional Programming, 2002.
|
| [5] |
Daniel P. Friedman and Christopher T. Haynes,
``Constraining Control'', in 12th ACM Symp. on
Principles of Programming Languages, 1985, pp.
245-254.
|
| [6] |
Christopher T. Haynes and Daniel P. Friedman,
``Engines Build Process Abstractions'', in ACM Symp. on Lisp and Functional Programming,
1984,
pp. 18-24.
|
| [7] |
Christopher T. Haynes, Daniel P. Friedman, and Mitchell
Wand, ``Continuations and Coroutines'', in ACM Symp. Lisp and Functional Programming,
1984, pp. 293-298.
|
| [8] |
Richard Kelsey and William Clinger (eds.),
Revised 5 Report on the Algorithmic Language
Scheme
(``R5RS''),
http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs.html,
1998.
|
| [9] |
Kent Pitman, UNWIND-PROTECT vs
Continuations,
http://www.nhplace.com/kent/PFAQ/unwind-protect-vs-continuations.html.
|
| [10] |
Dorai Sitaram, Teach Yourself Scheme in Fixnum
Days,
http://www.ccs.neu.edu/~dorai/t-y-scheme/t-y-scheme.html.
|