The key idea is that e-graphs are minimal DFTAs, but what does that mean? 🧵
An e-graph is a data structure for efficiently storing lots of equivalent expressions, and that's really useful for all sorts of PL problems in compilers, optimization, and synthesis. Read @mwillsey's SIGPLAN post for more! blog.sigplan.org/2021/04/06/equ…