merged

added missing mult_1_left to linarith simp rules

tuned proof (no induction needed); removed unused lemma and fuzzy comment

isatest: basic setup for cygwin-poly on atbroy102;

slightly more standard dependencies;

merged

tuned many proofs a bit

merged

documented [[trace_simp=true]]

add missing goal argument

adapt syntax of Sledgehammer options in examples

merged

fixed layout of Sledgehammer output

added "modulus" and "sorts" options to control Sledgehammer's Isar proof output

make Sledgehammer output "by" vs. "apply", "qed" vs. "next", and any necessary "prefer"

get rid of Polyhash, since it's no longer used

remove use of Polyhash; the new code is slightly faster. Also, "subtract_cls" now has canonical argument ordering.

reintroduce efficient set structure to collect "no_atp" theorems

made "theory_const" a Sledgehammer option; by default, it's true for SPASS and false for the others. This eliminates the need for the "spass_no_tc" ATP, which can be obtained by passing "no_theory_const" instead.

added "respect_no_atp" and "convergence" options to Sledgehammer; these were previously hard-coded in "sledgehammer_fact_filter.ML"

adding MREC induction rule in Imperative HOL

made smlnj happy

adding examples of function predicate replacement and arithmetic examples for the predicate compiler; tuned

adopting specialisation examples to moving the alternative defs in the library

adding setup for handling arithmetic of natural numbers and integers precisely and more efficiently in the predicate compiler; changed alternative size_list definition for predicate compiler

no specialisation for predicates without introduction rules in the predicate compiler

improving lookup function to handle overloaded constants more correctly in the function flattening of the predicate compiler

activating the signature of Predicate_Compile again which was deactivated in changeset d93a3cb55068 for debugging purposes

adding iterate_upto interface in compilations and iterate_upto functions in Isabelle theories for arithmetic setup of the predicate compiler

clarifying the Predicate_Compile_Core signature

adding signature to Predicate_Compile_Aux; tuning Predicate_Compile_Aux structure

putting compilation setup of predicate compiler in a separate file

simplify fold_graph proofs

NEWS

removed dead code; fixed typo

switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)

merged

adding skip_proof in the examples because proof procedure cannot handle alternative compilations yet

tuned

generalized alternative functions to alternative compilation to handle arithmetic functions better

correcting alternative functions with tuples

no specialisation for patterns with only tuples in the predicate compiler

adding registration of functions in the function flattening

added book-keeping, registration and compilation with alternative functions for predicates in the predicate compiler

adding specialisation examples of the predicate compiler

adding specialisation of predicates to the predicate compiler

returning an more understandable user error message in the values command

adding Lazy_Sequences with explicit depth-bound

removing fishing for split thm in the predicate compiler

prefer recursive calls before others in the mode inference

added statistics to values command for random generation

adopting Predicate_Compile_Quickcheck

made quickcheck generic with respect to which compilation; added random compilation to quickcheck

removed yieldn in Lazy_Sequence and put in the ML structure; corrects behaviour of values command

adding a hook for experiments in the predicate compilation process

removing simple equalities in introduction rules in the predicate compiler