arXiv (All)
open access
Augmenting Rewrite Rule Sets via Knuth-Bendix Completion
Equality Saturation (EqSat) is a powerful technique for program optimization, systematically exploring the search space of candidate programs to overcome the phase ordering problem. However, the feasibility and performance of EqSat rely heavily on the specific rewrite rules used to derive equivale
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Equality saturation theory exploration à la carte#1035611
- Associativity and Commutativity in Equality Saturation#1156470
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- String Rewriting Systems: Brief Introduction and Sample of Open Problems#973320
- Efficient Compression in Semigroups#1084110
Record · ID 1156518
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive