lean2/tests/lean/run/eq25.lean

inductive N :=
O : N,
S : N → N

definition Nat := N

open N

definition add : Nat → Nat → Nat
| add O     b := b
| add (S a) b := S (add a b)
fix(library/definitional/equations): use whnf on recursive definition arguments The idea is to expose "hidden" datatypes. 2015-02-24 05:33:52 +00:00			`inductive N :=`
			`O : N,`
			`S : N → N`

			`definition Nat := N`

			`open N`

feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-26 00:20:44 +00:00			`definition add : Nat → Nat → Nat`
			`\| add O b := b`
			`\| add (S a) b := S (add a b)`