11 citations · 37 across the 19 of their papers we have counts for
21 papers · 1 filter
Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
Sergey Goncharov
Like the notion of computation via (strong) monads serves to classify various flavours of impurity, including exceptions, non-determinism, probability, local and global store, the…
Shades of Iteration: from Elgot to Kleene
Sergey Goncharov
Notions of iteration range from the arguably most general Elgot iteration to a very specific Kleene iteration. The fundamental nature of Elgot iteration has been extensively explor…
Towards a Higher-Order Mathematical Operational 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…
Quantitative Hennessy-Milner Theorems via Notions of Density
Jonas Forster, Sergey Goncharov, Dirk Hofmann +3
The classical Hennessy-Milner theorem is an important tool in the analysis of concurrent processes; it guarantees that any two non-bisimilar states in finitely branching labelled t…
Stateful Structural Operational Semantics
Sergey Goncharov, Stefan Milius, Lutz Schröder +2
Compositionality of denotational semantics is an important concern in programming semantics. Mathematical operational semantics in the sense of Turi and Plotkin guarantees composit…
Uniform Elgot Iteration in Foundations
Sergey Goncharov
Category theory is famous for its innovative way of thinking of concepts by their descriptions, in particular by establishing universal properties. Concepts that can be characteriz…