prefer uniform Timing.message -- avoid assumption about sequential execution;

prefer final ADTs -- prevent ooddities;

more explicit Long_Name operations (NB: analyzing qualifiers is inherently fragile);

more standard settings -- refer to COMPONENT at most once;

clarified prems_lin_arith_tac, with subtle change of semantics: structured prems are inserted as well;

prefer cut_tac, where it is clear that the special variants cut_rules_tac or cut_facts_tac are not required;

eliminated odd comment from distant past;

updated cut_tac, without loose references to implementation manual;

updated generated file;

simplified cut_tac (cf. d549b5b0f344);

merged

avoid using constant Int.neg

reactivated Find_Unused_Assms_Examples to avoid untested / dead stuff in the repository; moved the whole HOL-Quickcheck_Examples target from "all" to "full" for now -- it does not terminate in certain situations (to be investigated further);

merged

added lemma

converting "set [...]" to "{...}" in evaluation results

removing Find_Unused_Assms_Examples from session as it requires much time

restored accidental omission

dropped dead code

tuned structure

retain syntax here

tuned structure; dropped already existing syntax declarations

tuned syntax declarations; tuned structure

merged

marked candidates for rule declarations

include warning messages in node status;

tuned signature (in accordance with ML);

more PIDE modules;

tuned proofs;

more abstract class Document.State;

more abstract class Document.State.Assignment;

tuned signature;

more abstract class Document.Version; tuned (NB: Version.nodes is total);

more abstract class Document.Node;

more abstract class Document.History;

more abstract class Document.Change;

tuned;

tuned signature; clarified check;

merged

slightly changing the enumeration scheme

adding some more test invocations of find_unused_assms

adding an example where random beats exhaustive testing

removing unnecessary assumptions in RComplete; simplifying proof in Probability

removing unnecessary assumptions in RealDef; simplifying proofs in Float, MIR, and Ferrack

one general list_all2_update_cong instead of two special ones

tuned comments;

standard Graph instances;

clarified signature -- avoid oddities of Iterable like Iterator.map; specific toString;

discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);

moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy

explicit is better than implicit

dropped dead code

prefer sorted Map/Set for canonical order of results -- pass ordering via fresh copy of empty; discontinued map_nodes, del_nodes conveniences -- avoid inefficient mapValues wrapper (this is not Table.map from ML); tuned signature;

tuned imports;

tuned signature;

discontinued obsolete Graph.all_paths (last seen in 1524d69783d3 and AFP/80bbbdbfec62);

merged

remove ill-formed lemmas word_0_wi_Pls and word_m1_wi_Min

avoid using Int.succ_def in proofs

avoid using Int.succ or Int.pred in proofs

avoid using BIT_simps in proofs; rephrase lemmas without Int.succ or Int.pred;

avoid using BIT_simps in proofs

updated stats according to src/HOL/IsaMakefile;

more precise clean target;

clarifed name space "type name", which covers logical and non-logical types, and often occurs inside outer syntax "type" markup;

avoid using Int.Pls_def in proofs

remove ill-formed lemmas word_pred_0_Min and word_m1_Min

remove ill-formed lemma of_bl_no; adapt proofs

adapt lemma mask_lem to respect int/bin distinction

rephrase some slow "metis" calls

added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)

general solution to the arity bug that occasionally plagues Sledgehammer -- short story, lots of things go kaputt when a polymorphic symbol's arity in the translation is higher than the arity of the fully polymorphic HOL constant

renamed 'try_methods' to 'try0'

doc fixes (thanks to Nik)

fixed arity bug with "If" helpers for "If" that returns a function

given up disfruitful branch

explicit remove of lattice notation

moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy

moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy

dropped dead code

tuned isatest settings;

merged

moved lemmas for orderings and lattices on predicates to corresponding theories, retaining declaration order of classical rules; tuned headings; tuned syntax

tuned whitespace

tuned proof

prefer actual syntax categories;

avoid trait Addable, which is deprecated in scala-2.9.x; tuned;

streamlined abstract datatype;

tuned;

streamlined abstract datatype;

tuned -- avoid copy of empty value;

tuned;

streamlined abstract datatype, eliminating odd representation class;

tuned;

merged

make more simp rules respect int/bin distinction

make bool list functions respect int/bin distinction

merged;

tuned;

clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;

further graph operations from ML;

removed dead code;

directed graphs (in Scala);

make uses of bin_split respect int/bin distinction

remove lemma bin_cat_Pls, which doesn't respect int/bin distinction

make uses of constant bin_sc respect int/bin distinction

remove duplicate lemma bintrunc_Suc in favor of bintrunc.Suc

remove unused lemmas

simplify proofs

make uses of bin_sign respect int/bin distinction

removed unnecessary lemma zero_bintrunc

remove unnecessary lemmas

removed unnecessary constant bin_rl

remove duplication of lemmas bin_{rest,last}_BIT

remove lemmas Bit{0,1}_div2

simplify proof

deal with FIXMEs for linarith examples

CONTRIBUTORS

merged

tuned whitespace