POPL paper gives first foundational theory of proof repair: configurations are algebra isomorphisms
danbri · x · 2026-11-10
- Talia Ringer's group published "Proof Repair and (Co)algebra Equivalences" at POPL, the first foundational treatment of proof repair — automation that adapts formal proofs when dependencies change — previously understood only algorithmically.
- Key insight: the core "configuration" of a proof repair algorithm is exactly an algebra isomorphism; this is formalized and proven, answering open questions from prior work.
- Taking the dual extends the results to proof repair over coinductive types. All results are formalized in Agda; code and artifact are public (arXiv:2610.36669, 30 pages).
More from Research
- MacroHands debuts: 3D hand tracking from egocentric video, stereo variant cuts depth error to 13.1mm — eliebakouch · 2026-11-11
- Yann LeCun: 'If you are interested in human-level AI, don't work on LLMs' — StasBekman · 2026-11-11
- FlashAttention co-creator Dan Fu on kernels, inference economics, and owning vs leasing GPUs — realDanFu · 2026-11-11
- OpenTac debuts at CoRL as researchers call tactile the missing half of robot data — anand_bhattad · 2026-11-11
- Geodesiclab scores big improvement on antibody structure prediction, the hardest part of the problem — QuanquanGu · 2026-11-11
- AI drug discovery hits its HBM moment as the bottleneck shifts to the wet lab — QuanquanGu · 2026-11-11