A generalization of jumps and labels

DOI10.1023/A:1010068630801zbMATH Open0934.68036OpenAlexW1543726080WikidataQ54002421 ScholiaQ54002421MaRDI QIDQ1290331FDOQ1290331

Peter J. Landin

Publication date: 31 May 1999

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010068630801

zbMATH Keywords

functional programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (10)

• Types as graphs: Continuations in type logical grammar
• Short Labels by Traversal and Jumping
• A syntactic correspondence between context-sensitive calculi and abstract machines
• Automated temporal verification for algebraic effects
• Delimited control operators prove double-negation shift
• An introduction to Landin's ``Getting rid of labels
• Peter J. Landin (1930--2009)
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
• On the call-by-value CPS transform and its semantics
• Comparing Control Constructs by Double-barrelled CPS Transforms

   Recommendations

• Getting rid of labels 👍 👎
• An introduction to Landin's ``A generalization of jumps and labels 👍 👎
• Continuations in possible-world semantics 👍 👎
• Definitional interpreters for higher-order programming languages 👍 👎
• Procedural operators considered as fundamental programming devices 👍 👎

This page was built for publication: A generalization of jumps and labels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290331)