Leonardo de Moura a618bd7d6c refactor(library): use type classes for encoding all arithmetic operations ... Before this commit we were using overloading for concrete structures and type classes for abstract ones. This is the first of series of commits that implement this modification		2015-11-08 14:04:54 -08:00
..
as_type.lean	refactor(library/*): remove 'Module:' lines	2015-05-23 20:52:23 +10:00
basic.lean	refactor(library): use type classes for encoding all arithmetic operations	2015-11-08 14:04:54 -08:00
comb.lean	fix(library/data/finset,library/data/list): fixes #799	2015-08-15 09:49:40 -07:00
default.lean	refactor,feat(library/{data,algebra}): move bigops to algebra, define sums	2015-05-16 18:42:13 +10:00
list.md	refactor,feat(library/{data,algebra}): move bigops to algebra, define sums	2015-05-16 18:42:13 +10:00
perm.lean	feat(library/data/encodable): show that (finset A) is encodable when A is encodable	2015-08-10 07:47:00 -07:00
set.lean	refactor(library/data): use "suppose"-expressions to cleanup proofs	2015-07-20 19:45:54 -07:00
sort.lean	feat(library/data/list): show that (sort R l1 = sort R l2) when R is a decidable total order and l1 is a permutation of l2	2015-08-09 23:36:08 -07:00
sorted.lean	feat(library/data/list): show that (sort R l1 = sort R l2) when R is a decidable total order and l1 is a permutation of l2	2015-08-09 23:36:08 -07:00