bba399eefe
This ensures that no `grind` annotated theorem, simply by being instantiated, causes a chain of >20 further instantiations, with a small list of documented exceptions.
43 lines
1.4 KiB
Text
43 lines
1.4 KiB
Text
import Std
|
|
import Lean.Elab.Tactic.Grind.Lint
|
|
|
|
/-! `BitVec` exceptions -/
|
|
|
|
-- `BitVec.msb_replicate` is reasonable at 25.
|
|
#guard_msgs in
|
|
#grind_lint inspect (min := 30) BitVec.msb_replicate
|
|
|
|
-- `BitVec.msb_signExtend` is reasonable at 22.
|
|
#guard_msgs in
|
|
#grind_lint inspect (min := 25) BitVec.msb_signExtend
|
|
|
|
/-! `List` exceptions -/
|
|
|
|
-- TODO: Not sure what to do here, see https://lean-fro.zulipchat.com/#narrow/channel/503415-grind/topic/.60.23grind_lint.60.20command/near/556730710
|
|
-- #grind_lint inspect List.getLast?_concat
|
|
#grind_lint skip List.getLast?_concat
|
|
|
|
-- TODO: We should consider changing the grind annotation for `List.getElem?_eq_none`
|
|
-- so it only fires if we've already proved the hypothesis holds. (i.e. the new gadget)
|
|
-- Other than that, everything looks sane here:
|
|
-- #grind_lint inspect List.getLast?_pmap
|
|
#grind_lint skip List.getLast?_pmap
|
|
|
|
-- TODO: `List.Sublist.eq_of_length` should probably only fire when we've already proved the hypotheses.
|
|
|
|
-- `List.replicate_sublist_iff` is reasonable at 30.
|
|
#guard_msgs in
|
|
#grind_lint inspect (min := 30) List.replicate_sublist_iff
|
|
|
|
-- `List.Sublist.append` is reasonable at 25.
|
|
#guard_msgs in
|
|
#grind_lint inspect (min := 25) List.Sublist.append
|
|
|
|
-- `List.Sublist.middle` is reasonable at 25.
|
|
#guard_msgs in
|
|
#grind_lint inspect (min := 25) List.Sublist.middle
|
|
|
|
/-! Final check of everything: -/
|
|
|
|
#guard_msgs in
|
|
#grind_lint check (min := 20)
|