src/HOL/Tools/Quickcheck/random_generators.ML
author haftmann
Thu Feb 14 15:27:10 2013 +0100 (2013-02-14)
changeset 51126 df86080de4cb
parent 50818 5d4852f1b952
child 51143 0a2371e7ced3
permissions -rw-r--r--
reform of predicate compiler / quickcheck theories:
implement yieldn operations uniformly on the ML level -- predicate compiler uses negative integers as parameter to yieldn, whereas code_numeral represents natural numbers!
avoid odd New_ prefix by joining related theories;
avoid overcompact name DSequence;
separated predicate inside random monad into separate theory;
consolidated name of theory Quickcheck
bulwahn@41923
     1
(*  Title:      HOL/Tools/Quickcheck/random_generators.ML
haftmann@37744
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@31260
     3
bulwahn@41923
     4
Random generators for various types.
haftmann@31260
     5
*)
haftmann@31260
     6
bulwahn@41923
     7
signature RANDOM_GENERATORS =
haftmann@31260
     8
sig
haftmann@31260
     9
  type seed = Random_Engine.seed
haftmann@31260
    10
  val random_fun: typ -> typ -> ('a -> 'a -> bool) -> ('a -> term)
haftmann@31260
    11
    -> (seed -> ('b * (unit -> term)) * seed) -> (seed -> seed * seed)
wenzelm@33243
    12
    -> seed -> (('a -> 'b) * (unit -> term)) * seed
bulwahn@35378
    13
  val compile_generator_expr:
bulwahn@45754
    14
    Proof.context -> (term * term list) list -> bool -> int list -> (bool * term list) option * Quickcheck.report option
bulwahn@45754
    15
  val put_counterexample: (unit -> int -> bool -> int -> seed -> (bool * term list) option * seed)
haftmann@39388
    16
    -> Proof.context -> Proof.context
bulwahn@45763
    17
  val put_counterexample_report: (unit -> int -> bool -> int -> seed -> ((bool * term list) option * (bool list * bool)) * seed)
haftmann@39388
    18
    -> Proof.context -> Proof.context
bulwahn@45940
    19
  val instantiate_random_datatype : Datatype_Aux.config -> Datatype_Aux.descr ->
bulwahn@45940
    20
    (string * sort) list -> string list -> string -> string list * string list -> typ list * typ list -> theory -> theory
haftmann@31260
    21
  val setup: theory -> theory
haftmann@31260
    22
end;
haftmann@31260
    23
bulwahn@41923
    24
structure Random_Generators : RANDOM_GENERATORS =
haftmann@31260
    25
struct
haftmann@31260
    26
haftmann@31950
    27
(** abstract syntax **)
haftmann@31260
    28
haftmann@31950
    29
fun termifyT T = HOLogic.mk_prodT (T, @{typ "unit => term"})
haftmann@31950
    30
val size = @{term "i::code_numeral"};
haftmann@31984
    31
val size_pred = @{term "(i::code_numeral) - 1"};
haftmann@31950
    32
val size' = @{term "j::code_numeral"};
haftmann@31950
    33
val seed = @{term "s::Random.seed"};
haftmann@31260
    34
bulwahn@45723
    35
val resultT =  @{typ "(bool * term list) option"};
bulwahn@45721
    36
haftmann@31260
    37
(** typ "'a => 'b" **)
haftmann@31260
    38
haftmann@31260
    39
type seed = Random_Engine.seed;
haftmann@31260
    40
haftmann@31603
    41
fun random_fun T1 T2 eq term_of random random_split seed =
haftmann@31260
    42
  let
haftmann@31260
    43
    val fun_upd = Const (@{const_name fun_upd},
haftmann@31260
    44
      (T1 --> T2) --> T1 --> T2 --> T1 --> T2);
haftmann@50046
    45
    val ((_, t2), seed') = random seed;
haftmann@32344
    46
    val (seed'', seed''') = random_split seed';
haftmann@31933
    47
wenzelm@32740
    48
    val state = Unsynchronized.ref (seed'', [], fn () => Abs ("x", T1, t2 ()));
haftmann@31260
    49
    fun random_fun' x =
haftmann@31260
    50
      let
haftmann@31260
    51
        val (seed, fun_map, f_t) = ! state;
haftmann@31260
    52
      in case AList.lookup (uncurry eq) fun_map x
haftmann@31260
    53
       of SOME y => y
haftmann@31260
    54
        | NONE => let
haftmann@31260
    55
              val t1 = term_of x;
haftmann@31260
    56
              val ((y, t2), seed') = random seed;
haftmann@31260
    57
              val fun_map' = (x, y) :: fun_map;
haftmann@31933
    58
              val f_t' = fn () => fun_upd $ f_t () $ t1 $ t2 ();
haftmann@31260
    59
              val _ = state := (seed', fun_map', f_t');
haftmann@31260
    60
            in y end
haftmann@31260
    61
      end;
haftmann@31933
    62
    fun term_fun' () = #3 (! state) ();
haftmann@32344
    63
  in ((random_fun', term_fun'), seed''') end;
haftmann@31260
    64
bulwahn@45762
    65
  
haftmann@31260
    66
(** datatypes **)
haftmann@31260
    67
haftmann@31485
    68
(* definitional scheme for random instances on datatypes *)
haftmann@31485
    69
haftmann@31611
    70
local
haftmann@31611
    71
haftmann@31485
    72
fun dest_ctyp_nth k cT = nth (Thm.dest_ctyp cT) k;
haftmann@31611
    73
val eq = Thm.cprop_of @{thm random_aux_rec} |> Thm.dest_arg |> Thm.dest_arg |> Thm.dest_arg;
haftmann@31611
    74
val lhs = eq |> Thm.dest_arg1;
haftmann@31611
    75
val pt_random_aux = lhs |> Thm.dest_fun;
haftmann@31611
    76
val pt_rhs = eq |> Thm.dest_arg |> Thm.dest_fun;
haftmann@31611
    77
val aT = pt_random_aux |> Thm.ctyp_of_term |> dest_ctyp_nth 1;
haftmann@31611
    78
haftmann@31611
    79
val rew_thms = map mk_meta_eq [@{thm code_numeral_zero_minus_one},
haftmann@31611
    80
  @{thm Suc_code_numeral_minus_one}, @{thm select_weight_cons_zero}, @{thm beyond_zero}];
haftmann@31611
    81
val rew_ts = map (Logic.dest_equals o Thm.prop_of) rew_thms;
haftmann@31611
    82
val rew_ss = HOL_ss addsimps rew_thms;
haftmann@31611
    83
haftmann@31611
    84
in
haftmann@31485
    85
haftmann@31485
    86
fun random_aux_primrec eq lthy =
haftmann@31485
    87
  let
wenzelm@42361
    88
    val thy = Proof_Context.theory_of lthy;
haftmann@31611
    89
    val ((t_random_aux as Free (random_aux, T)) $ (t_k as Free (v, _)), proto_t_rhs) =
haftmann@31611
    90
      (HOLogic.dest_eq o HOLogic.dest_Trueprop) eq;
haftmann@31485
    91
    val Type (_, [_, iT]) = T;
haftmann@31485
    92
    val icT = Thm.ctyp_of thy iT;
haftmann@31611
    93
    val cert = Thm.cterm_of thy;
haftmann@31611
    94
    val inst = Thm.instantiate_cterm ([(aT, icT)], []);
haftmann@31485
    95
    fun subst_v t' = map_aterms (fn t as Free (w, _) => if v = w then t' else t | t => t);
haftmann@31611
    96
    val t_rhs = lambda t_k proto_t_rhs;
haftmann@31785
    97
    val eqs0 = [subst_v @{term "0::code_numeral"} eq,
huffman@46547
    98
      subst_v (@{const Code_Numeral.Suc} $ t_k) eq];
haftmann@31611
    99
    val eqs1 = map (Pattern.rewrite_term thy rew_ts []) eqs0;
haftmann@35166
   100
    val ((_, (_, eqs2)), lthy') = Primrec.add_primrec_simple
haftmann@33205
   101
      [((Binding.conceal (Binding.name random_aux), T), NoSyn)] eqs1 lthy;
haftmann@31611
   102
    val cT_random_aux = inst pt_random_aux;
haftmann@31611
   103
    val cT_rhs = inst pt_rhs;
haftmann@31485
   104
    val rule = @{thm random_aux_rec}
wenzelm@43333
   105
      |> Drule.instantiate_normalize ([(aT, icT)],
haftmann@31785
   106
           [(cT_random_aux, cert t_random_aux), (cT_rhs, cert t_rhs)]);
haftmann@31785
   107
    val tac = ALLGOALS (rtac rule)
haftmann@31785
   108
      THEN ALLGOALS (simp_tac rew_ss)
wenzelm@42361
   109
      THEN (ALLGOALS (Proof_Context.fact_tac eqs2))
wenzelm@32970
   110
    val simp = Skip_Proof.prove lthy' [v] [] eq (K tac);
haftmann@31485
   111
  in (simp, lthy') end;
haftmann@31485
   112
haftmann@31611
   113
end;
haftmann@31611
   114
haftmann@31868
   115
fun random_aux_primrec_multi auxname [eq] lthy =
haftmann@31485
   116
      lthy
haftmann@31485
   117
      |> random_aux_primrec eq
haftmann@31485
   118
      |>> (fn simp => [simp])
haftmann@31868
   119
  | random_aux_primrec_multi auxname (eqs as _ :: _ :: _) lthy =
haftmann@31485
   120
      let
wenzelm@42361
   121
        val thy = Proof_Context.theory_of lthy;
haftmann@31485
   122
        val (lhss, rhss) = map_split (HOLogic.dest_eq o HOLogic.dest_Trueprop) eqs;
haftmann@31485
   123
        val (vs, (arg as Free (v, _)) :: _) = map_split (fn (t1 $ t2) => (t1, t2)) lhss;
haftmann@31485
   124
        val Ts = map fastype_of lhss;
haftmann@31485
   125
        val tupleT = foldr1 HOLogic.mk_prodT Ts;
haftmann@31868
   126
        val aux_lhs = Free ("mutual_" ^ auxname, fastype_of arg --> tupleT) $ arg;
haftmann@31485
   127
        val aux_eq = (HOLogic.mk_Trueprop o HOLogic.mk_eq)
haftmann@31485
   128
          (aux_lhs, foldr1 HOLogic.mk_prod rhss);
haftmann@31485
   129
        fun mk_proj t [T] = [t]
haftmann@31485
   130
          | mk_proj t (Ts as T :: (Ts' as _ :: _)) =
haftmann@31485
   131
              Const (@{const_name fst}, foldr1 HOLogic.mk_prodT Ts --> T) $ t
haftmann@31485
   132
                :: mk_proj (Const (@{const_name snd},
haftmann@31485
   133
                  foldr1 HOLogic.mk_prodT Ts --> foldr1 HOLogic.mk_prodT Ts') $ t) Ts';
haftmann@31485
   134
        val projs = mk_proj (aux_lhs) Ts;
haftmann@31485
   135
        val proj_eqs = map2 (fn v => fn proj => (v, lambda arg proj)) vs projs;
haftmann@31485
   136
        val proj_defs = map2 (fn Free (name, _) => fn (_, rhs) =>
haftmann@33205
   137
          ((Binding.conceal (Binding.name name), NoSyn),
wenzelm@33280
   138
            (apfst Binding.conceal Attrib.empty_binding, rhs))) vs proj_eqs;
haftmann@31485
   139
        val aux_eq' = Pattern.rewrite_term thy proj_eqs [] aux_eq;
haftmann@31485
   140
        fun prove_eqs aux_simp proj_defs lthy = 
haftmann@31485
   141
          let
haftmann@31485
   142
            val proj_simps = map (snd o snd) proj_defs;
wenzelm@31645
   143
            fun tac { context = ctxt, prems = _ } =
haftmann@31625
   144
              ALLGOALS (simp_tac (HOL_ss addsimps proj_simps))
haftmann@31485
   145
              THEN ALLGOALS (EqSubst.eqsubst_tac ctxt [0] [aux_simp])
haftmann@37136
   146
              THEN ALLGOALS (simp_tac (HOL_ss addsimps [@{thm fst_conv}, @{thm snd_conv}]));
wenzelm@32970
   147
          in (map (fn prop => Skip_Proof.prove lthy [v] [] prop tac) eqs, lthy) end;
haftmann@31485
   148
      in
haftmann@31485
   149
        lthy
haftmann@31485
   150
        |> random_aux_primrec aux_eq'
wenzelm@33766
   151
        ||>> fold_map Local_Theory.define proj_defs
haftmann@31485
   152
        |-> (fn (aux_simp, proj_defs) => prove_eqs aux_simp proj_defs)
haftmann@31485
   153
      end;
haftmann@31485
   154
haftmann@31868
   155
fun random_aux_specification prfx name eqs lthy =
haftmann@31485
   156
  let
haftmann@31595
   157
    val vs = fold Term.add_free_names ((snd o strip_comb o fst o HOLogic.dest_eq
haftmann@31595
   158
      o HOLogic.dest_Trueprop o hd) eqs) [];
haftmann@31485
   159
    fun mk_proto_eq eq =
haftmann@31485
   160
      let
haftmann@31595
   161
        val (head $ t $ u, rhs) = (HOLogic.dest_eq o HOLogic.dest_Trueprop) eq;
haftmann@31595
   162
      in ((HOLogic.mk_Trueprop o HOLogic.mk_eq) (head, lambda t (lambda u rhs))) end;
haftmann@31485
   163
    val proto_eqs = map mk_proto_eq eqs;
haftmann@31485
   164
    fun prove_simps proto_simps lthy =
haftmann@31485
   165
      let
haftmann@31625
   166
        val ext_simps = map (fn thm => fun_cong OF [fun_cong OF [thm]]) proto_simps;
wenzelm@42361
   167
        val tac = ALLGOALS (Proof_Context.fact_tac ext_simps);
wenzelm@32970
   168
      in (map (fn prop => Skip_Proof.prove lthy vs [] prop (K tac)) eqs, lthy) end;
haftmann@33205
   169
    val b = Binding.conceal (Binding.qualify true prfx
haftmann@33205
   170
      (Binding.qualify true name (Binding.name "simps")));
haftmann@31485
   171
  in
haftmann@31485
   172
    lthy
haftmann@31868
   173
    |> random_aux_primrec_multi (name ^ prfx) proto_eqs
haftmann@31485
   174
    |-> (fn proto_simps => prove_simps proto_simps)
wenzelm@33671
   175
    |-> (fn simps => Local_Theory.note
wenzelm@45592
   176
      ((b, Code.add_default_eqn_attrib :: @{attributes [simp, nitpick_simp]}), simps))
haftmann@31485
   177
    |> snd
haftmann@31485
   178
  end
haftmann@31485
   179
haftmann@31485
   180
haftmann@31485
   181
(* constructing random instances on datatypes *)
haftmann@31485
   182
haftmann@31868
   183
val random_auxN = "random_aux";
haftmann@31868
   184
haftmann@50046
   185
fun mk_random_aux_eqs thy descr vs (names, auxnames) (Ts, Us) =
haftmann@31595
   186
  let
haftmann@31595
   187
    val mk_const = curry (Sign.mk_const thy);
haftmann@31603
   188
    val random_auxsN = map (prefix (random_auxN ^ "_")) (names @ auxnames);
haftmann@31603
   189
    val rTs = Ts @ Us;
haftmann@31595
   190
    fun random_resultT T = @{typ Random.seed}
haftmann@31595
   191
      --> HOLogic.mk_prodT (termifyT T,@{typ Random.seed});
haftmann@31595
   192
    fun sizeT T = @{typ code_numeral} --> @{typ code_numeral} --> T;
haftmann@31595
   193
    val random_auxT = sizeT o random_resultT;
haftmann@31595
   194
    val random_auxs = map2 (fn s => fn rT => Free (s, random_auxT rT))
haftmann@31595
   195
      random_auxsN rTs;
haftmann@31950
   196
    fun mk_random_call T = (NONE, (HOLogic.mk_random T size', T));
haftmann@31603
   197
    fun mk_random_aux_call fTs (k, _) (tyco, Ts) =
haftmann@31595
   198
      let
haftmann@31623
   199
        val T = Type (tyco, Ts);
haftmann@31623
   200
        fun mk_random_fun_lift [] t = t
haftmann@31623
   201
          | mk_random_fun_lift (fT :: fTs) t =
haftmann@31623
   202
              mk_const @{const_name random_fun_lift} [fTs ---> T, fT] $
haftmann@31623
   203
                mk_random_fun_lift fTs t;
haftmann@31984
   204
        val t = mk_random_fun_lift fTs (nth random_auxs k $ size_pred $ size');
haftmann@33968
   205
        val size = Option.map snd (Datatype_Aux.find_shortest_path descr k)
haftmann@31595
   206
          |> the_default 0;
haftmann@31623
   207
      in (SOME size, (t, fTs ---> T)) end;
haftmann@33968
   208
    val tss = Datatype_Aux.interpret_construction descr vs
haftmann@31603
   209
      { atyp = mk_random_call, dtyp = mk_random_aux_call };
haftmann@31595
   210
    fun mk_consexpr simpleT (c, xs) =
haftmann@31595
   211
      let
haftmann@31595
   212
        val (ks, simple_tTs) = split_list xs;
haftmann@31595
   213
        val T = termifyT simpleT;
haftmann@31595
   214
        val tTs = (map o apsnd) termifyT simple_tTs;
haftmann@31595
   215
        val is_rec = exists is_some ks;
wenzelm@33029
   216
        val k = fold (fn NONE => I | SOME k => Integer.max k) ks 0;
wenzelm@43329
   217
        val vs = Name.invent_names Name.context "x" (map snd simple_tTs);
haftmann@31595
   218
        val tc = HOLogic.mk_return T @{typ Random.seed}
haftmann@31595
   219
          (HOLogic.mk_valtermify_app c vs simpleT);
haftmann@38543
   220
        val t = HOLogic.mk_ST
haftmann@38543
   221
          (map2 (fn (t, _) => fn (v, T') => ((t, @{typ Random.seed}), SOME ((v, termifyT T')))) tTs vs)
haftmann@38543
   222
            tc @{typ Random.seed} (SOME T, @{typ Random.seed});
haftmann@31595
   223
        val tk = if is_rec
haftmann@31950
   224
          then if k = 0 then size
haftmann@51126
   225
            else @{term "Quickcheck_Random.beyond :: code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"}
haftmann@31950
   226
             $ HOLogic.mk_number @{typ code_numeral} k $ size
haftmann@31595
   227
          else @{term "1::code_numeral"}
haftmann@31595
   228
      in (is_rec, HOLogic.mk_prod (tk, t)) end;
haftmann@31595
   229
    fun sort_rec xs =
haftmann@31595
   230
      map_filter (fn (true, t) => SOME t | _ =>  NONE) xs
haftmann@31595
   231
      @ map_filter (fn (false, t) => SOME t | _ =>  NONE) xs;
haftmann@31603
   232
    val gen_exprss = tss
haftmann@31603
   233
      |> (map o apfst) Type
haftmann@31595
   234
      |> map (fn (T, cs) => (T, (sort_rec o map (mk_consexpr T)) cs));
haftmann@31595
   235
    fun mk_select (rT, xs) =
haftmann@51126
   236
      mk_const @{const_name Quickcheck_Random.collapse} [@{typ Random.seed}, termifyT rT]
haftmann@31595
   237
      $ (mk_const @{const_name Random.select_weight} [random_resultT rT]
haftmann@31595
   238
        $ HOLogic.mk_list (HOLogic.mk_prodT (@{typ code_numeral}, random_resultT rT)) xs)
haftmann@31595
   239
          $ seed;
haftmann@31950
   240
    val auxs_lhss = map (fn t => t $ size $ size' $ seed) random_auxs;
haftmann@31595
   241
    val auxs_rhss = map mk_select gen_exprss;
haftmann@31868
   242
  in (random_auxs, auxs_lhss ~~ auxs_rhss) end;
haftmann@31595
   243
haftmann@38543
   244
fun instantiate_random_datatype config descr vs tycos prfx (names, auxnames) (Ts, Us) thy =
haftmann@31595
   245
  let
haftmann@33968
   246
    val _ = Datatype_Aux.message config "Creating quickcheck generators ...";
haftmann@31595
   247
    val mk_prop_eq = HOLogic.mk_Trueprop o HOLogic.mk_eq;
haftmann@33968
   248
    fun mk_size_arg k = case Datatype_Aux.find_shortest_path descr k
haftmann@31950
   249
     of SOME (_, l) => if l = 0 then size
haftmann@31595
   250
          else @{term "max :: code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"}
haftmann@31950
   251
            $ HOLogic.mk_number @{typ code_numeral} l $ size
haftmann@31950
   252
      | NONE => size;
haftmann@31868
   253
    val (random_auxs, auxs_eqs) = (apsnd o map) mk_prop_eq
haftmann@50046
   254
      (mk_random_aux_eqs thy descr vs (names, auxnames) (Ts, Us));
haftmann@31595
   255
    val random_defs = map_index (fn (k, T) => mk_prop_eq
haftmann@31950
   256
      (HOLogic.mk_random T size, nth random_auxs k $ mk_size_arg k $ size)) Ts;
haftmann@31595
   257
  in
haftmann@31595
   258
    thy
haftmann@38348
   259
    |> Class.instantiation (tycos, vs, @{sort random})
haftmann@31868
   260
    |> random_aux_specification prfx random_auxN auxs_eqs
haftmann@31595
   261
    |> `(fn lthy => map (Syntax.check_term lthy) random_defs)
haftmann@31595
   262
    |-> (fn random_defs' => fold_map (fn random_def =>
wenzelm@33280
   263
          Specification.definition (NONE, (apfst Binding.conceal
haftmann@33205
   264
            Attrib.empty_binding, random_def))) random_defs')
haftmann@31595
   265
    |> snd
haftmann@31595
   266
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
haftmann@31595
   267
  end;
haftmann@31595
   268
haftmann@31950
   269
(** building and compiling generator expressions **)
haftmann@31950
   270
wenzelm@41472
   271
(* FIXME just one data slot (record) per program unit *)
wenzelm@41472
   272
wenzelm@41472
   273
structure Counterexample = Proof_Data
wenzelm@41472
   274
(
bulwahn@45754
   275
  type T = unit -> int -> bool -> int -> int * int -> (bool * term list) option * (int * int)
wenzelm@41472
   276
  (* FIXME avoid user error with non-user text *)
haftmann@39388
   277
  fun init _ () = error "Counterexample"
haftmann@39388
   278
);
haftmann@39388
   279
val put_counterexample = Counterexample.put;
haftmann@31950
   280
wenzelm@41472
   281
structure Counterexample_Report = Proof_Data
wenzelm@41472
   282
(
bulwahn@45763
   283
  type T = unit -> int -> bool -> int -> seed -> ((bool * term list) option * (bool list * bool)) * seed
wenzelm@41472
   284
  (* FIXME avoid user error with non-user text *)
haftmann@39388
   285
  fun init _ () = error "Counterexample_Report"
haftmann@39388
   286
);
haftmann@39388
   287
val put_counterexample_report = Counterexample_Report.put;
bulwahn@35378
   288
haftmann@31950
   289
val target = "Quickcheck";
haftmann@31950
   290
haftmann@50046
   291
fun mk_generator_expr ctxt (t, _) =
bulwahn@42159
   292
  let  
wenzelm@42361
   293
    val thy = Proof_Context.theory_of ctxt
wenzelm@44241
   294
    val prop = fold_rev absfree (Term.add_frees t []) t
bulwahn@42159
   295
    val Ts = (map snd o fst o strip_abs) prop
haftmann@31950
   296
    val bound_max = length Ts - 1;
haftmann@31950
   297
    val bounds = map_index (fn (i, ty) =>
haftmann@31950
   298
      (2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts;
haftmann@31950
   299
    val result = list_comb (prop, map (fn (i, _, _, _) => Bound i) bounds);
haftmann@31950
   300
    val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds);
haftmann@50046
   301
    val ([genuine_only_name], _) = Variable.variant_fixes ["genuine_only"] ctxt
bulwahn@45754
   302
    val genuine_only = Free (genuine_only_name, @{typ bool})
bulwahn@45763
   303
    val none_t = Const (@{const_name "None"}, resultT)
bulwahn@45763
   304
    val check = Quickcheck_Common.mk_safe_if genuine_only none_t (result, none_t,
bulwahn@45721
   305
      fn genuine => @{term "Some :: bool * term list => (bool * term list) option"} $
bulwahn@45721
   306
        HOLogic.mk_prod (Quickcheck_Common.reflect_bool genuine, terms))
bulwahn@45723
   307
    val return = HOLogic.pair_const resultT @{typ Random.seed};
haftmann@31950
   308
    fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT);
haftmann@31950
   309
    fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"});
haftmann@31950
   310
    fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp},
haftmann@31950
   311
      liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g;
haftmann@31950
   312
    fun mk_split T = Sign.mk_const thy
bulwahn@45723
   313
      (@{const_name prod_case}, [T, @{typ "unit => term"}, liftT resultT @{typ Random.seed}]);
haftmann@31950
   314
    fun mk_scomp_split T t t' =
bulwahn@45723
   315
      mk_scomp (mk_termtyp T) resultT @{typ Random.seed} t
haftmann@31950
   316
        (mk_split T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t')));
haftmann@31950
   317
    fun mk_bindclause (_, _, i, T) = mk_scomp_split T
haftmann@51126
   318
      (Sign.mk_const thy (@{const_name Quickcheck_Random.random}, [T]) $ Bound i);
bulwahn@45754
   319
  in
bulwahn@45754
   320
    lambda genuine_only
bulwahn@45761
   321
      (Abs ("n", @{typ code_numeral}, fold_rev mk_bindclause bounds (return $ check true)))
bulwahn@45754
   322
  end;
haftmann@31950
   323
haftmann@50046
   324
fun mk_reporting_generator_expr ctxt (t, _) =
bulwahn@35378
   325
  let
wenzelm@42361
   326
    val thy = Proof_Context.theory_of ctxt
bulwahn@45762
   327
    val resultT = @{typ "(bool * term list) option * (bool list * bool)"}
wenzelm@44241
   328
    val prop = fold_rev absfree (Term.add_frees t []) t
bulwahn@42159
   329
    val Ts = (map snd o fst o strip_abs) prop
bulwahn@42159
   330
    val bound_max = length Ts - 1
bulwahn@35378
   331
    val bounds = map_index (fn (i, ty) =>
bulwahn@35378
   332
      (2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts;
bulwahn@35378
   333
    val prop' = betapplys (prop, map (fn (i, _, _, _) => Bound i) bounds);
bulwahn@35378
   334
    val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds)
bulwahn@42195
   335
    val (assms, concl) = Quickcheck_Common.strip_imp prop'
haftmann@51126
   336
    val return = HOLogic.pair_const resultT @{typ Random.seed};
bulwahn@35378
   337
    fun mk_assms_report i =
bulwahn@45762
   338
      HOLogic.mk_prod (@{term "None :: (bool * term list) option"},
haftmann@38553
   339
        HOLogic.mk_prod (HOLogic.mk_list HOLogic.boolT
haftmann@38553
   340
          (replicate i @{term True} @ replicate (length assms - i) @{term False}),
haftmann@38553
   341
        @{term False}))
bulwahn@35378
   342
    fun mk_concl_report b =
haftmann@38553
   343
      HOLogic.mk_prod (HOLogic.mk_list HOLogic.boolT (replicate (length assms) @{term True}),
bulwahn@45763
   344
        Quickcheck_Common.reflect_bool b)
haftmann@50046
   345
    val ([genuine_only_name], _) = Variable.variant_fixes ["genuine_only"] ctxt
bulwahn@45763
   346
    val genuine_only = Free (genuine_only_name, @{typ bool})
bulwahn@45763
   347
    val none_t = HOLogic.mk_prod (@{term "None :: (bool * term list) option"}, mk_concl_report true)
bulwahn@45763
   348
    val concl_check = Quickcheck_Common.mk_safe_if genuine_only none_t (concl, none_t,
bulwahn@45763
   349
      fn genuine => HOLogic.mk_prod (@{term "Some :: bool * term list => (bool * term list) option"} $
bulwahn@45763
   350
        HOLogic.mk_prod (Quickcheck_Common.reflect_bool genuine, terms), mk_concl_report false))
bulwahn@45763
   351
    val check = fold_rev (fn (i, assm) => fn t => Quickcheck_Common.mk_safe_if genuine_only
bulwahn@45763
   352
      (mk_assms_report i) (HOLogic.mk_not assm, mk_assms_report i, t))
bulwahn@35378
   353
      (map_index I assms) concl_check
bulwahn@35378
   354
    fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT);
bulwahn@35378
   355
    fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"});
bulwahn@35378
   356
    fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp},
bulwahn@35378
   357
      liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g;
bulwahn@35378
   358
    fun mk_split T = Sign.mk_const thy
bulwahn@45762
   359
      (@{const_name prod_case}, [T, @{typ "unit => term"}, liftT resultT @{typ Random.seed}]);
bulwahn@35378
   360
    fun mk_scomp_split T t t' =
bulwahn@45762
   361
      mk_scomp (mk_termtyp T) resultT @{typ Random.seed} t
bulwahn@35378
   362
        (mk_split T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t')));
bulwahn@35378
   363
    fun mk_bindclause (_, _, i, T) = mk_scomp_split T
haftmann@51126
   364
      (Sign.mk_const thy (@{const_name Quickcheck_Random.random}, [T]) $ Bound i);
bulwahn@35378
   365
  in
bulwahn@45763
   366
    lambda genuine_only
bulwahn@45763
   367
      (Abs ("n", @{typ code_numeral}, fold_rev mk_bindclause bounds (return $ check true)))
bulwahn@35378
   368
  end
bulwahn@35378
   369
bulwahn@42159
   370
val mk_parametric_generator_expr = Quickcheck_Common.gen_mk_parametric_generator_expr 
bulwahn@42159
   371
  ((mk_generator_expr, 
bulwahn@45759
   372
    absdummy @{typ bool} (absdummy @{typ code_numeral}
bulwahn@45759
   373
      @{term "Pair None :: Random.seed => (bool * term list) option * Random.seed"})),
bulwahn@45759
   374
    @{typ "bool => code_numeral => Random.seed => (bool * term list) option * Random.seed"})
bulwahn@42159
   375
bulwahn@42159
   376
val mk_parametric_reporting_generator_expr = Quickcheck_Common.gen_mk_parametric_generator_expr 
bulwahn@42159
   377
  ((mk_reporting_generator_expr,
bulwahn@45763
   378
    absdummy @{typ bool} (absdummy @{typ code_numeral}
bulwahn@45763
   379
      @{term "Pair (None, ([], False)) :: Random.seed =>
bulwahn@45763
   380
        ((bool * term list) option * (bool list * bool)) * Random.seed"})),
bulwahn@45763
   381
    @{typ "bool => code_numeral => Random.seed => ((bool * term list) option * (bool list * bool)) * Random.seed"})
bulwahn@42159
   382
    
bulwahn@42159
   383
    
bulwahn@40911
   384
(* single quickcheck report *)
bulwahn@40911
   385
bulwahn@40911
   386
datatype single_report = Run of bool list * bool | MatchExc
bulwahn@40911
   387
bulwahn@40911
   388
fun collect_single_report single_report
bulwahn@40911
   389
    (Quickcheck.Report {iterations = iterations, raised_match_errors = raised_match_errors,
bulwahn@40911
   390
    satisfied_assms = satisfied_assms, positive_concl_tests = positive_concl_tests}) =
bulwahn@40911
   391
  case single_report
bulwahn@40911
   392
  of MatchExc =>
bulwahn@40911
   393
    Quickcheck.Report {iterations = iterations + 1, raised_match_errors = raised_match_errors + 1,
bulwahn@40911
   394
      satisfied_assms = satisfied_assms, positive_concl_tests = positive_concl_tests}
bulwahn@40911
   395
   | Run (assms, concl) =>
bulwahn@40911
   396
    Quickcheck.Report {iterations = iterations + 1, raised_match_errors = raised_match_errors,
bulwahn@40911
   397
      satisfied_assms =
bulwahn@40911
   398
        map2 (fn b => fn s => if b then s + 1 else s) assms
bulwahn@40911
   399
         (if null satisfied_assms then replicate (length assms) 0 else satisfied_assms),
bulwahn@40911
   400
      positive_concl_tests = if concl then positive_concl_tests + 1 else positive_concl_tests}
bulwahn@40911
   401
bulwahn@40911
   402
val empty_report = Quickcheck.Report { iterations = 0, raised_match_errors = 0,
bulwahn@40911
   403
  satisfied_assms = [], positive_concl_tests = 0 }
bulwahn@40911
   404
    
bulwahn@42159
   405
fun compile_generator_expr ctxt ts =
haftmann@31950
   406
  let
wenzelm@42361
   407
    val thy = Proof_Context.theory_of ctxt
bulwahn@40911
   408
    val iterations = Config.get ctxt Quickcheck.iterations
bulwahn@40911
   409
  in
bulwahn@40911
   410
    if Config.get ctxt Quickcheck.report then
bulwahn@40911
   411
      let
bulwahn@42159
   412
        val t' = mk_parametric_reporting_generator_expr ctxt ts;
bulwahn@40911
   413
        val compile = Code_Runtime.dynamic_value_strict
bulwahn@41923
   414
          (Counterexample_Report.get, put_counterexample_report, "Random_Generators.put_counterexample_report")
bulwahn@45762
   415
          thy (SOME target)
bulwahn@45763
   416
          (fn proc => fn g => fn c => fn b => fn s => g c b s
bulwahn@45763
   417
            #>> (apfst o Option.map o apsnd o map) proc) t' [];
bulwahn@45763
   418
        fun single_tester c b s = compile c b s |> Random_Engine.run
haftmann@50046
   419
        fun iterate_and_collect _ _ 0 report = (NONE, report)
bulwahn@45763
   420
          | iterate_and_collect genuine_only (card, size) j report =
bulwahn@40911
   421
            let
bulwahn@45763
   422
              val (test_result, single_report) = apsnd Run (single_tester card genuine_only size)
bulwahn@40911
   423
              val report = collect_single_report single_report report
bulwahn@40911
   424
            in
bulwahn@45763
   425
              case test_result of NONE => iterate_and_collect genuine_only (card, size) (j - 1) report
bulwahn@45762
   426
                | SOME q => (SOME q, report)
bulwahn@40911
   427
            end
bulwahn@40911
   428
      in
bulwahn@45763
   429
        fn genuine_only => fn [card, size] =>
bulwahn@45763
   430
          apsnd SOME (iterate_and_collect genuine_only (card, size) iterations empty_report)
bulwahn@40911
   431
      end
bulwahn@40911
   432
    else
bulwahn@40911
   433
      let
bulwahn@42159
   434
        val t' = mk_parametric_generator_expr ctxt ts;
bulwahn@40911
   435
        val compile = Code_Runtime.dynamic_value_strict
bulwahn@41923
   436
          (Counterexample.get, put_counterexample, "Random_Generators.put_counterexample")
bulwahn@45723
   437
          thy (SOME target)
bulwahn@45754
   438
          (fn proc => fn g => fn c => fn b => fn s => g c b s
bulwahn@45754
   439
            #>> (Option.map o apsnd o map) proc) t' [];
bulwahn@45754
   440
        fun single_tester c b s = compile c b s |> Random_Engine.run
haftmann@50046
   441
        fun iterate _ _ 0 = NONE
bulwahn@45754
   442
          | iterate genuine_only (card, size) j =
bulwahn@45754
   443
            case single_tester card genuine_only size of
bulwahn@45754
   444
              NONE => iterate genuine_only (card, size) (j - 1)
bulwahn@45754
   445
            | SOME q => SOME q
bulwahn@40911
   446
      in
bulwahn@45754
   447
        fn genuine_only => fn [card, size] =>
bulwahn@45754
   448
          (rpair NONE (iterate genuine_only (card, size) iterations))
bulwahn@40911
   449
      end
bulwahn@35378
   450
  end;
haftmann@31950
   451
haftmann@50818
   452
val size_types = [@{type_name Enum.finite_1}, @{type_name Enum.finite_2},
haftmann@50818
   453
  @{type_name Enum.finite_3}, @{type_name Enum.finite_4}, @{type_name Enum.finite_5}];
haftmann@50818
   454
haftmann@50818
   455
fun size_matters_for _ Ts =
haftmann@50818
   456
  not (forall (fn Type (tyco, []) => member (op =) size_types tyco | _ => false) Ts);
bulwahn@46331
   457
bulwahn@46331
   458
val test_goals =
bulwahn@46331
   459
  Quickcheck_Common.generator_test_goal_terms ("random", (size_matters_for, compile_generator_expr));
bulwahn@43875
   460
  
haftmann@31260
   461
(** setup **)
haftmann@31260
   462
bulwahn@43878
   463
val active = Attrib.setup_config_bool @{binding quickcheck_random_active} (K false);
bulwahn@43878
   464
haftmann@38393
   465
val setup =
bulwahn@45923
   466
  Quickcheck_Common.datatype_interpretation (@{sort random}, instantiate_random_datatype)
bulwahn@43878
   467
  #> Context.theory_map (Quickcheck.add_tester ("random", (active, test_goals)));
haftmann@31260
   468
haftmann@31260
   469
end;