Tue, 16 Mar 2010 15:38:14 +0100 alpha5_symp proved.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 15:38:14 +0100] rev 1455
alpha5_symp proved.
Tue, 16 Mar 2010 15:27:47 +0100 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 15:27:47 +0100] rev 1454
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Tue, 16 Mar 2010 12:08:37 +0100 The proof in 'Test' gets simpler.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 12:08:37 +0100] rev 1453
The proof in 'Test' gets simpler.
Tue, 16 Mar 2010 12:06:22 +0100 Removed pi o bn = bn' assumption in alpha
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 12:06:22 +0100] rev 1452
Removed pi o bn = bn' assumption in alpha
Mon, 15 Mar 2010 23:42:56 +0100 merged (confirmed to work with Isabelle from 6th March)
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)
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.
Mon, 15 Mar 2010 10:36:09 +0100 LF works with new alpha...?
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:36:09 +0100] rev 1444
LF works with new alpha...?
Mon, 15 Mar 2010 10:07:15 +0100 explicit flag "cheat_equivp"
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:07:15 +0100] rev 1443
explicit flag "cheat_equivp"
Mon, 15 Mar 2010 10:02:19 +0100 Prove alpha_gen_compose_eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:02:19 +0100] rev 1442
Prove alpha_gen_compose_eqvt
Mon, 15 Mar 2010 09:27:25 +0100 Use eqvt.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 09:27:25 +0100] rev 1441
Use eqvt.
Mon, 15 Mar 2010 08:39:23 +0100 added preliminary test version....but Test works now
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 08:39:23 +0100] rev 1440
added preliminary test version....but Test works now
Mon, 15 Mar 2010 08:28:10 +0100 added an eqvt-proof for bi
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 08:28:10 +0100] rev 1439
added an eqvt-proof for bi
Mon, 15 Mar 2010 06:11:35 +0100 synchronised with main hg-repository; used add_typedef_global in nominal_atoms
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 06:11:35 +0100] rev 1438
synchronised with main hg-repository; used add_typedef_global in nominal_atoms
Sun, 14 Mar 2010 11:36:15 +0100 localised the typedef in Attic (requires new Isabelle)
Christian Urban <urbanc@in.tum.de> [Sun, 14 Mar 2010 11:36:15 +0100] rev 1437
localised the typedef in Attic (requires new Isabelle)
Sat, 13 Mar 2010 13:49:15 +0100 started supp-fv proofs (is going to work)
Christian Urban <urbanc@in.tum.de> [Sat, 13 Mar 2010 13:49:15 +0100] rev 1436
started supp-fv proofs (is going to work)
Fri, 12 Mar 2010 17:42:31 +0100 Even with pattern simplified to a single clause, the supp equation doesn't seem true.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 12 Mar 2010 17:42:31 +0100] rev 1435
Even with pattern simplified to a single clause, the supp equation doesn't seem true.
Fri, 12 Mar 2010 12:42:35 +0100 Still don't know how to prove supp=fv for simplest Let...
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 12 Mar 2010 12:42:35 +0100] rev 1434
Still don't know how to prove supp=fv for simplest Let...
Thu, 11 Mar 2010 20:49:31 +0100 Do not fail if the finite support proof fails.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 20:49:31 +0100] rev 1433
Do not fail if the finite support proof fails.
Thu, 11 Mar 2010 19:43:50 +0100 generalised the supp for atoms to all concrete atoms (not just names)
Christian Urban <urbanc@in.tum.de> [Thu, 11 Mar 2010 19:43:50 +0100] rev 1432
generalised the supp for atoms to all concrete atoms (not just names)
Thu, 11 Mar 2010 19:41:11 +0100 support of atoms at the end of Abs.thy
Christian Urban <urbanc@in.tum.de> [Thu, 11 Mar 2010 19:41:11 +0100] rev 1431
support of atoms at the end of Abs.thy
Thu, 11 Mar 2010 19:24:07 +0100 Trying to prove atom_image_fresh_swap
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 19:24:07 +0100] rev 1430
Trying to prove atom_image_fresh_swap
Thu, 11 Mar 2010 17:49:07 +0100 Finite_support proof no longer needed in LF.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 17:49:07 +0100] rev 1429
Finite_support proof no longer needed in LF.
Thu, 11 Mar 2010 17:47:29 +0100 Show that the new types are in finite support typeclass.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 17:47:29 +0100] rev 1428
Show that the new types are in finite support typeclass.
Thu, 11 Mar 2010 16:50:44 +0100 mk_supports_eq and supports_tac.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 16:50:44 +0100] rev 1427
mk_supports_eq and supports_tac.
Thu, 11 Mar 2010 16:16:15 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 16:16:15 +0100] rev 1426
merge
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip