interactive: arrange-idempotence as an e-graph rule in DDIR#766
Merged
Conversation
A minimal but genuine e-graph expressed as a DDIR program and run on the server: congruence closure (the `eqsat:` scope) plus one rewrite rule, arrange-idempotence — `arrange(x) ≡ x` when `x` is already arranged. The rule asserts equalities between structurally-different nodes and congruence propagates them to a fixpoint: equality saturation as a differential dataflow, and incremental (the session shows folds appear and undo as nodes are fed and retracted). Retire the three overlapping batch eq-sat examples (`eqsat`, `congruence`, `cse_tree`): `arrange_idem.ddp` is the equality-saturation core plus a derived rule, so it subsumes them, and its header calls out where that core lives. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
A minimal but genuine e-graph expressed as a DDIR program and run on the server: congruence closure (the
eqsat:scope) plus one rewrite rule, arrange-idempotence —arrange(x) ≡ xwhenxis already arranged. The rule asserts equalities between structurally-different nodes and congruence propagates them to a fixpoint: equality saturation as a differential dataflow, and incremental (the session shows folds appear and undo as nodes are fed and retracted).Retire the three overlapping batch eq-sat examples (
eqsat,congruence,cse_tree):arrange_idem.ddpis the equality-saturation core plus a derived rule, so it subsumes them, and its header calls out where that core lives.