Thu, 28 Oct 2010 15:10:34 +0200 wenzelm merged
Thu, 28 Oct 2010 12:33:24 +0200 blanchet support non-identifier-like fact names in Sledgehammer (e.g., "my lemma") by quoting them
Thu, 28 Oct 2010 10:38:29 +0200 blanchet merged
Thu, 28 Oct 2010 09:40:57 +0200 blanchet clear identification
Thu, 28 Oct 2010 09:36:51 +0200 blanchet clear identification;
Thu, 28 Oct 2010 09:29:57 +0200 blanchet clear identification
Wed, 27 Oct 2010 19:14:33 +0200 blanchet reintroduced Auto Try, but this time really off by default -- and leave some classical+simp reasoners out for Auto Try (but keep them for Try)
Wed, 27 Oct 2010 16:32:13 +0200 blanchet do not let Metis be confused by higher-order reasoning leading to literals of the form "~ ~ p", which are really the same as "p"
Wed, 27 Oct 2010 09:22:40 +0200 blanchet generalize to handle any prover (not just E)
Wed, 27 Oct 2010 11:11:35 -0700 huffman merged
Wed, 27 Oct 2010 11:10:36 -0700 huffman make domain package work with non-cpo argument types
Wed, 27 Oct 2010 11:06:53 -0700 huffman make op -->> infixr, to match op --->
Tue, 26 Oct 2010 14:19:59 -0700 huffman use Named_Thms instead of Theory_Data for some domain package theorems
Tue, 26 Oct 2010 09:00:07 -0700 huffman change types of ML commands add_domain, add_new_domain to take 'sort' instead of 'string option'
Tue, 26 Oct 2010 08:36:52 -0700 huffman use Term.add_tfreesT
Sun, 24 Oct 2010 15:42:57 -0700 huffman rename case combinators generated by domain package to 'foo_case' instead of 'foo_when'
Sun, 24 Oct 2010 15:19:17 -0700 huffman rename constant 'one_when' to 'one_case'
Wed, 27 Oct 2010 16:40:34 +0200 haftmann merged
Wed, 27 Oct 2010 16:40:31 +0200 haftmann sorting: avoid _key suffix if lemma applies both to simple and generalized variant; generalized insort_insert to insort_insert_key; additional lemmas
Wed, 27 Oct 2010 13:46:30 +0200 krauss regenerated keyword file
Wed, 27 Oct 2010 08:58:03 +0200 boehmes made SML/NJ happy
Tue, 26 Oct 2010 21:51:04 +0200 blanchet adapted SMT solver error handling to reflect latest changes in "SMT_Solver"
Tue, 26 Oct 2010 21:43:50 +0200 blanchet better list of irrelevant SMT constants
Tue, 26 Oct 2010 21:34:01 +0200 blanchet if "debug" is on, print list of relevant facts (poweruser request);
Tue, 26 Oct 2010 21:01:28 +0200 blanchet standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
Tue, 26 Oct 2010 20:12:33 +0200 blanchet "Nitpick" -> "Sledgehammer";
Tue, 26 Oct 2010 20:09:38 +0200 blanchet merge
Tue, 26 Oct 2010 16:59:19 +0200 blanchet merged
Tue, 26 Oct 2010 16:56:54 +0200 blanchet remove needless context argument;
Tue, 26 Oct 2010 17:35:54 +0200 boehmes use proper context
Tue, 26 Oct 2010 17:35:52 +0200 boehmes trace assumptions before giving them to the SMT solver
Tue, 26 Oct 2010 17:35:51 +0200 boehmes capture out-of-memory warnings of Z3 and turn them into proper exceptions; be more precise about SMT solver run-time: return NONE instead of ~1
Tue, 26 Oct 2010 17:35:49 +0200 boehmes honor choice of either local or remote SMT solver only for smt_filter and keep default behaviour for the SMT tactic; omit messages when running smt_filter
Tue, 26 Oct 2010 16:39:21 +0200 haftmann include ATP in theory List -- avoid theory edge by-passing the prominent list theory
Tue, 26 Oct 2010 15:06:36 +0200 krauss fixed typo
Tue, 26 Oct 2010 15:01:39 +0200 blanchet merged
Tue, 26 Oct 2010 15:01:02 +0200 blanchet merged
Tue, 26 Oct 2010 14:49:48 +0200 blanchet put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
Tue, 26 Oct 2010 14:48:55 +0200 blanchet tuning
Tue, 26 Oct 2010 15:00:57 +0200 haftmann merged
Tue, 26 Oct 2010 14:06:22 +0200 haftmann consider base sorts of superclasses simultaneously during processing of class specification -- avoids clash of different base sorts
Tue, 26 Oct 2010 15:00:42 +0200 haftmann more general treatment of type argument in code certificates for operations on abstract types
Tue, 26 Oct 2010 14:11:34 +0200 haftmann partial_function is a declaration command
Tue, 26 Oct 2010 14:06:21 +0200 blanchet merged
Tue, 26 Oct 2010 13:50:57 +0200 blanchet proper error handling for SMT solvers in Sledgehammer
Tue, 26 Oct 2010 13:50:18 +0200 krauss NEWS
Tue, 26 Oct 2010 13:17:37 +0200 blanchet merge
Tue, 26 Oct 2010 13:16:43 +0200 blanchet integrated "smt" proof method with Sledgehammer
Tue, 26 Oct 2010 13:19:31 +0200 krauss fixed confusion introduced in 008dc2d2c395
Tue, 26 Oct 2010 12:23:39 +0200 blanchet merged
Tue, 26 Oct 2010 12:17:19 +0200 blanchet reverted e7a80c6752c9 -- there's not much point in putting a diagnosis tool (as opposed to a proof method) in Plain, but more importantly Sledgehammer must be in Main to use SMT solvers
Tue, 26 Oct 2010 12:19:31 +0200 haftmann merged
Tue, 26 Oct 2010 12:19:22 +0200 haftmann tuned
Tue, 26 Oct 2010 12:21:45 +0200 krauss merged
Tue, 26 Oct 2010 12:19:02 +0200 krauss use partial_function instead of MREC combinator; curried rev'
Tue, 26 Oct 2010 12:19:02 +0200 krauss added Heap monad instance of partial_function package
Tue, 26 Oct 2010 12:19:02 +0200 krauss added Spec_Rule declaration to partial_function
Tue, 26 Oct 2010 12:19:01 +0200 krauss basic documentation for command partial_function
Tue, 26 Oct 2010 12:19:01 +0200 krauss remove outdated "(otherwise)" syntax from manual
Tue, 26 Oct 2010 12:19:01 +0200 krauss declare recursive equation as ".simps", in accordance with other packages
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip