re-added accidental omission

tuned includes

prevent line breaks after Scala symbolic operators

corrected semantics of presentation_stmt_names; do not print includes on presentation selection

code_include Scala: qualify module nmae

merged

preliminary implementation of hierarchical module name space

tuned

proper context for various Thy_Output options, via official configuration options in ML and Isar;

Thy_Output: options based on proper context, although Thy_Output.add_wrapper still allows to maintain old-style wrapper combinators (setmp_CRITICAL etc.);

eliminated old 'local' command;

more uniform descriptions, which end up in the collective output of 'print_attributes' for example;

Fast_Lin_Arith.number_of: more conventional merge that prefers the left side -- note that former ordering wrt. serial numbers makes it depend on accidental load order;

slightly more abstract data handling in Fast_Lin_Arith;

theory data merge: prefer left side uniformly;

tuned;

simplification/standardization of some theory data;

misc tuning and simplification, notably theory data;

renamed Local_Theory.theory(_result) to Local_Theory.background_theory(_result) to emphasize that this belongs to the infrastructure and is rarely appropriate in user-space tools;

renamed ProofContext.theory(_result) to ProofContext.background_theory(_result) to emphasize that this belongs to the infrastructure and is rarely appropriate in user-space tools;

standardized Context.copy_thy to Theory.copy alias, with slightly more direct way of using it;

merged

merged

consider "locality" when assigning weights to facts

add a bonus for chained facts, since they are likely to be relevant; (especially in a Mirabelle run!) -- chained facts used to be included forcibly, then were treated as any other fact; the current approach seems more flexible

merged

add a penalty for lambda-abstractions; the penalty will kick in only when the goal contains no lambdas, in which case Sledgehammer previously totally disallowed any higher-order construct; this was too drastic; lambdas are dangerous because they rapidly lead to unsound proofs; e.g. COMBI_def COMBS_def not_Cons_self2 with explicit_apply

renaming

fiddle with relevance filter

update docs

reorganize options regarding to the relevance threshold and decay

make relevance filter work in term of a "max_relevant" option + use Vampire SOS; "max_relevant" is more reliable than "max_relevant_per_iter"; also made sure that the option is monotone -- larger values should lead to more axioms -- which wasn't always the case before; SOS for Vampire makes a difference of about 3% (i.e. 3% more proofs are found)

simplify more code

cosmetics

get rid of "defs_relevant" feature; nobody uses it and it works poorly

make SML/NJ happy

renamed "relevance_convergence" to "relevance_decay"

make sure that "undo_ascii_of" is the inverse of "ascii_of", also for non-printable characters -- and avoid those in ``-style facts

better workaround for E's off-by-one-second issue

merged

renaming variables to conform to prolog names

changing hotel trace definition; adding simple handling of numerals on natural numbers

added quickcheck generator for prolog generation; first example of counterexample search with prolog for hotel key card system

moving preprocessing to values in prolog generation

invocation of values for prolog execution does not require invocation of code_pred anymore

adding hotel keycard example for prolog generation

improving output of set comprehensions; adding style_check flags

improving ensure_groundness in prolog generation; added further example

adding very basic transformation to ensure groundness before negations

Markup_Tree.select: uniform treatment of root_range wrt. singularities, yielding empty result stream;

tuned signature;

Pretty: tuned markup objects;

tuned;

organized markup properties via apply/unapply patterns;

added some proof state markup, notably number of subgoals (e.g. for indentation); tuned;

ML_Context.eval: produce antiquotation environment preferably in invisible context, to avoid displaced report messages from ML_Compiler;

merged

tuned code

quotient package: deal correctly with frees in lifted theorems

approximation_oracle: actually match true/false in ML, not arbitrary values;

renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;

more precise Command.State accumulation;

eliminated some old camel case stuff;

some attempts to recover Isabelle/ML style from the depths of time;

keep persistent production tables as immutable vectors -- potential performance improvement on modern hardware;

select tangible text ranges here -- more robust against ongoing changes of the markup query model

structure Thm: less pervasive names;

discontinued obsolete 'global' and 'local' commands;

merged

merged

moved generic lemmas in Probability to HOL

merged

traling newline on standard output

Quotient Package / lemma for regularization of bex1_rel for equivalence relations

merged

make Mirabelle happy

compute names lazily; there's no point to compute the names of 10000 facts when only 500 are used

clean handling of whether a fact is chained or not; more elegant and reliable than encoding it in the name

don't backtick facts that contain schematic variables, since this doesn't work (for some reason)

quote facts whose names collide with a keyword or command name (cf. "subclass" in "Jinja/J/TypeSafe.thy")

revert this idea of automatically invoking "metisFT" when "metis" fails; there are very few good reasons why "metisFT" should succeed when "metis" fails, and "metisFT" tends to "diverge" more often than "metis -- furthermore the exception handling code wasn't working properly

use matching of types than just equality - this is needed in nominal to cope with type variables

merge

cosmetics

use a soft time limit for E with a hard limit, "eproof"/"eproof.pl" doesn't show the proof is there's less than 1 second left, yielding "the ATP output is malformed"

make remote ATP versions more robust, by starting with "preferred" version numbers and falling back on any version

cosmetics

optimize fact filter some more

cache previous iteration's weights, and keep track of what's dirty and what's clean; this speeds up the relevance filter significantly

modified relevance filter

adjust fudge factors in the light of experiments

invert semantics of "relevance_convergence", to make it more intuitive

if no facts were selected on first iteration, try again with a lower threshold

weed out junk in relevance filter

no need for "eq" facts -- good old "=" is good enough for us

revert unintended change

destroy elim rules before checking for finite exhaustive facts

prevent double inclusion of the fact "True_or_False" in TPTP problems

merged

tuned

merged

dropped pre_post_conv

use conv alias

preliminary versions of static_eval_conv(_simple)

use Code_Thingol.static_eval_conv_simple

added static_eval_conv

refined and unified naming convention for dynamic code evaluation techniques

tap_thy conversional

dropped now obsolete purge_data -- happens implicitly on change of theory identity

merged

introducing simplification equations for inductive sets; added data structure for storing equations; rewriting retrieval of simplification equation for inductive predicates and sets

added support for xsymbol syntax for mode annotations in code_pred command

tuned raw Sidekick output;

Text.Range.is_singleton;

Markup_Tree.+: new info tends to sink to bottom, where it is prefered by select;

tuned;

Markup_Tree.select: more straight-forward recursion producing one main stream, avoid fragmentation of parent info due to ignored subtree; tuned;

tuned root markup;

misc tuning of important special cases;

Rewrite the Probability theory. Introduced pinfreal as real numbers with infinity. Use pinfreal as value for measures. Introduces Lebesgue Measure based on the integral in Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure spaces.