Congruence of bisimulation in a non-deterministic call-by-need lambda calculus
From MaRDI portal
Recommendations
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- Simulation in the call-by-need lambda-calculus with letrec
- Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
- The call-by-need lambda calculus
Cited in
(9)- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
- Simulation in the call-by-need lambda-calculus with letrec
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- On generic context lemmas for higher-order calculi with sharing
- Bisimulation Congruences in the Calculus of Looping Sequences
This page was built for publication: Congruence of bisimulation in 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 Q2848130)