src/HOL/Tools/quickcheck_generators.ML
author haftmann
Thu, 08 Jul 2010 16:19:24 +0200
changeset 37744 3daaf23b9ab4
parent 37591 d3daea901123
child 38348 cf7b2121ad9d
permissions -rw-r--r--
tuned titles
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
37744
3daaf23b9ab4 tuned titles
haftmann
parents: 37591
diff changeset
     1
(*  Title:      HOL/Tools/quickcheck_generators.ML
3daaf23b9ab4 tuned titles
haftmann
parents: 37591
diff changeset
     2
    Author:     Florian Haftmann, TU Muenchen
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     3
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     4
Quickcheck generators for various types.
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     5
*)
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     6
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     7
signature QUICKCHECK_GENERATORS =
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     8
sig
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
     9
  type seed = Random_Engine.seed
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    10
  val random_fun: typ -> typ -> ('a -> 'a -> bool) -> ('a -> term)
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    11
    -> (seed -> ('b * (unit -> term)) * seed) -> (seed -> seed * seed)
33243
17014b1b9353 normalized basic type abbreviations;
wenzelm
parents: 33205
diff changeset
    12
    -> seed -> (('a -> 'b) * (unit -> term)) * seed
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    13
  val ensure_random_typecopy: string -> theory -> theory
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
    14
  val random_aux_specification: string -> string -> term list -> local_theory -> local_theory
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    15
  val mk_random_aux_eqs: theory -> Datatype.descr -> (string * sort) list
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
    16
    -> string list -> string list * string list -> typ list * typ list
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
    17
    -> term list * (term * term) list
31737
b3f63611784e simplified names of common datatype types
haftmann
parents: 31723
diff changeset
    18
  val ensure_random_datatype: Datatype.config -> string list -> theory -> theory
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
    19
  val compile_generator_expr:
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
    20
    theory -> bool -> term -> int -> term list option * (bool list * bool)
32740
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32657
diff changeset
    21
  val eval_ref: (unit -> int -> seed -> term list option * seed) option Unsynchronized.ref
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
    22
  val eval_report_ref:
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
    23
    (unit -> int -> seed -> (term list option * (bool list * bool)) * seed) option Unsynchronized.ref
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    24
  val setup: theory -> theory
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    25
end;
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    26
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    27
structure Quickcheck_Generators : QUICKCHECK_GENERATORS =
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    28
struct
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    29
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    30
(** abstract syntax **)
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    31
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    32
fun termifyT T = HOLogic.mk_prodT (T, @{typ "unit => term"})
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    33
val size = @{term "i::code_numeral"};
31984
haftmann
parents: 31950
diff changeset
    34
val size_pred = @{term "(i::code_numeral) - 1"};
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    35
val size' = @{term "j::code_numeral"};
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    36
val seed = @{term "s::Random.seed"};
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    37
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    38
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    39
(** typ "'a => 'b" **)
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    40
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    41
type seed = Random_Engine.seed;
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    42
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
    43
fun random_fun T1 T2 eq term_of random random_split seed =
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    44
  let
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    45
    val fun_upd = Const (@{const_name fun_upd},
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    46
      (T1 --> T2) --> T1 --> T2 --> T1 --> T2);
32344
55ca0df19af5 more appropriate printing of function terms
haftmann
parents: 31984
diff changeset
    47
    val ((y, t2), seed') = random seed;
55ca0df19af5 more appropriate printing of function terms
haftmann
parents: 31984
diff changeset
    48
    val (seed'', seed''') = random_split seed';
31933
cd6511035315 proper closures -- imperative programming considered harmful...
haftmann
parents: 31902
diff changeset
    49
32740
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32657
diff changeset
    50
    val state = Unsynchronized.ref (seed'', [], fn () => Abs ("x", T1, t2 ()));
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    51
    fun random_fun' x =
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    52
      let
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    53
        val (seed, fun_map, f_t) = ! state;
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    54
      in case AList.lookup (uncurry eq) fun_map x
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    55
       of SOME y => y
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    56
        | NONE => let
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    57
              val t1 = term_of x;
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    58
              val ((y, t2), seed') = random seed;
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    59
              val fun_map' = (x, y) :: fun_map;
31933
cd6511035315 proper closures -- imperative programming considered harmful...
haftmann
parents: 31902
diff changeset
    60
              val f_t' = fn () => fun_upd $ f_t () $ t1 $ t2 ();
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    61
              val _ = state := (seed', fun_map', f_t');
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    62
            in y end
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    63
      end;
31933
cd6511035315 proper closures -- imperative programming considered harmful...
haftmann
parents: 31902
diff changeset
    64
    fun term_fun' () = #3 (! state) ();
32344
55ca0df19af5 more appropriate printing of function terms
haftmann
parents: 31984
diff changeset
    65
  in ((random_fun', term_fun'), seed''') end;
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    66
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    67
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    68
(** type copies **)
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    69
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    70
fun mk_random_typecopy tyco vs constr T' thy =
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    71
  let
34969
acd6b305ffb5 corrected type of typecopy constructor
haftmann
parents: 34028
diff changeset
    72
    val mk_const = curry (Sign.mk_const thy);
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    73
    val Ts = map TFree vs;  
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    74
    val T = Type (tyco, Ts);
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    75
    val Tm = termifyT T;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    76
    val Tm' = termifyT T';
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    77
    val v = "x";
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    78
    val t_v = Free (v, Tm');
34969
acd6b305ffb5 corrected type of typecopy constructor
haftmann
parents: 34028
diff changeset
    79
    val t_constr = Const (constr, T' --> T);
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    80
    val lhs = HOLogic.mk_random T size;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    81
    val rhs = HOLogic.mk_ST [((HOLogic.mk_random T' size, @{typ Random.seed}), SOME (v, Tm'))]
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    82
      (HOLogic.mk_return Tm @{typ Random.seed}
32657
5f13912245ff Code_Eval(uation)
haftmann
parents: 32378
diff changeset
    83
      (mk_const "Code_Evaluation.valapp" [T', T]
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    84
        $ HOLogic.mk_prod (t_constr, Abs ("u", @{typ unit}, HOLogic.reflect_term t_constr)) $ t_v))
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    85
      @{typ Random.seed} (SOME Tm, @{typ Random.seed});
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    86
    val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs));
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    87
  in   
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    88
    thy
33553
35f2b30593a8 modernized structure Theory_Target;
wenzelm
parents: 33552
diff changeset
    89
    |> Theory_Target.instantiation ([tyco], vs, @{sort random})
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    90
    |> `(fn lthy => Syntax.check_term lthy eq)
33280
wenzelm
parents: 33243
diff changeset
    91
    |-> (fn eq => Specification.definition (NONE, (apfst Binding.conceal Attrib.empty_binding, eq)))
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    92
    |> snd
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    93
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    94
  end;
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    95
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    96
fun ensure_random_typecopy tyco thy =
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
    97
  let
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
    98
    val SOME { vs = raw_vs, constr, typ = raw_T, ... } =
31723
f5cafe803b55 discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents: 31673
diff changeset
    99
      Typecopy.get_info thy tyco;
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   100
    val constrain = curry (Sorts.inter_sort (Sign.classes_of thy));
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   101
    val T = map_atyps (fn TFree (v, sort) =>
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   102
      TFree (v, constrain sort @{sort random})) raw_T;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   103
    val vs' = Term.add_tfreesT T [];
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   104
    val vs = map (fn (v, sort) =>
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   105
      (v, the_default (constrain sort @{sort typerep}) (AList.lookup (op =) vs' v))) raw_vs;
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   106
    val can_inst = Sign.of_sort thy (T, @{sort random});
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   107
  in if can_inst then mk_random_typecopy tyco vs constr T thy else thy end;
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   108
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   109
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   110
(** datatypes **)
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   111
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   112
(* definitional scheme for random instances on datatypes *)
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   113
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   114
(*FIXME avoid this low-level proving*)
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   115
local
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   116
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   117
fun dest_ctyp_nth k cT = nth (Thm.dest_ctyp cT) k;
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   118
val eq = Thm.cprop_of @{thm random_aux_rec} |> Thm.dest_arg |> Thm.dest_arg |> Thm.dest_arg;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   119
val lhs = eq |> Thm.dest_arg1;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   120
val pt_random_aux = lhs |> Thm.dest_fun;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   121
val ct_k = lhs |> Thm.dest_arg;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   122
val pt_rhs = eq |> Thm.dest_arg |> Thm.dest_fun;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   123
val aT = pt_random_aux |> Thm.ctyp_of_term |> dest_ctyp_nth 1;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   124
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   125
val rew_thms = map mk_meta_eq [@{thm code_numeral_zero_minus_one},
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   126
  @{thm Suc_code_numeral_minus_one}, @{thm select_weight_cons_zero}, @{thm beyond_zero}];
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   127
val rew_ts = map (Logic.dest_equals o Thm.prop_of) rew_thms;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   128
val rew_ss = HOL_ss addsimps rew_thms;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   129
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   130
in
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   131
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   132
fun random_aux_primrec eq lthy =
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   133
  let
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   134
    val thy = ProofContext.theory_of lthy;
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   135
    val ((t_random_aux as Free (random_aux, T)) $ (t_k as Free (v, _)), proto_t_rhs) =
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   136
      (HOLogic.dest_eq o HOLogic.dest_Trueprop) eq;
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   137
    val Type (_, [_, iT]) = T;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   138
    val icT = Thm.ctyp_of thy iT;
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   139
    val cert = Thm.cterm_of thy;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   140
    val inst = Thm.instantiate_cterm ([(aT, icT)], []);
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   141
    fun subst_v t' = map_aterms (fn t as Free (w, _) => if v = w then t' else t | t => t);
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   142
    val t_rhs = lambda t_k proto_t_rhs;
31785
9db4e79c91cf tuned proof
haftmann
parents: 31784
diff changeset
   143
    val eqs0 = [subst_v @{term "0::code_numeral"} eq,
9db4e79c91cf tuned proof
haftmann
parents: 31784
diff changeset
   144
      subst_v (@{term "Suc_code_numeral"} $ t_k) eq];
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   145
    val eqs1 = map (Pattern.rewrite_term thy rew_ts []) eqs0;
35166
a57ef2cd2236 tuned primrec signature: return definienda
haftmann
parents: 34969
diff changeset
   146
    val ((_, (_, eqs2)), lthy') = Primrec.add_primrec_simple
33205
20587741a8d9 conceal quickcheck generators
haftmann
parents: 33087
diff changeset
   147
      [((Binding.conceal (Binding.name random_aux), T), NoSyn)] eqs1 lthy;
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   148
    val cT_random_aux = inst pt_random_aux;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   149
    val cT_rhs = inst pt_rhs;
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   150
    val rule = @{thm random_aux_rec}
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   151
      |> Drule.instantiate ([(aT, icT)],
31785
9db4e79c91cf tuned proof
haftmann
parents: 31784
diff changeset
   152
           [(cT_random_aux, cert t_random_aux), (cT_rhs, cert t_rhs)]);
9db4e79c91cf tuned proof
haftmann
parents: 31784
diff changeset
   153
    val tac = ALLGOALS (rtac rule)
9db4e79c91cf tuned proof
haftmann
parents: 31784
diff changeset
   154
      THEN ALLGOALS (simp_tac rew_ss)
35166
a57ef2cd2236 tuned primrec signature: return definienda
haftmann
parents: 34969
diff changeset
   155
      THEN (ALLGOALS (ProofContext.fact_tac eqs2))
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32740
diff changeset
   156
    val simp = Skip_Proof.prove lthy' [v] [] eq (K tac);
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   157
  in (simp, lthy') end;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   158
31611
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   159
end;
a577f77af93f explicit instantiation yields considerable speedup
haftmann
parents: 31609
diff changeset
   160
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   161
fun random_aux_primrec_multi auxname [eq] lthy =
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   162
      lthy
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   163
      |> random_aux_primrec eq
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   164
      |>> (fn simp => [simp])
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   165
  | random_aux_primrec_multi auxname (eqs as _ :: _ :: _) lthy =
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   166
      let
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   167
        val thy = ProofContext.theory_of lthy;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   168
        val (lhss, rhss) = map_split (HOLogic.dest_eq o HOLogic.dest_Trueprop) eqs;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   169
        val (vs, (arg as Free (v, _)) :: _) = map_split (fn (t1 $ t2) => (t1, t2)) lhss;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   170
        val Ts = map fastype_of lhss;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   171
        val tupleT = foldr1 HOLogic.mk_prodT Ts;
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   172
        val aux_lhs = Free ("mutual_" ^ auxname, fastype_of arg --> tupleT) $ arg;
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   173
        val aux_eq = (HOLogic.mk_Trueprop o HOLogic.mk_eq)
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   174
          (aux_lhs, foldr1 HOLogic.mk_prod rhss);
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   175
        fun mk_proj t [T] = [t]
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   176
          | mk_proj t (Ts as T :: (Ts' as _ :: _)) =
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   177
              Const (@{const_name fst}, foldr1 HOLogic.mk_prodT Ts --> T) $ t
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   178
                :: mk_proj (Const (@{const_name snd},
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   179
                  foldr1 HOLogic.mk_prodT Ts --> foldr1 HOLogic.mk_prodT Ts') $ t) Ts';
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   180
        val projs = mk_proj (aux_lhs) Ts;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   181
        val proj_eqs = map2 (fn v => fn proj => (v, lambda arg proj)) vs projs;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   182
        val proj_defs = map2 (fn Free (name, _) => fn (_, rhs) =>
33205
20587741a8d9 conceal quickcheck generators
haftmann
parents: 33087
diff changeset
   183
          ((Binding.conceal (Binding.name name), NoSyn),
33280
wenzelm
parents: 33243
diff changeset
   184
            (apfst Binding.conceal Attrib.empty_binding, rhs))) vs proj_eqs;
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   185
        val aux_eq' = Pattern.rewrite_term thy proj_eqs [] aux_eq;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   186
        fun prove_eqs aux_simp proj_defs lthy = 
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   187
          let
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   188
            val proj_simps = map (snd o snd) proj_defs;
31645
98a3fd346270 made SML/NJ happy;
wenzelm
parents: 31628
diff changeset
   189
            fun tac { context = ctxt, prems = _ } =
31625
9e4d7d60c3e7 using SkipProof where appropriate
haftmann
parents: 31623
diff changeset
   190
              ALLGOALS (simp_tac (HOL_ss addsimps proj_simps))
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   191
              THEN ALLGOALS (EqSubst.eqsubst_tac ctxt [0] [aux_simp])
37136
e0c9d3e49e15 dropped legacy theorem bindings
haftmann
parents: 35845
diff changeset
   192
              THEN ALLGOALS (simp_tac (HOL_ss addsimps [@{thm fst_conv}, @{thm snd_conv}]));
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32740
diff changeset
   193
          in (map (fn prop => Skip_Proof.prove lthy [v] [] prop tac) eqs, lthy) end;
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   194
      in
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   195
        lthy
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   196
        |> random_aux_primrec aux_eq'
33766
c679f05600cd adapted Local_Theory.define -- eliminated odd thm kind;
wenzelm
parents: 33671
diff changeset
   197
        ||>> fold_map Local_Theory.define proj_defs
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   198
        |-> (fn (aux_simp, proj_defs) => prove_eqs aux_simp proj_defs)
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   199
      end;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   200
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   201
fun random_aux_specification prfx name eqs lthy =
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   202
  let
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   203
    val vs = fold Term.add_free_names ((snd o strip_comb o fst o HOLogic.dest_eq
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   204
      o HOLogic.dest_Trueprop o hd) eqs) [];
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   205
    fun mk_proto_eq eq =
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   206
      let
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   207
        val (head $ t $ u, rhs) = (HOLogic.dest_eq o HOLogic.dest_Trueprop) eq;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   208
      in ((HOLogic.mk_Trueprop o HOLogic.mk_eq) (head, lambda t (lambda u rhs))) end;
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   209
    val proto_eqs = map mk_proto_eq eqs;
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   210
    fun prove_simps proto_simps lthy =
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   211
      let
31625
9e4d7d60c3e7 using SkipProof where appropriate
haftmann
parents: 31623
diff changeset
   212
        val ext_simps = map (fn thm => fun_cong OF [fun_cong OF [thm]]) proto_simps;
9e4d7d60c3e7 using SkipProof where appropriate
haftmann
parents: 31623
diff changeset
   213
        val tac = ALLGOALS (ProofContext.fact_tac ext_simps);
32970
fbd2bb2489a8 operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents: 32740
diff changeset
   214
      in (map (fn prop => Skip_Proof.prove lthy vs [] prop (K tac)) eqs, lthy) end;
33205
20587741a8d9 conceal quickcheck generators
haftmann
parents: 33087
diff changeset
   215
    val b = Binding.conceal (Binding.qualify true prfx
20587741a8d9 conceal quickcheck generators
haftmann
parents: 33087
diff changeset
   216
      (Binding.qualify true name (Binding.name "simps")));
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   217
  in
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   218
    lthy
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   219
    |> random_aux_primrec_multi (name ^ prfx) proto_eqs
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   220
    |-> (fn proto_simps => prove_simps proto_simps)
33671
4b0f2599ed48 modernized structure Local_Theory;
wenzelm
parents: 33670
diff changeset
   221
    |-> (fn simps => Local_Theory.note
33666
e49bfeb0d822 eliminated obsolete "generated" kind -- collapsed to unspecific "" (definitely unused according to Lukas Bulwahn);
wenzelm
parents: 33553
diff changeset
   222
      ((b, Code.add_default_eqn_attrib :: map (Attrib.internal o K)
33552
506f80a9afe8 removed unused Quickcheck_RecFun_Simps;
wenzelm
parents: 33280
diff changeset
   223
          [Simplifier.simp_add, Nitpick_Simps.add]), simps))
31485
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   224
    |> snd
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   225
  end
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   226
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   227
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   228
(* constructing random instances on datatypes *)
259a3c90016e added infrastructure for definitorial construction of generators for datatypes
haftmann
parents: 31260
diff changeset
   229
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   230
val random_auxN = "random_aux";
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   231
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   232
fun mk_random_aux_eqs thy descr vs tycos (names, auxnames) (Ts, Us) =
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   233
  let
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   234
    val mk_const = curry (Sign.mk_const thy);
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   235
    val random_auxsN = map (prefix (random_auxN ^ "_")) (names @ auxnames);
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   236
    val rTs = Ts @ Us;
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   237
    fun random_resultT T = @{typ Random.seed}
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   238
      --> HOLogic.mk_prodT (termifyT T,@{typ Random.seed});
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   239
    val pTs = map random_resultT rTs;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   240
    fun sizeT T = @{typ code_numeral} --> @{typ code_numeral} --> T;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   241
    val random_auxT = sizeT o random_resultT;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   242
    val random_auxs = map2 (fn s => fn rT => Free (s, random_auxT rT))
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   243
      random_auxsN rTs;
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   244
    fun mk_random_call T = (NONE, (HOLogic.mk_random T size', T));
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   245
    fun mk_random_aux_call fTs (k, _) (tyco, Ts) =
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   246
      let
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   247
        val T = Type (tyco, Ts);
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   248
        fun mk_random_fun_lift [] t = t
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   249
          | mk_random_fun_lift (fT :: fTs) t =
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   250
              mk_const @{const_name random_fun_lift} [fTs ---> T, fT] $
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   251
                mk_random_fun_lift fTs t;
31984
haftmann
parents: 31950
diff changeset
   252
        val t = mk_random_fun_lift fTs (nth random_auxs k $ size_pred $ size');
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33766
diff changeset
   253
        val size = Option.map snd (Datatype_Aux.find_shortest_path descr k)
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   254
          |> the_default 0;
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   255
      in (SOME size, (t, fTs ---> T)) end;
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33766
diff changeset
   256
    val tss = Datatype_Aux.interpret_construction descr vs
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   257
      { atyp = mk_random_call, dtyp = mk_random_aux_call };
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   258
    fun mk_consexpr simpleT (c, xs) =
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   259
      let
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   260
        val (ks, simple_tTs) = split_list xs;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   261
        val T = termifyT simpleT;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   262
        val tTs = (map o apsnd) termifyT simple_tTs;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   263
        val is_rec = exists is_some ks;
33029
2fefe039edf1 uniform use of Integer.min/max;
wenzelm
parents: 32970
diff changeset
   264
        val k = fold (fn NONE => I | SOME k => Integer.max k) ks 0;
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   265
        val vs = Name.names Name.context "x" (map snd simple_tTs);
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   266
        val vs' = (map o apsnd) termifyT vs;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   267
        val tc = HOLogic.mk_return T @{typ Random.seed}
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   268
          (HOLogic.mk_valtermify_app c vs simpleT);
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   269
        val t = HOLogic.mk_ST (map (fn (t, _) => (t, @{typ Random.seed})) tTs ~~ map SOME vs')
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   270
          tc @{typ Random.seed} (SOME T, @{typ Random.seed});
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   271
        val tk = if is_rec
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   272
          then if k = 0 then size
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   273
            else @{term "Quickcheck.beyond :: code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"}
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   274
             $ HOLogic.mk_number @{typ code_numeral} k $ size
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   275
          else @{term "1::code_numeral"}
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   276
      in (is_rec, HOLogic.mk_prod (tk, t)) end;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   277
    fun sort_rec xs =
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   278
      map_filter (fn (true, t) => SOME t | _ =>  NONE) xs
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   279
      @ map_filter (fn (false, t) => SOME t | _ =>  NONE) xs;
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   280
    val gen_exprss = tss
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   281
      |> (map o apfst) Type
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   282
      |> map (fn (T, cs) => (T, (sort_rec o map (mk_consexpr T)) cs));
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   283
    fun mk_select (rT, xs) =
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   284
      mk_const @{const_name Quickcheck.collapse} [@{typ "Random.seed"}, termifyT rT]
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   285
      $ (mk_const @{const_name Random.select_weight} [random_resultT rT]
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   286
        $ HOLogic.mk_list (HOLogic.mk_prodT (@{typ code_numeral}, random_resultT rT)) xs)
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   287
          $ seed;
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   288
    val auxs_lhss = map (fn t => t $ size $ size' $ seed) random_auxs;
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   289
    val auxs_rhss = map mk_select gen_exprss;
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   290
  in (random_auxs, auxs_lhss ~~ auxs_rhss) end;
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   291
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   292
fun mk_random_datatype config descr vs tycos prfx (names, auxnames) (Ts, Us) thy =
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   293
  let
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33766
diff changeset
   294
    val _ = Datatype_Aux.message config "Creating quickcheck generators ...";
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   295
    val mk_prop_eq = HOLogic.mk_Trueprop o HOLogic.mk_eq;
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33766
diff changeset
   296
    fun mk_size_arg k = case Datatype_Aux.find_shortest_path descr k
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   297
     of SOME (_, l) => if l = 0 then size
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   298
          else @{term "max :: code_numeral \<Rightarrow> code_numeral \<Rightarrow> code_numeral"}
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   299
            $ HOLogic.mk_number @{typ code_numeral} l $ size
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   300
      | NONE => size;
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   301
    val (random_auxs, auxs_eqs) = (apsnd o map) mk_prop_eq
31603
fa30cd74d7d6 revised interpretation combinator for datatype constructions
haftmann
parents: 31595
diff changeset
   302
      (mk_random_aux_eqs thy descr vs tycos (names, auxnames) (Ts, Us));
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   303
    val random_defs = map_index (fn (k, T) => mk_prop_eq
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   304
      (HOLogic.mk_random T size, nth random_auxs k $ mk_size_arg k $ size)) Ts;
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   305
  in
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   306
    thy
33553
35f2b30593a8 modernized structure Theory_Target;
wenzelm
parents: 33552
diff changeset
   307
    |> Theory_Target.instantiation (tycos, vs, @{sort random})
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   308
    |> random_aux_specification prfx random_auxN auxs_eqs
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   309
    |> `(fn lthy => map (Syntax.check_term lthy) random_defs)
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   310
    |-> (fn random_defs' => fold_map (fn random_def =>
33280
wenzelm
parents: 33243
diff changeset
   311
          Specification.definition (NONE, (apfst Binding.conceal
33205
20587741a8d9 conceal quickcheck generators
haftmann
parents: 33087
diff changeset
   312
            Attrib.empty_binding, random_def))) random_defs')
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   313
    |> snd
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   314
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   315
  end;
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   316
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   317
fun perhaps_constrain thy insts raw_vs =
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   318
  let
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   319
    fun meet_random (T, sort) = Sorts.meet_sort (Sign.classes_of thy) 
35845
e5980f0ad025 renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents: 35378
diff changeset
   320
      (Logic.varifyT_global T, sort);
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   321
    val vtab = Vartab.empty
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   322
      |> fold (fn (v, sort) => Vartab.update ((v, 0), sort)) raw_vs
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   323
      |> fold meet_random insts;
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   324
  in SOME (fn (v, _) => (v, (the o Vartab.lookup vtab) (v, 0)))
33087
e50f948fd6bd handle Sorts.CLASS_ERROR instead of arbitrary exceptions;
wenzelm
parents: 33056
diff changeset
   325
  end handle Sorts.CLASS_ERROR _ => NONE;
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   326
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31641
diff changeset
   327
fun ensure_random_datatype config raw_tycos thy =
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   328
  let
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   329
    val algebra = Sign.classes_of thy;
31868
edd1f30c0477 canonical prefix for datatype derivates
haftmann
parents: 31785
diff changeset
   330
    val (descr, raw_vs, tycos, prfx, (names, auxnames), raw_TUs) =
31784
bd3486c57ba3 tuned interfaces of datatype module
haftmann
parents: 31744
diff changeset
   331
      Datatype.the_descr thy raw_tycos;
32378
haftmann
parents: 32344
diff changeset
   332
    val typerep_vs = (map o apsnd)
31744
dc3c2d52b642 more precise computation of sort constraints
haftmann
parents: 31737
diff changeset
   333
      (curry (Sorts.inter_sort algebra) @{sort typerep}) raw_vs;
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   334
    val random_insts = (map (rpair @{sort random}) o flat o maps snd o maps snd)
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33766
diff changeset
   335
      (Datatype_Aux.interpret_construction descr typerep_vs
31744
dc3c2d52b642 more precise computation of sort constraints
haftmann
parents: 31737
diff changeset
   336
        { atyp = single, dtyp = (K o K o K) [] });
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   337
    val term_of_insts = (map (rpair @{sort term_of}) o flat o maps snd o maps snd)
33968
f94fb13ecbb3 modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents: 33766
diff changeset
   338
      (Datatype_Aux.interpret_construction descr typerep_vs
31744
dc3c2d52b642 more precise computation of sort constraints
haftmann
parents: 31737
diff changeset
   339
        { atyp = K [], dtyp = K o K });
31608
a98a47ffdd8d correct check for instantiatability
haftmann
parents: 31603
diff changeset
   340
    val has_inst = exists (fn tyco =>
31595
bd2f7211a420 first running version of qc generators for datatypes
haftmann
parents: 31485
diff changeset
   341
      can (Sorts.mg_domain algebra tyco) @{sort random}) tycos;
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   342
  in if has_inst then thy
32378
haftmann
parents: 32344
diff changeset
   343
    else case perhaps_constrain thy (random_insts @ term_of_insts) typerep_vs
31668
a616e56a5ec8 datatype packages: record datatype_config for configuration flags; less verbose signatures
haftmann
parents: 31641
diff changeset
   344
     of SOME constrain => mk_random_datatype config descr
32378
haftmann
parents: 32344
diff changeset
   345
          (map constrain typerep_vs) tycos prfx (names, auxnames)
31623
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   346
            ((pairself o map o map_atyps) (fn TFree v => TFree (constrain v)) raw_TUs) thy
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   347
      | NONE => thy
b72c11302b39 quickcheck generators for datatypes with functions
haftmann
parents: 31611
diff changeset
   348
  end;
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   349
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   350
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   351
(** building and compiling generator expressions **)
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   352
32740
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32657
diff changeset
   353
val eval_ref :
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32657
diff changeset
   354
    (unit -> int -> int * int -> term list option * (int * int)) option Unsynchronized.ref =
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32657
diff changeset
   355
  Unsynchronized.ref NONE;
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   356
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   357
val eval_report_ref :
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   358
    (unit -> int -> seed -> (term list option * (bool list * bool)) * seed) option Unsynchronized.ref =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   359
  Unsynchronized.ref NONE;
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   360
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   361
val target = "Quickcheck";
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   362
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   363
fun mk_generator_expr thy prop Ts =
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   364
  let
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   365
    val bound_max = length Ts - 1;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   366
    val bounds = map_index (fn (i, ty) =>
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   367
      (2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   368
    val result = list_comb (prop, map (fn (i, _, _, _) => Bound i) bounds);
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   369
    val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds);
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   370
    val check = @{term "If :: bool => term list option => term list option => term list option"}
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   371
      $ result $ @{term "None :: term list option"} $ (@{term "Some :: term list => term list option"} $ terms);
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   372
    val return = @{term "Pair :: term list option => Random.seed => term list option * Random.seed"};
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   373
    fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT);
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   374
    fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"});
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   375
    fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp},
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   376
      liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   377
    fun mk_split T = Sign.mk_const thy
37591
d3daea901123 merged constants "split" and "prod_case"
haftmann
parents: 37136
diff changeset
   378
      (@{const_name prod_case}, [T, @{typ "unit => term"}, liftT @{typ "term list option"} @{typ Random.seed}]);
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   379
    fun mk_scomp_split T t t' =
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   380
      mk_scomp (mk_termtyp T) @{typ "term list option"} @{typ Random.seed} t
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   381
        (mk_split T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t')));
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   382
    fun mk_bindclause (_, _, i, T) = mk_scomp_split T
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   383
      (Sign.mk_const thy (@{const_name Quickcheck.random}, [T]) $ Bound i);
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   384
  in Abs ("n", @{typ code_numeral}, fold_rev mk_bindclause bounds (return $ check)) end;
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   385
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   386
fun mk_reporting_generator_expr thy prop Ts =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   387
  let
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   388
    val bound_max = length Ts - 1;
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   389
    val bounds = map_index (fn (i, ty) =>
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   390
      (2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts;
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   391
    fun strip_imp (Const("op -->",_) $ A $ B) = apfst (cons A) (strip_imp B)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   392
      | strip_imp A = ([], A)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   393
    val prop' = betapplys (prop, map (fn (i, _, _, _) => Bound i) bounds);
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   394
    val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   395
    val (assms, concl) = strip_imp prop'
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   396
    val return =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   397
      @{term "Pair :: term list option * (bool list * bool) => Random.seed => (term list option * (bool list * bool)) * Random.seed"};
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   398
    fun mk_assms_report i =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   399
      HOLogic.mk_prod (@{term "None :: term list option"},
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   400
        HOLogic.mk_prod (HOLogic.mk_list @{typ "bool"}
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   401
          (replicate i @{term "True"} @ replicate (length assms - i) @{term "False"}),
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   402
        @{term "False"}))
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   403
    fun mk_concl_report b =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   404
      HOLogic.mk_prod (HOLogic.mk_list @{typ "bool"} (replicate (length assms) @{term "True"}),
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   405
        if b then @{term True} else @{term False})
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   406
    val If =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   407
      @{term "If :: bool => term list option * (bool list * bool) => term list option * (bool list * bool) => term list option * (bool list * bool)"}
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   408
    val concl_check = If $ concl $
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   409
      HOLogic.mk_prod (@{term "None :: term list option"}, mk_concl_report true) $
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   410
      HOLogic.mk_prod (@{term "Some :: term list  => term list option"} $ terms, mk_concl_report false)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   411
    val check = fold_rev (fn (i, assm) => fn t => If $ assm $ t $ mk_assms_report i)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   412
      (map_index I assms) concl_check
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   413
    fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT);
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   414
    fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"});
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   415
    fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp},
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   416
      liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g;
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   417
    fun mk_split T = Sign.mk_const thy
37591
d3daea901123 merged constants "split" and "prod_case"
haftmann
parents: 37136
diff changeset
   418
      (@{const_name prod_case}, [T, @{typ "unit => term"},
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   419
        liftT @{typ "term list option * (bool list * bool)"} @{typ Random.seed}]);
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   420
    fun mk_scomp_split T t t' =
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   421
      mk_scomp (mk_termtyp T) @{typ "term list option * (bool list * bool)"} @{typ Random.seed} t
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   422
        (mk_split T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t')));
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   423
    fun mk_bindclause (_, _, i, T) = mk_scomp_split T
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   424
      (Sign.mk_const thy (@{const_name Quickcheck.random}, [T]) $ Bound i);
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   425
  in
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   426
    Abs ("n", @{typ code_numeral}, fold_rev mk_bindclause bounds (return $ check))
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   427
  end
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   428
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   429
fun compile_generator_expr thy report t =
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   430
  let
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   431
    val Ts = (map snd o fst o strip_abs) t;
35378
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   432
  in
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   433
    if report then
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   434
      let
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   435
        val t' = mk_reporting_generator_expr thy t Ts;
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   436
        val compile = Code_Eval.eval (SOME target) ("Quickcheck_Generators.eval_report_ref", eval_report_ref)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   437
          (fn proc => fn g => fn s => g s #>> ((apfst o Option.map o map) proc)) thy t' [];
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   438
      in
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   439
        compile #> Random_Engine.run
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   440
      end
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   441
    else
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   442
      let
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   443
        val t' = mk_generator_expr thy t Ts;
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   444
        val compile = Code_Eval.eval (SOME target) ("Quickcheck_Generators.eval_ref", eval_ref)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   445
          (fn proc => fn g => fn s => g s #>> (Option.map o map) proc) thy t' [];
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   446
        val dummy_report = ([], false)
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   447
      in fn s => ((compile #> Random_Engine.run) s, dummy_report) end
95d0e3adf38e added basic reporting of test cases to quickcheck
bulwahn
parents: 35166
diff changeset
   448
  end;
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   449
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   450
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   451
(** setup **)
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   452
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   453
val setup = Typecopy.interpretation ensure_random_typecopy
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   454
  #> Datatype.interpretation ensure_random_datatype
34028
1e6206763036 split off evaluation mechanisms in separte module Code_Eval
haftmann
parents: 33968
diff changeset
   455
  #> Code_Target.extend_target (target, (Code_Eval.target, K I))
31950
7300186d745a tuned code
haftmann
parents: 31933
diff changeset
   456
  #> Quickcheck.add_generator ("code", compile_generator_expr o ProofContext.theory_of);
31260
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   457
4d273d043d59 separate module for quickcheck generators
haftmann
parents:
diff changeset
   458
end;