Skip to main content
SpringerLink
Log in

Continuations: A Mathematical Semantics for Handling Full Jumps

  • Published:
Higher-Order and Symbolic Computation

Abstract

This paper describes a method of giving the mathematical semantics of programming languages which include the most general form of jumps.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Evans, A., Jr. PAL-alanguage for teaching programming linguistics. In Proc. 23rdACMNational Conference, Brandon Systems, Princeton, N.J., 1968, pp. 395-403.

    Google Scholar 

  2. Fischer, M.J. Lambda-calculus schemata. LISP and Symbolic Computation 6(3/4) (1993) 259-288. An earlier version appeared in an ACM Conference on Proving Assertions about Programs, SIGPLAN Notices, Vol. 7, No. 1, January 1972.

    Google Scholar 

  3. Landin, P.J. The mechanical evaluation of expressions. Computer Journal 6(4) (1964) 308-320.

    Google Scholar 

  4. Landin, P.J. The next 700 programming languages. Communications of the ACM 9(3) (1966) 157-164.

    Google Scholar 

  5. Mazurkiewicz, A. Proving algorithms by tail functions. Information and Control 18(3) (1971) 220-226.

    Google Scholar 

  6. Milne, R.E. The formal semantics of computer languages and their implementations. Ph.D. Thesis, Cambridge University, 1974. Also as Technical Monograph PRG-13, Oxford University Computing Laboratory, Programming Research Group.

  7. Morris, F.L. The next 700 formal language descriptions. LISP and Symbolic Computation 6(3/4) (1993) 249-258.

    Google Scholar 

  8. Mosses, P.D. The mathematical semantics of Algol 60. Technical Monograph PRG-12, Oxford University Computing Laboratory, Programming Research Group, 1974.

  9. Reynolds, J.C. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference, Boston, 1972.

  10. 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.

    Google Scholar 

  11. Scott, D. Continuous lattices. In Proc. of the 1971 Dalhousie Conference. Lecture Notes in Mathematics, Vol. 274, pp. 97-136, Springer-Verlag, 1972. Also as Technical Monograph PRG-7, Oxford University Computing Laboratory, Programming Research Group.

    Google Scholar 

  12. 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.

  13. 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.

  14. 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.

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University, 45 Banbury Road, Oxford

    Christopher Strachey (Reader in Computation)

Authors
  1. Christopher Strachey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christopher P. Wadsworth
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Strachey, C., Wadsworth, C.P. Continuations: A Mathematical Semantics for Handling Full Jumps. Higher-Order and Symbolic Computation 13, 135–152 (2000). https://doi.org/10.1023/A:1010026413531

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010026413531

Keywords

Search

Navigation