Mon, 15 Mar 2010 17:52:31 +0100 another synchronisation
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 17:52:31 +0100] rev 1450
another synchronisation
Mon, 15 Mar 2010 17:51:35 +0100 proof for support when bn-function is present, but fb_function is empty
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
Mon, 15 Mar 2010 17:42:17 +0100 fv_eqvt_cheat no longer needed.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 17:42:17 +0100] rev 1448
fv_eqvt_cheat no longer needed.
Mon, 15 Mar 2010 14:32:05 +0100 derive "inducts" from "induct" instead of lifting again is much faster.
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.
Mon, 15 Mar 2010 13:56:17 +0100 build_eqvts works with recursive case if proper induction rule is used.
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.
Mon, 15 Mar 2010 11:50:12 +0100 cheat_alpha_eqvt no longer needed; the proofs work.
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.
(0) -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 tip