immler@in.tum.de [Wed, 07 Nov 2012 11:33:27 +0100] rev 50039
added projective_family; generalized generator in product_prob_space to projective_family
immler@in.tum.de [Tue, 06 Nov 2012 11:03:28 +0100] rev 50038
moved lemmas further up
bulwahn [Thu, 08 Nov 2012 20:02:41 +0100] rev 50037
tuned proofs
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
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
bulwahn [Thu, 08 Nov 2012 19:55:19 +0100] rev 50034
NEWS
bulwahn [Thu, 08 Nov 2012 19:55:17 +0100] rev 50033
rewriting with the simpset that is passed to the 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
bulwahn [Thu, 08 Nov 2012 17:06:59 +0100] rev 50031
tuned
bulwahn [Thu, 08 Nov 2012 16:25:26 +0100] rev 50030
syntactic tuning and restructuring of set_comprehension_pointfree simproc
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
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
bulwahn [Thu, 08 Nov 2012 11:59:48 +0100] rev 50027
adjusting proofs as the set_comprehension_pointfree simproc breaks some existing proofs
bulwahn [Thu, 08 Nov 2012 11:59:47 +0100] rev 50026
importing term with schematic type variables properly before passing it to the tactic in the set_comprehension_pointfree simproc
bulwahn [Thu, 08 Nov 2012 11:59:47 +0100] rev 50025
handling arbitrary terms in the set comprehension and more general merging of patterns possible in the set_comprehension_pointfree simproc
bulwahn [Thu, 08 Nov 2012 11:59:46 +0100] rev 50024
simplified structure of patterns in set_comprehension_simproc
haftmann [Thu, 08 Nov 2012 10:02:38 +0100] rev 50023
refined stack of library theories implementing int and/or nat by target language numerals
haftmann [Wed, 07 Nov 2012 20:48:04 +0100] rev 50022
restored SML code check which got unintentionally broken: must explicitly check for error during compilation;
restore more conventional namespace during check (relevant for Imperative-HOL)
hoelzl [Tue, 06 Nov 2012 19:18:35 +0100] rev 50021
add support for function application to measurability prover
blanchet [Tue, 06 Nov 2012 15:15:33 +0100] rev 50020
renamed Sledgehammer option
blanchet [Tue, 06 Nov 2012 15:12:31 +0100] rev 50019
always show timing for structured proofs
blanchet [Tue, 06 Nov 2012 14:46:21 +0100] rev 50018
use implications rather than disjunctions to improve readability
blanchet [Tue, 06 Nov 2012 13:47:51 +0100] rev 50017
avoid name clashes
blanchet [Tue, 06 Nov 2012 13:09:02 +0100] rev 50016
fixed more "Trueprop" issues
blanchet [Tue, 06 Nov 2012 12:38:45 +0100] rev 50015
removed needless sort
blanchet [Tue, 06 Nov 2012 11:24:48 +0100] rev 50014
avoid double "Trueprop"s
blanchet [Tue, 06 Nov 2012 11:20:56 +0100] rev 50013
use original formulas for hypotheses and conclusion to avoid mismatches
blanchet [Tue, 06 Nov 2012 11:20:56 +0100] rev 50012
track formula roles in proofs and use that to determine whether the conjecture should be negated or not