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
Mon, 22 Nov 2010 09:37:39 +0100 haftmann renamed slightly ambivalent crel to effect
Tue, 23 Nov 2010 23:10:13 +0100 blanchet disable triviality checking -- it might be the source of the spurious Interrupt exceptions that make it almost impossible to run Judgement Day
Tue, 23 Nov 2010 22:37:16 +0100 blanchet more precise error handling for Z3;
Tue, 23 Nov 2010 21:54:03 +0100 blanchet use "Thm.transfer" in Sledgehammer to prevent theory merger issues in "SMT_Solver.smt_filter" later on
Tue, 23 Nov 2010 19:01:21 +0100 blanchet make Mirabelle take into consideration whether the SMT solver proof should be reconstructed with Metis or SMT
Tue, 23 Nov 2010 18:28:09 +0100 blanchet try Metis to reconstruct SMT proofs, to increase success rate and reduce dependency on (often remote) SMT solvers or certificates
Tue, 23 Nov 2010 18:26:56 +0100 blanchet added "verbose" option to Metis to shut up its warnings if necessary
Mon, 22 Nov 2010 23:37:00 +0100 boehmes added support for quantifier weight annotations
Mon, 22 Nov 2010 15:45:43 +0100 boehmes share and use more utility functions;
Mon, 22 Nov 2010 15:45:42 +0100 boehmes added prove reconstruction for injective functions;
Mon, 22 Nov 2010 14:27:42 +0100 haftmann generous timeout gives more breath in parallel run on less luxury machines
Mon, 22 Nov 2010 14:19:03 +0100 bulwahn adding setup for exhaustive testing in example file
Mon, 22 Nov 2010 11:35:11 +0100 bulwahn hiding enum
Mon, 22 Nov 2010 11:35:09 +0100 bulwahn adapting example in Predicate_Compile_Examples
Mon, 22 Nov 2010 11:35:07 +0100 bulwahn hiding the constants
Mon, 22 Nov 2010 11:35:06 +0100 bulwahn improving function is_iterable in quickcheck
Mon, 22 Nov 2010 11:35:02 +0100 bulwahn adding temporary options to the quickcheck examples
Mon, 22 Nov 2010 11:35:00 +0100 bulwahn adapting the quickcheck examples
Mon, 22 Nov 2010 11:34:59 +0100 bulwahn adding AFP tests to Mutabelle_Extra; adopting mutabelle to recent quickcheck changes; filtering strange mutants; adding solvers to mutabelle; restructuring mutabelle
Mon, 22 Nov 2010 11:34:58 +0100 bulwahn adding code equations for EX1 on finite types
Mon, 22 Nov 2010 11:34:57 +0100 bulwahn adding code equation for function equality; adding some instantiations for the finite types
Mon, 22 Nov 2010 11:34:56 +0100 bulwahn adding Enum to HOL-Main image and removing it from HOL-Library
Mon, 22 Nov 2010 11:34:55 +0100 bulwahn moving Enum theory from HOL/Library to HOL
Mon, 22 Nov 2010 11:34:54 +0100 bulwahn splitting test_goal function in two functions; exporting new configurations in quickcheck; iterations depend on generator_name in quickcheck
Mon, 22 Nov 2010 11:34:53 +0100 bulwahn adding prototype for finite_type instantiations
Mon, 22 Nov 2010 11:34:52 +0100 bulwahn adding option finite_types to quickcheck
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip