Continuations: A mathematical semantics for handling full jumps

Higher-Order and Symbolic Computation

Volumn 13, Issue 1, 2000, Pages 135-152

  Strachey, Christopher ^a   Wadsworth, Christopher P ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Independent Department   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES;

LANGUAGE DESIGN;

HIGH LEVEL LANGUAGES;

EID: 0033727453     PISSN: 13883690     EISSN: None     Source Type: None    
DOI: 10.1023/a:1010026413531     Document Type: Article

References (16)

1. Evans, A., Jr. PAL-a language forteaching programming linguistics. In Proc. 2 3rd ACM National Conference, Brandon Systems, Princeton, N.J., 1968, pp. 395-403.
2. Fischer, M.J. Lambda-calculus schemata. LISP and Symbolic Computation 6(3/4) (1993) 259-288.
3. An earlier version appeared in an ACM Conference on Proving Assertions about Programs, SIGPLAN Notices, Vol. 7, No. 1, January 1972.
4. Landin, P.J. The mechanical evaluation of expressions. Computer Journal 6(4) (1964) 308-320.
5. Landin, P.J. The next 700 programming languages. Communications of the ACM 9(3) (1966) 157-164.
6. Mazurkiewicz, A. Proving algorithms by tail functions. Information and Control 18(3) (1971) 220-226.
7. Milne, R.E. The formal semantics of computer languages and their implementations. Ph.D. Thesis, Cambridge University, 1974. Also as Technical Monograph PRO-13, Oxford University Computing Laboratory, Programming Research Group.
8. Morris, F.L. The next 700 formal language descriptions. LISP and Symbolic Computation 6(3/4) (1993) 249-258.
9. Mosses, P.D. The mathematical semantics of Algol 60. Technical Monograph PRO-12, Oxford University Computing Laboratory, Programming Research Group, 1974.
10. Reynolds, J.C. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference, Boston, 1972.
11. Reynolds, J.C. On the interpretation of Scott's domains. Informatica Teorica, Vol. 15 of Symposia Mathematica, Instituto Nazionale di Alta Matematica Roma, 1975, pp. 123-135. Distributed by Academic Press, London.
12. Scott, D. Continuous lattices. In Proc. of the 1971 Dalhousie Conference. Lecture Notes in Mathematics, Vol. 274, pp. 97-136, Springer-Verlag, 1972.
13. Also as Technical Monograph PRG-7, Oxford University Computing Laboratory, Programming Research Group.
14. Scott, D. Outline of a mathematical theory of computation. In Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169-176. Also as Technical Monograph PRG-2, Oxford University Computing Laboratory, Programming Research Group.
15. Scott, D. and Strachey, C. Toward a mathematical semantics for computer languages. In Proc. of the Symposium on Computers and Automata, Polytechnic Institute of Brooklyn, 1971. Also as Technical Monograph PRG-6, Oxford University Computing Laboratory, Programming Research Group.
16. Strachey, C. Varieties of programming language. In Proc. of the International Computing Symposium, Cini Foundation, 1972, pp. 222-233. Also as Technical Monograph PRG-10, Oxford University Computing Laboratory, Programming Research Group.