Fri, 19 Aug 2011 23:25:47 +0200 maintain recent future proofs at transaction boundaries;
wenzelm [Fri, 19 Aug 2011 23:25:47 +0200] rev 44304
maintain recent future proofs at transaction boundaries;
Fri, 19 Aug 2011 21:40:52 +0200 incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
wenzelm [Fri, 19 Aug 2011 21:40:52 +0200] rev 44303
incremental Proofterm.join_body, with join_thms step in fulfill_norm_proof -- avoid full graph traversal of former Proofterm.join_bodies;
Fri, 19 Aug 2011 18:01:23 +0200 tuned;
wenzelm [Fri, 19 Aug 2011 18:01:23 +0200] rev 44302
tuned;
Fri, 19 Aug 2011 17:39:37 +0200 tuned signature (again);
wenzelm [Fri, 19 Aug 2011 17:39:37 +0200] rev 44301
tuned signature (again); tuned;
Fri, 19 Aug 2011 16:13:26 +0200 tuned signature -- treat structure Task_Queue as private to implementation;
wenzelm [Fri, 19 Aug 2011 16:13:26 +0200] rev 44300
tuned signature -- treat structure Task_Queue as private to implementation;
Fri, 19 Aug 2011 15:56:26 +0200 refined Future.cancel: explicit future allows to join actual cancellation;
wenzelm [Fri, 19 Aug 2011 15:56:26 +0200] rev 44299
refined Future.cancel: explicit future allows to join actual cancellation; Document.cancel_execution: join nested future groups as well;
Fri, 19 Aug 2011 14:01:20 +0200 Future.promise: explicit abort operation (like uninterruptible future job);
wenzelm [Fri, 19 Aug 2011 14:01:20 +0200] rev 44298
Future.promise: explicit abort operation (like uninterruptible future job); explicit cancel_scala message -- still unused;
Fri, 19 Aug 2011 13:55:32 +0200 editable raw text areas: allow user to clear content;
wenzelm [Fri, 19 Aug 2011 13:55:32 +0200] rev 44297
editable raw text areas: allow user to clear content;
Fri, 19 Aug 2011 13:32:27 +0200 more robust use of set_exn_serial, which is based on PolyML.raiseWithLocation internally;
wenzelm [Fri, 19 Aug 2011 13:32:27 +0200] rev 44296
more robust use of set_exn_serial, which is based on PolyML.raiseWithLocation internally;
Fri, 19 Aug 2011 12:51:14 +0200 more focused use of Multithreading.interrupted: retain interrupts within task group boundary, without loss of information;
wenzelm [Fri, 19 Aug 2011 12:51:14 +0200] rev 44295
more focused use of Multithreading.interrupted: retain interrupts within task group boundary, without loss of information;
Fri, 19 Aug 2011 12:03:44 +0200 clarified Future.cond_forks: more uniform handling of exceptional situations;
wenzelm [Fri, 19 Aug 2011 12:03:44 +0200] rev 44294
clarified Future.cond_forks: more uniform handling of exceptional situations;
Fri, 19 Aug 2011 17:05:10 +0900 Quotient_Examples: Cset, List_Cset: Lift Inf and Sup directly.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 19 Aug 2011 17:05:10 +0900] rev 44293
Quotient_Examples: Cset, List_Cset: Lift Inf and Sup directly.
Thu, 18 Aug 2011 22:32:19 -0700 merged
huffman [Thu, 18 Aug 2011 22:32:19 -0700] rev 44292
merged
Thu, 18 Aug 2011 22:31:52 -0700 define complex exponential 'expi' as abbreviation for 'exp'
huffman [Thu, 18 Aug 2011 22:31:52 -0700] rev 44291
define complex exponential 'expi' as abbreviation for 'exp'
Thu, 18 Aug 2011 21:23:31 -0700 remove more bounded_linear locale interpretations (cf. f0de18b62d63)
huffman [Thu, 18 Aug 2011 21:23:31 -0700] rev 44290
remove more bounded_linear locale interpretations (cf. f0de18b62d63)
Thu, 18 Aug 2011 19:53:03 -0700 optimize some proofs
huffman [Thu, 18 Aug 2011 19:53:03 -0700] rev 44289
optimize some proofs
Thu, 18 Aug 2011 18:10:23 -0700 add Multivariate_Analysis dependencies
huffman [Thu, 18 Aug 2011 18:10:23 -0700] rev 44288
add Multivariate_Analysis dependencies
Thu, 18 Aug 2011 18:08:43 -0700 import Library/Sum_of_Squares instead of reloading positivstellensatz.ML
huffman [Thu, 18 Aug 2011 18:08:43 -0700] rev 44287
import Library/Sum_of_Squares instead of reloading positivstellensatz.ML
Thu, 18 Aug 2011 17:32:02 -0700 declare euclidean_component_zero[simp] at the point it is proved
huffman [Thu, 18 Aug 2011 17:32:02 -0700] rev 44286
declare euclidean_component_zero[simp] at the point it is proved
Fri, 19 Aug 2011 10:23:16 +0900 Quotient Package: Regularization: do not fail if no progress is made, leave the subgoal to the user. Injection: try assumptions before extensionality to avoid looping.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 19 Aug 2011 10:23:16 +0900] rev 44285
Quotient Package: Regularization: do not fail if no progress is made, leave the subgoal to the user. Injection: try assumptions before extensionality to avoid looping.
Thu, 18 Aug 2011 23:43:22 +0200 merged;
wenzelm [Thu, 18 Aug 2011 23:43:22 +0200] rev 44284
merged;
Thu, 18 Aug 2011 14:08:39 -0700 merged
huffman [Thu, 18 Aug 2011 14:08:39 -0700] rev 44283
merged
Thu, 18 Aug 2011 13:36:58 -0700 remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman [Thu, 18 Aug 2011 13:36:58 -0700] rev 44282
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
Thu, 18 Aug 2011 22:50:28 +0200 merged
haftmann [Thu, 18 Aug 2011 22:50:28 +0200] rev 44281
merged
Thu, 18 Aug 2011 22:50:17 +0200 merged
haftmann [Thu, 18 Aug 2011 22:50:17 +0200] rev 44280
merged
Thu, 18 Aug 2011 14:01:06 +0200 avoid duplicated simp add option
haftmann [Thu, 18 Aug 2011 14:01:06 +0200] rev 44279
avoid duplicated simp add option
Thu, 18 Aug 2011 13:55:26 +0200 observe distinction between sets and predicates more properly
haftmann [Thu, 18 Aug 2011 13:55:26 +0200] rev 44278
observe distinction between sets and predicates more properly
Thu, 18 Aug 2011 13:25:17 +0200 moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
haftmann [Thu, 18 Aug 2011 13:25:17 +0200] rev 44277
moved fundamental lemma fun_eq_iff to theory HOL; tuned whitespace
Thu, 18 Aug 2011 13:10:24 +0200 avoid case-sensitive name for example theory
haftmann [Thu, 18 Aug 2011 13:10:24 +0200] rev 44276
avoid case-sensitive name for example theory
Thu, 18 Aug 2011 17:42:35 +0200 merged
nipkow [Thu, 18 Aug 2011 17:42:35 +0200] rev 44275
merged
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 tip