This PR refactors the main loop of the `cbv` tactic. Rather than using multiple simprocs, a central pre simproc is introduced. Moreover, let expressions are no longer immediately zeta-reduced due to performance on one of the benchmarks (`leroy.lean`). Stacked on top of #12416 |
||
|---|---|---|
| .. | ||
| dedup.lean | ||
| divisors.lean | ||
| leroy.lean | ||