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;