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
|
Thu, 03 Dec 2009 19:06:14 +0100 |
Christian Urban |
the error occurs in APPLY_RSP_TAC where the wrong quotient (for LIST_REL) is applied
|
changeset |
files
|
Thu, 03 Dec 2009 15:03:31 +0100 |
Christian Urban |
removed quot argument...not all examples work anymore
|
changeset |
files
|
Thu, 03 Dec 2009 14:02:05 +0100 |
Christian Urban |
merged
|
changeset |
files
|
Thu, 03 Dec 2009 14:00:43 +0100 |
Christian Urban |
merged
|
changeset |
files
|
Thu, 03 Dec 2009 13:59:53 +0100 |
Christian Urban |
first version of internalised quotient theorems; added FIXME-TODO
|
changeset |
files
|
Thu, 03 Dec 2009 11:40:10 +0100 |
Christian Urban |
further dead code
|
changeset |
files
|
Thu, 03 Dec 2009 13:56:59 +0100 |
Cezary Kaliszyk |
Reintroduced varifyT; we still need it for permutation definition.
|
changeset |
files
|
Thu, 03 Dec 2009 13:45:52 +0100 |
Cezary Kaliszyk |
Updated the examples
|
changeset |
files
|
Thu, 03 Dec 2009 12:33:05 +0100 |
Cezary Kaliszyk |
Fixed previous mistake
|
changeset |
files
|
Thu, 03 Dec 2009 12:31:05 +0100 |
Cezary Kaliszyk |
defs used automatically by clean_tac
|
changeset |
files
|
Thu, 03 Dec 2009 12:22:19 +0100 |
Cezary Kaliszyk |
Added qoutient_consts dest for getting all the constant definitions in the cleaning step.
|
changeset |
files
|
Thu, 03 Dec 2009 12:17:23 +0100 |
Cezary Kaliszyk |
Added the definition to quotient constant data.
|
changeset |
files
|
Thu, 03 Dec 2009 11:58:46 +0100 |
Cezary Kaliszyk |
removing unused code
|
changeset |
files
|
Thu, 03 Dec 2009 11:34:34 +0100 |
Christian Urban |
merged
|
changeset |
files
|
Thu, 03 Dec 2009 11:33:24 +0100 |
Christian Urban |
deleted some dead code
|
changeset |
files
|
Thu, 03 Dec 2009 11:28:19 +0100 |
Cezary Kaliszyk |
Included all_prs and ex_prs in the lambda_prs conversion.
|
changeset |
files
|
Thu, 03 Dec 2009 02:53:54 +0100 |
Christian Urban |
further simplification
|
changeset |
files
|
Thu, 03 Dec 2009 02:18:21 +0100 |
Christian Urban |
simplified lambda_prs_conv
|
changeset |
files
|