Leonardo de Moura
|
03eda2ecc0
|
feat(library/init/meta/interactive): add cases_matching p tactic
|
2017-12-05 18:17:44 -08:00 |
|
Leonardo de Moura
|
a2f55e5d7b
|
feat(library/tactic/induction_tactic): new name generator for induction and cases tactics
|
2017-12-05 14:57:36 -08:00 |
|
Leonardo de Moura
|
0c5ecf6441
|
feat(library/init/meta/interactive): add iterate n { t }
|
2017-12-05 12:52:18 -08:00 |
|
Leonardo de Moura
|
52d939b885
|
chore(library/data/rbtree): use cases h : t to avoid generalize
|
2017-12-05 12:32:51 -08:00 |
|
Leonardo de Moura
|
db46f01315
|
chore(library/init): replace iterate applications with repeat when appropriate
|
2017-12-04 13:04:46 -08:00 |
|
Leonardo de Moura
|
75aa94b34c
|
refactor(library): rename repeat ==> iterate
Reason: we will implement a new `repeat` tactic.
|
2017-12-04 12:34:59 -08:00 |
|
Leonardo de Moura
|
b7322e28c1
|
feat(library): do not using simp lemmas for sorting arguments of AC operators by default
|
2017-12-03 15:03:58 -08:00 |
|
Leonardo de Moura
|
b95b260706
|
fix(library/data/rbtree): insert
|
2017-11-22 07:52:18 -08:00 |
|
Leonardo de Moura
|
96f8ecbdcb
|
feat(library/data/rbmap): add find_insert lemmas for rbmap
|
2017-11-21 14:29:04 -08:00 |
|
Leonardo de Moura
|
f8fb92e431
|
feat(library/data/rbtree/insert): finish find_insert_of_not_eqv lemmas
|
2017-11-21 13:16:19 -08:00 |
|
Leonardo de Moura
|
b3e429a1b8
|
chore(library/data/rbtree/insert): reduce proofs size
|
2017-11-21 10:37:10 -08:00 |
|
Leonardo de Moura
|
ae0f5642d3
|
feat(library/data/rbtree): find_insert_of_not_eqv lemmas
Remark: the balance2 case (dual of balance1) is still missing.
|
2017-11-20 21:27:19 -08:00 |
|
Leonardo de Moura
|
319faca00a
|
feat(library/data/rbtree): add mem_exact predicate and find_insert lemmas
|
2017-11-20 11:52:36 -08:00 |
|
Leonardo de Moura
|
8ffff9e48b
|
feat(library/data/rbtree): cleanup and add min max
|
2017-11-18 12:22:10 -08:00 |
|