src/HOL/Quickcheck_Exhaustive.thy
Fri, 15 Feb 2013 08:31:31 +0100 haftmann two target language numeral types: integer and natural, as replacement for code_numeral;
Thu, 14 Feb 2013 15:27:10 +0100 haftmann reform of predicate compiler / quickcheck theories:
Sat, 20 Oct 2012 09:12:16 +0200 haftmann moved quite generic material from theory Enum to more appropriate places
Wed, 22 Aug 2012 22:55:41 +0200 wenzelm prefer ML_file over old uses;
Fri, 30 Mar 2012 08:19:29 +0200 bulwahn hiding fact not so aggressively
Thu, 15 Mar 2012 22:08:53 +0100 wenzelm declare command keywords via theory header, including strict checking outside Pure;
Sun, 05 Feb 2012 08:24:38 +0100 bulwahn beautifying definitions of check_all and adding instance for finite_4
Mon, 23 Jan 2012 14:00:52 +0100 bulwahn random instance for sets
Fri, 20 Jan 2012 09:28:52 +0100 bulwahn shortened definitions by adding some termify constants
Fri, 20 Jan 2012 09:28:50 +0100 bulwahn adding check_all instance for sets; tuned
Thu, 12 Jan 2012 10:19:33 +0100 bulwahn adding exhaustive instances for type constructor set
Tue, 20 Dec 2011 17:39:56 +0100 bulwahn quickcheck generators for abstract types; tuned
Mon, 12 Dec 2011 13:45:54 +0100 bulwahn hiding constants and facts in the Quickcheck_Exhaustive and Quickcheck_Narrowing theory;
Sun, 04 Dec 2011 20:05:08 +0100 bulwahn adding genuine flag to predicate_compile_quickcheck and prolog_quickcheck (cf. 5e46c225370e);
Thu, 01 Dec 2011 22:16:26 +0100 bulwahn hiding internal constants and facts more properly
Thu, 01 Dec 2011 22:16:23 +0100 bulwahn removing catch_match' now that catch_match is polymorphic
Thu, 01 Dec 2011 22:14:35 +0100 bulwahn the simple exhaustive compilation also indicates if counterexample is potentially spurious;
Thu, 01 Dec 2011 22:14:35 +0100 bulwahn changing the exhaustive generator signatures;
Thu, 01 Dec 2011 22:14:35 +0100 bulwahn quickcheck random can also find potential counterexamples;
Wed, 30 Nov 2011 15:07:10 +0100 bulwahn more stable introduction of the internally used unknown term
Wed, 30 Nov 2011 09:21:09 +0100 bulwahn adding a exception-safe term reification step in quickcheck; adding examples
Fri, 11 Nov 2011 08:32:45 +0100 bulwahn adding CPS compilation to predicate compiler;
Mon, 18 Jul 2011 10:34:21 +0200 bulwahn renaming quickcheck_tester to quickcheck_batch_tester; tuned
Fri, 08 Apr 2011 16:31:14 +0200 bulwahn splitting exhaustive and full_exhaustive into separate type classes
Fri, 08 Apr 2011 16:31:14 +0200 bulwahn theory definitions for fast exhaustive quickcheck compilation
Fri, 08 Apr 2011 16:31:14 +0200 bulwahn new compilation for exhaustive quickcheck
Thu, 07 Apr 2011 14:51:26 +0200 bulwahn removing instantiation exhaustive for unit in Quickcheck_Exhaustive
Tue, 05 Apr 2011 09:38:23 +0200 bulwahn deriving bounded_forall instances in quickcheck_exhaustive
Fri, 01 Apr 2011 13:49:38 +0200 bulwahn adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
Fri, 25 Mar 2011 16:03:49 +0100 bulwahn changing iteration scheme of functions to use minimal number of function updates for exhaustive testing
Fri, 11 Mar 2011 15:21:13 +0100 bulwahn moving exhaustive_generators.ML to Quickcheck directory
Fri, 11 Mar 2011 15:21:13 +0100 bulwahn replacing naming of small by exhaustive
Fri, 11 Mar 2011 15:21:13 +0100 bulwahn renaming constants in Quickcheck_Exhaustive theory
Fri, 11 Mar 2011 15:21:12 +0100 bulwahn renaming Smallcheck to Quickcheck_Exhaustive
less more (0) tip