The theory and practice of first-class prompts

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130193, Issue , 1988, Pages 180-190

  Felleisen, Matthias ^a,b  

^a INDIANA UNIVERSITY   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SYSTEMS PROGRAMMING;

THEORY AND PRACTICE; TREE PROCESSING;

CALCULATIONS;

EID: 84991473765     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73560.73576     Document Type: Conference Paper

References (14)

1. Barendregt, H.P. The Lambda Calculus: Its Syntax and Semantics, rev. ed. Studies in Logic and the Foundations of Mathematics 103. North-Holland, Amsterdam, 1984.
2. Felleisen, M. The Calculi of Lambda-v-CS-Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. Ph.D. dissertation, Indiana University, 1987.
3. Felleisen, M., D.P. Friedman, B. Duba, and J. Merrill. Beyond continuations. Technical Report No 216, Indiana University Computer Science Department, 1987.
4. Felleisen, M., D.P. Friedman, E. Kohl-becker, and B. Duba. A syntactic theory of sequential control, Theor. Comput. Sci., 1987, to appear.
5. Haynes, C. and D.P. Friedman. Embedding continuations in procedural objects. ACM Trans. Program. Lang. Syst. 9(4), 1987.
6. Hanson, C, J. Lamping. Dynamic binding in Scheme, unpublished manuscript, 1984, MIT.
7. Johnson, G.F. GL-A language and environment for interactively experimenting with denota-tional definitions. In Proc. SIGPLAN '87 Symposium on Interpreters and Interpretive Techniques SIGPLAN Notices 22(7), 1987, 165-176.
8. LANDIN, P.J. The next 700 programming languages. Commun. ACM 9(3), 1966, 157-166.
9. Landin, P.J. The mechanical evaluation of expressions. Comput. J. 6(4), 1964, 308-320.
10. McCarthy, J. et al. Lisp 1.5 Programmer's Manual, sec. ed. MIT Press, Cambridge, 1965.
11. Plotkin, G.D. Call-by-name, call-by-value, and the A-calculus. Theor. Comput. Sci. 1, 1975, 125-159.
12. Rees J. and W. Clinger (Eds.). The revised3 report on the algorithmic language Scheme. SIGPLAN Notices 21(12), 1986, 37-79.
13. Reynolds, J.C. Definitional interpreters for higher-order programming languages. In Proc. ACM Annual Conference, 1972, 717-740.
14. Steele, G. Common Lisp-The Language. Digital Press, 1984.