Proof Repair and (Co)algebra Equivalences
This work gives the first foundational treatment of proof repair, focusing in particular on type-theoretic proof repair in response to changes in datatypes, and formalizes and proves that the core component of this proof repair algorithm—a “configuration”—is exactly an algebra isomorphism.
E. G. Plante, Eric Paul, G. A. Kavvos
· 0 citations