Thu, 03 Apr 2014 17:26:45 +0100 Merge
paulson <lp15@cam.ac.uk> [Thu, 03 Apr 2014 17:26:45 +0100] rev 56384
Merge
Thu, 03 Apr 2014 17:26:04 +0100 Cleaned up some messy proofs
paulson <lp15@cam.ac.uk> [Thu, 03 Apr 2014 17:26:04 +0100] rev 56383
Cleaned up some messy proofs
Thu, 03 Apr 2014 18:24:08 +0200 fix #0556204bc230
hoelzl [Thu, 03 Apr 2014 18:24:08 +0200] rev 56382
fix #0556204bc230
Thu, 03 Apr 2014 17:56:08 +0200 merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl [Thu, 03 Apr 2014 17:56:08 +0200] rev 56381
merged DERIV_intros, has_derivative_intros into derivative_intros
Thu, 03 Apr 2014 17:16:02 +0200 don't pass Vampire option that doesn't exist anymore (and that wasn't strictly necessary with older Vampires)
blanchet [Thu, 03 Apr 2014 17:16:02 +0200] rev 56380
don't pass Vampire option that doesn't exist anymore (and that wasn't strictly necessary with older Vampires)
Thu, 03 Apr 2014 17:00:14 +0200 use Alt-Ergo 0.95.2, the latest and greatest version
blanchet [Thu, 03 Apr 2014 17:00:14 +0200] rev 56379
use Alt-Ergo 0.95.2, the latest and greatest version
Thu, 03 Apr 2014 16:57:19 +0200 updated Z3 TPTP to 4.3.1+
blanchet [Thu, 03 Apr 2014 16:57:19 +0200] rev 56378
updated Z3 TPTP to 4.3.1+
Thu, 03 Apr 2014 13:29:58 +0200 updated Why3 version in docs
blanchet [Thu, 03 Apr 2014 13:29:58 +0200] rev 56377
updated Why3 version in docs
Thu, 03 Apr 2014 10:51:24 +0200 added same idiomatic handling of namings for Ctr_Sugar/BNF-related interpretation hooks as for typedef and (old-style) datatypes
blanchet [Thu, 03 Apr 2014 10:51:24 +0200] rev 56376
added same idiomatic handling of namings for Ctr_Sugar/BNF-related interpretation hooks as for typedef and (old-style) datatypes
Thu, 03 Apr 2014 10:51:22 +0200 use same idiom as used for datatype 'size' function to name constants and theorems emerging from various type interpretations -- reduces the chances of name clashes on theory merges
blanchet [Thu, 03 Apr 2014 10:51:22 +0200] rev 56375
use same idiom as used for datatype 'size' function to name constants and theorems emerging from various type interpretations -- reduces the chances of name clashes on theory merges
Thu, 03 Apr 2014 10:51:20 +0200 removed clone (cf. 300f613060b0)
blanchet [Thu, 03 Apr 2014 10:51:20 +0200] rev 56374
removed clone (cf. 300f613060b0)
Wed, 02 Apr 2014 20:41:44 +0200 tuned signature -- more explicit iterator terminology;
wenzelm [Wed, 02 Apr 2014 20:41:44 +0200] rev 56373
tuned signature -- more explicit iterator terminology;
Wed, 02 Apr 2014 20:22:12 +0200 more explicit iterator terminology, in accordance to Scala 2.8 library;
wenzelm [Wed, 02 Apr 2014 20:22:12 +0200] rev 56372
more explicit iterator terminology, in accordance to Scala 2.8 library; clarified Graph.keys_iterator vs. Graph.keys, with subtle change of semantics; tuned output;
Wed, 02 Apr 2014 18:35:07 +0200 extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl [Wed, 02 Apr 2014 18:35:07 +0200] rev 56371
extend continuous_intros; remove continuous_on_intros and isCont_intros
Wed, 02 Apr 2014 18:35:02 +0200 reorder Complex_Analysis_Basics; rename DD to deriv
hoelzl [Wed, 02 Apr 2014 18:35:02 +0200] rev 56370
reorder Complex_Analysis_Basics; rename DD to deriv
Wed, 02 Apr 2014 18:35:01 +0200 moved generic theorems from Complex_Analysis_Basic; fixed some theorem names
hoelzl [Wed, 02 Apr 2014 18:35:01 +0200] rev 56369
moved generic theorems from Complex_Analysis_Basic; fixed some theorem names
Wed, 02 Apr 2014 17:47:56 +0200 merged;
wenzelm [Wed, 02 Apr 2014 17:47:56 +0200] rev 56368
merged;
Wed, 02 Apr 2014 17:39:47 +0200 tuned rendering;
wenzelm [Wed, 02 Apr 2014 17:39:47 +0200] rev 56367
tuned rendering;
Wed, 02 Apr 2014 16:45:31 +0100 new theorem about zero limits
paulson <lp15@cam.ac.uk> [Wed, 02 Apr 2014 16:45:31 +0100] rev 56366
new theorem about zero limits
Wed, 02 Apr 2014 16:34:37 +0100 New theorems for extracting quotients
paulson <lp15@cam.ac.uk> [Wed, 02 Apr 2014 16:34:37 +0100] rev 56365
New theorems for extracting quotients
Wed, 02 Apr 2014 17:11:44 +0200 more contributors;
wenzelm [Wed, 02 Apr 2014 17:11:44 +0200] rev 56364
more contributors;
Tue, 01 Apr 2014 14:24:28 +0200 document value generation for quickcheck's testers
Andreas Lochbihler [Tue, 01 Apr 2014 14:24:28 +0200] rev 56363
document value generation for quickcheck's testers
Wed, 02 Apr 2014 13:53:32 +0200 tuned whitespace;
wenzelm [Wed, 02 Apr 2014 13:53:32 +0200] rev 56362
tuned whitespace;
Wed, 02 Apr 2014 13:54:50 +0200 suppress slightly odd completion of "simp";
wenzelm [Wed, 02 Apr 2014 13:54:50 +0200] rev 56361
suppress slightly odd completion of "simp";
Wed, 02 Apr 2014 13:03:01 +0200 observe extra line spacing for output as well;
wenzelm [Wed, 02 Apr 2014 13:03:01 +0200] rev 56360
observe extra line spacing for output as well;
Wed, 02 Apr 2014 12:26:11 +0200 persistent protocol_status, to improve performance of node_status a little;
wenzelm [Wed, 02 Apr 2014 12:26:11 +0200] rev 56359
persistent protocol_status, to improve performance of node_status a little;
Wed, 02 Apr 2014 11:55:37 +0200 more uniform painting of caret, which also improves visibility in invisible state;
wenzelm [Wed, 02 Apr 2014 11:55:37 +0200] rev 56358
more uniform painting of caret, which also improves visibility in invisible state;
Wed, 02 Apr 2014 11:08:16 +0200 tuned rendering -- visual indication of the status range, to make more clear when information might is out of view;
wenzelm [Wed, 02 Apr 2014 11:08:16 +0200] rev 56357
tuned rendering -- visual indication of the status range, to make more clear when information might is out of view;
Tue, 01 Apr 2014 23:04:22 +0200 tuned for-comprehensions -- less structure mapping;
wenzelm [Tue, 01 Apr 2014 23:04:22 +0200] rev 56356
tuned for-comprehensions -- less structure mapping;
Tue, 01 Apr 2014 22:25:01 +0200 some rephrasing to ensure that this becomes cheap "foreach" and not expensive "map" (cf. 0fc032898b05);
wenzelm [Tue, 01 Apr 2014 22:25:01 +0200] rev 56355
some rephrasing to ensure that this becomes cheap "foreach" and not expensive "map" (cf. 0fc032898b05);
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 tip