Skip to main content
SpringerLink
Log in

An introduction to Landin’s “Getting Rid of Labels”

  • Published:
Higher-Order and Symbolic Computation

Abstract

This note introduces Peter Landin’s 1965 report “Getting Rid of Labels,” which is reprinted in this volume.

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. Backus, J.: Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Commun. ACM 21(8), 613–641 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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). Accessible on-line at www.lmcs-online.org

    MathSciNet  Google Scholar 

  3. Dijkstra, E.W.: Go to statement considered harmful. Commun. ACM 30(3), 195–96 (1968)

    MathSciNet  Google Scholar 

  4. Hudak, P.: Conception, evolution, and application of functional programming languages. ACM Comput. Surv. 21(3), 359–411 (1989)

    Article  Google Scholar 

  5. Hughes, J.: Why functional programming matters. Comput. J. 32(2), 98–107 (1989)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Landin, P.J.: Histories of discoveries of continuations: Belles-Lettres with equivocal tenses. In: Danvy, O. (ed.) 2nd ACM SIGPLAN Workshop on Continuations, ENS, Paris (1997). Number NS-96-13 in BRICS Notes Series

  8. Landin, P.J.: A generalization of jumps and labels. Higher Order Symb. Comput. 11(2), 125–143 (1998). Originally a Univac Systems Programming Research report, dated August 29th, 1965

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  10. Rodman, R.D.: Algorithm 196. Müller’s method for finding roots of an arbitrary function. Commun. ACM 6(8), 442–43 (1963)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  12. Turner, D.A.: The semantic elegance of applicative languages. In: FPCA ’81: Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, Portsmouth, New Hampshire, pp. 85–92. ACM Press, New York (1981)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, 557 Goodwin Hall, Kingston, Ontario, K7L 3N6, Canada

    R. D. Tennent

Authors
  1. R. D. Tennent
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. D. Tennent.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tennent, R.D. An introduction to Landin’s “Getting Rid of Labels”. Higher-Order Symb Comput 22, 313–314 (2009). https://doi.org/10.1007/s10990-010-9056-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10990-010-9056-6

Keywords

Search

Navigation