Fri, 26 Nov 2010 23:13:58 +0100 haftmann strict forall2
Fri, 26 Nov 2010 23:13:58 +0100 haftmann nbe decides equality of abstractions by extensionality
Fri, 26 Nov 2010 23:51:34 +0100 wenzelm eliminated some generated comments;
Fri, 26 Nov 2010 23:41:23 +0100 wenzelm merged
Fri, 26 Nov 2010 23:12:01 +0100 haftmann merged
Fri, 26 Nov 2010 22:33:21 +0100 haftmann keep type variable arguments of datatype constructors in bookkeeping
Fri, 26 Nov 2010 22:36:55 +0100 blanchet document changes in Nitpick and MESON/Metis
Fri, 26 Nov 2010 22:36:24 +0100 blanchet renamed "trace_me{son,tis}" and "verbose_metis" to have the name of the tool first
Fri, 26 Nov 2010 22:22:07 +0100 blanchet put facts found by SMT solver in alphabetical order and omit chained facts, as was done already for ATP proofs
Fri, 26 Nov 2010 22:29:41 +0100 wenzelm make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
Fri, 26 Nov 2010 22:04:33 +0100 wenzelm just one version of fold_rev2;
Fri, 26 Nov 2010 21:31:46 +0100 wenzelm explicit use of unprefix;
Fri, 26 Nov 2010 21:09:36 +0100 wenzelm keep private things private, without comments;
Fri, 26 Nov 2010 20:52:21 +0100 wenzelm eliminated some clones of eq_list;
Fri, 26 Nov 2010 18:07:00 +0100 nipkow merged
Fri, 26 Nov 2010 18:06:48 +0100 nipkow new lemma
Fri, 26 Nov 2010 17:54:15 +0100 wenzelm lemma trans_sym allows single-step "normalization" in Isar, e.g. via moreover/ultimately;
Fri, 26 Nov 2010 16:28:34 +0100 wenzelm prefer non-classical eliminations in Pure reasoning, notably "rule" steps;
Fri, 26 Nov 2010 14:40:33 +0100 wenzelm discontinued global "Isabelle" symlink, to make each distribution even more self-contained;
Fri, 26 Nov 2010 14:19:16 +0100 wenzelm more correct spelling;
Fri, 26 Nov 2010 12:03:18 +0100 haftmann globbing constant expressions use more idiomatic underscore rather than star
Fri, 26 Nov 2010 12:03:17 +0100 haftmann globbing constant expressions use more idiomatic underscore rather than star;
Fri, 26 Nov 2010 11:38:20 +0100 haftmann datatype constructor glob for code_reflect
Fri, 26 Nov 2010 11:06:49 +0100 haftmann merged
Fri, 26 Nov 2010 09:32:26 +0100 haftmann merged
Thu, 25 Nov 2010 15:40:41 +0100 haftmann merged
Thu, 25 Nov 2010 15:40:15 +0100 haftmann toplevel deresolving for flat module name space
Fri, 26 Nov 2010 10:04:04 +0100 hoelzl merged
Tue, 23 Nov 2010 14:14:17 +0100 hoelzl Move some missing lemmas from Andrei Popescus 'Ordinals and Cardinals' AFP entry to the HOL-image.
Mon, 22 Nov 2010 10:34:33 +0100 hoelzl Replace surj by abbreviation; remove surj_on.
Fri, 26 Nov 2010 09:15:49 +0100 blanchet adjust Sledgehammer/SMT fudge factor
Thu, 25 Nov 2010 16:12:23 +0100 wenzelm clarified Par_List.managed_results, with explicit propagation of outermost physical interrupt to forked futures (e.g. to make timeout apply here as expected and prevent zombies);
Thu, 25 Nov 2010 14:59:01 +0100 blanchet merge
Thu, 25 Nov 2010 14:58:50 +0100 blanchet cosmetics
Thu, 25 Nov 2010 14:58:20 +0100 blanchet eta-reduce on the fly to prevent an exception
Thu, 25 Nov 2010 14:36:51 +0100 nipkow merged
Thu, 25 Nov 2010 14:35:52 +0100 nipkow Added the simplest finite Ramsey theorem
Thu, 25 Nov 2010 14:13:48 +0100 blanchet reverted c059d550afec -- the triviality check had apparently nothing to do with spontaneous Interrupt exceptions
Thu, 25 Nov 2010 13:26:12 +0100 blanchet set Metis option on correct context, lest it be ignored
Thu, 25 Nov 2010 12:11:12 +0100 blanchet make "debug" mode of Sledgehammer/SMT more liberal
Thu, 25 Nov 2010 00:32:30 +0100 blanchet fix check for builtinness of 0 and 1 -- these aren't functions
Thu, 25 Nov 2010 00:17:16 +0100 blanchet added "no_atp" for fact that confuses the SMT normalizer and that doesn't help ATPs anyway
Wed, 24 Nov 2010 23:17:24 +0100 blanchet document requirement on theory import
Wed, 24 Nov 2010 19:15:00 +0100 haftmann corrected abd4e7358847 where SOMEthing went utterly wrong
Wed, 24 Nov 2010 16:51:13 +0100 boehmes merged
Wed, 24 Nov 2010 15:33:35 +0100 boehmes swap names for built-in tester functions (to better reflect the intuition of what they do);
Wed, 24 Nov 2010 13:31:12 +0100 boehmes instantiate elimination rules (reduces number of quantified variables, and makes such theorems better amenable for SMT solvers)
Wed, 24 Nov 2010 16:15:15 +0100 blanchet more precise error handling in Sledgehammer/SMT for Z3 and remote SMT provers
Wed, 24 Nov 2010 10:52:02 +0100 bulwahn removing Enum.in_enum from the claset
Wed, 24 Nov 2010 10:42:28 +0100 boehmes merged
Wed, 24 Nov 2010 10:39:58 +0100 boehmes be more precise: only treat constant 'distinct' applied to an explicit list as built-in
Wed, 24 Nov 2010 08:51:48 +0100 boehmes be more liberal in reconstructing congruences from Z3 (sometimes the symmetric version of a premise is needed)
Wed, 24 Nov 2010 10:23:52 +0100 bulwahn announcing some latest change (d40b347d5b0b)
Tue, 23 Nov 2010 23:44:11 +0100 blanchet merged
Tue, 23 Nov 2010 23:43:56 +0100 blanchet more precise characterization of built-in constants "number_of", "0", and "1"
Tue, 23 Nov 2010 23:11:06 +0100 haftmann merged
Mon, 22 Nov 2010 17:49:24 +0100 haftmann merged
Mon, 22 Nov 2010 17:48:35 +0100 haftmann adhere established Collect/mem convention more closely
Mon, 22 Nov 2010 17:49:12 +0100 haftmann merged
Mon, 22 Nov 2010 17:46:51 +0100 haftmann replaced misleading Fset/fset name -- these do not stand for finite sets
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip