The paper defines e-graphs with bindings as morphisms of closed semilattice-enriched monoidal categories and represents them as hierarchical hypergraphs with double-pushout rewriting.
String diagram rewrite theory i: Rewriting with frobeni us structure
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Categorical E-Graphs for Lambda Calculi
The paper defines e-graphs with bindings as morphisms of closed semilattice-enriched monoidal categories and represents them as hierarchical hypergraphs with double-pushout rewriting.