src/HOL/Quickcheck_Exhaustive.thy
author bulwahn
Fri Jan 20 09:28:50 2012 +0100 (2012-01-20)
changeset 46305 8ea02e499d53
parent 46193 55a4769d0abe
child 46307 ec8f975c059b
permissions -rw-r--r--
adding check_all instance for sets; tuned
bulwahn@40420
     1
(* Author: Lukas Bulwahn, TU Muenchen *)
bulwahn@40420
     2
bulwahn@41916
     3
header {* A simple counterexample generator performing exhaustive testing *}
bulwahn@40420
     4
bulwahn@41918
     5
theory Quickcheck_Exhaustive
bulwahn@40420
     6
imports Quickcheck
bulwahn@45925
     7
uses
bulwahn@45925
     8
  ("Tools/Quickcheck/exhaustive_generators.ML")
bulwahn@45925
     9
  ("Tools/Quickcheck/abstract_generators.ML")
bulwahn@40420
    10
begin
bulwahn@40420
    11
bulwahn@41916
    12
subsection {* basic operations for exhaustive generators *}
bulwahn@41105
    13
bulwahn@41105
    14
definition orelse :: "'a option => 'a option => 'a option" (infixr "orelse" 55)
bulwahn@41105
    15
where
bulwahn@41105
    16
  [code_unfold]: "x orelse y = (case x of Some x' => Some x' | None => y)"
bulwahn@40420
    17
bulwahn@41916
    18
subsection {* exhaustive generator type classes *}
bulwahn@40420
    19
bulwahn@41916
    20
class exhaustive = term_of +
bulwahn@45724
    21
  fixes exhaustive :: "('a \<Rightarrow> (bool * term list) option) \<Rightarrow> code_numeral \<Rightarrow> (bool * term list) option"
bulwahn@42310
    22
  
bulwahn@42310
    23
class full_exhaustive = term_of +
bulwahn@45722
    24
  fixes full_exhaustive :: "('a * (unit => term) \<Rightarrow> (bool * term list) option) \<Rightarrow> code_numeral \<Rightarrow> (bool * term list) option"
bulwahn@40420
    25
bulwahn@42310
    26
instantiation code_numeral :: full_exhaustive
bulwahn@40639
    27
begin
bulwahn@40639
    28
bulwahn@45722
    29
function full_exhaustive_code_numeral' :: "(code_numeral * (unit => term) => (bool * term list) option) => code_numeral => code_numeral => (bool * term list) option"
bulwahn@42304
    30
  where "full_exhaustive_code_numeral' f d i =
