A functional correspondence between call-by-need evaluators and lazy abstract machines
From MaRDI portal
Publication:2390256
Recommendations
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Automating the functional correspondence between higher-order evaluators and abstract machines
- The Call-by-Need Lambda Calculus, Revisited
- scientific article; zbMATH DE number 675533
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving
- scientific article; zbMATH DE number 1693041
- scientific article; zbMATH DE number 176136
- The semantics of lazy functional languages
- A syntactic correspondence between context-sensitive calculi and abstract machines
- A non-deterministic call-by-need lambda calculus
Cites work
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- A Rational Deconstruction of Landin’s SECD Machine
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Definitional interpreters for higher-order programming languages
- Deriving a lazy abstract machine
- Essentials of programming languages.
- From operational semantics to abstract machines
- Functional runtime systems within the lambda-sigma calculus
- scientific article; zbMATH DE number 3722073 (Why is no real title available?)
- scientific article; zbMATH DE number 1521621 (Why is no real title available?)
- scientific article; zbMATH DE number 814823 (Why is no real title available?)
- scientific article; zbMATH DE number 2242599 (Why is no real title available?)
- scientific article; zbMATH DE number 3187218 (Why is no real title available?)
- Improving the lazy Krivine machine
- On the transformation between direct and continuation semantics
- The Mechanical Evaluation of Expressions
- The semantics of lazy functional languages
Cited in
(25)- Improving the lazy Krivine machine
- A static simulation of dynamic delimited control
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Proofs, upside down. A functional correspondence between natural deduction and the sequent calculus
- Calculating certified compilers for non-deterministic languages
- Systematic abstraction of abstract machines
- Cutting Out Continuations
- Inter-deriving Semantic Artifacts for Object-Oriented Programming
- Defunctionalized interpreters for call-by-need evaluation
- Lazy evaluation and delimited control
- From reduction-based to reduction-free normalization
- From operational semantics to abstract machines
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
- Deriving a lazy abstract machine
- Deriving an abstract machine for strong call by need
- scientific article; zbMATH DE number 7204429 (Why is no real title available?)
- A calculus of expandable stores. Continuation-and-environment-passing style translations
- Lazy evaluation and delimited control
- Calculating correct compilers
- Normalization by evaluation for modal dependent type theory
- Programming language semantics: It’s easy as 1,2,3
- Automating the functional correspondence between higher-order evaluators and abstract machines
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Refunctionalization at work
- Inter-deriving semantic artifacts for object-oriented programming
This page was built for publication: A functional correspondence between call-by-need evaluators and lazy abstract machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390256)
