A more general categorical framework for congruence of applicative bisimilarity

Autor:	Hirschowitz, Tom, Lafont, Ambroise
Rok vydání:	2023
Předmět:	Computer Science - Logic in Computer Science Mathematics - Category Theory
Druh dokumentu:	Working Paper
Popis:	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, $\lambda$-calculus with delimited continuations, and early-style bisimilarity in higher-order process calculi.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2303.11679 Zobrazit plný text záznamu View this record from Arxiv