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

tuned whitespace

adding documentation about find_unused_assms command and use_subtype option in the IsarRef

NEWS

adding some examples with find_unused_assms command

adding new command "find_unused_assms"

removing some unnecessary premises from Map theory

preliminarily switching quickcheck-narrowing off by default (probably it should only be invoked if concrete testing does not work)

generalizing inj_on_Int

moving Quickcheck's example to its own session

tuned proofs;

more robust visible_range: allow empty view;

misc tuning;

merged;

made SML/NJ happy;

tuned proofs;

merged

tuned proofs;

approximate Perspective.full within the bounds of the JVM;

misc tuning; more indentation;

invoke later to reduce chance of causing deadlock;

misc tuning; more indentation;

separate module for text status overview;

overview.delay_repaint: avoid wasting GUI cycles via update_delay; prefer delay_first for prover initiated events -- avoid indefinite delay;

tuned;

merged

merged

Fixed bugs: - set_env no longer modifies pfuns field in theory data record. Instead, a copy of this field is now contained in the env field. - add_type_def now checks whether type associated with SPARK enumeration type is really a datatype with no parameters. - check_pfuns_types now properly strips off prefixes of proof function names.

merged

subtype preprocessing in Quickcheck; adding option use_subtype; tuned

adding parsing of an optional predicate with quickcheck_generator command

updated generated files (cf. 8d51b375e926);

merged;

add missing lemmas to compute_div_mod

remove constant negateSnd in favor of 'apsnd uminus' (from Florian Haftmann)

avoid using constant Int.neg

renamed ex/Numeral.thy to ex/Numeral_Representation.thy

reverting changesets from 5d33a3269029 on: change of order of declaration of classical rules makes serious problems