Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Continuation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Further reading== *[[Peter Landin]]. ''A Generalization of Jumps and Labels'' Report. UNIVAC Systems Programming Research. August 1965. Reprinted in Higher Order and Symbolic Computation, 11(2):125-143, 1998, with a foreword by Hayo Thielecke. *[[Drew McDermott]] and [[Gerry Sussman]]. ''The Conniver Reference Manual'' MIT AI Memo 259. May 1972. *[[Daniel Bobrow]]: ''A Model for Control Structures for Artificial Intelligence Programming Languages'' IJCAI 1973. *[[Carl Hewitt]], [[Peter Bishop]] and [[Richard Steiger]]. ''A Universal Modular Actor Formalism for Artificial Intelligence'' IJCAI 1973. *[[Christopher Strachey]] and [[Christopher P. Wadsworth]]. ''Continuations: a Mathematical semantics for handling full jumps'' Technical Monograph PRG-11. Oxford University Computing Laboratory. January 1974. Reprinted in Higher Order and Symbolic Computation, 13(1/2):135β152, 2000, with a foreword by Christopher P. Wadsworth. *[[John C. Reynolds]]. ''Definitional Interpreters for Higher-Order Programming Languages'' Proceedings of 25th ACM National Conference, pp. 717β740, 1972. Reprinted in Higher-Order and Symbolic Computation 11(4):363-397, 1998, with a foreword. *John C. Reynolds. ''On the Relation between Direct and Continuation Semantics'' Proceedings of Second Colloquium on Automata, Languages, and Programming. LNCS Vol. 14, pp. 141β156, 1974. * {{cite journal|first=John C.|last=Reynolds|url=https://www.cs.ru.nl/~freek/courses/tt-2011/papers/cps/histcont.pdf|title=The discoveries of continuations|journal=[[LISP and Symbolic Computation]]|volume=6|issue=3/4|year=1993|pages=233–248}} *[[Gerald Sussman]] and [[Guy Steele]]. ''SCHEME: An Interpreter for Extended Lambda Calculus'' AI Memo 349, MIT Artificial Intelligence Laboratory, Cambridge, Massachusetts, December 1975. Reprinted in Higher-Order and Symbolic Computation 11(4):405-439, 1998, with a foreword. *[[Robert Hieb]], [[R. Kent Dybvig]], [[Carl Bruggeman]]. ''Representing Control in the Presence of First-Class Continuations'' Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, pp. 66β77. *[[Will Clinger]], [[Anne Hartheimer]], [[Eric Ost]]. ''Implementation Strategies for Continuations'' Proceedings of the 1988 ACM conference on LISP and Functional Programming, pp. 124β131, 1988. Journal version: Higher-Order and Symbolic Computation, 12(1):7-45, 1999. *[[Christian Queinnec]]. ''Inverting back the inversion of control or, Continuations versus page-centric programming'' SIGPLAN Notices 38(2), pp. 57β64, 2003.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)