Embedding continuations in procedural objects

ABSTRACT

Continuations, when available as first-class objects, provide a general control abstraction in programming languages. They liberate the programmer from specific control structures, increasing programming language extensibility. Such continuations may be extended by embedding them in procedural objects. This technique is first used to restore a fluid environment when a continuation object is invoked. We then consider techniques for constraining the power of continuations in the interest of security and efficiency. Domain mechanisms, which create dynamic barriers for enclosing control, are implemented using fluids. Domains are then used to implement an unwind-protect facility in the presence of first-class continuations. Finally, we present two mechanisms, wind-unwind and dynamic-wind, that generalize unwind-protect.

REFERENCES

• 1: Henry G. Baker, Jr., Shallow binding in Lisp 1.5, Communications of the ACM, v.21 n.7, p.565-569, July 1978 [doi>10.1145/359545.359566]
• 2: BURGE, W.H. Recursiue Programming Techniques. Addison-Wesley, Reading, Mass., 1975.
• 3: R. Kent Dybvig, The SCHEME programming language, Prentice-Hall, Inc., Upper Saddle River, NJ, 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: Christopher T. Haynes, Logic continuations, Journal of Logic Programming, v.4 n.2, p.157-176, June 1, 19876 [doi>10.1016/0743-1066(87)90016-1]
• 7: Christopher T. Haynes , Daniel P. Friedman, Abstracting timed preemption with engines, Computer Languages, v.12 n.2, p.109-121, Aug. 1987 [doi>10.1016/0096-0551(87)90003-8]
• 8: Christopher T Haynes , Daniel P Friedman , Mitchell Wand, Obtaining coroutines with continuations, Computer Languages, v.11 n.3-4, p.143-153, 1986 [doi>10.1016/0096-0551(86)90007-X]
• 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: Eugene Kohlbecker , Daniel P. Friedman , Matthias Felleisen , Bruce Duba, Hygienic macro expansion, Proceedings of the 1986 ACM conference on LISP and functional programming, p.151-161, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319859]
• 11: P. J. Landin, Correspondence between ALGOL 60 and Church's Lambda-notation: part I, Communications of the ACM, v.8 n.2, p.89-101, Feb. 1965 [doi>10.1145/363744.363749]
• 12: J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
• 13: John C. Reynolds, G/EDANKEN—a simple typeless language based on the principle of completeness and the reference concept, Communications of the ACM, v.13 n.5, p.308-319, May 1970 [doi>10.1145/362349.362364]
• 14: John C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference, p.717-740, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805852]
• 15: Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 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: Gerald J. Sussman , Guy L. Steele, Jr., An Interpreter for Extended Lambda Calculus, Massachusetts Institute of Technology, Cambridge, MA, 1975
• 18: Mitchell Wand, Continuation-based multiprocessing, Proceedings of the 1980 ACM conference on LISP and functional programming, p.19-28, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802786]

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications
          Subjects: Extensible languages

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: LISP; SCHEME
      D.3.3 Language Constructs and Features
          Subjects: Control structures

General Terms:
Languages, Security, Theory