<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>egg: Fast and Extensible Equality Saturation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2004.03082/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2004.03082/feed.xml" rel="self" type="application/rss+xml" /><item><title>egg: Fast and Extensible Equality Saturation — mentioned by jiggawatts</title><link>https://news.ycombinator.com/item?id=38667166</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.03082:38667166</guid><pubDate>Sat, 16 Dec 2023 19:53:41 GMT</pubDate><description>&lt;p&gt;I was about to comment that this reminds me of Aaron Hsu’s Dyalog compiler, but it’s mentioned right there in the README as one of the inspirations. IMHO, compilers are about an order of magnitude slower than they could be, and this type of tree representation could be one key element for fixing that. One interesting approach would be to combine egg[1] with this style of vectorised trees for efficient optimisation passes. [1] https://arxiv.org/pdf/2004.03082.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.03082/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>egg: Fast and Extensible Equality Saturation — mentioned by superlopuh</title><link>https://news.ycombinator.com/item?id=32190183</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.03082:32190183</guid><pubDate>Fri, 22 Jul 2022 09:29:28 GMT</pubDate><description>&lt;p&gt;Yes, at least these egg-based projects are usign this idea, but it looks like it&amp;#x27;s just one of the options: https://souffle-lang.github.io/docs.html http://www.philipzucker.com/souffle-egg4/ https://arxiv.org/pdf/2004.03082.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.03082/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>egg: Fast and Extensible Equality Saturation — mentioned by romes</title><link>https://news.ycombinator.com/item?id=32189678</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.03082:32189678</guid><pubDate>Fri, 22 Jul 2022 08:01:21 GMT</pubDate><description>&lt;p&gt;Equality graphs (e-graphs) for theorem proving and equality saturation and other equality-related things. They&amp;#x27;re awesome data structures that efficiently maintain a congruence relation over many expressions &amp;gt; At a high level, e-graphs extend union-find to compactly represent equivalence classes of expressions while maintaining a key invariant: the equivalence relation is closed under congruence. e.g. If I were to represent &amp;quot;f(x)&amp;quot; and &amp;quot;f(y)&amp;quot; in the e-graph, and then said &amp;quot;x == y&amp;quot; (merged &amp;quot;x&amp;quot; and &amp;quot;y&amp;quot; in the e-graph), then the e-graph, by congruence, would be able to tell me that &amp;quot;f(x) == f(y)&amp;quot;…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.03082/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>egg: Fast and Extensible Equality Saturation — mentioned by verdverm</title><link>https://news.ycombinator.com/item?id=26588346</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.03082:26588346</guid><pubDate>Fri, 26 Mar 2021 03:00:06 GMT</pubDate><description>&lt;p&gt;And the paper for reference https://arxiv.org/abs/2004.03082&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.03082/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>egg: Fast and Extensible Equality Saturation — mentioned by brzozowski</title><link>https://news.ycombinator.com/item?id=26367772</link><guid isPermaLink="false">urn:hackerpapers:mention:2004.03082:26367772</guid><pubDate>Sat, 06 Mar 2021 14:58:39 GMT</pubDate><description>&lt;p&gt;The author frames this as a contest between two architectures: either spend a lot of effort building custom developer tools, or repurpose the compiler as a server for multiple clients. Both approaches have their tradeoffs: the first, as the author mentions, violates DRY [1]. The second violates the Unix philosophy [2]. However, there is a third way. Both developer tools and compilers can be seen as special cases of a much simpler and more general pattern known as a graph database [3, 4, 5]. [1]: https://en.wikipedia.org/wiki/Don%27t_repeat_yourself [2]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2004.03082/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>egg: Fast and Extensible Equality Saturation — HN submission</title><link>https://news.ycombinator.com/item?id=24668016</link><guid isPermaLink="false">urn:hackerpapers:submission:2004.03082:24668016</guid><pubDate>Fri, 02 Oct 2020 23:18:09 GMT</pubDate><description>&lt;p&gt;egg: Fast and Extensible E-graphs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;7 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2004.03082/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
