tuned message;

tuned comment;

avoid spurious "bad" markup for show/test_proof; tuned;

more official Future.terminate; tuned signature;

simp results for simplification results of Inf/Sup expressions on bool; tuned proofs

no sort constraints on datatype constructors in internal bookkeeping

HOL-BNF-Examples is sequential for now, due to spurious interrupts (again);

merged

comprehension conversion reuses suggested names for bound variables instead of invented fresh ones; tuned tactic

checking for bound variables in the set expression; handling negation more generally

set_comprehension_pointfree simproc now handles the complicated test case; tuned

refined conversion to only react on proper set comprehensions; tuned

moving Pair_inject from legacy and duplicate section to general section, as Pair_inject was considered a duplicate in e8400e31528a by mistake (cf. communication on dev mailing list)

employing a preprocessing conversion that rewrites {(x1, ..., xn). P x1 ... xn} to {(x1, ..., xn) | x1 ... xn. P x1 ... xn} in set_comprehension_pointfree simproc

another Future.shutdown after Future.cancel_groups (cf. 0d4106850eb2);

more robust cancel_now: avoid shooting yourself in the foot;

more robust Session.finish (batch mode): use Goal.finish_futures to exhibit remaining failures of disconnected goal forks (e.g. from unnamed theorems) and Goal.cancel_futures the purge the persistent state;

proper 'oops' to force sequential checking here, and avoid spurious *** Interrupt stemming from crash of forked outer syntax element;

added Output "Detach" button;

skipped proofs appear as "bad" without counting as error;

more method position information, notably finished_pos after end of previous text;

more formal markup;

tuned signature; prefer exception Fail for internal errors;

more formal markup;

don't be so aggressive when expanding a transfer rule relation; rewrite only the relational part of the rule

merged

added missing file

tuned for document output

added proof minimization code from Steffen Smolka

tuned blank lines

tuned whitespace

a few notations changed in HOL/BNF/Examples/Derivation_Trees

ported HOL/BNF/Examples/Derivation_Trees to the latest status of the codatatype package

adding test cases for f x y : S patterns in set_comprehension_pointfree simproc

tactic of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage

term construction of set_comprehension_pointfree simproc handles f x y : S patterns with Set.vimage

extending preprocessing of simproc to rewrite subset inequality into membership of powerset

update ROOT with teh directory change in BNF

changed name of BNF/Example directory from Infinite_Derivation_Trees to Derivation_Trees

retain info dockable state via educated guess on window focus;

support for more informative errors in lazy enumerations;

more informative errors for 'also' and 'finally';

tuned messages;

more proof method text position information;

clarified defer/prefer: more specific errors;

updated Toplevel.proofs;

more informative errors for 'proof' and 'apply' steps; more Seq.result operations;

more friendly handling of Pure.thy bootstrap errors;

more informative error for stand-alone 'qed';

further attempts to unify/simplify goal output;

more informative error messages of initial/terminal proof methods; more systematic support for sequences with embedded errors; tuned Seq.maps;

merged

setcomprehension_pointfree simproc also works for set comprehension without an equation

tuned message -- avoid extra blank lines;

updated to polyml-5.5.0 which reduces chance of HOL-IMP failure (although it is hard to reproduce anyway);

store colors after build

adding further test cases for the set_comprehension_pointfree simproc

refined tactic in set_comprehension_pointfree simproc

adding further test cases to check new functionality of the simproc; strengthened test cases to check the success of the simproc more faithfully

adding postprocessing of computed pointfree expression in set_comprehension_pointfree simproc

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