EGRAPHS Community

The EGRAPHS community brings together researchers and practitioners that use e-graphs and related techniques. E-graphs are data structures for working with large equivalence classes of programs; they have recently been employed to build new kinds of program optimizers and synthesizers.

Curious what people are doing with e-graphs? Check out Philip Zucker’s page on Awesome E-graphs.

An e-graph compactly represents many equivalent programs. These four e-graphs represent more and more (even infinite!) ways to write (a × 2) / 2.

This website brings together the following resources:

All are welcome to join the EGRAPHS community by attending the monthly meeting, joining the Zulip, or submitting to or attending the workshop. The EGRAPHS community is organized by an cross-institutional advisory board.

Have a talk (self-)nomination or other suggestion? Reach out on Zulip or via the EGRAPHS Suggestion Box!