Coercion_Examples defines required coercions itself (no Complex_Main needed)

apply unifying substitution before building the constraint graph

more abstract intervals

more robust load_timings: ignore XML.Decode errors as well;

make SML/NJ happy;

identify exceptions more robustly, to allow SML/NJ report toplevel errors without crash;

make SML/NJ happy;

updated headers;

eliminated hard tabs;

discontinued obsolete src/HOL/IsaMakefile;

merged

more explicit session dependency, for improved parallel performance of HOL-UNITY test session -- NB: separate 'theories' sections are sequential;

merged

removed obsolete tags;

highest priority for proofs with unknown / very short timing -- recover original scheduling with parallel_proofs_reuse_timing = false;

tuned misleading message

merged

option parallel_proofs_reuse_timing controls reuse of log information -- since it is not always beneficial for performance;

prefer outdegree in comparison again (cf. 88c96e836ed6) -- NB: big jobs might hide behind small ones in this naive queuing scheme;

more tight representation of command timing; tuned signatures; tuned;

prefer comparison of session timing, if this is known already; some odd workarounds to prevent crashes due to TreeSet.- sometimes not deleting the element;

proper check of Proof.is_relevant (again, cf. c3e99efacb67 and df8fc0567a3d);

support nested Thy_Syntax.element; more explicit Keyword.is_proof_body; tuned;

back to non-schematic 'sublocale' and 'interpretation' (despite df8fc0567a3d) for more potential parallelism;

help JVM to cope with large symbolic structures;

improved scheduling of forked proofs, based on elapsed time estimate (from last run via session log file);

read logs from failed sessions as well; proper output base directory (which is two steps upwards);

recover timing information from old log files; use session timing for queue ordering; pass command timings to ML process (still unused);

suppress timing message in full PIDE protocol -- this is for batch build;

support for build passing timings from Scala to ML;