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.
39 lines
970 B
Text
39 lines
970 B
Text
theorem f1 (a : α) (f : α → β) : f a = f a := by
|
||
rfl
|
||
|
||
/--
|
||
info: theorem f1.{u_1, u_2} : ∀ {α : Sort u_1} {β : Sort u_2} (a : α) (f : α → β), f a = f a :=
|
||
fun {α} {β} a f => Eq.refl (f a)
|
||
-/
|
||
#guard_msgs in
|
||
#print f1
|
||
|
||
theorem f2 {α : Sort u} {β : Sort v} (a : α) (f : α → β) : f a = f a := by
|
||
rfl
|
||
|
||
/--
|
||
info: theorem f2.{u, v} : ∀ {α : Sort u} {β : Sort v} (a : α) (f : α → β), f a = f a :=
|
||
fun {α} {β} a f => Eq.refl (f a)
|
||
-/
|
||
#guard_msgs in
|
||
#print f2
|
||
|
||
theorem f3.{u,v} {α : Sort u} {β : Sort v} (a : α) (f : α → β) : f a = f a := by
|
||
rfl
|
||
|
||
/--
|
||
info: theorem f3.{u, v} : ∀ {α : Sort u} {β : Sort v} (a : α) (f : α → β), f a = f a :=
|
||
fun {α} {β} a f => Eq.refl (f a)
|
||
-/
|
||
#guard_msgs in
|
||
#print f3
|
||
|
||
def g (a : α) (f : α → β) : f a = f a := by
|
||
rfl
|
||
|
||
/--
|
||
info: def g.{u_1, u_2} : ∀ {α : Sort u_1} {β : Sort u_2} (a : α) (f : α → β), f a = f a :=
|
||
fun {α} {β} a f => Eq.refl (f a)
|
||
-/
|
||
#guard_msgs in
|
||
#print g
|