Joachim Breitner df9ca20339 perf: create unfolding theorem for wf-rec in one go (#9646) ... This PR uses a more simple approach to proving the unfolding theorem for a function defined by well-founded recursion. Instead of looping a bunch of tactics, it uses simp in single-pass mode to (try to) exactly undo the changes done in `WF.Fix`, using a dedicated theorem that pushes the extra argument in for each matcher (or `casesOn`). Improves performance for recursive functions with large `match` statements, as in #9598.		2025-08-02 15:26:02 +00:00
..
bench	chore: large match statement benchmark (#9665)	2025-08-01 15:25:07 +00:00
compiler
elabissues
ir
lean	perf: create unfolding theorem for wf-rec in one go (#9646)	2025-08-02 15:26:02 +00:00
pkg	refactor: update built-in tactic error messages (#9633)	2025-07-31 14:16:57 +00:00
playground
plugin
simpperf
.gitignore
common.sh
lakefile.toml
lean-toolchain