generate correct correspondence relation name

more uniform title, follow-up to 928cb8b35e6e;

tuned

defer interpretation of markup via implicit print mode;

merged

made SML/NJ happier

pack window before accessing its geometry;

always refresh font metrics, to help window size calculation (amending 2585c81d840a);

more precise tooltip window size;

take component width as indication if it is already visible/layed-out, to avoid multiple formatting with minimal margin;

reset active area for outdated snapshot (again?);

some support for implicit senback, meaning that it uses the caret position instead of explicit command exec_id;

more abstract Sendback operations, with explicit id/exec_id properties; purge result messages (again), cf. db58490a68ac, 7b61a539721e;

some support for breakable text and paragraphs; tuned Symbol.scanner, which operates on symbols, not characters;

tuned names

tuned comment;

clarified symbol groups, despite this traditional arrangement in X-symbol grid;

always retain message positions, in order to allow Isabelle_Rendering.sendback retrieve the exec_id, even in tooltip or detached window;

tuned whitespace;

merged

included abbrev in tooltip

removed (unicode) tooltips: can not adjust font in basic swing tooltip

delayed search to improve reactivity

respect font property for symbols

capitalize lowercase groups; tuned with mkString

merged

more generous timeout for SML/NJ, which is approx. 40-80 times slower than Poly/ML; more generous timeout for HOL-Quickcheck_Examples, which is rather slow in checking its examples (and mostly sequential);

Countable_Set: tuned lemma names; more generic lemmas

enable Symbols dockable by default;

tuned;

accomodate scala-2.10.0-RC2 with its slight reform on for-syntax;

renamed BNF/Countable_Set to Countable_Type and moved its generic stuff to Library/Countable_Set

dockable with buttons for symbols, grouped and sorted in tabs according to ~~/etc/symbols; search field for symbols

CONTRIBUTION: add fabians work

NEWS: document changes in HOL-Probability

NEWS (changeset 13211e07d931): add Countable_Set

NEWS (changeset 69b35a75caf3): document changes in FuncSet

new theory of immutable arrays

some grouping of Isabelle symbols, based on X-Symbol grid in PG-3.7.1.1 and a proposal by Fabian Immler;

support for symbol groups, retaining original order of declarations; updated WWW_Find: untested change of ad-hoc parser of ~~/etc/symbols;

tuned;

add Countable_Set theory

tuned proof

simplified command line of "isabelle install";

known problems with Mac OS X are back -- Java 7u6 is not the last word (cf. ce37d4f8b4f4);

some documentation for "algebra" in HOL;

global default for session timeout;

alternative completion for outer syntax keywords;

init options on startup as well;

theorem status about oracles/futures is no longer printed by default; renamed Proofterm/Thm.status_of to Proofterm/Thm.peek_status to emphasize its semantics;

tuned: use induction rule sigma_sets_induct_disjoint

tuned FinMap

merge extensional dependent function space from FuncSet with the one in Finite_Product_Measure

more refs;

isabelle build no longer supports document_dump/document_dump_mode (no INCOMPATIBILITY, since it was never in official release); always generate sty files, as before c5d0f19ef7cb;

proper jvmpath for windows;

more generous tracing_limit, with explicit system option;

adjust max_threads_value to capabilities of Poly/ML 5.5 and current hardware;

update options via protocol; jEdit dialog for "Parallel Checking" options;

more accurate pixel_range -- do not round offset here;

tuned signature;

prefer absolute default $USER_HOME/Scratch.thy;

more portable process exit;

tuned -- eliminate pointless ML method definition;

tuned;

NEWS;

tuned structure of Isabelle/HOL;

method setup for Classical steps;

tuned signature;

updated keywords;

