A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

DOI10.1017/S0960129508006774zbMATH Open1153.68011OpenAlexW2142030149WikidataQ124845870 ScholiaQ124845870MaRDI QIDQ3520145FDOQ3520145

David Sabel, Manfred Schmidt-Schauß

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

Recommendations

• The Call-by-Need Lambda Calculus, Revisited
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• A non-deterministic call-by-need lambda calculus
• A non-deterministic call-by-need lambda calculus
• The \(\lambda\)-context calculus
• A sound and complete bisimulation for contextual equivalence in \(\lambda\)-calculus with call/cc
• A calculus of lambda calculus contexts
• scientific article; zbMATH DE number 7650848
• Congruence of bisimulation in a non-deterministic call-by-need lambda calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Cites Work

• Secrets of the Glasgow Haskell Compiler inliner
• Title not available (Why is that?)
• Algorithm + strategy = parallelism
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus

Cited In (12)

• 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
• Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
• Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
• Closures of may-, should- and must-convergences for contextual equivalence
• Extracting total Amb programs from proofs
• Observational program calculi and the correctness of translations
• The Call-by-Need Lambda Calculus, Revisited
• Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
• Minimal translations from synchronous communication to synchronizing locks
• Structural Rewriting in the pi-Calculus.
• On generic context lemmas for higher-order calculi with sharing

Uses Software

• Haskell
• GHC

This page was built for publication: A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520145)