Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 17:11:32 +0100] rev 1458
Alpha is wrong.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 16:51:06 +0100] rev 1457
alpha_bn doesn't need the permutation in non-recursive case.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 16:17:05 +0100] rev 1456
alpha5_transp and equivp
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 15:38:14 +0100] rev 1455
alpha5_symp proved.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 15:27:47 +0100] rev 1454
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 12:08:37 +0100] rev 1453
The proof in 'Test' gets simpler.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 12:06:22 +0100] rev 1452
Removed pi o bn = bn' assumption in alpha
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 23:42:56 +0100] rev 1451
merged (confirmed to work with Isabelle from 6th March)
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 17:52:31 +0100] rev 1450
another synchronisation
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 17:51:35 +0100] rev 1449
proof for support when bn-function is present, but fb_function is empty
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 17:42:17 +0100] rev 1448
fv_eqvt_cheat no longer needed.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 14:32:05 +0100] rev 1447
derive "inducts" from "induct" instead of lifting again is much faster.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 13:56:17 +0100] rev 1446
build_eqvts works with recursive case if proper induction rule is used.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 11:50:12 +0100] rev 1445
cheat_alpha_eqvt no longer needed; the proofs work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:36:09 +0100] rev 1444
LF works with new alpha...?