Tue, 27 Apr 2010 10:51:39 +0200 fix SML/NJ compilation (I hope)
blanchet [Tue, 27 Apr 2010 10:51:39 +0200] rev 36422
fix SML/NJ compilation (I hope)
Tue, 27 Apr 2010 16:09:15 +0200 tuned classrel completion -- bypass composition with reflexive edges;
wenzelm [Tue, 27 Apr 2010 16:09:15 +0200] rev 36421
tuned classrel completion -- bypass composition with reflexive edges;
Tue, 27 Apr 2010 15:23:05 +0200 tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm [Tue, 27 Apr 2010 15:23:05 +0200] rev 36420
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
Tue, 27 Apr 2010 15:03:19 +0200 tuned aritiy completion -- slightly less intermediate data structures;
wenzelm [Tue, 27 Apr 2010 15:03:19 +0200] rev 36419
tuned aritiy completion -- slightly less intermediate data structures;
Tue, 27 Apr 2010 14:41:27 +0200 clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm [Tue, 27 Apr 2010 14:41:27 +0200] rev 36418
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
Tue, 27 Apr 2010 14:19:47 +0200 misc tuning and simplification;
wenzelm [Tue, 27 Apr 2010 14:19:47 +0200] rev 36417
misc tuning and simplification;
Tue, 27 Apr 2010 10:42:41 +0200 NEWS and CONTRIBUTORS
haftmann [Tue, 27 Apr 2010 10:42:41 +0200] rev 36416
NEWS and CONTRIBUTORS
Tue, 27 Apr 2010 09:49:40 +0200 explicit is better than implicit
haftmann [Tue, 27 Apr 2010 09:49:40 +0200] rev 36415
explicit is better than implicit
Tue, 27 Apr 2010 09:49:36 +0200 tuned class linordered_field_inverse_zero
haftmann [Tue, 27 Apr 2010 09:49:36 +0200] rev 36414
tuned class linordered_field_inverse_zero
Tue, 27 Apr 2010 08:18:25 +0200 merged
haftmann [Tue, 27 Apr 2010 08:18:25 +0200] rev 36413
merged
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip