Elements of functional languages
Elements of functional languages
Reflections on Landin's J-operator: a partly historical note
Computer Languages
Typing first-class continuations in ML
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Elements of functional programming
Elements of functional programming
Essentials of programming languages
Essentials of programming languages
HOPL-II The second ACM SIGPLAN conference on History of programming languages
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
A correspondence between ALGOL 60 and Church's Lambda-notations: Part II
Communications of the ACM
Revised report on the algorithmic language scheme
ACM SIGPLAN Lisp Pointers
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Definitional Interpreters Revisited
Higher-Order and Symbolic Computation
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
Higher-Order and Symbolic Computation
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
On the static and dynamic extents of delimited continuations
Science of Computer Programming
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Higher-Order and Symbolic Computation
An introduction to Landin's "Getting Rid of Labels"
Higher-Order and Symbolic Computation
A rational deconstruction of landin's j operator
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
| Hi-index | 0.00 |
This note introduces Peter Landin‘s 1965 technical report “AGeneralization of Jumps and Labels”, which is reprinted in thisvolume. Its aim is to make that historic paper more accessible tothe reader and to help reading it in context. To this end, weexplain Landin‘s control operator J in more contemporaryterms, and we recall Burge‘s solution to a technical problem inLandin‘s original account.