<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Automated Code Optimization with E-Graphs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.14714/</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/2112.14714/feed.xml" rel="self" type="application/rss+xml" /><item><title>Automated Code Optimization with E-Graphs — mentioned by bobbylarrybobby</title><link>https://news.ycombinator.com/item?id=31328658</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.14714:31328658</guid><pubDate>Tue, 10 May 2022 15:58:56 GMT</pubDate><description>&lt;p&gt;Reminds me of this paper on implementing compiler optimizations within the Julia language itself: https://arxiv.org/abs/2112.14714 -- &amp;quot;can symbolic mathematics do high-level compiler optimizations or vice-versa?&amp;quot;&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.14714/"&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>Automated Code Optimization with E-Graphs — HN submission</title><link>https://news.ycombinator.com/item?id=29775477</link><guid isPermaLink="false">urn:hackerpapers:submission:2112.14714:29775477</guid><pubDate>Sun, 02 Jan 2022 23:51:37 GMT</pubDate><description>&lt;p&gt;Automated Code Optimization with E-Graphs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;102 points; 10 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2112.14714/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Automated Code Optimization with E-Graphs — mentioned by snicker7</title><link>https://news.ycombinator.com/item?id=29772228</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.14714:29772228</guid><pubDate>Sun, 02 Jan 2022 18:57:26 GMT</pubDate><description>&lt;p&gt;Mentioned paper: https://arxiv.org/abs/2112.14714 Abstract: This thesis proposes an advanced, generic and high-level code rewriting and analysis system in the Julia programming language, providing applied equality saturation in the presence of multiple dispatch and metaprogramming. We show how our system can practically solve some challenging problems: Can programmers implement their own high-level compiler optimizations for their domain-specific scientific programs, without the requirement of them being compiler experts at all? Can these optimizers be implemented by users in the same…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.14714/"&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>Automated Code Optimization with E-Graphs — HN submission</title><link>https://news.ycombinator.com/item?id=29758572</link><guid isPermaLink="false">urn:hackerpapers:submission:2112.14714:29758572</guid><pubDate>Sat, 01 Jan 2022 14:36:58 GMT</pubDate><description>&lt;p&gt;Automated Code Optimization with E-Graphs&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2112.14714/"&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>
