Mercurial
Mercurial
>
repos
>
isabelle
/ changelog
summary
|
shortlog
| changelog |
graph
|
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
(0)
-30000
-10000
-3000
-1000
-300
-100
-30
-10
-8
+8
+10
+30
+100
+300
+1000
+3000
+10000
+30000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
Sat, 20 Aug 2011 09:59:28 -0700
add lemma power2_eq_iff
changeset
huffman [Sat, 20 Aug 2011 09:59:28 -0700] rev 44345
add lemma power2_eq_iff
Sat, 20 Aug 2011 07:09:44 -0700
remove some over-specific rules from the simpset
changeset
huffman [Sat, 20 Aug 2011 07:09:44 -0700] rev 44344
remove some over-specific rules from the simpset
Sat, 20 Aug 2011 06:35:43 -0700
merged
changeset
huffman [Sat, 20 Aug 2011 06:35:43 -0700] rev 44343
merged
Sat, 20 Aug 2011 06:34:51 -0700
redefine constant 'trivial_limit' as an abbreviation
changeset
huffman [Sat, 20 Aug 2011 06:34:51 -0700] rev 44342
redefine constant 'trivial_limit' as an abbreviation
Sun, 21 Aug 2011 13:23:29 +0200
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
changeset
wenzelm [Sun, 21 Aug 2011 13:23:29 +0200] rev 44341
purely functional task_queue.ML -- moved actual interrupt_unsynchronized to future.ML;
Sun, 21 Aug 2011 13:10:48 +0200
refined Task_Queue.cancel: passive tasks are considered running due to pending abort operation;
changeset
wenzelm [Sun, 21 Aug 2011 13:10:48 +0200] rev 44340
refined Task_Queue.cancel: passive tasks are considered running due to pending abort operation;
Sat, 20 Aug 2011 23:36:18 +0200
odd workaround for odd problem of load order in HOL/ex/ROOT.ML (!??);
changeset
wenzelm [Sat, 20 Aug 2011 23:36:18 +0200] rev 44339
odd workaround for odd problem of load order in HOL/ex/ROOT.ML (!??);
Sat, 20 Aug 2011 23:35:30 +0200
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
changeset
wenzelm [Sat, 20 Aug 2011 23:35:30 +0200] rev 44338
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
(0)
-30000
-10000
-3000
-1000
-300
-100
-30
-10
-8
+8
+10
+30
+100
+300
+1000
+3000
+10000
+30000
tip