6 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…
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…
The Algebra of Iterative Constructions
Kevin Batz, Benjamin Lucien Kaminski, Lucas Kehrer +3
Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructi…
Intrinsically Correct Algorithms and Recursive Coalgebras
Cass Alexandru, Henning Urbat, Thorsten WiÃmann
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categori…
Well-Founded Coalgebras Meet König's Lemma
Henning Urbat, Thorsten WiÃmann
König's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely bra…
Higher-Order Behavioural Conformances via Fibrations
Henning Urbat
Coinduction is a widely used technique for establishing behavioural equivalence of programs in higher-order languages. In recent years, the rise of languages with quantitative (e.g…