On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
From MaRDI portal
Publication:963342
DOI10.1016/j.ipl.2007.10.010zbMath1186.68122OpenAlexW2016550363MaRDI QIDQ963342
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.010
Related Items (11)
Proofs, Upside Down ⋮ Calculating Certified Compilers for Non-deterministic Languages ⋮ A functional approach to generic programming using adaptive traversals ⋮ Inter-deriving Semantic Artifacts for Object-Oriented Programming ⋮ On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation ⋮ Three Syntactic Theories for Combinatory Graph Reduction ⋮ Flag-based big-step semantics ⋮ On graph rewriting, reduction, and evaluation in the presence of cycles ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ A correspondence between type checking via reduction and type checking via evaluation ⋮ From Reduction-Based to Reduction-Free Normalization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An abstract framework for environment machines
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Definitional interpreters revisited
- Definitional interpreters for higher-order programming languages
- A call-by-name lambda-calculus machine
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Trampolined style
- Lightweight fusion by fixed point promotion
- Making a fast curry
- A concrete framework for environment machines
- The Mechanical Evaluation of Expressions
This page was built for publication: On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
