| .. |
|
examples
|
refactor(library/*): remove 'Module:' lines
|
2015-05-23 20:52:23 +10:00 |
|
finset
|
feat(library): add helper lemmas for equivalent types
|
2015-07-06 12:17:57 -07:00 |
|
fintype
|
feat(library): add helper lemmas for equivalent types
|
2015-07-06 12:17:57 -07:00 |
|
int
|
feat(frontends/lean): rename '[unfold-c]' to '[unfold]' and '[unfold-f]' to '[unfold-full]'
|
2015-07-07 16:37:06 -07:00 |
|
list
|
feat(library): add helper lemmas for equivalent types
|
2015-07-06 12:17:57 -07:00 |
|
nat
|
doc(library/data/nat/examples): add tail recursive fib example
|
2015-07-10 20:38:07 -04:00 |
|
quotient
|
refactor(library/data/quotient): make proofs more robust
|
2015-06-25 17:48:58 -07:00 |
|
rat
|
feat(library/data/rat/order): use 'trans-instance' to improve performance of migrate command
|
2015-07-01 08:57:10 -07:00 |
|
real
|
feat(library/tactic/rewrite_tactic): try to fold nested recursive applications after unfolding a recursive function
|
2015-07-08 21:19:18 -04:00 |
|
set
|
refactor(library/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
bool.lean
|
feat(library/data/nat): add basic facts about parity
|
2015-07-03 17:38:23 -07:00 |
|
countable.lean
|
refactor(library/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
data.md
|
chore(library/data): update data.md
|
2015-06-25 17:30:12 -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): add helper lemmas for equivalent types
|
2015-07-06 12:17:57 -07:00 |
|
equiv.lean
|
feat(library/data): add type equivalence lemmas for subtype and vector
|
2015-07-06 12:44:51 -07:00 |
|
fin.lean
|
feat(library/data/fin): add proof of finite choice
|
2015-07-04 09:58:18 -07: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 |
|
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
|
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/rewrite_tactic): try to fold nested recursive applications after unfolding a recursive function
|
2015-07-08 21:19:18 -04:00 |
|
string.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
subtype.lean
|
feat(library/data/subtype): cleanup proof
|
2015-06-02 19:51:28 -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/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
vec.lean
|
refactor(library/algebra/function): move function.lean to init folder
|
2015-07-06 07:29:56 -07:00 |
|
vector.lean
|
feat(library/data): add type equivalence lemmas for subtype and vector
|
2015-07-06 12:44:51 -07:00 |
