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;
wenzelm [Wed, 09 Dec 2009 16:28:49 +0100] rev 34043
more robust Cygwin.config: actually check Wow6432Node, prefer explicit CYGWIN_ROOT in any case;
blanchet [Wed, 09 Dec 2009 12:26:42 +0100] rev 34042
merged
blanchet [Wed, 09 Dec 2009 12:03:27 +0100] rev 34041
merged
blanchet [Tue, 08 Dec 2009 18:40:20 +0100] rev 34040
merged
blanchet [Tue, 08 Dec 2009 18:38:08 +0100] rev 34039
made Nitpick work also for people who import "Plain" instead of "Main"
blanchet [Mon, 07 Dec 2009 13:40:45 +0100] rev 34038
make Nitpick output the message "Hint: Maybe you forgot a type constraint?" only for syntactic classes
wenzelm [Wed, 09 Dec 2009 12:07:44 +0100] rev 34037
keep future Isabelle application entry point;
wenzelm [Wed, 09 Dec 2009 11:53:51 +0100] rev 34036
merged
boehmes [Tue, 08 Dec 2009 23:05:23 +0100] rev 34035
also consider the fully-typed version of metis for Mirabelle measurements
boehmes [Tue, 08 Dec 2009 18:47:25 +0100] rev 34034
merged
boehmes [Tue, 08 Dec 2009 18:44:12 +0100] rev 34033
made SML/NJ happy
haftmann [Tue, 08 Dec 2009 14:31:19 +0100] rev 34032
simplified notion of empty module name
haftmann [Tue, 08 Dec 2009 13:41:37 +0100] rev 34031
commit
haftmann [Tue, 08 Dec 2009 13:40:57 +0100] rev 34030
resorted code equations from "old" number theory version
haftmann [Tue, 08 Dec 2009 13:19:04 +0100] rev 34029
merged
haftmann [Mon, 07 Dec 2009 16:27:48 +0100] rev 34028
split off evaluation mechanisms in separte module Code_Eval
wenzelm [Tue, 08 Dec 2009 17:55:07 +0100] rev 34027
register_fonts: more precise error handling;
wenzelm [Tue, 08 Dec 2009 12:41:47 +0100] rev 34026
added future;
wenzelm [Mon, 07 Dec 2009 23:06:03 +0100] rev 34025
depend on Java 1.6 after all;
wenzelm [Mon, 07 Dec 2009 22:23:33 +0100] rev 34024
basic support for IsabelleText fonts;
haftmann [Mon, 07 Dec 2009 14:54:28 +0100] rev 34023
merged
haftmann [Mon, 07 Dec 2009 14:54:13 +0100] rev 34022
merged
haftmann [Mon, 07 Dec 2009 11:48:40 +0100] rev 34021
tuned inner structure
haftmann [Mon, 07 Dec 2009 14:54:01 +0100] rev 34020
merged Crude_Executable_Set into Executable_Set
blanchet [Mon, 07 Dec 2009 12:21:15 +0100] rev 34019
merged
blanchet [Mon, 07 Dec 2009 11:46:13 +0100] rev 34018
avoid using "prop_logic.ML" and "sat_solver.ML" twice (the other occurrence being in "FunDef.thy");
this produces two copies of the same module, with separate references etc.
blanchet [Mon, 07 Dec 2009 11:44:49 +0100] rev 34017
better error message in Refute when specifying a non-existing SAT solver
wenzelm [Mon, 07 Dec 2009 11:18:44 +0100] rev 34016
merged
boehmes [Mon, 07 Dec 2009 09:35:18 +0100] rev 34015
updated certificate
haftmann [Mon, 07 Dec 2009 09:21:14 +0100] rev 34014
merged
haftmann [Mon, 07 Dec 2009 09:16:27 +0100] rev 34013
repaired read_const_expr, broken in 1e7ca47c6c3d
boehmes [Mon, 07 Dec 2009 09:14:12 +0100] rev 34012
merged
boehmes [Mon, 07 Dec 2009 09:12:16 +0100] rev 34011
verbose output of loaded data makes a clear distinction between new and already existing data (types, constants, axioms)