Mon, 10 Oct 2011 20:14:25 +0200 include no-smlnj targets into library (cf. e54a985daa61);
wenzelm [Mon, 10 Oct 2011 20:14:25 +0200] rev 45126
include no-smlnj targets into library (cf. e54a985daa61);
Mon, 10 Oct 2011 16:47:45 +0200 increasing values_timeout to avoid SML_makeall failures on our current tests
bulwahn [Mon, 10 Oct 2011 16:47:45 +0200] rev 45125
increasing values_timeout to avoid SML_makeall failures on our current tests
Mon, 10 Oct 2011 11:12:09 +0200 merged
wenzelm [Mon, 10 Oct 2011 11:12:09 +0200] rev 45124
merged
Mon, 10 Oct 2011 11:10:45 +0200 removed obsolete RC tags;
wenzelm [Mon, 10 Oct 2011 11:10:45 +0200] rev 45123
removed obsolete RC tags;
Sun, 09 Oct 2011 11:13:53 +0200 Int.thy: discontinued some legacy theorems
huffman [Sun, 09 Oct 2011 11:13:53 +0200] rev 45122
Int.thy: discontinued some legacy theorems
Sun, 09 Oct 2011 08:30:48 +0200 Set.thy: remove redundant [simp] declarations
huffman [Sun, 09 Oct 2011 08:30:48 +0200] rev 45121
Set.thy: remove redundant [simp] declarations
Mon, 03 Oct 2011 22:21:19 +0200 removing code equation for card on finite types when loading the Executable_Set theory; should resolve a code generation issue with CoreC++
bulwahn [Mon, 03 Oct 2011 22:21:19 +0200] rev 45120
removing code equation for card on finite types when loading the Executable_Set theory; should resolve a code generation issue with CoreC++
Mon, 03 Oct 2011 15:39:30 +0200 tune text for document generation
bulwahn [Mon, 03 Oct 2011 15:39:30 +0200] rev 45119
tune text for document generation
Mon, 03 Oct 2011 14:43:15 +0200 adding examples with relations to Quickcheck_Examples to show that quickcheck can actually handle operators on relations as well
bulwahn [Mon, 03 Oct 2011 14:43:15 +0200] rev 45118
adding examples with relations to Quickcheck_Examples to show that quickcheck can actually handle operators on relations as well
Mon, 03 Oct 2011 14:43:14 +0200 adding code equations for cardinality and (reflexive) transitive closure on finite types
bulwahn [Mon, 03 Oct 2011 14:43:14 +0200] rev 45117
adding code equations for cardinality and (reflexive) transitive closure on finite types
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip