Post #2538504
2026-04-08 13:12 UTC
Our paper (with Thorsten Wißmann & Henning Urbat) "Intrinsically Correct Algorithms and Recursive Coalgebras" has been accepted at PLDI'26, and is out on arxiv! In this thread I will briefly explain its main idea. 1/8
https://arxiv.org/abs/2512.10748
https://pldi26.sigplan.org/details/pldi-2026-papers/66/Intrinsically-Correct-Algorithms-and-Recursive-Coalgebras
Replies (2)
-
@cxandru@types.pl 2026-04-08 13:13
Divide-and-conquer algorithms are described by the notion of coalgebra-to-algebra morphism for some functor F. The "divide" step is given by an F-coalgebra c, the "combine" step by an F-algebra a, and the whole algorithm h satisfies the functional equation h = c; Fh; a. 2/8
-
@6d03@mathstodon.xyz 2026-04-12 13:33
@cxandru@types.pl this is so cool. I started reading it today.