Fri, 04 Dec 2009 15:41:09 +0100 |
Cezary Kaliszyk |
More code cleaning and name changes
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 15:18:33 +0100 |
Cezary Kaliszyk |
More name changes
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 14:35:36 +0100 |
Cezary Kaliszyk |
code cleaning and renaming
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 14:11:20 +0100 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 14:11:03 +0100 |
Cezary Kaliszyk |
Removed previous inj_repabs_tac
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 13:58:23 +0100 |
Christian Urban |
some tuning
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 12:21:15 +0100 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
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.
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 11:34:49 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 11:34:21 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
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.
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 11:06:43 +0100 |
Cezary Kaliszyk |
compose_tac instead of rtac to avoid unification; some code cleaning.
|
file |
diff |
annotate
|
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.
|
file |
diff |
annotate
|
Fri, 04 Dec 2009 10:12:17 +0100 |
Cezary Kaliszyk |
Using APPLY_RSP1; again a little bit faster.
|
file |
diff |
annotate
|