Nominal Completion for Rewrite Systems with Binders
Lecture notes in computer science2012pp. 201–213
Citations Over Time
Related Papers
- → Development closed critical pairs(1996)18 cited
- → Checking Overlaps of Nominal Rewriting Rules(2016)9 cited
- → Proving and disproving confluence of context-sensitive rewriting(2022)3 cited
- → Completion of Globally Finite Term Rewriting Systems for Inductive Proofs(1986)6 cited
- Development Closed Critical Pairs.(1996)