Explaining the lazy Krivine machine using explicit substitution and addresses
From MaRDI portal
Publication:2464715
DOI10.1007/s10990-007-9013-1zbMath1130.68058MaRDI QIDQ2464715
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-9013-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An abstract framework for environment 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
- Functional runtime systems within the lambda-sigma calculus
- Deriving a lazy abstract machine
- The call-by-need lambda calculus
- Explicit substitutions
- The spineless tagless G-machine, naturally