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.
(0) -1000 -300 -100 -30 -10 -4 +4 +10 +30 +100 +300 +1000 tip