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.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 10:44:14 +0100] rev 1641
further in the proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Mar 2010 10:25:33 +0100] rev 1640
trying to prove the string induction for let.
Christian Urban <urbanc@in.tum.de> [Thu, 25 Mar 2010 09:08:42 +0100] rev 1639
added experiemental permute_bn
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
Christian Urban <urbanc@in.tum.de> [Thu, 25 Mar 2010 07:21:41 +0100] rev 1637
more on the paper
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 19:50:42 +0100] rev 1636
more on the paper
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 18:02:33 +0100] rev 1635
Further in the strong induction proof.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 16:06:31 +0100] rev 1634
Solved one of the strong-induction goals.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 14:49:51 +0100] rev 1633
avoiding for atom.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 13:54:20 +0100] rev 1632
Started proving strong induction.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:36:58 +0100] rev 1631
stating the strong induction; further.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:05:38 +0100] rev 1630
Working on stating induct.
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 12:53:39 +0100] rev 1629
some tuning; possible fix for strange paper generation
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 12:34:28 +0100] rev 1628
more on the paper
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:04:03 +0100] rev 1627
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:03:48 +0100] rev 1626
Showed support of Core Haskell
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 11:13:39 +0100] rev 1625
Support proof modification for Core Haskell.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 10:55:59 +0100] rev 1624
Experiments with Core Haskell support.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 10:49:50 +0100] rev 1623
Export all the cheats needed for Core Haskell.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 09:59:47 +0100] rev 1622
Compute Fv for non-recursive bn functions calling other bn functions
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 08:45:54 +0100] rev 1621
Core Haskell experiments.