Skip to main content
SpringerLink
Log in

Continuations Revisited

  • Published:
Higher-Order and Symbolic Computation

Abstract

To introduce the republication of his joint 1974 paper with Christopher Strachey, “Continuations: A Mathematical Semantics for Handling Full Jumps”, the author recalls earlier unsuccessful struggles which culminated eventually in the almost instantaneous insight for their discovery of continuations in 1970.

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. Dijkstra, E.W. Go to statement considered harmful. Communications of the ACM 11(3) (1968) 147-148.

    Google Scholar 

  2. Mazurkiewicz, A.W. Proving algorithms by tail functions. Information and Control 18 (1971) 220-226. Working paper for IFIP WG2.2 dated February 1970.

    Google Scholar 

  3. Reynolds, J.C. The discoveries of continuations. Lisp and Symbolic Computation 6(3/4) (1993) 233-247.

    Google Scholar 

  4. Scott, D.S. Outline of a mathematical theory of computation. In Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169-176.

  5. Scott, D.S. and Strachey, C. Towards a mathematical semantics for computer languages. In Proceedings of the Symposium on Computers and Automata, Polytechnic Institute of Brooklyn, 1971.

  6. Strachey, C. A mathematical semantics which can deal with full jumps. In Théorie des Algorithmes, des Langages et de la Programmation, IRIA (INRIA), Rocquencourt, France, 1973, pp. 175-191.

    Google Scholar 

  7. Strachey, C. and Wadsworth, C.P. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974.

    Google Scholar 

  8. Wadsworth, C.P. Another approach to jumps-continuations. Unpublished note, Oxford, England, November 1970.

    Google Scholar 

  9. Wadsworth, C.P. Notes on continuations. Unpublished note, Oxford, England, July 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pagoda, 73 Orchard Way, Wantage, Oxon, OX12 8EB, UK

    Christopher P. Wadsworth

Authors
  1. 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

Wadsworth, C.P. Continuations Revisited. Higher-Order and Symbolic Computation 13, 131–133 (2000). https://doi.org/10.1023/A:1010074329461

Download citation

  • Issue Date:

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

Search

Navigation