lean2/library/data
2015-03-30 04:55:28 -07:00
..
int refactor(library/data/int/order): cleanup 2015-03-28 12:58:40 -07:00
list feat(library/data/list/basic): add sublist predicate 2015-03-30 03:20:42 -07:00
nat feat(frontends/lean): uniform notation for lists in tactics 2015-03-27 17:54:48 -07: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 for bool 2015-03-30 04:55:28 -07: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 refactor(library/data/fin): cleanup pattern matching equations 2015-03-05 14:42:42 -08:00
num.lean feat(frontends/lean): uniform notation for lists in tactics 2015-03-27 17:54:48 -07: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): uniform notation for lists in tactics 2015-03-27 17:54:48 -07:00