Skip to main content
SpringerLink
Log in

Editorial

  • Published:
Higher-Order and Symbolic Computation

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

References

  1. Barron, D. Home page. http://www.ecs.soton.ac.uk/∼dwb/.

  2. Campbell-Kelly, M. Christopher Strachey, 1916-1975, A Biographical Note. Annals of the History of Computing 7(1) (1985) 19-42.

    Google Scholar 

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

    Google Scholar 

  4. Strachey, C. Fundamental concepts in programming languages. In Proceedings of the 1967 International Summer School in Computer Programming, Copenhagen, Denmark, 1967. Unpublished.

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

  6. Wilkes, M.V. Memoirs of a Computer Pioneer. The MIT Press, 1985.

Download references

Author information

Authors and Affiliations

  1. Aarhus, Denmark

    Olivier Danvy

  2. Stanford, California

    Carolyn Talcott

Authors
  1. Olivier Danvy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carolyn Talcott
    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

Danvy, O., Talcott, C. Editorial. Higher-Order and Symbolic Computation 13, 5–6 (2000). https://doi.org/10.1023/A:1010022412197

Download citation

  • Issue Date:

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

Keywords

Search

Navigation