Phil Zucker has been writing about Egraphs modulo T for a while now; see his latest blog post and latest paper for up to date efforts. I've been thinking about this too, and this post is my attempt to summarize. I'll be referencing Phil's ideas repeatedly, since all of my thoughts trace back to his. What is an E-graph (abstractly) An e-graph is for conjunctive reasoning with equality. Conjunctive means we don't do any DPLL-style guesswork and we therefore don't need to backtrack; it's an inte...| Pavel Panchekha’s Blog
E-graphs are a data structure for equational reasoning and optimization over ground terms. One of the benefits of e-graph rewriting is that it can declaratively handle useful but difficult to orient identities like associativity and commutativity (AC) in a generic way. However, using these generic mechanisms is more computationally expensive than using bespoke routines on terms containing sets, multi-sets, linear expressions, polynomials, and binders. A natural question arises: How can one co...| Hey There Buddo!
That proofs are things (mathematical objects) is a cool meta awareness that is one of the payoffs of studying mathematical logic.| Hey There Buddo!