Deriving an abstract machine for strong call by need

DOI10.4230/LIPICS.FSCD.2019.8MaRDI QIDQ5089007zbMATH OpenFDO

Authors Małgorzata Biernacka, Witold Charatonik

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2019.8

zbMATH Keywords

abstract machinesreduction semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• An abstract machine for strong call by value
• The call-by-need lambda calculus
• A strong distillery

Cites work

• A compiled implementation of strong reduction
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• A new implementation technique for applicative languages
• A strong distillery
• A syntactic correspondence between context-sensitive calculi and abstract machines
• Defunctionalized interpreters for call-by-need evaluation
• Deriving a lazy abstract machine
• scientific article; zbMATH DE number 7204429 (Why is no real title available?)
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Implementing open call-by-value
• Lazy evaluation and delimited control
• On the Relative Usefulness of Fireballs
• Semantics engineering with PLT Redex
• Strongly reducing variants of the Krivine abstract machine
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• The useful MAM, a reasonable implementation of the strong -calculus

Cited in

(2)

• An abstract machine for strong call by value
• Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space

This page was built for publication: Deriving an abstract machine for strong call by need

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089007)