Exploring Exponentially Many Programs at Once with E-Graphs
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
This article explains e-graphs, a 1970s data structure from SMT solvers now used for equality saturation, which lets a compiler or optimizer explore exponentially many provably equivalent program variants compactly and postpone committing to optimization choices.