Defunctionalized interpreters for call-by-need evaluation

DOI10.1007/978-3-642-12251-4_18MaRDI QIDQ3558342zbMATH OpenOpenAlexFDO

Authors Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny

Publication date 4 May 2010

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12251-4_18

Mathematics Subject Classification ID

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

Recommendations

• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• Small-step and big-step semantics for call-by-need
• The call-by-need lambda calculus
• Lazy evaluation and delimited control

Cited in

(8)

• Classical by-need
• Three Syntactic Theories for Combinatory Graph Reduction
• Classical call-by-need and duality
• Small-step and big-step semantics for call-by-need
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• Proving termination of evaluation for system F with control operators
• Deriving an abstract machine for strong call by need
• A calculus of expandable stores. Continuation-and-environment-passing style translations

This page was built for publication: Defunctionalized interpreters for call-by-need evaluation

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