author | wenzelm |
Thu, 23 Jun 2016 11:01:14 +0200 | |
changeset 63352 | 4eaf35781b23 |
parent 63239 | d562c9948dee |
child 66251 | cd935b7cb3fb |
permissions | -rw-r--r-- |
41923
f05fc0711bc7
renaming signatures and structures; correcting header
bulwahn
parents:
41921
diff
changeset
|
1 |
(* Title: HOL/Tools/Quickcheck/random_generators.ML |
37744 | 2 |
Author: Florian Haftmann, TU Muenchen |
31260 | 3 |
|
41923
f05fc0711bc7
renaming signatures and structures; correcting header
bulwahn
parents:
41921
diff
changeset
|
4 |
Random generators for various types. |
31260 | 5 |
*) |
6 |
||
41923
f05fc0711bc7
renaming signatures and structures; correcting header
bulwahn
parents:
41921
diff
changeset
|
7 |
signature RANDOM_GENERATORS = |
31260 | 8 |
sig |
9 |
type seed = Random_Engine.seed |
|
62979 | 10 |
val random_fun: typ -> typ -> ('a -> 'a -> bool) -> ('a -> term) -> |
11 |
(seed -> ('b * (unit -> term)) * seed) -> (seed -> seed * seed) -> |
|
12 |
seed -> (('a -> 'b) * (unit -> term)) * seed |
|
13 |
val compile_generator_expr: Proof.context -> (term * term list) list -> bool -> int list -> |
|
14 |
(bool * term list) option * Quickcheck.report option |
|
15 |
val put_counterexample: (unit -> Code_Numeral.natural -> bool -> Code_Numeral.natural -> |
|
16 |
seed -> (bool * term list) option * seed) -> Proof.context -> Proof.context |
|
17 |
val put_counterexample_report: (unit -> Code_Numeral.natural -> bool -> |
|
18 |
Code_Numeral.natural -> seed -> ((bool * term list) option * (bool list * bool)) * seed) -> |
|
19 |
Proof.context -> Proof.context |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
55757
diff
changeset
|
20 |
val instantiate_random_datatype : Old_Datatype_Aux.config -> Old_Datatype_Aux.descr -> |
62979 | 21 |
(string * sort) list -> string list -> string -> string list * string list -> |
22 |
typ list * typ list -> theory -> theory |
|
31260 | 23 |
end; |
24 |
||
41923
f05fc0711bc7
renaming signatures and structures; correcting header
bulwahn
parents:
41921
diff
changeset
|
25 |
structure Random_Generators : RANDOM_GENERATORS = |
31260 | 26 |
struct |
27 |
||
31950 | 28 |
(** abstract syntax **) |
31260 | 29 |
|
62979 | 30 |
fun termifyT T = HOLogic.mk_prodT (T, @{typ "unit \<Rightarrow> term"}) |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
31 |
val size = @{term "i::natural"}; |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
32 |
val size_pred = @{term "(i::natural) - 1"}; |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
33 |
val size' = @{term "j::natural"}; |
31950 | 34 |
val seed = @{term "s::Random.seed"}; |
31260 | 35 |
|
62979 | 36 |
val resultT = @{typ "(bool \<times> term list) option"}; |
45721
d1fb55c2ed65
quickcheck's compilation returns if it is genuine counterexample or a counterexample due to a match exception
bulwahn
parents:
45719
diff
changeset
|
37 |
|
62979 | 38 |
|
39 |
(** typ "'a \<Rightarrow> 'b" **) |
|
31260 | 40 |
|
41 |
type seed = Random_Engine.seed; |
|
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 | 44 |
let |
62979 | 45 |
val fun_upd = Const (@{const_name fun_upd}, (T1 --> T2) --> T1 --> T2 --> T1 --> T2); |
50046 | 46 |
val ((_, t2), seed') = random seed; |
32344 | 47 |
val (seed'', seed''') = random_split seed'; |
31933
cd6511035315
proper closures -- imperative programming considered harmful...
haftmann
parents:
31902
diff
changeset
|
48 |
|
32740 | 49 |
val state = Unsynchronized.ref (seed'', [], fn () => Abs ("x", T1, t2 ())); |
31260 | 50 |
fun random_fun' x = |
51 |
let |
|
52 |
val (seed, fun_map, f_t) = ! state; |
|
53 |
in case AList.lookup (uncurry eq) fun_map x |
|
54 |
of SOME y => y |
|
55 |
| NONE => let |
|
56 |
val t1 = term_of x; |
|
57 |
val ((y, t2), seed') = random seed; |
|
58 |
val fun_map' = (x, y) :: fun_map; |
|
31933
cd6511035315
proper closures -- imperative programming considered harmful...
haftmann
parents:
31902
diff
changeset
|
59 |
val f_t' = fn () => fun_upd $ f_t () $ t1 $ t2 (); |
31260 | 60 |
val _ = state := (seed', fun_map', f_t'); |
61 |
in y end |
|
62 |
end; |
|
31933
cd6511035315
proper closures -- imperative programming considered harmful...
haftmann
parents:
31902
diff
changeset
|
63 |
fun term_fun' () = #3 (! state) (); |
32344 | 64 |
in ((random_fun', term_fun'), seed''') end; |
31260 | 65 |
|
45762
daf57640d4df
the reporting random testing also returns if the counterexample is genuine or potentially spurious
bulwahn
parents:
45761
diff
changeset
|
66 |
|
31260 | 67 |
(** datatypes **) |
68 |
||
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
69 |
(* definitional scheme for random instances on datatypes *) |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
70 |
|
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
71 |
local |
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
72 |
|
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
73 |
fun dest_ctyp_nth k cT = nth (Thm.dest_ctyp cT) k; |
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
74 |
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
|
75 |
val lhs = eq |> Thm.dest_arg1; |
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
76 |
val pt_random_aux = lhs |> Thm.dest_fun; |
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
77 |
val pt_rhs = eq |> Thm.dest_arg |> Thm.dest_fun; |
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
78 |
val a_v = |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
79 |
pt_random_aux |> Thm.ctyp_of_cterm |> dest_ctyp_nth 1 |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
80 |
|> Thm.typ_of |> dest_TVar; |
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
81 |
|
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
82 |
val rew_thms = map mk_meta_eq [@{thm natural_zero_minus_one}, |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
83 |
@{thm Suc_natural_minus_one}, @{thm select_weight_cons_zero}, @{thm beyond_zero}]; |
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
84 |
val rew_ts = map (Logic.dest_equals o Thm.prop_of) rew_thms; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51551
diff
changeset
|
85 |
val rew_ss = simpset_of (put_simpset HOL_ss @{context} addsimps rew_thms); |
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
86 |
|
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
87 |
in |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
88 |
|
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
89 |
fun random_aux_primrec eq lthy = |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
90 |
let |
42361 | 91 |
val thy = Proof_Context.theory_of lthy; |
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
92 |
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
|
93 |
(HOLogic.dest_eq o HOLogic.dest_Trueprop) eq; |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
94 |
val Type (_, [_, iT]) = T; |
59637 | 95 |
val icT = Thm.ctyp_of lthy iT; |
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
96 |
val inst = Thm.instantiate_cterm ([(a_v, icT)], []); |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
97 |
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
|
98 |
val t_rhs = lambda t_k proto_t_rhs; |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
99 |
val eqs0 = [subst_v @{term "0::natural"} eq, |
46547
d1dcb91a512e
use qualified constant names instead of suffixes (from Florian Haftmann)
huffman
parents:
46331
diff
changeset
|
100 |
subst_v (@{const Code_Numeral.Suc} $ t_k) eq]; |
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
101 |
val eqs1 = map (Pattern.rewrite_term thy rew_ts []) eqs0; |
59617 | 102 |
val ((_, (_, eqs2)), lthy') = lthy |
60003 | 103 |
|> BNF_LFP_Compat.primrec_simple |
59859 | 104 |
[((Binding.concealed (Binding.name random_aux), T), NoSyn)] eqs1; |
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
105 |
val cT_random_aux = inst pt_random_aux |> Thm.term_of |> dest_Var; |
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
106 |
val cT_rhs = inst pt_rhs |> Thm.term_of |> dest_Var; |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
107 |
val rule = @{thm random_aux_rec} |
59617 | 108 |
|> Drule.instantiate_normalize |
60642
48dd1cefb4ae
simplified Thm.instantiate and derivatives: the LHS refers to non-certified variables -- this merely serves as index into already certified structures (or is ignored);
wenzelm
parents:
60003
diff
changeset
|
109 |
([(a_v, icT)], |
59637 | 110 |
[(cT_random_aux, Thm.cterm_of lthy' t_random_aux), |
111 |
(cT_rhs, Thm.cterm_of lthy' t_rhs)]); |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51551
diff
changeset
|
112 |
fun tac ctxt = |
60752 | 113 |
ALLGOALS (resolve_tac ctxt [rule]) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51551
diff
changeset
|
114 |
THEN ALLGOALS (simp_tac (put_simpset rew_ss ctxt)) |
59617 | 115 |
THEN (ALLGOALS (Proof_Context.fact_tac ctxt eqs2)); |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51551
diff
changeset
|
116 |
val simp = Goal.prove_sorry lthy' [v] [] eq (tac o #context); |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
117 |
in (simp, lthy') end; |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
118 |
|
31611
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
119 |
end; |
a577f77af93f
explicit instantiation yields considerable speedup
haftmann
parents:
31609
diff
changeset
|
120 |
|
31868 | 121 |
fun random_aux_primrec_multi auxname [eq] lthy = |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
122 |
lthy |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
123 |
|> random_aux_primrec eq |
58229 | 124 |
|>> single |
31868 | 125 |
| random_aux_primrec_multi auxname (eqs as _ :: _ :: _) lthy = |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
126 |
let |
42361 | 127 |
val thy = Proof_Context.theory_of lthy; |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
128 |
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
|
129 |
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
|
130 |
val Ts = map fastype_of lhss; |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
131 |
val tupleT = foldr1 HOLogic.mk_prodT Ts; |
31868 | 132 |
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
|
133 |
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
|
134 |
(aux_lhs, foldr1 HOLogic.mk_prod rhss); |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
135 |
fun mk_proj t [T] = [t] |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
136 |
| mk_proj t (Ts as T :: (Ts' as _ :: _)) = |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
137 |
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
|
138 |
:: mk_proj (Const (@{const_name snd}, |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
139 |
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
|
140 |
val projs = mk_proj (aux_lhs) Ts; |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
141 |
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
|
142 |
val proj_defs = map2 (fn Free (name, _) => fn (_, rhs) => |
59859 | 143 |
((Binding.concealed (Binding.name name), NoSyn), |
63352 | 144 |
(apfst Binding.concealed Binding.empty_atts, rhs))) vs proj_eqs; |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
145 |
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
|
146 |
fun prove_eqs aux_simp proj_defs lthy = |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
147 |
let |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
148 |
val proj_simps = map (snd o snd) proj_defs; |
31645 | 149 |
fun tac { context = ctxt, prems = _ } = |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51551
diff
changeset
|
150 |
ALLGOALS (simp_tac (put_simpset HOL_ss ctxt addsimps proj_simps)) |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
151 |
THEN ALLGOALS (EqSubst.eqsubst_tac ctxt [0] [aux_simp]) |
58229 | 152 |
THEN ALLGOALS (simp_tac (put_simpset HOL_ss ctxt addsimps @{thms fst_conv snd_conv})); |
51551 | 153 |
in (map (fn prop => Goal.prove_sorry lthy [v] [] prop tac) eqs, lthy) end; |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
154 |
in |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
155 |
lthy |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
156 |
|> random_aux_primrec aux_eq' |
33766
c679f05600cd
adapted Local_Theory.define -- eliminated odd thm kind;
wenzelm
parents:
33671
diff
changeset
|
157 |
||>> fold_map Local_Theory.define proj_defs |
58229 | 158 |
|-> uncurry prove_eqs |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
159 |
end; |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
160 |
|
31868 | 161 |
fun random_aux_specification prfx name eqs lthy = |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
162 |
let |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
163 |
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
|
164 |
o HOLogic.dest_Trueprop o hd) eqs) []; |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
165 |
fun mk_proto_eq eq = |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
166 |
let |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
167 |
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
|
168 |
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
|
169 |
val proto_eqs = map mk_proto_eq eqs; |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
170 |
fun prove_simps proto_simps lthy = |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
171 |
let |
31625 | 172 |
val ext_simps = map (fn thm => fun_cong OF [fun_cong OF [thm]]) proto_simps; |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
51717
diff
changeset
|
173 |
val tac = ALLGOALS (Proof_Context.fact_tac lthy ext_simps); |
51551 | 174 |
in (map (fn prop => Goal.prove_sorry lthy vs [] prop (K tac)) eqs, lthy) end; |
59859 | 175 |
val b = Binding.concealed (Binding.qualify true prfx |
33205 | 176 |
(Binding.qualify true name (Binding.name "simps"))); |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
177 |
in |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
178 |
lthy |
31868 | 179 |
|> random_aux_primrec_multi (name ^ prfx) proto_eqs |
58229 | 180 |
|-> prove_simps |
33671 | 181 |
|-> (fn simps => Local_Theory.note |
63239
d562c9948dee
explicit tagging of code equations de-baroquifies interface
haftmann
parents:
63180
diff
changeset
|
182 |
((b, Code.add_default_eqn_attrib Code.Equation:: @{attributes [simp, nitpick_simp]}), simps)) |
31485
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
183 |
|> snd |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
184 |
end |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
185 |
|
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
186 |
|
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
187 |
(* constructing random instances on datatypes *) |
259a3c90016e
added infrastructure for definitorial construction of generators for datatypes
haftmann
parents:
31260
diff
changeset
|
188 |
|
31868 | 189 |
val random_auxN = "random_aux"; |
190 |
||
50046 | 191 |
fun mk_random_aux_eqs thy descr vs (names, auxnames) (Ts, Us) = |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
192 |
let |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
193 |
val mk_const = curry (Sign.mk_const thy); |
31603
fa30cd74d7d6
revised interpretation combinator for datatype constructions
haftmann
parents:
31595
diff
changeset
|
194 |
val random_auxsN = map (prefix (random_auxN ^ "_")) (names @ auxnames); |
fa30cd74d7d6
revised interpretation combinator for datatype constructions
haftmann
parents:
31595
diff
changeset
|
195 |
val rTs = Ts @ Us; |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
196 |
fun random_resultT T = @{typ Random.seed} |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
197 |
--> HOLogic.mk_prodT (termifyT T,@{typ Random.seed}); |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
198 |
fun sizeT T = @{typ natural} --> @{typ natural} --> T; |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
199 |
val random_auxT = sizeT o random_resultT; |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
200 |
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
|
201 |
random_auxsN rTs; |
31950 | 202 |
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
|
203 |
fun mk_random_aux_call fTs (k, _) (tyco, Ts) = |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
204 |
let |
31623
b72c11302b39
quickcheck generators for datatypes with functions
haftmann
parents:
31611
diff
changeset
|
205 |
val T = Type (tyco, Ts); |
b72c11302b39
quickcheck generators for datatypes with functions
haftmann
parents:
31611
diff
changeset
|
206 |
fun mk_random_fun_lift [] t = t |
b72c11302b39
quickcheck generators for datatypes with functions
haftmann
parents:
31611
diff
changeset
|
207 |
| mk_random_fun_lift (fT :: fTs) t = |
b72c11302b39
quickcheck generators for datatypes with functions
haftmann
parents:
31611
diff
changeset
|
208 |
mk_const @{const_name random_fun_lift} [fTs ---> T, fT] $ |
b72c11302b39
quickcheck generators for datatypes with functions
haftmann
parents:
31611
diff
changeset
|
209 |
mk_random_fun_lift fTs t; |
31984 | 210 |
val t = mk_random_fun_lift fTs (nth random_auxs k $ size_pred $ size'); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
55757
diff
changeset
|
211 |
val size = Option.map snd (Old_Datatype_Aux.find_shortest_path descr k) |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
212 |
|> the_default 0; |
31623
b72c11302b39
quickcheck generators for datatypes with functions
haftmann
parents:
31611
diff
changeset
|
213 |
in (SOME size, (t, fTs ---> T)) end; |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
55757
diff
changeset
|
214 |
val tss = Old_Datatype_Aux.interpret_construction descr vs |
31603
fa30cd74d7d6
revised interpretation combinator for datatype constructions
haftmann
parents:
31595
diff
changeset
|
215 |
{ atyp = mk_random_call, dtyp = mk_random_aux_call }; |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
216 |
fun mk_consexpr simpleT (c, xs) = |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
217 |
let |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
218 |
val (ks, simple_tTs) = split_list xs; |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
219 |
val T = termifyT simpleT; |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
220 |
val tTs = (map o apsnd) termifyT simple_tTs; |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
221 |
val is_rec = exists is_some ks; |
33029 | 222 |
val k = fold (fn NONE => I | SOME k => Integer.max k) ks 0; |
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
42361
diff
changeset
|
223 |
val vs = Name.invent_names Name.context "x" (map snd simple_tTs); |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
224 |
val tc = HOLogic.mk_return T @{typ Random.seed} |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
225 |
(HOLogic.mk_valtermify_app c vs simpleT); |
38543 | 226 |
val t = HOLogic.mk_ST |
227 |
(map2 (fn (t, _) => fn (v, T') => ((t, @{typ Random.seed}), SOME ((v, termifyT T')))) tTs vs) |
|
228 |
tc @{typ Random.seed} (SOME T, @{typ Random.seed}); |
|
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
229 |
val tk = if is_rec |
31950 | 230 |
then if k = 0 then size |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
231 |
else @{term "Quickcheck_Random.beyond :: natural \<Rightarrow> natural \<Rightarrow> natural"} |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
232 |
$ HOLogic.mk_number @{typ natural} k $ size |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
233 |
else @{term "1::natural"} |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
234 |
in (is_rec, HOLogic.mk_prod (tk, t)) end; |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
235 |
fun sort_rec xs = |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
236 |
map_filter (fn (true, t) => SOME t | _ => NONE) xs |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
237 |
@ map_filter (fn (false, t) => SOME t | _ => NONE) xs; |
31603
fa30cd74d7d6
revised interpretation combinator for datatype constructions
haftmann
parents:
31595
diff
changeset
|
238 |
val gen_exprss = tss |
fa30cd74d7d6
revised interpretation combinator for datatype constructions
haftmann
parents:
31595
diff
changeset
|
239 |
|> (map o apfst) Type |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
240 |
|> 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
|
241 |
fun mk_select (rT, xs) = |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50818
diff
changeset
|
242 |
mk_const @{const_name Quickcheck_Random.collapse} [@{typ Random.seed}, termifyT rT] |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
243 |
$ (mk_const @{const_name Random.select_weight} [random_resultT rT] |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
244 |
$ HOLogic.mk_list (HOLogic.mk_prodT (@{typ natural}, random_resultT rT)) xs) |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
245 |
$ seed; |
31950 | 246 |
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
|
247 |
val auxs_rhss = map mk_select gen_exprss; |
31868 | 248 |
in (random_auxs, auxs_lhss ~~ auxs_rhss) end; |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
249 |
|
38543 | 250 |
fun instantiate_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
|
251 |
let |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
55757
diff
changeset
|
252 |
val _ = Old_Datatype_Aux.message config "Creating quickcheck generators ..."; |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
253 |
val mk_prop_eq = HOLogic.mk_Trueprop o HOLogic.mk_eq; |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
55757
diff
changeset
|
254 |
fun mk_size_arg k = case Old_Datatype_Aux.find_shortest_path descr k |
31950 | 255 |
of SOME (_, l) => if l = 0 then size |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
256 |
else @{term "max :: natural \<Rightarrow> natural \<Rightarrow> natural"} |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
257 |
$ HOLogic.mk_number @{typ natural} l $ size |
31950 | 258 |
| NONE => size; |
31868 | 259 |
val (random_auxs, auxs_eqs) = (apsnd o map) mk_prop_eq |
50046 | 260 |
(mk_random_aux_eqs thy descr vs (names, auxnames) (Ts, Us)); |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
261 |
val random_defs = map_index (fn (k, T) => mk_prop_eq |
31950 | 262 |
(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
|
263 |
in |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
264 |
thy |
38348
cf7b2121ad9d
moved instantiation target formally to class_target.ML
haftmann
parents:
37744
diff
changeset
|
265 |
|> Class.instantiation (tycos, vs, @{sort random}) |
31868 | 266 |
|> random_aux_specification prfx random_auxN auxs_eqs |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
267 |
|> `(fn lthy => map (Syntax.check_term lthy) random_defs) |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
268 |
|-> (fn random_defs' => fold_map (fn random_def => |
63180 | 269 |
Specification.definition NONE [] [] |
63064
2f18172214c8
support 'assumes' in specifications, e.g. 'definition', 'inductive';
wenzelm
parents:
62979
diff
changeset
|
270 |
((Binding.concealed Binding.empty, []), random_def)) random_defs') |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
271 |
|> snd |
59498
50b60f501b05
proper context for resolve_tac, eresolve_tac, dresolve_tac, forward_tac etc.;
wenzelm
parents:
59154
diff
changeset
|
272 |
|> Class.prove_instantiation_exit (fn ctxt => Class.intro_classes_tac ctxt []) |
31595
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
273 |
end; |
bd2f7211a420
first running version of qc generators for datatypes
haftmann
parents:
31485
diff
changeset
|
274 |
|
59154 | 275 |
|
31950 | 276 |
(** building and compiling generator expressions **) |
277 |
||
59154 | 278 |
structure Data = Proof_Data |
41472
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
40911
diff
changeset
|
279 |
( |
59154 | 280 |
type T = |
281 |
(unit -> Code_Numeral.natural -> bool -> Code_Numeral.natural -> seed -> |
|
282 |
(bool * term list) option * seed) * |
|
283 |
(unit -> Code_Numeral.natural -> bool -> Code_Numeral.natural -> seed -> |
|
284 |
((bool * term list) option * (bool list * bool)) * seed); |
|
285 |
val empty: T = |
|
286 |
(fn () => raise Fail "counterexample", |
|
287 |
fn () => raise Fail "counterexample_report"); |
|
288 |
fun init _ = empty; |
|
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value -- using context data instead of bare metal references
haftmann
parents:
39253
diff
changeset
|
289 |
); |
31950 | 290 |
|
59154 | 291 |
val get_counterexample = #1 o Data.get; |
292 |
val get_counterexample_report = #2 o Data.get; |
|
293 |
||
294 |
val put_counterexample = Data.map o @{apply 2(1)} o K; |
|
295 |
val put_counterexample_report = Data.map o @{apply 2(2)} o K; |
|
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
296 |
|
31950 | 297 |
val target = "Quickcheck"; |
298 |
||
50046 | 299 |
fun mk_generator_expr ctxt (t, _) = |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
300 |
let |
42361 | 301 |
val thy = Proof_Context.theory_of ctxt |
44241 | 302 |
val prop = fold_rev absfree (Term.add_frees t []) t |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
303 |
val Ts = (map snd o fst o strip_abs) prop |
31950 | 304 |
val bound_max = length Ts - 1; |
305 |
val bounds = map_index (fn (i, ty) => |
|
306 |
(2 * (bound_max - i) + 1, 2 * (bound_max - i), 2 * i, ty)) Ts; |
|
307 |
val result = list_comb (prop, map (fn (i, _, _, _) => Bound i) bounds); |
|
308 |
val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds); |
|
50046 | 309 |
val ([genuine_only_name], _) = Variable.variant_fixes ["genuine_only"] ctxt |
45754
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
310 |
val genuine_only = Free (genuine_only_name, @{typ bool}) |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
311 |
val none_t = Const (@{const_name "None"}, resultT) |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
312 |
val check = Quickcheck_Common.mk_safe_if genuine_only none_t (result, none_t, |
45721
d1fb55c2ed65
quickcheck's compilation returns if it is genuine counterexample or a counterexample due to a match exception
bulwahn
parents:
45719
diff
changeset
|
313 |
fn genuine => @{term "Some :: bool * term list => (bool * term list) option"} $ |
d1fb55c2ed65
quickcheck's compilation returns if it is genuine counterexample or a counterexample due to a match exception
bulwahn
parents:
45719
diff
changeset
|
314 |
HOLogic.mk_prod (Quickcheck_Common.reflect_bool genuine, terms)) |
45723
75691bcc2c0f
quickcheck-random compilation also indicates if the counterexample is potentially spurious or not
bulwahn
parents:
45721
diff
changeset
|
315 |
val return = HOLogic.pair_const resultT @{typ Random.seed}; |
31950 | 316 |
fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT); |
317 |
fun mk_termtyp T = HOLogic.mk_prodT (T, @{typ "unit => term"}); |
|
318 |
fun mk_scomp T1 T2 sT f g = Const (@{const_name scomp}, |
|
319 |
liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g; |
|
61424
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61125
diff
changeset
|
320 |
fun mk_case_prod T = Sign.mk_const thy |
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61125
diff
changeset
|
321 |
(@{const_name case_prod}, [T, @{typ "unit => term"}, liftT resultT @{typ Random.seed}]); |
31950 | 322 |
fun mk_scomp_split T t t' = |
45723
75691bcc2c0f
quickcheck-random compilation also indicates if the counterexample is potentially spurious or not
bulwahn
parents:
45721
diff
changeset
|
323 |
mk_scomp (mk_termtyp T) resultT @{typ Random.seed} t |
61424
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61125
diff
changeset
|
324 |
(mk_case_prod T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t'))); |
31950 | 325 |
fun mk_bindclause (_, _, i, T) = mk_scomp_split T |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50818
diff
changeset
|
326 |
(Sign.mk_const thy (@{const_name Quickcheck_Random.random}, [T]) $ Bound i); |
45754
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
327 |
in |
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
328 |
lambda genuine_only |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
329 |
(Abs ("n", @{typ natural}, fold_rev mk_bindclause bounds (return $ check true))) |
45754
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
330 |
end; |
31950 | 331 |
|
50046 | 332 |
fun mk_reporting_generator_expr ctxt (t, _) = |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
333 |
let |
42361 | 334 |
val thy = Proof_Context.theory_of ctxt |
45762
daf57640d4df
the reporting random testing also returns if the counterexample is genuine or potentially spurious
bulwahn
parents:
45761
diff
changeset
|
335 |
val resultT = @{typ "(bool * term list) option * (bool list * bool)"} |
44241 | 336 |
val prop = fold_rev absfree (Term.add_frees t []) t |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
337 |
val Ts = (map snd o fst o strip_abs) prop |
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
338 |
val bound_max = length Ts - 1 |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
339 |
val bounds = map_index (fn (i, ty) => |
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
340 |
(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
|
341 |
val prop' = betapplys (prop, map (fn (i, _, _, _) => Bound i) bounds); |
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
342 |
val terms = HOLogic.mk_list @{typ term} (map (fn (_, i, _, _) => Bound i $ @{term "()"}) bounds) |
42195
1e7b62c93f5d
adding an exhaustive validator for quickcheck's batch validating; moving strip_imp; minimal setup for bounded_forall
bulwahn
parents:
42159
diff
changeset
|
343 |
val (assms, concl) = Quickcheck_Common.strip_imp prop' |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50818
diff
changeset
|
344 |
val return = HOLogic.pair_const resultT @{typ Random.seed}; |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
345 |
fun mk_assms_report i = |
45762
daf57640d4df
the reporting random testing also returns if the counterexample is genuine or potentially spurious
bulwahn
parents:
45761
diff
changeset
|
346 |
HOLogic.mk_prod (@{term "None :: (bool * term list) option"}, |
38553
56965d8e4e11
use HOLogic.boolT and @{typ bool} more pervasively
haftmann
parents:
38549
diff
changeset
|
347 |
HOLogic.mk_prod (HOLogic.mk_list HOLogic.boolT |
56965d8e4e11
use HOLogic.boolT and @{typ bool} more pervasively
haftmann
parents:
38549
diff
changeset
|
348 |
(replicate i @{term True} @ replicate (length assms - i) @{term False}), |
56965d8e4e11
use HOLogic.boolT and @{typ bool} more pervasively
haftmann
parents:
38549
diff
changeset
|
349 |
@{term False})) |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
350 |
fun mk_concl_report b = |
38553
56965d8e4e11
use HOLogic.boolT and @{typ bool} more pervasively
haftmann
parents:
38549
diff
changeset
|
351 |
HOLogic.mk_prod (HOLogic.mk_list HOLogic.boolT (replicate (length assms) @{term True}), |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
352 |
Quickcheck_Common.reflect_bool b) |
50046 | 353 |
val ([genuine_only_name], _) = Variable.variant_fixes ["genuine_only"] ctxt |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
354 |
val genuine_only = Free (genuine_only_name, @{typ bool}) |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
355 |
val none_t = HOLogic.mk_prod (@{term "None :: (bool * term list) option"}, mk_concl_report true) |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
356 |
val concl_check = Quickcheck_Common.mk_safe_if genuine_only none_t (concl, none_t, |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
357 |
fn genuine => HOLogic.mk_prod (@{term "Some :: bool * term list => (bool * term list) option"} $ |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
358 |
HOLogic.mk_prod (Quickcheck_Common.reflect_bool genuine, terms), mk_concl_report false)) |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
359 |
val check = fold_rev (fn (i, assm) => fn t => Quickcheck_Common.mk_safe_if genuine_only |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
360 |
(mk_assms_report i) (HOLogic.mk_not assm, mk_assms_report i, t)) |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
361 |
(map_index I assms) concl_check |
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
362 |
fun liftT T sT = sT --> HOLogic.mk_prodT (T, sT); |
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
363 |
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
|
364 |
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
|
365 |
liftT T1 sT --> (T1 --> liftT T2 sT) --> liftT T2 sT) $ f $ g; |
61424
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61125
diff
changeset
|
366 |
fun mk_case_prod T = Sign.mk_const thy |
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61125
diff
changeset
|
367 |
(@{const_name case_prod}, [T, @{typ "unit => term"}, liftT resultT @{typ Random.seed}]); |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
368 |
fun mk_scomp_split T t t' = |
45762
daf57640d4df
the reporting random testing also returns if the counterexample is genuine or potentially spurious
bulwahn
parents:
45761
diff
changeset
|
369 |
mk_scomp (mk_termtyp T) resultT @{typ Random.seed} t |
61424
c3658c18b7bc
prod_case as canonical name for product type eliminator
haftmann
parents:
61125
diff
changeset
|
370 |
(mk_case_prod T $ Abs ("", T, Abs ("", @{typ "unit => term"}, t'))); |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
371 |
fun mk_bindclause (_, _, i, T) = mk_scomp_split T |
51126
df86080de4cb
reform of predicate compiler / quickcheck theories:
haftmann
parents:
50818
diff
changeset
|
372 |
(Sign.mk_const thy (@{const_name Quickcheck_Random.random}, [T]) $ Bound i); |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
373 |
in |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
374 |
lambda genuine_only |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
375 |
(Abs ("n", @{typ natural}, fold_rev mk_bindclause bounds (return $ check true))) |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
376 |
end |
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
377 |
|
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
378 |
val mk_parametric_generator_expr = Quickcheck_Common.gen_mk_parametric_generator_expr |
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
379 |
((mk_generator_expr, |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
380 |
absdummy @{typ bool} (absdummy @{typ natural} |
45759 | 381 |
@{term "Pair None :: Random.seed => (bool * term list) option * Random.seed"})), |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
382 |
@{typ "bool => natural => Random.seed => (bool * term list) option * Random.seed"}) |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
383 |
|
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
384 |
val mk_parametric_reporting_generator_expr = Quickcheck_Common.gen_mk_parametric_generator_expr |
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
385 |
((mk_reporting_generator_expr, |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
386 |
absdummy @{typ bool} (absdummy @{typ natural} |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
387 |
@{term "Pair (None, ([], False)) :: Random.seed => |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
388 |
((bool * term list) option * (bool list * bool)) * Random.seed"})), |
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
389 |
@{typ "bool => natural => Random.seed => ((bool * term list) option * (bool list * bool)) * Random.seed"}) |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
390 |
|
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
391 |
|
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
392 |
(* single quickcheck report *) |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
393 |
|
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
394 |
datatype single_report = Run of bool list * bool | MatchExc |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
395 |
|
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
396 |
fun collect_single_report single_report |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
397 |
(Quickcheck.Report {iterations = iterations, raised_match_errors = raised_match_errors, |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
398 |
satisfied_assms = satisfied_assms, positive_concl_tests = positive_concl_tests}) = |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
399 |
case single_report |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
400 |
of MatchExc => |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
401 |
Quickcheck.Report {iterations = iterations + 1, raised_match_errors = raised_match_errors + 1, |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
402 |
satisfied_assms = satisfied_assms, positive_concl_tests = positive_concl_tests} |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
403 |
| Run (assms, concl) => |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
404 |
Quickcheck.Report {iterations = iterations + 1, raised_match_errors = raised_match_errors, |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
405 |
satisfied_assms = |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
406 |
map2 (fn b => fn s => if b then s + 1 else s) assms |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
407 |
(if null satisfied_assms then replicate (length assms) 0 else satisfied_assms), |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
408 |
positive_concl_tests = if concl then positive_concl_tests + 1 else positive_concl_tests} |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
409 |
|
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
410 |
val empty_report = Quickcheck.Report { iterations = 0, raised_match_errors = 0, |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
411 |
satisfied_assms = [], positive_concl_tests = 0 } |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
412 |
|
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
413 |
fun compile_generator_expr_raw ctxt ts = |
31950 | 414 |
let |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
415 |
val iterations = Config.get ctxt Quickcheck.iterations |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
416 |
in |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
417 |
if Config.get ctxt Quickcheck.report then |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
418 |
let |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
419 |
val t' = mk_parametric_reporting_generator_expr ctxt ts; |
59154 | 420 |
val compile = |
421 |
Code_Runtime.dynamic_value_strict |
|
422 |
(get_counterexample_report, put_counterexample_report, |
|
423 |
"Random_Generators.put_counterexample_report") |
|
424 |
ctxt (SOME target) |
|
425 |
(fn proc => fn g => fn c => fn b => fn s => |
|
426 |
g c b s #>> (apfst o Option.map o apsnd o map) proc) |
|
427 |
t' []; |
|
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
428 |
fun single_tester c b s = compile c b s |> Random_Engine.run |
50046 | 429 |
fun iterate_and_collect _ _ 0 report = (NONE, report) |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
430 |
| iterate_and_collect genuine_only (card, size) j report = |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
431 |
let |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
432 |
val (test_result, single_report) = apsnd Run (single_tester card genuine_only size) |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
433 |
val report = collect_single_report single_report report |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
434 |
in |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
435 |
case test_result of NONE => iterate_and_collect genuine_only (card, size) (j - 1) report |
45762
daf57640d4df
the reporting random testing also returns if the counterexample is genuine or potentially spurious
bulwahn
parents:
45761
diff
changeset
|
436 |
| SOME q => (SOME q, report) |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
437 |
end |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
438 |
in |
45763
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
439 |
fn genuine_only => fn [card, size] => |
3bb2bdf654f7
random reporting compilation returns if counterexample is genuine or potentially spurious, and takes genuine_only option as argument
bulwahn
parents:
45762
diff
changeset
|
440 |
apsnd SOME (iterate_and_collect genuine_only (card, size) iterations empty_report) |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
441 |
end |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
442 |
else |
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
443 |
let |
42159
234ec7011e5d
generalizing compilation scheme of quickcheck generators to multiple arguments; changing random and exhaustive tester to use one code invocation for polymorphic instances with multiple cardinalities
bulwahn
parents:
42028
diff
changeset
|
444 |
val t' = mk_parametric_generator_expr ctxt ts; |
59154 | 445 |
val compile = |
446 |
Code_Runtime.dynamic_value_strict |
|
447 |
(get_counterexample, put_counterexample, "Random_Generators.put_counterexample") |
|
448 |
ctxt (SOME target) |
|
449 |
(fn proc => fn g => fn c => fn b => fn s => |
|
450 |
g c b s #>> (Option.map o apsnd o map) proc) |
|
451 |
t' []; |
|
45754
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
452 |
fun single_tester c b s = compile c b s |> Random_Engine.run |
50046 | 453 |
fun iterate _ _ 0 = NONE |
45754
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
454 |
| iterate genuine_only (card, size) j = |
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
455 |
case single_tester card genuine_only size of |
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
456 |
NONE => iterate genuine_only (card, size) (j - 1) |
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
457 |
| SOME q => SOME q |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
458 |
in |
45754
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
459 |
fn genuine_only => fn [card, size] => |
394ecd91434a
dynamic genuine_flag in compilation of random and exhaustive
bulwahn
parents:
45728
diff
changeset
|
460 |
(rpair NONE (iterate genuine_only (card, size) iterations)) |
40911
7febf76e0a69
moving iteration of tests to the testers in quickcheck
bulwahn
parents:
40644
diff
changeset
|
461 |
end |
35378
95d0e3adf38e
added basic reporting of test cases to quickcheck
bulwahn
parents:
35166
diff
changeset
|
462 |
end; |
31950 | 463 |
|
51143
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
464 |
fun compile_generator_expr ctxt ts = |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
465 |
let |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
466 |
val compiled = compile_generator_expr_raw ctxt ts |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
467 |
in fn genuine_only => fn [card, size] => |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
468 |
compiled genuine_only [Code_Numeral.natural_of_integer card, Code_Numeral.natural_of_integer size] |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
469 |
end; |
0a2371e7ced3
two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann
parents:
51126
diff
changeset
|
470 |
|
50818 | 471 |
val size_types = [@{type_name Enum.finite_1}, @{type_name Enum.finite_2}, |
472 |
@{type_name Enum.finite_3}, @{type_name Enum.finite_4}, @{type_name Enum.finite_5}]; |
|
473 |
||
474 |
fun size_matters_for _ Ts = |
|
475 |
not (forall (fn Type (tyco, []) => member (op =) size_types tyco | _ => false) Ts); |
|
46331
f5598b604a54
generalizing check if size matters because it is different for random and exhaustive testing
bulwahn
parents:
45940
diff
changeset
|
476 |
|
f5598b604a54
generalizing check if size matters because it is different for random and exhaustive testing
bulwahn
parents:
45940
diff
changeset
|
477 |
val test_goals = |
f5598b604a54
generalizing check if size matters because it is different for random and exhaustive testing
bulwahn
parents:
45940
diff
changeset
|
478 |
Quickcheck_Common.generator_test_goal_terms ("random", (size_matters_for, compile_generator_expr)); |
62979 | 479 |
|
43875
485d2ad43528
adding random, exhaustive and SML quickcheck as testers
bulwahn
parents:
43333
diff
changeset
|
480 |
|
31260 | 481 |
(** setup **) |
482 |
||
43878
eeb10fdd9535
changed every tester to have a configuration in quickcheck; enabling parallel testing of different testers in quickcheck
bulwahn
parents:
43877
diff
changeset
|
483 |
val active = Attrib.setup_config_bool @{binding quickcheck_random_active} (K false); |
eeb10fdd9535
changed every tester to have a configuration in quickcheck; enabling parallel testing of different testers in quickcheck
bulwahn
parents:
43877
diff
changeset
|
484 |
|
58826 | 485 |
val _ = |
486 |
Theory.setup |
|
487 |
(Quickcheck_Common.datatype_interpretation @{plugin quickcheck_random} |
|
488 |
(@{sort random}, instantiate_random_datatype) #> |
|
489 |
Context.theory_map (Quickcheck.add_tester ("random", (active, test_goals)))); |
|
31260 | 490 |
|
491 |
end; |