moved (b)choice_iff(') to Hilbert_Choice

move theorems to be more generally useable

merged

made SML/NJ happy;

renamed prob_space to proj_prob_space as it clashed with Probability_Measure.prob_space

renamed measurable_compose -> measurable_finmap_compose, clashed with Sigma_Algebra.measurable_compose

measurability for nat_case and comb_seq

rules for AE and prob

rules for intergration: integrating nat-functions, integrals on finite measures, constant multiplication

more measurability rules

renamed to more appropriate lim_P for projective limit

allow arbitrary enumerations of basis in locale for generation of borel sets

repaired slip accidentally introduced in 57209cfbf16b

prefer implementation in HOL; n.b. code_reflect cannot reflect type synonyms

corrected headers

hide constants of auxiliary type finmap

generalized to copy of countable types instead of instantiation of nat for discrete topology

added projective limit; proof is based on auxiliary type finmap::polish_space

regularity of measures, therefore: characterization of closure with infimum distance; characterize of compact sets as totally bounded; added Diagonal_Subsequence to Library; introduced (enumerable) topological basis; rational boxes as basis of ordered euclidean space; moved some lemmas upwards

tuned -- eliminated obsolete citation of isabelle-ref;

updated basic equality rules;

removed somewhat pointless historic material;

updated unification options;

removed some historic material that is obsolete or rarely used;

tuned;

updated section on ordered rewriting;

updated subgoaler/solver/looper;

removed somewhat pointless historic material; tuned;

tuned;

updated explanation of rewrite rules;

(re)moved old material about Simplifier;

some coverage of "resolution without lifting", which should be normally avoided;

removed somewhat pointless historic material;

updated biresolve_tac, bimatch_tac; removed obscure historical material;

moved classical wrappers to IsarRef; removed somewhat pointless historic material;

avoid clash of terminology wrt. "semi-automated" in the sense of Isar (e.g. method "rule");

updated citations;

tuned;

removed junk;

removed pointless historic material;

more on Simplifier rules, based on old material;

refurbished Simplifier examples;

more on the Simplifier, based on old material;

more concise/precise documentation;

tuned text

replaced relation by function - simplifies development

made SMLNJ happier

import Sublist rather than PrefixOrder to avoid unnecessary class instantiation

prefer explicit Random.seed

dropped dead code

tuned import order

tuned layout

fixed detection of tautologies -- things like "a = b" in a structured proof, where a and b are Frees, shouldn't be discarted as tautologies

create temp directory if not already created

merged

new theory IMP/Finite_Reachable

avoid messing too much with output of "string_of_term", so that it doesn't break the yxml encoding for jEdit

centralized term printing code

thread context correctly when printing backquoted facts

dropped dead code; tuned theory text

modernized, simplified and compacted oracle and proof method glue code; corrected slips with poly.Pw and Orderings.less(_eq)

merged

fixed underscores

moved lemmas into projective_family; added header for theory Projective_Family

removed redundant/unnecessary assumptions from projective_family

assume probability spaces; allow empty index set

added projective_family; generalized generator in product_prob_space to projective_family

moved lemmas further up

tuned proofs

using hyp_subst_tac that allows to pass the current simpset to avoid the renamed bound variable warning in the simplifier

hyp_subst_tac allows to pass an optional simpset to the internal simplifier call to avoid renamed bound variable warnings in the simplifier call

NEWS

rewriting with the simpset that is passed to the simproc

handling x : S y pattern with the default mechanism instead of raising an exception in the set_comprehension_pointfree simproc

tuned

syntactic tuning and restructuring of set_comprehension_pointfree simproc

using more proper simpset in tactic of set_comprehension_pointfree simproc to avoid renamed bound variable warnings in recursive simplifier calls

improving the extension of sets in case of more than one bound variable; rearranging the tactic to prefer simpler steps before more involved ones

adjusting proofs as the set_comprehension_pointfree simproc breaks some existing proofs

importing term with schematic type variables properly before passing it to the tactic in the set_comprehension_pointfree simproc

handling arbitrary terms in the set comprehension and more general merging of patterns possible in the set_comprehension_pointfree simproc

simplified structure of patterns in set_comprehension_simproc

refined stack of library theories implementing int and/or nat by target language numerals

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)

add support for function application to measurability prover

renamed Sledgehammer option

always show timing for structured proofs

use implications rather than disjunctions to improve readability

