Simulation in the call-by-need lambda-calculus with letrec
From MaRDI portal
Recommendations
- Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- Congruence of bisimulation in a non-deterministic call-by-need lambda calculus
- Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
Cited in
(9)- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
- Observational program calculi and the correctness of translations
- Congruence of bisimulation in a non-deterministic call-by-need lambda calculus
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
- Applicative may- and should-simulation in the call-by-value lambda calculus with AMB
- Simulation in the call-by-need lambda-calculus with letrec, case, constructors, and seq
- Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
- RPO, Second-Order Contexts, and λ-Calculus
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
This page was built for publication: Simulation in the call-by-need lambda-calculus with letrec
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389151)
