Thu, 18 Oct 2012 13:53:02 +0200 more uniform group for map_future, which is relevant for cancel in worker_task vs. future_job -- prefer peer group despite 81d03a29980c;
wenzelm [Thu, 18 Oct 2012 13:53:02 +0200] rev 49910
more uniform group for map_future, which is relevant for cancel in worker_task vs. future_job -- prefer peer group despite 81d03a29980c;
Thu, 18 Oct 2012 13:26:49 +0200 tuned message;
wenzelm [Thu, 18 Oct 2012 13:26:49 +0200] rev 49909
tuned message;
Thu, 18 Oct 2012 12:47:30 +0200 tuned comment;
wenzelm [Thu, 18 Oct 2012 12:47:30 +0200] rev 49908
tuned comment;
Thu, 18 Oct 2012 12:26:30 +0200 avoid spurious "bad" markup for show/test_proof;
wenzelm [Thu, 18 Oct 2012 12:26:30 +0200] rev 49907
avoid spurious "bad" markup for show/test_proof; tuned;
Thu, 18 Oct 2012 12:00:27 +0200 more official Future.terminate;
wenzelm [Thu, 18 Oct 2012 12:00:27 +0200] rev 49906
more official Future.terminate; tuned signature;
Thu, 18 Oct 2012 09:19:37 +0200 simp results for simplification results of Inf/Sup expressions on bool;
haftmann [Thu, 18 Oct 2012 09:19:37 +0200] rev 49905
simp results for simplification results of Inf/Sup expressions on bool; tuned proofs
Thu, 18 Oct 2012 09:17:00 +0200 no sort constraints on datatype constructors in internal bookkeeping
haftmann [Thu, 18 Oct 2012 09:17:00 +0200] rev 49904
no sort constraints on datatype constructors in internal bookkeeping
Wed, 17 Oct 2012 22:57:28 +0200 HOL-BNF-Examples is sequential for now, due to spurious interrupts (again);
wenzelm [Wed, 17 Oct 2012 22:57:28 +0200] rev 49903
HOL-BNF-Examples is sequential for now, due to spurious interrupts (again);
Wed, 17 Oct 2012 22:45:40 +0200 merged
wenzelm [Wed, 17 Oct 2012 22:45:40 +0200] rev 49902
merged
Wed, 17 Oct 2012 15:25:52 +0200 comprehension conversion reuses suggested names for bound variables instead of invented fresh ones; tuned tactic
bulwahn [Wed, 17 Oct 2012 15:25:52 +0200] rev 49901
comprehension conversion reuses suggested names for bound variables instead of invented fresh ones; tuned tactic
Wed, 17 Oct 2012 14:13:57 +0200 checking for bound variables in the set expression; handling negation more generally
bulwahn [Wed, 17 Oct 2012 14:13:57 +0200] rev 49900
checking for bound variables in the set expression; handling negation more generally
Wed, 17 Oct 2012 14:13:57 +0200 set_comprehension_pointfree simproc now handles the complicated test case; tuned
bulwahn [Wed, 17 Oct 2012 14:13:57 +0200] rev 49899
set_comprehension_pointfree simproc now handles the complicated test case; tuned
Wed, 17 Oct 2012 14:13:57 +0200 refined conversion to only react on proper set comprehensions; tuned
bulwahn [Wed, 17 Oct 2012 14:13:57 +0200] rev 49898
refined conversion to only react on proper set comprehensions; tuned
Wed, 17 Oct 2012 14:13:57 +0200 moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
bulwahn [Wed, 17 Oct 2012 14:13:57 +0200] rev 49897
moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)
Wed, 17 Oct 2012 14:13:57 +0200 employing a preprocessing conversion that rewrites {(x1, ..., xn). P x1 ... xn} to {(x1, ..., xn) | x1 ... xn. P x1 ... xn} in set_comprehension_pointfree simproc
bulwahn [Wed, 17 Oct 2012 14:13:57 +0200] rev 49896
employing a preprocessing conversion that rewrites {(x1, ..., xn). P x1 ... xn} to {(x1, ..., xn) | x1 ... xn. P x1 ... xn} in set_comprehension_pointfree simproc
(0) -30000 -10000 -3000 -1000 -300 -100 -15 +15 +100 +300 +1000 +3000 +10000 +30000 tip