| Fri, 30 Dec 2011 12:00:10 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 29 Dec 2011 20:32:59 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Thu, 29 Dec 2011 20:31:58 +0100 |
wenzelm |
tuned -- afford slightly larger simpset in simp_defs_tac;
|
changeset |
files
|
| Thu, 29 Dec 2011 20:05:53 +0100 |
wenzelm |
tuned -- standard proofs by default;
|
changeset |
files
|
| Thu, 29 Dec 2011 19:37:24 +0100 |
wenzelm |
do not fork skipped proofs;
|
changeset |
files
|
| Thu, 29 Dec 2011 18:27:17 +0100 |
wenzelm |
clarified timeit_msg;
|
changeset |
files
|
| Thu, 29 Dec 2011 16:58:19 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 29 Dec 2011 15:54:37 +0100 |
wenzelm |
comments;
|
changeset |
files
|
| Thu, 29 Dec 2011 18:54:07 +0100 |
huffman |
remove constant 'ccpo.lub', re-use constant 'Sup' instead
|
changeset |
files
|
| Thu, 29 Dec 2011 17:43:54 +0100 |
nipkow |
merged
|
changeset |
files
|
| Thu, 29 Dec 2011 17:43:40 +0100 |
nipkow |
tuned
|
changeset |
files
|
| Thu, 29 Dec 2011 15:14:44 +0100 |
haftmann |
conversions from sets to predicates and vice versa; extensionality on predicates
|
changeset |
files
|
| Thu, 29 Dec 2011 15:14:44 +0100 |
haftmann |
added implementation of pred_of_set
|
changeset |
files
|
| Thu, 29 Dec 2011 14:23:40 +0100 |
haftmann |
fundamental theorems on Set.bind
|
changeset |
files
|
| Thu, 29 Dec 2011 14:44:44 +0100 |
wenzelm |
updated generated files;
|
changeset |
files
|
| Thu, 29 Dec 2011 13:42:21 +0100 |
haftmann |
qualified Finite_Set.fold
|
changeset |
files
|
| Thu, 29 Dec 2011 13:41:41 +0100 |
haftmann |
qualified Finite_Set.fold
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:56 +0100 |
haftmann |
dropped redundant setup
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:56 +0100 |
haftmann |
tuned declaration
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:55 +0100 |
haftmann |
attribute code_abbrev superseedes code_unfold_post; tuned text
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:55 +0100 |
haftmann |
attribute code_abbrev superseedes code_unfold_post; tuned names and spacing
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:55 +0100 |
haftmann |
attribute code_abbrev superseedes code_unfold_post
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:55 +0100 |
haftmann |
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
|
changeset |
files
|
| Thu, 29 Dec 2011 10:47:54 +0100 |
haftmann |
semiring_numeral_0_eq_0, semiring_numeral_1_eq_1 now [simp], superseeding corresponding simp rules on type nat
|
changeset |
files
|
| Wed, 28 Dec 2011 22:08:44 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Wed, 28 Dec 2011 20:05:52 +0100 |
huffman |
merged
|
changeset |
files
|
| Wed, 28 Dec 2011 20:05:28 +0100 |
huffman |
restate some lemmas to respect int/bin distinction
|
changeset |
files
|
| Wed, 28 Dec 2011 19:15:28 +0100 |
huffman |
simplify some proofs
|
changeset |
files
|
| Wed, 28 Dec 2011 18:50:35 +0100 |
huffman |
add lemma word_eq_iff
|
changeset |
files
|
| Wed, 28 Dec 2011 18:33:03 +0100 |
huffman |
restate lemma word_1_no in terms of Numeral1
|
changeset |
files
|
| Wed, 28 Dec 2011 18:27:34 +0100 |
huffman |
remove recursion combinator bin_rec;
|
changeset |
files
|
| Wed, 28 Dec 2011 16:24:28 +0100 |
huffman |
simplify definition of XOR for type int;
|
changeset |
files
|
| Wed, 28 Dec 2011 16:10:49 +0100 |
huffman |
simplify definition of OR for type int;
|
changeset |
files
|
| Wed, 28 Dec 2011 16:04:58 +0100 |
huffman |
simplify definition of NOT for type int
|
changeset |
files
|
| Wed, 28 Dec 2011 13:20:46 +0100 |
huffman |
add several new tests, most of which don't work yet
|
changeset |
files
|
| Wed, 28 Dec 2011 12:55:37 +0100 |
huffman |
fix typos
|
changeset |
files
|
| Wed, 28 Dec 2011 12:52:23 +0100 |
huffman |
remove some duplicate lemmas
|
changeset |
files
|
| Wed, 28 Dec 2011 10:48:39 +0100 |
huffman |
simplify proof
|
changeset |
files
|
| Wed, 28 Dec 2011 10:30:43 +0100 |
huffman |
replace 'lemmas' with explicit 'lemma'
|
changeset |
files
|
| Wed, 28 Dec 2011 07:58:17 +0100 |
huffman |
add section headings
|
changeset |
files
|
| Tue, 27 Dec 2011 18:26:15 +0100 |
huffman |
remove duplicate lemma lists
|
changeset |
files
|
| Wed, 28 Dec 2011 20:03:13 +0100 |
wenzelm |
reverted some changes for set->predicate transition, according to "hg log -u berghofe -r Isabelle2007:Isabelle2008";
|
changeset |
files
|
| Wed, 28 Dec 2011 15:08:12 +0100 |
wenzelm |
disable kodkodi for now to prevent isatest failure of HOL-Nitpick_Examples due to 'a set constructor;
|
changeset |
files
|
| Wed, 28 Dec 2011 14:38:14 +0100 |
wenzelm |
updated platform information;
|
changeset |
files
|
| Wed, 28 Dec 2011 13:13:27 +0100 |
wenzelm |
discontinued broken macbroy5 and thus the obsolete ppc-darwin platform;
|
changeset |
files
|
| Wed, 28 Dec 2011 13:08:18 +0100 |
wenzelm |
more selective target "full" -- avoid failure of HOL-Datatype_Benchmark on 32bit platforms;
|
changeset |
files
|
| Wed, 28 Dec 2011 13:00:51 +0100 |
wenzelm |
print case syntax depending on "show_cases" configuration option;
|
changeset |
files
|
| Tue, 27 Dec 2011 15:38:45 +0100 |
huffman |
merged
|
changeset |
files
|
| Tue, 27 Dec 2011 15:37:33 +0100 |
huffman |
redefine some binary operations on integers work on abstract numerals instead of Int.Pls and Int.Min
|
changeset |
files
|
| Tue, 27 Dec 2011 13:16:22 +0100 |
huffman |
remove some uses of Int.succ and Int.pred
|
changeset |
files
|
| Tue, 27 Dec 2011 12:49:03 +0100 |
huffman |
removed unused lemmas
|
changeset |
files
|
| Tue, 27 Dec 2011 12:37:11 +0100 |
huffman |
remove redundant syntax declaration
|
changeset |
files
|
| Tue, 27 Dec 2011 12:27:06 +0100 |
huffman |
use 'induct arbitrary' instead of 'rule_format' attribute
|
changeset |
files
|
| Tue, 27 Dec 2011 12:05:03 +0100 |
huffman |
declare simp rules immediately, instead of using 'declare' commands
|
changeset |
files
|
| Tue, 27 Dec 2011 11:38:55 +0100 |
huffman |
declare word_of_int_{0,1} [simp], for consistency with word_of_int_bin
|
changeset |
files
|
| Tue, 27 Dec 2011 09:45:10 +0100 |
haftmann |
be explicit about Finite_Set.fold
|
changeset |
files
|
| Tue, 27 Dec 2011 09:15:26 +0100 |
haftmann |
dropped fact whose names clash with corresponding facts on canonical fold
|
changeset |
files
|
| Tue, 27 Dec 2011 09:15:26 +0100 |
haftmann |
prefer canonical fold on lists
|
changeset |
files
|
| Tue, 27 Dec 2011 09:15:26 +0100 |
haftmann |
be explicit about Finite_Set.fold
|
changeset |
files
|
| Mon, 26 Dec 2011 22:17:10 +0100 |
haftmann |
incorporated More_Set and More_List into the Main body -- to be consolidated later
|
changeset |
files
|
| Mon, 26 Dec 2011 22:17:10 +0100 |
haftmann |
moved theorem requiring multisets from More_List to Multiset
|
changeset |
files
|
| Mon, 26 Dec 2011 22:17:10 +0100 |
haftmann |
NEWS: unavoidable fact renames
|
changeset |
files
|
| Mon, 26 Dec 2011 18:32:43 +0100 |
haftmann |
dropped disfruitful `constant signatures`
|
changeset |
files
|
| Mon, 26 Dec 2011 18:32:43 +0100 |
haftmann |
moved various set operations to theory Set (resp. Product_Type)
|
changeset |
files
|
| Mon, 26 Dec 2011 17:40:43 +0100 |
haftmann |
dropped Executable_Set wrapper theory
|
changeset |
files
|
| Sun, 25 Dec 2011 08:42:33 +0100 |
haftmann |
updated certificate
|
changeset |
files
|
| Sat, 24 Dec 2011 16:14:59 +0100 |
haftmann |
NEWS: `set` is now a proper type constructor
|
changeset |
files
|
| Sat, 24 Dec 2011 16:14:58 +0100 |
haftmann |
dropped references to obsolete facts `mem_def` and `Collect_def`
|
changeset |
files
|
| Sat, 24 Dec 2011 16:14:58 +0100 |
haftmann |
dropped references to obsolete facts `mem_def_raw` and `Collect_def_raw`
|
changeset |
files
|
| Sat, 24 Dec 2011 16:14:58 +0100 |
haftmann |
adjusted to set/pred distinction by means of type constructor `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 16:14:58 +0100 |
haftmann |
treatment of type constructor `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:55:03 +0100 |
haftmann |
executable intervals
|
changeset |
files
|
| Sat, 24 Dec 2011 15:54:58 +0100 |
haftmann |
`set` is now a proper type constructor
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:12 +0100 |
haftmann |
tuned layout
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:12 +0100 |
haftmann |
reduced to a compatibility layer
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:11 +0100 |
haftmann |
added setup for executable code
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:11 +0100 |
haftmann |
moved `sublists` to theory Enum
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:11 +0100 |
haftmann |
commented out examples which choke on strict set/pred distinction
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:11 +0100 |
haftmann |
explicitly spelt out proof of equivariance avoids problem with automation due to type constructor `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:10 +0100 |
haftmann |
adjusted to set/pred distinction by means of type constructor `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:10 +0100 |
haftmann |
dropped references to obsolete fact `mem_def`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:10 +0100 |
haftmann |
dropped obsolete lemma member_set
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:09 +0100 |
haftmann |
dropped obsolete code equation for Id
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:09 +0100 |
haftmann |
tuned proofs
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:09 +0100 |
haftmann |
generalized type signature to permit overloading on `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:08 +0100 |
haftmann |
added monad instance for `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:08 +0100 |
haftmann |
enum type class instance for `set`; dropped misfitting code lemma for trancl
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:08 +0100 |
haftmann |
finite type class instance for `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:08 +0100 |
haftmann |
treatment of type constructor `set`
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:07 +0100 |
haftmann |
lattice type class instances for `set`; added code lemma for Set.bind
|
changeset |
files
|
| Sat, 24 Dec 2011 15:53:07 +0100 |
haftmann |
`set` is now a proper type constructor; added operation for set monad
|
changeset |
files
|
| Fri, 23 Dec 2011 16:37:27 +0100 |
huffman |
simplify some proofs
|
changeset |
files
|
| Fri, 23 Dec 2011 15:55:23 +0100 |
huffman |
remove redundant lemma word_sub_def
|
changeset |
files
|
| Fri, 23 Dec 2011 15:34:18 +0100 |
huffman |
add lemmas bin_cat_zero and bin_split_zero
|
changeset |
files
|
| Fri, 23 Dec 2011 15:24:22 +0100 |
huffman |
more uses of 'induct arbitrary'
|
changeset |
files
|
| Fri, 23 Dec 2011 14:37:38 +0100 |
huffman |
use 'induct arbitrary' instead of universal quantifiers
|
changeset |
files
|