Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 18 Mar 2010 08:32:55 +0100] rev 1498
Rename bound variables + minor cleaning.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 18 Mar 2010 08:03:42 +0100] rev 1497
Move most of the exporting out of the parser.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 18 Mar 2010 07:43:44 +0100] rev 1496
Prove pseudo-inject (eq-iff) on the exported level and rename appropriately.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 18 Mar 2010 07:35:44 +0100] rev 1495
Prove eqvts on exported terms.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 18 Mar 2010 07:26:36 +0100] rev 1494
Clean 'Lift', start working only on exported things in Parser.
Christian Urban <urbanc@in.tum.de> [Thu, 18 Mar 2010 00:17:21 +0100] rev 1493
slightly more of the paper
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 20:42:42 +0100] rev 1492
merged
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 20:42:22 +0100] rev 1491
paper uses now a heap file - does not compile so long anymore
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 18:53:23 +0100] rev 1490
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 18:52:59 +0100] rev 1489
compose_sym2 works also for term5
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 17:59:04 +0100] rev 1488
Updated Term1, including statement of strong induction.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 17:40:14 +0100] rev 1487
Proper compose_sym2
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 17:11:23 +0100] rev 1486
merged
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 17:10:19 +0100] rev 1485
temporarily disabled tests in Nominal/ROOT
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 15:13:31 +0100] rev 1484
made paper to compile
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 15:13:03 +0100] rev 1483
added partial proof for the strong induction principle
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 17:09:01 +0100] rev 1482
Trying to find a compose lemma for 2 arguments.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 12:23:04 +0100] rev 1481
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 12:18:35 +0100] rev 1480
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 11:54:22 +0100] rev 1479
merged
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 11:53:56 +0100] rev 1478
added proof of supp/fv for type schemes
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:40:58 +0100] rev 1477
Updated Type Schemes to automatic lifting. One goal is not true because of the restriction.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:20:24 +0100] rev 1476
Remove Term5a, since it is now identical to Term5.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:11:42 +0100] rev 1475
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:11:25 +0100] rev 1474
Finished all proofs in Term5 and Term5n.
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 10:34:25 +0100] rev 1473
added partial proof of supp for type schemes
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:57:54 +0100] rev 1472
Fix in alpha; support of the recursive Let works :)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:42:56 +0100] rev 1471
The recursive supp just has one equation too much.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:25:01 +0100] rev 1470
Fix for the change of alpha_gen.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:18:27 +0100] rev 1469
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:17:55 +0100] rev 1468
Generate compound FV and Alpha for recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 08:39:46 +0100] rev 1467
Lifting theorems with compound fv and compound alpha.
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 08:07:25 +0100] rev 1466
commented out examples that should not work; but for example type-scheme example should work
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 06:49:33 +0100] rev 1465
added another supp-proof for the non-recursive case
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 20:07:13 +0100] rev 1464
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 18:19:00 +0100] rev 1463
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 18:18:08 +0100] rev 1462
The old recursive alpha works fine.
Christian Urban <urbanc@in.tum.de> [Tue, 16 Mar 2010 18:13:34 +0100] rev 1461
added the final unfolded result
Christian Urban <urbanc@in.tum.de> [Tue, 16 Mar 2010 18:02:08 +0100] rev 1460
merge and proof of support for non-recursive case
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 17:20:46 +0100] rev 1459
Added Term5 non-recursive. The bug is there only for the recursive case.
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...?
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:07:15 +0100] rev 1443
explicit flag "cheat_equivp"
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:02:19 +0100] rev 1442
Prove alpha_gen_compose_eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 09:27:25 +0100] rev 1441
Use eqvt.
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 08:39:23 +0100] rev 1440
added preliminary test version....but Test works now
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 08:28:10 +0100] rev 1439
added an eqvt-proof for bi