Comparing Control Constructs by Double-barrelled CPS Transforms

DOI10.1016/S1571-0661(04)80974-5zbMath1260.68117OpenAlexW1977443637MaRDI QIDQ4917068

Hayo Thielecke

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80974-5

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An introduction to Landin's ``A generalization of jumps and labels
• A generalization of jumps and labels
• Continuations: A mathematical semantics for handling full jumps
• Reflections on Landin's J-operator: A partly historical note

This page was built for publication: Comparing Control Constructs by Double-barrelled CPS Transforms