https://hackerpaper.kaipfister.de/p/1012.1802/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=47520296urn:hackerpapers:mention:1012.1802:47520296Wed, 25 Mar 2026 17:15:44 GMT<p>From https://arxiv.org/abs/1012.1802 we read the following about &quot;equality saturation&quot; which was a new term to me: &gt; ... We present a new approach for structuring the optimization phase of a compiler. In our approach, optimizations take the form of equality analyses that add equality information to a common intermediate representation. The optimizer works by repeatedly applying these analyses to infer equivalences between program fragments, thus saturating the intermediate representation with equalities. Once saturated, the intermediate representation encodes multiple optimized versions of…</p><p><a href="https://hackerpaper.kaipfister.de/p/1012.1802/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.PLhttps://news.ycombinator.com/item?id=43994750urn:hackerpapers:mention:1012.1802:43994750Thu, 15 May 2025 13:18:42 GMT<p>One can have obvious but repetitive optimizations with symbolic programming [1]. [1] https://arxiv.org/abs/1012.1802 Strange that AlphaEvolve authors do not compare their work to what is achievable by equality saturation. An implementation of equality saturation can take interesting integrals with very simple rules [2]. [2] https://github.com/alt-romes/hegg/blob/master/test/Sym.hs#L3...</p><p><a href="https://hackerpaper.kaipfister.de/p/1012.1802/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.PL