lean2/library/data
2015-03-04 18:48:13 -08:00
..
int chore(library/data): remove unnecessary parentheses 2015-03-01 14:18:36 -08:00
list feat(library/data/list/basic): list A has decidable equality if A has 2015-03-04 18:48:13 -08:00
nat chore(library/data): remove unnecessary parentheses 2015-03-01 14:18:36 -08:00
quotient feat(frontends/lean): add 'assert H : A, ...' as notation for 'have H [visible] : A, ...' 2015-02-25 14:30:42 -08:00
bool.lean feat(library/data/bool): add auxiliary theorems 2015-03-04 18:30:31 -08:00
data.md refactor(library/data): remove folders with a single file 2014-12-23 21:14:35 -05:00
default.lean refactor(library): remove unnecessary 'standard' subdirectory 2014-08-23 18:08:09 -07:00
empty.lean feat(frontends/lean): new semantics for "protected" declarations 2015-02-11 14:09:25 -08:00
fin.lean feat(frontends/lean/inductive_cmd): allow '|' in inductive datatype declarations 2015-02-25 17:00:10 -08:00
num.lean feat(library/data/num): prove many theorems for pos_num.lt and pos_num.le 2015-03-04 18:30:31 -08:00
option.lean refactor(library): use [] binder annotation when declaring instances 2015-02-24 16:12:39 -08:00
prod.lean refactor(library): use [] binder annotation when declaring instances 2015-02-24 16:12:39 -08:00
set.lean feat(library/data/set): use Prop instead of bool when defining set 2015-03-01 08:23:39 -08:00
sigma.lean refactor(library): use [] binder annotation when declaring instances 2015-02-24 16:12:39 -08:00
string.lean refactor(library/data/string): put is_inhabited theorems on the toplevel 2015-01-10 14:07:20 -08:00
subtype.lean feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-25 16:20:44 -08:00
sum.lean feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-25 16:20:44 -08:00
unit.lean feat(frontends/lean): new semantics for "protected" declarations 2015-02-11 14:09:25 -08:00
vector.lean feat(frontends/lean/inductive_cmd): allow '|' in inductive datatype declarations 2015-02-25 17:00:10 -08:00