A non-deterministic call-by-need lambda calculus
From MaRDI portal
Recommendations
- A non-deterministic call-by-need lambda calculus
- The call-by-need lambda calculus
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- The call-by-need lambda calculus
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
Cited in
(14)- A lambda-calculus for dynamic binding
- Observational program calculi and the correctness of translations
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- The Call-by-Need Lambda Calculus, Revisited
- Linearity in the non-deterministic call-by-value setting
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
- scientific article; zbMATH DE number 1231694 (Why is no real title available?)
- A Fresh Look at the λ-Calculus
- A non-deterministic call-by-need lambda calculus
- Observational semantics for a concurrent lambda calculus with reference cells and futures
- On generic context lemmas for higher-order calculi with sharing
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- Closures of may-, should- and must-convergences for contextual equivalence
This page was built for publication: A non-deterministic call-by-need lambda calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348907)
