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