Concepts: e-graphs and equality saturation
An e-graph is a data structure that powers the equality saturation optimization technique. Both e-graphs (Gregory Nelson's PhD Thesis, 1980) and equality saturation (Tate et. al., 2009) were invented before. This tutorial will approach these concepts at a high level.
Edit details Edit relations Attach new author Attach new topic Attach new resource