extending the setcomprehension_pointfree simproc to handle nesting disjunctions, conjunctions and negations (with contributions from Rafal Kolanski, NICTA); tuned

more informative error of initial/terminal proof steps;

some attempts to unify/simplify pretty_goal;

refined Proof.the_finished_goal with more informative error; more permissive Method.all_assm_tac: do not insist in solving by assumption here to postpone failure; clarified Method.finish_text: no Thm.no_prems filtering here to postpone failure;

tuned signature;

improved adhoc height for small fonts;

further refinement of jEdit line range, avoiding lack of final \n;

more uniform tooltip color;

more NEWS;

merged

disambiguated grammar

tuned proofs

tuned

simplified 'typedef' specifications: discontinued implicit set definition and alternative name;

discontinued typedef with alternative name;

discontinued obsolete typedef (open) syntax;

discontinued typedef with implicit set_def;

merged

increading indexes to avoid clashes in the set_comprehension_pointfree simproc

no special treatment of errors inside goal forks without transaction id, to avoid duplication in plain build with sequential log, for example;

do not treat interrupt as error here, to avoid confusion in log etc.;

more basic ML compiler messages -- avoid conflict of 638cefe3ee99 and cb7264721c91 concerning Protocol.message_positions;

refined separator: FBreak needs to be free for proper breaking, extra space at end helps to work around last-line oddity in jEdit;

merged

cleanup borel_measurable_positive_integral_(fst|snd)

msetprod based directly on Multiset.fold; pretty syntax for msetprod_image

avoid global interpretation

simplified construction of fold combinator on multisets; more coherent name for fold combinator on multisets

clarified output token markup (see also bc22daeed49e);

refined aprop_tr' -- retain entity information by using type slot as adhoc marker;

refrain from quantifying outer fixes, to enable nesting of contexts like "context fixes x context assumes A x"; tuned;

tuned;

tuned;

more position information for hyperlink and placement of message;

tuned;

mira: discontinued special settings for lxbroy10, which are probably made obsolete by newer polyml

removed unused legacy material from mira.py

eliminated some remaining uses of typedef with implicit set definition;

merged

fix code equation for RBT_Impl.fold

merged

tail-recursive implementation for length

correct definition for skip_black

merged

merged

infprod generator works also with empty index set

add finite entropy

continuous version of mutual_information_eq_entropy_conditional_entropy

add induction for real Borel measurable functions

induction prove for positive_integral_fst

strong nonnegativ (instead of ae nn) for induction rule

induction prove for positive_integral_density

add induction rules for simple functions and for Borel measurable functions

introduce induction rules for simple functions and for Borel measurable functions

joint distribution of independent variables

indep_vars does not need sigma-sets

simplified definitions

remove unnecessary assumption from conditional_entropy_eq

alternative definition of conditional entropy

remove unneeded assumption from conditional_entropy_generic_eq

add induction rule for intersection-stable sigma-sets

show and use distributed_swap and distributed_jointI

rule to show that conditional mutual information is non-negative in the continuous case

continuous version of entropy_le

simplified entropy_uniform

remove incseq assumption from measure_eqI_generator_eq

generalize from prob_space to finite_measure

add measurable_compose

simplified assumptions for kolmogorov_0_1_law

merge should operate on pairs

remove incseq assumption from sigma_prod_algebra_sigma_eq

sigma_finite_iff_density_finite does not require a positive density function

tuned Lebesgue measure proofs

tuned product measurability

remove some unneeded positivity assumptions; generalize some assumptions to AE; tuned proofs

use continuity to show Borel-measurability

tuned measurable_If; moved countably_additive equalities to Measure_Space; tuned proofs

rename terminal_events to tail_event

merged

efficient construction of red black trees from sorted associative lists

more explicit code equations

adding necessary syntactic functions in set_comprehension_pointfree simproc as a first step to integrate an improved simproc

special code setup for step function in IMP is redundant as definition was tuned (cf. c54d901d2946)

test case for set_comprehension_pointfree simproc succeeds now

unfolding bounded existential quantifiers as first step in the set_comprehension_pointfree simproc

moving simproc from Finite_Set to more appropriate Product_Type theory

generalizing set_comprehension_pointfree simproc to work for arbitrary predicates (and not just the finite predicate)

adding some example that motivates some of the current changes in the set_comprehension_pointfree simproc

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

more consistent error messages on malformed code equations

removed support for set constant definitions in HOLCF {cpo,pcpo,domain}def commands; removed '(open)', '(set_name)' and '(open set_name)' options

use Set.filter instead of Finite_Set.filter, which is removed then

rename Set.project to Set.filter - more appropriate name

added some ad-hoc namespace prefixes to avoid duplicate facts;

avoid duplicate facts;

more explicit namespace prefix for 'statespace' -- duplicate facts;

eliminated spurious fact duplicates;

modernized dynamic "rules" -- avoid rebinding of static facts;

removed redundant lemma, cf. class zero_neq_one in HOL/Rings.thy;

clarified Element.init vs. Element.activate: refrain from hard-wiring Thm.def_binding_optional to avoid duplicate facts;

tuned;

clarified Local_Defs.add_def(s): refrain from hard-wiring Thm.def_binding_optional; clarified Generic_Target.define: avoid duplicate def binding via Local_Defs.add_def;

more explicit flags for facts table;

minor tuning;

more conventional Double constants;

tuned source structure;

tuned;

tuned;

merged

added type annotations to generated Isar proofs -- code by Steffen Smolka

consolidated names of theorems on composition; generalized former theorem UN_o; comp_assoc orients to the right, as is more common

corrected NEWS

avoid somewhat heavy rebuilding of SortedMap via map where plain iteration is sufficient; more elementary level_list: avoid stack overflow; prefer elementary graph operations; tuned;

clarified long_names -- conform to usual Isabelle practice of not analysing internal names;

more precise repaint and revalidate -- the latter is important to keep in sync with content update;

tuned;

prefer synchronous Mutator_Event.Bus on Swing_Thread;

more direct tooltip content;

tuned;

use Pretty_Tooltip for Graphview_Panel; tuned signature;