adapting copied bash code in mutabelle script

more correct NEWS;

merged

fix monotonicity type of None

compile

introduced hack to exploit the symmetry of equality in monotonicity calculus

cleanup example

add more flexibility to the monotonicity calculus: instead of hardcoding F-arrows, also allow G-arrows, simulating applications of the Sub rule

fixed bug in monotonicity solution display, whereby the polarity of literals was ignored

improve precision of forall in constancy part of the monotonicity calculus

added some missing well-annotatedness constraints to monotonicity calculus

more work on the monotonicity evaluation driver

improve precision of finite functions in monotonicity calculus

added ML code for testing entire theories for monotonicity

use ML SAT solvers up to a certain time limit, then switch to faster solvers with a timeout -- this becomes necessary with the new, more powerful monotonicity calculus

added examples to exercise new monotonicity code

fixed quantifier handling of new monotonicity calculus

tune parentheses and indentation

proper handling of frames for connectives in monotonicity calculus

tune indentation

removed old baggage from monotonicity calculus -- the "calculus" option didn't really work anyway because of on-the-fly simplifications

implemented All rules from new monotonicity calculus

fixed bug in clause handling in monotonicity code, whereby the unsound rule False | x <--> False was used to simplify constraints

started implementing the new monotonicity rules for application

implemented connectives in new monotonicity calculus

added "Neq" operator to monotonicity inference module

started implementing connectives in new monotonicity calculus

more work on frames in the new monotonicity calculus

support 3 monotonicity calculi in one and fix soundness bug

tuning

proper handling of assignment disjunctions vs. conjunctions

adapt monotonicity code to four annotation types

more monotonicity tuning

tuning

added frame component to Gamma in monotonicity calculus

use boolean pair to encode annotation, which may now take four values

started generalizing monotonicity code to accommodate new calculus

merged

handle "max_relevant" uniformly

honor the default max relevant facts setting from the SMT solvers in Sledgehammer

have SMT solvers report the number of facts that they should have by default in Sledgehammer -- the information might not seem to belong there but it also belongs nowhere else, for how is Sledgehammer to know how different solvers deal with hundreds of facts?

return all facts for CVC3 and Yices, since there is no proof parsing / unsat core extraction

trust SMT filter's timeout -- nested timeouts seem to be at the origin of spontaneous Interrupt exceptions in some cases

reraise interrupt exceptions

[mq]: sledge_binary_minimizer

correcting usage documentation in mirabelle tool

adding mutabelle as a component and an isabelle tool to be used in regression testing

commenting out sledgehammer_mtd in Mutabelle

removing declaration in quickcheck to really enable exhaustive testing

adding timeout to try invocation in mutabelle

adding filtering, sytactic welltyping, and sledgehammer method in mutabelle

replace `type_mapper` by the more adequate `type_lifting`

moved bootstrap of type_lifting to Fun

replace `type_mapper` by the more adequate `type_lifting`

avoid explicit encoding -- acknowledge UTF-8 as global default and Isabelle/jEdit preference of UTF-8-Isabelle;

IsabelleText font: include Cyrillic, Hebrew, Arabic from DejaVu Sans 2.32;

command 'notepad' replaces former 'example_proof';

prefer 'notepad' over 'example_proof';

merged

more intimate definition of fold_list / fold_once in terms of fold

canonical fold signature

formal notepad without any result;

added Syntax.default_root; simplified Syntax.parse operations; clarified treatment of syntax root for translation rules -- refrain from logical_type replacement; tuned error message;

eliminated obsolete Token.Malformed -- subsumed by Token.Error;

tuned @{datatype} using Syntax.pretty_priority (NB: postfix type application yields Syntax.max_pri, so arguments in prefix application require higher priority);

added Syntax.pretty_priority;

merged

conventional point-free characterization of rsp_fold

replaced memb by existing List.member

explicit type constraint; streamlined notation

tuned proposition

lemma multiset_of_rev

lemmas fold_remove1_split and fold_multiset_equiv

minor tuning for release;

source files are always encoded as UTF-8;

eliminated fragile HTML.with_charset -- always use utf-8;

recoded latin1 as utf8; use textcomp for some text symbols where it appears appropriate;

removed old generated stuff; removed DOS line endings;

comment;

update documentation

replace "smt" prover with specific SMT solvers, e.g. "z3" -- whatever the SMT module gives us

export more information about available SMT solvers

setup subtyping/coercions once in HOL.thy, but enable it only later via configuration option;

use "fold_map" instead of "fold (fn .. => .. (ts @ [t], ..)) .."

updated generated file;

removed confusing comments (cf. 500171e7aa59);

merged

removed outdated lint script

merged

compile

run synchronous Auto Tools in parallel

really fixed comment (cf. 7abeb749ae99)

theorem names generated by the (rep_)datatype command now have mandatory qualifiers

eliminated unqualified accesses of datatype facts -- it seems like they all of them were unintended

NEWS

only instantiate type variable if there exists some in quickcheck

fixing comment in library

adapting predicate_compile_quickcheck

adding a nice definition of Id_on for quickcheck and nitpick

adding code equation for finiteness of finite types

improving sledgehammer_tactic and adding relevance filtering to the tactic

adapting mutabelle

adapting SML_Quickcheck to recent changes

explaining quickcheck testers in the documentation

adapting quickcheck examples

improving presentation of quickcheck reports

declaring quickcheck testers as default after their setup

activating construction of exhaustive testing combinators

renamed generator into exhaustive

checking if parameter is name of a tester which allows e.g. quickcheck[random]

moving iteration of tests to the testers in quickcheck

removed dead test_term_small function in quickcheck

renamed parameter from generator to tester; quickcheck only applies one tester on invocation

adding configuration quickcheck_tester

adding smart quantifiers to exhaustive testing

adapting mutabelle

only handle TimeOut exception if used interactively

removed interrupt handling that violates Isabelle/ML exception model

corrected indentation

tuned