From Applicative to Environmental Bisimulation
From MaRDI portal
Publication:5739359
DOI10.1016/j.entcs.2011.09.023zbMath1342.68089OpenAlexW2038116769WikidataQ113318222 ScholiaQ113318222MaRDI QIDQ5739359
Paul Blain Levy, Vasileios Koutavas, Eijiro Sumii
Publication date: 15 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2011.09.023
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus ⋮ A System-Level Game Semantics ⋮ Applicative Bisimulation and Quantum λ-Calculi ⋮ Program equivalence in a simple language with state ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
- The lazy lambda calculus in a concurrency scenario
- A theory of bisimulation for a fragment of concurrent ML with local names
- Proving congruence of bisimulation in functional programming languages
- Exceptional syntax
- A bisimulation for type abstraction and recursion
- Typed Normal Form Bisimulation
- Open Bisimulation for Aspects
- Equivalence in functional languages with effects
- The impact of higher-order state and control effects on local relational reasoning
- A bisimulation for type abstraction and recursion
- Small bisimulations for reasoning about higher-order imperative programs
- A Fully Abstract Trace Semantics for General References
- Untyped lambda-calculus with input-output
- Programming Languages and Systems
- A bisimulation for dynamic sealing
- A bisimulation for dynamic sealing
This page was built for publication: From Applicative to Environmental Bisimulation
