dropped unused structure aliases;

tuned;

NEWS: structure Timing provides various operations for timing;

simplified various cpu_time clones (!): eliminated odd Exn.capture/Exn.release (no need to "stop" timing);

pure Timing.timing, without any exception handling; clarified cond_timeit: propagate interrupt without side-effect;

structure Timing: covers former start_timing/end_timing and Output.timeit etc; explicit Timing.message function; eliminated Output.timing flag, cf. Toplevel.timing; tuned;

pervasive cond_timeit;

eliminated dead code;

parallel preparation of document variants, within separate directories;

Present.init/finish/no_document are not thread-safe -- eliminated futile CRITICAL sections; tuned;

eliminated redundant doc_prefix1; tuned;

renamed doc_prefix2 to dump_prefix;

tuned;

tuned terminology for document variants;

replaced File.check by specific File.check_file, File.check_dir; clarified File.full_path -- include parts of former Thy_Load.get_file; simplified Thy_Load.check_file -- do not read/digest yet; merged Thy_Load.check_thy/deps_thy -- always read text and parse header; clarified Thy_Header.read -- NB: partial Path.explode outside of args parser combinator; Thy_Info.check_deps etc.: File.read exactly once;

tuned;

preencode value of "need" selectors in Kodkod bounds as an optimization

ignore "need" axioms for "nat"-like types

added "simp:", "intro:", and "elim:" to "try" command

optimize Kodkod axioms further w.r.t. "need" option

optimize Kodkod bounds of nat-like datatypes

more optimizations of bounds for "need"

optimize Kodkod bounds when "need" is specified

always destroy constructor patterns, since this seems to be always useful

reintroduced "show_skolems" option -- useful when too many Skolems are displayed

reword Nitpick's wording concerning potential counterexamples

prevent an exception if "card" is empty (e.g., "nitpick [card]")

add option to function to keep trivial ATP formulas, needed for some experiments

add option to relevance filter's "all_facts" function to really get all facts (needed for some experiments)

tuned lemma

added lemmas

added lemma

support non-ground "need" values

recover Isabelle symlink for public distribution, notably website;

standardized headers;

merged

reworked Probability theory: measures are not type restricted to positive extended reals

split Extended_Reals into parts for Library and Multivariate_Analysis

lemmas about addition, SUP on countable sets and infinite sums for extreal

add infinite sums and power on extreal

introduce setsum on extreal

use abs_extreal

simplified definition of open_extreal

use case_product for extrel[2,3]_cases

add Extended_Reals from AFP/Lower_Semicontinuous

add lemmas for monotone sequences

add lemmas for SUP and INF

generalize infinite sums

moved t2_spaces to HOL image

example settings for ISABELLE_GHC, ISABELLE_OCAML, ISABELLE_SWIPL;

isatest: fresh copy of settings avoids odd cumulative environment;

tuned exhaustive_generators

removing definition of cons0; hiding constants in Quickcheck_Narrowing

tuned subsubsection names in Quickcheck_Narrowing

tuned exhaustive generator compilation; added narrowing generator compilation; removed exec as does not work properly here (reverting changeset 994d088fbfbc)

correcting names in Narrowing_Engine and example theory for Quickcheck_Narrowing

renaming series and serial to narrowing in Quickcheck_Narrowing

eliminated Bali.thy which takes quite long to merge and does not parallelize so well -- essentially reverting 9b19cbb0af28;

tuned headers;

eliminated hard tabs;

less ambitious isatest;

modernized imports (untested!?);

files are identified via SHA1 digests -- discontinued ISABELLE_FILE_IDENT;

explicit type SHA1.digest;

slightly more robust bash exec, which fails on empty executable;

cleanup of former settings GHC_PATH, EXEC_GHC, EXEC_OCAML, EXEC_SWIPL, EXEC_YAP -- discontinued implicit detection; determine swipl_version at runtime;

some cleanup of old-style settings;

clarified ISABELLE_CSDP setting (formerly CSDP_EXE);

more conventional Mutabelle settings -- similar to Mirabelle;

more basic use of Path.position/File.read;

prefer qualified ISABELLE_NEOS_SERVER;

proper File.shell_path;

more conventional variable name;

Path.print is the official way to show file-system paths to users -- note that Path.implode often indicates violation of the abstract datatype;

fixed document;

isatest: test more external code;

tuned headers;

allow spaces in executable names; simplified generated bash scripts;

tuned;

tuned headers;

adapting example file to renaming of the quickcheck tester

renaming tester from lazy_exhaustive to narrowing

minor corrections for renaming; moved postprocessing of terms to Quickcheck_Common

renaming example file correctly

adapting Main file generation for Quickcheck_Narrowing

adapting Quickcheck_Narrowing and example file to new names

renaming LSC_Examples theory to Quickcheck_Narrowing

renaming lazysmallcheck ML file to Quickcheck_Narrowing

renaming LSC to Quickcheck_Narrowing

adaptions in generators using the common functions

adding file quickcheck_common to carry common functions of all quickcheck generators

adapting record package to renaming of quickcheck's structures

moving and renaming lazysmallcheck to narrowing which reflects the characteristical behaviour better

correcting dependencies in IsaMakefile

renaming signatures and structures; correcting header

adapting Quickcheck theory after moving ML files

moving quickcheck_generators.ML to Quickcheck directory and renaming it random_generators.ML

moving exhaustive_generators.ML to Quickcheck directory

correcting dependencies after renaming

replacing naming of small by exhaustive

renaming smallvalue_generators.ML to exhaustive_generators.ML

renaming constants in Quickcheck_Exhaustive theory

renaming Smallcheck to Quickcheck_Exhaustive

only testing theory LSC_Examples when GHC is installed on the machine

increasing timeout of example for counterexample generation

adding termination proofs to series functions in LSC; commenting out momentarily unused term refinement functions in LSC

adding lazysmallcheck example theory to HOL-ex session

adding serial instance of finite_4 in lazysmallcheck; changing code equations for implies

replacing strings in generated Code resolves the changing names of Typerep in lazysmallcheck prototype

changing invocation of ghc from interactive mode to compilation increases the performance of lazysmallcheck by a factor of twenty; changing Integer type to Int reduces by another 50 percent

adding an example theory for Lazysmallcheck prototype

adding Lazysmallcheck prototype to HOL-Library

adding files for prototype of lazysmallcheck

removing debug message in quickcheck's postprocessor

fixing postprocessing; adding a configuration to enable and disable pretty presentation of quickcheck's counterexample

renaming dest_plain_fun to dest_fun_upds and adding handling of undefined for postprocessing of quickcheck

improving term postprocessing for counterexample presentation in quickcheck

tuned

finished and tested Z3 proof reconstruction for injective functions; only treat variables as atomic, and especially abstract constants (Isabelle's interpretation of these constants is most likely not known to Z3 and thus irrelevant for the proof)

improved formula for specialization, to prevent needless specializations -- and removed dead code