Optimizing a non-deterministic abstract machine with environments
From MaRDI portal
Cites work
- A call-by-name lambda-calculus machine
- A concrete framework for environment machines
- A concurrent lambda calculus with futures
- A strong distillery
- An abstract framework for environment machines
- Call-by-value Solvability
- Confluence properties of weak and strong calculi of explicit substitutions
- Deriving a lazy abstract machine
- Distilling abstract machines
- Explicit substitutions
- From reduction-based to reduction-free normalization
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Krivine machines and higher-order schemes
- Non-deterministic abstract machines
- On the Relative Usefulness of Fireballs
- Optimizing a non-deterministic abstract machine with environments
- Semantics engineering with PLT Redex
- Strongly reducing variants of the Krivine abstract machine
- Syntactic theories in practice
- The categorical abstract machine
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- The Mechanical Evaluation of Expressions
- The semantics of future and an application
- The structural \(\lambda \)-calculus
- The useful MAM, a reasonable implementation of the strong -calculus
- The zoo of lambda-calculus reduction strategies, and Coq
This page was built for publication: Optimizing a non-deterministic abstract machine with environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875003)
