From outermost reduction semantics to abstract machine
From MaRDI portal
Recommendations
Cites work
- A concrete framework for environment machines
- A syntactic approach to type soundness
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- From reduction-based to reduction-free normalization
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems
- Termination of rewriting
- The origins of structural operational semantics
- Twenty years of rewriting logic
Cited in
(7)- Strongly reducing variants of the Krivine abstract machine
- From reduction-based to reduction-free normalization
- From reduction-based to reduction-free normalization
- scientific article; zbMATH DE number 7204429 (Why is no real title available?)
- Abstracting abstract machines
- Optimizing term rewriting with creeper trace transducers
- Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
This page was built for publication: From outermost reduction semantics to abstract machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453649)