A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
From MaRDI portal
Publication:3520145
DOI10.1017/S0960129508006774zbMath1153.68011OpenAlexW2142030149WikidataQ124845870 ScholiaQ124845870MaRDI QIDQ3520145
David Sabel, Manfred Schmidt-Schauss
Publication date: 15 August 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129508006774
Related Items (10)
Extracting total Amb programs from proofs ⋮ Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec ⋮ A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ Structural Rewriting in the pi-Calculus. ⋮ Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) ⋮ 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 ⋮ Observational program calculi and the correctness of translations ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Uses Software
Cites Work
This page was built for publication: A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
