| .. |
|
examples
|
feat(library/tactic): use occurrence object in unfold tactic family
|
2015-07-11 18:53:45 -04:00 |
|
basic.lean
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
bigops.lean
|
feat(library/data/finset/bigops.lean): add Union for finsets
|
2015-05-17 17:50:32 +10:00 |
|
bquant.lean
|
feat(frontends/lean): use 'this' as the name for anonymous 'have'-expression
|
2015-07-18 13:36:05 -05:00 |
|
default.lean
|
fix(library/data): 'choose' -> 'find' renaming problems
|
2015-07-25 11:25:04 -07:00 |
|
div.lean
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
fact.lean
|
feat(library/theories/combinatorics/choose): begin theory of binomial coefficients
|
2015-07-11 19:01:43 -04:00 |
|
find.lean
|
refactor(library/data/nat/find): rename 'choose' to 'find' to avoid conflict with combinatorics 'choose'
|
2015-07-25 14:02:44 -04:00 |
|
gcd.lean
|
feat(library): clean up "sorry"s in library
|
2015-07-24 12:21:33 -04:00 |
|
nat.md
|
refactor(library/data/nat/gcd.lean): move gcd to a new file
|
2015-05-30 22:10:21 +10:00 |
|
order.lean
|
feat(library/data/bag): add basic properties for bag intersection and union
|
2015-07-25 08:37:30 -07:00 |
|
pairing.lean
|
refactor(library/data/nat): cleanup for the tutorial
|
2015-07-22 13:41:50 -07:00 |
|
parity.lean
|
refactor(library/data/nat): cleanup for the tutorial
|
2015-07-22 13:41:50 -07:00 |
|
power.lean
|
refactor(library/data/nat): cleanup for the tutorial
|
2015-07-22 13:41:50 -07:00 |
|
sqrt.lean
|
feat(nat): redefine le and lt in the standard library
|
2015-06-04 20:14:13 -04:00 |
|
sub.lean
|
feat(library/data/fin): add equivalences between fin types
|
2015-07-26 15:42:39 -07:00 |
