Sat, 25 Feb 2012 09:07:53 +0100 slightly changing the enumeration scheme
bulwahn [Sat, 25 Feb 2012 09:07:53 +0100] rev 46674
slightly changing the enumeration scheme
Sat, 25 Feb 2012 09:07:51 +0100 adding some more test invocations of find_unused_assms
bulwahn [Sat, 25 Feb 2012 09:07:51 +0100] rev 46673
adding some more test invocations of find_unused_assms
Sat, 25 Feb 2012 09:07:43 +0100 adding an example where random beats exhaustive testing
bulwahn [Sat, 25 Feb 2012 09:07:43 +0100] rev 46672
adding an example where random beats exhaustive testing
Sat, 25 Feb 2012 09:07:41 +0100 removing unnecessary assumptions in RComplete;
bulwahn [Sat, 25 Feb 2012 09:07:41 +0100] rev 46671
removing unnecessary assumptions in RComplete; simplifying proof in Probability
Sat, 25 Feb 2012 09:07:39 +0100 removing unnecessary assumptions in RealDef;
bulwahn [Sat, 25 Feb 2012 09:07:39 +0100] rev 46670
removing unnecessary assumptions in RealDef; simplifying proofs in Float, MIR, and Ferrack
Sat, 25 Feb 2012 09:07:37 +0100 one general list_all2_update_cong instead of two special ones
bulwahn [Sat, 25 Feb 2012 09:07:37 +0100] rev 46669
one general list_all2_update_cong instead of two special ones
Sat, 25 Feb 2012 13:17:38 +0100 tuned comments;
wenzelm [Sat, 25 Feb 2012 13:17:38 +0100] rev 46668
tuned comments;
Sat, 25 Feb 2012 13:13:14 +0100 standard Graph instances;
wenzelm [Sat, 25 Feb 2012 13:13:14 +0100] rev 46667
standard Graph instances;
Sat, 25 Feb 2012 13:00:32 +0100 clarified signature -- avoid oddities of Iterable like Iterator.map;
wenzelm [Sat, 25 Feb 2012 13:00:32 +0100] rev 46666
clarified signature -- avoid oddities of Iterable like Iterator.map; specific toString;
Sat, 25 Feb 2012 12:34:56 +0100 discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
wenzelm [Sat, 25 Feb 2012 12:34:56 +0100] rev 46665
discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip