| Fri, 04 Dec 2009 12:20:49 +0100 |
Cezary Kaliszyk |
rep_abs_rsp_tac to replace the last use of instantiate_tac with matching and unification.
|
changeset |
files
|
| Fri, 04 Dec 2009 11:34:49 +0100 |
Christian Urban |
merged
|
changeset |
files
|
| Fri, 04 Dec 2009 11:34:21 +0100 |
Christian Urban |
merged
|
changeset |
files
|
| Fri, 04 Dec 2009 11:33:58 +0100 |
Cezary Kaliszyk |
Change equiv_trans2 to EQUALS_RSP, since we can prove it for any quotient type, not only for eqv relations.
|
changeset |
files
|
| Fri, 04 Dec 2009 11:06:43 +0100 |
Cezary Kaliszyk |
compose_tac instead of rtac to avoid unification; some code cleaning.
|
changeset |
files
|
| Fri, 04 Dec 2009 10:36:35 +0100 |
Cezary Kaliszyk |
Got to about 5 seconds for the longest proof. APPLY_RSP_TAC' solves the quotient internally without instantiation resulting in a faster proof.
|
changeset |
files
|
| Fri, 04 Dec 2009 10:12:17 +0100 |
Cezary Kaliszyk |
Using APPLY_RSP1; again a little bit faster.
|
changeset |
files
|
| Fri, 04 Dec 2009 09:33:32 +0100 |
Cezary Kaliszyk |
Fixes after big merge.
|
changeset |
files
|
| Fri, 04 Dec 2009 09:25:27 +0100 |
Cezary Kaliszyk |
The big merge; probably non-functional.
|
changeset |
files
|
| Fri, 04 Dec 2009 09:08:51 +0100 |
Cezary Kaliszyk |
Testing the new tactic everywhere
|
changeset |
files
|
| Fri, 04 Dec 2009 09:01:13 +0100 |
Cezary Kaliszyk |
First version of the deterministic rep-abs-inj-tac.
|
changeset |
files
|
| Fri, 04 Dec 2009 09:18:46 +0100 |
Cezary Kaliszyk |
Changing = to \<equiv> in case if we want to use simp.
|
changeset |
files
|
| Fri, 04 Dec 2009 09:10:31 +0100 |
Cezary Kaliszyk |
Even better: Completely got rid of the simps in both quotient_tac and inj_repabs_tac
|
changeset |
files
|
| Fri, 04 Dec 2009 08:19:56 +0100 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| Fri, 04 Dec 2009 08:18:38 +0100 |
Cezary Kaliszyk |
Made your version work again with LIST_REL_EQ.
|
changeset |
files
|