On generic context lemmas for higher-order calculi with sharing

DOI10.1016/j.tcs.2009.12.001zbMath1191.68165WikidataQ124828671 ScholiaQ124828671MaRDI QIDQ960863

David Sabel, Manfred Schmidt-Schauss

Publication date: 29 March 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.001

zbMATH Keywords

lambda calculus; functional programming languages; context Lemma; observational semantics

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

Related Items

Unnamed Item, A two-valued logic for properties of strict functional programs allowing partial functions, 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 program calculi and the correctness of translations

Uses Software

• Fudgets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A concurrent lambda calculus with futures
• Fair testing
• The revised report on the syntactic theories of sequential control and state
• Fully abstract models of typed \(\lambda\)-calculi
• Formal foundations of operational semantics
• Bisimilarity as a theory of functional programming
• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
• Erratic Fudgets: A semantic theory for an embedded coordination language
• Proving congruence of bisimulation in functional programming languages
• From operational semantics to domain theory
• Observational program calculi and the correctness of translations
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Safety of Nöcker's strictness analysis
• A Powerdomain Construction
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• Full Abstraction and the Context Lemma
• Explicit substitutions
• Equivalence in functional languages with effects
• Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
• A non-deterministic call-by-need lambda calculus
• Correctness of Copy in Calculi with Letrec