Wed, 09 Dec 2009 21:38:12 +0100 take and drop as projections of chop
haftmann [Wed, 09 Dec 2009 21:38:12 +0100] rev 34059
take and drop as projections of chop
Wed, 09 Dec 2009 21:38:12 +0100 explicit lower bound for index
haftmann [Wed, 09 Dec 2009 21:38:12 +0100] rev 34058
explicit lower bound for index
Fri, 11 Dec 2009 09:25:45 +0000 merged
paulson [Fri, 11 Dec 2009 09:25:45 +0000] rev 34057
merged
Thu, 10 Dec 2009 17:34:50 +0000 merged
paulson [Thu, 10 Dec 2009 17:34:50 +0000] rev 34056
merged
Thu, 10 Dec 2009 17:34:18 +0000 streamlined proofs
paulson [Thu, 10 Dec 2009 17:34:18 +0000] rev 34055
streamlined proofs
Thu, 10 Dec 2009 17:34:09 +0000 fixed typo
paulson [Thu, 10 Dec 2009 17:34:09 +0000] rev 34054
fixed typo
Thu, 10 Dec 2009 22:28:55 +0100 merged
wenzelm [Thu, 10 Dec 2009 22:28:55 +0100] rev 34053
merged
Thu, 10 Dec 2009 18:10:59 +0100 only invoke metisFT if metis failed
boehmes [Thu, 10 Dec 2009 18:10:59 +0100] rev 34052
only invoke metisFT if metis failed
Thu, 10 Dec 2009 11:58:26 +0100 added Imperative_HOL examples; added tail-recursive combinator for monadic heap functions; adopted code generation of references; added lemmas
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
Wed, 09 Dec 2009 21:33:50 +0100 merged
haftmann [Wed, 09 Dec 2009 21:33:50 +0100] rev 34050
merged
Wed, 09 Dec 2009 16:46:04 +0100 each import resides in its own line
haftmann [Wed, 09 Dec 2009 16:46:04 +0100] rev 34049
each import resides in its own line
Wed, 09 Dec 2009 16:46:03 +0100 using existing lattice classes
haftmann [Wed, 09 Dec 2009 16:46:03 +0100] rev 34048
using existing lattice classes
Thu, 10 Dec 2009 16:11:07 +0100 added get_data;
wenzelm [Thu, 10 Dec 2009 16:11:07 +0100] rev 34047
added get_data;
Thu, 10 Dec 2009 13:43:51 +0100 sealed XML.Tree;
wenzelm [Thu, 10 Dec 2009 13:43:51 +0100] rev 34046
sealed XML.Tree; keep original XML.Tree within DOM as user data;
Wed, 09 Dec 2009 21:55:14 +0100 simplified Cygwin setup, assuming 1.7 registry layout (version 1.5 suffers from upcaseenv problem anyway);
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);
Wed, 09 Dec 2009 21:25:07 +0100 slightly more robust and less ambitious version of install_fonts;
wenzelm [Wed, 09 Dec 2009 21:25:07 +0100] rev 34044
slightly more robust and less ambitious version of install_fonts;
Wed, 09 Dec 2009 16:28:49 +0100 more robust Cygwin.config: actually check Wow6432Node, prefer explicit CYGWIN_ROOT in any case;
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;
Wed, 09 Dec 2009 12:26:42 +0100 merged
blanchet [Wed, 09 Dec 2009 12:26:42 +0100] rev 34042
merged
Wed, 09 Dec 2009 12:03:27 +0100 merged
blanchet [Wed, 09 Dec 2009 12:03:27 +0100] rev 34041
merged
Tue, 08 Dec 2009 18:40:20 +0100 merged
blanchet [Tue, 08 Dec 2009 18:40:20 +0100] rev 34040
merged
Tue, 08 Dec 2009 18:38:08 +0100 made Nitpick work also for people who import "Plain" instead of "Main"
blanchet [Tue, 08 Dec 2009 18:38:08 +0100] rev 34039
made Nitpick work also for people who import "Plain" instead of "Main"
Mon, 07 Dec 2009 13:40:45 +0100 make Nitpick output the message "Hint: Maybe you forgot a type constraint?" only for syntactic classes
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
Wed, 09 Dec 2009 12:07:44 +0100 keep future Isabelle application entry point;
wenzelm [Wed, 09 Dec 2009 12:07:44 +0100] rev 34037
keep future Isabelle application entry point;
Wed, 09 Dec 2009 11:53:51 +0100 merged
wenzelm [Wed, 09 Dec 2009 11:53:51 +0100] rev 34036
merged
Tue, 08 Dec 2009 23:05:23 +0100 also consider the fully-typed version of metis for Mirabelle measurements
boehmes [Tue, 08 Dec 2009 23:05:23 +0100] rev 34035
also consider the fully-typed version of metis for Mirabelle measurements
Tue, 08 Dec 2009 18:47:25 +0100 merged
boehmes [Tue, 08 Dec 2009 18:47:25 +0100] rev 34034
merged
Tue, 08 Dec 2009 18:44:12 +0100 made SML/NJ happy
boehmes [Tue, 08 Dec 2009 18:44:12 +0100] rev 34033
made SML/NJ happy
Tue, 08 Dec 2009 14:31:19 +0100 simplified notion of empty module name
haftmann [Tue, 08 Dec 2009 14:31:19 +0100] rev 34032
simplified notion of empty module name
Tue, 08 Dec 2009 13:41:37 +0100 commit
haftmann [Tue, 08 Dec 2009 13:41:37 +0100] rev 34031
commit
Tue, 08 Dec 2009 13:40:57 +0100 resorted code equations from "old" number theory version
haftmann [Tue, 08 Dec 2009 13:40:57 +0100] rev 34030
resorted code equations from "old" number theory version
Tue, 08 Dec 2009 13:19:04 +0100 merged
haftmann [Tue, 08 Dec 2009 13:19:04 +0100] rev 34029
merged
Mon, 07 Dec 2009 16:27:48 +0100 split off evaluation mechanisms in separte module Code_Eval
haftmann [Mon, 07 Dec 2009 16:27:48 +0100] rev 34028
split off evaluation mechanisms in separte module Code_Eval
Tue, 08 Dec 2009 17:55:07 +0100 register_fonts: more precise error handling;
wenzelm [Tue, 08 Dec 2009 17:55:07 +0100] rev 34027
register_fonts: more precise error handling;
Tue, 08 Dec 2009 12:41:47 +0100 added future;
wenzelm [Tue, 08 Dec 2009 12:41:47 +0100] rev 34026
added future;
Mon, 07 Dec 2009 23:06:03 +0100 depend on Java 1.6 after all;
wenzelm [Mon, 07 Dec 2009 23:06:03 +0100] rev 34025
depend on Java 1.6 after all;
Mon, 07 Dec 2009 22:23:33 +0100 basic support for IsabelleText fonts;
wenzelm [Mon, 07 Dec 2009 22:23:33 +0100] rev 34024
basic support for IsabelleText fonts;
Mon, 07 Dec 2009 14:54:28 +0100 merged
haftmann [Mon, 07 Dec 2009 14:54:28 +0100] rev 34023
merged
Mon, 07 Dec 2009 14:54:13 +0100 merged
haftmann [Mon, 07 Dec 2009 14:54:13 +0100] rev 34022
merged
Mon, 07 Dec 2009 11:48:40 +0100 tuned inner structure
haftmann [Mon, 07 Dec 2009 11:48:40 +0100] rev 34021
tuned inner structure
Mon, 07 Dec 2009 14:54:01 +0100 merged Crude_Executable_Set into Executable_Set
haftmann [Mon, 07 Dec 2009 14:54:01 +0100] rev 34020
merged Crude_Executable_Set into Executable_Set
Mon, 07 Dec 2009 12:21:15 +0100 merged
blanchet [Mon, 07 Dec 2009 12:21:15 +0100] rev 34019
merged
Mon, 07 Dec 2009 11:46:13 +0100 avoid using "prop_logic.ML" and "sat_solver.ML" twice (the other occurrence being in "FunDef.thy");
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.
Mon, 07 Dec 2009 11:44:49 +0100 better error message in Refute when specifying a non-existing SAT solver
blanchet [Mon, 07 Dec 2009 11:44:49 +0100] rev 34017
better error message in Refute when specifying a non-existing SAT solver
Mon, 07 Dec 2009 11:18:44 +0100 merged
wenzelm [Mon, 07 Dec 2009 11:18:44 +0100] rev 34016
merged
Mon, 07 Dec 2009 09:35:18 +0100 updated certificate
boehmes [Mon, 07 Dec 2009 09:35:18 +0100] rev 34015
updated certificate
Mon, 07 Dec 2009 09:21:14 +0100 merged
haftmann [Mon, 07 Dec 2009 09:21:14 +0100] rev 34014
merged
Mon, 07 Dec 2009 09:16:27 +0100 repaired read_const_expr, broken in 1e7ca47c6c3d
haftmann [Mon, 07 Dec 2009 09:16:27 +0100] rev 34013
repaired read_const_expr, broken in 1e7ca47c6c3d
Mon, 07 Dec 2009 09:14:12 +0100 merged
boehmes [Mon, 07 Dec 2009 09:14:12 +0100] rev 34012
merged
Mon, 07 Dec 2009 09:12:16 +0100 verbose output of loaded data makes a clear distinction between new and already existing data (types, constants, axioms)
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)
Thu, 03 Dec 2009 15:56:06 +0100 faster preprocessing: before applying a step, test if it is applicable (normalization of binders, unfolding of abs/min/max definitions, lambda lifting, explicit application, monomorphization),
boehmes [Thu, 03 Dec 2009 15:56:06 +0100] rev 34010
faster preprocessing: before applying a step, test if it is applicable (normalization of binders, unfolding of abs/min/max definitions, lambda lifting, explicit application, monomorphization), custom-made (top-down) atomize_conv, store predicate and function symbols in a table instead of a list for faster lookup, updated certificates
Sun, 06 Dec 2009 08:28:36 +0100 merged
haftmann [Sun, 06 Dec 2009 08:28:36 +0100] rev 34009
merged
Sun, 06 Dec 2009 08:06:03 +0100 tuned proofs
haftmann [Sun, 06 Dec 2009 08:06:03 +0100] rev 34008
tuned proofs
Sat, 05 Dec 2009 20:02:21 +0100 tuned lattices theory fragements; generlized some lemmas from sets to lattices
haftmann [Sat, 05 Dec 2009 20:02:21 +0100] rev 34007
tuned lattices theory fragements; generlized some lemmas from sets to lattices
Mon, 07 Dec 2009 00:02:54 +0100 avoid lazy val with side-effects -- spurious null pointers!?
wenzelm [Mon, 07 Dec 2009 00:02:54 +0100] rev 34006
avoid lazy val with side-effects -- spurious null pointers!?
Mon, 07 Dec 2009 00:02:07 +0100 toString: more robust handling of null;
wenzelm [Mon, 07 Dec 2009 00:02:07 +0100] rev 34005
toString: more robust handling of null; tuned;
Sun, 06 Dec 2009 23:25:27 +0100 proper markup text for loc;
wenzelm [Sun, 06 Dec 2009 23:25:27 +0100] rev 34004
proper markup text for loc;
Sun, 06 Dec 2009 23:09:14 +0100 output_syms: permissive treatment of control symbols, cf. Scala version;
wenzelm [Sun, 06 Dec 2009 23:09:14 +0100] rev 34003
output_syms: permissive treatment of control symbols, cf. Scala version;
Sun, 06 Dec 2009 23:08:43 +0100 basic treatment of special control symbols;
wenzelm [Sun, 06 Dec 2009 23:08:43 +0100] rev 34002
basic treatment of special control symbols; misc tuning;
Sun, 06 Dec 2009 23:06:53 +0100 elements: more convenient result;
wenzelm [Sun, 06 Dec 2009 23:06:53 +0100] rev 34001
elements: more convenient result;
Sun, 06 Dec 2009 22:23:31 +0100 more robust treatment of line breaks -- Java "split" has off semantics;
wenzelm [Sun, 06 Dec 2009 22:23:31 +0100] rev 34000
more robust treatment of line breaks -- Java "split" has off semantics;
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip