A Cellular Howe Theorem
Peio Borthelle, Tom Hirschowitz, Ambroise Lafont
Abstract
We introduce a categorical framework for operational semantics, in which we define substitution-closed bisimilarity, an abstract analogue of the open extension of Abramsky's applicative bisimilarity. We furthermore prove a congruence theorem for substitution-closed bisimilarity, following Howe's method. We finally demonstrate that the framework covers the call-by-name and call-by-value variants of λ-calculus in big-step style. As an intermediate result, we generalise the standard framework of Fiore et al. for syntax with variable binding to the skew-monoidal case.
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 1aef017c-d2e8-47ca-8ca9-9254255e877dCited by top-tier papers6
- Formal metatheory of second-order abstract syntaxMarcelo Fiore, Dmitrij SzamozvancevPOPL 2022 · 20 citations
- Towards a Higher-Order Mathematical Operational SemanticsSergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas et al.POPL 2023 · 15 citations
- Weak Similarity in Higher-Order Mathematical Operational SemanticsHenning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius et al.LICS 2023 · 10 citations
- Higher-Order Behavioural Conformances via FibrationsHenning UrbatPOPL 2026
- Allegories of Symbolic ManipulationsFrancesco GavazzoLICS 2023
Builds on1
Related papers
- A Unified Treatment of the Substitution Tensor for Presheaves, Nominal Sets, Renaming Sets, and so onFabian Lenke, Stefan Milius, Henning UrbatLICS 2026
- Substructural Abstract Syntax with Variable Binding and Single-Variable SubstitutionMarcelo Fiore, Sanjiv RanchodLICS 2025 · 3 citations
- Bialgebraic Reasoning on Higher-order Program EquivalenceSergey Goncharov, Stefan Milius, Stelios Tsampas, Henning UrbatLICS 2024 · 4 citations
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-NameGianluca Curzi, Michele PaganiLICS 2020 · 1 citation
- An Algebraic Approach to Formal System MetatheoryFrancesco GavazzoLICS 2026
