Wed, 20 Jun 2007 05:06:56 +0200 section headings
huffman [Wed, 20 Jun 2007 05:06:56 +0200] rev 23430
section headings
Wed, 20 Jun 2007 05:06:16 +0200 simplify some proofs
huffman [Wed, 20 Jun 2007 05:06:16 +0200] rev 23429
simplify some proofs
Tue, 19 Jun 2007 23:21:39 +0200 oops -- fixed profiling;
wenzelm [Tue, 19 Jun 2007 23:21:39 +0200] rev 23428
oops -- fixed profiling;
Tue, 19 Jun 2007 23:16:14 +0200 Balanced binary trees (material from library.ML);
wenzelm [Tue, 19 Jun 2007 23:16:14 +0200] rev 23427
Balanced binary trees (material from library.ML);
Tue, 19 Jun 2007 23:15:59 +0200 profiling: observe no_timing;
wenzelm [Tue, 19 Jun 2007 23:15:59 +0200] rev 23426
profiling: observe no_timing;
Tue, 19 Jun 2007 23:15:57 +0200 added raw_tactic;
wenzelm [Tue, 19 Jun 2007 23:15:57 +0200] rev 23425
added raw_tactic;
Tue, 19 Jun 2007 23:15:54 +0200 moved balanced tree operations to General/balanced_tree.ML;
wenzelm [Tue, 19 Jun 2007 23:15:54 +0200] rev 23424
moved balanced tree operations to General/balanced_tree.ML;
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;
(0) -10000 -3000 -1000 -300 -100 -16 +16 +100 +300 +1000 +3000 +10000 +30000 tip