src/HOL/Tools/Quickcheck/exhaustive_generators.ML
author bulwahn
Fri, 08 Apr 2011 16:31:14 +0200
changeset 42304 34366f39d32d
parent 42273 3b94cbd903c1
child 42306 51a08b2699d5
permissions -rw-r--r--
new compilation for exhaustive quickcheck
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
41923
f05fc0711bc7 renaming signatures and structures; correcting header
bulwahn
parents: 41920
diff changeset
     1
(*  Title:      HOL/Tools/Quickcheck/exhaustive_generators.ML
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
     2
    Author:     Lukas Bulwahn, TU Muenchen
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
     3
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
     4
Exhaustive generators for various types.
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
     5
*)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
     6
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
     7
signature EXHAUSTIVE_GENERATORS =
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
     8
sig
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
     9
  val compile_generator_expr:
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
    10
    Proof.context -> (term * term list) list -> int list -> term list option * Quickcheck.report option
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
    11
  val compile_generator_exprs: Proof.context -> term list -> (int -> term list option) list
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
    12
  val compile_validator_exprs: Proof.context -> term list -> (int -> bool) list
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
    13
  val put_counterexample: (unit -> int -> int -> term list option)
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    14
    -> Proof.context -> Proof.context
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
    15
  val put_counterexample_batch: (unit -> (int -> term list option) list)
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
    16
    -> Proof.context -> Proof.context
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
    17
  val put_validator_batch: (unit -> (int -> bool) list) -> Proof.context -> Proof.context
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
    18
  val smart_quantifier : bool Config.T
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
    19
  val quickcheck_pretty : bool Config.T
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    20
  val setup: theory -> theory
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    21
end;
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    22
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
    23
structure Exhaustive_Generators : EXHAUSTIVE_GENERATORS =
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    24
struct
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    25
40907
45ba9f05583a adding smart quantifiers to exhaustive testing
bulwahn
parents: 40901
diff changeset
    26
(* dynamic options *)
45ba9f05583a adding smart quantifiers to exhaustive testing
bulwahn
parents: 40901
diff changeset
    27
45ba9f05583a adding smart quantifiers to exhaustive testing
bulwahn
parents: 40901
diff changeset
    28
val (smart_quantifier, setup_smart_quantifier) =
45ba9f05583a adding smart quantifiers to exhaustive testing
bulwahn
parents: 40901
diff changeset
    29
  Attrib.config_bool "quickcheck_smart_quantifier" (K true)
45ba9f05583a adding smart quantifiers to exhaustive testing
bulwahn
parents: 40901
diff changeset
    30
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    31
val (full_support, setup_full_support) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    32
  Attrib.config_bool "quickcheck_full_support" (K true)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    33
41903
39fd77f0ae59 fixing postprocessing; adding a configuration to enable and disable pretty presentation of quickcheck's counterexample
bulwahn
parents: 41902
diff changeset
    34
val (quickcheck_pretty, setup_quickcheck_pretty) =
39fd77f0ae59 fixing postprocessing; adding a configuration to enable and disable pretty presentation of quickcheck's counterexample
bulwahn
parents: 41902
diff changeset
    35
  Attrib.config_bool "quickcheck_pretty" (K true)
39fd77f0ae59 fixing postprocessing; adding a configuration to enable and disable pretty presentation of quickcheck's counterexample
bulwahn
parents: 41902
diff changeset
    36
 
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    37
(** general term functions **)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    38
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    39
fun mk_measure f =
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    40
  let
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    41
    val Type ("fun", [T, @{typ nat}]) = fastype_of f 
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    42
  in
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    43
    Const (@{const_name Wellfounded.measure},
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    44
      (T --> @{typ nat}) --> HOLogic.mk_prodT (T, T) --> @{typ bool})
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    45
    $ f
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    46
  end
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    47
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    48
fun mk_sumcases rT f (Type (@{type_name Sum_Type.sum}, [TL, TR])) =
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    49
  let
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    50
    val lt = mk_sumcases rT f TL
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    51
    val rt = mk_sumcases rT f TR
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    52
  in
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    53
    SumTree.mk_sumcase TL TR rT lt rt
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    54
  end
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    55
  | mk_sumcases _ f T = f T
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    56
40901
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
    57
fun mk_undefined T = Const(@{const_name undefined}, T)
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
    58
  
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    59
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    60
(** abstract syntax **)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    61
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
    62
