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.
27 lines
689 B
Text
27 lines
689 B
Text
def f : (xs : List Nat) → Nat → xs ≠ [] → Nat
|
||
| [], _, _ => _
|
||
| [a,b], _, _ => _
|
||
| _, _, _ => _
|
||
|
||
set_option pp.inaccessibleNames true in
|
||
def f' : (xs : List Nat) → Nat → xs ≠ [] → Nat
|
||
| [], _, _ => _ -- TODO: figure out why hyp `Ne (α := List Nat) x✝² []` needs α
|
||
| [a,b], _, _ => _
|
||
| _, _, _ => _
|
||
|
||
theorem ex1 : p ∨ q → q ∨ p := by
|
||
intro h
|
||
cases h
|
||
trace_state
|
||
apply Or.inr
|
||
assumption
|
||
apply Or.inl
|
||
assumption
|
||
done
|
||
|
||
theorem ex2 : {p : Prop} → [Decidable p] → p → decide p = true
|
||
| _, isTrue _, _ => _
|
||
| _, isFalse h₁, h₂ => absurd h₂ h₁
|
||
|
||
theorem ex3 : ∀ {c d : Char}, c = d → c.val = d.val
|
||
| _, _, rfl => _
|