¶Acyclic e-graphs and smart constructors
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.