fun termifyT T = HOLogic.mk_prodT (T, @{typ "unit => Code_Evaluation.term"});
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
    63
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    64
val size = @{term "i :: code_numeral"}
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    65
val size_pred = @{term "(i :: code_numeral) - 1"}
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    66
val size_ge_zero = @{term "(i :: code_numeral) > 0"}
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    67
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    68
fun test_function T = Free ("f", T --> @{typ "term list option"})
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    69
fun full_test_function T = Free ("f", termifyT T --> @{typ "term list option"})
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    70
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    71
fun mk_none_continuation (x, y) =
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    72
  let
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    73
    val (T as Type(@{type_name "option"}, [T'])) = fastype_of x
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    74
  in
42214
9ca13615c619 refactoring generator definition in quickcheck and removing clone
bulwahn
parents: 42195
diff changeset
    75
    Const (@{const_name "Quickcheck_Exhaustive.orelse"}, T --> T --> T) $ x $ y
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    76
  end
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    77
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    78
(** datatypes **)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    79
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
    80
(* constructing exhaustive generator instances on datatypes *)
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    81
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    82
exception FUNCTION_TYPE;
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
    83
val exhaustiveN = "exhaustive";
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    84
val full_exhaustiveN = "full_exhaustive";
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    85
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    86
fun exhaustiveT T = (T --> @{typ "Code_Evaluation.term list option"})
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    87
  --> @{typ code_numeral} --> @{typ "Code_Evaluation.term list option"}
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    88
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
    89
fun full_exhaustiveT T = (termifyT T --> @{typ "Code_Evaluation.term list option"})
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
    90
  --> @{typ code_numeral} --> @{typ "Code_Evaluation.term list option"}
41085
a549ff1d4070 adding a smarter enumeration scheme for finite functions
bulwahn
parents: 40913
diff changeset
    91
a549ff1d4070 adding a smarter enumeration scheme for finite functions
bulwahn
parents: 40913
diff changeset
    92
fun check_allT T = (termifyT T --> @{typ "Code_Evaluation.term list option"})
a549ff1d4070 adding a smarter enumeration scheme for finite functions
bulwahn
parents: 40913
diff changeset
    93
  --> @{typ "Code_Evaluation.term list option"}
a549ff1d4070 adding a smarter enumeration scheme for finite functions
bulwahn
parents: 40913
diff changeset
    94
41963
d8c3b26b3da4 tuned exhaustive generator compilation; added narrowing generator compilation; removed exec as does not work properly here (reverting changeset 994d088fbfbc)
bulwahn
parents: 41935
diff changeset
    95
fun mk_equations descr vs tycos exhaustives (Ts, Us) =
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    96
  let
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
    97
    fun mk_call T =
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
    98
      let
41963
d8c3b26b3da4 tuned exhaustive generator compilation; added narrowing generator compilation; removed exec as does not work properly here (reverting changeset 994d088fbfbc)
bulwahn
parents: 41935
diff changeset
    99
        val exhaustive = Const (@{const_name "Quickcheck_Exhaustive.exhaustive_class.exhaustive"}, exhaustiveT T)
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   100
      in
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   101
        (T, fn t => exhaustive $ absdummy (T, t) $ size_pred)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   102
      end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   103
    fun mk_aux_call fTs (k, _) (tyco, Ts) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   104
      let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   105
        val T = Type (tyco, Ts)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   106
        val _ = if not (null fTs) then raise FUNCTION_TYPE else ()
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   107
      in
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   108
       (T, fn t => nth exhaustives k $ absdummy (T, t) $ size_pred)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   109
      end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   110
    fun mk_consexpr simpleT (c, xs) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   111
      let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   112
        val (Ts, fns) = split_list xs
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   113
        val constr = Const (c, Ts ---> simpleT)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   114
        val bounds = map Bound (((length xs) - 1) downto 0)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   115
        val term_bounds = map (fn x => Bound (2 * x)) (((length xs) - 1) downto 0)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   116
        val start_term = test_function simpleT $ list_comb (constr, bounds)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   117
      in fold_rev (fn f => fn t => f t) fns start_term end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   118
    fun mk_rhs exprs =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   119
        @{term "If :: bool => term list option => term list option => term list option"}
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   120
            $ size_ge_zero $ (foldr1 mk_none_continuation exprs) $ @{term "None :: term list option"}
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   121
    val rhss =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   122
      Datatype_Aux.interpret_construction descr vs
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   123
        { atyp = mk_call, dtyp = mk_aux_call }
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   124
      |> (map o apfst) Type
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   125
      |> map (fn (T, cs) => map (mk_consexpr T) cs)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   126
      |> map mk_rhs
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   127
    val lhss = map2 (fn t => fn T => t $ test_function T $ size) exhaustives (Ts @ Us)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   128
    val eqs = map (HOLogic.mk_Trueprop o HOLogic.mk_eq) (lhss ~~ rhss)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   129
  in
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   130
    eqs
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   131
  end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   132
    
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   133
fun mk_full_equations descr vs tycos full_exhaustives (Ts, Us) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   134
  let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   135
    fun mk_call T =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   136
      let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   137
        val full_exhaustive = Const (@{const_name "Quickcheck_Exhaustive.exhaustive_class.full_exhaustive"}, full_exhaustiveT T)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   138
      in
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   139
        (T, (fn t => full_exhaustive $
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   140
          (HOLogic.split_const (T, @{typ "unit => Code_Evaluation.term"}, @{typ "Code_Evaluation.term list option"})
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   141
          $ absdummy (T, absdummy (@{typ "unit => Code_Evaluation.term"}, t))) $ size_pred))
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   142
      end
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
   143
    fun mk_aux_call fTs (k, _) (tyco, Ts) =
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   144
      let
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   145
        val T = Type (tyco, Ts)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   146
        val _ = if not (null fTs) then raise FUNCTION_TYPE else ()
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   147
      in
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   148
       (T, (fn t => nth full_exhaustives k $
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   149
          (HOLogic.split_const (T, @{typ "unit => Code_Evaluation.term"}, @{typ "Code_Evaluation.term list option"})
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
   150
            $ absdummy (T, absdummy (@{typ "unit => Code_Evaluation.term"}, t))) $ size_pred))
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   151
      end
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   152
    fun mk_consexpr simpleT (c, xs) =
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   153
      let
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   154
        val (Ts, fns) = split_list xs
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   155
        val constr = Const (c, Ts ---> simpleT)
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   156
        val bounds = map (fn x => Bound (2 * x + 1)) (((length xs) - 1) downto 0)
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   157
        val term_bounds = map (fn x => Bound (2 * x)) (((length xs) - 1) downto 0)
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   158
        val Eval_App = Const ("Code_Evaluation.App", HOLogic.termT --> HOLogic.termT --> HOLogic.termT)
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   159
        val Eval_Const = Const ("Code_Evaluation.Const", HOLogic.literalT --> @{typ typerep} --> HOLogic.termT)
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   160
        val term = fold (fn u => fn t => Eval_App $ t $ (u $ @{term "()"}))
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   161
          bounds (Eval_Const $ HOLogic.mk_literal c $ HOLogic.mk_typerep (Ts ---> simpleT))
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   162
        val start_term = full_test_function simpleT $ 
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   163
        (HOLogic.pair_const simpleT @{typ "unit => Code_Evaluation.term"}
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   164
          $ (list_comb (constr, bounds)) $ absdummy (@{typ unit}, term))
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   165
      in fold_rev (fn f => fn t => f t) fns start_term end
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   166
    fun mk_rhs exprs =
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   167
        @{term "If :: bool => term list option => term list option => term list option"}
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   168
            $ size_ge_zero $ (foldr1 mk_none_continuation exprs) $ @{term "None :: term list option"}
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   169
    val rhss =
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   170
      Datatype_Aux.interpret_construction descr vs
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
   171
        { atyp = mk_call, dtyp = mk_aux_call }
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   172
      |> (map o apfst) Type
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   173
      |> map (fn (T, cs) => map (mk_consexpr T) cs)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   174
      |> map mk_rhs
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   175
    val lhss = map2 (fn t => fn T => t $ full_test_function T $ size) full_exhaustives (Ts @ Us);
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   176
    val eqs = map (HOLogic.mk_Trueprop o HOLogic.mk_eq) (lhss ~~ rhss)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   177
  in
40901
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   178
    eqs
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   179
  end
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   180
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   181
(* foundational definition with the function package *)
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   182
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   183
val less_int_pred = @{lemma "i > 0 ==> Code_Numeral.nat_of ((i :: code_numeral) - 1) < Code_Numeral.nat_of i" by auto}
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   184
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   185
fun mk_single_measure T = HOLogic.mk_comp (@{term "Code_Numeral.nat_of"},
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   186
    Const (@{const_name "Product_Type.snd"}, T --> @{typ "code_numeral"}))
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   187
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   188
fun mk_termination_measure T =
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   189
  let
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   190
    val T' = fst (HOLogic.dest_prodT (HOLogic.dest_setT T))
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   191
  in
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   192
    mk_measure (mk_sumcases @{typ nat} mk_single_measure T')
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   193
  end
40901
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   194
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   195
fun termination_tac ctxt = 
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   196
  Function_Relation.relation_tac ctxt mk_termination_measure 1
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   197
  THEN rtac @{thm wf_measure} 1
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   198
  THEN (REPEAT_DETERM (Simplifier.asm_full_simp_tac 
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   199
    (HOL_basic_ss addsimps [@{thm in_measure}, @{thm o_def}, @{thm snd_conv},
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   200
     @{thm nat_mono_iff}, less_int_pred] @ @{thms sum.cases}) 1))
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   201
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   202
(* creating the instances *)
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   203
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
   204
fun instantiate_exhaustive_datatype config descr vs tycos prfx (names, auxnames) (Ts, Us) thy =
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   205
  let
42230
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   206
    val _ = Datatype_Aux.message config "Creating exhaustive generators...";
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   207
    val exhaustivesN = map (prefix (exhaustiveN ^ "_")) (names @ auxnames)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   208
    val full_exhaustivesN = map (prefix (full_exhaustiveN ^ "_")) (names @ auxnames)
40901
8fdfa9c4e7ed smallvalue_generator are defined quick via oracle or sound via function package
bulwahn
parents: 40899
diff changeset
   209
  in
40641
5615cc557120 moving the error handling to the right scope in smallvalue_generators
bulwahn
parents: 40640
diff changeset
   210
    thy
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
   211
    |> Class.instantiation (tycos, vs, @{sort exhaustive})
42214
9ca13615c619 refactoring generator definition in quickcheck and removing clone
bulwahn
parents: 42195
diff changeset
   212
    |> Quickcheck_Common.define_functions
9ca13615c619 refactoring generator definition in quickcheck and removing clone
bulwahn
parents: 42195
diff changeset
   213
        (fn exhaustives => mk_equations descr vs tycos exhaustives (Ts, Us), SOME termination_tac)
9ca13615c619 refactoring generator definition in quickcheck and removing clone
bulwahn
parents: 42195
diff changeset
   214
        prfx ["f", "i"] exhaustivesN (map exhaustiveT (Ts @ Us))
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   215
    |> Quickcheck_Common.define_functions
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   216
        (fn full_exhaustives => mk_full_equations descr vs tycos full_exhaustives (Ts, Us),
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   217
        SOME termination_tac)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   218
        prfx ["f", "i"] full_exhaustivesN (map full_exhaustiveT (Ts @ Us))
40641
5615cc557120 moving the error handling to the right scope in smallvalue_generators
bulwahn
parents: 40640
diff changeset
   219
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
5615cc557120 moving the error handling to the right scope in smallvalue_generators
bulwahn
parents: 40640
diff changeset
   220
  end handle FUNCTION_TYPE =>
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   221
    (Datatype_Aux.message config
41963
d8c3b26b3da4 tuned exhaustive generator compilation; added narrowing generator compilation; removed exec as does not work properly here (reverting changeset 994d088fbfbc)
bulwahn
parents: 41935
diff changeset
   222
      "Creation of exhaustive generators failed because the datatype contains a function type";
40639
f1f0e6adca0a adding function generation to SmallCheck; activating exhaustive search space testing
bulwahn
parents: 40420
diff changeset
   223
    thy)
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   224
42230
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   225
(* constructing bounded_forall instances on datatypes *)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   226
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   227
val bounded_forallN = "bounded_forall";
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   228
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   229
fun bounded_forallT T = (T --> @{typ bool}) --> @{typ code_numeral} --> @{typ bool}
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   230
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   231
fun mk_bounded_forall_equations descr vs tycos bounded_foralls (Ts, Us) =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   232
  let
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   233
    fun mk_call T =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   234
      let
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   235
        val bounded_forall =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   236
          Const (@{const_name "Quickcheck_Exhaustive.bounded_forall_class.bounded_forall"},
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   237
            bounded_forallT T)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   238
      in
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   239
        (T, (fn t => bounded_forall $ absdummy (T, t) $ size_pred))
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   240
      end
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   241
    fun mk_aux_call fTs (k, _) (tyco, Ts) =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   242
      let
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   243
        val T = Type (tyco, Ts)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   244
        val _ = if not (null fTs) then raise FUNCTION_TYPE else ()
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   245
      in
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   246
        (T, (fn t => nth bounded_foralls k $ absdummy (T, t) $ size_pred))
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   247
      end
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   248
    fun mk_consexpr simpleT (c, xs) =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   249
      let
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   250
        val (Ts, fns) = split_list xs
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   251
        val constr = Const (c, Ts ---> simpleT)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   252
        val bounds = map Bound (((length xs) - 1) downto 0)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   253
        val start_term = Free ("P", simpleT --> @{typ bool}) $ list_comb (constr, bounds)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   254
      in fold_rev (fn f => fn t => f t) fns start_term end
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   255
    fun mk_rhs exprs =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   256
      @{term "If :: bool => bool => bool => bool"} $ size_ge_zero $
42273
3b94cbd903c1 correcting bounded_forall construction; tuned
bulwahn
parents: 42230
diff changeset
   257
        (foldr1 HOLogic.mk_conj exprs) $ @{term "True"}
42230
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   258
    val rhss =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   259
      Datatype_Aux.interpret_construction descr vs
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   260
        { atyp = mk_call, dtyp = mk_aux_call }
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   261
      |> (map o apfst) Type
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   262
      |> map (fn (T, cs) => map (mk_consexpr T) cs)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   263
      |> map mk_rhs
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   264
    val lhss =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   265
      map2 (fn t => fn T => t $ Free ("P", T --> @{typ bool}) $ size) bounded_foralls (Ts @ Us)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   266
    val eqs = map (HOLogic.mk_Trueprop o HOLogic.mk_eq) (lhss ~~ rhss)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   267
  in
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   268
    eqs
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   269
  end
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   270
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   271
(* creating the bounded_forall instances *)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   272
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   273
fun instantiate_bounded_forall_datatype config descr vs tycos prfx (names, auxnames) (Ts, Us) thy =
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   274
  let
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   275
    val _ = Datatype_Aux.message config "Creating bounded universal quantifiers...";
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   276
    val bounded_forallsN = map (prefix (bounded_forallN ^ "_")) (names @ auxnames);
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   277
  in
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   278
    thy
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   279
    |> Class.instantiation (tycos, vs, @{sort bounded_forall})
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   280
    |> Quickcheck_Common.define_functions
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   281
        (fn bounded_foralls => 
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   282
          mk_bounded_forall_equations descr vs tycos bounded_foralls (Ts, Us), NONE)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   283
        prfx ["P", "i"] bounded_forallsN (map bounded_forallT (Ts @ Us))
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   284
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   285
  end handle FUNCTION_TYPE =>
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   286
    (Datatype_Aux.message config
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   287
      "Creation of bounded universal quantifiers failed because the datatype contains a function type";
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   288
    thy)
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   289
    
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   290
(** building and compiling generator expressions **)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   291
42028
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   292
fun mk_generator_expr ctxt (t, eval_terms) =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   293
  let
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   294
    val thy = ProofContext.theory_of ctxt
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   295
    val ctxt' = Variable.auto_fixes t ctxt
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   296
    val names = Term.add_free_names t []
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   297
    val frees = map Free (Term.add_frees t [])
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   298
    val ([depth_name], ctxt'') = Variable.variant_fixes ["depth"] ctxt'
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   299
    val depth = Free (depth_name, @{typ code_numeral})
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   300
    val return = @{term "Some :: term list => term list option"} $
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   301
      (HOLogic.mk_list @{typ "term"}
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   302
        (map (fn t => HOLogic.mk_term_of (fastype_of t) t) (frees @ eval_terms)))
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   303
    fun mk_exhaustive_closure (free as Free (_, T)) t =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   304
      Const (@{const_name "Quickcheck_Exhaustive.exhaustive_class.exhaustive"}, exhaustiveT T)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   305
        $ lambda free t $ depth
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   306
    val none_t = @{term "None :: term list option"}
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   307
    fun mk_safe_if (cond, then_t, else_t) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   308
      @{term "Quickcheck_Exhaustive.catch_match :: term list option => term list option => term list option"} $
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   309
        (@{term "If :: bool => term list option => term list option => term list option"}
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   310
        $ cond $ then_t $ else_t) $ none_t;
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   311
    fun lookup v = the (AList.lookup (op =) (names ~~ frees) v)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   312
    fun mk_naive_test_term t =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   313
      fold_rev mk_exhaustive_closure frees (mk_safe_if (t, none_t, return)) 
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   314
    fun mk_smart_test_term' concl bound_vars assms =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   315
      let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   316
        fun vars_of t = subtract (op =) bound_vars (Term.add_free_names t [])
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   317
        val (vars, check) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   318
          case assms of [] => (vars_of concl, (concl, none_t, return))
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   319
            | assm :: assms => (vars_of assm, (assm,
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   320
                mk_smart_test_term' concl (union (op =) (vars_of assm) bound_vars) assms, none_t))
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   321
      in
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   322
        fold_rev mk_exhaustive_closure (map lookup vars) (mk_safe_if check)
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   323
      end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   324
    fun mk_smart_test_term t =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   325
      let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   326
        val (assms, concl) = Quickcheck_Common.strip_imp t
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   327
      in
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   328
        mk_smart_test_term' concl [] assms
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   329
      end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   330
    val mk_test_term =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   331
      if Config.get ctxt smart_quantifier then mk_smart_test_term else mk_naive_test_term 
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   332
  in lambda depth (mk_test_term t) end
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   333
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   334
fun mk_full_generator_expr ctxt (t, eval_terms) =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   335
  let
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   336
    val thy = ProofContext.theory_of ctxt
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   337
    val ctxt' = Variable.auto_fixes t ctxt
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   338
    val names = Term.add_free_names t []
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   339
    val frees = map Free (Term.add_frees t [])
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   340
    val ([depth_name], ctxt'') = Variable.variant_fixes ["depth"] ctxt'
42028
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   341
    val (term_names, ctxt''') = Variable.variant_fixes (map (prefix "t_") names) ctxt''
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   342
    val depth = Free (depth_name, @{typ code_numeral})
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   343
    val term_vars = map (fn n => Free (n, @{typ "unit => term"})) term_names
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   344
    val terms = HOLogic.mk_list @{typ term} (map (fn v => v $ @{term "()"}) term_vars)
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   345
    val appendC = @{term "List.append :: term list => term list => term list"}  
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   346
    val return = @{term "Some :: term list => term list option"} $ (appendC $ terms $
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   347
      (HOLogic.mk_list @{typ "term"} (map (fn t => HOLogic.mk_term_of (fastype_of t) t) eval_terms)))
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   348
    fun mk_exhaustive_closure (free as Free (_, T), term_var) t =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   349
      if Sign.of_sort thy (T, @{sort enum}) then
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   350
        Const (@{const_name "Quickcheck_Exhaustive.check_all_class.check_all"}, check_allT T)
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   351
          $ (HOLogic.split_const (T, @{typ "unit => term"}, @{typ "term list option"}) 
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   352
            $ lambda free (lambda term_var t))
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   353
      else
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   354
        Const (@{const_name "Quickcheck_Exhaustive.exhaustive_class.exhaustive"}, exhaustiveT T)
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   355
          $ (HOLogic.split_const (T, @{typ "unit => term"}, @{typ "term list option"})
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   356
            $ lambda free (lambda term_var t)) $ depth
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   357
    val none_t = @{term "None :: term list option"}
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   358
    fun mk_safe_if (cond, then_t, else_t) =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   359
      @{term "Quickcheck_Exhaustive.catch_match :: term list option => term list option => term list option"} $
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   360
        (@{term "If :: bool => term list option => term list option => term list option"}
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   361
        $ cond $ then_t $ else_t) $ none_t;
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   362
    fun lookup v = the (AList.lookup (op =) (names ~~ (frees ~~ term_vars)) v)
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   363
    fun mk_naive_test_term t =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   364
      fold_rev mk_exhaustive_closure (frees ~~ term_vars) (mk_safe_if (t, none_t, return)) 
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   365
    fun mk_smart_test_term' concl bound_vars assms =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   366
      let
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   367
        fun vars_of t = subtract (op =) bound_vars (Term.add_free_names t [])
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   368
        val (vars, check) =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   369
          case assms of [] => (vars_of concl, (concl, none_t, return))
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   370
            | assm :: assms => (vars_of assm, (assm,
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   371
                mk_smart_test_term' concl (union (op =) (vars_of assm) bound_vars) assms, none_t))
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   372
      in
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   373
        fold_rev mk_exhaustive_closure (map lookup vars) (mk_safe_if check)
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   374
      end
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   375
    fun mk_smart_test_term t =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   376
      let
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   377
        val (assms, concl) = Quickcheck_Common.strip_imp t
42028
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   378
      in
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   379
        mk_smart_test_term' concl [] assms
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   380
      end
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   381
    val mk_test_term =
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   382
      if Config.get ctxt smart_quantifier then mk_smart_test_term else mk_naive_test_term 
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   383
  in lambda depth (mk_test_term t) end
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   384
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   385
fun mk_parametric_generator_expr mk_generator_expr =
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   386
  Quickcheck_Common.gen_mk_parametric_generator_expr 
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   387
    ((mk_generator_expr, absdummy (@{typ "code_numeral"}, @{term "None :: term list option"})),
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   388
      @{typ "code_numeral => term list option"})
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   389
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   390
fun mk_validator_expr ctxt t =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   391
  let
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   392
    fun bounded_forallT T = (T --> @{typ bool}) --> @{typ code_numeral} --> @{typ bool}
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   393
    val thy = ProofContext.theory_of ctxt
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   394
    val ctxt' = Variable.auto_fixes t ctxt
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   395
    val ([depth_name], ctxt'') = Variable.variant_fixes ["depth"] ctxt'
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   396
    val depth = Free (depth_name, @{typ code_numeral})
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   397
    fun mk_bounded_forall (s, T) t =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   398
      Const (@{const_name "Quickcheck_Exhaustive.bounded_forall_class.bounded_forall"}, bounded_forallT T)
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   399
        $ lambda (Free (s, T)) t $ depth
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   400
    fun mk_implies (cond, then_t) =
42273
3b94cbd903c1 correcting bounded_forall construction; tuned
bulwahn
parents: 42230
diff changeset
   401
      @{term "If :: bool => bool => bool => bool"} $ cond $ then_t $ @{term True}
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   402
    fun mk_naive_test_term t = fold_rev mk_bounded_forall (Term.add_frees t []) t 
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   403
    fun mk_smart_test_term' concl bound_frees assms =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   404
      let
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   405
        fun vars_of t = subtract (op =) bound_frees (Term.add_frees t [])
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   406
        val (vars, check) =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   407
          case assms of [] => (vars_of concl, concl)
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   408
            | assm :: assms => (vars_of assm, mk_implies (assm,
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   409
                mk_smart_test_term' concl (union (op =) (vars_of assm) bound_frees) assms))
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   410
      in
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   411
        fold_rev mk_bounded_forall vars check
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   412
      end
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   413
    fun mk_smart_test_term t =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   414
      let
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   415
        val (assms, concl) = Quickcheck_Common.strip_imp t
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   416
      in
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   417
        mk_smart_test_term' concl [] assms
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   418
      end
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   419
    val mk_test_term =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   420
      if Config.get ctxt smart_quantifier then mk_smart_test_term else mk_naive_test_term 
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   421
  in lambda depth (mk_test_term t) end
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   422
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   423
42028
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   424
(** generator compiliation **)
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   425
41472
f6ab14e61604 misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents: 41178
diff changeset
   426
structure Counterexample = Proof_Data
f6ab14e61604 misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents: 41178
diff changeset
   427
(
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   428
  type T = unit -> int -> int -> term list option
41472
f6ab14e61604 misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents: 41178
diff changeset
   429
  (* FIXME avoid user error with non-user text *)
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   430
  fun init _ () = error "Counterexample"
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   431
);
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   432
val put_counterexample = Counterexample.put;
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   433
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   434
structure Counterexample_Batch = Proof_Data
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   435
(
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   436
  type T = unit -> (int -> term list option) list
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   437
  (* FIXME avoid user error with non-user text *)
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   438
  fun init _ () = error "Counterexample"
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   439
);
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   440
val put_counterexample_batch = Counterexample_Batch.put;
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   441
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   442
structure Validator_Batch = Proof_Data
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   443
(
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   444
  type T = unit -> (int -> bool) list
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   445
  (* FIXME avoid user error with non-user text *)
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   446
  fun init _ () = error "Counterexample"
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   447
);
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   448
val put_validator_batch = Validator_Batch.put;
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   449
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   450
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   451
val target = "Quickcheck";
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   452
  
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   453
fun compile_generator_expr ctxt ts =
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   454
  let
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   455
    val thy = ProofContext.theory_of ctxt
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   456
    val mk_generator_expr =
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   457
      if Config.get ctxt full_support then mk_full_generator_expr else mk_generator_expr
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   458
    val t' = mk_parametric_generator_expr mk_generator_expr ctxt ts;
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   459
    val compile = Code_Runtime.dynamic_value_strict
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   460
      (Counterexample.get, put_counterexample, "Exhaustive_Generators.put_counterexample")
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   461
      thy (SOME target) (fn proc => fn g =>
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   462
        fn card => fn size => g card size |> (Option.map o map) proc) t' []
42159
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   463
  in
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   464
    fn [card, size] => rpair NONE (compile card size |> 
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   465
      (if Config.get ctxt quickcheck_pretty then
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   466
        Option.map (map Quickcheck_Common.post_process_term) else I))
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   467
  end;
234ec7011e5d generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents: 42028
diff changeset
   468
 
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   469
fun compile_generator_exprs ctxt ts =
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   470
  let
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   471
    val thy = ProofContext.theory_of ctxt
42028
bd6515e113b2 passing a term with free variables to the quickcheck tester functions instead of an lambda expression because this is more natural with passing further evaluation terms; added output of evaluation terms; added evaluation of terms in the exhaustive testing
bulwahn
parents: 42027
diff changeset
   472
    val ts' = map (fn t => mk_generator_expr ctxt (t, [])) ts;
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   473
    val compiles = Code_Runtime.dynamic_value_strict
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   474
      (Counterexample_Batch.get, put_counterexample_batch,
41918
d2ab869f8b0b replacing naming of small by exhaustive
bulwahn
parents: 41917
diff changeset
   475
        "Exhaustive_Generators.put_counterexample_batch")
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   476
      thy (SOME target) (fn proc => map (fn g => g #> (Option.map o map) proc))
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   477
      (HOLogic.mk_list @{typ "code_numeral => term list option"} ts') []
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   478
  in
41935
d786a8a3dc47 minor corrections for renaming; moved postprocessing of terms to Quickcheck_Common
bulwahn
parents: 41928
diff changeset
   479
    map (fn compile => fn size => compile size
d786a8a3dc47 minor corrections for renaming; moved postprocessing of terms to Quickcheck_Common
bulwahn
parents: 41928
diff changeset
   480
      |> Option.map (map Quickcheck_Common.post_process_term)) compiles
41861
77d87dc50e5a adding a function to compile a batch of terms for quickcheck with one code generation invocation
bulwahn
parents: 41472
diff changeset
   481
  end;
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   482
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   483
fun compile_validator_exprs ctxt ts =
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   484
  let
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   485
    val thy = ProofContext.theory_of ctxt
42273
3b94cbd903c1 correcting bounded_forall construction; tuned
bulwahn
parents: 42230
diff changeset
   486
    val ts' = map (mk_validator_expr ctxt) ts
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   487
  in
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   488
    Code_Runtime.dynamic_value_strict
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   489
      (Validator_Batch.get, put_validator_batch, "Exhaustive_Generators.put_validator_batch")
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   490
      thy (SOME target) (K I) (HOLogic.mk_list @{typ "code_numeral => bool"} ts') []
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   491
  end;
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   492
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   493
(** setup **)
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   494
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   495
val setup =
42229
1491b7209e76 generalizing ensure_sort_datatype for bounded_forall instances
bulwahn
parents: 42214
diff changeset
   496
  Datatype.interpretation (Quickcheck_Common.ensure_sort_datatype
1491b7209e76 generalizing ensure_sort_datatype for bounded_forall instances
bulwahn
parents: 42214
diff changeset
   497
      (((@{sort typerep}, @{sort term_of}), @{sort exhaustive}), instantiate_exhaustive_datatype))
42230
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   498
  #> Datatype.interpretation (Quickcheck_Common.ensure_sort_datatype
594480d25aaa deriving bounded_forall instances in quickcheck_exhaustive
bulwahn
parents: 42229
diff changeset
   499
      (((@{sort type}, @{sort type}), @{sort bounded_forall}), instantiate_bounded_forall_datatype))
40907
45ba9f05583a adding smart quantifiers to exhaustive testing
bulwahn
parents: 40901
diff changeset
   500
  #> setup_smart_quantifier
42304
34366f39d32d new compilation for exhaustive quickcheck
bulwahn
parents: 42273
diff changeset
   501
  #> setup_full_support
41903
39fd77f0ae59 fixing postprocessing; adding a configuration to enable and disable pretty presentation of quickcheck's counterexample
bulwahn
parents: 41902
diff changeset
   502
  #> setup_quickcheck_pretty
41900
bulwahn
parents: 41862
diff changeset
   503
  #> Context.theory_map (Quickcheck.add_generator ("exhaustive", compile_generator_expr))
42195
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   504
  #> Context.theory_map (Quickcheck.add_batch_generator ("exhaustive", compile_generator_exprs))
1e7b62c93f5d adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents: 42176
diff changeset
   505
  #> Context.theory_map (Quickcheck.add_batch_validator ("exhaustive", compile_validator_exprs));
40420
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   506
552563ea3304 adding code and theory for smallvalue generators, but do not setup the interpretation yet
bulwahn
parents:
diff changeset
   507
end;