Leonardo de Moura 9bedbbb739 refactor(library,hott): remove coercions between algebraic structures ... They are classes, and mixing coercion with type class resolution is a recipe for disaster (aka counterintuitive behavior).		2015-11-11 11:57:44 -08:00
..
as_type.lean	refactor(library/*): remove 'Module:' lines	2015-05-23 20:52:23 +10:00
basic.lean	fix(library): remove "-[notations]" hack at "open -[notations] algebra"	2015-11-08 14:04:55 -08:00
comb.lean	refactor(library/data/nat/basic): mark some theorems as protected to avoid overloading	2015-11-08 14:04:56 -08: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/init/nat,library/data/nat/*): chagne dots to underscores in protected names	2015-11-08 14:04:59 -08:00
sort.lean	refactor(library,hott): remove coercions between algebraic structures	2015-11-11 11:57:44 -08: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