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.
24 lines
869 B
Text
24 lines
869 B
Text
prelude
|
||
import Init.MetaTypes
|
||
import Init.Data.List.Lemmas
|
||
|
||
attribute [-simp] List.map_map -- Turn off the global simp lemma so we can turn on and off the local version.
|
||
|
||
@[simp] theorem map_comp_map (f : α → β) (g : β → γ) : List.map g ∘ List.map f = List.map (g ∘ f) :=
|
||
sorry
|
||
|
||
theorem map_map (f : α → β) (g : β → γ) (xs : List α) : (xs.map f |>.map g) = xs.map (g ∘ f) :=
|
||
sorry
|
||
|
||
theorem ex1 (f : Nat → Nat) (xs : List Nat) : (xs.map f |>.map f) = xs.map (f ∘ f) := by
|
||
fail_if_success simp
|
||
simp [map_map]
|
||
done
|
||
|
||
theorem ex2 (f : Nat → Nat) : List.map f ∘ List.map f ∘ List.map f = List.map (f ∘ f ∘ f) := by
|
||
simp
|
||
|
||
attribute [simp] map_map
|
||
|
||
theorem ex3 (f : Nat → Nat) (xs : List Nat) : (xs.map f |>.map f |>.map f) = xs.map (fun x => f (f (f x))) := by
|
||
simp (config := { unfoldPartialApp := true }) [Function.comp]
|