paulson [Mon, 21 Dec 2009 16:49:04 +0000] rev 34155
Polishing up the English
wenzelm [Mon, 21 Dec 2009 10:40:14 +0100] rev 34154
merged
haftmann [Mon, 21 Dec 2009 08:32:22 +0100] rev 34153
merged
haftmann [Mon, 21 Dec 2009 08:32:04 +0100] rev 34152
clarified various user-defined syntax issues
haftmann [Mon, 21 Dec 2009 08:32:04 +0100] rev 34151
prefer prefix "iso" over potentially misleading "is"; tuned
haftmann [Mon, 21 Dec 2009 08:32:03 +0100] rev 34150
moved lemmas o_eq_dest, o_eq_elim here
huffman [Sat, 19 Dec 2009 09:07:04 -0800] rev 34149
add 'morphisms' option to domain_isomorphism command
huffman [Sat, 19 Dec 2009 06:07:33 -0800] rev 34148
merged
huffman [Fri, 18 Dec 2009 20:13:23 -0800] rev 34147
generalize lemma add_minus_cancel, add lemma minus_add, simplify some proofs
huffman [Fri, 18 Dec 2009 19:00:11 -0800] rev 34146
rename equals_zero_I to minus_unique (keep old name too)
huffman [Fri, 18 Dec 2009 18:48:27 -0800] rev 34145
add lemma swap_triple
wenzelm [Sun, 20 Dec 2009 18:02:13 +0100] rev 34144
improve performance by reordering of parser combinators;
wenzelm [Sun, 20 Dec 2009 17:47:59 +0100] rev 34143
added nested comments;
tuned;
wenzelm [Sun, 20 Dec 2009 15:44:29 +0100] rev 34142
more Scala sources;
wenzelm [Sun, 20 Dec 2009 15:44:07 +0100] rev 34141
simiplified result of keyword parser (again);
sort completions by plain string order;
moved Reverse to library.scala;
wenzelm [Sun, 20 Dec 2009 15:42:40 +0100] rev 34140
simplified result of keyword and symbols parser;
some support for parsing outer syntax tokens;
wenzelm [Sun, 20 Dec 2009 15:42:12 +0100] rev 34139
Outer lexical syntax for Isabelle/Isar -- Scala version.
wenzelm [Sun, 20 Dec 2009 15:41:57 +0100] rev 34138
refined some Symbol operations/signatures;
tuned;
wenzelm [Sat, 19 Dec 2009 16:51:32 +0100] rev 34137
refined some Symbol operations/signatures;
added Symbol.Matcher;
flexible Scan.Lexicon.symbols, with one/many/many1 variants;
wenzelm [Sat, 19 Dec 2009 16:02:26 +0100] rev 34136
added basic library -- Scala version;
added extra support for exceptions -- Scala version;
moved exn.ML to accompany exn.scala;
wenzelm [Sat, 19 Dec 2009 11:48:11 +0100] rev 34135
indicate final state of keywords;
added symbol scanner;
wenzelm [Sat, 19 Dec 2009 11:45:14 +0100] rev 34134
added symbol classification;
tuned;
wenzelm [Fri, 18 Dec 2009 16:52:36 +0100] rev 34133
tuned;
wenzelm [Fri, 18 Dec 2009 15:33:44 +0100] rev 34132
merged
wenzelm [Fri, 18 Dec 2009 15:32:52 +0100] rev 34131
imitate PG style;
wenzelm [Fri, 18 Dec 2009 15:14:59 +0100] rev 34130
merged
wenzelm [Fri, 18 Dec 2009 15:11:01 +0100] rev 34129
imitate PG colors;
blanchet [Fri, 18 Dec 2009 14:02:58 +0100] rev 34128
made Quickcheck take structured proof assumptions into account (like Refute and Nitpick) by default;
up to now, only Auto Quickcheck did -- the old behavior is available by passing "no_assms" as option
blanchet [Fri, 18 Dec 2009 12:00:44 +0100] rev 34127
merged
blanchet [Fri, 18 Dec 2009 12:00:29 +0100] rev 34126
polished Nitpick's binary integer support etc.;
etc. = improve inconsistent scope correction + sort values nicely in output
+ handle "mod" using the characterization "x mod y = x - x div y * y"
(instead of explicit code in Nitpick)
+ introduce KK = Kodkod as abbreviation
blanchet [Thu, 17 Dec 2009 15:22:27 +0100] rev 34125
merged
blanchet [Thu, 17 Dec 2009 15:22:11 +0100] rev 34124
added support for binary nat/int representation to Nitpick
blanchet [Mon, 14 Dec 2009 16:48:49 +0100] rev 34123
distinguish better between "complete" (vs. incomplete) types and "concrete" (vs. abstract) types in Nitpick;
this improves Nitpick's precision in some cases (e.g. higher-order constructors) and reflects a better understanding of what's going on
blanchet [Mon, 14 Dec 2009 12:31:00 +0100] rev 34122
merged
blanchet [Mon, 14 Dec 2009 12:30:26 +0100] rev 34121
get rid of polymorphic equality in Nitpick's code + a few minor cleanups
blanchet [Mon, 14 Dec 2009 12:14:12 +0100] rev 34120
added "no_assms" option to Refute, and include structured proof assumptions by default;
will do the same for Quickcheck unless there are objections
wenzelm [Fri, 18 Dec 2009 12:28:50 +0100] rev 34119
markup bad YXML as malformed;
removed unused XML.document;
removed unused markup;
wenzelm [Fri, 18 Dec 2009 12:10:52 +0100] rev 34118
replace invalid code points -- instead of exception;
wenzelm [Fri, 18 Dec 2009 11:44:25 +0100] rev 34117
tuned signature;
wenzelm [Fri, 18 Dec 2009 11:28:24 +0100] rev 34116
removed junk (cf. f49d45afa634);
wenzelm [Thu, 17 Dec 2009 23:44:48 +0100] rev 34115
merged
huffman [Thu, 17 Dec 2009 13:51:50 -0800] rev 34114
merged
huffman [Thu, 17 Dec 2009 13:49:36 -0800] rev 34113
add lemma INFM_conjI
huffman [Thu, 17 Dec 2009 09:33:30 -0800] rev 34112
added lemmas about INFM/MOST
huffman [Thu, 17 Dec 2009 07:02:13 -0800] rev 34111
add lemmas rev_finite_subset, finite_vimageD, finite_vimage_iff
huffman [Sun, 29 Nov 2009 11:31:39 -0800] rev 34110
add lemmas open_image_fst, open_image_snd
wenzelm [Thu, 17 Dec 2009 23:44:15 +0100] rev 34109
Result.cache;
wenzelm [Thu, 17 Dec 2009 23:31:59 +0100] rev 34108
cache for partial sharing;
wenzelm [Thu, 17 Dec 2009 21:12:57 +0100] rev 34107
merged
paulson [Thu, 17 Dec 2009 17:05:56 +0000] rev 34106
Two new theorems about cardinality
huffman [Mon, 23 Nov 2009 15:30:32 -0800] rev 34105
replace 'UNIV - S' with '- S'
huffman [Tue, 24 Nov 2009 10:14:59 -0800] rev 34104
re-state lemmas using 'range'
huffman [Sun, 29 Nov 2009 22:27:47 -0800] rev 34103
make proof use only abstract properties of eventually
huffman [Wed, 16 Dec 2009 15:10:08 -0800] rev 34102
swap_self already declared [simp]
huffman [Wed, 16 Dec 2009 14:38:35 -0800] rev 34101
declare swap_self [simp], add lemma comp_swap
wenzelm [Thu, 17 Dec 2009 20:14:00 +0100] rev 34100
fifo: raw byte stream;
Result: fully decoded symbols and tree structure;
adapted to simplified message format;
tuned;
wenzelm [Thu, 17 Dec 2009 20:09:19 +0100] rev 34099
added decode_chars, with raw character view on byte buffer and adhoc decoding via toString;
parse/chunks: avoid direct string comparison, to make it actually work with abstract CharSequence;
wenzelm [Thu, 17 Dec 2009 19:30:12 +0100] rev 34098
tuned signature;
wenzelm [Thu, 17 Dec 2009 15:38:58 +0100] rev 34097
tuned;
wenzelm [Thu, 17 Dec 2009 15:09:07 +0100] rev 34096
simplified message format: chunks with explicit size in bytes;
robust message header via YXML.binary_text;
standard_message: refer to thread position only;
discontinued obsolete "-" output stream;
tuned;
wenzelm [Thu, 17 Dec 2009 13:58:15 +0100] rev 34095
robust representation of low ASCII control characters within XML/YXML text;
wenzelm [Wed, 16 Dec 2009 15:15:39 +0100] rev 34094
merged
wenzelm [Wed, 16 Dec 2009 15:15:05 +0100] rev 34093
filter out identical completions;
haftmann [Wed, 16 Dec 2009 14:24:18 +0100] rev 34092
spaces not allowed, unfortunately
haftmann [Wed, 16 Dec 2009 14:15:24 +0100] rev 34091
user aliasses
boehmes [Mon, 14 Dec 2009 21:28:28 +0100] rev 34090
merged
boehmes [Mon, 14 Dec 2009 21:27:59 +0100] rev 34089
replaced blast by metis (blast hangs with polyml-5.2)
haftmann [Mon, 14 Dec 2009 16:35:00 +0100] rev 34088
avoid negative indices as argument ot drop
paulson [Mon, 14 Dec 2009 11:30:13 +0000] rev 34087
Upgraded a warning to an error
haftmann [Mon, 14 Dec 2009 11:01:04 +0100] rev 34086
merged
haftmann [Mon, 14 Dec 2009 10:24:04 +0100] rev 34085
improved crude deriving_show inference
haftmann [Mon, 14 Dec 2009 10:23:25 +0100] rev 34084
explicit name for function space
blanchet [Mon, 14 Dec 2009 10:59:46 +0100] rev 34083
make Nitpick tests more robust by specifying SAT solver, singlethreading (in Kodkod, not in Isabelle), and higher time limits
blanchet [Mon, 14 Dec 2009 10:31:35 +0100] rev 34082
make Nitpick "Core" test more conservative, to avoid problems on Larry's machine
haftmann [Mon, 14 Dec 2009 10:13:06 +0100] rev 34081
made sml/nj happy
boehmes [Mon, 14 Dec 2009 09:53:34 +0100] rev 34080
also sort verification conditions before printing
boehmes [Sun, 13 Dec 2009 23:37:37 +0100] rev 34079
print assertions in a more natural order
wenzelm [Fri, 11 Dec 2009 22:31:24 +0100] rev 34078
removed unique ids -- now in session.scala;
wenzelm [Fri, 11 Dec 2009 20:44:33 +0100] rev 34077
merged
wenzelm [Fri, 11 Dec 2009 20:44:15 +0100] rev 34076
Subgoal.FOCUS (and variants): resulting goal state is normalized as usual for resolution;
tuned;
wenzelm [Fri, 11 Dec 2009 20:43:41 +0100] rev 34075
Subgoal.FOCUS etc.: resulting goal state is normalized as usual for resolution;
haftmann [Fri, 11 Dec 2009 20:32:58 +0100] rev 34074
merged
haftmann [Fri, 11 Dec 2009 20:32:49 +0100] rev 34073
repaired accident: do not forget module contents if there are no imports
haftmann [Fri, 11 Dec 2009 20:32:49 +0100] rev 34072
option width for Code_Target.code_of
haftmann [Fri, 11 Dec 2009 20:32:49 +0100] rev 34071
default_code_width is now proper theory data
boehmes [Fri, 11 Dec 2009 15:36:24 +0100] rev 34070
merged
boehmes [Fri, 11 Dec 2009 15:36:05 +0100] rev 34069
updated dependencies
boehmes [Fri, 11 Dec 2009 15:35:29 +0100] rev 34068
make assertion labels unique already when loading a verification condition,
keep abstract view on verification conditions and provide various splitting operations on verification conditions,
allow to discharge only parts of a verification condition,
extended the command "boogie_vc" with options to consider only some assertions or to split a verification condition into its paths,
added a narrowing option to "boogie_status" (a divide-and-conquer approach for identifying the "hard" subset of assertions of a verification conditions),
added tactics "boogie", "boogie_all" and "boogie_cases",
dropped tactic "split_vc",
split example Boogie_Max into Boogie_Max (proof based on SMT) and Boogie_Max_Stepwise (proof based on metis and auto with documentation of the available Boogie commands),
dropped (mostly unused) abbreviations
boehmes [Fri, 11 Dec 2009 15:06:12 +0100] rev 34067
depend on HOL-SMT instead of HOL (makes tactic "smt" available for proofs)
haftmann [Fri, 11 Dec 2009 14:44:08 +0100] rev 34066
merged
haftmann [Fri, 11 Dec 2009 14:43:56 +0100] rev 34065
moved predicate rules to Predicate.thy; weakened default dest rule predicate1D (is not that reliable wrt. sets)
haftmann [Fri, 11 Dec 2009 14:43:55 +0100] rev 34064
avoid dependency on implicit dest rule predicate1D in proofs
haftmann [Fri, 11 Dec 2009 14:32:37 +0100] rev 34063
merged
haftmann [Fri, 11 Dec 2009 14:32:24 +0100] rev 34062
NEWS
haftmann [Fri, 11 Dec 2009 08:47:16 +0100] rev 34061
merged
haftmann [Wed, 09 Dec 2009 21:38:21 +0100] rev 34060
merged
haftmann [Wed, 09 Dec 2009 21:38:12 +0100] rev 34059
take and drop as projections of chop
haftmann [Wed, 09 Dec 2009 21:38:12 +0100] rev 34058
explicit lower bound for index
paulson [Fri, 11 Dec 2009 09:25:45 +0000] rev 34057
merged
paulson [Thu, 10 Dec 2009 17:34:50 +0000] rev 34056
merged
paulson [Thu, 10 Dec 2009 17:34:18 +0000] rev 34055
streamlined proofs
paulson [Thu, 10 Dec 2009 17:34:09 +0000] rev 34054
fixed typo
wenzelm [Thu, 10 Dec 2009 22:28:55 +0100] rev 34053
merged
boehmes [Thu, 10 Dec 2009 18:10:59 +0100] rev 34052
only invoke metisFT if metis failed
bulwahn [Thu, 10 Dec 2009 11:58:26 +0100] rev 34051
added Imperative_HOL examples; added tail-recursive combinator for monadic heap functions; adopted code generation of references; added lemmas
haftmann [Wed, 09 Dec 2009 21:33:50 +0100] rev 34050
merged
haftmann [Wed, 09 Dec 2009 16:46:04 +0100] rev 34049
each import resides in its own line
haftmann [Wed, 09 Dec 2009 16:46:03 +0100] rev 34048
using existing lattice classes
wenzelm [Thu, 10 Dec 2009 16:11:07 +0100] rev 34047
added get_data;
wenzelm [Thu, 10 Dec 2009 13:43:51 +0100] rev 34046
sealed XML.Tree;
keep original XML.Tree within DOM as user data;
wenzelm [Wed, 09 Dec 2009 21:55:14 +0100] rev 34045
simplified Cygwin setup, assuming 1.7 registry layout (version 1.5 suffers from upcaseenv problem anyway);
wenzelm [Wed, 09 Dec 2009 21:25:07 +0100] rev 34044
slightly more robust and less ambitious version of install_fonts;