Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
From MaRDI portal
Publication:964003
DOI10.1016/j.ic.2009.11.003zbMath1187.68129MaRDI QIDQ964003
Matthias Mann, Manfred Schmidt-Schauss
Publication date: 14 April 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.11.003
bisimulation; lambda calculus; contextual equivalence; call-by-need; higher-order programming languages; non-deterministic lambda calculus
68N18: Functional programming and lambda calculus
Related Items
Uses Software
Cites Work
- On generic context lemmas for higher-order calculi with sharing
- Fully abstract models of typed \(\lambda\)-calculi
- Bisimilarity as a theory of functional programming
- Erratic Fudgets: A semantic theory for an embedded coordination language
- Proving congruence of bisimulation in functional programming languages
- Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
- An operational semantics for parallel lazy evaluation
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- Safety of Nöcker's strictness analysis
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- A non-deterministic call-by-need lambda calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item