Compositional relational reasoning via operational game semantics
Guilhem Jaber, Andrzej S. Murawski
Abstract
We show how to use operational game semantics as a guide to develop relational techniques for establishing contextual equivalences with respect to contexts drawn from a hierarchy of four call-by-value higher-order languages: with either general or ground-type references and with either call/cc or no control operator. In game semantics, differences between the contexts can be captured by the absence or presence of the O-visibility and O-bracketing conditions.
The proposed technique, which we call Kripke normal-form bisimulations, combines insights from normal-form bisimulation and Kripke logical relations with game semantics. In particular, the role of the heap and the name history is abstracted away using Kripke-style world transition systems. The differences between the four kinds of contexts manifest themselves through simple local conditions that can be shown to correspond to O-visibility and O-bracketing, as applicable.
The technique is sound and complete by virtue of correspondence with operational game semantics. Moreover, it sheds a new light on other related developments, such as backtracking and private transitions in Kripke logical relations, which can be related to specific phenomena in game models.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext bb9963e2-23f2-40ac-837b-e823829efe51Cited by top-tier papers2
- The Logical Essence of Well-Bracketed Control FlowAmin Timany, Armaël Guéneau, Lars BirkedalPOPL 2024 · 5 citations
- Operational Algorithmic Game SemanticsBenedict Bunting, Andrzej S. MurawskiLICS 2023 · 1 citation
Builds on1
Related papers
- Reachability Types, Traces and Full AbstractionBenedict Bunting, Andrzej S. MurawskiLICS 2025 · 2 citations
- Fully Abstract Normal Form Bisimulation for Call-by-Value PCFVasileios Koutavas, Yu-Yang Lin, Nikos TzevelekosLICS 2023 · 8 citations
- Bialgebraic Reasoning on Higher-order Program EquivalenceSergey Goncharov, Stefan Milius, Stelios Tsampas, Henning UrbatLICS 2024 · 4 citations
- Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program EquivalenceVasileios Koutavas, Yu-Yang Lin, Nikos TzevelekosLICS 2024 · 1 citation
- On sequentiality and well-bracketing in the π-calculusDaniel Hirschkoff, Enguerrand Prebet, Davide SangiorgiLICS 2021
