Thu, 14 Feb 2013 21:31:25 +0100 write_pdf for JFreeChart;
wenzelm [Thu, 14 Feb 2013 21:31:25 +0100] rev 51127
write_pdf for JFreeChart;
Thu, 14 Feb 2013 15:27:10 +0100 reform of predicate compiler / quickcheck theories:
haftmann [Thu, 14 Feb 2013 15:27:10 +0100] rev 51126
reform of predicate compiler / quickcheck theories: implement yieldn operations uniformly on the ML level -- predicate compiler uses negative integers as parameter to yieldn, whereas code_numeral represents natural numbers! avoid odd New_ prefix by joining related theories; avoid overcompact name DSequence; separated predicate inside random monad into separate theory; consolidated name of theory Quickcheck
Thu, 14 Feb 2013 17:58:28 +0100 merged
Andreas Lochbihler [Thu, 14 Feb 2013 17:58:28 +0100] rev 51125
merged
Thu, 14 Feb 2013 17:58:13 +0100 instantiate finite_UNIV and card_UNIV for finfun type
Andreas Lochbihler [Thu, 14 Feb 2013 17:58:13 +0100] rev 51124
instantiate finite_UNIV and card_UNIV for finfun type
Thu, 14 Feb 2013 17:06:15 +0100 merged
wenzelm [Thu, 14 Feb 2013 17:06:15 +0100] rev 51123
merged
Thu, 14 Feb 2013 16:36:21 +0100 more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm [Thu, 14 Feb 2013 16:36:21 +0100] rev 51122
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
Thu, 14 Feb 2013 16:35:32 +0100 tuned proof;
wenzelm [Thu, 14 Feb 2013 16:35:32 +0100] rev 51121
tuned proof;
Thu, 14 Feb 2013 16:25:13 +0100 obsolete;
wenzelm [Thu, 14 Feb 2013 16:25:13 +0100] rev 51120
obsolete;
Thu, 14 Feb 2013 16:17:36 +0100 tuned proofs;
wenzelm [Thu, 14 Feb 2013 16:17:36 +0100] rev 51119
tuned proofs;
Thu, 14 Feb 2013 15:34:33 +0100 tuned signature -- legacy packages might want to fork proofs as well;
wenzelm [Thu, 14 Feb 2013 15:34:33 +0100] rev 51118
tuned signature -- legacy packages might want to fork proofs as well;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip