Pages that link to "Item:Q3520145"
From MaRDI portal
The following pages link to A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations (Q3520145):
Displaying 11 items.
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- Closures of may-, should- and must-convergences for contextual equivalence (Q991760) (← links)
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec (Q1944119) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- The Call-by-Need Lambda Calculus, Revisited (Q2892724) (← links)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) (← links)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (Q5240138) (← links)
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (Q5262945) (← links)
- Minimal translations from synchronous communication to synchronizing locks (Q6643748) (← links)