2 citations · 2 across the 3 of their papers we have counts for
3 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…
cs.LO2024★ 2 cited
Higher-Order Constrained Dependency Pairs for (Universal) Computability
Liye Guo, Kasper Hagens, Cynthia Kop +1
Dependency pairs constitute a series of very effective techniques for the termination analysis of term rewriting systems. In this paper, we adapt the static dependency pair framewo…