Mercurial
Mercurial
>
repos
>
isabelle
/ changelog
summary
|
shortlog
| changelog |
graph
|
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
(0)
-30000
-10000
-3000
-1000
-300
-100
-10
+10
+100
+300
+1000
+3000
+10000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
Thu, 14 Feb 2013 17:58:28 +0100
merged
changeset
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
changeset
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
changeset
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;
changeset
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;
changeset
wenzelm [Thu, 14 Feb 2013 16:35:32 +0100] rev 51121
tuned proof;
Thu, 14 Feb 2013 16:25:13 +0100
obsolete;
changeset
wenzelm [Thu, 14 Feb 2013 16:25:13 +0100] rev 51120
obsolete;
Thu, 14 Feb 2013 16:17:36 +0100
tuned proofs;
changeset
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;
changeset
wenzelm [Thu, 14 Feb 2013 15:34:33 +0100] rev 51118
tuned signature -- legacy packages might want to fork proofs as well;
Thu, 14 Feb 2013 16:01:59 +0100
merged
changeset
Andreas Lochbihler [Thu, 14 Feb 2013 16:01:59 +0100] rev 51117
merged
Thu, 14 Feb 2013 16:01:28 +0100
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
Andreas Lochbihler [Thu, 14 Feb 2013 16:01:28 +0100] rev 51116
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
(0)
-30000
-10000
-3000
-1000
-300
-100
-10
+10
+100
+300
+1000
+3000
+10000
tip