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;

make ZF_cs snapshot after final setup;

proper Proof.context for classical tactics; reduced claset to snapshot of classical context; discontinued clasimpset;

do not open ML structures;

eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);

misc tuning and simplification;

tuned proof;

tuned proof;

proper method_setup;

proper method_setup "split_idle";

proper method_setup "enabled";

simplified clasimpset declarations -- prefer attributes;

reduce the number of mono iterations to prevent the mono code from going berserk

tuned comment

optimized a common case

avoid "UnequalLengths" exception for special constant "fequal" -- and optimize code in the common case where no type arguments are needed

tweak E slices

make SML/NJ happy

fixed off-by-one bug

added convenience syntax

prefer Proof.context over old-style claset/simpset; canonical argument order;

prefer plain simpset operations;

removed obsolete old-style cs/css;

modernized dead code;

eliminated old-style MI_fast_css -- replaced by fast_solver with config option;

eliminated obsolete MI_css -- use current context directly;

proper method_setup;

modernized simproc_setup; misc tuning and simplification;

prefer Proof.context over old-style clasimpset;

modernized dead code;

modernized specifications;

merged

added hints and FAQs

prove one more lemma using Sledgehammer, with some guidance, and replace clumsy old proof that relied on old extensionality behavior

fixed several bugs in Isar proof reconstruction, in particular w.r.t. mangled types and hAPP

another concession to backward compatibility

no need to use metisFT for Isar proofs -- metis falls back on it anyway

handle equality proxy in a more backward-compatible way

remove problematic Isar proof

added two mildly higher-order examples contributed by TN, removed references to obsoleted type systems, and moved things around

robustly detect how many type args were passed to the ATP, even if some of them were omitted

make sure "simple_types_query" and "simple_types_bang" symbols are declared with the proper types

drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation

tuning

fixed conjecture resolution bug for Vampire 1.0's TSTP output

ensure Set.member isn't introduced by Meson's preprocessing if it's supposed to be unfolded

Metis doesn't find an old proof in acceptable time now that higher-order equality reasoning is supported -- tuned proof script to help it

drop support for Vampire's native output format -- it has too many undocumented oddities, e.g. "BDD definition:" lines

use the same code for extensionalization in Metis and Sledgehammer and generalize that code so that it gracefully handles negations (e.g. negated conjecture), formulas of the form (%x. t) = u, etc.

further lower penalty associated with existentials in Sledgehammer's relevance filter, so that "exhaust" facts are picked up

reenabled equality proxy in Metis for higher-order reasoning

added "SMT." qualifier for constant to make it possible to reload "smt_monomorph.ML" from outside the "SMT" theory (for experiments) -- this is also consistent with the other SMT constants mentioned in this source file

reflect option renaming in doc + do not document the type systems poly_preds? and poly_tags?, since they are virtually identical to the non-? versions

unfold set constants in Sledgehammer/ATP as well if Metis does it too

do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings

renamed "max_mono_instances" to "max_new_mono_instances" and changed its semantics accordingly

added unfold set constant functionality to Meson/Metis -- disabled by default for now

remove unused parameter

reduced penalty associated with existential quantifiers

ensure that Auto Sledgehammer is run with full type information

fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized

don't give weights to built-in symbols

more robust exception handling in Metis (also works if there are several subgoals)

no penality for constants that appear in chained facts

gracefully declare fTrue and fFalse proxies' types if the constants only appear in the helpers

improve detection of quantifications over dangerous types by leveraging "is_type_surely_finite" predicate and added "prop" to the list of surely finite types

tune whitespace

added configuration options for experimental features

ensure type class predicates are generated in symbol declarations (for "poly_preds" and similar)

avoid "Empty" exception by making sure that a certain optimization only is attempted when it makes sense

added "force_sos" options to control SPASS's and Vampire's use of SOS in experiments + added corresponding Mirabelle options

added "max_mono_instances" option to Sledgehammer and renamed old "monomorphize_limit" option

allow each slice to have its own type system

renamed type systems for more consistency

updated versions;

added toplevel isabelle package -- reduce warnings with scala-2.9.0.final;

tuned;

minor adaption for scala-2.9.0.final;

proper configuration options Proof_Context.debug and Proof_Context.verbose; discontinued alias Proof.verbose = Proof_Context.verbose;

pretend that all versions of BSD are Linux, which might actually work due to binary compatibilty mode of these obsolete platforms;

more uniform naming of lemma

add a lemma about commutative append to List.thy

removed assumption from lemma List.take_add

no need for underscore.sty -- latex.ltx provides \textunderscore and \_ already;

removed \underscoreon which is from Larry's iman.sty, not underscore.sty;

further improved type system setup based on Judgment Days

allow each prover to specify its own formula kind for symbols occurring in the conjecture

better type system setup, based on Judgment Day

improving merge of code specifications by removing code equations of constructors after merging two theories

tuned;

tuned some syntax names;

tuned rail diagrams and layout;

merged;

tuning

reintroduce unsoundnesses taken out in 4d29b4785f43 and 3c2baf9b3c61 but only for unsound type systems

added FIXME

no lies in debug output (e.g. "slice 2 of 1")

help SOS by ensuring that typing information is marked as part of the conjecture + be more precise w.r.t. typedefs in monotonicity check

query typedefs as well for monotonicity

adding examples for invoking quickcheck with records

adding creation of exhaustive generators for records; simplifying dependencies in Main theory

hopefully this will help the SML/NJ type inference

reverted 6efda6167e5d because unsound -- Vampire found a counterexample

improve suggested type system list based on evaluation

I have an intuition that it's sound to omit the first type arg of an hAPP -- and this reduces the size of monomorphized problems quite a bit

removed unsound hAPP optimization

versions of ! and ? for the ASCII-challenged Mirabelle

smoother handling of ! and ? in type system names

tuning

compile + added monotonicity tests

documentation tuning

renamed "many_typed" to "simple" (as in simple types)

update type system documentation

added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)

document monotonic type systems

exploit inferred monotonicity

[mq]: nitpick_tuning

fixed cardinality computation for function types such as "'a -> unit"

monotonic type inference in ATP Sledgehammer problems -- based on Claessen & al.'s CADE 2011 paper, Sect. 2.3.

proper case_names for int_cases, int_of_nat_induct; tuned some proofs, eliminating (cases, auto) anti-pattern;

added type annotation for SML/NJ

eta-expansion for SML/NJ

removed odd historical material;

merged

fixed per-ATP dangerous axiom detection -- embarrassing bugs introduced in change a7a30721767a

cosmetics

more conventional naming scheme: names_long, names_short, names_unique;

railsetup required for IsarRef/style;

fit page;

use existing \<hyphen>;

more precise syntax diagram;

simplified rail configuration;

provide \isabellestyle{itunderscore} (requires underscore.sty);

updated generated files;

proper treatment of empty name -- avoid excessive vertical space;

final \makeatother -- catcodes appear to be global;

fixed long name truncation logic

some documentation of @{rail} antiquotation;

more precise source position for @{rail};

sane paragraph layout;

updated configuration options -- no ML here;

tag ML as in IsarImplementation;

treat underscore as in IsarRef;

reactivated codegen example based on Lambda.thy;

formal Base theory;

reintroduce this idea of running "metisFT" after a failed "metis" -- I took it out in e85ce10cef1a because I couldn't think of a reasonable use case, but now that ATPs use sound encodings and include dangerous facts (e.g. True_or_False) it makes more sense than ever to run "metisFT" after "metis"

whitespace tuning

make SML/NJ happiest

no need to generate fact numbers for polymorphic type systems -- this confuses the TPTP exporter