lean2/tests/lean/run/t6.lean

prelude
precedence `+`  : 65
precedence `++` : 100
constant N : Type.{1}
constant f : N → N → N
constant a : N
check
   let g x y         := f x y,
       infix +       := g,
       b : N         := a+a,
       c             := b+a,
       h (x : N)     := x+x,
       postfix ++    := h,
       d             := c++,
       r (x : N) : N := x++++
   in  f b (r c)
fix(tests/lean): adjust tests to modifications to standard library 2014-11-30 21:16:01 -08:00			`prelude`
feat(frontends/lean/builtin_exprs): add parser for 'let' expressions Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-16 09:50:34 -07:00			precedence `+` : 65
			precedence `++` : 100
refactor(frontends/lean): constant/axiom are top-level commands, parameter/variable/hypothesis/conjecture are section/context-level commands Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-10-02 16:20:52 -07:00			`constant N : Type.{1}`
			`constant f : N → N → N`
			`constant a : N`
feat(frontends/lean): add let-expr pretty printer, reduce default indentation to 2 Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-09 18:47:10 -07:00			`check`
feat(frontends/lean/builtin_exprs): add parser for 'let' expressions Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-06-16 09:50:34 -07:00			`let g x y := f x y,`
			`infix + := g,`
			`b : N := a+a,`
			`c := b+a,`
			`h (x : N) := x+x,`
			`postfix ++ := h,`
			`d := c++,`
			`r (x : N) : N := x++++`
			`in f b (r c)`