Metraipolis › archive › dc_216a1cdcaab5

Associativity and Commutativity in Equality Saturation — arXiv:2610.01198

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01198
License (as archived)
CC0-1.0
Archived
2026-10-07T11:30:13.743Z
SHA-256 of the archived text
56609d96d46612a39dfec961f2d876fe29429d2159b902b3b9dcd1de4374731c
Stable URL of this page
https://metraipolis.com/documento/dc_216a1cdcaab5

How to cite

Associativity and Commutativity in Equality Saturation — arXiv:2610.01198 — arXiv (en), https://arxiv.org/abs/2610.01198 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_216a1cdcaab5 (Metraipolis archive dc_216a1cdcaab5, sha256 56609d96d46612a39dfec961f2d876fe29429d2159b902b3b9dcd1de4374731c)
BibTeX
@misc{dc216a1cdcaab5,
  title = {Associativity and Commutativity in Equality Saturation — arXiv:2610.01198},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01198},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_216a1cdcaab5; sha256 56609d96d46612a39dfec961f2d876fe29429d2159b902b3b9dcd1de4374731c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01198. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Equality saturation is a promising technique for program optimization which sidesteps the phase ordering problem. However, current e-graph implementations grow exponentially large, even for simple examples. Many practical applications involve associative and commutative (AC) operators. We present an extension of relational e-matching that handles AC operators natively by storing terms as multisets. Preliminary results show that equality saturation modulo AC uses asymptotically less memory in certain cases.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-02 in cs.PL).
Categorie arXiv: Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2610.01198 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:17:25.929Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).