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;