Skip to main content
SpringerLink
Log in

Stories about calculations: remembering Peter Landin

  • Published:
Higher-Order and Symbolic Computation

Abstract

This article recalls Peter Landin as a PhD supervisor and introduces his final lecture notes.

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. Danvy, O., Millikin, K.: A rational deconstruction of Landin’s SECD machine with the J operator. Log. Methods Comput. Sci. 4(4) (2008)

  2. Landin, P.: Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In: Danvy, O. (ed.) ACM SIGPLAN Workshop on Continuations. BRICS Notes Series, n. NS-96-13 (1997)

  3. Reynolds, J.C.: Theories of Programming Languages. Cambridge University Press, New York (1999). ISBN 0-521-59414-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Middlesex, London, UK

    Tony Clark

Authors
  1. Tony Clark
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tony Clark.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Clark, T. Stories about calculations: remembering Peter Landin. Higher-Order Symb Comput 22, 331–332 (2009). https://doi.org/10.1007/s10990-010-9058-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-010-9058-4

Keywords

Search

Navigation