AngouriMath
Saturation
Description
Summary
Runs rules over an e-graph until nothing more merges or the budget runs out — the shared
half of every transformation built on the rewrite graph.
half of every transformation built on the rewrite graph.
Remarks
Shared rather than written once per caller because the loop is subtle in ways that are not
visible from a second copy of it: what is charged and when, which rules can be skipped
without an attempt, and which of two matching paths a rule takes. Two transformations
already want it — one extracting the cheapest member of the root class and one extracting
the least — and they differ only in that extraction, not in any of this.
visible from a second copy of it: what is charged and when, which rules can be skipped
without an attempt, and which of two matching paths a rule takes. Two transformations
already want it — one extracting the cheapest member of the root class and one extracting
the least — and they differ only in that extraction, not in any of this.
Members
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online