08eb78a5b2
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.
37 lines
766 B
Text
37 lines
766 B
Text
mutual
|
|
@[simp] def isEven : Nat → Bool
|
|
| 0 => true
|
|
| n+1 => isOdd n
|
|
decreasing_by apply Nat.lt_succ_self
|
|
|
|
@[simp] def isOdd : Nat → Bool
|
|
| 0 => false
|
|
| n+1 => isEven n
|
|
decreasing_by apply Nat.lt_succ_self
|
|
end
|
|
|
|
theorem isEven_double (x : Nat) : isEven (2 * x) = true := by
|
|
induction x with
|
|
| zero => simp
|
|
| succ x ih => simp [Nat.mul_succ, ih]
|
|
|
|
def f (x : Nat) : Nat :=
|
|
match x with
|
|
| 0 => 1
|
|
| x + 1 => f x * 2
|
|
decreasing_by apply Nat.lt_succ_self
|
|
|
|
attribute [simp] f
|
|
|
|
theorem f_succ (x : Nat) : f (x+1) = f x * 2 := by
|
|
simp
|
|
|
|
theorem f_succ₂ (x : Nat) : f (x+1) = f x * 2 := by
|
|
fail_if_success simp [-f]
|
|
simp
|
|
|
|
attribute [-simp] f
|
|
|
|
theorem f_succ₃ (x : Nat) : f (x+1) = f x * 2 := by
|
|
fail_if_success simp
|
|
simp [f]
|