Skip to main content
SpringerLink
Log in

Peter J. Landin (1930–2009)

  • Published:
Higher-Order and Symbolic Computation

In those days [the 1960’s],

many successful projects started out

as graffitis on a beer mat

in a very, very smoky pub.

Peter J. Landin, 2004

Abstract

This note is a prelude to a forthcoming special issue of HOSC dedicated to Peter Landin’s memory.

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. Abdali, S.K.: A lambda-calculus model of programming languages, part II: Jumps and procedures. Comput. Lang. 1(4), 303–320 (1976)

    Article  Google Scholar 

  2. Berdine, J.: Linear and affine typing of continuation-passing style. PhD thesis, Queen Mary, University of London (2004)

  3. Clements, J., Sundaram, A., Herman, D.: Implementing continuation marks in JavaScript. In: Clinger, W. (ed.) Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming, pp. 1–9, Victoria, British Columbia, September 2008

  4. Danvy, O. (ed.): Proceedings of the Second ACM SIGPLAN Workshop on Continuations (CW’97). Technical report BRICS NS-96-13, Aarhus University, Paris, France (January 1997)

  5. Danvy, O.: A rational deconstruction of Landin’s SECD machine. In: Grelck, C., Huch, F., Michaelson, G.J., Trinder, P. (eds.) Implementation and Application of Functional Languages, 16th International Workshop, IFL’04, Lübeck, Germany, 2004. Lecture Notes in Computer Science, vol. 3474, pp. 52–71. Springer, Berlin (2004). Recipient of the 2004 Peter Landin prize. Extended version available as the research report BRICS RS-03-33

    Google Scholar 

  6. Danvy, O., Filinski, A.: Abstracting control. In: Wand, M. (ed.) Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990, pp. 151–160. ACM Press, New York (1990)

    Chapter  Google Scholar 

  7. Danvy, O., Millikin, K.: A rational deconstruction of Landin’s SECD machine with the J operator. Log. Methods Comput. Sci. 4(12), 1–67 (2008)

    MathSciNet  Google Scholar 

  8. Danvy, O., Millikin, K.: Refunctionalization at work. Sci. Comput. Program. 74(8), 534–549 (2009). Extended version available as the research report BRICS RS-08-04

    Article  MATH  Google Scholar 

  9. Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: Søndergaard, H. (ed.) Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP’01), Firenze, Italy, September 2001, pp. 162–174. ACM Press, New York (2001). Extended version available as the research report BRICS RS-01-23

    Chapter  Google Scholar 

  10. Danvy, O., Talcott, C.L. (eds.): Special Issue on the Second ACM Workshop on Continuations (CW 1997), Part I. Higher-Order Symb. Comput. 11(2) (1998)

  11. Danvy, O., Shan, C.-C., Zerny, I.: J is for Javascript: A direct-style correspondence between Algol-like languages and Javascript using first-class continuations. In: Taha, W. (ed.) Domain-Specific Languages, IFIP TC 2 Working Conference, DSL 2009, Oxford, UK, July 2009. Lecture Notes in Computer Science, vol. 5658, pp. 1–19. Springer, Berlin (2009)

    Google Scholar 

  12. Fischer, M.J.: Lambda-calculus schemata. Lisp Symb. Comput. 6(3/4), 259–288 (1993). Available at http://www.brics.dk/~hosc/vol06/03-fischer.html. A preliminary version was presented at the ACM Conference on Proving Assertions about Programs, SIGPLAN Notices, vol. 7, no. 1, January 1972

    Article  Google Scholar 

  13. Friedman, D.P., Haynes, C.T.: Constraining control. In: Van Deusen, M.S., Galil, Z. (eds.) Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, January 1985, pp. 245–254. ACM Press, New York (1985)

    Google Scholar 

  14. Landin, P.J.: The mechanical evaluation of expressions. Comput. J. 6(4), 308–320 (1964)

    MATH  Google Scholar 

  15. Landin, P.J.: A correspondence between Algol 60 and Church’s lambda notation, Parts 1 and 2. Commun. ACM 8, 89–101, 158–165 (1965)

    Google Scholar 

  16. Landin, P.J.: A generalization of jumps and labels. Research report, UNIVAC Systems Programming Research (1965). Reprinted in Higher-Order Symb. Comput. 11(2), 125–143 (1998) with a foreword by H. Thielecke

    Article  MATH  Google Scholar 

  17. Landin, P.J.: Getting rid of labels. Research report, UNIVAC Systems Programming (July 1965)

  18. Landin, P.J.: The next 700 programming languages. Commun. ACM 9(3), 157–166 (1966)

    Article  MATH  Google Scholar 

  19. Landin, P.J.: Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In: Danvy, O. Proceedings of the Second ACM SIGPLAN Workshop on Continuations (CW’97). Technical report BRICS NS-96-13, Aarhus University, Paris, France (January 1997), pp. 1–9

  20. Landin, P.J.: A generalization of jumps and labels. Higher-Order Symb. Comput. 11(2), 125–143 (1998). Reprinted from a technical report, UNIVAC Systems Programming Research (1965), with a foreword by H. Thielecke

    Article  MATH  Google Scholar 

  21. Landin, P.J.: My years with Strachey. Higher-Order Symb. Comput. 13(1/2), 75–76 (2000)

    Article  MATH  Google Scholar 

  22. Morris, F.L.: The next 700 formal language descriptions. Lisp Symb. Comput. 6(3/4), 249–258 (1993) Reprinted from a manuscript dated 1970

    Article  Google Scholar 

  23. Morris, J.H. Jr.: A bonus from van Wijngaarden’s device. Commun. ACM 15(8), 773 (1972)

    Article  Google Scholar 

  24. Plotkin, G.D.: Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1, 125–159 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  25. Reynolds, J.C.: Definitional interpreters for higher-order programming languages. In: Proceedings of 25th ACM National Conference, pp. 717–740, Boston, Massachusetts, 1972. Reprinted in Higher-Order Symb. Comput. 11(4), 363–397 (1998) with a foreword by J.C. Reynolds

    Google Scholar 

  26. Reynolds, J.C.: The discoveries of continuations. Lisp Symb. Comput. 6(3/4), 233–247 (1993)

    Article  Google Scholar 

  27. Reynolds, J.C.: Definitional interpreters revisited. Higher-Order Symb. Comput. 11(4), 355–361 (1998)

    Article  MATH  Google Scholar 

  28. Steele, G.L. Jr.: Rabbit: A compiler for Scheme. Master’s thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts (May 1978). Technical report AI-TR-474

  29. Strachey, C., 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). Reprinted in Higher-Order Symb. Comput. 13(1/2), 135–152 (2000) with a foreword by C.P. Wadsworth

  30. Thielecke, H.: An introduction to Landin’s “A generalization of jumps and labels”. Higher-Order Symb. Comput. 11(2), 117–124 (1998)

    Article  MATH  Google Scholar 

  31. van Wijngaarden, A.: Recursive definition of syntax and semantics. In: Steele, T.B. Jr. (ed.) Formal Language Description Languages for Computer Programming, pp. 13–24. North-Holland, Amsterdam (1966)

    Google Scholar 

  32. Wadsworth, C.P.: Continuations revisited. Higher-Order Symb. Comput. 13(1/2), 131–133 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aarhus University, Aabogade 34, 8200, Aarhus N, Denmark

    Olivier Danvy

Authors
  1. Olivier Danvy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Danvy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Danvy, O. Peter J. Landin (1930–2009). Higher-Order Symb Comput 22, 191–195 (2009). https://doi.org/10.1007/s10990-009-9048-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-009-9048-6

Keywords

Search

Navigation