lean2/tests/lean/run/coercion_bug2.lean

import data.nat
open nat

inductive list (T : Type) : Type :=
nil {} : list T,
cons : T → list T → list T

definition length {T : Type} : list T → nat := list.rec 0 (fun x l m, succ m)
theorem length_nil {T : Type} : length (@list.nil T) = 0
:= eq.refl _
fix(tests/lean): adjust tests to new library structure Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-08-01 16:37:23 +00:00			`import data.nat`
feat(frontends/lean): rename 'using' command to 'open' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-03 23:00:38 +00:00			`open nat`
fix(library/unifier): add a flag to sign that a choice constraint owns a metavariable ?m, that is, it has the right to assign ?m, and the unifier should postpone any other constraint that tries to assign ?m Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-30 00:32:55 +00:00
			`inductive list (T : Type) : Type :=`
feat(*): change inductive datatype syntax Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-08-22 22:46:10 +00:00			`nil {} : list T,`
			`cons : T → list T → list T`
fix(library/unifier): add a flag to sign that a choice constraint owns a metavariable ?m, that is, it has the right to assign ?m, and the unifier should postpone any other constraint that tries to assign ?m Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-30 00:32:55 +00:00
refactor(kernel/inductive): replace recursor name, use '.rec' instead of '_rec' Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-04 22:03:59 +00:00			`definition length {T : Type} : list T → nat := list.rec 0 (fun x l m, succ m)`
feat(frontends/lean/inductive_cmd): prefix introduction rules with the name of the inductive datatype Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-09-04 23:36:06 +00:00			`theorem length_nil {T : Type} : length (@list.nil T) = 0`
			`:= eq.refl _`