Programming language semantics: It’s easy as 1,2,3

DOI10.1017/s0956796823000072OpenAlexW4388203611MaRDI QIDQ6065508

G. Hutton

Publication date: 11 December 2023

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796823000072

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refunctionalization at work
• The revised report on the syntactic theories of sequential control and state
• Definitional interpreters for higher-order programming languages
• Inductive families
• The origins of structural operational semantics
• Modular structural operational semantics
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• Practical Foundations for Programming Languages
• Cutting Out Continuations
• Clowns to the left of me, jokers to the right (pearl)
• Accurate Step Counting
• Deriving Target Code as a Representation of Continuation Semantics
• Action Semantics
• Theories of Programming Languages
• The Zipper
• Compiling a 50-year journey
• Mathematics of Program Construction
• The under-appreciated unfold
• Fold and unfold for program semantics
• Calculating correct compilers
• What is the meaning of these constant interruptions?
• Proving Properties of Programs by Structural Induction
• An axiomatic basis for computer programming
• The Mechanical Evaluation of Expressions

This page was built for publication: Programming language semantics: It’s easy as 1,2,3