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.
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 15:06:58 +0100] rev 1649
Update TODO
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 14:31:51 +0100] rev 1648
Showed ACons_subst.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 14:24:06 +0100] rev 1647
Only ACons_subst left to show.
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
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:29:54 +0100] rev 1645
One more copy-and-paste in core-haskell.
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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:10:15 +0100] rev 1643
Showed Let substitution.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 11:01:22 +0100] rev 1642
Only let substitution is left.