12 lines
297 B
Text
12 lines
297 B
Text
inductive tree (α : Type)
|
||
| leaf : tree
|
||
| node (left : tree) (val : α) (right : tree) : tree
|
||
|
||
constant foo {α : Type} : tree α → tree α
|
||
|
||
example {α : Type} (a b : tree α) : foo a = a :=
|
||
begin
|
||
with_cases { induction a },
|
||
{ admit },
|
||
case : l v r ih_l ih_r { trace_state, admit },
|
||
end
|