bulwahn@42304
    31
    (if d < i then None
bulwahn@42304
    32
    else (f (i, %_. Code_Evaluation.term_of i)) orelse (full_exhaustive_code_numeral' f d (i + 1)))"
bulwahn@42304
    33
by pat_completeness auto
bulwahn@42304
    34
bulwahn@42304
    35
termination
bulwahn@42304
    36
  by (relation "measure (%(_, d, i). Code_Numeral.nat_of (d + 1 - i))") auto
bulwahn@42304
    37
bulwahn@42304
    38
definition "full_exhaustive f d = full_exhaustive_code_numeral' f d 0"
bulwahn@42304
    39
bulwahn@42310
    40
instance ..
bulwahn@42310
    41
bulwahn@42310
    42
end
bulwahn@42310
    43
bulwahn@42310
    44
instantiation code_numeral :: exhaustive
bulwahn@42310
    45
begin
bulwahn@42310
    46
bulwahn@45724
    47
function exhaustive_code_numeral' :: "(code_numeral => (bool * term list) option) => code_numeral => code_numeral => (bool * term list) option"
bulwahn@41916
    48
  where "exhaustive_code_numeral' f d i =
bulwahn@41916
    49
    (if d < i then None
bulwahn@42304
    50
    else (f i orelse exhaustive_code_numeral' f d (i + 1)))"
bulwahn@41231
    51
by pat_completeness auto
bulwahn@41231
    52
bulwahn@42304
    53
termination
bulwahn@41231
    54
  by (relation "measure (%(_, d, i). Code_Numeral.nat_of (d + 1 - i))") auto
bulwahn@41231
    55
bulwahn@41916
    56
definition "exhaustive f d = exhaustive_code_numeral' f d 0"
bulwahn@41231
    57
bulwahn@41231
    58
instance ..
bulwahn@41231
    59
bulwahn@41231
    60
end
bulwahn@41231
    61
bulwahn@41916
    62
instantiation nat :: exhaustive
bulwahn@41231
    63
begin
bulwahn@41231
    64
bulwahn@42304
    65
definition "exhaustive f d = exhaustive (%x. f (Code_Numeral.nat_of x)) d"
bulwahn@42304
    66
bulwahn@42310
    67
instance ..
bulwahn@42310
    68
bulwahn@42310
    69
end
bulwahn@42310
    70
bulwahn@42310
    71
instantiation nat :: full_exhaustive
bulwahn@42310
    72
begin
bulwahn@42310
    73
bulwahn@42304
    74
definition "full_exhaustive f d = full_exhaustive (%(x, xt). f (Code_Numeral.nat_of x, %_. Code_Evaluation.term_of (Code_Numeral.nat_of x))) d"
bulwahn@41231
    75
bulwahn@41231
    76
instance ..
bulwahn@41231
    77
bulwahn@41231
    78
end
bulwahn@41231
    79
bulwahn@41916
    80
instantiation int :: exhaustive
bulwahn@40639
    81
begin
bulwahn@40639
    82
bulwahn@45724
    83
function exhaustive' :: "(int => (bool * term list) option) => int => int => (bool * term list) option"
bulwahn@42304
    84
  where "exhaustive' f d i = (if d < i then None else (f i orelse exhaustive' f d (i + 1)))"
bulwahn@40639
    85
by pat_completeness auto
bulwahn@40639
    86
bulwahn@40639
    87
termination 
bulwahn@40639
    88
  by (relation "measure (%(_, d, i). nat (d + 1 - i))") auto
bulwahn@40639
    89
bulwahn@41916
    90
definition "exhaustive f d = exhaustive' f (Code_Numeral.int_of d) (- (Code_Numeral.int_of d))"
bulwahn@40639
    91
bulwahn@42310
    92
instance ..
bulwahn@42310
    93
bulwahn@42310
    94
end
bulwahn@42310
    95
bulwahn@42310
    96
instantiation int :: full_exhaustive
bulwahn@42310
    97
begin
bulwahn@42310
    98
bulwahn@45722
    99
function full_exhaustive' :: "(int * (unit => term) => (bool * term list) option) => int => int => (bool * term list) option"
bulwahn@42304
   100
  where "full_exhaustive' f d i = (if d < i then None else (case f (i, %_. Code_Evaluation.term_of i) of Some t => Some t | None => full_exhaustive' f d (i + 1)))"
bulwahn@42304
   101
by pat_completeness auto
bulwahn@42304
   102
bulwahn@42304
   103
termination 
bulwahn@42304
   104
  by (relation "measure (%(_, d, i). nat (d + 1 - i))") auto
bulwahn@42304
   105
bulwahn@42304
   106
definition "full_exhaustive f d = full_exhaustive' f (Code_Numeral.int_of d) (- (Code_Numeral.int_of d))"
bulwahn@42304
   107
bulwahn@40639
   108
instance ..
bulwahn@40639
   109
bulwahn@40639
   110
end
bulwahn@40639
   111
bulwahn@41916
   112
instantiation prod :: (exhaustive, exhaustive) exhaustive
bulwahn@40639
   113
begin
bulwahn@40899
   114
bulwahn@40639
   115
definition
bulwahn@42304
   116
  "exhaustive f d = exhaustive (%x. exhaustive (%y. f ((x, y))) d) d"
bulwahn@42304
   117
bulwahn@42310
   118
instance ..
bulwahn@42310
   119
bulwahn@42310
   120
end
bulwahn@42310
   121
bulwahn@42310
   122
instantiation prod :: (full_exhaustive, full_exhaustive) full_exhaustive
bulwahn@42310
   123
begin
bulwahn@42310
   124
bulwahn@42304
   125
definition
bulwahn@42304
   126
  "full_exhaustive f d = full_exhaustive (%(x, t1). full_exhaustive (%(y, t2). f ((x, y),
bulwahn@41719
   127
    %u. let T1 = (Typerep.typerep (TYPE('a)));
bulwahn@41719
   128
            T2 = (Typerep.typerep (TYPE('b)))
bulwahn@41719
   129
    in Code_Evaluation.App (Code_Evaluation.App (
bulwahn@41719
   130
      Code_Evaluation.Const (STR ''Product_Type.Pair'') 
bulwahn@41719
   131
      (Typerep.Typerep (STR ''fun'') [T1, Typerep.Typerep (STR ''fun'') [T2, Typerep.Typerep (STR ''Product_Type.prod'') [T1, T2]]]))
bulwahn@41719
   132
      (t1 ())) (t2 ()))) d) d"
bulwahn@40639
   133
bulwahn@40639
   134
instance ..
bulwahn@40639
   135
bulwahn@40639
   136
end
bulwahn@40639
   137
bulwahn@46193
   138
instantiation set :: (exhaustive) exhaustive
bulwahn@46193
   139
begin
bulwahn@46193
   140
bulwahn@46193
   141
fun exhaustive_set
bulwahn@46193
   142
where
bulwahn@46193
   143
  "exhaustive_set f i = (if i = 0 then None else (f {} orelse exhaustive_set (%A. f A orelse Quickcheck_Exhaustive.exhaustive (%x. if x \<in> A then None else f (insert x A)) (i - 1)) (i - 1)))"
bulwahn@46193
   144
bulwahn@46193
   145
instance ..
bulwahn@46193
   146
bulwahn@46193
   147
end
bulwahn@46193
   148
bulwahn@46305
   149
definition (in term_syntax) [code_unfold]: "valterm_emptyset = Code_Evaluation.valtermify ({} :: ('a :: typerep) set)"
bulwahn@46305
   150
definition (in term_syntax) [code_unfold]: "valtermify_insert x s = Code_Evaluation.valtermify insert {\<cdot>} (x :: ('a :: typerep * _)) {\<cdot>} s"
bulwahn@46193
   151
bulwahn@46193
   152
instantiation set :: (full_exhaustive) full_exhaustive
bulwahn@46193
   153
begin
bulwahn@46193
   154
bulwahn@46193
   155
fun full_exhaustive_set 
bulwahn@46193
   156
where
bulwahn@46193
   157
  "full_exhaustive_set f i = (if i = 0 then None else (f valterm_emptyset orelse full_exhaustive_set (%A. f A orelse Quickcheck_Exhaustive.full_exhaustive (%x. if fst x \<in> fst A then None else f (valtermify_insert x A)) (i - 1)) (i - 1)))"
bulwahn@46193
   158
bulwahn@46193
   159
instance ..
bulwahn@46193
   160
bulwahn@46193
   161
end
bulwahn@46193
   162
bulwahn@41916
   163
instantiation "fun" :: ("{equal, exhaustive}", exhaustive) exhaustive
bulwahn@40639
   164
begin
bulwahn@40639
   165
bulwahn@45724
   166
fun exhaustive_fun' :: "(('a => 'b) => (bool * term list) option) => code_numeral => code_numeral => (bool * term list) option"
bulwahn@42304
   167
where
bulwahn@42304
   168
  "exhaustive_fun' f i d = (exhaustive (%b. f (%_. b)) d)
bulwahn@42304
   169
   orelse (if i > 1 then
bulwahn@42304
   170
     exhaustive_fun' (%g. exhaustive (%a. exhaustive (%b.
bulwahn@42304
   171
       f (g(a := b))) d) d) (i - 1) d else None)"
bulwahn@42304
   172
bulwahn@45724
   173
definition exhaustive_fun :: "(('a => 'b) => (bool * term list) option) => code_numeral => (bool * term list) option"
bulwahn@40639
   174
where
bulwahn@42304
   175
  "exhaustive_fun f d = exhaustive_fun' f d d" 
bulwahn@42304
   176
bulwahn@42310
   177
instance ..
bulwahn@42310
   178
bulwahn@42310
   179
end
bulwahn@42310
   180
bulwahn@42310
   181
instantiation "fun" :: ("{equal, full_exhaustive}", full_exhaustive) full_exhaustive
bulwahn@42310
   182
begin
bulwahn@42304
   183
bulwahn@45722
   184
fun full_exhaustive_fun' :: "(('a => 'b) * (unit => term) => (bool * term list) option) => code_numeral => code_numeral => (bool * term list) option"
bulwahn@42304
   185
where
bulwahn@42304
   186
  "full_exhaustive_fun' f i d = (full_exhaustive (%(b, t). f (%_. b, %_. Code_Evaluation.Abs (STR ''x'') (Typerep.typerep TYPE('a)) (t ()))) d)
bulwahn@42117
   187
   orelse (if i > 1 then
bulwahn@42304
   188
     full_exhaustive_fun' (%(g, gt). full_exhaustive (%(a, at). full_exhaustive (%(b, bt).
bulwahn@42117
   189
       f (g(a := b),
bulwahn@42117
   190
         (%_. let A = (Typerep.typerep (TYPE('a)));
bulwahn@42117
   191
                  B = (Typerep.typerep (TYPE('b)));
bulwahn@42117
   192
                  fun = (%T U. Typerep.Typerep (STR ''fun'') [T, U])
bulwahn@42117
   193
              in
bulwahn@42117
   194
                Code_Evaluation.App (Code_Evaluation.App (Code_Evaluation.App
bulwahn@42117
   195
                  (Code_Evaluation.Const (STR ''Fun.fun_upd'') (fun (fun A B) (fun A (fun B (fun A B)))))
bulwahn@42117
   196
                (gt ())) (at ())) (bt ())))) d) d) (i - 1) d else None)"
bulwahn@40639
   197
bulwahn@45722
   198
definition full_exhaustive_fun :: "(('a => 'b) * (unit => term) => (bool * term list) option) => code_numeral => (bool * term list) option"
bulwahn@40639
   199
where
bulwahn@42304
   200
  "full_exhaustive_fun f d = full_exhaustive_fun' f d d" 
bulwahn@40639
   201
bulwahn@40639
   202
instance ..
bulwahn@40639
   203
bulwahn@40639
   204
end
bulwahn@40639
   205
bulwahn@41085
   206
subsubsection {* A smarter enumeration scheme for functions over finite datatypes *}
bulwahn@41085
   207
bulwahn@41085
   208
class check_all = enum + term_of +
bulwahn@45722
   209
  fixes check_all :: "('a * (unit \<Rightarrow> term) \<Rightarrow> (bool * term list) option) \<Rightarrow> (bool * term list) option"
bulwahn@41177
   210
  fixes enum_term_of :: "'a itself \<Rightarrow> unit \<Rightarrow> term list"
bulwahn@41177
   211
  
bulwahn@45722
   212
fun check_all_n_lists :: "(('a :: check_all) list * (unit \<Rightarrow> term list) \<Rightarrow> (bool * term list) option) \<Rightarrow> code_numeral \<Rightarrow> (bool * term list) option"
bulwahn@41085
   213
where
bulwahn@41085
   214
  "check_all_n_lists f n =
bulwahn@41085
   215
     (if n = 0 then f ([], (%_. [])) else check_all (%(x, xt). check_all_n_lists (%(xs, xst). f ((x # xs), (%_. (xt () # xst ())))) (n - 1)))"
bulwahn@41085
   216
bulwahn@41177
   217
definition mk_map_term :: " (unit \<Rightarrow> typerep) \<Rightarrow> (unit \<Rightarrow> typerep) \<Rightarrow> (unit \<Rightarrow> term list) \<Rightarrow> (unit \<Rightarrow> term list) \<Rightarrow> unit \<Rightarrow> term"
bulwahn@41085
   218
where
bulwahn@41177
   219
  "mk_map_term T1 T2 domm rng =
bulwahn@41177
   220
     (%_. let T1 = T1 ();
bulwahn@41085
   221
              T2 = T2 ();
bulwahn@41085
   222
              update_term = (%g (a, b).
bulwahn@41085
   223
                Code_Evaluation.App (Code_Evaluation.App (Code_Evaluation.App
bulwahn@41085
   224
                 (Code_Evaluation.Const (STR ''Fun.fun_upd'')
bulwahn@41085
   225
                   (Typerep.Typerep (STR ''fun'') [Typerep.Typerep (STR ''fun'') [T1, T2],
bulwahn@41177
   226
                      Typerep.Typerep (STR ''fun'') [T1,
bulwahn@41177
   227
                        Typerep.Typerep (STR ''fun'') [T2, Typerep.Typerep (STR ''fun'') [T1, T2]]]]))
bulwahn@41177
   228
                        g) a) b)
bulwahn@41085
   229
          in
bulwahn@41177
   230
             List.foldl update_term (Code_Evaluation.Abs (STR ''x'') T1 (Code_Evaluation.Const (STR ''HOL.undefined'') T2)) (zip (domm ()) (rng ())))"
bulwahn@41177
   231
bulwahn@41177
   232
instantiation "fun" :: ("{equal, check_all}", check_all) check_all
bulwahn@41177
   233
begin
bulwahn@41085
   234
bulwahn@41085
   235
definition
bulwahn@41177
   236
  "check_all f =
bulwahn@41177
   237
    (let
bulwahn@41177
   238
      mk_term = mk_map_term (%_. Typerep.typerep (TYPE('a))) (%_. Typerep.typerep (TYPE('b))) (enum_term_of (TYPE('a)));
bulwahn@41177
   239
      enum = (Enum.enum :: 'a list)
bulwahn@41177
   240
    in check_all_n_lists (\<lambda>(ys, yst). f (the o map_of (zip enum ys), mk_term yst)) (Code_Numeral.of_nat (length enum)))"
bulwahn@41085
   241
bulwahn@41177
   242
definition enum_term_of_fun :: "('a => 'b) itself => unit => term list"
bulwahn@41177
   243
where
bulwahn@41177
   244
  "enum_term_of_fun = (%_ _. let
bulwahn@41177
   245
    enum_term_of_a = enum_term_of (TYPE('a));
bulwahn@41177
   246
    mk_term = mk_map_term (%_. Typerep.typerep (TYPE('a))) (%_. Typerep.typerep (TYPE('b))) enum_term_of_a
bulwahn@41177
   247
  in map (%ys. mk_term (%_. ys) ()) (Enum.n_lists (length (enum_term_of_a ())) (enum_term_of (TYPE('b)) ())))"
bulwahn@41177
   248
 
bulwahn@41085
   249
instance ..
bulwahn@41085
   250
bulwahn@41085
   251
end
bulwahn@41085
   252
bulwahn@46305
   253
fun (in term_syntax) check_all_subsets :: "(('a :: typerep) set * (unit => term) => (bool * term list) option) => ('a * (unit => term)) list => (bool * term list) option"
bulwahn@46305
   254
where
bulwahn@46305
   255
  "check_all_subsets f [] = f valterm_emptyset"
bulwahn@46305
   256
| "check_all_subsets f (x # xs) = check_all_subsets (%s. case f s of Some ts => Some ts | None => f (valtermify_insert x s)) xs"
bulwahn@46305
   257
bulwahn@46305
   258
bulwahn@46305
   259
definition (in term_syntax) [code_unfold]: "term_emptyset = Code_Evaluation.termify ({} :: ('a :: typerep) set)"
bulwahn@46305
   260
definition (in term_syntax) [code_unfold]: "termify_insert x s = Code_Evaluation.termify (insert :: ('a::typerep) => 'a set => 'a set)  <\<cdot>> x <\<cdot>> s"
bulwahn@46305
   261
bulwahn@46305
   262
definition (in term_syntax) setify :: "('a::typerep) itself => term list => term"
bulwahn@46305
   263
where
bulwahn@46305
   264
  "setify T ts = foldr (termify_insert T) ts (term_emptyset T)" 
bulwahn@46305
   265
bulwahn@46305
   266
instantiation set :: (check_all) check_all
bulwahn@46305
   267
begin
bulwahn@46305
   268
bulwahn@46305
   269
definition
bulwahn@46305
   270
  "check_all_set f =
bulwahn@46305
   271
     check_all_subsets f (zip (Enum.enum :: 'a list) (map (%a. %u :: unit. a) (Quickcheck_Exhaustive.enum_term_of (TYPE ('a)) ())))"
bulwahn@46305
   272
bulwahn@46305
   273
definition enum_term_of_set :: "'a set itself => unit => term list"
bulwahn@46305
   274
where
bulwahn@46305
   275
  "enum_term_of_set _ _ = map (setify (TYPE('a))) (sublists (Quickcheck_Exhaustive.enum_term_of (TYPE('a)) ()))"
bulwahn@46305
   276
bulwahn@46305
   277
instance ..
bulwahn@46305
   278
bulwahn@46305
   279
end
bulwahn@41105
   280
bulwahn@41105
   281
instantiation unit :: check_all
bulwahn@41105
   282
begin
bulwahn@41105
   283
bulwahn@41105
   284
definition
bulwahn@41105
   285
  "check_all f = f (Code_Evaluation.valtermify ())"
bulwahn@41105
   286
bulwahn@41177
   287
definition enum_term_of_unit :: "unit itself => unit => term list"
bulwahn@41177
   288
where
bulwahn@41177
   289
  "enum_term_of_unit = (%_ _. [Code_Evaluation.term_of ()])"
bulwahn@41177
   290
bulwahn@41105
   291
instance ..
bulwahn@41105
   292
bulwahn@41105
   293
end
bulwahn@41105
   294
bulwahn@41105
   295
bulwahn@41085
   296
instantiation bool :: check_all
bulwahn@41085
   297
begin
bulwahn@41085
   298
bulwahn@41085
   299
definition
bulwahn@41085
   300
  "check_all f = (case f (Code_Evaluation.valtermify False) of Some x' \<Rightarrow> Some x' | None \<Rightarrow> f (Code_Evaluation.valtermify True))"
bulwahn@41085
   301
bulwahn@41177
   302
definition enum_term_of_bool :: "bool itself => unit => term list"
bulwahn@41177
   303
where
bulwahn@41177
   304
  "enum_term_of_bool = (%_ _. map Code_Evaluation.term_of (Enum.enum :: bool list))"
bulwahn@41177
   305
bulwahn@41085
   306
instance ..
bulwahn@41085
   307
bulwahn@41085
   308
end
bulwahn@41085
   309
bulwahn@41105
   310
bulwahn@41085
   311
instantiation prod :: (check_all, check_all) check_all
bulwahn@41085
   312
begin
bulwahn@41085
   313
bulwahn@41085
   314
definition
bulwahn@41719
   315
  "check_all f = check_all (%(x, t1). check_all (%(y, t2). f ((x, y),
bulwahn@41719
   316
    %u. let T1 = (Typerep.typerep (TYPE('a)));
bulwahn@41719
   317
            T2 = (Typerep.typerep (TYPE('b)))
bulwahn@41719
   318
    in Code_Evaluation.App (Code_Evaluation.App (
bulwahn@41719
   319
      Code_Evaluation.Const (STR ''Product_Type.Pair'') 
bulwahn@41719
   320
      (Typerep.Typerep (STR ''fun'') [T1, Typerep.Typerep (STR ''fun'') [T2, Typerep.Typerep (STR ''Product_Type.prod'') [T1, T2]]]))
bulwahn@41719
   321
      (t1 ())) (t2 ()))))"
bulwahn@41085
   322
bulwahn@41177
   323
definition enum_term_of_prod :: "('a * 'b) itself => unit => term list"
bulwahn@41177
   324
where
bulwahn@41719
   325
  "enum_term_of_prod = (%_ _. map (%(x, y).
bulwahn@41719
   326
       let T1 = (Typerep.typerep (TYPE('a)));
bulwahn@41719
   327
           T2 = (Typerep.typerep (TYPE('b)))
bulwahn@41719
   328
       in Code_Evaluation.App (Code_Evaluation.App (
bulwahn@41719
   329
         Code_Evaluation.Const (STR ''Product_Type.Pair'') 
bulwahn@41719
   330
           (Typerep.Typerep (STR ''fun'') [T1, Typerep.Typerep (STR ''fun'') [T2, Typerep.Typerep (STR ''Product_Type.prod'') [T1, T2]]])) x) y)
bulwahn@41719
   331
     (Enum.product (enum_term_of (TYPE('a)) ()) (enum_term_of (TYPE('b)) ())))  "
bulwahn@41177
   332
bulwahn@41085
   333
instance ..
bulwahn@41085
   334
bulwahn@41085
   335
end
bulwahn@41085
   336
bulwahn@41105
   337
bulwahn@41105
   338
instantiation sum :: (check_all, check_all) check_all
bulwahn@41105
   339
begin
bulwahn@41105
   340
bulwahn@41105
   341
definition
bulwahn@41722
   342
  "check_all f = (case check_all (%(a, t). f (Inl a, %_. 
bulwahn@41722
   343
     let T1 = (Typerep.typerep (TYPE('a)));
bulwahn@41722
   344
         T2 = (Typerep.typerep (TYPE('b)))
bulwahn@41722
   345
       in Code_Evaluation.App (Code_Evaluation.Const (STR ''Sum_Type.Inl'') 
bulwahn@41722
   346
           (Typerep.Typerep (STR ''fun'') [T1, Typerep.Typerep (STR ''Sum_Type.sum'') [T1, T2]])) (t ()))) of Some x' => Some x'
bulwahn@41722
   347
             | None => check_all (%(b, t). f (Inr b, %_. let
bulwahn@41722
   348
                 T1 = (Typerep.typerep (TYPE('a)));
bulwahn@41722
   349
                 T2 = (Typerep.typerep (TYPE('b)))
bulwahn@41722
   350
               in Code_Evaluation.App (Code_Evaluation.Const (STR ''Sum_Type.Inr'') 
bulwahn@41722
   351
                 (Typerep.Typerep (STR ''fun'') [T2, Typerep.Typerep (STR ''Sum_Type.sum'') [T1, T2]])) (t ()))))"
bulwahn@41105
   352
bulwahn@41177
   353
definition enum_term_of_sum :: "('a + 'b) itself => unit => term list"
bulwahn@41177
   354
where
bulwahn@41722
   355
  "enum_term_of_sum = (%_ _.
bulwahn@41722
   356
     let
bulwahn@41722
   357
       T1 = (Typerep.typerep (TYPE('a)));
bulwahn@41722
   358
       T2 = (Typerep.typerep (TYPE('b)))
bulwahn@41722
   359
     in
bulwahn@41722
   360
       map (Code_Evaluation.App (Code_Evaluation.Const (STR ''Sum_Type.Inl'') 
bulwahn@41722
   361
             (Typerep.Typerep (STR ''fun'') [T1, Typerep.Typerep (STR ''Sum_Type.sum'') [T1, T2]])))
bulwahn@41722
   362
             (enum_term_of (TYPE('a)) ()) @
bulwahn@41722
   363
       map (Code_Evaluation.App (Code_Evaluation.Const (STR ''Sum_Type.Inr'') 
bulwahn@41722
   364
             (Typerep.Typerep (STR ''fun'') [T2, Typerep.Typerep (STR ''Sum_Type.sum'') [T1, T2]])))
bulwahn@41722
   365
             (enum_term_of (TYPE('b)) ()))"
bulwahn@41177
   366
bulwahn@41105
   367
instance ..
bulwahn@41105
   368
bulwahn@41105
   369
end
bulwahn@41105
   370
bulwahn@41105
   371
instantiation nibble :: check_all
bulwahn@41105
   372
begin
bulwahn@41105
   373
bulwahn@41105
   374
definition
bulwahn@41105
   375
  "check_all f =
bulwahn@41105
   376
    f (Code_Evaluation.valtermify Nibble0) orelse
bulwahn@41105
   377
    f (Code_Evaluation.valtermify Nibble1) orelse
bulwahn@41105
   378
    f (Code_Evaluation.valtermify Nibble2) orelse
bulwahn@41105
   379
    f (Code_Evaluation.valtermify Nibble3) orelse
bulwahn@41105
   380
    f (Code_Evaluation.valtermify Nibble4) orelse
bulwahn@41105
   381
    f (Code_Evaluation.valtermify Nibble5) orelse
bulwahn@41105
   382
    f (Code_Evaluation.valtermify Nibble6) orelse
bulwahn@41105
   383
    f (Code_Evaluation.valtermify Nibble7) orelse
bulwahn@41105
   384
    f (Code_Evaluation.valtermify Nibble8) orelse
bulwahn@41105
   385
    f (Code_Evaluation.valtermify Nibble9) orelse
bulwahn@41105
   386
    f (Code_Evaluation.valtermify NibbleA) orelse
bulwahn@41105
   387
    f (Code_Evaluation.valtermify NibbleB) orelse
bulwahn@41105
   388
    f (Code_Evaluation.valtermify NibbleC) orelse
bulwahn@41105
   389
    f (Code_Evaluation.valtermify NibbleD) orelse
bulwahn@41105
   390
    f (Code_Evaluation.valtermify NibbleE) orelse
bulwahn@41105
   391
    f (Code_Evaluation.valtermify NibbleF)"
bulwahn@41105
   392
bulwahn@41177
   393
definition enum_term_of_nibble :: "nibble itself => unit => term list"
bulwahn@41177
   394
where
bulwahn@41177
   395
  "enum_term_of_nibble = (%_ _. map Code_Evaluation.term_of (Enum.enum :: nibble list))"
bulwahn@41177
   396
bulwahn@41105
   397
instance ..
bulwahn@41105
   398
bulwahn@41105
   399
end
bulwahn@41105
   400
bulwahn@41105
   401
bulwahn@41105
   402
instantiation char :: check_all
bulwahn@41105
   403
begin
bulwahn@41105
   404
bulwahn@41105
   405
definition
bulwahn@41105
   406
  "check_all f = check_all (%(x, t1). check_all (%(y, t2). f (Char x y, %_. Code_Evaluation.App (Code_Evaluation.App (Code_Evaluation.term_of Char) (t1 ())) (t2 ()))))"
bulwahn@41105
   407
bulwahn@41177
   408
definition enum_term_of_char :: "char itself => unit => term list"
bulwahn@41177
   409
where
bulwahn@41177
   410
  "enum_term_of_char = (%_ _. map Code_Evaluation.term_of (Enum.enum :: char list))"
bulwahn@41177
   411
bulwahn@41105
   412
instance ..
bulwahn@41105
   413
bulwahn@41105
   414
end
bulwahn@41105
   415
bulwahn@41105
   416
bulwahn@41105
   417
instantiation option :: (check_all) check_all
bulwahn@41105
   418
begin
bulwahn@41105
   419
bulwahn@41105
   420
definition
bulwahn@41178
   421
  "check_all f = f (Code_Evaluation.valtermify (None :: 'a option)) orelse check_all (%(x, t). f (Some x, %_. Code_Evaluation.App
bulwahn@41178
   422
    (Code_Evaluation.Const (STR ''Option.option.Some'')
bulwahn@41178
   423
      (Typerep.Typerep (STR ''fun'') [Typerep.typerep TYPE('a),  Typerep.Typerep (STR ''Option.option'') [Typerep.typerep TYPE('a)]])) (t ())))"
bulwahn@41105
   424
bulwahn@41177
   425
definition enum_term_of_option :: "'a option itself => unit => term list"
bulwahn@41177
   426
where
bulwahn@41722
   427
  "enum_term_of_option = (% _ _. (Code_Evaluation.term_of (None :: 'a option)) # (map (Code_Evaluation.App (Code_Evaluation.Const (STR ''Option.option.Some'')
bulwahn@41722
   428
      (Typerep.Typerep (STR ''fun'') [Typerep.typerep TYPE('a),  Typerep.Typerep (STR ''Option.option'') [Typerep.typerep TYPE('a)]]))) (enum_term_of (TYPE('a)) ())))"
bulwahn@41177
   429
bulwahn@41105
   430
instance ..
bulwahn@41105
   431
bulwahn@41105
   432
end
bulwahn@41105
   433
bulwahn@41105
   434
bulwahn@41085
   435
instantiation Enum.finite_1 :: check_all
bulwahn@41085
   436
begin
bulwahn@41085
   437
bulwahn@41085
   438
definition
bulwahn@41085
   439
  "check_all f = f (Code_Evaluation.valtermify Enum.finite_1.a\<^isub>1)"
bulwahn@41085
   440
bulwahn@41177
   441
definition enum_term_of_finite_1 :: "Enum.finite_1 itself => unit => term list"
bulwahn@41177
   442
where
bulwahn@41177
   443
  "enum_term_of_finite_1 = (%_ _. [Code_Evaluation.term_of Enum.finite_1.a\<^isub>1])"
bulwahn@41177
   444
bulwahn@41085
   445
instance ..
bulwahn@41085
   446
bulwahn@41085
   447
end
bulwahn@41085
   448
bulwahn@41085
   449
instantiation Enum.finite_2 :: check_all
bulwahn@41085
   450
begin
bulwahn@41085
   451
bulwahn@41085
   452
definition
bulwahn@41085
   453
  "check_all f = (case f (Code_Evaluation.valtermify Enum.finite_2.a\<^isub>1) of Some x' \<Rightarrow> Some x' | None \<Rightarrow> f (Code_Evaluation.valtermify Enum.finite_2.a\<^isub>2))"
bulwahn@41085
   454
bulwahn@41177
   455
definition enum_term_of_finite_2 :: "Enum.finite_2 itself => unit => term list"
bulwahn@41177
   456
where
bulwahn@41177
   457
  "enum_term_of_finite_2 = (%_ _. map Code_Evaluation.term_of (Enum.enum :: Enum.finite_2 list))"
bulwahn@41177
   458
bulwahn@41085
   459
instance ..
bulwahn@41085
   460
bulwahn@41085
   461
end
bulwahn@41085
   462
bulwahn@41085
   463
instantiation Enum.finite_3 :: check_all
bulwahn@41085
   464
begin
bulwahn@41085
   465
bulwahn@41085
   466
definition
bulwahn@41085
   467
  "check_all f = (case f (Code_Evaluation.valtermify Enum.finite_3.a\<^isub>1) of Some x' \<Rightarrow> Some x' | None \<Rightarrow> (case f (Code_Evaluation.valtermify Enum.finite_3.a\<^isub>2) of Some x' \<Rightarrow> Some x' | None \<Rightarrow> f (Code_Evaluation.valtermify Enum.finite_3.a\<^isub>3)))"
bulwahn@41085
   468
bulwahn@41177
   469
definition enum_term_of_finite_3 :: "Enum.finite_3 itself => unit => term list"
bulwahn@41177
   470
where
bulwahn@41177
   471
  "enum_term_of_finite_3 = (%_ _. map Code_Evaluation.term_of (Enum.enum :: Enum.finite_3 list))"
bulwahn@41177
   472
bulwahn@41085
   473
instance ..
bulwahn@41085
   474
bulwahn@41085
   475
end
bulwahn@41085
   476
bulwahn@42195
   477
subsection {* Bounded universal quantifiers *}
bulwahn@41085
   478
bulwahn@42195
   479
class bounded_forall =
bulwahn@42195
   480
  fixes bounded_forall :: "('a \<Rightarrow> bool) \<Rightarrow> code_numeral \<Rightarrow> bool"
bulwahn@42195
   481
bulwahn@42305
   482
subsection {* Fast exhaustive combinators *}
bulwahn@42305
   483
bulwahn@42305
   484
class fast_exhaustive = term_of +
bulwahn@42305
   485
  fixes fast_exhaustive :: "('a \<Rightarrow> unit) \<Rightarrow> code_numeral \<Rightarrow> unit"
bulwahn@42305
   486
bulwahn@45818
   487
axiomatization throw_Counterexample :: "term list => unit"
bulwahn@45818
   488
axiomatization catch_Counterexample :: "unit => term list option"
bulwahn@42305
   489
bulwahn@42305
   490
code_const throw_Counterexample
bulwahn@42305
   491
  (Quickcheck "raise (Exhaustive'_Generators.Counterexample _)")
bulwahn@42305
   492
code_const catch_Counterexample
bulwahn@42305
   493
  (Quickcheck "(((_); NONE) handle Exhaustive'_Generators.Counterexample ts => SOME ts)")
bulwahn@42305
   494
bulwahn@45450
   495
subsection {* Continuation passing style functions as plus monad *}
bulwahn@45450
   496
  
bulwahn@45450
   497
type_synonym 'a cps = "('a => term list option) => term list option"
bulwahn@45450
   498
bulwahn@45450
   499
definition cps_empty :: "'a cps"
bulwahn@45450
   500
where
bulwahn@45450
   501
  "cps_empty = (%cont. None)"
bulwahn@45450
   502
bulwahn@45450
   503
definition cps_single :: "'a => 'a cps"
bulwahn@45450
   504
where
bulwahn@45450
   505
  "cps_single v = (%cont. cont v)"
bulwahn@45450
   506
bulwahn@45450
   507
definition cps_bind :: "'a cps => ('a => 'b cps) => 'b cps" 
bulwahn@45450
   508
where
bulwahn@45450
   509
  "cps_bind m f = (%cont. m (%a. (f a) cont))"
bulwahn@45450
   510
bulwahn@45450
   511
definition cps_plus :: "'a cps => 'a cps => 'a cps"
bulwahn@45450
   512
where
bulwahn@45450
   513
  "cps_plus a b = (%c. case a c of None => b c | Some x => Some x)"
bulwahn@45450
   514
bulwahn@45450
   515
definition cps_if :: "bool => unit cps"
bulwahn@45450
   516
where
bulwahn@45450
   517
  "cps_if b = (if b then cps_single () else cps_empty)"
bulwahn@45450
   518
bulwahn@45450
   519
definition cps_not :: "unit cps => unit cps"
bulwahn@45450
   520
where
bulwahn@45450
   521
  "cps_not n = (%c. case n (%u. Some []) of None => c () | Some _ => None)"
bulwahn@45450
   522
bulwahn@45750
   523
type_synonym 'a pos_bound_cps = "('a => (bool * term list) option) => code_numeral => (bool * term list) option"
bulwahn@45450
   524
bulwahn@45450
   525
definition pos_bound_cps_empty :: "'a pos_bound_cps"
bulwahn@45450
   526
where
bulwahn@45450
   527
  "pos_bound_cps_empty = (%cont i. None)"
bulwahn@45450
   528
bulwahn@45450
   529
definition pos_bound_cps_single :: "'a => 'a pos_bound_cps"
bulwahn@45450
   530
where
bulwahn@45450
   531
  "pos_bound_cps_single v = (%cont i. cont v)"
bulwahn@45450
   532
bulwahn@45450
   533
definition pos_bound_cps_bind :: "'a pos_bound_cps => ('a => 'b pos_bound_cps) => 'b pos_bound_cps" 
bulwahn@45450
   534
where
bulwahn@45450
   535
  "pos_bound_cps_bind m f = (%cont i. if i = 0 then None else (m (%a. (f a) cont i) (i - 1)))"
bulwahn@45450
   536
bulwahn@45450
   537
definition pos_bound_cps_plus :: "'a pos_bound_cps => 'a pos_bound_cps => 'a pos_bound_cps"
bulwahn@45450
   538
where
bulwahn@45450
   539
  "pos_bound_cps_plus a b = (%c i. case a c i of None => b c i | Some x => Some x)"
bulwahn@45450
   540
bulwahn@45450
   541
definition pos_bound_cps_if :: "bool => unit pos_bound_cps"
bulwahn@45450
   542
where
bulwahn@45450
   543
  "pos_bound_cps_if b = (if b then pos_bound_cps_single () else pos_bound_cps_empty)"
bulwahn@45450
   544
bulwahn@45450
   545
datatype 'a unknown = Unknown | Known 'a
bulwahn@45450
   546
datatype 'a three_valued = Unknown_value | Value 'a | No_value
bulwahn@45450
   547
bulwahn@45450
   548
type_synonym 'a neg_bound_cps = "('a unknown => term list three_valued) => code_numeral => term list three_valued"
bulwahn@45450
   549
bulwahn@45450
   550
definition neg_bound_cps_empty :: "'a neg_bound_cps"
bulwahn@45450
   551
where
bulwahn@45450
   552
  "neg_bound_cps_empty = (%cont i. No_value)"
bulwahn@45450
   553
bulwahn@45450
   554
definition neg_bound_cps_single :: "'a => 'a neg_bound_cps"
bulwahn@45450
   555
where
bulwahn@45450
   556
  "neg_bound_cps_single v = (%cont i. cont (Known v))"
bulwahn@45450
   557
bulwahn@45450
   558
definition neg_bound_cps_bind :: "'a neg_bound_cps => ('a => 'b neg_bound_cps) => 'b neg_bound_cps" 
bulwahn@45450
   559
where
bulwahn@45450
   560
  "neg_bound_cps_bind m f = (%cont i. if i = 0 then cont Unknown else m (%a. case a of Unknown => cont Unknown | Known a' => f a' cont i) (i - 1))"
bulwahn@45450
   561
bulwahn@45450
   562
definition neg_bound_cps_plus :: "'a neg_bound_cps => 'a neg_bound_cps => 'a neg_bound_cps"
bulwahn@45450
   563
where
bulwahn@45450
   564
  "neg_bound_cps_plus a b = (%c i. case a c i of No_value => b c i | Value x => Value x | Unknown_value => (case b c i of No_value => Unknown_value | Value x => Value x | Unknown_value => Unknown_value))"
bulwahn@45450
   565
bulwahn@45450
   566
definition neg_bound_cps_if :: "bool => unit neg_bound_cps"
bulwahn@45450
   567
where
bulwahn@45450
   568
  "neg_bound_cps_if b = (if b then neg_bound_cps_single () else neg_bound_cps_empty)"
bulwahn@45450
   569
bulwahn@45450
   570
definition neg_bound_cps_not :: "unit pos_bound_cps => unit neg_bound_cps"
bulwahn@45450
   571
where
bulwahn@45750
   572
  "neg_bound_cps_not n = (%c i. case n (%u. Some (True, [])) i of None => c (Known ()) | Some _ => No_value)"
bulwahn@45450
   573
bulwahn@45450
   574
definition pos_bound_cps_not :: "unit neg_bound_cps => unit pos_bound_cps"
bulwahn@45450
   575
where
bulwahn@45450
   576
  "pos_bound_cps_not n = (%c i. case n (%u. Value []) i of No_value => c () | Value _ => None | Unknown_value => None)"
bulwahn@45450
   577
bulwahn@45925
   578
subsection {* Defining generators for any first-order data type *}
bulwahn@40420
   579
bulwahn@45697
   580
axiomatization unknown :: 'a
bulwahn@45697
   581
bulwahn@45697
   582
notation (output) unknown  ("?")
bulwahn@45684
   583
 
bulwahn@41920
   584
use "Tools/Quickcheck/exhaustive_generators.ML"
bulwahn@40420
   585
bulwahn@41918
   586
setup {* Exhaustive_Generators.setup *}
bulwahn@40420
   587
bulwahn@43882
   588
declare [[quickcheck_batch_tester = exhaustive]]
bulwahn@40915
   589
bulwahn@45925
   590
subsection {* Defining generators for abstract types *}
bulwahn@45925
   591
bulwahn@45925
   592
use "Tools/Quickcheck/abstract_generators.ML"
bulwahn@45925
   593
bulwahn@45733
   594
hide_fact orelse_def
bulwahn@41105
   595
no_notation orelse (infixr "orelse" 55)
bulwahn@45818
   596
bulwahn@45818
   597
hide_fact
bulwahn@45818
   598
  exhaustive'_def
bulwahn@45818
   599
  exhaustive_code_numeral'_def
bulwahn@45818
   600
bulwahn@46305
   601
hide_const valterm_emptyset valtermify_insert term_emptyset termify_insert setify
bulwahn@46305
   602
bulwahn@45818
   603
hide_const (open)
bulwahn@45818
   604
  exhaustive full_exhaustive exhaustive' exhaustive_code_numeral' full_exhaustive_code_numeral'
bulwahn@45818
   605
  throw_Counterexample catch_Counterexample
bulwahn@45818
   606
  check_all enum_term_of
bulwahn@46305
   607
  orelse unknown mk_map_term check_all_n_lists check_all_subsets
bulwahn@40420
   608
bulwahn@45450
   609
hide_type (open) cps pos_bound_cps neg_bound_cps unknown three_valued
bulwahn@45450
   610
hide_const (open) cps_empty cps_single cps_bind cps_plus cps_if cps_not
bulwahn@45450
   611
  pos_bound_cps_empty pos_bound_cps_single pos_bound_cps_bind pos_bound_cps_plus pos_bound_cps_if pos_bound_cps_not
bulwahn@45450
   612
  neg_bound_cps_empty neg_bound_cps_single neg_bound_cps_bind neg_bound_cps_plus neg_bound_cps_if neg_bound_cps_not
bulwahn@45450
   613
  Unknown Known Unknown_value Value No_value
bulwahn@45450
   614
bulwahn@45450
   615
end