A template-based lemma generation method integrated into bounded rewriting induction for higher-order LCSTRSs enables proving program equivalences previously out of reach.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Templates in Rewriting Induction
A template-based lemma generation method integrated into bounded rewriting induction for higher-order LCSTRSs enables proving program equivalences previously out of reach.