Thu, 08 Nov 2012 20:02:41 +0100 tuned proofs
bulwahn [Thu, 08 Nov 2012 20:02:41 +0100] rev 50037
tuned proofs
Thu, 08 Nov 2012 19:55:37 +0100 using hyp_subst_tac that allows to pass the current simpset to avoid the renamed bound variable warning in the simplifier
bulwahn [Thu, 08 Nov 2012 19:55:37 +0100] rev 50036
using hyp_subst_tac that allows to pass the current simpset to avoid the renamed bound variable warning in the simplifier
Thu, 08 Nov 2012 19:55:35 +0100 hyp_subst_tac allows to pass an optional simpset to the internal simplifier call to avoid renamed bound variable warnings in the simplifier call
bulwahn [Thu, 08 Nov 2012 19:55:35 +0100] rev 50035
hyp_subst_tac allows to pass an optional simpset to the internal simplifier call to avoid renamed bound variable warnings in the simplifier call
Thu, 08 Nov 2012 19:55:19 +0100 NEWS
bulwahn [Thu, 08 Nov 2012 19:55:19 +0100] rev 50034
NEWS
Thu, 08 Nov 2012 19:55:17 +0100 rewriting with the simpset that is passed to the simproc
bulwahn [Thu, 08 Nov 2012 19:55:17 +0100] rev 50033
rewriting with the simpset that is passed to the simproc
Thu, 08 Nov 2012 17:11:04 +0100 handling x : S y pattern with the default mechanism instead of raising an exception in the set_comprehension_pointfree simproc
bulwahn [Thu, 08 Nov 2012 17:11:04 +0100] rev 50032
handling x : S y pattern with the default mechanism instead of raising an exception in the set_comprehension_pointfree simproc
Thu, 08 Nov 2012 17:06:59 +0100 tuned
bulwahn [Thu, 08 Nov 2012 17:06:59 +0100] rev 50031
tuned
Thu, 08 Nov 2012 16:25:26 +0100 syntactic tuning and restructuring of set_comprehension_pointfree simproc
bulwahn [Thu, 08 Nov 2012 16:25:26 +0100] rev 50030
syntactic tuning and restructuring of set_comprehension_pointfree simproc
Thu, 08 Nov 2012 11:59:50 +0100 using more proper simpset in tactic of set_comprehension_pointfree simproc to avoid renamed bound variable warnings in recursive simplifier calls
bulwahn [Thu, 08 Nov 2012 11:59:50 +0100] rev 50029
using more proper simpset in tactic of set_comprehension_pointfree simproc to avoid renamed bound variable warnings in recursive simplifier calls
Thu, 08 Nov 2012 11:59:49 +0100 improving the extension of sets in case of more than one bound variable; rearranging the tactic to prefer simpler steps before more involved ones
bulwahn [Thu, 08 Nov 2012 11:59:49 +0100] rev 50028
improving the extension of sets in case of more than one bound variable; rearranging the tactic to prefer simpler steps before more involved ones
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip