| 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
|
| Mon, 15 Mar 2010 11:50:12 +0100 |
Cezary Kaliszyk |
cheat_alpha_eqvt no longer needed; the proofs work.
|
changeset |
files
|
| Mon, 15 Mar 2010 10:36:09 +0100 |
Cezary Kaliszyk |
LF works with new alpha...?
|
changeset |
files
|