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.
Wed, 24 Mar 2010 12:05:38 +0100 Working on stating induct.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:05:38 +0100] rev 1630
Working on stating induct.
Wed, 24 Mar 2010 12:53:39 +0100 some tuning; possible fix for strange paper generation
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 12:53:39 +0100] rev 1629
some tuning; possible fix for strange paper generation
Wed, 24 Mar 2010 12:34:28 +0100 more on the paper
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 12:34:28 +0100] rev 1628
more on the paper
Wed, 24 Mar 2010 12:04:03 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:04:03 +0100] rev 1627
merge
Wed, 24 Mar 2010 12:03:48 +0100 Showed support of Core Haskell
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 12:03:48 +0100] rev 1626
Showed support of Core Haskell
Wed, 24 Mar 2010 11:13:39 +0100 Support proof modification for Core Haskell.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 11:13:39 +0100] rev 1625
Support proof modification for Core Haskell.
Wed, 24 Mar 2010 10:55:59 +0100 Experiments with Core Haskell support.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 10:55:59 +0100] rev 1624
Experiments with Core Haskell support.
Wed, 24 Mar 2010 10:49:50 +0100 Export all the cheats needed for Core Haskell.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 10:49:50 +0100] rev 1623
Export all the cheats needed for Core Haskell.
Wed, 24 Mar 2010 09:59:47 +0100 Compute Fv for non-recursive bn functions calling other bn functions
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
Wed, 24 Mar 2010 08:45:54 +0100 Core Haskell experiments.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Mar 2010 08:45:54 +0100] rev 1621
Core Haskell experiments.
Wed, 24 Mar 2010 07:23:53 +0100 tuned paper
Christian Urban <urbanc@in.tum.de> [Wed, 24 Mar 2010 07:23:53 +0100] rev 1620
tuned paper
Tue, 23 Mar 2010 17:44:43 +0100 more of the paper
Christian Urban <urbanc@in.tum.de> [Tue, 23 Mar 2010 17:44:43 +0100] rev 1619
more of the paper
Tue, 23 Mar 2010 17:22:37 +0100 merged
Christian Urban <urbanc@in.tum.de> [Tue, 23 Mar 2010 17:22:37 +0100] rev 1618
merged
Tue, 23 Mar 2010 17:22:19 +0100 more tuning in the paper
Christian Urban <urbanc@in.tum.de> [Tue, 23 Mar 2010 17:22:19 +0100] rev 1617
more tuning in the paper
Tue, 23 Mar 2010 16:28:46 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 23 Mar 2010 16:28:46 +0100] rev 1616
merge
Tue, 23 Mar 2010 16:28:29 +0100 Parsing bn functions that call other bn functions and transmitting this information to fv/alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 23 Mar 2010 16:28:29 +0100] rev 1615
Parsing bn functions that call other bn functions and transmitting this information to fv/alpha.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip