Incremental techniques for efficient normalization of nonlinear rewrite systems
From MaRDI portal
Publication:5055772
DOI10.1007/3-540-53904-2_108zbMATH Open1503.68149OpenAlexW1846042928MaRDI QIDQ5055772
No author found.
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-53904-2_108
Cites Work
- Refutational theorem proving using term-rewriting systems
- Variations on the Common Subexpression Problem
- Pattern Matching in Trees
- Efficient string matching
- Incremental techniques for efficient normalization of nonlinear rewrite systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Related Items (2)
Incremental techniques for efficient normalization of nonlinear rewrite systems ⋮ Non-linear rewrite closure and weak normalization
This page was built for publication: Incremental techniques for efficient normalization of nonlinear rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055772)