hoelzl [Wed, 10 Oct 2012 12:12:22 +0200] rev 49782
add measurable_compose
hoelzl [Wed, 10 Oct 2012 12:12:21 +0200] rev 49781
simplified assumptions for kolmogorov_0_1_law
hoelzl [Wed, 10 Oct 2012 12:12:21 +0200] rev 49780
merge should operate on pairs
hoelzl [Wed, 10 Oct 2012 12:12:20 +0200] rev 49779
remove incseq assumption from sigma_prod_algebra_sigma_eq
hoelzl [Wed, 10 Oct 2012 12:12:19 +0200] rev 49778
sigma_finite_iff_density_finite does not require a positive density function
hoelzl [Wed, 10 Oct 2012 12:12:18 +0200] rev 49777
tuned Lebesgue measure proofs
hoelzl [Wed, 10 Oct 2012 12:12:18 +0200] rev 49776
tuned product measurability
hoelzl [Wed, 10 Oct 2012 12:12:17 +0200] rev 49775
remove some unneeded positivity assumptions; generalize some assumptions to AE; tuned proofs
hoelzl [Wed, 10 Oct 2012 12:12:16 +0200] rev 49774
use continuity to show Borel-measurability
hoelzl [Wed, 10 Oct 2012 12:12:15 +0200] rev 49773
tuned measurable_If; moved countably_additive equalities to Measure_Space; tuned proofs
hoelzl [Wed, 10 Oct 2012 12:12:14 +0200] rev 49772
rename terminal_events to tail_event
Andreas Lochbihler [Wed, 10 Oct 2012 13:04:15 +0200] rev 49771
merged
Andreas Lochbihler [Wed, 10 Oct 2012 13:03:50 +0200] rev 49770
efficient construction of red black trees from sorted associative lists
haftmann [Wed, 10 Oct 2012 12:52:24 +0200] rev 49769
more explicit code equations
bulwahn [Wed, 10 Oct 2012 10:48:55 +0200] rev 49768
adding necessary syntactic functions in set_comprehension_pointfree simproc as a first step to integrate an improved simproc
bulwahn [Wed, 10 Oct 2012 10:48:33 +0200] rev 49767
special code setup for step function in IMP is redundant as definition was tuned (cf. c54d901d2946)
bulwahn [Wed, 10 Oct 2012 10:48:17 +0200] rev 49766
test case for set_comprehension_pointfree simproc succeeds now
bulwahn [Wed, 10 Oct 2012 10:47:52 +0200] rev 49765
unfolding bounded existential quantifiers as first step in the set_comprehension_pointfree simproc
bulwahn [Wed, 10 Oct 2012 10:47:43 +0200] rev 49764
moving simproc from Finite_Set to more appropriate Product_Type theory
bulwahn [Wed, 10 Oct 2012 10:47:21 +0200] rev 49763
generalizing set_comprehension_pointfree simproc to work for arbitrary predicates (and not just the finite predicate)
bulwahn [Wed, 10 Oct 2012 10:41:18 +0200] rev 49762
adding some example that motivates some of the current changes in the set_comprehension_pointfree simproc
bulwahn [Wed, 10 Oct 2012 10:41:16 +0200] rev 49761
set_comprehension_pointfree also handles terms where the equation is not at the first position, which is a necessary generalisation to eventually handle bounded existentials; tuned
haftmann [Wed, 10 Oct 2012 08:45:27 +0200] rev 49760
more consistent error messages on malformed code equations
huffman [Tue, 09 Oct 2012 17:33:46 +0200] rev 49759
removed support for set constant definitions in HOLCF {cpo,pcpo,domain}def commands;
removed '(open)', '(set_name)' and '(open set_name)' options
kuncar [Tue, 09 Oct 2012 16:58:36 +0200] rev 49758
use Set.filter instead of Finite_Set.filter, which is removed then
kuncar [Tue, 09 Oct 2012 16:57:58 +0200] rev 49757
rename Set.project to Set.filter - more appropriate name
wenzelm [Wed, 10 Oct 2012 15:39:01 +0200] rev 49756
added some ad-hoc namespace prefixes to avoid duplicate facts;
wenzelm [Wed, 10 Oct 2012 15:27:10 +0200] rev 49755
avoid duplicate facts;
wenzelm [Wed, 10 Oct 2012 15:21:26 +0200] rev 49754
more explicit namespace prefix for 'statespace' -- duplicate facts;
wenzelm [Wed, 10 Oct 2012 15:17:40 +0200] rev 49753
eliminated spurious fact duplicates;