Tue, 19 Jun 2007 23:15:51 +0200 added with_subgoal;
wenzelm [Tue, 19 Jun 2007 23:15:51 +0200] rev 23423
added with_subgoal;
Tue, 19 Jun 2007 23:15:49 +0200 balanced conjunctions;
wenzelm [Tue, 19 Jun 2007 23:15:49 +0200] rev 23422
balanced conjunctions; tuned interfaces; tuned;
Tue, 19 Jun 2007 23:15:47 +0200 balanced conjunctions;
wenzelm [Tue, 19 Jun 2007 23:15:47 +0200] rev 23421
balanced conjunctions; added split_defined (from conjunction.ML);
Tue, 19 Jun 2007 23:15:43 +0200 added General/balanced_tree.ML;
wenzelm [Tue, 19 Jun 2007 23:15:43 +0200] rev 23420
added General/balanced_tree.ML;
Tue, 19 Jun 2007 23:15:38 +0200 BalancedTree;
wenzelm [Tue, 19 Jun 2007 23:15:38 +0200] rev 23419
BalancedTree;
Tue, 19 Jun 2007 23:15:27 +0200 balanced conjunctions;
wenzelm [Tue, 19 Jun 2007 23:15:27 +0200] rev 23418
balanced conjunctions;
Tue, 19 Jun 2007 23:15:23 +0200 tuned;
wenzelm [Tue, 19 Jun 2007 23:15:23 +0200] rev 23417
tuned;
Tue, 19 Jun 2007 18:00:49 +0200 generalized proofs so that call graphs can have any node type.
krauss [Tue, 19 Jun 2007 18:00:49 +0200] rev 23416
generalized proofs so that call graphs can have any node type.
Tue, 19 Jun 2007 00:02:16 +0200 macbroy5: trying -j 2;
wenzelm [Tue, 19 Jun 2007 00:02:16 +0200] rev 23415
macbroy5: trying -j 2;
Mon, 18 Jun 2007 23:30:46 +0200 tuned conjunction tactics: slightly smaller proof terms;
wenzelm [Mon, 18 Jun 2007 23:30:46 +0200] rev 23414
tuned conjunction tactics: slightly smaller proof terms;
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip