Higher-Order and Symbolic Computation

, Volume 22, Issue 4, pp 331–332 | Cite as

Stories about calculations: remembering Peter Landin

Article
  • 29 Downloads

Abstract

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

Keywords

Programming languages Theory of computing 

References

  1. 1.
    Danvy, O., Millikin, K.: A rational deconstruction of Landin’s SECD machine with the J operator. Log. Methods Comput. Sci. 4(4) (2008) Google Scholar
  2. 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) Google Scholar
  3. 3.
    Reynolds, J.C.: Theories of Programming Languages. Cambridge University Press, New York (1999). ISBN 0-521-59414-6 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.University of MiddlesexLondonUK

Personalised recommendations