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

more uses of 'induct arbitrary'

use 'induct arbitrary' instead of universal quantifiers

remove two conflicting simp rules for 'number_of (number_of _)' pattern

add lemma bin_nth_minus1

removed killed encoding from example

updated docs

killed "guard@?" encodings -- they were found to be unsound

extend previous optimizations to guard-based encodings

treat polymorphic constructors specially in @? encodings

tuning

no need for type arguments for monomorphic constructors of polymorphic datatypes (e.g. "Nil")

added some basic documentation about method induction_schema extracted from old NEWS

adding documentation about the quickcheck_generator command in the IsarRef

extending quickcheck example

NEWS

quickcheck_generator command also creates random generators

don't try to avoid SPASS keywords; instead, just suffix an underscore to all generated identifiers

one more SPASS identifier

tuning

merged

meaningful error message on failing merges of coercion tables

add simp rules for enat and ereal