An Introduction to Landin's “A Generalization of Jumps and Labels”
- Hayo Thielecke
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This note introduces Peter Landin's 1965 technical report “A Generalization of Jumps and Labels”, which is reprinted in this volume. Its aim is to make that historic paper more accessible to the reader and to help reading it in context. To this end, we explain Landin's control operator J in more contemporary terms, and we recall Burge's solution to a technical problem in Landin's original account.
- William H. Burge. Recursive Programming Techniques. Addison-Wesley, 1975.
- Bruce Duba, Robert Harper, and David MacQueen. Typing first-class continuations in ML. In Proc. ACM Symp. Principles of Programming Languages, pages 163–173, January 1991.
- Felleisen, M. (1987) Reflections on Landin's J operator: a partly historical note. Computer Languages 12: pp. 197-207
- Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD-machine, and the λ-calculus. In M. Wirsing, editor, Formal Description of Programming Concepts, pages 193–217. North-Holland, 1986.
- Anthony Field and Peter Harrison. Functional Programming. Addison-Wesley, 1988.
- Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes. Essentials of Programming Languages. MIT Press and McGraw-Hill, 1992.
- Henson, M. C. (1987) Elements of Functional Languages. Blackwell Scientific Publications, Oxford
- Martin Hofmann. Sound and complete axiomatizations of call-by-value control operators. Math. Struct. in Comp. Science, 1994.
- Landin, P. J. (1964) The mechanical evaluation of expressions. The Computer Journal 6: pp. 308-320
- Landin, P. J. (1965) A correspondence between ALGOL 60 and Church's lambda-notation: Parts I and II. Communications of the ACM 8: pp. 89-101
- Peter J. Landin. A generalization of jumps and labels. Report, UNIVAC Systems Programming Research, August 1965. To be reprinted in Lisp and Symbolic Computation.
- Peter J. Landin. Getting rid of labels. Technical report, UNIVAC Systems Programming Research, July 1965.
- Peter J. Landin. Programming without imperatives-an example. Technical report, UNIVAC Systems Programming Research, March 1965.
- Peter J. Landin. Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In O. Danvy, editor, ACM SIGPLAN Workshop on Continuations, number NS-96-13 in BRICS Notes Series, 1997.
- AT&T Bell Laboratories. Standard ML of New Jersey - Base Environment, 0.93 edition, February 1993.
- Jonathan Rees and William Clinger (editors). Revised4 report on the algorithmic language Scheme. ACM Lisp Pointers IV, July-September 1991.
- Reade, C. (1989) Elements of Functional Programming. Addison-Wesley, Wokingham, England
- John C. Reynolds. Definitional interpreters for higher-order programming languages. In Proceedings of the 25 th ACM National Conference, pages 717–740. ACM, August 1972.
- Reynolds, J. C. (1993) The discoveries of continuations. Lisp and Symbolic Computation 6: pp. 233-247
- Steele, G. L., Gabriel, R. P. The evolution of Lisp. In: Wexelblat, R. L. eds. (1993) Proceedings of the Conference on History of Programming Languages, volume 28(3) of ACM Sigplan Notices. ACM Press, New York, NY, USA, pp. 231-270
- Christopher Strachey and C. P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, January 1974.
- Mitchell Wand. Continuation-based multiprocessing. Conference Record of the 1980 Lisp Conference, pages 19–28, 1980.
- An Introduction to Landin's “A Generalization of Jumps and Labels”
Higher-Order and Symbolic Computation
Volume 11, Issue 2 , pp 117-123
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- history of programming languages
- Hayo Thielecke (1)
- Author Affiliations
- 1. QMW, University of London, UK