Embedding Continuations in Procedural Objects

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 9, Issue 4, 1987, Pages 582-598

  Haynes, Christopher T ^a   Friedman, Daniel P ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Continuations; escapes; first class objects; labels

Indexed keywords

COMPUTER SOFTWARE - SOFTWARE ENGINEERING;

LANGUAGE CONSTRUCTS; PROCEDURAL OBJECTS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0023436733     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/29873.30392     Document Type: Article

References (18)

1. Baker, H. G., Jr. Shallow binding in Lisp. 1.5 Commun. ACM 21, 7 (July 1978), 565–569.
2. Burge, W. H. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975.
3. Dybvig, R. K. The Scheme Programming Language. Prentice-Hall, Englewood Cliffs, N.J., 1987.
4. Friedman, D. P., Haynes, C. T., and Kohlbecker, E. Programming with continuations. In Program Transformation and Programming Environments, P. Pepper, Ed. Springer-Verlag, New York, 1984, 263–274.
5. Hanson, C., and Lamping, J. Dynamic binding in Scheme, Unpublished manuscript, 1984.
6. Haynes, C. T. Logic continuations. J. Log. Program. 4, 2 (June 1987), 157–176.
7. Haynes, C. T., and Friedman, D. P. Abstracting timed preemption with engines. Comput. Lang. 12, 2 (1987), 109–121.
8. Haynes, C. T., Friedman, D. P., and Wand, M. Obtaining coroutines with continuations. Comput. Lang. 11, 3/4 (1986), 143–153.
9. Hewitt, C. Viewing control structures as patterns of passing messages. Artif. Intell. 8, 3 (June 1977), 323–364. Also in Artificial Intelligence: An MIT Perspective. Winston and Brown, Eds. MIT Press, Cambridge, Mass., 1979.
10. Kohlbecker, E., Friedman, D. P., Felleisen, M., and Duba, B. Hygienic macro expansion. In Conference Record of the 1986 ACM Symposium on Lisp and Functional Programming. (Cambridge, Mass., Aug. 4–6,1986). ACM, New York, 1986, pp. 151–161. To appear in LISP and Symbolic Computation.
11. Landin, P. A correspondence between ALGOL 60 and Church's Lambda-Notation. Commun. ACM 8, 2–3 (Feb. and Mar. 1965), 89–101 and 158–165.
12. Rees, J., and Clinger, W., Eds. Revised report on the algorithmic language Scheme. ACM SIGPLAN Not. 21,12 (Dec. 1986), 37–79.
13. Reynolds, J. C. GEDANKEN—A simple typeless language based on the principle of completeness and the reference concept. Commun. ACM 13, 5 (May 1970), 308–319.
14. Reynolds, J. Definitional interpreters for higher order programming languages. In Proceedings of the ACM Conference 1972 (Boston, Mass., Aug. 14–16,1972). ACM, New York, 1972, pp. 717–740.
15. Steele, G. L., Jr. Common Lisp: The Language. Digital Press, Bedford, Mass., 1984.
16. Sussman, G. J., and McDermott, D. V. From PLANNER to CONNIVER—A genetic approach. In Proceedings of the Fall Joint Computer Conference, vol. 41, part 2 (Anaheim, Calif., Dec. 5–7). AFIPS Press, Reston, Va., 1972, pp. 1171–1179.
17. Sussman, G. J., and Steele, G. L., Jr. Scheme: An interpreter for extended lambda calculus. Artif. Intell. Memo 349. MIT, Cambridge, Mass., Dec. 1975.
18. Wand, M. Continuation-based multiprocessing. In Conference Record of the 1980 Lisp Conference (Stanford, Calif., Aug. 25–27,1980). ACM, New York, 1980, pp. 19–28.