State-transition machines for lambda-calculus expressions

DOI10.1007/S10990-007-9012-2zbMath1130.68040OpenAlexW2011215067MaRDI QIDQ2464714

David A. Schmidt

Publication date: 17 December 2007

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

Full work available at URL: https://doi.org/10.1007/s10990-007-9012-2

zbMATH Keywords

Lambda calculusDenotational semanticsDefunctionalizationContinuationsSECD-machineState transition machineWeak-normal form

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Related Items (2)

Getting There and Back Again ⋮ Refunctionalization at work

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Continuations: A mathematical semantics for handling full jumps
• Data Types as Lattices
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• The Mechanical Evaluation of Expressions

This page was built for publication: State-transition machines for lambda-calculus expressions