Fri, 24 Feb 2012 16:59:20 +0100 huffman avoid using Int.succ_def in proofs
Fri, 24 Feb 2012 16:55:29 +0100 huffman avoid using Int.succ or Int.pred in proofs
Fri, 24 Feb 2012 16:53:59 +0100 huffman avoid using BIT_simps in proofs;
Fri, 24 Feb 2012 16:46:43 +0100 huffman avoid using BIT_simps in proofs
Fri, 24 Feb 2012 19:47:00 +0100 wenzelm updated stats according to src/HOL/IsaMakefile;
Fri, 24 Feb 2012 19:45:10 +0100 wenzelm more precise clean target;
Fri, 24 Feb 2012 18:14:06 +0100 wenzelm clarifed name space "type name", which covers logical and non-logical types, and often occurs inside outer syntax "type" markup;
Fri, 24 Feb 2012 13:50:37 +0100 huffman avoid using Int.Pls_def in proofs
Fri, 24 Feb 2012 13:37:23 +0100 huffman remove ill-formed lemmas word_pred_0_Min and word_m1_Min
Fri, 24 Feb 2012 13:33:03 +0100 huffman remove ill-formed lemma of_bl_no; adapt proofs
Fri, 24 Feb 2012 13:25:21 +0100 huffman adapt lemma mask_lem to respect int/bin distinction
Fri, 24 Feb 2012 11:23:36 +0100 blanchet rephrase some slow "metis" calls
Fri, 24 Feb 2012 11:23:35 +0100 blanchet added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
Fri, 24 Feb 2012 11:23:34 +0100 blanchet general solution to the arity bug that occasionally plagues Sledgehammer -- short story, lots of things go kaputt when a polymorphic symbol's arity in the translation is higher than the arity of the fully polymorphic HOL constant
Fri, 24 Feb 2012 11:23:34 +0100 blanchet renamed 'try_methods' to 'try0'
Fri, 24 Feb 2012 11:23:33 +0100 blanchet doc fixes (thanks to Nik)
Fri, 24 Feb 2012 11:23:32 +0100 blanchet fixed arity bug with "If" helpers for "If" that returns a function
Fri, 24 Feb 2012 09:40:02 +0100 haftmann given up disfruitful branch
Fri, 24 Feb 2012 08:49:36 +0100 haftmann explicit remove of lattice notation
Fri, 24 Feb 2012 07:30:24 +0100 haftmann moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
Thu, 23 Feb 2012 21:25:59 +0100 haftmann moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
Thu, 23 Feb 2012 21:16:54 +0100 haftmann dropped dead code
Thu, 23 Feb 2012 22:07:12 +0100 wenzelm tuned isatest settings;
Thu, 23 Feb 2012 21:39:11 +0100 wenzelm merged
Thu, 23 Feb 2012 20:33:35 +0100 haftmann moved lemmas for orderings and lattices on predicates to corresponding theories, retaining declaration order of classical rules; tuned headings; tuned syntax
Thu, 23 Feb 2012 20:15:59 +0100 haftmann tuned whitespace
Thu, 23 Feb 2012 20:15:49 +0100 haftmann tuned proof
Thu, 23 Feb 2012 21:15:11 +0100 wenzelm prefer actual syntax categories;
Thu, 23 Feb 2012 20:40:20 +0100 wenzelm avoid trait Addable, which is deprecated in scala-2.9.x;
Thu, 23 Feb 2012 20:24:05 +0100 wenzelm streamlined abstract datatype;
Thu, 23 Feb 2012 20:23:19 +0100 wenzelm tuned;
Thu, 23 Feb 2012 19:58:49 +0100 wenzelm streamlined abstract datatype;
Thu, 23 Feb 2012 19:35:05 +0100 wenzelm tuned -- avoid copy of empty value;
Thu, 23 Feb 2012 19:34:48 +0100 wenzelm tuned;
Thu, 23 Feb 2012 18:38:30 +0100 wenzelm streamlined abstract datatype, eliminating odd representation class;
Thu, 23 Feb 2012 18:14:58 +0100 wenzelm tuned;
Thu, 23 Feb 2012 17:27:37 +0100 huffman merged
Thu, 23 Feb 2012 16:09:16 +0100 huffman make more simp rules respect int/bin distinction
Thu, 23 Feb 2012 15:37:42 +0100 huffman make bool list functions respect int/bin distinction
Thu, 23 Feb 2012 16:18:19 +0100 wenzelm merged;
Thu, 23 Feb 2012 16:02:07 +0100 wenzelm tuned;
Thu, 23 Feb 2012 15:49:40 +0100 wenzelm clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
Thu, 23 Feb 2012 15:15:59 +0100 wenzelm further graph operations from ML;
Thu, 23 Feb 2012 14:46:38 +0100 wenzelm removed dead code;
Thu, 23 Feb 2012 14:17:51 +0100 wenzelm directed graphs (in Scala);
Thu, 23 Feb 2012 15:23:16 +0100 huffman make uses of bin_split respect int/bin distinction
Thu, 23 Feb 2012 15:19:31 +0100 huffman remove lemma bin_cat_Pls, which doesn't respect int/bin distinction
Thu, 23 Feb 2012 15:15:48 +0100 huffman make uses of constant bin_sc respect int/bin distinction
Thu, 23 Feb 2012 15:04:51 +0100 huffman remove duplicate lemma bintrunc_Suc in favor of bintrunc.Suc
Thu, 23 Feb 2012 14:43:01 +0100 huffman remove unused lemmas
Thu, 23 Feb 2012 14:29:29 +0100 huffman simplify proofs
Thu, 23 Feb 2012 13:16:18 +0100 huffman make uses of bin_sign respect int/bin distinction
Thu, 23 Feb 2012 12:45:00 +0100 huffman removed unnecessary lemma zero_bintrunc
Thu, 23 Feb 2012 12:24:34 +0100 huffman remove unnecessary lemmas
Thu, 23 Feb 2012 12:08:59 +0100 huffman removed unnecessary constant bin_rl
Thu, 23 Feb 2012 11:53:03 +0100 huffman remove duplication of lemmas bin_{rest,last}_BIT
Thu, 23 Feb 2012 11:24:54 +0100 huffman remove lemmas Bit{0,1}_div2
Thu, 23 Feb 2012 11:20:42 +0100 huffman simplify proof
Thu, 23 Feb 2012 08:59:55 +0100 huffman deal with FIXMEs for linarith examples
Thu, 23 Feb 2012 08:17:22 +0100 haftmann CONTRIBUTORS
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip