Abstract continuations: A mathematical semantics for handling full functional jumps

Proceedings of the 1988 ACM Conference on LISP and Functional Programming, LFP 1988

Volumn , Issue , 1988, Pages 52-62

  Felleisen, Matthias ^a   Wand, Mitchell ^b   Friedman, Daniel P ^c   Duba, Bruce F ^a  

^a RICE UNIVERSITY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

^c INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LISP (PROGRAMMING LANGUAGE); MODELING LANGUAGES; SEMANTICS;

ABSTRACT DOMAINS; ADVANCED CONTROL; CONTINUATION SEMANTICS; CONTROL STRUCTURE; MATHEMATICAL FORMALISM; MATHEMATICAL SEMANTICS; NON-LOCAL CONTROL; PARALLEL LANGUAGES;

FUNCTIONAL PROGRAMMING;

EID: 84957628015     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62678.62684     Document Type: Conference Paper

References (20)

1. felleisen, M. The theory and practice of first- class prompts. In Proc. 15th ACM Symposium on Principles of Programming Languages, 1988, 180-190.
2. Felleisen, M. and D.P. Friedman. Control operators, the SECD-machine, and the X- calculus. In Formal Description of Programming Concepts III, edited by M. Wirsing. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 1986, 193-217.
3. Felleisen, M., D.P. Friedman, B. Duba, and J. merrill. Beyond continuations. Technical Report No 216, Indiana University Computer Science Department, 1987.
4. Goguen, J., J. Thatcher, and E. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In Current Trends in Programming Methodology IV, edited by R. Yeh. Prentice-Hall, 1979, 80-149.
5. Johnson, G.F. and D. Duggan. Stores and partial continuations as first-class objects in a language and its environment. In Proc. 15th ACM Symposium on Principles of Programming Languages, 1988, 158-168.
6. Kamin, S. Final data type specifications: Anew data type specification method. In Proc. 7th Symposium on Principles of Programming Languages, 1980, 131-138.
7. plotkin, G.D. LCF considered as a programming language. Theor. Comput. Sci. 5, 1977, 223-255.
8. plotkin, G.D. Call-by-name, call-by-Vcilue, and the A-calculus. Theor. Comput. Sci. 1, 1975, 125-159.
9. Reynolds, J.C. Definitional interpreters for higher-order programming languages. In Proc. ACM Annual Conference, 1972, 717-740.
10. Rose, J.R. and G.L. Steele Jr. C∗: An extended C language for data parallel programming. Technical Report No. PL87-5, Thinking Machines Corporation, 1987.
11. Schmidt, D.A. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Newton, Mass., 1986.
12. Smith, B.C. Reflection and Semantics in Lisp. In Proc. 11th ACM Symposium on Principles of Programmation Languages, 1984, 23-35.
13. Steele, G.L. Jr and G.J. Sussman. The revised report on Scheme, a dialect of Lisp. Memo 452, MIT AI-Lab, 1978.
14. Steele, G.L. Jr and W.D. Hillis. Connection Machine Lisp: Fine-Grained Parallel Symbolic Processing. Proc. 1986 ACM Symposium on Lisp and Functional Programming, 1986, 279-297.
15. Stoy, J.E. Denotational Semantics: The Scott- Strachey Approach to Programming Languages. MIT Press, Cambridge, Mass., 1981.
16. stoy, J.E., and C. Strachey. OS6: An operating system for a small computer. Comp. J. 15(2), 1972, 117-124; 195-203.
17. Strachey, C. and CP. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, 1974.
18. Sussman, G.J. and G.L. Steele Jr. Scheme: An interpreter for extended lambda calculus. Memo 349, MIT AI Lab, 1975.
19. Wand, M. Continuation-based multiprocessing. In Proc. 1980 ACM Conference on Lisp and Functional Programming, 1980, 19-28.
20. Wand, M. Final algebraic semantics and data type extensions. /. Comput. Syst. Sci. 19, 1979, 27-44.