a public good project by the
Synthesis
Company
of California

© 2026

Optimization of rewriting and complexity of rewriting | doi.page

0 references

Google Scholar doi.org

Optimization of rewriting and complexity of rewriting

Lecture notes in computer science·1990·pp. 359–371

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)