Leonardo de Moura c4e5f57512 feat: proof terms for grind ac (#10189) ... This PR implements the proof terms for the new `grind ac` module. Examples: ```lean example {α : Sort u} (op : α → α → α) [Std.Associative op] (a b c d : α) : op a (op b b) = op c d → op c (op d c) = op (op a b) (op b c) := by grind only example {α : Sort u} (op : α → α → α) [Std.Associative op] [Std.Commutative op] (a b c d : α) : op a (op b b) = op d c → op (op b a) (op b c) = op c (op d c) := by grind only example {α : Sort u} (op : α → α → α) [Std.Associative op] [Std.Commutative op] (one : α) [Std.LawfulIdentity op one] (a b c d : α) : op a (op (op b one) b) = op d c → op (op b a) (op (op b one) c) = op (op c one) (op d c) := by grind only ``` The `grind ac` module is not complete yet, we still need to implement critical pair computation and fix the support for idempotent operators.		2025-08-31 04:10:10 +00:00
..
bench	chore: fix stdlib size benchmarks	2025-08-28 12:07:27 +02:00
compiler	fix: Unicode path support for Lean Windows executables (#10133)	2025-08-27 11:28:55 +00:00
elabissues
ir
lean	feat: proof terms for grind ac (#10189)	2025-08-31 04:10:10 +00:00
pkg	chore: improve error message on trying to access an identifier imported privately from the public scope (#10153)	2025-08-27 13:43:56 +00:00
playground	chore: eliminate uses of intros x y z (#9983)	2025-08-19 06:09:13 +00:00
plugin
simpperf
.gitignore
common.sh
lakefile.toml
lean-toolchain