💾 Archived View for dcreager.net › theory › e-graphs › acyclic-egraphs-smart-constructors.gmi captured on 2024-12-17 at 09:33:55. Gemini links have been rewritten to link to archived content
⬅️ Previous capture (2024-09-29)
-=-=-=-=-=-=-
2024-09-16
From Philip Zucker, a follow-up to Max Bernstein's “What's in an e-graph?":
Acyclic Egraphs and Smart Constructors
Contains a really good description of “union nodes”, which give you a nice way to enumerate the elements of an equivalence set.