| .. |
|
examples
|
refactor(library/data): move vector as indexed family to examples folder
|
2015-08-12 15:05:14 -07:00 |
|
finset
|
feat(library/data/finset/equiv): show that (finset nat) is isomorphic to nat
|
2015-08-11 15:54:14 -07:00 |
|
fintype
|
feat(frontends/lean): allow anonymous 'have'-expressions in tactic mode
|
2015-07-23 18:52:59 -07:00 |
|
int
|
feat(library/data/{int,rat,real}/bigops): add bigops for int, rat, real
|
2015-08-08 17:20:23 -04:00 |
|
list
|
feat(library/data/list/comb): show that (list A) is isomorphic to A if A is isomorphic to nat
|
2015-08-10 16:04:02 -07:00 |
|
nat
|
feat(library/data/finset/equiv): show that (finset nat) is isomorphic to nat
|
2015-08-11 15:54:14 -07:00 |
|
quotient
|
refactor(library/logic/axioms): we have only one extra axiom
|
2015-07-29 13:36:23 -07:00 |
|
rat
|
feat(library/data/{int,rat,real}/bigops): add bigops for int, rat, real
|
2015-08-08 17:20:23 -04:00 |
|
real
|
feat(library/data/{int,rat,real}/bigops): add bigops for int, rat, real
|
2015-08-08 17:20:23 -04:00 |
|
set
|
refactor(library/algebra/complete_lattice): add alternative definitions of complete_lattice and convertions between them
|
2015-08-09 20:40:07 -07:00 |
|
bag.lean
|
refactor(library/algebra/{lattice,order},library/data/nat): split lattice from order, make nat an instance of discrete linear order
|
2015-08-03 22:41:56 -04:00 |
|
bool.lean
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -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/data): move vector as indexed family to examples folder
|
2015-08-12 15:05:14 -07:00 |
|
empty.lean
|
feaf(library): make sure basic standard library can be compiled with option "--to_axiom"
|
2015-07-29 16:11:23 -07:00 |
|
encodable.lean
|
feat(library/data/encodable): add encodable subtypes
|
2015-08-10 09:54:48 -07:00 |
|
equiv.lean
|
feaf(library): make sure basic standard library can be compiled with option "--to_axiom"
|
2015-07-29 16:11:23 -07:00 |
|
fin.lean
|
feat(library/data/fin): add foldl and foldr
|
2015-08-01 18:17:08 +01:00 |
|
fixed_list.lean
|
refactor(library/data): rename vec to fixed_list
|
2015-08-12 14:38:21 -07:00 |
|
hf.lean
|
feat(library/data/hf): define Hereditarily finite sets
|
2015-08-11 16:56:06 -07:00 |
|
hlist.lean
|
feat(frontends/lean): allow anonymous 'have'-expressions in tactic mode
|
2015-07-23 18:52:59 -07:00 |
|
matrix.lean
|
feat(library/data/matrix): add basic matrix module
|
2015-08-01 19:33:31 +01:00 |
|
num.lean
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
option.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
pnat.lean
|
refactor(library/data/nat/sub,*): get rid of diff, tidy some max and min theorems
|
2015-08-03 22:41:56 -04:00 |
|
prod.lean
|
refactor(library): use new 'suppose'-expression
|
2015-07-19 21:15:20 -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
|
refactor(library/data): cleanup proofs using new features
|
2015-07-21 09:57:10 -07:00 |
|
string.lean
|
refactor(library): simplify theorems using improved tactics
|
2015-05-25 10:43:28 -07:00 |
|
subtype.lean
|
fix(frontends/lean/pp): pretty printing 'binder'
|
2015-07-31 11:27:38 -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 |
