
Fast and Extensible Equality Saturation with egg
Recent developments in e-graphs and equality saturation make a compelling case for a new way to build optimizers and synthesizers.
by Max Willsey on Apr 6, 2021 | Tags: e-graphs, equality saturation, term rewriting
Recent developments in e-graphs and equality saturation make a compelling case for a new way to build optimizers and synthesizers.
The ACM Special Interest Group on Programming Languages (SIGPLAN) explores programming language concepts and tools, focusing on design, implementation, practice, and theory. Its members are programming language developers, educators, implementers, researchers, theoreticians, and users.
Keep up-to-date with the latest technical developments, network with colleagues outside your workplace and get cutting-edge information, focused resources and unparalleled forums for discussions.
Join here: https://www.acm.org/special-interest-groups/sigs/sigplan