On generic context lemmas for higher-order calculi with sharing
From MaRDI portal
(Redirected from Publication:960863)
Recommendations
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- The theory of contexts for first order and higher order abstract syntax
- Contextual labelled semantics for higher-order process calculi
- RPO, Second-Order Contexts, and λ-Calculus
- Contextual equivalences in call-by-need and call-by-name polymorphically typed calculi (preliminary report)
Cites work
- scientific article; zbMATH DE number 4180818 (Why is no real title available?)
- scientific article; zbMATH DE number 1231610 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- A Powerdomain Construction
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- A concurrent lambda calculus with futures
- A non-deterministic call-by-need lambda calculus
- Bisimilarity as a theory of functional programming
- Congruence of bisimulation in a non-deterministic call-by-need lambda calculus
- Correctness of Copy in Calculi with Letrec
- Equivalence in functional languages with effects
- Erratic Fudgets: A semantic theory for an embedded coordination language
- Explicit substitutions
- Fair testing
- Formal foundations of operational semantics
- From operational semantics to domain theory
- Full Abstraction and the Context Lemma
- Fully abstract models of typed \(\lambda\)-calculi
- Observational program calculi and the correctness of translations
- Observational semantics for a concurrent lambda calculus with reference cells and futures
- On the representation of McCarthy's amb in the -calculus
- Operational reasoning for functions with local state
- Operational techniques in PVS -- a preliminary evaluation
- Proving congruence of bisimulation in functional programming languages
- Relational reasoning about contexts
- Safety of Nöcker's strictness analysis
- The \(\pi\)-calculus: A theory of mobile processes
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The revised report on the syntactic theories of sequential control and state
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
- Observational program calculi and the correctness of translations
- Program equivalence in a typed probabilistic call-by-need functional language
- 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
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)
