How to prove equations using diagrams: A categorical and operational semantics for e-graphs
Evan Patterson
Abstract
E-graphs are a powerful algorithmic technique for automated equational reasoning but have resisted a conceptual understanding independent of issues of presentation and implementation. We propose an operational semantics for e-graphs based on the fundamental category-theoretic concepts of diagrams, limits, and initial functors. We illustrate the formalism through numerous example calculations and establish its soundness and completeness. Technical prerequisites are kept to a minimum in the main text; less standard elements of the mathematical theory are developed in two appendices.
Create a lesson
Related papers
A topological Mundici representation theorem
Yifan Meng, Lili Shen, Dexue Zhang
The tensor triangular geometry of valuation domains
Tobias Barthel, Drew Heard, Beren Sanders et al.
Localisations of rings of weak global dimension at most one
Jan Šťovíček, Florian Tecklenburg
Higher zeroes in pointed infinity-categories
Thomas Rush Brown
Higher-order many-sorted categorial algebras via generalized hep-derivors
J. Climent Vidal, E. Cosme Llópez, R. Ruiz Mora et al.
Normalizers in the category of topological groups
Maria Manuel Clementino, James Richard Andrew Gray