Mon, 26 Dec 2011 22:17:10 +0100 haftmann moved theorem requiring multisets from More_List to Multiset
Mon, 26 Dec 2011 22:17:10 +0100 haftmann NEWS: unavoidable fact renames
Mon, 26 Dec 2011 18:32:43 +0100 haftmann dropped disfruitful `constant signatures`
Mon, 26 Dec 2011 18:32:43 +0100 haftmann moved various set operations to theory Set (resp. Product_Type)
Mon, 26 Dec 2011 17:40:43 +0100 haftmann dropped Executable_Set wrapper theory
Sun, 25 Dec 2011 08:42:33 +0100 haftmann updated certificate
Sat, 24 Dec 2011 16:14:59 +0100 haftmann NEWS: `set` is now a proper type constructor
Sat, 24 Dec 2011 16:14:58 +0100 haftmann dropped references to obsolete facts `mem_def` and `Collect_def`
Sat, 24 Dec 2011 16:14:58 +0100 haftmann dropped references to obsolete facts `mem_def_raw` and `Collect_def_raw`
Sat, 24 Dec 2011 16:14:58 +0100 haftmann adjusted to set/pred distinction by means of type constructor `set`
Sat, 24 Dec 2011 16:14:58 +0100 haftmann treatment of type constructor `set`
Sat, 24 Dec 2011 15:55:03 +0100 haftmann executable intervals
Sat, 24 Dec 2011 15:54:58 +0100 haftmann `set` is now a proper type constructor
Sat, 24 Dec 2011 15:53:12 +0100 haftmann tuned layout
Sat, 24 Dec 2011 15:53:12 +0100 haftmann reduced to a compatibility layer
Sat, 24 Dec 2011 15:53:11 +0100 haftmann added setup for executable code
Sat, 24 Dec 2011 15:53:11 +0100 haftmann moved `sublists` to theory Enum
Sat, 24 Dec 2011 15:53:11 +0100 haftmann commented out examples which choke on strict set/pred distinction
Sat, 24 Dec 2011 15:53:11 +0100 haftmann explicitly spelt out proof of equivariance avoids problem with automation due to type constructor `set`
Sat, 24 Dec 2011 15:53:10 +0100 haftmann adjusted to set/pred distinction by means of type constructor `set`
Sat, 24 Dec 2011 15:53:10 +0100 haftmann dropped references to obsolete fact `mem_def`
Sat, 24 Dec 2011 15:53:10 +0100 haftmann dropped obsolete lemma member_set
Sat, 24 Dec 2011 15:53:09 +0100 haftmann dropped obsolete code equation for Id
Sat, 24 Dec 2011 15:53:09 +0100 haftmann tuned proofs
Sat, 24 Dec 2011 15:53:09 +0100 haftmann generalized type signature to permit overloading on `set`
Sat, 24 Dec 2011 15:53:08 +0100 haftmann added monad instance for `set`
Sat, 24 Dec 2011 15:53:08 +0100 haftmann enum type class instance for `set`; dropped misfitting code lemma for trancl
Sat, 24 Dec 2011 15:53:08 +0100 haftmann finite type class instance for `set`
Sat, 24 Dec 2011 15:53:08 +0100 haftmann treatment of type constructor `set`
Sat, 24 Dec 2011 15:53:07 +0100 haftmann lattice type class instances for `set`; added code lemma for Set.bind
Sat, 24 Dec 2011 15:53:07 +0100 haftmann `set` is now a proper type constructor; added operation for set monad
Fri, 23 Dec 2011 16:37:27 +0100 huffman simplify some proofs
Fri, 23 Dec 2011 15:55:23 +0100 huffman remove redundant lemma word_sub_def
Fri, 23 Dec 2011 15:34:18 +0100 huffman add lemmas bin_cat_zero and bin_split_zero
Fri, 23 Dec 2011 15:24:22 +0100 huffman more uses of 'induct arbitrary'
Fri, 23 Dec 2011 14:37:38 +0100 huffman use 'induct arbitrary' instead of universal quantifiers
Fri, 23 Dec 2011 11:50:12 +0100 huffman remove two conflicting simp rules for 'number_of (number_of _)' pattern
Thu, 22 Dec 2011 12:14:26 +0100 huffman add lemma bin_nth_minus1
Wed, 21 Dec 2011 18:23:08 +0100 blanchet removed killed encoding from example
Wed, 21 Dec 2011 15:04:28 +0100 blanchet updated docs
Wed, 21 Dec 2011 15:04:28 +0100 blanchet killed "guard@?" encodings -- they were found to be unsound
Wed, 21 Dec 2011 15:04:28 +0100 blanchet extend previous optimizations to guard-based encodings
Wed, 21 Dec 2011 15:04:28 +0100 blanchet treat polymorphic constructors specially in @? encodings
Wed, 21 Dec 2011 15:04:28 +0100 blanchet tuning
Wed, 21 Dec 2011 15:04:28 +0100 blanchet no need for type arguments for monomorphic constructors of polymorphic datatypes (e.g. "Nil")
Wed, 21 Dec 2011 14:38:21 +0100 bulwahn added some basic documentation about method induction_schema extracted from old NEWS
Wed, 21 Dec 2011 14:24:29 +0100 bulwahn adding documentation about the quickcheck_generator command in the IsarRef
Wed, 21 Dec 2011 09:41:16 +0100 bulwahn extending quickcheck example
Wed, 21 Dec 2011 09:39:14 +0100 bulwahn NEWS
Wed, 21 Dec 2011 09:21:35 +0100 bulwahn quickcheck_generator command also creates random generators
Tue, 20 Dec 2011 18:59:50 +0100 blanchet don't try to avoid SPASS keywords; instead, just suffix an underscore to all generated identifiers
Tue, 20 Dec 2011 18:59:50 +0100 blanchet one more SPASS identifier
Tue, 20 Dec 2011 18:59:46 +0100 blanchet tuning
Tue, 20 Dec 2011 18:46:05 +0100 noschinl merged
Sat, 17 Dec 2011 15:53:58 +0100 traytel meaningful error message on failing merges of coercion tables
Tue, 20 Dec 2011 11:40:56 +0100 noschinl add simp rules for enat and ereal
Mon, 19 Dec 2011 14:41:08 +0100 noschinl add lemmas
Mon, 19 Dec 2011 14:41:08 +0100 noschinl add lemmas
Mon, 19 Dec 2011 14:41:08 +0100 noschinl weaken preconditions on lemmas
Mon, 19 Dec 2011 14:41:08 +0100 noschinl add lemmas
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip