A more general categorical framework for congruence of applicative bisimilarity
Logic in Computer Science
2023-03-22 v1 Category Theory
Abstract
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations on terms other than capture-avoiding substitution. This is typically the case for PCF, -calculus with delimited continuations, and early-style bisimilarity in higher-order process calculi.
Keywords
Cite
@article{arxiv.2303.11679,
title = {A more general categorical framework for congruence of applicative bisimilarity},
author = {Tom Hirschowitz and Ambroise Lafont},
journal= {arXiv preprint arXiv:2303.11679},
year = {2023}
}