How to prove equations using diagrams: A categorical and operational semantics for e-graphs
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.
- quotes — How to prove equations using diagrams: A categorical and operational semantics for e-graphs (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)
- quotes — summary: 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. (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)
- quotes — url: https://arxiv.org/abs/2611.05924 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)
- quotes — source-subject: arxiv:2611.05924 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)
- quotes — source-edition: sha256:23dd62284d105cf9da354aa4d1cc4cbbc01b2ecd907c3a5edaa931ba9f0fbe7b (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)
- quotes — source-metadata: {"subject":"arxiv:2611.05924","id":"2611.05924","url":"https://arxiv.org/abs/2611.05924","datestamp":"2026-11-05","status":"present","title":"How to prove equations using diagrams: A categorical and operational semantics for e-graphs","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.","authors":["Evan Patterson"],"categories":["math.CT","cs.LO"],"created":"2026-11-04","updated":"2026-11-05","articleLicense":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","version":null,"editionDigest":"sha256:23dd62284d105cf9da354aa4d1cc4cbbc01b2ecd907c3a5edaa931ba9f0fbe7b","sourceResponseAt":"2026-11-18T21:09:11Z","sourceDigest":"sha256:9463ef807009af84c66928c04f1b177905cda41c60c5b55e502ef901a90fca83"} (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)
- quotes — editorial-standing: source metadata; editorial acceptance pending (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2611.05924; status: unverified)