Leonardo de Moura 52ec7e6d57 feat(library/blast/recursor): add 'blast.recursor.max_rounds' options and iterative deepening for recursor_strategy		2016-01-01 13:09:37 -08:00
..
as_type.lean	refactor(library/*): remove 'Module:' lines	2015-05-23 20:52:23 +10:00
basic.lean	feat(library/blast/recursor): add 'blast.recursor.max_rounds' options and iterative deepening for recursor_strategy	2016-01-01 13:09:37 -08:00
comb.lean	fix(library/init/function): fix typo	2015-12-22 16:39:13 -05: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	refactor(library/blast/simplifier): use priority_queue to store simp/congr lemmas, use name convention used at forward/backward lemmas, normalize lemmas when blast starts, cache get_simp_lemmas	2015-12-28 17:52:57 -08:00
set.lean	refactor(library): use anonymous instance implicit arguments	2015-12-13 11:46:48 -08:00
sort.lean	refactor(library): use anonymous instance implicit arguments	2015-12-13 11:46:48 -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