Commit 2023-12-24 15:08 86393c89

View on Github →

refactor: Use Pairwise wherever possible (#9236) Performed with a regex search for ∀ (.) (.), \1 ≠ \2 →, and a few variants to catch implicit binders and explicit types. I have deliberately avoided trying to make the analogous Set.Pairwise transformation (or any Pairwise (foo on bar) transformations) in this PR, to keep the diff small.

Estimated changes