On generic context lemmas for higher-order calculi with sharing
From MaRDI portal
Publication:960863
DOI10.1016/J.TCS.2009.12.001zbMATH Open1191.68165OpenAlexW2051507754WikidataQ124828671 ScholiaQ124828671MaRDI QIDQ960863FDOQ960863
David Sabel, Manfred Schmidt-Schauß
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The revised report on the syntactic theories of sequential control and state
- Bisimilarity as a theory of functional programming
- Proving congruence of bisimulation in functional programming languages
- A Powerdomain Construction
- The \(\pi\)-calculus: A theory of mobile processes
- Equivalence in functional languages with effects
- Fair testing
- Operational reasoning for functions with local state
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- Formal foundations of operational semantics
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
- A concurrent lambda calculus with futures
- Fully abstract models of typed \(\lambda\)-calculi
- Operational techniques in PVS -- a preliminary evaluation
- Explicit substitutions
- Safety of Nöcker's strictness analysis
- Relational reasoning about contexts
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
- Erratic Fudgets: A semantic theory for an embedded coordination language
- From operational semantics to domain theory
- Observational program calculi and the correctness of translations
- Congruence of bisimulation in a non-deterministic call-by-need lambda calculus
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- Full Abstraction and the Context Lemma
- A non-deterministic call-by-need lambda calculus
- Correctness of Copy in Calculi with Letrec
Cited In (6)
- 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
- Program equivalence in a typed probabilistic call-by-need functional language
- Observational program calculi and the correctness of translations
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
- A two-valued logic for properties of strict functional programs allowing partial functions
Uses Software
This page was built for publication: On generic context lemmas for higher-order calculi with sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960863)
