| Thu, 14 Feb 2013 15:27:10 +0100 |
haftmann |
reform of predicate compiler / quickcheck theories:
|
changeset |
files
|
| Thu, 14 Feb 2013 17:58:28 +0100 |
Andreas Lochbihler |
merged
|
changeset |
files
|
| Thu, 14 Feb 2013 17:58:13 +0100 |
Andreas Lochbihler |
instantiate finite_UNIV and card_UNIV for finfun type
|
changeset |
files
|
| Thu, 14 Feb 2013 17:06:15 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Thu, 14 Feb 2013 16:36:21 +0100 |
wenzelm |
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
|
changeset |
files
|
| Thu, 14 Feb 2013 16:35:32 +0100 |
wenzelm |
tuned proof;
|
changeset |
files
|
| Thu, 14 Feb 2013 16:25:13 +0100 |
wenzelm |
obsolete;
|
changeset |
files
|
| Thu, 14 Feb 2013 16:17:36 +0100 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Thu, 14 Feb 2013 15:34:33 +0100 |
wenzelm |
tuned signature -- legacy packages might want to fork proofs as well;
|
changeset |
files
|
| Thu, 14 Feb 2013 16:01:59 +0100 |
Andreas Lochbihler |
merged
|
changeset |
files
|
| Thu, 14 Feb 2013 16:01:28 +0100 |
Andreas Lochbihler |
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
|
changeset |
files
|
| Thu, 14 Feb 2013 14:14:55 +0100 |
haftmann |
consolidation of library theories on product orders
|
changeset |
files
|
| Thu, 14 Feb 2013 12:24:56 +0100 |
haftmann |
type lifting setup for code numeral types
|
changeset |
files
|
| Thu, 14 Feb 2013 12:24:56 +0100 |
haftmann |
factored out shared preprocessor setup into theory Code_Abstract_Nat, tuning descriptions
|
changeset |
files
|