lean4-htt

Author SHA1 Message Date

Author	SHA1	Message	Date
Garmelon	08eb78a5b2	chore: switch to new test/bench suite (#12590 ) This PR sets up the new integrated test/bench suite. It then migrates all benchmarks and some related tests to the new suite. There's also some documentation and some linting. For now, a lot of the old tests are left alone so this PR doesn't become even larger than it already is. Eventually, all tests should be migrated to the new suite though so there isn't a confusing mix of two systems.	2026-02-25 13:51:53 +00:00
Leonardo de Moura	6683d1eb91	chore: add `module` keyword to `grind` tests (#10036 ) This PR also fixes missing `@[expose]` in grind support definitions.	2025-08-21 22:02:08 +00:00
Leonardo de Moura	f8c743e37d	feat: consider all singleton patterns in local forall expressions in `grind` (#9896 ) This PR improves the heuristic used to select patterns for local `forall` expressions occurring in the goal being solved by `grind`. It now considers all singleton patterns in addition to the selected multi-patterns. Example: ```lean example (p : Nat → Prop) (h₁ : x < n) (h₂ : ¬ p x) : ∃ i, i < n ∧ ¬ p i := by grind ```	2025-08-13 18:45:29 +00:00

Garmelon

08eb78a5b2

chore: switch to new test/bench suite (#12590 )

This PR sets up the new integrated test/bench suite. It then migrates
all benchmarks and some related tests to the new suite. There's also
some documentation and some linting.

For now, a lot of the old tests are left alone so this PR doesn't become
even larger than it already is. Eventually, all tests should be migrated
to the new suite though so there isn't a confusing mix of two systems.

2026-02-25 13:51:53 +00:00

Leonardo de Moura

6683d1eb91

chore: add module keyword to grind tests (#10036 )

This PR also fixes missing `@[expose]` in grind support definitions.

2025-08-21 22:02:08 +00:00

Leonardo de Moura

f8c743e37d

feat: consider all singleton patterns in local forall expressions in grind (#9896 )

This PR improves the heuristic used to select patterns for local
`forall` expressions occurring in the goal being solved by `grind`. It
now considers all singleton patterns in addition to the selected
multi-patterns. Example:
```lean
example (p : Nat → Prop) (h₁ : x < n) (h₂ : ¬ p x) : ∃ i, i < n ∧ ¬ p i := by
  grind
```

2025-08-13 18:45:29 +00:00

3 commits