src/HOL/Tools/quickcheck_generators.ML
author haftmann
Wed Aug 18 16:59:37 2010 +0200 (2010-08-18)
changeset 38543 6a65b92edf5e
parent 38393 7c045c03598f
child 38549 d0385f2764d8
permissions -rw-r--r--
tuned signature and code
haftmann@37744
     1
(*  Title:      HOL/Tools/quickcheck_generators.ML
haftmann@37744
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@31260
     3
haftmann@31260
     4
Quickcheck generators for various types.
haftmann@31260
     5
*)
haftmann@31260
     6
haftmann@31260
     7
signature QUICKCHECK_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
haftmann@38543
    13
  val perhaps_constrain: theory -> (typ * sort) list -> (string * sort) list
haftmann@38543
    14
    -> (string * sort -> string * sort) option
haftmann@31737
    15
  val ensure_random_datatype: Datatype.config -> string list -> theory -> theory
bulwahn@35378
    16
  val compile_generator_expr:
bulwahn@35378
    17
    theory -> bool -> term -> int -> term list option * (bool list * bool)
wenzelm@32740
    18
  val eval_ref: (unit -> int -> seed -> term list option * seed) option Unsynchronized.ref
bulwahn@35378
    19
  val eval_report_ref:
bulwahn@35378
    20
    (unit -> int -> seed -> (term list option * (bool list * bool)) * seed) option Unsynchronized.ref
haftmann@31260
    21
  val setup: theory -> theory
haftmann@31260
    22
end;
haftmann@31260
    23
haftmann@31260
    24
structure Quickcheck_Generators : QUICKCHECK_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
haftmann@31260
    35
haftmann@31260
    36
(** typ "'a => 'b" **)
haftmann@31260
    37
haftmann@31260
    38
type seed = Random_Engine.seed;
haftmann@31260
    39
haftmann@31603
    40
fun random_fun T1 T2 eq term_of random random_split seed =
haftmann@31260
    41
  let
haftmann@31260
    42
    val fun_upd = Const (@{const_name fun_upd},
haftmann@31260
    43
      (T1 --> T2) --> T1 --> T2 --> T1 --> T2);
