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

smallvalue_generator are defined quick via oracle or sound via function package

adding shorter output syntax for the finite types of quickcheck

improving readability of Smallcheck theory; adding constant orelse to improve performance of the function package

changed order of lemmas to overwrite the general code equation with the nbe-specific one