| Wed, 17 Mar 2010 09:42:56 +0100 |
Cezary Kaliszyk |
The recursive supp just has one equation too much.
|
file |
diff |
annotate
|
| 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
|
file |
diff |
annotate
|
| Wed, 17 Mar 2010 06:49:33 +0100 |
Christian Urban |
added another supp-proof for the non-recursive case
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 18:13:34 +0100 |
Christian Urban |
added the final unfolded result
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 18:02:08 +0100 |
Christian Urban |
merge and proof of support for non-recursive case
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 16:51:06 +0100 |
Cezary Kaliszyk |
alpha_bn doesn't need the permutation in non-recursive case.
|
file |
diff |
annotate
|
| 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.
|
file |
diff |
annotate
|
| Tue, 16 Mar 2010 12:08:37 +0100 |
Cezary Kaliszyk |
The proof in 'Test' gets simpler.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 23:42:56 +0100 |
Christian Urban |
merged (confirmed to work with Isabelle from 6th March)
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 17:51:35 +0100 |
Christian Urban |
proof for support when bn-function is present, but fb_function is empty
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 17:42:17 +0100 |
Cezary Kaliszyk |
fv_eqvt_cheat no longer needed.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 14:32:05 +0100 |
Cezary Kaliszyk |
derive "inducts" from "induct" instead of lifting again is much faster.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 11:50:12 +0100 |
Cezary Kaliszyk |
cheat_alpha_eqvt no longer needed; the proofs work.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 09:27:25 +0100 |
Cezary Kaliszyk |
Use eqvt.
|
file |
diff |
annotate
|
| Mon, 15 Mar 2010 08:28:10 +0100 |
Christian Urban |
added an eqvt-proof for bi
|
file |
diff |
annotate
|