Improving the lazy Krivine machine

DOI10.1007/s10990-007-9014-0zbMath1130.68055OpenAlexW2159250653MaRDI QIDQ2464718

Daniel P. Friedman, Jeremy G. Siek, Abdulaziz Ghuloum, Onnie Lynn Winebarger

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-9014-0

zbMATH Keywords

Lambda calculusAbstract machineCall by needLazy evaluation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (5)

A functional correspondence between call-by-need evaluators and lazy abstract machines ⋮ On the value of variables ⋮ On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation ⋮ New Developments in Environment Machines ⋮ The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus

Uses Software

• ALGOL 60

Cites Work

• The lambda calculus, its syntax and semantics
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Deriving a lazy abstract machine
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving the lazy Krivine machine