Equivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2002.06799/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTEquivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model — HN submissionhttps://news.ycombinator.com/item?id=24670292urn:hackerpapers:submission:2002.06799:24670292Sat, 03 Oct 2020 07:27:50 GMT<p>Symbolic Expression Equivalence Proofs Using Graph-to-Sequence Networks</p><p></p><p>3 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2002.06799/">Paper and source history</a>. A submission is not an endorsement.</p>cs.LGEquivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model — HN submissionhttps://news.ycombinator.com/item?id=24570993urn:hackerpapers:submission:2002.06799:24570993Wed, 23 Sep 2020 19:35:33 GMT<p>Equivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Model</p><p></p><p>5 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2002.06799/">Paper and source history</a>. A submission is not an endorsement.</p>cs.LG