3 papers
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.LO2025
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 bran…
cs.LO2025
Trees in Coalgebra from Generalized Reachability
Thorsten Wißmann, Bálint Kocsis, Jurriaan Rot +1
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property o…