2019
DOI: 10.4204/eptcs.300.1
|View full text |Cite
|
Sign up to set email alerts
|

Cellular Monads from Positive GSOS Specifications

Abstract: We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS specifications generate cellular monads whose free algebras are all compositional. As a consequence, we recover the known result that bisimilarity is a congruence in the generated labelled transition system.• The treatment of languages with variable binding is significantly mo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 25 publications
(41 reference statements)
0
2
0
Order By: Relevance
“…In previous work [26,25], the first author has proposed an alternative approach to the problem, dropping the coalgebraic notion of bisimulation used by Turi and Plotkin in favour of a notion based on factorisation systems, similar to Joyal et al's [28]. Furthermore, congruence of bisimilarity is notably obtained by assuming that syntax induces a familial monad, in the sense of Diers [15,13,46].…”
Section: Introductionmentioning
confidence: 99%
“…In previous work [26,25], the first author has proposed an alternative approach to the problem, dropping the coalgebraic notion of bisimulation used by Turi and Plotkin in favour of a notion based on factorisation systems, similar to Joyal et al's [28]. Furthermore, congruence of bisimilarity is notably obtained by assuming that syntax induces a familial monad, in the sense of Diers [15,13,46].…”
Section: Introductionmentioning
confidence: 99%
“…In previous work [Hir19b,Hir19a], the first author has proposed an alternative approach to the problem, dropping the coalgebraic notion of bisimulation used by Turi and Plotkin in favour of a notion based on factorisation systems, similar to Joyal et al's [JNW93]. Furthermore, congruence of bisimilarity is notably obtained by assuming that syntax induces a familial monad [Die78, CJ95,Web07a].…”
mentioning
confidence: 99%