A categorical framework for congruence of applicative bisimilarity in higher-order languages
From MaRDI portal
Publication:5043601
DOI10.46298/lmcs-18(3:37)2022OpenAlexW4213477957MaRDI QIDQ5043601
Lafont Ambroise, Hirschowitz Tom
Publication date: 6 October 2022
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.16833
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Skew-monoidal categories and bialgebroids.
- Double bicategories and double cospans
- On the construction of free algebras for equational systems
- Sheaves in geometry and logic: a first introduction to topos theory
- A calculus of mobile processes. I
- A left adjoint construction related to free triples
- Full abstraction in the lazy lambda calculus
- The lazy lambda calculus in a concurrency scenario
- Bisimilarity as a theory of functional programming
- Compositional SOS and beyond: A coalgebraic view of open systems
- Proving congruence of bisimulation in functional programming languages
- Bisimulation from open maps
- Relative full completeness for bicategorical Cartesian closed structure
- Yoneda structures from 2-toposes
- Logical relations for monadic types
- Elementary observations on 2-categorical limits
- Bisimulation can't be traced
- Introduction to bicategories
- Shapely monads and analytic functors
- Connected limits, familial representability and Artin glueing
- Categorical fixed point calculus
- List Objects with Algebraic Structure
- Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
- Algebraic models of simple type theories
- A Cellular Howe Theorem
- Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure
- Howe's Method for Contextual Semantics
- Howe's method for higher-order languages
- Programming Languages and Systems
- Effectful normal form bisimulation