Right now the matching algorithm, because it's fairly complex, is implemented entirely at runtime by a function that looks through the pattern and the e-graph simultaneously. Could be really cool to be able to compile the matcher for a given pattern to be able to apply rewrites more quickly.
Right now the matching algorithm, because it's fairly complex, is implemented entirely at runtime by a function that looks through the pattern and the e-graph simultaneously. Could be really cool to be able to compile the matcher for a given pattern to be able to apply rewrites more quickly.