port part of Nitpick to "set" type constructor

reintroduced failing examples now that they work again, after reintroduction of "set"

ported mono calculus to handle "set" type constructors

fixed spurious catch-all patterns

more benchmarks; tuned;

tuned

ported "Sets" example to "set" type constructor

ported a dozen of proofs to the "set" type constructor

reintroduced "metis" call taken out after reintroducing "set" as a constructor, and added two "metis" calls that used to be too slow

update docs to reflect "Manual_Nits"

removed special handling for set constants in relevance filter

reintroduced Sledgehammer call taken out by 9bc924006136, with some hints to guide the naive relevance filter

killed unfold_set_const option that makes no sense now that set is a type constructor again

tuned

removed unnecessary lemmas

tuned proofs

tuned var names

tuned argument order

merged

add simp rules for bitwise word operations with 1

tuned types

disabled failing sledgehammer unit test (collateral damage of 184d36538e51)

disabled kodkodi in mira runs as well (cf. 493d9c4d7ed5)

merged

Made gen_dest_case more robust against eta contraction

merged

remove unnecessary intermediate lemmas

tuned;

eliminated old-fashioned Global_Theory.add_thms;

simplified proof -- avoid res_inst_tac, afford plain asm_full_simp_tac;

simplified proof;

simplified proof;

simplified proof;

more parallelism;

tuned;

merged

tuned -- afford slightly larger simpset in simp_defs_tac;

tuned -- standard proofs by default;

do not fork skipped proofs;

clarified timeit_msg;

tuned;

comments;

remove constant 'ccpo.lub', re-use constant 'Sup' instead

merged

tuned

conversions from sets to predicates and vice versa; extensionality on predicates

added implementation of pred_of_set

fundamental theorems on Set.bind

updated generated files;

qualified Finite_Set.fold

qualified Finite_Set.fold

dropped redundant setup

tuned declaration

attribute code_abbrev superseedes code_unfold_post; tuned text

attribute code_abbrev superseedes code_unfold_post; tuned names and spacing

attribute code_abbrev superseedes code_unfold_post

semiring_numeral_0_eq_0, semiring_numeral_1_eq_1 now [simp], superseeding corresponding simp rules on type nat; attribute code_abbrev superseedes code_unfold_post

semiring_numeral_0_eq_0, semiring_numeral_1_eq_1 now [simp], superseeding corresponding simp rules on type nat

merged

merged

restate some lemmas to respect int/bin distinction

simplify some proofs

add lemma word_eq_iff

restate lemma word_1_no in terms of Numeral1

remove recursion combinator bin_rec; define AND for type int directly with function package

simplify definition of XOR for type int; reorder some lemmas

simplify definition of OR for type int; reorder some lemmas

simplify definition of NOT for type int

add several new tests, most of which don't work yet

fix typos

remove some duplicate lemmas

simplify proof

replace 'lemmas' with explicit 'lemma'

add section headings

remove duplicate lemma lists

reverted some changes for set->predicate transition, according to "hg log -u berghofe -r Isabelle2007:Isabelle2008"; tuned proofs;

disable kodkodi for now to prevent isatest failure of HOL-Nitpick_Examples due to 'a set constructor; prefer explicit version information;

updated platform information;

discontinued broken macbroy5 and thus the obsolete ppc-darwin platform;

more selective target "full" -- avoid failure of HOL-Datatype_Benchmark on 32bit platforms;

print case syntax depending on "show_cases" configuration option;

merged

redefine some binary operations on integers work on abstract numerals instead of Int.Pls and Int.Min

remove some uses of Int.succ and Int.pred

removed unused lemmas

remove redundant syntax declaration

use 'induct arbitrary' instead of 'rule_format' attribute

declare simp rules immediately, instead of using 'declare' commands

declare word_of_int_{0,1} [simp], for consistency with word_of_int_bin

be explicit about Finite_Set.fold

dropped fact whose names clash with corresponding facts on canonical fold

prefer canonical fold on lists

be explicit about Finite_Set.fold

incorporated More_Set and More_List into the Main body -- to be consolidated later

moved theorem requiring multisets from More_List to Multiset

NEWS: unavoidable fact renames

dropped disfruitful `constant signatures`

moved various set operations to theory Set (resp. Product_Type)

dropped Executable_Set wrapper theory

updated certificate

NEWS: `set` is now a proper type constructor

dropped references to obsolete facts `mem_def` and `Collect_def`

dropped references to obsolete facts `mem_def_raw` and `Collect_def_raw`

adjusted to set/pred distinction by means of type constructor `set`

treatment of type constructor `set`

executable intervals

`set` is now a proper type constructor

tuned layout

reduced to a compatibility layer

added setup for executable code

moved `sublists` to theory Enum

commented out examples which choke on strict set/pred distinction

explicitly spelt out proof of equivariance avoids problem with automation due to type constructor `set`

adjusted to set/pred distinction by means of type constructor `set`

dropped references to obsolete fact `mem_def`

dropped obsolete lemma member_set

dropped obsolete code equation for Id

tuned proofs

generalized type signature to permit overloading on `set`

added monad instance for `set`

enum type class instance for `set`; dropped misfitting code lemma for trancl

finite type class instance for `set`

treatment of type constructor `set`

lattice type class instances for `set`; added code lemma for Set.bind

`set` is now a proper type constructor; added operation for set monad

simplify some proofs

remove redundant lemma word_sub_def

add lemmas bin_cat_zero and bin_split_zero