| Wed, 17 Mar 2010 11:11:42 +0100 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| Wed, 17 Mar 2010 11:11:25 +0100 |
Cezary Kaliszyk |
Finished all proofs in Term5 and Term5n.
|
changeset |
files
|
| Wed, 17 Mar 2010 10:34:25 +0100 |
Christian Urban |
added partial proof of supp for type schemes
|
changeset |
files
|
| Wed, 17 Mar 2010 09:57:54 +0100 |
Cezary Kaliszyk |
Fix in alpha; support of the recursive Let works :)
|
changeset |
files
|
| Wed, 17 Mar 2010 09:42:56 +0100 |
Cezary Kaliszyk |
The recursive supp just has one equation too much.
|
changeset |
files
|
| Wed, 17 Mar 2010 09:25:01 +0100 |
Cezary Kaliszyk |
Fix for the change of alpha_gen.
|
changeset |
files
|
| Wed, 17 Mar 2010 09:18:27 +0100 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| Wed, 17 Mar 2010 09:17:55 +0100 |
Cezary Kaliszyk |
Generate compound FV and Alpha for recursive bindings.
|
changeset |
files
|
| Wed, 17 Mar 2010 08:39:46 +0100 |
Cezary Kaliszyk |
Lifting theorems with compound fv and compound alpha.
|
changeset |
files
|
| Wed, 17 Mar 2010 08:07:25 +0100 |
Christian Urban |
commented out examples that should not work; but for example type-scheme example should work
|
changeset |
files
|
| Wed, 17 Mar 2010 06:49:33 +0100 |
Christian Urban |
added another supp-proof for the non-recursive case
|
changeset |
files
|
| Tue, 16 Mar 2010 20:07:13 +0100 |
Cezary Kaliszyk |
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
|
changeset |
files
|
| Tue, 16 Mar 2010 18:19:00 +0100 |
Cezary Kaliszyk |
merge
|
changeset |
files
|
| Tue, 16 Mar 2010 18:18:08 +0100 |
Cezary Kaliszyk |
The old recursive alpha works fine.
|
changeset |
files
|
| Tue, 16 Mar 2010 18:13:34 +0100 |
Christian Urban |
added the final unfolded result
|
changeset |
files
|
| Tue, 16 Mar 2010 18:02:08 +0100 |
Christian Urban |
merge and proof of support for non-recursive case
|
changeset |
files
|
| Tue, 16 Mar 2010 17:20:46 +0100 |
Cezary Kaliszyk |
Added Term5 non-recursive. The bug is there only for the recursive case.
|
changeset |
files
|
| Tue, 16 Mar 2010 17:11:32 +0100 |
Cezary Kaliszyk |
Alpha is wrong.
|
changeset |
files
|
| Tue, 16 Mar 2010 16:51:06 +0100 |
Cezary Kaliszyk |
alpha_bn doesn't need the permutation in non-recursive case.
|
changeset |
files
|
| Tue, 16 Mar 2010 16:17:05 +0100 |
Cezary Kaliszyk |
alpha5_transp and equivp
|
changeset |
files
|
| Tue, 16 Mar 2010 15:38:14 +0100 |
Cezary Kaliszyk |
alpha5_symp proved.
|
changeset |
files
|
| Tue, 16 Mar 2010 15:27:47 +0100 |
Cezary Kaliszyk |
FV_bn generated for recursive functions as well, and used in main fv for bindings.
|
changeset |
files
|
| Tue, 16 Mar 2010 12:08:37 +0100 |
Cezary Kaliszyk |
The proof in 'Test' gets simpler.
|
changeset |
files
|
| Tue, 16 Mar 2010 12:06:22 +0100 |
Cezary Kaliszyk |
Removed pi o bn = bn' assumption in alpha
|
changeset |
files
|
| Mon, 15 Mar 2010 23:42:56 +0100 |
Christian Urban |
merged (confirmed to work with Isabelle from 6th March)
|
changeset |
files
|
| Mon, 15 Mar 2010 17:52:31 +0100 |
Christian Urban |
another synchronisation
|
changeset |
files
|
| Mon, 15 Mar 2010 17:51:35 +0100 |
Christian Urban |
proof for support when bn-function is present, but fb_function is empty
|
changeset |
files
|
| Mon, 15 Mar 2010 17:42:17 +0100 |
Cezary Kaliszyk |
fv_eqvt_cheat no longer needed.
|
changeset |
files
|
| Mon, 15 Mar 2010 14:32:05 +0100 |
Cezary Kaliszyk |
derive "inducts" from "induct" instead of lifting again is much faster.
|
changeset |
files
|
| Mon, 15 Mar 2010 13:56:17 +0100 |
Cezary Kaliszyk |
build_eqvts works with recursive case if proper induction rule is used.
|
changeset |
files
|