haftmann@32344
    44
    val ((y, t2), seed') = random seed;
haftmann@32344
    45
    val (seed'', seed''') = random_split seed';
haftmann@31933
    46
wenzelm@32740
    47
    val state = Unsynchronized.ref (seed'', [], fn () => Abs ("x", T1, t2 ()));
haftmann@31260
    48
    fun random_fun' x =
haftmann@31260
    49
      let
haftmann@31260
    50
        val (seed, fun_map, f_t) = ! state;
haftmann@31260
    51
      in case AList.lookup (uncurry eq) fun_map x
haftmann@31260
    52
       of SOME y => y
haftmann@31260
    53
        | NONE => let
haftmann@31260
    54
              val t1 = term_of x;
haftmann@31260
    55
              val ((y, t2), seed') = random seed;
haftmann@31260
    56
              val fun_map' = (x, y) :: fun_map;
haftmann@31933
    57
              val f_t' = fn () => fun_upd $ f_t () $ t1 $ t2 ();
haftmann@31260
    58
              val _ = state := (seed', fun_map', f_t');
haftmann@31260
    59
            in y end
haftmann@31260
    60
      end;
haftmann@31933
    61
    fun term_fun' () = #3 (! state) ();
haftmann@32344
    62
  in ((random_fun', term_fun'), seed''') end;
haftmann@31260
    63
haftmann@31260
    64
haftmann@31260
    65
(** datatypes **)
haftmann@31260
    66
haftmann@31485
    67
(* definitional scheme for random instances on datatypes *)
haftmann@31485
    68
haftmann@31611
    69
local
haftmann@31611
    70
haftmann@31485
    71
fun dest_ctyp_nth k cT = nth (Thm.dest_ctyp cT) k;
haftmann@31611
    72
val eq = Thm.cprop_of @{thm random_aux_rec} |> Thm.dest_arg |> Thm.dest_arg |> Thm.dest_arg;
haftmann@31611
    73
val lhs = eq |> Thm.dest_arg1;
haftmann@31611
    74
val pt_random_aux = lhs |> Thm.dest_fun;
haftmann@31611
    75
val ct_k = lhs |> Thm.dest_arg;
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
haftmann@31485
    88
    val thy = ProofContext.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,
haftmann@31785
    98
      subst_v (@{term "Suc_code_numeral"} $ 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}
haftmann@31611
   105
      |> Drule.instantiate ([(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)
haftmann@35166
   109
      THEN (ALLGOALS (ProofContext.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
haftmann@31485
   121
        val thy = ProofContext.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;
haftmann@31625
   167
        val tac = ALLGOALS (ProofContext.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@33666
   176
      ((b, Code.add_default_eqn_attrib :: map (Attrib.internal o K)
wenzelm@33552
   177
          [Simplifier.simp_add, Nitpick_Simps.add]), simps))
haftmann@31485
   178
    |> snd
haftmann@31485
   179
  end
haftmann@31485
   180
haftmann@31485
   181
haftmann@31485
   182
(* constructing random instances on datatypes *)
haftmann@31485
   183
haftmann@31868
   184
val random_auxN = "random_aux";
haftmann@31868
   185
haftmann@31603
   186
fun mk_random_aux_eqs thy descr vs tycos (names, auxnames) (Ts, Us) =
haftmann@31595
   187
  let
haftmann@31595
   188
    val mk_const = curry (Sign.mk_const thy);
haftmann@31603
   189
    val random_auxsN = map (prefix (random_auxN ^ "_")) (names @ auxnames);
haftmann@31603
   190
    val rTs = Ts @ Us;
haftmann@31595
   191
    fun random_resultT T = @{typ Random.seed}
haftmann@31595
   192
      --> HOLogic.mk_prodT (termifyT T,@{typ Random.seed});
haftmann@31595
   193
    val pTs = map random_resultT rTs;
haftmann@31595
   194
    fun sizeT T = @{typ code_numeral} --> @{typ code_numeral} --> T;
haftmann@31595
   195
    val random_auxT = sizeT o random_resultT;
haftmann@31595
   196
    val random_auxs = map2 (fn s => fn rT => Free (s, random_auxT rT))
haftmann@31595
   197
      random_auxsN rTs;
haftmann@31950
   198
    fun mk_random_call T = (NONE, (HOLogic.mk_random T size', T));
haftmann@31603
   199
    fun mk_random_aux_call fTs (k, _) (tyco, Ts) =
haftmann@31595
   200
      let
haftmann@31623
   201
        val T = Type (tyco, Ts);
haftmann@31623
   202
        fun mk_random_fun_lift [] t = t
haftmann@31623
   203
          | mk_random_fun_lift (fT :: fTs) t =
haftmann@31623
   204
              mk_const @{const_name random_fun_lift} [fTs ---> T, fT] $
haftmann@31623
   205
                mk_random_fun_lift fTs t;
haftmann@31984
   206
        val t = mk_random_fun_lift fTs (nth random_auxs k $ size_pred $ size');
haftmann@33968
   207
        val size = Option.map snd (Datatype_Aux.find_shortest_path descr k)
haftmann@31595
   208
          |> the_default 0;
haftmann@31623
   209
      in (SOME size, (t, fTs ---> T)) end;
haftmann@33968
   210
    val tss = Datatype_Aux.interpret_construction descr vs
haftmann@31603
   211
      { atyp = mk_random_call, dtyp = mk_random_aux_call };
haftmann@31595
   212
    fun mk_consexpr simpleT (c, xs) =
haftmann@31595
   213
      let
haftmann@31595
   214
        val (ks, simple_tTs) = split_list xs;
haftmann@31595
   215
        val T = termifyT simpleT;
haftmann@31595
   216
        val tTs = (map o apsnd) termifyT simple_tTs;
haftmann@31595
   217
        val is_rec = exists is_some ks;
wenzelm@33029
   218
        val k = fold (fn NONE => I | SOME k => Integer.max k) ks 0;
haftmann@31595
   219
        val vs = Name.names Name.context "x" (map snd simple_tTs);
haftmann@31595
   220
        val tc = HOLogic.mk_return T @{typ Random.seed}
haftmann@31595
   221
          (HOLogic.mk_valtermify_app c vs simpleT);
haftmann@38543
   222
        val t = HOLogic.mk_ST
haftmann@38543
   223
          (map2 (fn (t, _) => fn (v, T') => ((t, @{typ Random.seed}), SOME ((v, termifyT T')))) tTs vs)
haftmann@38543
   224
            tc @{typ Random.seed} (SOME T, @{typ Random.seed});
haftmann@31595
   225
        val tk = if is_rec
haftmann@31950
   226
          then if k = 0 then size
haftmann@31595
   227
            else @{term "Quickcheck.beyond :: code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"}
haftmann@31950
   228
             $ HOLogic.mk_number @{typ code_numeral} k $ size
haftmann@31595
   229
          else @{term "1::code_numeral"}
haftmann@31595
   230
      in (is_rec, HOLogic.mk_prod (tk, t)) end;
haftmann@31595
   231
    fun sort_rec xs =
haftmann@31595
   232
      map_filter (fn (true, t) => SOME t | _ =>  NONE) xs
haftmann@31595
   233
      @ map_filter (fn (false, t) => SOME t | _ =>  NONE) xs;
haftmann@31603
   234
    val gen_exprss = tss
haftmann@31603
   235
      |> (map o apfst) Type
haftmann@31595
   236
      |> map (fn (T, cs) => (T, (sort_rec o map (mk_consexpr T)) cs));
haftmann@31595
   237
    fun mk_select (rT, xs) =
haftmann@31595
   238
      mk_const @{const_name Quickcheck.collapse} [@{typ "Random.seed"}, termifyT rT]
haftmann@31595
   239
      $ (mk_const @{const_name Random.select_weight} [random_resultT rT]
haftmann@31595
   240
        $ HOLogic.mk_list (HOLogic.mk_prodT (@{typ code_numeral}, random_resultT rT)) xs)
haftmann@31595
   241
          $ seed;
haftmann@31950
   242
    val auxs_lhss = map (fn t => t $ size $ size' $ seed) random_auxs;
haftmann@31595
   243
    val auxs_rhss = map mk_select gen_exprss;
haftmann@31868
   244
  in (random_auxs, auxs_lhss ~~ auxs_rhss) end;
haftmann@31595
   245
haftmann@38543
   246
fun instantiate_random_datatype config descr vs tycos prfx (names, auxnames) (Ts, Us) thy =
haftmann@31595
   247
  let
haftmann@33968
   248
    val _ = Datatype_Aux.message config "Creating quickcheck generators ...";
haftmann@31595
   249
    val mk_prop_eq = HOLogic.mk_Trueprop o HOLogic.mk_eq;
haftmann@33968
   250
    fun mk_size_arg k = case Datatype_Aux.find_shortest_path descr k
haftmann@31950
   251
     of SOME (_, l) => if l = 0 then size
haftmann@31595
   252
          else @{term "max :: code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"}
haftmann@31950
   253
            $ HOLogic.mk_number @{typ code_numeral} l $ size
haftmann@31950
   254
      | NONE => size;
haftmann@31868
   255
    val (random_auxs, auxs_eqs) = (apsnd o map) mk_prop_eq
haftmann@31603
   256
      (mk_random_aux_eqs thy descr vs tycos (names, auxnames) (Ts, Us));
haftmann@31595
   257
    val random_defs = map_index (fn (k, T) => mk_prop_eq
haftmann@31950
   258
      (HOLogic.mk_random T size, nth random_auxs k $ mk_size_arg k $ size)) Ts;
haftmann@31595
   259
  in
haftmann@31595
   260
    thy
haftmann@38348
   261
    |> Class.instantiation (tycos, vs, @{sort random})
haftmann@31868
   262
    |> random_aux_specification prfx random_auxN auxs_eqs
haftmann@31595
   263
    |> `(fn lthy => map (Syntax.check_term lthy) random_defs)
haftmann@31595
   264
    |-> (fn random_defs' => fold_map (fn random_def =>
wenzelm@33280
   265
          Specification.definition (NONE, (apfst Binding.conceal
haftmann@33205
   266
            Attrib.empty_binding, random_def))) random_defs')
haftmann@31595
   267
    |> snd
haftmann@31595
   268
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
haftmann@31595
   269
  end;
haftmann@31595
   270
haftmann@31623
   271
fun perhaps_constrain thy insts raw_vs =
haftmann@31623
   272
  let
haftmann@38543
   273
    fun meet (T, sort) = Sorts.meet_sort (Sign.classes_of thy) 
wenzelm@35845
   274
      (Logic.varifyT_global T, sort);
haftmann@31623
   275
    val vtab = Vartab.empty
haftmann@31623
   276
      |> fold (fn (v, sort) => Vartab.update ((v, 0), sort)) raw_vs
haftmann@38543
   277
      |> fold meet insts;
haftmann@31623
   278
  in SOME (fn (v, _) => (v, (the o Vartab.lookup vtab) (v, 0)))
wenzelm@33087
   279
  end handle Sorts.CLASS_ERROR _ => NONE;
haftmann@31623
   280
haftmann@31668
   281
fun ensure_random_datatype config raw_tycos thy =
haftmann@31595
   282
  let
haftmann@31595
   283
    val algebra = Sign.classes_of thy;
haftmann@31868
   284
    val (descr, raw_vs, tycos, prfx, (names, auxnames), raw_TUs) =
haftmann@31784
   285
      Datatype.the_descr thy raw_tycos;
haftmann@32378
   286
    val typerep_vs = (map o apsnd)
haftmann@31744
   287
      (curry (Sorts.inter_sort algebra) @{sort typerep}) raw_vs;
haftmann@31623
   288
    val random_insts = (map (rpair @{sort random}) o flat o maps snd o maps snd)
haftmann@33968
   289
      (Datatype_Aux.interpret_construction descr typerep_vs
haftmann@31744
   290
        { atyp = single, dtyp = (K o K o K) [] });
haftmann@31623
   291
    val term_of_insts = (map (rpair @{sort term_of}) o flat o maps snd o maps snd)
haftmann@33968
   292
      (Datatype_Aux.interpret_construction descr typerep_vs
haftmann@31744
   293
        { atyp = K [], dtyp = K o K });
haftmann@31608
   294
    val has_inst = exists (fn tyco =>
haftmann@31595
   295
      can (Sorts.mg_domain algebra tyco) @{sort random}) tycos;
haftmann@31623
   296
  in if has_inst then thy
haftmann@32378
   297
    else case perhaps_constrain thy (random_insts @ term_of_insts) typerep_vs
haftmann@38543
   298
     of SOME constrain => instantiate_random_datatype config descr
haftmann@32378
   299
          (map constrain typerep_vs) tycos prfx (names, auxnames)
haftmann@31623
   300
            ((pairself o map o map_atyps) (fn TFree v => TFree (constrain v)) raw_TUs) thy
haftmann@31623
   301
      | NONE => thy
haftmann@31623
   302
  end;
haftmann@31260
   303
haftmann@31260
   304
haftmann@31950
   305
(** building and compiling generator expressions **)
haftmann@31950
   306
wenzelm@32740
   307
val eval_ref :
wenzelm@32740
   308
    (unit -> int -> int * int -> term list option * (int * int)) option Unsynchronized.ref =
wenzelm@32740
   309
  Unsynchronized.ref NONE;
haftmann@31950
   310
bulwahn@35378
   311
val eval_report_ref :
bulwahn@35378
   312
    (unit -> int -> seed -> (term list option * (bool list * bool)) * seed) option Unsynchronized.ref =
bulwahn@35378
   313
  Unsynchronized.ref NONE;
bulwahn@35378
   314
haftmann@31950
   315
val target = "Quickcheck";
haftmann@31950
   316
haftmann@31950
   317
fun mk_generator_expr thy prop Ts =
haftmann@31950
   318
  let
haftmann@31950
   319
    val bound_max = length Ts - 1;
haftmann@31950
   320
    val bounds = map_index (fn (i, ty) =>
haftmann@31950
   321
      (2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts;
haftmann@31950
   322
    val result = list_comb (prop, map (fn (i, _, _, _) => Bound i) bounds);
haftmann@31950
   323
    val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds);
haftmann@31950
   324
    val check = @{term "If :: bool => term list option => term list option => term list option"}
bulwahn@35378
   325
      $ result $ @{term "None :: term list option"} $ (@{term "Some :: term list => term list option"} $ terms);
haftmann@31950
   326
    val return = @{term "Pair :: term list option => Random.seed => term list option * Random.seed"};
haftmann@31950
   327
    fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT);
haftmann@31950
   328
    fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"});
haftmann@31950
   329
    fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp},
haftmann@31950
   330
      liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g;
haftmann@31950
   331
    fun mk_split T = Sign.mk_const thy
haftmann@37591
   332
      (@{const_name prod_case}, [T, @{typ "unit => term"}, liftT @{typ "term list option"} @{typ Random.seed}]);
haftmann@31950
   333
    fun mk_scomp_split T t t' =
haftmann@31950
   334
      mk_scomp (mk_termtyp T) @{typ "term list option"} @{typ Random.seed} t
haftmann@31950
   335
        (mk_split T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t')));
haftmann@31950
   336
    fun mk_bindclause (_, _, i, T) = mk_scomp_split T
haftmann@31950
   337
      (Sign.mk_const thy (@{const_name Quickcheck.random}, [T]) $ Bound i);
haftmann@31950
   338
  in Abs ("n", @{typ code_numeral}, fold_rev mk_bindclause bounds (return $ check)) end;
haftmann@31950
   339
bulwahn@35378
   340
fun mk_reporting_generator_expr thy prop Ts =
bulwahn@35378
   341
  let
bulwahn@35378
   342
    val bound_max = length Ts - 1;
bulwahn@35378
   343
    val bounds = map_index (fn (i, ty) =>
bulwahn@35378
   344
      (2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts;
bulwahn@35378
   345
    fun strip_imp (Const("op -->",_) $ A $ B) = apfst (cons A) (strip_imp B)
bulwahn@35378
   346
      | strip_imp A = ([], A)
bulwahn@35378
   347
    val prop' = betapplys (prop, map (fn (i, _, _, _) => Bound i) bounds);
bulwahn@35378
   348
    val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds)
bulwahn@35378
   349
    val (assms, concl) = strip_imp prop'
bulwahn@35378
   350
    val return =
bulwahn@35378
   351
      @{term "Pair :: term list option * (bool list * bool) => Random.seed => (term list option * (bool list * bool)) * Random.seed"};
bulwahn@35378
   352
    fun mk_assms_report i =
bulwahn@35378
   353
      HOLogic.mk_prod (@{term "None :: term list option"},
bulwahn@35378
   354
        HOLogic.mk_prod (HOLogic.mk_list @{typ "bool"}
bulwahn@35378
   355
          (replicate i @{term "True"} @ replicate (length assms - i) @{term "False"}),
bulwahn@35378
   356
        @{term "False"}))
bulwahn@35378
   357
    fun mk_concl_report b =
bulwahn@35378
   358
      HOLogic.mk_prod (HOLogic.mk_list @{typ "bool"} (replicate (length assms) @{term "True"}),
bulwahn@35378
   359
        if b then @{term True} else @{term False})
bulwahn@35378
   360
    val If =
bulwahn@35378
   361
      @{term "If :: bool => term list option * (bool list * bool) => term list option * (bool list * bool) => term list option * (bool list * bool)"}
bulwahn@35378
   362
    val concl_check = If $ concl $
bulwahn@35378
   363
      HOLogic.mk_prod (@{term "None :: term list option"}, mk_concl_report true) $
bulwahn@35378
   364
      HOLogic.mk_prod (@{term "Some :: term list  => term list option"} $ terms, mk_concl_report false)
bulwahn@35378
   365
    val check = fold_rev (fn (i, assm) => fn t => If $ assm $ t $ mk_assms_report i)
bulwahn@35378
   366
      (map_index I assms) concl_check
bulwahn@35378
   367
    fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT);
bulwahn@35378
   368
    fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"});
bulwahn@35378
   369
    fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp},
bulwahn@35378
   370
      liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g;
bulwahn@35378
   371
    fun mk_split T = Sign.mk_const thy
haftmann@37591
   372
      (@{const_name prod_case}, [T, @{typ "unit => term"},
bulwahn@35378
   373
        liftT @{typ "term list option * (bool list * bool)"} @{typ Random.seed}]);
bulwahn@35378
   374
    fun mk_scomp_split T t t' =
bulwahn@35378
   375
      mk_scomp (mk_termtyp T) @{typ "term list option * (bool list * bool)"} @{typ Random.seed} t
bulwahn@35378
   376
        (mk_split T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t')));
bulwahn@35378
   377
    fun mk_bindclause (_, _, i, T) = mk_scomp_split T
bulwahn@35378
   378
      (Sign.mk_const thy (@{const_name Quickcheck.random}, [T]) $ Bound i);
bulwahn@35378
   379
  in
bulwahn@35378
   380
    Abs ("n", @{typ code_numeral}, fold_rev mk_bindclause bounds (return $ check))
bulwahn@35378
   381
  end
bulwahn@35378
   382
bulwahn@35378
   383
fun compile_generator_expr thy report t =
haftmann@31950
   384
  let
haftmann@31950
   385
    val Ts = (map snd o fst o strip_abs) t;
haftmann@38543
   386
  in if report then
haftmann@38543
   387
    let
haftmann@38543
   388
      val t' = mk_reporting_generator_expr thy t Ts;
haftmann@38543
   389
      val compile = Code_Eval.eval (SOME target) ("Quickcheck_Generators.eval_report_ref", eval_report_ref)
haftmann@38543
   390
        (fn proc => fn g => fn s => g s #>> (apfst o Option.map o map) proc) thy t' [];
haftmann@38543
   391
    in compile #> Random_Engine.run end
haftmann@38543
   392
  else
haftmann@38543
   393
    let
haftmann@38543
   394
      val t' = mk_generator_expr thy t Ts;
haftmann@38543
   395
      val compile = Code_Eval.eval (SOME target) ("Quickcheck_Generators.eval_ref", eval_ref)
haftmann@38543
   396
        (fn proc => fn g => fn s => g s #>> (Option.map o map) proc) thy t' [];
haftmann@38543
   397
      val dummy_report = ([], false)
haftmann@38543
   398
    in compile #> Random_Engine.run #> rpair dummy_report end
bulwahn@35378
   399
  end;
haftmann@31950
   400
haftmann@31950
   401
haftmann@31260
   402
(** setup **)
haftmann@31260
   403
haftmann@38393
   404
val setup =
haftmann@38393
   405
  Datatype.interpretation ensure_random_datatype
haftmann@34028
   406
  #> Code_Target.extend_target (target, (Code_Eval.target, K I))
haftmann@31950
   407
  #> Quickcheck.add_generator ("code", compile_generator_expr o ProofContext.theory_of);
haftmann@31260
   408
haftmann@31260
   409
end;