Wed, 27 Feb 2013 16:27:44 +0100 discontinued obsolete header "files" -- these are loaded explicitly after exploring dependencies;
wenzelm [Wed, 27 Feb 2013 16:27:44 +0100] rev 51294
discontinued obsolete header "files" -- these are loaded explicitly after exploring dependencies;
Wed, 27 Feb 2013 12:45:19 +0100 discontinued obsolete 'uses' within theory header;
wenzelm [Wed, 27 Feb 2013 12:45:19 +0100] rev 51293
discontinued obsolete 'uses' within theory header;
Wed, 27 Feb 2013 13:48:15 +0100 use lemma from Big_Operators
Andreas Lochbihler [Wed, 27 Feb 2013 13:48:15 +0100] rev 51292
use lemma from Big_Operators
Wed, 27 Feb 2013 13:44:19 +0100 add inclusion/exclusion lemma
Andreas Lochbihler [Wed, 27 Feb 2013 13:44:19 +0100] rev 51291
add inclusion/exclusion lemma
Wed, 27 Feb 2013 13:43:04 +0100 added lemma
Andreas Lochbihler [Wed, 27 Feb 2013 13:43:04 +0100] rev 51290
added lemma
Wed, 27 Feb 2013 10:33:45 +0100 merged
Andreas Lochbihler [Wed, 27 Feb 2013 10:33:45 +0100] rev 51289
merged
Wed, 27 Feb 2013 10:33:30 +0100 add wellorder instance for Numeral_Type (suggested by Jesus Aransay)
Andreas Lochbihler [Wed, 27 Feb 2013 10:33:30 +0100] rev 51288
add wellorder instance for Numeral_Type (suggested by Jesus Aransay)
Tue, 26 Feb 2013 20:11:11 +0100 updated Toplevel.command_exception;
wenzelm [Tue, 26 Feb 2013 20:11:11 +0100] rev 51287
updated Toplevel.command_exception;
Tue, 26 Feb 2013 20:09:25 +0100 tuned;
wenzelm [Tue, 26 Feb 2013 20:09:25 +0100] rev 51286
tuned;
Tue, 26 Feb 2013 19:58:27 +0100 tuned signature;
wenzelm [Tue, 26 Feb 2013 19:58:27 +0100] rev 51285
tuned signature;
Tue, 26 Feb 2013 19:44:26 +0100 fork diagnostic commands (theory loader and PIDE interaction);
wenzelm [Tue, 26 Feb 2013 19:44:26 +0100] rev 51284
fork diagnostic commands (theory loader and PIDE interaction); explicit id for load_thy, for more robust Goal.fork accounting and commit for each theory -- NB: use_thys nodes become subject to Position.is_reported like PIDE document transactions; clarified Toplevel.command_exception vs. Toplevel.command_errors;
Tue, 26 Feb 2013 13:38:34 +0100 disallow shutdown from worker, which would lead to deadlock since the scheduler cannot terminate;
wenzelm [Tue, 26 Feb 2013 13:38:34 +0100] rev 51283
disallow shutdown from worker, which would lead to deadlock since the scheduler cannot terminate;
Tue, 26 Feb 2013 13:27:24 +0100 tuned 2464ba6e6fc9 -- NB: approximative_id is NONE for PIDE document transactions;
wenzelm [Tue, 26 Feb 2013 13:27:24 +0100] rev 51282
tuned 2464ba6e6fc9 -- NB: approximative_id is NONE for PIDE document transactions;
Tue, 26 Feb 2013 13:05:48 +0100 signal work_available should be sufficient to initiate daisy-chained workers, and lead to separate broadcast work_finished eventually -- NB: broadcasting all worker threads tends to burn parallel CPU cycles;
wenzelm [Tue, 26 Feb 2013 13:05:48 +0100] rev 51281
signal work_available should be sufficient to initiate daisy-chained workers, and lead to separate broadcast work_finished eventually -- NB: broadcasting all worker threads tends to burn parallel CPU cycles;
Tue, 26 Feb 2013 12:50:52 +0100 less eventful shutdown: merely wait for scheduler to terminate;
wenzelm [Tue, 26 Feb 2013 12:50:52 +0100] rev 51280
less eventful shutdown: merely wait for scheduler to terminate;
Tue, 26 Feb 2013 12:46:47 +0100 tuned messages;
wenzelm [Tue, 26 Feb 2013 12:46:47 +0100] rev 51279
tuned messages;
Tue, 26 Feb 2013 11:57:19 +0100 tuned;
wenzelm [Tue, 26 Feb 2013 11:57:19 +0100] rev 51278
tuned;
Mon, 25 Feb 2013 20:55:48 +0100 merged;
wenzelm [Mon, 25 Feb 2013 20:55:48 +0100] rev 51277
merged;
Mon, 25 Feb 2013 17:47:32 +0100 more explicit Goal.shutdown_futures;
wenzelm [Mon, 25 Feb 2013 17:47:32 +0100] rev 51276
more explicit Goal.shutdown_futures;
Mon, 25 Feb 2013 13:31:02 +0100 reconsider 'export_code' as "thy_decl" command due to its global side-effect on the file-system;
wenzelm [Mon, 25 Feb 2013 13:31:02 +0100] rev 51275
reconsider 'export_code' as "thy_decl" command due to its global side-effect on the file-system;
Mon, 25 Feb 2013 13:29:19 +0100 discontinued pointless command category "thy_schematic_goal" -- this is checked dynamically;
wenzelm [Mon, 25 Feb 2013 13:29:19 +0100] rev 51274
discontinued pointless command category "thy_schematic_goal" -- this is checked dynamically;
Mon, 25 Feb 2013 12:52:27 +0100 clarified Toplevel.element_result: scheduling policies happen here;
wenzelm [Mon, 25 Feb 2013 12:52:27 +0100] rev 51273
clarified Toplevel.element_result: scheduling policies happen here; tuned;
Mon, 25 Feb 2013 12:17:50 +0100 prefer stateless 'ML_val' for tests;
wenzelm [Mon, 25 Feb 2013 12:17:50 +0100] rev 51272
prefer stateless 'ML_val' for tests;
Mon, 25 Feb 2013 12:17:11 +0100 tuned comment;
wenzelm [Mon, 25 Feb 2013 12:17:11 +0100] rev 51271
tuned comment;
Mon, 25 Feb 2013 11:07:02 +0100 reconsider 'pretty_setmargin' as "control" command (instead of "diag") -- it is stateful and Proof General legacy;
wenzelm [Mon, 25 Feb 2013 11:07:02 +0100] rev 51270
reconsider 'pretty_setmargin' as "control" command (instead of "diag") -- it is stateful and Proof General legacy;
Mon, 25 Feb 2013 10:50:52 +0100 merged;
wenzelm [Mon, 25 Feb 2013 10:50:52 +0100] rev 51269
merged;
Sun, 24 Feb 2013 17:29:55 +0100 simplified Outer_Syntax.read_span: internalized Toplevel.is_ignored;
wenzelm [Sun, 24 Feb 2013 17:29:55 +0100] rev 51268
simplified Outer_Syntax.read_span: internalized Toplevel.is_ignored; eliminated separate Outer_Syntax.read_element;
Sun, 24 Feb 2013 14:14:07 +0100 tuned;
wenzelm [Sun, 24 Feb 2013 14:14:07 +0100] rev 51267
tuned;
Sun, 24 Feb 2013 14:11:51 +0100 unified Command.is_proper in ML with Scala (see also 123be08eed88);
wenzelm [Sun, 24 Feb 2013 14:11:51 +0100] rev 51266
unified Command.is_proper in ML with Scala (see also 123be08eed88);
Mon, 25 Feb 2013 10:18:33 +0100 tuned order of modules;
wenzelm [Mon, 25 Feb 2013 10:18:33 +0100] rev 51265
tuned order of modules;
Mon, 25 Feb 2013 20:11:42 +0100 fixed document;
wenzelm [Mon, 25 Feb 2013 20:11:42 +0100] rev 51264
fixed document;
Sun, 24 Feb 2013 20:29:13 +0100 turned example into library for comparing growth of functions
haftmann [Sun, 24 Feb 2013 20:29:13 +0100] rev 51263
turned example into library for comparing growth of functions
Sun, 24 Feb 2013 20:18:32 +0100 corrected reference
haftmann [Sun, 24 Feb 2013 20:18:32 +0100] rev 51262
corrected reference
Sun, 24 Feb 2013 18:30:35 +0100 improved orderings
nipkow [Sun, 24 Feb 2013 18:30:35 +0100] rev 51261
improved orderings
Sun, 24 Feb 2013 15:49:07 +0100 tuned agressiveness of isar compression
smolkas [Sun, 24 Feb 2013 15:49:07 +0100] rev 51260
tuned agressiveness of isar compression
Sun, 24 Feb 2013 13:46:14 +1100 eliminated isize in favour of size + type coercion
kleing [Sun, 24 Feb 2013 13:46:14 +1100] rev 51259
eliminated isize in favour of size + type coercion
Sat, 23 Feb 2013 22:00:12 +0100 make SML/NJ happy;
wenzelm [Sat, 23 Feb 2013 22:00:12 +0100] rev 51258
make SML/NJ happy;
Sat, 23 Feb 2013 21:07:44 +0100 basic setup for appbundler-1.0 for Mac OS X and Java 7;
wenzelm [Sat, 23 Feb 2013 21:07:44 +0100] rev 51257
basic setup for appbundler-1.0 for Mac OS X and Java 7;
Sat, 23 Feb 2013 17:47:51 +0100 more robust handling of repeated interrupts while terminating managed process;
wenzelm [Sat, 23 Feb 2013 17:47:51 +0100] rev 51256
more robust handling of repeated interrupts while terminating managed process; NB: InterruptedException should have interrupted status cleared already;
Sat, 23 Feb 2013 17:12:48 +0100 more friendly message for spurious InterruptedException, which might still occur due to JVM oddities;
wenzelm [Sat, 23 Feb 2013 17:12:48 +0100] rev 51255
more friendly message for spurious InterruptedException, which might still occur due to JVM oddities;
Sat, 23 Feb 2013 15:08:53 +0100 more explicit GUI components for dynamic actions;
wenzelm [Sat, 23 Feb 2013 15:08:53 +0100] rev 51254
more explicit GUI components for dynamic actions;
Sat, 23 Feb 2013 14:16:07 +0100 clarified Progress.stopped: rising edge only;
wenzelm [Sat, 23 Feb 2013 14:16:07 +0100] rev 51253
clarified Progress.stopped: rising edge only; also cancel jobs that have not been considered yet;
Sat, 23 Feb 2013 12:55:59 +0100 more explicit console interrupt handling;
wenzelm [Sat, 23 Feb 2013 12:55:59 +0100] rev 51252
more explicit console interrupt handling;
Sat, 23 Feb 2013 12:28:18 +0100 more permissive File.read_lines, which is relevant for Managed_Process join/kill;
wenzelm [Sat, 23 Feb 2013 12:28:18 +0100] rev 51251
more permissive File.read_lines, which is relevant for Managed_Process join/kill;
Sat, 23 Feb 2013 11:27:45 +0100 support for POSIX interrupts (bypassed on Windows);
wenzelm [Sat, 23 Feb 2013 11:27:45 +0100] rev 51250
support for POSIX interrupts (bypassed on Windows);
Fri, 22 Feb 2013 20:25:51 +0100 merged
traytel [Fri, 22 Feb 2013 20:25:51 +0100] rev 51249
merged
Fri, 22 Feb 2013 13:39:47 +0100 tuned error messages
traytel [Fri, 22 Feb 2013 13:39:47 +0100] rev 51248
tuned error messages
Fri, 22 Feb 2013 13:38:10 +0100 Coercion_Examples defines required coercions itself (no Complex_Main needed)
traytel [Fri, 22 Feb 2013 13:38:10 +0100] rev 51247
Coercion_Examples defines required coercions itself (no Complex_Main needed)
Fri, 22 Feb 2013 13:36:31 +0100 apply unifying substitution before building the constraint graph
traytel [Fri, 22 Feb 2013 13:36:31 +0100] rev 51246
apply unifying substitution before building the constraint graph
Fri, 22 Feb 2013 20:12:53 +0100 more abstract intervals
nipkow [Fri, 22 Feb 2013 20:12:53 +0100] rev 51245
more abstract intervals
Fri, 22 Feb 2013 17:24:09 +0100 more robust load_timings: ignore XML.Decode errors as well;
wenzelm [Fri, 22 Feb 2013 17:24:09 +0100] rev 51244
more robust load_timings: ignore XML.Decode errors as well;
Fri, 22 Feb 2013 17:02:16 +0100 make SML/NJ happy;
wenzelm [Fri, 22 Feb 2013 17:02:16 +0100] rev 51243
make SML/NJ happy;
Fri, 22 Feb 2013 17:02:00 +0100 identify exceptions more robustly, to allow SML/NJ report toplevel errors without crash;
wenzelm [Fri, 22 Feb 2013 17:02:00 +0100] rev 51242
identify exceptions more robustly, to allow SML/NJ report toplevel errors without crash;
Fri, 22 Feb 2013 16:52:10 +0100 make SML/NJ happy;
wenzelm [Fri, 22 Feb 2013 16:52:10 +0100] rev 51241
make SML/NJ happy;
Fri, 22 Feb 2013 14:39:12 +0100 updated headers;
wenzelm [Fri, 22 Feb 2013 14:39:12 +0100] rev 51240
updated headers;
Fri, 22 Feb 2013 14:38:52 +0100 eliminated hard tabs;
wenzelm [Fri, 22 Feb 2013 14:38:52 +0100] rev 51239
eliminated hard tabs;
Fri, 22 Feb 2013 14:25:52 +0100 discontinued obsolete src/HOL/IsaMakefile;
wenzelm [Fri, 22 Feb 2013 14:25:52 +0100] rev 51238
discontinued obsolete src/HOL/IsaMakefile;
Thu, 21 Feb 2013 18:27:28 +0100 merged
wenzelm [Thu, 21 Feb 2013 18:27:28 +0100] rev 51237
merged
Thu, 21 Feb 2013 18:21:40 +0100 more explicit session dependency, for improved parallel performance of HOL-UNITY test session -- NB: separate 'theories' sections are sequential;
wenzelm [Thu, 21 Feb 2013 18:21:40 +0100] rev 51236
more explicit session dependency, for improved parallel performance of HOL-UNITY test session -- NB: separate 'theories' sections are sequential;
Thu, 21 Feb 2013 16:00:48 +0100 merged
wenzelm [Thu, 21 Feb 2013 16:00:48 +0100] rev 51235
merged
Thu, 21 Feb 2013 15:35:09 +0100 removed obsolete tags;
wenzelm [Thu, 21 Feb 2013 15:35:09 +0100] rev 51234
removed obsolete tags;
Thu, 21 Feb 2013 10:52:14 +0100 highest priority for proofs with unknown / very short timing -- recover original scheduling with parallel_proofs_reuse_timing = false;
wenzelm [Thu, 21 Feb 2013 10:52:14 +0100] rev 51233
highest priority for proofs with unknown / very short timing -- recover original scheduling with parallel_proofs_reuse_timing = false;
Thu, 21 Feb 2013 16:36:19 +0100 tuned misleading message
blanchet [Thu, 21 Feb 2013 16:36:19 +0100] rev 51232
tuned misleading message
Thu, 21 Feb 2013 15:10:04 +0100 merged
wenzelm [Thu, 21 Feb 2013 15:10:04 +0100] rev 51231
merged
Wed, 20 Feb 2013 19:57:17 +0100 option parallel_proofs_reuse_timing controls reuse of log information -- since it is not always beneficial for performance;
wenzelm [Wed, 20 Feb 2013 19:57:17 +0100] rev 51230
option parallel_proofs_reuse_timing controls reuse of log information -- since it is not always beneficial for performance;
Wed, 20 Feb 2013 18:04:44 +0100 prefer outdegree in comparison again (cf. 88c96e836ed6) -- NB: big jobs might hide behind small ones in this naive queuing scheme;
wenzelm [Wed, 20 Feb 2013 18:04:44 +0100] rev 51229
prefer outdegree in comparison again (cf. 88c96e836ed6) -- NB: big jobs might hide behind small ones in this naive queuing scheme;
Wed, 20 Feb 2013 15:22:22 +0100 more tight representation of command timing;
wenzelm [Wed, 20 Feb 2013 15:22:22 +0100] rev 51228
more tight representation of command timing; tuned signatures; tuned;
Wed, 20 Feb 2013 13:03:50 +0100 prefer comparison of session timing, if this is known already;
wenzelm [Wed, 20 Feb 2013 13:03:50 +0100] rev 51227
prefer comparison of session timing, if this is known already; some odd workarounds to prevent crashes due to TreeSet.- sometimes not deleting the element;
Wed, 20 Feb 2013 11:40:30 +0100 proper check of Proof.is_relevant (again, cf. c3e99efacb67 and df8fc0567a3d);
wenzelm [Wed, 20 Feb 2013 11:40:30 +0100] rev 51226
proper check of Proof.is_relevant (again, cf. c3e99efacb67 and df8fc0567a3d);
Wed, 20 Feb 2013 00:00:42 +0100 support nested Thy_Syntax.element;
wenzelm [Wed, 20 Feb 2013 00:00:42 +0100] rev 51225
support nested Thy_Syntax.element; more explicit Keyword.is_proof_body; tuned;
Tue, 19 Feb 2013 21:44:37 +0100 back to non-schematic 'sublocale' and 'interpretation' (despite df8fc0567a3d) for more potential parallelism;
wenzelm [Tue, 19 Feb 2013 21:44:37 +0100] rev 51224
back to non-schematic 'sublocale' and 'interpretation' (despite df8fc0567a3d) for more potential parallelism;
Tue, 19 Feb 2013 20:19:21 +0100 help JVM to cope with large symbolic structures;
wenzelm [Tue, 19 Feb 2013 20:19:21 +0100] rev 51223
help JVM to cope with large symbolic structures;
Tue, 19 Feb 2013 17:55:26 +0100 improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);
wenzelm [Tue, 19 Feb 2013 17:55:26 +0100] rev 51222
improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);
Tue, 19 Feb 2013 17:02:52 +0100 read logs from failed sessions as well;
wenzelm [Tue, 19 Feb 2013 17:02:52 +0100] rev 51221
read logs from failed sessions as well; proper output base directory (which is two steps upwards);
Tue, 19 Feb 2013 16:49:40 +0100 recover timing information from old log files;
wenzelm [Tue, 19 Feb 2013 16:49:40 +0100] rev 51220
recover timing information from old log files; use session timing for queue ordering; pass command timings to ML process (still unused);
Tue, 19 Feb 2013 14:47:57 +0100 suppress timing message in full PIDE protocol -- this is for batch build;
wenzelm [Tue, 19 Feb 2013 14:47:57 +0100] rev 51219
suppress timing message in full PIDE protocol -- this is for batch build;
Tue, 19 Feb 2013 13:57:13 +0100 support for build passing timings from Scala to ML;
wenzelm [Tue, 19 Feb 2013 13:57:13 +0100] rev 51218
support for build passing timings from Scala to ML;
Tue, 19 Feb 2013 12:58:32 +0100 support for prescient timing information within command transactions;
wenzelm [Tue, 19 Feb 2013 12:58:32 +0100] rev 51217
support for prescient timing information within command transactions;
Tue, 19 Feb 2013 10:55:11 +0100 emit command_timing properties into build log;
wenzelm [Tue, 19 Feb 2013 10:55:11 +0100] rev 51216
emit command_timing properties into build log; tuned;
Thu, 21 Feb 2013 12:22:26 +0100 generate Isar proof if Metis appears to be too slow
blanchet [Thu, 21 Feb 2013 12:22:26 +0100] rev 51215
generate Isar proof if Metis appears to be too slow
Thu, 21 Feb 2013 12:22:26 +0100 swap slices so that the last slice is more complete (for minimization)
blanchet [Thu, 21 Feb 2013 12:22:26 +0100] rev 51214
swap slices so that the last slice is more complete (for minimization)
Thu, 21 Feb 2013 12:22:26 +0100 tuning
blanchet [Thu, 21 Feb 2013 12:22:26 +0100] rev 51213
tuning
Wed, 20 Feb 2013 17:42:20 +0100 ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet [Wed, 20 Feb 2013 17:42:20 +0100] rev 51212
ensure all conjecture clauses are in the graph -- to prevent exceptions later
Wed, 20 Feb 2013 17:31:28 +0100 generalize syntax of SPASS proofs
blanchet [Wed, 20 Feb 2013 17:31:28 +0100] rev 51211
generalize syntax of SPASS proofs
Wed, 20 Feb 2013 17:15:06 +0100 tweaked hack some more
blanchet [Wed, 20 Feb 2013 17:15:06 +0100] rev 51210
tweaked hack some more
Wed, 20 Feb 2013 17:12:21 +0100 more simplifying constructors
blanchet [Wed, 20 Feb 2013 17:12:21 +0100] rev 51209
more simplifying constructors
Wed, 20 Feb 2013 17:05:24 +0100 remove needless steps from refutation graph -- these confuse the proof redirection algorithm (and are needless)
blanchet [Wed, 20 Feb 2013 17:05:24 +0100] rev 51208
remove needless steps from refutation graph -- these confuse the proof redirection algorithm (and are needless)
Wed, 20 Feb 2013 16:21:04 +0100 more precise error
blanchet [Wed, 20 Feb 2013 16:21:04 +0100] rev 51207
more precise error
Wed, 20 Feb 2013 15:43:51 +0100 improved hack
blanchet [Wed, 20 Feb 2013 15:43:51 +0100] rev 51206
improved hack
Wed, 20 Feb 2013 15:26:19 +0100 upgraded to Alt-Ergo 0.95
blanchet [Wed, 20 Feb 2013 15:26:19 +0100] rev 51205
upgraded to Alt-Ergo 0.95
Wed, 20 Feb 2013 15:12:38 +0100 don't pass chained facts directly to SMT solvers -- this breaks various invariants and is never necessary
blanchet [Wed, 20 Feb 2013 15:12:38 +0100] rev 51204
don't pass chained facts directly to SMT solvers -- this breaks various invariants and is never necessary
Wed, 20 Feb 2013 14:47:19 +0100 trust preplayed proof in Mirabelle
blanchet [Wed, 20 Feb 2013 14:47:19 +0100] rev 51203
trust preplayed proof in Mirabelle
Wed, 20 Feb 2013 14:44:00 +0100 added case taken out by mistake
blanchet [Wed, 20 Feb 2013 14:44:00 +0100] rev 51202
added case taken out by mistake
Wed, 20 Feb 2013 14:21:17 +0100 tuning (removed redundant datatype)
blanchet [Wed, 20 Feb 2013 14:21:17 +0100] rev 51201
tuning (removed redundant datatype)
Wed, 20 Feb 2013 14:10:51 +0100 minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet [Wed, 20 Feb 2013 14:10:51 +0100] rev 51200
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
Wed, 20 Feb 2013 13:04:03 +0100 honor linearization option also in the evaluation driver
blanchet [Wed, 20 Feb 2013 13:04:03 +0100] rev 51199
honor linearization option also in the evaluation driver
Wed, 20 Feb 2013 10:54:13 +0100 got rid of rump support for Vampire definitions
blanchet [Wed, 20 Feb 2013 10:54:13 +0100] rev 51198
got rid of rump support for Vampire definitions
Wed, 20 Feb 2013 10:45:23 +0100 optimize Isar output some more
blanchet [Wed, 20 Feb 2013 10:45:23 +0100] rev 51197
optimize Isar output some more
Wed, 20 Feb 2013 10:45:01 +0100 turn off more evil Vampire options to facilitate Isar proof generation
blanchet [Wed, 20 Feb 2013 10:45:01 +0100] rev 51196
turn off more evil Vampire options to facilitate Isar proof generation
Wed, 20 Feb 2013 09:58:28 +0100 fixed typo in option name
blanchet [Wed, 20 Feb 2013 09:58:28 +0100] rev 51195
fixed typo in option name
Wed, 20 Feb 2013 08:56:34 +0100 tuning
blanchet [Wed, 20 Feb 2013 08:56:34 +0100] rev 51194
tuning
Wed, 20 Feb 2013 08:44:24 +0100 use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51193
use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
Wed, 20 Feb 2013 08:44:24 +0100 slacker comparison for Skolems, to avoid trivial equations
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51192
slacker comparison for Skolems, to avoid trivial equations
Wed, 20 Feb 2013 08:44:24 +0100 auto-minimizer should respect "isar_proofs = true"
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51191
auto-minimizer should respect "isar_proofs = true"
Wed, 20 Feb 2013 08:44:24 +0100 made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51190
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
Wed, 20 Feb 2013 08:44:24 +0100 alias for people like me
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51189
alias for people like me
Tue, 19 Feb 2013 19:44:10 +0100 dropped spurious left-over from 0a2371e7ced3
haftmann [Tue, 19 Feb 2013 19:44:10 +0100] rev 51188
dropped spurious left-over from 0a2371e7ced3
Tue, 19 Feb 2013 17:01:06 +0100 avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet [Tue, 19 Feb 2013 17:01:06 +0100] rev 51187
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
Tue, 19 Feb 2013 15:37:42 +0100 interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
blanchet [Tue, 19 Feb 2013 15:37:42 +0100] rev 51186
interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
Tue, 19 Feb 2013 15:03:36 +0100 delete also predicates on relations when hiding an implementation of an abstract type
kuncar [Tue, 19 Feb 2013 15:03:36 +0100] rev 51185
delete also predicates on relations when hiding an implementation of an abstract type
Tue, 19 Feb 2013 13:37:07 +0100 reintroduced crucial sorting accidentally lost in 962190eab40d
blanchet [Tue, 19 Feb 2013 13:37:07 +0100] rev 51184
reintroduced crucial sorting accidentally lost in 962190eab40d
Tue, 19 Feb 2013 13:27:33 +0100 compile
blanchet [Tue, 19 Feb 2013 13:27:33 +0100] rev 51183
compile
Tue, 19 Feb 2013 13:21:49 +0100 provide two modes for MaSh driver: linearized or real visibility
blanchet [Tue, 19 Feb 2013 13:21:49 +0100] rev 51182
provide two modes for MaSh driver: linearized or real visibility
Mon, 18 Feb 2013 18:34:55 +0100 implement (more) accurate computation of parents
blanchet [Mon, 18 Feb 2013 18:34:55 +0100] rev 51181
implement (more) accurate computation of parents
Mon, 18 Feb 2013 18:34:54 +0100 tuning
blanchet [Mon, 18 Feb 2013 18:34:54 +0100] rev 51180
tuning
Mon, 18 Feb 2013 12:16:27 +0100 split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas [Mon, 18 Feb 2013 12:16:27 +0100] rev 51179
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
Mon, 18 Feb 2013 12:16:02 +0100 simplified byline, isar_qualifier
smolkas [Mon, 18 Feb 2013 12:16:02 +0100] rev 51178
simplified byline, isar_qualifier
Mon, 18 Feb 2013 11:33:43 +0100 tuned code: factored out parent computation
blanchet [Mon, 18 Feb 2013 11:33:43 +0100] rev 51177
tuned code: factored out parent computation
Mon, 18 Feb 2013 10:43:36 +0100 tuned code
blanchet [Mon, 18 Feb 2013 10:43:36 +0100] rev 51176
tuned code
Mon, 18 Feb 2013 08:52:23 +0100 simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Andreas Lochbihler [Mon, 18 Feb 2013 08:52:23 +0100] rev 51175
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
(0) -30000 -10000 -3000 -1000 -120 +120 +1000 +3000 +10000 +30000 tip