lean2/tests/lean/run/fun.lean

import logic
open function bool


constant f : num → bool
constant g : num → num

check f ∘ g ∘ g

check (id : num → num)

constant h : num → bool → num

check swap h
check swap h ff num.zero

check (swap h ff num.zero : num)

constant f1 : num → num → bool
constant f2 : bool → num

check (f1 on f2) ff tt
fix(tests): to reflect recent changes in the standard library 2015-07-06 15:05:01 -07:00			`import logic`
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 16:36:06 -07:00			`open function bool`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00

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 f : num → bool`
			`constant g : num → num`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00
			`check f ∘ g ∘ g`

feat(frontends/lean/builtin_exprs): make notation `( e : T )` builtin In the previous approach, the following (definitionally equal) term was being generated (fun (A : Type) (a : A), a) T e 2015-06-10 14:08:46 -07:00			`check (id : num → num)`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00
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 h : num → bool → num`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00
feat(library/*): add theorems from Haitao on sets and functions, clean up 2015-06-04 18:51:34 +10:00			`check swap h`
			`check swap h ff num.zero`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00
feat(frontends/lean/builtin_exprs): make notation `( e : T )` builtin In the previous approach, the following (definitionally equal) term was being generated (fun (A : Type) (a : A), a) T e 2015-06-10 14:08:46 -07:00			`check (swap h ff num.zero : num)`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00
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 f1 : num → num → bool`
			`constant f2 : bool → num`
feat(library/standard): add function 'helper' module Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-24 16:29:39 -07:00
refactor(library/standard): use new coding style, rename bool.b0 and bool.b1 to bool.ff and bool.tt Signed-off-by: Leonardo de Moura <leonardo@microsoft.com> 2014-07-28 19:58:57 -07:00			`check (f1 on f2) ff tt`