lean2/tests/lean/run/eq2.lean

definition symm {A : Type} : Π {a b : A}, a = b → b = a
| a a (eq.refl a) := rfl

definition trans {A : Type} : Π {a b c : A}, a = b → b = c → a = c
| a a a (eq.refl a) (eq.refl a) := rfl
feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-26 00:20:44 +00:00			`definition symm {A : Type} : Π {a b : A}, a = b → b = a`
chore(frontends/lean,tests): fix tests and style 2016-07-09 17:29:34 +00:00			`\| a a (eq.refl a) := rfl`
test(tests/lean/run): add basic pattern matching compilation test 2015-01-03 06:22:20 +00:00
feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-26 00:20:44 +00:00			`definition trans {A : Type} : Π {a b c : A}, a = b → b = c → a = c`
chore(frontends/lean,tests): fix tests and style 2016-07-09 17:29:34 +00:00			`\| a a a (eq.refl a) (eq.refl a) := rfl`