Showing cs.PLShow all
3 papers · 1 filter
cs.PL2026
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…
cs.PL2025
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…
cs.PL2025
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…