Thu, 02 Dec 2010 14:34:58 +0100 hoelzl Move SUP_commute, SUP_less_iff to HOL image;
Wed, 01 Dec 2010 21:03:02 +0100 hoelzl Generalized simple_functionD and less_SUP_iff.
Wed, 01 Dec 2010 20:12:53 +0100 hoelzl Tuned setup for borel_measurable with min, max and psuminf.
Wed, 01 Dec 2010 20:09:41 +0100 hoelzl Replace algebra_eqI by algebra.equality;
Thu, 02 Dec 2010 14:56:16 +0100 blanchet give the Isabelle proof the benefice of the doubt when the Isabelle theorem has fewer literals than the Metis one -- this makes a difference on lemma "Let (x::'a, y::'a) (inv_image (r::'b * 'b => bool) (f::'a => 'b)) = ((f x, f y) : r)" apply (metis in_inv_image mem_def)
Thu, 02 Dec 2010 15:03:21 +0100 wenzelm merged
Thu, 02 Dec 2010 08:34:23 +0100 nipkow coercions
Wed, 01 Dec 2010 20:59:40 +0100 nipkow merged
Wed, 01 Dec 2010 20:59:29 +0100 nipkow moved activation of coercion inference into RealDef and declared function real a coercion.
Wed, 01 Dec 2010 19:42:09 +0100 hoelzl Corrected IsaMakefile
Wed, 01 Dec 2010 19:36:05 +0100 hoelzl merged
Wed, 01 Dec 2010 19:33:49 +0100 hoelzl Updated NEWS
Wed, 01 Dec 2010 19:27:53 +0100 hoelzl More correct make dependencies for HOL-Multivariate_Analysis and HOL-Probability.
Wed, 01 Dec 2010 19:20:30 +0100 hoelzl Support product spaces on sigma finite measures.
Wed, 01 Dec 2010 18:00:40 +0100 haftmann merged
Wed, 01 Dec 2010 15:46:27 +0100 haftmann use type constructor as name for variable
Wed, 01 Dec 2010 11:46:20 +0100 haftmann optional explicit prefix for type mapper theorems
Wed, 01 Dec 2010 11:33:17 +0100 haftmann file for package tool type_mapper carries the same name as its Isar command
Wed, 01 Dec 2010 06:50:54 -0800 huffman merged
Wed, 01 Dec 2010 06:48:40 -0800 huffman domain package generates non-authentic syntax rules for parsing only
Thu, 02 Dec 2010 10:46:03 +0100 wenzelm builtin time bounds (again);
Thu, 02 Dec 2010 10:44:33 +0100 wenzelm tuned;
Wed, 01 Dec 2010 21:23:21 +0100 wenzelm more abstract handling of Time properties;
Wed, 01 Dec 2010 21:07:50 +0100 wenzelm store tooltip-dismiss-delay as Double(seconds);
Wed, 01 Dec 2010 20:34:40 +0100 wenzelm more abstract/uniform handling of time, preferring seconds as Double;
Wed, 01 Dec 2010 15:38:05 +0100 wenzelm merged
Wed, 01 Dec 2010 11:45:37 +0100 haftmann NEWS
Wed, 01 Dec 2010 15:35:40 +0100 wenzelm just one HOLogic.mk_comp;
Wed, 01 Dec 2010 15:03:44 +0100 wenzelm more direct use of binder_types/body_type;
Wed, 01 Dec 2010 15:02:39 +0100 wenzelm tuned;
Wed, 01 Dec 2010 14:56:07 +0100 wenzelm simplified HOL.eq simproc matching;
Wed, 01 Dec 2010 13:37:31 +0100 wenzelm tuned;
Wed, 01 Dec 2010 13:09:08 +0100 wenzelm just one Term.dest_funT;
Wed, 01 Dec 2010 11:32:24 +0100 wenzelm activate subtyping/coercions in theory Complex_Main;
Wed, 01 Dec 2010 11:06:01 +0100 wenzelm simplified equality on pairs of types;
Wed, 01 Dec 2010 11:01:20 +0100 wenzelm more precise dependencies;
Mon, 29 Nov 2010 16:53:08 +0100 traytel two-staged architecture for subtyping;
Tue, 30 Nov 2010 20:02:01 -0800 huffman merged
Tue, 30 Nov 2010 15:56:19 -0800 huffman change cpodef-generated cont_Rep rules to cont2cont format
Tue, 30 Nov 2010 15:34:51 -0800 huffman internal domain package proofs use cont2cont simproc instead of a fixed list of cont rules
Tue, 30 Nov 2010 14:21:57 -0800 huffman remove gratuitous semicolons from ML code
Tue, 30 Nov 2010 14:01:49 -0800 huffman add continuity lemma for List.map
Tue, 30 Nov 2010 14:01:25 -0800 huffman simplify predomain instances
Tue, 30 Nov 2010 21:54:15 +0100 boehmes merged
Tue, 30 Nov 2010 18:22:43 +0100 boehmes split up Z3 models into constraints on free variables and constant definitions;
Tue, 30 Nov 2010 20:52:49 +0100 haftmann code preprocessor setup for numerals on word type;
Tue, 30 Nov 2010 18:40:23 +0100 haftmann merged
Tue, 30 Nov 2010 17:22:59 +0100 haftmann adaptions to changes in Equiv_Relation.thy
Tue, 30 Nov 2010 17:19:11 +0100 haftmann adapted fragile proof
Tue, 30 Nov 2010 17:19:11 +0100 haftmann adaptions to changes in Equiv_Relation.thy; prefer primrec if possible
Tue, 30 Nov 2010 17:19:11 +0100 haftmann adaptions to changes in Equiv_Relation.thy
Tue, 30 Nov 2010 15:58:21 +0100 haftmann merged
Tue, 30 Nov 2010 15:58:09 +0100 haftmann more systematic and compact proofs on type relation operators using natural deduction rules
Tue, 30 Nov 2010 15:58:09 +0100 haftmann adapted proofs to slightly changed definitions of congruent(2)
Mon, 29 Nov 2010 22:47:55 +0100 haftmann reorienting iff in Quotient_rel prevents simplifier looping;
Mon, 29 Nov 2010 22:41:17 +0100 haftmann replaced slightly odd locale congruent2 by plain definition
Mon, 29 Nov 2010 22:32:06 +0100 haftmann replaced slightly odd locale congruent by plain definition
Mon, 29 Nov 2010 13:44:54 +0100 haftmann equivI has replaced equiv.intro
Mon, 29 Nov 2010 12:15:14 +0100 haftmann moved generic definitions about (partial) equivalence relations from Quotient to Equiv_Relations;
Mon, 29 Nov 2010 12:14:46 +0100 haftmann moved generic definitions about relations from Quotient.thy to Predicate;
(0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip