Fri, 26 Mar 2010 17:22:17 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 17:22:17 +0100] rev 1660
merge
Fri, 26 Mar 2010 17:22:02 +0100 Describe 'nominal_datatype2'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 17:22:02 +0100] rev 1659
Describe 'nominal_datatype2'.
Fri, 26 Mar 2010 17:01:22 +0100 Fixed renamings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 17:01:22 +0100] rev 1658
Fixed renamings.
Fri, 26 Mar 2010 16:46:40 +0100 merged
Christian Urban <urbanc@in.tum.de> [Fri, 26 Mar 2010 16:46:40 +0100] rev 1657
merged
Fri, 26 Mar 2010 16:20:39 +0100 Removed remaining cheats + some cleaning.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 16:20:39 +0100] rev 1656
Removed remaining cheats + some cleaning.
Fri, 26 Mar 2010 10:55:13 +0100 Extract PS7 and PS8 from Test. PS7 needs the same fix as Core Haskell.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 10:55:13 +0100] rev 1655
Extract PS7 and PS8 from Test. PS7 needs the same fix as Core Haskell.
Fri, 26 Mar 2010 10:35:26 +0100 Update cheats in TODO.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 10:35:26 +0100] rev 1654
Update cheats in TODO.
Fri, 26 Mar 2010 10:07:26 +0100 Removed another cheat and cleaned the code a bit.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 10:07:26 +0100] rev 1653
Removed another cheat and cleaned the code a bit.
Fri, 26 Mar 2010 09:23:23 +0100 Fix Manual/LamEx for experiments.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Mar 2010 09:23:23 +0100] rev 1652
Fix Manual/LamEx for experiments.
Thu, 25 Mar 2010 20:12:57 +0100 Proper bn_rsp, for bn functions calling each other.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 20:12:57 +0100] rev 1651
Proper bn_rsp, for bn functions calling each other.
Thu, 25 Mar 2010 17:30:46 +0100 Gathering things to prove by induction together; removed cheat_bn_eqvt.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 17:30:46 +0100] rev 1650
Gathering things to prove by induction together; removed cheat_bn_eqvt.
Thu, 25 Mar 2010 15:06:58 +0100 Update TODO
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 15:06:58 +0100] rev 1649
Update TODO
Thu, 25 Mar 2010 14:31:51 +0100 Showed ACons_subst.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 14:31:51 +0100] rev 1648
Showed ACons_subst.
Thu, 25 Mar 2010 14:24:06 +0100 Only ACons_subst left to show.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 14:24:06 +0100] rev 1647
Only ACons_subst left to show.
Thu, 25 Mar 2010 12:04:38 +0100 Solved all boring subgoals, and looking at properly defning permute_bv
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 12:04:38 +0100] rev 1646
Solved all boring subgoals, and looking at properly defning permute_bv
Thu, 25 Mar 2010 11:29:54 +0100 One more copy-and-paste in core-haskell.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:29:54 +0100] rev 1645
One more copy-and-paste in core-haskell.
Thu, 25 Mar 2010 11:16:25 +0100 Properly defined permute_bn. No more sorry's in Let strong induction.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:16:25 +0100] rev 1644
Properly defined permute_bn. No more sorry's in Let strong induction.
Thu, 25 Mar 2010 11:10:15 +0100 Showed Let substitution.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:10:15 +0100] rev 1643
Showed Let substitution.
Thu, 25 Mar 2010 11:01:22 +0100 Only let substitution is left.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:01:22 +0100] rev 1642
Only let substitution is left.
Thu, 25 Mar 2010 10:44:14 +0100 further in the proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 10:44:14 +0100] rev 1641
further in the proof
Thu, 25 Mar 2010 10:25:33 +0100 trying to prove the string induction for let.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 10:25:33 +0100] rev 1640
trying to prove the string induction for let.
Thu, 25 Mar 2010 09:08:42 +0100 added experiemental permute_bn
Christian Urban <urbanc@in.tum.de> [Thu, 25 Mar 2010 09:08:42 +0100] rev 1639
added experiemental permute_bn
Thu, 25 Mar 2010 08:05:03 +0100 first attempt of strong induction for lets with assignments
Christian Urban <urbanc@in.tum.de> [Thu, 25 Mar 2010 08:05:03 +0100] rev 1638
first attempt of strong induction for lets with assignments
Thu, 25 Mar 2010 07:21:41 +0100 more on the paper
Christian Urban <urbanc@in.tum.de> [Thu, 25 Mar 2010 07:21:41 +0100] rev 1637
more on the paper
Wed, 24 Mar 2010 19:50:42 +0100 more on the paper
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 19:50:42 +0100] rev 1636
more on the paper
Wed, 24 Mar 2010 18:02:33 +0100 Further in the strong induction proof.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 18:02:33 +0100] rev 1635
Further in the strong induction proof.
Wed, 24 Mar 2010 16:06:31 +0100 Solved one of the strong-induction goals.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 16:06:31 +0100] rev 1634
Solved one of the strong-induction goals.
Wed, 24 Mar 2010 14:49:51 +0100 avoiding for atom.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 14:49:51 +0100] rev 1633
avoiding for atom.
Wed, 24 Mar 2010 13:54:20 +0100 Started proving strong induction.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 13:54:20 +0100] rev 1632
Started proving strong induction.
Wed, 24 Mar 2010 12:36:58 +0100 stating the strong induction; further.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:36:58 +0100] rev 1631
stating the strong induction; further.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip