3 citations · 4 across the 4 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2026
Lifting E-Graphs: A Function Isn't a Constant
Philip Zucker
Variables are quite subtle and easy to get wrong. An approach is described to support rigid canonical variables in an e-graph. The lifting e-graph has a baked-in notion of func…
cs.PL2025★ 1 cited
Omelets Need Onions: E-graphs Modulo Theories via Bottom-up E-matching
Philip Zucker
E-graphs are a data structure for equational reasoning and optimization over ground terms. One of the benefits of e-graph rewriting is that it can declaratively handle useful but d…
cs.PL2023★ 3 cited
Better Together: Unifying Datalog and Equality Saturation
Yihong Zhang, Yisu Remy Wang, Oliver Flatt +5
We present egglog, a fixpoint reasoning system that unifies Datalog and equality saturation (EqSat). Like Datalog, it supports efficient incremental execution, cooperating analyses…