added options to Sledgehammer; syntax: sledgehammer [options] goal_no, where "[options]" and "goal_no" are optional

make "sledgehammer" and "atp_minimize" improper commands

Sorts.of_sort_derivation: do not use slow Graph.irreducible_paths here, which not always needed (SUBTLE CHANGE IN SEMANTICS); officially export weaken as Sorts.classrel_derivation; tuned comments;

removed unused AxClass.of_sort derivation;

more precise dependencies;

merged

merged

removed predicate_compile_core.ML from HOL-ex session

added predicate compiler quickcheck examples to new session Predicate_Compile_Examples

adopting examples to Library move

moved further predicate compile files to HOL-Library

added simple setup for arithmetic on natural numbers

removing uncommented examples in setup theory of predicate compile quickcheck

moved examples for the predicate compiler into its own session Predicate_Compile_Examples to slenderise the HOL-ex session

slightly more logical bootstrap order -- also helps to sort out proof terms extension;

remove ancient continuity tactic

removed Cache_IO component

updated SMT certificates

inhibit invokation of external SMT solver

more precise dependencies

cache_io is now just a single ML file instead of a component

use internal SHA1 digest implementation for generating hash keys

remove component Cache_IO (external dependency on MD5 will be replaced by internal SHA1 digest implementation)

merged

minimize dependencies

sublocale comm_monoid_add < setprod --> sublocale comm_monoid_mult < setprod

use ml_platform instead of ml_system to distinguish library names

merged

use LONG rather than INT to represent the C datatype size_t

merged

remove continuous let-binding function CLet; add cont2cont rule ordinary Let

move letrec stuff to new file HOLCF/ex/Letrec.thy

more accurate dependencies;

even less ambitious isatest for smlnj;

Unhide measure_space.positive defined in Caratheodory.

Generate image for HOL-Probability

updated Thm.add_axiom/add_def;

completely remove constants cpair, cfst, csnd

use Pair instead of cpair in Fixrec_ex.thy

use Pair instead of cpair

define CLetrec using Pair, fst, snd instead of cpair, cfst, csnd

define csplit using fst, snd

convert lemma fix_cprod to use Pair, fst, snd

remove unused syntax for as_pat, lazy_pat

add lemmas fst_monofun, snd_monofun

use Pair instead of cpair

use fixrec_simp instead of fixpat

use Pair, fst, snd instead of cpair, cfst, csnd

remove admw predicate

remove contlub predicate

merged

error -> raise Fail

merged

merged

merged

remove unused adm_tac.ML

avoid dependence on adm_tac solver

remove obsolete holcf_logic.ML

fix ML warning in domain_library.ML

fix ML warnings in repdef.ML

fix ML warnings in fixrec.ML

fix ML warnings in pcpodef.ML

fix LaTeX overfull hbox warnings in HOLCF document

remove LaTeX hyperref warnings by avoiding antiquotations within section headings

explicit Simplifier.global_context;

recovered header;

eliminated old-style Drule.add_axiom in favour of Specification.axiom, with explicit Drule.export_without_context to imitate the old behaviour;

inlined version of old-style Drule.add_axioms -- Specification.axiom is not bootstrapped yet;

use Specification.axiom, together with Drule.export_without_context that was implicit in the former PureThy.add_axioms (cf. f81557a124d5);

added Specification.axiom convenience;

detect OFCLASS() axioms in Nitpick; this is necessary now that "Thy.all_axioms_of" returns such axiom (starting with change 46cfc4b8112e)

merged

contextifying the compilation of the predicate compiler

removed unused Predicate_Compile_Set

avoiding fishing for split_asm rule in the predicate compiler

contextifying the proof procedure in the predicate compiler

making flat triples to nested tuple to remove general triple functions

reduced the debug output functions from 2 to 1

some improvements thanks to Makarius source code review

adding proof procedure for cases rule with tuples; adding introduction rule for negated premises; improving proof procedure with negated premises

enabling a previously broken example of the predicate compiler again

improving handling of case expressions in predicate rewriting

adding depth_limited_random compilation to predicate compiler

a new simpler random compilation for the predicate compiler

reviving the classical depth-limited computation in the predicate compiler

cleaning the function flattening

generalized split transformation in the function flattening

only adding lifted arguments to item net in the function flattening; correcting indentation; removing dead code

restructuring function flattening

renaming mk_prems to flatten in the function flattening

simplifying function flattening

removed warning_count (known causes for warnings have been resolved)

remove the iteration counter from Sledgehammer's minimizer

merged

start work on direct proof reconstruction for Sledgehammer

renamed "e_full" and "vampire_full" to "e_isar" and "vampire_isar"; "full" sounds like "full types" or something, not like a structured Isar proof -- at some point I hope to make this an option that's orthogonal to the prover

move all ATP setup code into ATP_Wrapper

move the Sledgehammer Isar commands together into one file; this will make easier to add options and reorganize them later

more Sledgehammer refactoring

use a proof context instead of a local theory

provide a hook to safely manipulate verification conditions

replaced old-style Drule.add_axiom by Specification.axiomatization

removed e-mail address from error message

merged

tuned whitespace

handle hidden polymorphism in class target (without class target syntax, though)

replaced Theory.add_axioms(_i) by more primitive Theory.add_axiom;

replaced PureThy.add_axioms by more basic Drule.add_axiom, which is old-style nonetheless;

add_axiom: axiomatize "unconstrained" version, with explicit of_class premises; more uniform add_axiom/add_def;

Logic.mk_of_sort convenience;

more explicit invented name;

minor renovation of old-style 'axioms' -- make it an alias of iterated 'axiomatization';

do not open ML structures;

modernized overloaded definitions;

standard headers;

slightly more uniform definitions -- eliminated old-style meta-equality;

eliminated old constdefs;

corrected setup for of_list

renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;

added lemma infinite_Un