most citedHigher-order bialgebraic semantics

1 citations · 1 across the 2 of their papers we have counts for

collaborators

8 papers

cs.LO20261 cited

Higher-order bialgebraic semantics

Sergey Goncharov, Stefan Milius, Lutz Schröder +2

Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi a…

cs.LO2026

Compositionality in Coalgebraic Trace Semantics

Robin Jourde, Henning Urbat, Sergey Goncharov +2

A key requirement on any well-behaved process language is its compositionality: behavioural equivalence of processes should be respected by the constructors of the language. Turi a…

cs.LO2026

The Only Distributive Law Over the Powerset Monad Is the One You Know

Sergey Goncharov, Dirk Hofmann, Pedro Nora +2

Distributive laws of set functors over the powerset monad (also known as Kleisli laws for the powerset monad) are well-known to be in one-to-one correspondence with extensions of s…

cs.PL2025

Bialgebraic Reasoning on Stateful Languages

Sergey Goncharov, Stefan Milius, Lutz Schröder +2

Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the obser…

cs.LO2025

Big Steps in Higher-Order Mathematical Operational Semantics

Sergey Goncharov, Pouya Partow, Stelios Tsampas

Small-step and big-step operational semantics are two fundamental styles of structural operational semantics (SOS), extensively used in practice. The former one is more fine-graine…

cs.LO2025

Relators and Notions of Simulation Revisited

Sergey Goncharov, Dirk Hofmann, Pedro Nora +2

Simulations and bisimulations are ubiquitous in the study of concurrent systems and modal logics of various types. Besides classical relational transition systems, relevant system…