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