11 citations · 37 across the 19 of their papers we have counts for
28 papers
Towards a Higher-Order Bialgebraic Denotational Semantics
Sergey Goncharov, Marco Peressotti, Stelios Tsampas +2
The bialgebraic abstract GSOS framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and proc…
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…
Weak Similarity in Higher-Order Mathematical Operational Semantics
Henning Urbat, Stelios Tsampas, Sergey Goncharov +2
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness p…
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…