State-transition machines, revisited

DOI10.1007/S10990-007-9017-XzbMath1129.68411OpenAlexW1971474578MaRDI QIDQ2464722

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-9017-x

zbMATH Keywords

Krivine machineDenotational semanticsLambda-calculusDefunctionalizationContinuation-passing style

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Getting There and Back Again ⋮ Refunctionalization at work

Cites Work

• Unnamed Item
• Unnamed Item
• An abstract framework for environment machines
• The categorical abstract machine
• Semantics-directed compiler generation. Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980
• Definitional interpreters for higher-order programming languages
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• From operational semantics to abstract machines

This page was built for publication: State-transition machines, revisited