lean2/library/data
2015-05-30 22:10:21 +10:00
..
examples refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
finset refactor(library/data/finset/basic.lean): change order of arguments to induction tactic 2015-05-25 16:50:42 -07:00
int feat(library/data/{nat,int}/div.lean): add to and improve div library 2015-05-30 22:10:21 +10:00
list feat(library/data/list/perm): cleanup proofs 2015-05-27 12:30:56 -07:00
nat refactor(library/data/nat/gcd.lean): move gcd to a new file 2015-05-30 22:10:21 +10:00
quotient refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
rat feat(library/data): fill in sorrys in int and rat orderings 2015-05-29 14:11:51 +10:00
real feat(library/data/real): prove reals form an ordered ring 2015-05-29 14:11:51 +10:00
set refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
bool.lean refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
countable.lean refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
data.md refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
default.lean refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
empty.lean refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
encodable.lean feat(library/data/{nat,int}/div.lean): add to and improve div library 2015-05-30 22:10:21 +10:00
fin.lean refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
fintype.lean fix(library/data/fintype.lean): reduce imports, to avoid cyclic dependencies 2015-05-16 17:53:35 +10:00
num.lean refactor(library): simplify theorems using improved tactics 2015-05-25 10:43:28 -07:00
option.lean refactor(library): simplify theorems using improved tactics 2015-05-25 10:43:28 -07:00
prod.lean refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
sigma.lean refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
squash.lean refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
stream.lean feat(library/tactic): improve assumption tactic performance 2015-05-25 20:22:37 -07:00
string.lean refactor(library): simplify theorems using improved tactics 2015-05-25 10:43:28 -07:00
subtype.lean refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
sum.lean refactor(library): simplify theorems using improved tactics 2015-05-25 10:43:28 -07:00
unit.lean refactor(library/*): do various renamings 2015-05-25 16:50:42 -07:00
uprod.lean refactor(library/*): remove 'Module:' lines 2015-05-23 20:52:23 +10:00
vector.lean test(library): test new tactics in the standard library 2015-05-25 16:48:33 -07:00