Thu, 14 Feb 2013 17:58:13 +0100instantiate finite_UNIV and card_UNIV for finfun type
Andreas Lochbihler [Thu, 14 Feb 2013 17:58:13 +0100] rev 52261
instantiate finite_UNIV and card_UNIV for finfun type

Thu, 14 Feb 2013 17:06:15 +0100merged
wenzelm [Thu, 14 Feb 2013 17:06:15 +0100] rev 52260
merged

Thu, 14 Feb 2013 16:36:21 +0100more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm [Thu, 14 Feb 2013 16:36:21 +0100] rev 52259
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;

Thu, 14 Feb 2013 16:35:32 +0100tuned proof;
wenzelm [Thu, 14 Feb 2013 16:35:32 +0100] rev 52258
tuned proof;

Thu, 14 Feb 2013 16:25:13 +0100obsolete;
wenzelm [Thu, 14 Feb 2013 16:25:13 +0100] rev 52257
obsolete;

Thu, 14 Feb 2013 16:17:36 +0100tuned proofs;
wenzelm [Thu, 14 Feb 2013 16:17:36 +0100] rev 52256
tuned proofs;

Thu, 14 Feb 2013 15:34:33 +0100tuned signature -- legacy packages might want to fork proofs as well;
wenzelm [Thu, 14 Feb 2013 15:34:33 +0100] rev 52255
tuned signature -- legacy packages might want to fork proofs as well;

Thu, 14 Feb 2013 16:01:59 +0100merged
Andreas Lochbihler [Thu, 14 Feb 2013 16:01:59 +0100] rev 52254
merged

Thu, 14 Feb 2013 16:01:28 +0100implement code generation for finite, card, op = and op <= for sets always via finite_UNIV and card_UNIV, as fragile rewrites based on sorts are hard to find and debug
Andreas Lochbihler [Thu, 14 Feb 2013 16:01:28 +0100] rev 52253
implement code generation for finite, card, op = and op <= for sets always via finite_UNIV and card_UNIV, as fragile rewrites based on sorts are hard to find and debug

Thu, 14 Feb 2013 14:14:55 +0100consolidation of library theories on product orders
haftmann [Thu, 14 Feb 2013 14:14:55 +0100] rev 52252
consolidation of library theories on product orders