Concepts: e-graphs and equality saturation

Resource | v1 | created by jjones |
Edit
bookmark
Type Manual
Created unavailable
Available at docs.rs/egg/0.6.0/egg/tutorials/_01_background/index.html
Identifier unavailable
Description

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.

Relations

about E-graphs

An e-graph compactly represents many equivalent programs.

Edit details Edit relations Attach new author Attach new topic Attach new resource
0.0 /10
useless alright awesome
from 0 reviews
Write comment Rate resource Tip: Rating is anonymous unless you also write a comment.
Resource level 0.0 /10
beginner intermediate advanced
Resource clarity 0.0 /10
hardly clear sometimes unclear perfectly clear
Reviewer's background 0.0 /10
none basics intermediate advanced expert
Comments 0
Currently, there aren't any comments.