Tue, 19 Jun 2007 23:15:51 +0200 wenzelm added with_subgoal;
Tue, 19 Jun 2007 23:15:49 +0200 wenzelm balanced conjunctions;
Tue, 19 Jun 2007 23:15:47 +0200 wenzelm balanced conjunctions;
Tue, 19 Jun 2007 23:15:43 +0200 wenzelm added General/balanced_tree.ML;
Tue, 19 Jun 2007 23:15:38 +0200 wenzelm BalancedTree;
Tue, 19 Jun 2007 23:15:27 +0200 wenzelm balanced conjunctions;
Tue, 19 Jun 2007 23:15:23 +0200 wenzelm tuned;
Tue, 19 Jun 2007 18:00:49 +0200 krauss generalized proofs so that call graphs can have any node type.
(0) -10000 -3000 -1000 -300 -100 -30 -10 -8 +8 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip