michael/lean2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
lean2/library/data
History
Jeremy Avigad 7d72c9b6b5 refactor(library/algebra/{field,ordered_field}, library/*): more renaming, setting implicit arguments 
Many theorems for division rings and fields have stronger versions for discrete fields, where we
assume x / 0 = 0. Before, we used primes to distinguish the versions, but that has the downside
that e.g. for rat and real, all the theorems are equally present. Now, I qualified the weaker ones
with division_ring.foo or field.foo. Maybe that is not ideal, but let's try it.

I also set implicit arguments with the following convention: an argument to a theorem should be
explicit unless it can be inferred from the other arguments and hypotheses.
2015-09-01 14:47:19 -07:00
..
examples refactor(library/data): rename fixed_list -> tuple 2015-08-13 16:45:34 -07:00
finset fix(library/data/finset,library/data/list): fixes #799 2015-08-15 09:49:40 -07:00
fintype refactor(library/algebra/group_power,library/*): change definition of pow 2015-08-14 18:49:57 -07:00
int refactor(library/data/int/basic): cleanup proof 2015-08-31 16:53:11 -10:00
list fix(library/data/finset,library/data/list): fixes #799 2015-08-15 09:49:40 -07:00
nat feat/refactor(library/theories/number_theory/irrational_roots,library/*): show nth roots irrational, and add lots of missing theorems 2015-08-16 23:23:23 -04:00
quotient refactor(library/logic): move logic/choice.lean to init/classical.lean 2015-08-12 18:37:33 -07:00
rat refactor(library/algebra/{field,ordered_field}, library/*): more renaming, setting implicit arguments 2015-09-01 14:47:19 -07:00
real refactor(library/algebra/{field,ordered_field}, library/*): more renaming, setting implicit arguments 2015-09-01 14:47:19 -07:00
set refactor(library/data/set/finite): make proof more robust 2015-08-31 17:26:24 -10:00
bag.lean refactor(library/logic): move logic/choice.lean to init/classical.lean 2015-08-12 18:37:33 -07: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/logic): move logic/choice.lean to init/classical.lean 2015-08-12 18:37:33 -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): show that the quotient A/R is encodable if A is encodable and R is decidable 2015-08-12 21:31:24 -07:00
equiv.lean feat(library/data): define perm as a special kind of equiv 2015-08-27 06:06:02 -10:00
fin.lean feat(library/data): define perm as a special kind of equiv 2015-08-27 06:06:02 -10:00
hf.lean refactor(library/data/hf): add local attribute to make proofs more robust 2015-08-31 17:06:54 -10: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 feat(library/data/num): show that num has decidable equality 2015-08-31 17:47:07 -10:00
option.lean refactor(library): simplify theorems using improved tactics 2015-05-25 10:43:28 -07:00
pnat.lean refactor(library/algebra/{field,ordered_field}, library/*): more renaming, setting implicit arguments 2015-09-01 14:47:19 -07: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
sum.lean refactor(library): simplify theorems using improved tactics 2015-05-25 10:43:28 -07:00
tuple.lean refactor(library/data): rename fixed_list -> tuple 2015-08-13 16:45:34 -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