avoid name clashes

fixed more "Trueprop" issues

removed needless sort

avoid double "Trueprop"s

use original formulas for hypotheses and conclusion to avoid mismatches

track formula roles in proofs and use that to determine whether the conjecture should be negated or not

correct parsing of E dependencies

proper handling of assumptions arising from the goal's being expressed in rule format, for Isar proof construction

tuned

code for while directly, not via while_option

executable true liveness analysis incl an approximating version

now that sets are executable again, no more special treatment of variable sets

handle non-unit clauses gracefully

several improvements to Isar proof reconstruction, by Steffen Smolka (step merging in case splits, time measurements, etc.)

use measurability prover

add measurability prover; add support for Borel sets

add syntax and a.e.-rules for (conditional) probability on predicates

infinite product measure is invariant under adding prefixes

for the product measure it is enough if only one measure is sigma-finite

Allow parentheses around left-hand sides of array associations

made MaSh more robust in the face of duplicate "nicknames" (which can happen e.g. if you have a lemma called foo(1) and another called foo_1 in the same theory)

regenerated SMT certificates

regenerated "SMT_Examples" certificates after soft-timeout change + removed a few needless oracles

fixed bool vs. prop mismatch

removed "refute" command from Isar manual, now that it has been moved outside "Main"

repaired "Mutabelle" after Refute move

less verbose -- the warning will reach the users anyway by other means

tuned messages

moved "SAT" before "FunDef" and moved back all SAT-related ML files to where they belong

fixes related to Refute's move

added a timeout around script that relies on the network

took out "using only ..." comments in Sledgehammer generated metis/smt calls, until these can be generated soundly

moved Refute to "HOL/Library" to speed up building "Main" even more

tuning

use metaquantification when possible in Isar proofs

tuned code

tuning

soft SMT timeout

added function store_termination_rule to the signature, as it is used in Nominal2

longer log, to accomodate final status line of isabelle build;

transfer package: error message if preprocessing goal to object-logic formula fails

transfer package: add test to prevent trying to make cterms from open terms

transfer package: more flexible handling of equality relations using is_equality predicate

ensured that rewr_conv rule t = "t == u" literally not just modulo beta-eta

new theorems

incorporated constant chars into instantiation proof for enum; tuned proofs for properties on enum of chars; swapped theory dependency of Enum.thy and String.thy

close code theorems explicitly after preprocessing

tuned proofs;

further attempts to cope with large files via option jedit_text_overview_limit;

more detailed Prover IDE NEWS;

recovered explicit error message, which was lost in b8570ea1ce25;

removed dead code;

proper signatures;

tuned;

merged

Renamed {left,right}_distrib to distrib_{right,left}.

Tuned.

more conventional argument order; dropped dead code

another refinement in the comprehension conversion

refined simplifier call in comprehension_conv

passing around the simpset instead of the context; rewriting tactics to avoid the 'renamed bound variable' warnings in nested simplifier calls

avoid STIX font, which tends to render badly;

extra jar for scala-2.10.0-RC1;

more explicit auxiliary classes to avoid warning "reflective access of structural type member method" of scala-2.10.0-RC1;

avoid duplicate build of jars_fresh;

obsolete, cf. README_REPOSITORY;

accomodate scala-2.10.0-RC1;

tailored enum specification towards simple instantiation; tuned enum instantiations

refined internal structure of Enum.thy

moved quite generic material from theory Enum to more appropriate places

adding another test case for the set_comprehension_simproc to the theory in HOL/ex

improving tactic in setcomprehension_simproc

adjusting proofs

tuned tactic in set_comprehension_pointfree simproc to handle composition of negation and vimage

passing names and types of all bounds around in the simproc

locally inverting previously applied simplifications with ex_simps in set_comprehension_pointfree

more precise pixel_range: avoid popup when pointing into empty space after actual end-of-line;

merged

don't include Quotient_Option - workaround to a transfer bug

ignore old stuff and thus speed up the script greatly;

proper find -mtime (file data) instead of -ctime (meta data);

made SML/NJ happy;