Familial monads and structural operational semantics

We propose a categorical framework for structural operational semantics, in which we prove that under suitable hypotheses bisimilarity is a congruence. We then refine the framework to prove soundness of bisimulation up to context, an efficient method for reducing the size of bisimulation relations....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of ACM on programming languages Ročník 3; číslo POPL; s. 1 - 28
Hlavní autor: Hirschowitz, Tom
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 02.01.2019
Témata:
Categorical semantics
Computer Science
Concurrency
Denotational semantics
Logic in Computer Science
Models of computation
Operational semantics
Process calculi
Program semantics
Programming Languages
Semantics and reasoning
Theory of computation
category theory
familial monads
Structural operational semantics
Categorical semantics
Operational semantics
Process calculi
ISSN:2475-1421, 2475-1421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We propose a categorical framework for structural operational semantics, in which we prove that under suitable hypotheses bisimilarity is a congruence. We then refine the framework to prove soundness of bisimulation up to context, an efficient method for reducing the size of bisimulation relations. Finally, we demonstrate the flexibility of our approach by reproving known results in three variants of the π-calculus.
ISSN:2475-1421
2475-1421
DOI:10.1145/3290334