2 papers
cs.LO2026
Templates in Rewriting Induction
Kasper Hagens, Cynthia Kop
Rewriting Induction (RI) is a formal system in term rewriting to establish program equivalence. The recently defined Bounded RI for higher-order Logically Constrained Term Rewritin…
cs.LO2026
Bounded Rewriting Induction for LCSTRSs
Kasper Hagens, Cynthia Kop
Rewriting Induction (RI) is a method to prove inductive theorems, originating from equational reasoning. By using Logically Constrained Simply-typed Term Rewriting Systems (LCSTRSs…