Leonardo de Moura b5444c1314 refactor(frontends/lean/builtin_cmds): allow "constant" edges in the instance transitive closure graph		2015-06-29 18:57:05 -07:00
..
examples
finset	refactor(library/data/finset/card.lean): add useful facts, shorter proof of eq_card_of_eq_subset	2015-06-20 21:13:00 -07:00
fintype	fix(library/data/fintype/function): make inj_of_nodup and nodup_of_inj more general	2015-06-16 19:17:53 -07:00
int	refactor(library/data/int/basic): put int.of_nat coercion in int namespace	2015-06-29 21:00:42 +10:00
list	feat(hott): various cleanup and fixes, rename \~ to ~, expand types.pointed	2015-06-25 22:31:40 -04:00
nat	feat(library/data/nat/order): add theorems for max and min	2015-06-29 15:23:11 +10:00
quotient	refactor(library/data/quotient): make proofs more robust	2015-06-25 17:48:58 -07:00
rat	fix(library/data/int/basic): change notation from -[n+1] to -[1+n] to avoid conflict e.g. with -[coercions]	2015-06-29 15:23:11 +10:00
real	refactor(frontends/lean/builtin_cmds): allow "constant" edges in the instance transitive closure graph	2015-06-29 18:57:05 -07:00
set	feat(library/data/set): show that (set A) is a comm_semiring	2015-06-17 09:53:50 -07:00
bool.lean
countable.lean
data.md	chore(library/data): update data.md	2015-06-25 17:30:12 -07:00
default.lean
empty.lean
encodable.lean
fin.lean	refactor(library/data/fin): put fin.val coercion in fin namespace	2015-06-29 21:24:38 +10:00
num.lean
option.lean
pnat.lean	feat(library/algebra/order,library/data/nat/order,library/*): instantiate nat to lattice, add theorems	2015-06-29 15:23:11 +10:00
prod.lean
sigma.lean
squash.lean
stream.lean
string.lean
subtype.lean
sum.lean
unit.lean
uprod.lean
vec.lean	refactor(library,hott,tests): rename succ_inj to succ.inj, add abbreviation eq_of_succ_eq_succ	2015-06-15 22:52:38 +10:00
vector.lean	fix(library/init/logic): make sure library can be compiled using '--to_axiom' option	2015-06-16 13:10:08 -07:00