Mon, 13 Jul 2015 14:39:50 +0200 stronger induction assumption in lfp_transfer and emeasure_lfp
hoelzl [Mon, 13 Jul 2015 14:39:50 +0200] rev 60714
stronger induction assumption in lfp_transfer and emeasure_lfp
Mon, 13 Jul 2015 11:05:50 +0200 refrain from testing HOL-Proofs for x86_64-linux: takes more than 4h;
wenzelm [Mon, 13 Jul 2015 11:05:50 +0200] rev 60713
refrain from testing HOL-Proofs for x86_64-linux: takes more than 4h; tuned parameters;
Sun, 12 Jul 2015 13:04:42 +0200 Quickcheck setup for finite sets
Lars Hupel <lars.hupel@mytum.de> [Sun, 12 Jul 2015 13:04:42 +0200] rev 60712
Quickcheck setup for finite sets
Sat, 11 Jul 2015 21:32:06 +0200 tuned proofs;
wenzelm [Sat, 11 Jul 2015 21:32:06 +0200] rev 60711
tuned proofs;
Sat, 11 Jul 2015 00:14:54 +0200 tuned proofs;
wenzelm [Sat, 11 Jul 2015 00:14:54 +0200] rev 60710
tuned proofs;
Thu, 09 Jul 2015 23:48:55 +0200 merged
wenzelm [Thu, 09 Jul 2015 23:48:55 +0200] rev 60709
merged
Thu, 09 Jul 2015 23:46:21 +0200 tuned proofs;
wenzelm [Thu, 09 Jul 2015 23:46:21 +0200] rev 60708
tuned proofs;
Thu, 09 Jul 2015 22:36:31 +0200 SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
wenzelm [Thu, 09 Jul 2015 22:36:31 +0200] rev 60707
SUBPROOF and Subgoal.FOCUS combinators use anonymous quasi-bound variables (like the Simplifier);
Thu, 09 Jul 2015 22:13:24 +0200 clarified specific use of inspect_contract: "any Bound variable will do" may render the term invalid for Term.fastype_of1 in inst_subst_tac (see also 7c3757fccf0e);
wenzelm [Thu, 09 Jul 2015 22:13:24 +0200] rev 60706
clarified specific use of inspect_contract: "any Bound variable will do" may render the term invalid for Term.fastype_of1 in inst_subst_tac (see also 7c3757fccf0e);
Thu, 09 Jul 2015 22:08:20 +0200 tuned whitespace;
wenzelm [Thu, 09 Jul 2015 22:08:20 +0200] rev 60705
tuned whitespace;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip