moved/updated basic HOL overview;

updated and re-unified (co)inductive definitions in HOL; modernized examples;

clarified current 'primrec' vs. old 'recdef'; updated examples from src/HOL/Induct;

record examples;

updated and simplified HOL datatype examples (NB: special treatment of distinctness has been discontinued in the vicinity of 542b34b178ec);

updated and re-unified HOL rep_datatype;

rearranged some sections;

updated and re-unified HOL typedef, with some live examples;

optional jedit_build/etc/user-settings enable to override defaults produced by late component initialization;

merged

add divide_.._cancel, inverse_.._iff

add surj_vimage_empty

Add restricted borel measure to {0 .. 1}

equations for subsets of atLeastAtMost

build and run Isabelle/jEdit on the spot -- requires auxiliary "jedit_build" component;

misc tuning and update;

updated versions;

added Isabelle_Process.is_active; tuned signature;

update example

name tuning

further improvements to "poly_{preds,tags}_{bang,query}" -- better solution to the combinator problem + make sure type assumptions can be discharged

prevent unsound combinator proofs in partially typed polymorphic type systems

add lemma prob_finite_product

simp rules for empty intervals on dense linear order

merged

exercise more type systems (but only sound or quasi-sound ones)

added see also

document new type system and soundness properties of the different systems

improved "poly_preds_{bang,query}" by picking up good witnesses for the possible infinity of common type classes and ensuring that "?'a::type" doesn't ruin everything

reintroduced type encodings "poly_preds_{bang,query}", but this time being more liberal about type variables of known safe sorts

more doc fiddling

more FAQs

make sure the Vampire incomplete proof detection code kicks in

automatically use "metisFT" when typed helpers are necessary

tuning

generate useful information for type axioms

slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous

updated FAQ

more informative message when Sledgehammer finds an unsound proof

tuned proofs

NEWS

point-free characterization of operations on finite sets

merged

names of fold_set locales resemble name of characteristic property more closely

clarified vacuous nature of predicate "transfer_morphism" -- equivalent to previous definiton

use point-free characterization for locale fun_left_comm_idem

tuned proof

Collect intro-rules for sigma-algebras * * * sets_Collect shouldn't be intro rules

the measurable sets with null measure form a ring

add some lemmas for infinite product measure

add measurable_Least

add restrict_sigma

add borel_eq_atLeastLessThan

Add formalization of probabilistic independence for families of sets

add Bernoulli space

add product of probability spaces with finite cardinality

remove double sum_over_space_real_distribution

a deeper understanding of the code generation adaptation compared to 9079f49053e5

updated option documentation

renamed "simple_types" to "simple"

since we always default on the "_light" encoding (for good reasons, according to Judgment Day), get rid of that suffix

tweaked ATP type systems further based on Judgment Day

honor "conj_sym_kind" also for tag symbol declarations

removed "poly_tags_light_bang" since highly unsound

distinguish between a soft timeout (30 s by defalt) and a hard timeout (60 s), to let minimization-based provers (such as CVC3, Yices, and occasionally the other provers) do their job

reintroduce TFF workaround for limitations of actual TFF implementations (ToFoF, SNARK)

fixed empty proof detection

tuning

minor doc fixes

mention version 0.6 of Vampire, since that's what's currently available for download

better error reporting: detect missing E proofs and remove Vampire native format error

NEWS

adding Code_Char_ord to code generation regression tests

adding theory to force code generation of ordering on characters to built-in ordering of characters in target languages

removed some obsolete text;

basic support for overpainting of text, imitating jEdit internals;

some support for token/chunk handling, imitating jEdit internals;

renamed thin to light, fat to heavy

code cleanup, better handling of corner cases

run blacklist algorithm only if slicing is on

implemented thin versions of "preds" type systems + fixed various issues with type args

use antiquotation

renamed "shallow" to "thin" and make it the default

more work on "shallow" encoding + adjustments to other encodings

generate type classes predicates in new "shallow" encoding

started implementing "shallow" type systems, based on ideas by Claessen et al.

added syntax for "shallow" encodings

provide isabellep as a method

append special boring facts rather than prepend them, to avoid confusing E's weighting mechanism

tuned;

less fine-grained mira dependencies

mira hack for special settings on lxbroy10

no dependencies for Isabelle_makeall, which will be built in one go

clarified handling of ISABELLE_USEDIR_OPTIONS in mira

future merge of grammars, to improve parallel performance;

only show relevant timing;

timing of Theory_Data operations, with implicit thread positions when functor is applied;

tuned;

eliminated obsolete "assert" function, including divergent (unused!?) clone in Predicate_Compile_Proof;

NEWS (cf. 4e8483cc2cc5);

simplified/unified method_setup/attribute_setup;

optional description for 'attribute_setup' and 'method_setup';

tuned signature;

merged

slightly more efficient claset operations, using Item_Net to maintain rules in canonical order;

use pointfree characterisation for fold_set locale

discontinued global config options within attribute name space;

more precise warnings: observe context visibility;

modernized structure Rule_Insts;

discontinued old / unused addss' (cf. 57f364d1d3b2);

eliminated global Unsynchronized.ref; eliminated Display.string_of_thm_without_context;

proper runtime context for auto_inv_tac;

simplified BLAST_DATA;

proper Proof.context -- eliminated global operations;

just one universal Proof.context -- discontinued claset/clasimpset;

modernized functor names; tuned;

method "deepen" with optional limit;

merged

removed redundant type annotations and duplicate examples

clarified map_simpset versus Simplifier.map_simpset_global;