Leonardo de Moura
|
84deddcca9
|
feat(library/tactic/rewrite_tactic): apply 'reflexivity' tactic after 'rewrite' instead of hard coded solution
|
2015-05-05 20:23:49 -07:00 |
|
Leonardo de Moura
|
e8affed020
|
refactor(library): test new tactics in the standard library
|
2015-05-01 18:18:29 -07:00 |
|
Leonardo de Moura
|
9ba8b284a1
|
fix(library/tactic/apply_tactic): add eapply, and fix issue #361
|
2015-05-01 15:08:00 -07:00 |
|
Leonardo de Moura
|
9760968b45
|
refactor(library,hott): use/test new 'contradiction' tactic in the standard and hott libraries
|
2015-04-30 13:56:12 -07:00 |
|
Leonardo de Moura
|
3912bc24c8
|
feat(frontends/lean): nicer syntax for 'intros' 'reverts' and 'clears'
|
2015-04-30 11:00:39 -07:00 |
|
Leonardo de Moura
|
072bf0b3b4
|
refactor(library): make sure "choose" compute inside the kernel
|
2015-04-25 23:10:48 -07:00 |
|
Leonardo de Moura
|
d455bb4c5b
|
feat(library/data/fintype): add decidable_exists_finite
|
2015-04-25 21:38:03 -07:00 |
|
Leonardo de Moura
|
07e195e9f1
|
feat(library/data/fintype): add decidable_finite_pred instance
|
2015-04-12 20:07:04 -07:00 |
|
Leonardo de Moura
|
00d68cadc8
|
refactor(library/data/fintype): cleanup and mark location that exposes bug in the 'cases' tactic
|
2015-04-12 17:52:41 -07:00 |
|
Leonardo de Moura
|
f523d3a995
|
feat(library/data): add structure for converting a list of elements into a type, and then show the resultant type is a finite type
|
2015-04-12 17:33:58 -07:00 |
|
Leonardo de Moura
|
c437fbe0bc
|
feat(library/data/fintype): prove that A->B has decidable equality when A is a finite type and B has decidable equality
|
2015-04-11 16:45:27 -07:00 |
|
Leonardo de Moura
|
dfef4c5daf
|
feat(library/data): define fintype type class
|
2015-04-11 14:55:41 -07:00 |
|