src/HOL/Tools/Quickcheck/narrowing_generators.ML
author bulwahn
Mon Dec 05 12:35:58 2011 +0100 (2011-12-05)
changeset 45756 295658b28d3b
parent 45728 123e3a9a3bb3
child 45757 e32dd098f57a
permissions -rw-r--r--
quickcheck narrowing continues searching after found a potentially spurious counterexample
bulwahn@41930
     1
(*  Title:      HOL/Tools/Quickcheck/narrowing_generators.ML
bulwahn@41905
     2
    Author:     Lukas Bulwahn, TU Muenchen
bulwahn@41905
     3
wenzelm@41938
     4
Narrowing-based counterexample generation.
bulwahn@41905
     5
*)
bulwahn@41905
     6
bulwahn@41930
     7
signature NARROWING_GENERATORS =
bulwahn@41905
     8
sig
bulwahn@43237
     9
  val allow_existentials : bool Config.T
bulwahn@42023
    10
  val finite_functions : bool Config.T
bulwahn@43079
    11
  val overlord : bool Config.T
bulwahn@43891
    12
  val active : bool Config.T
bulwahn@45418
    13
  val test_term: Proof.context -> term * term list -> Quickcheck.result
bulwahn@43237
    14
  datatype counterexample = Universal_Counterexample of (term * counterexample)
bulwahn@43237
    15
    | Existential_Counterexample of (term * counterexample) list
bulwahn@43237
    16
    | Empty_Assignment
bulwahn@45725
    17
  val put_counterexample: (unit -> (bool * term list) option) -> Proof.context -> Proof.context
bulwahn@43237
    18
  val put_existential_counterexample : (unit -> counterexample option) -> Proof.context -> Proof.context
bulwahn@41905
    19
  val setup: theory -> theory
bulwahn@41905
    20
end;
bulwahn@41905
    21
bulwahn@41930
    22
structure Narrowing_Generators : NARROWING_GENERATORS =
bulwahn@41905
    23
struct
bulwahn@41905
    24
bulwahn@42023
    25
(* configurations *)
bulwahn@42023
    26
bulwahn@43237
    27
val allow_existentials = Attrib.setup_config_bool @{binding quickcheck_allow_existentials} (K true)
wenzelm@42616
    28
val finite_functions = Attrib.setup_config_bool @{binding quickcheck_finite_functions} (K true)
bulwahn@43047
    29
val overlord = Attrib.setup_config_bool @{binding quickcheck_narrowing_overlord} (K false)
bulwahn@42023
    30
bulwahn@43047
    31
(* partial_term_of instances *)
bulwahn@43047
    32
bulwahn@43047
    33
fun mk_partial_term_of (x, T) =
bulwahn@43047
    34
  Const (@{const_name Quickcheck_Narrowing.partial_term_of_class.partial_term_of},
bulwahn@43047
    35
    Term.itselfT T --> @{typ narrowing_term} --> @{typ Code_Evaluation.term})
bulwahn@43047
    36
      $ Const ("TYPE", Term.itselfT T) $ x
bulwahn@43047
    37
bulwahn@43047
    38
(** formal definition **)
bulwahn@43047
    39
bulwahn@43047
    40
fun add_partial_term_of tyco raw_vs thy =
bulwahn@43047
    41
  let
bulwahn@43047
    42
    val vs = map (fn (v, _) => (v, @{sort typerep})) raw_vs;
bulwahn@43047
    43
    val ty = Type (tyco, map TFree vs);
bulwahn@43047
    44
    val lhs = Const (@{const_name partial_term_of},
bulwahn@43047
    45
        Term.itselfT ty --> @{typ narrowing_term} --> @{typ Code_Evaluation.term})
bulwahn@43047
    46
      $ Free ("x", Term.itselfT ty) $ Free ("t", @{typ narrowing_term});
bulwahn@43047
    47
    val rhs = @{term "undefined :: Code_Evaluation.term"};
bulwahn@43047
    48
    val eq = HOLogic.mk_Trueprop (HOLogic.mk_eq (lhs, rhs));
bulwahn@43047
    49
    fun triv_name_of t = (fst o dest_Free o fst o strip_comb o fst
bulwahn@43047
    50
      o HOLogic.dest_eq o HOLogic.dest_Trueprop) t ^ "_triv";
bulwahn@43047
    51
  in
bulwahn@43047
    52
    thy
bulwahn@43047
    53
    |> Class.instantiation ([tyco], vs, @{sort partial_term_of})
bulwahn@43047
    54
    |> `(fn lthy => Syntax.check_term lthy eq)
bulwahn@43047
    55
    |-> (fn eq => Specification.definition (NONE, ((Binding.name (triv_name_of eq), []), eq)))
bulwahn@43047
    56
    |> snd
bulwahn@43047
    57
    |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
bulwahn@43047
    58
  end;
bulwahn@43047
    59
bulwahn@43047
    60
fun ensure_partial_term_of (tyco, (raw_vs, _)) thy =
bulwahn@43047
    61
  let
bulwahn@43047
    62
    val need_inst = not (can (Sorts.mg_domain (Sign.classes_of thy) tyco) @{sort partial_term_of})
bulwahn@43047
    63
      andalso can (Sorts.mg_domain (Sign.classes_of thy) tyco) @{sort typerep};
bulwahn@43047
    64
  in if need_inst then add_partial_term_of tyco raw_vs thy else thy end;
bulwahn@43047
    65
bulwahn@43047
    66
bulwahn@43047
    67
(** code equations for datatypes **)
bulwahn@43047
    68
bulwahn@43047
    69
fun mk_partial_term_of_eq thy ty (i, (c, (_, tys))) =
bulwahn@43047
    70
  let
wenzelm@43329
    71
    val frees = map Free (Name.invent_names Name.context "a" (map (K @{typ narrowing_term}) tys))
bulwahn@43047
    72
    val narrowing_term = @{term "Quickcheck_Narrowing.Ctr"} $ HOLogic.mk_number @{typ code_int} i
bulwahn@43079
    73
      $ (HOLogic.mk_list @{typ narrowing_term} (rev frees))
bulwahn@43047
    74
    val rhs = fold (fn u => fn t => @{term "Code_Evaluation.App"} $ t $ u)
bulwahn@43047
    75
        (map mk_partial_term_of (frees ~~ tys))
bulwahn@43047
    76
        (@{term "Code_Evaluation.Const"} $ HOLogic.mk_literal c $ HOLogic.mk_typerep (tys ---> ty))
bulwahn@43047
    77
    val insts =
wenzelm@45344
    78
      map (SOME o Thm.cterm_of thy o Logic.unvarify_types_global o Logic.varify_global)
bulwahn@43047
    79
        [Free ("ty", Term.itselfT ty), narrowing_term, rhs]
bulwahn@43047
    80
    val cty = Thm.ctyp_of thy ty;
bulwahn@43047
    81
  in
bulwahn@43047
    82
    @{thm partial_term_of_anything}
bulwahn@43047
    83
    |> Drule.instantiate' [SOME cty] insts
bulwahn@43047
    84
    |> Thm.varifyT_global
bulwahn@43047
    85
  end
bulwahn@43047
    86
bulwahn@43047
    87
fun add_partial_term_of_code tyco raw_vs raw_cs thy =
bulwahn@43047
    88
  let
bulwahn@43047
    89
    val algebra = Sign.classes_of thy;
bulwahn@43047
    90
    val vs = map (fn (v, sort) =>
bulwahn@43047
    91
      (v, curry (Sorts.inter_sort algebra) @{sort typerep} sort)) raw_vs;
bulwahn@43047
    92
    val ty = Type (tyco, map TFree vs);
bulwahn@43047
    93
    val cs = (map o apsnd o apsnd o map o map_atyps)
bulwahn@43047
    94
      (fn TFree (v, _) => TFree (v, (the o AList.lookup (op =) vs) v)) raw_cs;
bulwahn@43047
    95
    val const = AxClass.param_of_inst thy (@{const_name partial_term_of}, tyco);
wenzelm@45344
    96
    val var_insts =
wenzelm@45344
    97
      map (SOME o Thm.cterm_of thy o Logic.unvarify_types_global o Logic.varify_global)
bulwahn@43079
    98
        [Free ("ty", Term.itselfT ty), @{term "Quickcheck_Narrowing.Var p tt"},
wenzelm@45344
    99
          @{term "Code_Evaluation.Free (STR ''_'')"} $ HOLogic.mk_typerep ty];
bulwahn@43079
   100
    val var_eq =
bulwahn@43079
   101
      @{thm partial_term_of_anything}
bulwahn@43079
   102
      |> Drule.instantiate' [SOME (Thm.ctyp_of thy ty)] var_insts
bulwahn@43079
   103
      |> Thm.varifyT_global
bulwahn@43079
   104
    val eqs = var_eq :: map_index (mk_partial_term_of_eq thy ty) cs;
bulwahn@43047
   105
 in
bulwahn@43047
   106
    thy
bulwahn@43047
   107
    |> Code.del_eqns const
bulwahn@43047
   108
    |> fold Code.add_eqn eqs
bulwahn@43047
   109
  end;
bulwahn@43047
   110
bulwahn@43047
   111
fun ensure_partial_term_of_code (tyco, (raw_vs, cs)) thy =
bulwahn@43047
   112
  let
bulwahn@43047
   113
    val has_inst = can (Sorts.mg_domain (Sign.classes_of thy) tyco) @{sort partial_term_of};
bulwahn@43047
   114
  in if has_inst then add_partial_term_of_code tyco raw_vs cs thy else thy end;
bulwahn@43047
   115
bulwahn@43047
   116
bulwahn@43047
   117
(* narrowing generators *)
bulwahn@43047
   118
bulwahn@43047
   119
(** narrowing specific names and types **)
bulwahn@41963
   120
bulwahn@41963
   121
exception FUNCTION_TYPE;
bulwahn@41963
   122
bulwahn@41963
   123
val narrowingN = "narrowing";
bulwahn@41963
   124
bulwahn@41963
   125
fun narrowingT T =
bulwahn@41963
   126
  @{typ Quickcheck_Narrowing.code_int} --> Type (@{type_name Quickcheck_Narrowing.cons}, [T])
bulwahn@41963
   127
bulwahn@41963
   128
fun mk_empty T = Const (@{const_name Quickcheck_Narrowing.empty}, narrowingT T)
bulwahn@41963
   129
bulwahn@41963
   130
fun mk_cons c T = Const (@{const_name Quickcheck_Narrowing.cons}, T --> narrowingT T) $ Const (c, T)
bulwahn@41963
   131
bulwahn@41963
   132
fun mk_apply (T, t) (U, u) =
bulwahn@41963
   133
  let
bulwahn@41963
   134
    val (_, U') = dest_funT U
bulwahn@41963
   135
  in
bulwahn@41963
   136
    (U', Const (@{const_name Quickcheck_Narrowing.apply},
bulwahn@41963
   137
      narrowingT U --> narrowingT T --> narrowingT U') $ u $ t)
bulwahn@41963
   138
  end
bulwahn@41963
   139
  
bulwahn@41963
   140
fun mk_sum (t, u) =
bulwahn@41963
   141
  let
bulwahn@41963
   142
    val T = fastype_of t
bulwahn@41963
   143
  in
bulwahn@41963
   144
    Const (@{const_name Quickcheck_Narrowing.sum}, T --> T --> T) $ t $ u
bulwahn@41963
   145
  end
bulwahn@41963
   146
bulwahn@43047
   147
(** deriving narrowing instances **)
bulwahn@41963
   148
bulwahn@41963
   149
fun mk_equations descr vs tycos narrowings (Ts, Us) =
bulwahn@41963
   150
  let
bulwahn@41963
   151
    fun mk_call T =
bulwahn@42214
   152
      (T, Const (@{const_name "Quickcheck_Narrowing.narrowing_class.narrowing"}, narrowingT T))
bulwahn@41963
   153
    fun mk_aux_call fTs (k, _) (tyco, Ts) =
bulwahn@41963
   154
      let
bulwahn@41963
   155
        val T = Type (tyco, Ts)
bulwahn@41963
   156
        val _ = if not (null fTs) then raise FUNCTION_TYPE else ()
bulwahn@41963
   157
      in
bulwahn@41963
   158
        (T, nth narrowings k)
bulwahn@41963
   159
      end
bulwahn@41963
   160
    fun mk_consexpr simpleT (c, xs) =
bulwahn@41963
   161
      let
bulwahn@41963
   162
        val Ts = map fst xs
bulwahn@41963
   163
      in snd (fold mk_apply xs (Ts ---> simpleT, mk_cons c (Ts ---> simpleT))) end
bulwahn@41963
   164
    fun mk_rhs exprs = foldr1 mk_sum exprs
bulwahn@41963
   165
    val rhss =
bulwahn@41963
   166
      Datatype_Aux.interpret_construction descr vs
bulwahn@41963
   167
        { atyp = mk_call, dtyp = mk_aux_call }
bulwahn@41963
   168
      |> (map o apfst) Type
bulwahn@41963
   169
      |> map (fn (T, cs) => map (mk_consexpr T) cs)
bulwahn@41963
   170
      |> map mk_rhs
bulwahn@41963
   171
    val lhss = narrowings
bulwahn@41963
   172
    val eqs = map (HOLogic.mk_Trueprop o HOLogic.mk_eq) (lhss ~~ rhss)
bulwahn@41963
   173
  in
bulwahn@41963
   174
    eqs
bulwahn@41963
   175
  end
bulwahn@43237
   176
    
bulwahn@43237
   177
fun contains_recursive_type_under_function_types xs =
bulwahn@43237
   178
  exists (fn (_, (_, _, cs)) => cs |> exists (snd #> exists (fn dT =>
bulwahn@43237
   179
    (case Datatype_Aux.strip_dtyp dT of (_ :: _, Datatype.DtRec _) => true | _ => false)))) xs
bulwahn@43237
   180
bulwahn@41963
   181
fun instantiate_narrowing_datatype config descr vs tycos prfx (names, auxnames) (Ts, Us) thy =
bulwahn@41963
   182
  let
bulwahn@41963
   183
    val _ = Datatype_Aux.message config "Creating narrowing generators ...";
bulwahn@41963
   184
    val narrowingsN = map (prefix (narrowingN ^ "_")) (names @ auxnames);
bulwahn@41963
   185
  in
bulwahn@43237
   186
    if not (contains_recursive_type_under_function_types descr) then
bulwahn@43237
   187
      thy
bulwahn@43237
   188
      |> Class.instantiation (tycos, vs, @{sort narrowing})
bulwahn@43237
   189
      |> Quickcheck_Common.define_functions
bulwahn@43237
   190
        (fn narrowings => mk_equations descr vs tycos narrowings (Ts, Us), NONE)
bulwahn@43237
   191
        prfx [] narrowingsN (map narrowingT (Ts @ Us))
bulwahn@43237
   192
      |> Class.prove_instantiation_exit (K (Class.intro_classes_tac []))
bulwahn@43237
   193
    else
bulwahn@43237
   194
      thy
bulwahn@41963
   195
  end;
bulwahn@41963
   196
bulwahn@41963
   197
(* testing framework *)
bulwahn@41963
   198
bulwahn@43308
   199
val target = "Haskell_Quickcheck"
bulwahn@41930
   200
bulwahn@43047
   201
(** invocation of Haskell interpreter **)
bulwahn@41905
   202
wenzelm@43702
   203
val narrowing_engine =
wenzelm@43702
   204
  Context.>>> (Context.map_theory_result
wenzelm@43702
   205
    (Thy_Load.use_file (Path.explode "Tools/Quickcheck/Narrowing_Engine.hs")))
wenzelm@43702
   206
wenzelm@43702
   207
val pnf_narrowing_engine =
wenzelm@43702
   208
  Context.>>> (Context.map_theory_result
wenzelm@43702
   209
    (Thy_Load.use_file (Path.explode "Tools/Quickcheck/PNF_Narrowing_Engine.hs")))
bulwahn@41905
   210
bulwahn@41905
   211
fun exec verbose code =
bulwahn@41905
   212
  ML_Context.exec (fn () => Secure.use_text ML_Env.local_context (0, "generated code") verbose code)
bulwahn@41905
   213
bulwahn@43079
   214
fun with_overlord_dir name f =
bulwahn@43047
   215
  let
wenzelm@43602
   216
    val path =
wenzelm@43602
   217
      Path.append (Path.explode "$ISABELLE_HOME_USER") (Path.basic (name ^ serial_string ()))
bulwahn@43047
   218
    val _ = Isabelle_System.mkdirs path;
bulwahn@43047
   219
  in Exn.release (Exn.capture f path) end;
bulwahn@43379
   220
bulwahn@43379
   221
fun elapsed_time description e =
bulwahn@43379
   222
  let val ({elapsed, ...}, result) = Timing.timing e ()
bulwahn@43379
   223
  in (result, (description, Time.toMilliseconds elapsed)) end
bulwahn@43047
   224
  
bulwahn@45756
   225
fun value (contains_existentials, ((genuine_only, quiet), size)) ctxt cookie (code, value_name) =
bulwahn@41905
   226
  let
bulwahn@45756
   227
    val ((is_genuine, counterexample_of), (get, put, put_ml)) = cookie
bulwahn@43308
   228
    fun message s = if quiet then () else Output.urgent_message s
bulwahn@43585
   229
    val current_size = Unsynchronized.ref 0
bulwahn@43585
   230
    val current_result = Unsynchronized.ref Quickcheck.empty_result 
bulwahn@43585
   231
    fun excipit () =
bulwahn@43585
   232
      "Quickcheck ran out of time while testing at size " ^ string_of_int (!current_size)
bulwahn@41930
   233
    val tmp_prefix = "Quickcheck_Narrowing"
bulwahn@43079
   234
    val with_tmp_dir =
bulwahn@43079
   235
      if Config.get ctxt overlord then with_overlord_dir else Isabelle_System.with_tmp_dir 
bulwahn@41905
   236
    fun run in_path = 
bulwahn@41905
   237
      let
bulwahn@44751
   238
        val code_file = Path.append in_path (Path.basic "Generated_Code.hs")
bulwahn@41930
   239
        val narrowing_engine_file = Path.append in_path (Path.basic "Narrowing_Engine.hs")
bulwahn@41905
   240
        val main_file = Path.append in_path (Path.basic "Main.hs")
bulwahn@41905
   241
        val main = "module Main where {\n\n" ^
bulwahn@43114
   242
          "import System;\n" ^
bulwahn@41933
   243
          "import Narrowing_Engine;\n" ^
bulwahn@44751
   244
          "import Generated_Code;\n\n" ^
bulwahn@45685
   245
          "main = getArgs >>= \\[potential, size] -> " ^
bulwahn@45685
   246
          "Narrowing_Engine.depthCheck (read potential) (read size) (Generated_Code.value ())\n\n" ^
bulwahn@41905
   247
          "}\n"
bulwahn@44751
   248
        val code' = prefix "module Generated_Code where {\n\ndata Typerep = Typerep String [Typerep];\n"
bulwahn@44751
   249
          (unprefix "module Generated_Code where {" code)
bulwahn@41909
   250
        val _ = File.write code_file code'
bulwahn@43237
   251
        val _ = File.write narrowing_engine_file
bulwahn@43237
   252
          (if contains_existentials then pnf_narrowing_engine else narrowing_engine)
bulwahn@41905
   253
        val _ = File.write main_file main
bulwahn@43114
   254
        val executable = File.shell_path (Path.append in_path (Path.basic "isabelle_quickcheck_narrowing"))
noschinl@44926
   255
        val cmd = "exec \"$ISABELLE_GHC\" " ^ Code_Haskell.language_params ^ " " ^
wenzelm@41946
   256
          (space_implode " " (map File.shell_path [code_file, narrowing_engine_file, main_file])) ^
bulwahn@43114
   257
          " -o " ^ executable ^ ";"
wenzelm@43850
   258
        val (result, compilation_time) =
wenzelm@43850
   259
          elapsed_time "Haskell compilation" (fn () => Isabelle_System.bash cmd) 
bulwahn@43585
   260
        val _ = Quickcheck.add_timing compilation_time current_result
bulwahn@45685
   261
        fun haskell_string_of_bool v = if v then "True" else "False"
wenzelm@43850
   262
        val _ = if Isabelle_System.bash cmd <> 0 then error "Compilation with GHC failed" else ()
bulwahn@45756
   263
        fun with_size genuine_only k =
bulwahn@43308
   264
          if k > size then
bulwahn@43585
   265
            (NONE, !current_result)
bulwahn@43114
   266
          else
bulwahn@43114
   267
            let
bulwahn@45420
   268
              val _ = message ("[Quickcheck-narrowing] Test data size: " ^ string_of_int k)
bulwahn@43585
   269
              val _ = current_size := k
bulwahn@43585
   270
              val ((response, _), timing) = elapsed_time ("execution of size " ^ string_of_int k)
bulwahn@45685
   271
                (fn () => Isabelle_System.bash_output
bulwahn@45756
   272
                  (executable ^ " " ^ haskell_string_of_bool (not genuine_only) ^ " " ^ string_of_int k))
bulwahn@43585
   273
              val _ = Quickcheck.add_timing timing current_result
bulwahn@43114
   274
            in
bulwahn@43585
   275
              if response = "NONE\n" then
bulwahn@45756
   276
                with_size genuine_only (k + 1)
bulwahn@43585
   277
              else
bulwahn@43585
   278
                let
bulwahn@43585
   279
                  val output_value = the_default "NONE"
bulwahn@43585
   280
                    (try (snd o split_last o filter_out (fn s => s = "") o split_lines) response)
bulwahn@43585
   281
                    |> translate_string (fn s => if s = "\\" then "\\\\" else s)
bulwahn@43585
   282
                  val ml_code = "\nval _ = Context.set_thread_data (SOME (Context.map_proof (" ^ put_ml
bulwahn@43585
   283
                    ^ " (fn () => " ^ output_value ^ ")) (ML_Context.the_generic_context ())))";
bulwahn@43585
   284
                  val ctxt' = ctxt
bulwahn@43585
   285
                    |> put (fn () => error ("Bad evaluation for " ^ quote put_ml))
bulwahn@45756
   286
                    |> Context.proof_map (exec false ml_code);                 
bulwahn@45756
   287
                  val counterexample =  get ctxt' ()
bulwahn@45756
   288
                in
bulwahn@45756
   289
                  if is_genuine counterexample then
bulwahn@45756
   290
                    (counterexample, !current_result)
bulwahn@45756
   291
                  else
bulwahn@45756
   292
                    let
bulwahn@45756
   293
                      val cex = Option.map (rpair []) (counterexample_of counterexample)
bulwahn@45756
   294
                    in
bulwahn@45756
   295
                      (Output.urgent_message (Pretty.string_of (Quickcheck.pretty_counterex ctxt false cex));
bulwahn@45756
   296
                      Output.urgent_message "Quickcheck continues to find a genuine counterexample...";
bulwahn@45756
   297
                      with_size true (k + 1))
bulwahn@45756
   298
                    end
bulwahn@45756
   299
               end
bulwahn@43585
   300
            end 
bulwahn@45756
   301
      in with_size genuine_only 0 end
bulwahn@43585
   302
  in
bulwahn@45418
   303
    with_tmp_dir tmp_prefix run
bulwahn@43585
   304
  end;
bulwahn@41905
   305
bulwahn@43308
   306
fun dynamic_value_strict opts cookie thy postproc t =
bulwahn@41905
   307
  let
bulwahn@43114
   308
    val ctxt = Proof_Context.init_global thy
bulwahn@45756
   309
    fun evaluator naming program ((_, vs_ty), t) deps =
bulwahn@45756
   310
      Exn.interruptible_capture (value opts ctxt cookie)
bulwahn@45756
   311
        (Code_Target.evaluator thy target naming program deps (vs_ty, t));    
bulwahn@41905
   312
  in Exn.release (Code_Thingol.dynamic_value thy (Exn.map_result o postproc) evaluator t) end;
bulwahn@41905
   313
bulwahn@43047
   314
(** counterexample generator **)
bulwahn@41905
   315
  
bulwahn@41932
   316
structure Counterexample = Proof_Data
bulwahn@41905
   317
(
bulwahn@45725
   318
  type T = unit -> (bool * term list) option
bulwahn@41936
   319
  fun init _ () = error "Counterexample"
bulwahn@41905
   320
)
bulwahn@41905
   321
bulwahn@43237
   322
datatype counterexample = Universal_Counterexample of (term * counterexample)
bulwahn@43237
   323
  | Existential_Counterexample of (term * counterexample) list
bulwahn@43237
   324
  | Empty_Assignment
bulwahn@43237
   325
  
bulwahn@43237
   326
fun map_counterexample f Empty_Assignment = Empty_Assignment
bulwahn@43237
   327
  | map_counterexample f (Universal_Counterexample (t, c)) =
bulwahn@43237
   328
      Universal_Counterexample (f t, map_counterexample f c)
bulwahn@43237
   329
  | map_counterexample f (Existential_Counterexample cs) =
bulwahn@43237
   330
      Existential_Counterexample (map (fn (t, c) => (f t, map_counterexample f c)) cs)
bulwahn@43237
   331
bulwahn@43237
   332
structure Existential_Counterexample = Proof_Data
bulwahn@43237
   333
(
bulwahn@43237
   334
  type T = unit -> counterexample option
bulwahn@43237
   335
  fun init _ () = error "Counterexample"
bulwahn@43237
   336
)
bulwahn@43237
   337
bulwahn@43237
   338
val put_existential_counterexample = Existential_Counterexample.put
bulwahn@43237
   339
bulwahn@42024
   340
val put_counterexample = Counterexample.put
bulwahn@42023
   341
bulwahn@43240
   342
fun finitize_functions (xTs, t) =
bulwahn@42024
   343
  let
bulwahn@43240
   344
    val (names, boundTs) = split_list xTs
bulwahn@42024
   345
    fun mk_eval_ffun dT rT =
bulwahn@42024
   346
      Const (@{const_name "Quickcheck_Narrowing.eval_ffun"}, 
bulwahn@42024
   347
        Type (@{type_name "Quickcheck_Narrowing.ffun"}, [dT, rT]) --> dT --> rT)
bulwahn@42024
   348
    fun mk_eval_cfun dT rT =
bulwahn@42024
   349
      Const (@{const_name "Quickcheck_Narrowing.eval_cfun"}, 
bulwahn@42024
   350
        Type (@{type_name "Quickcheck_Narrowing.cfun"}, [rT]) --> dT --> rT)
bulwahn@42024
   351
    fun eval_function (T as Type (@{type_name fun}, [dT, rT])) =
bulwahn@42024
   352
      let
bulwahn@42024
   353
        val (rt', rT') = eval_function rT
bulwahn@42024
   354
      in
bulwahn@42024
   355
        case dT of
bulwahn@42024
   356
          Type (@{type_name fun}, _) =>
wenzelm@44241
   357
            (fn t => absdummy dT (rt' (mk_eval_cfun dT rT' $ incr_boundvars 1 t $ Bound 0)),
wenzelm@44241
   358
              Type (@{type_name "Quickcheck_Narrowing.cfun"}, [rT']))
wenzelm@44241
   359
        | _ =>
wenzelm@44241
   360
            (fn t => absdummy dT (rt' (mk_eval_ffun dT rT' $ incr_boundvars 1 t $ Bound 0)),
wenzelm@44241
   361
              Type (@{type_name "Quickcheck_Narrowing.ffun"}, [dT, rT']))
bulwahn@42024
   362
      end
bulwahn@42024
   363
      | eval_function T = (I, T)
bulwahn@43240
   364
    val (tt, boundTs') = split_list (map eval_function boundTs)
bulwahn@43240
   365
    val t' = subst_bounds (map2 (fn f => fn x => f x) (rev tt) (map_index (Bound o fst) boundTs), t)
bulwahn@42024
   366
  in
bulwahn@43240
   367
    (names ~~ boundTs', t')
bulwahn@42024
   368
  end
bulwahn@42023
   369
bulwahn@45039
   370
fun dest_ffun (Type (@{type_name "Quickcheck_Narrowing.ffun"}, [dT, rT])) = (dT, rT)
bulwahn@45039
   371
bulwahn@45039
   372
fun eval_finite_functions (Const (@{const_name "Quickcheck_Narrowing.ffun.Constant"}, T) $ value) =
bulwahn@45039
   373
    absdummy (fst (dest_ffun (body_type T))) (eval_finite_functions value)
bulwahn@45039
   374
  | eval_finite_functions (Const (@{const_name "Quickcheck_Narrowing.ffun.Update"}, T) $ a $ b $ f) =
bulwahn@45039
   375
    let
bulwahn@45039
   376
      val (T1, T2) = dest_ffun (body_type T)
bulwahn@45039
   377
    in
bulwahn@45039
   378
      Quickcheck_Common.mk_fun_upd T1 T2
bulwahn@45039
   379
        (eval_finite_functions a, eval_finite_functions b) (eval_finite_functions f)
bulwahn@45039
   380
    end
bulwahn@45039
   381
  | eval_finite_functions t = t
bulwahn@45039
   382
bulwahn@43114
   383
(** tester **)
bulwahn@43237
   384
bulwahn@43237
   385
val rewrs =
bulwahn@43240
   386
    map (swap o HOLogic.dest_eq o HOLogic.dest_Trueprop o Thm.prop_of)
bulwahn@43240
   387
      (@{thms all_simps} @ @{thms ex_simps})
bulwahn@43240
   388
    @ map (HOLogic.dest_eq o HOLogic.dest_Trueprop o Thm.prop_of)
bulwahn@43240
   389
        [@{thm iff_conv_conj_imp}, @{thm not_ex}, @{thm not_all}]
bulwahn@43237
   390
bulwahn@43237
   391
fun make_pnf_term thy t = Pattern.rewrite_term thy rewrs [] t
bulwahn@43237
   392
bulwahn@43237
   393
fun strip_quantifiers (Const (@{const_name Ex}, _) $ Abs (x, T, t)) =
bulwahn@43237
   394
    apfst (cons (@{const_name Ex}, (x, T))) (strip_quantifiers t)
bulwahn@43237
   395
  | strip_quantifiers (Const (@{const_name All}, _) $ Abs (x, T, t)) =
bulwahn@43237
   396
    apfst (cons (@{const_name All}, (x, T))) (strip_quantifiers t)
bulwahn@43237
   397
  | strip_quantifiers t = ([], t)
bulwahn@43237
   398
bulwahn@43237
   399
fun contains_existentials t = exists (fn (Q, _) => Q = @{const_name Ex}) (fst (strip_quantifiers t))
bulwahn@43237
   400
bulwahn@43237
   401
fun mk_property qs t =
bulwahn@43237
   402
  let
bulwahn@43237
   403
    fun enclose (@{const_name Ex}, (x, T)) t =
bulwahn@43237
   404
        Const (@{const_name Quickcheck_Narrowing.exists}, (T --> @{typ property}) --> @{typ property})
bulwahn@43237
   405
          $ Abs (x, T, t)
bulwahn@43237
   406
      | enclose (@{const_name All}, (x, T)) t =
bulwahn@43237
   407
        Const (@{const_name Quickcheck_Narrowing.all}, (T --> @{typ property}) --> @{typ property})
bulwahn@43237
   408
          $ Abs (x, T, t)
bulwahn@43237
   409
  in
bulwahn@45002
   410
    fold_rev enclose qs (@{term Quickcheck_Narrowing.Property} $ t)
bulwahn@43237
   411
  end
bulwahn@43237
   412
bulwahn@43237
   413
fun mk_case_term ctxt p ((@{const_name Ex}, (x, T)) :: qs') (Existential_Counterexample cs) =
bulwahn@43317
   414
    Datatype.make_case ctxt Datatype_Case.Quiet [] (Free (x, T)) (map (fn (t, c) =>
bulwahn@43317
   415
      (t, mk_case_term ctxt (p - 1) qs' c)) cs)
bulwahn@43237
   416
  | mk_case_term ctxt p ((@{const_name All}, (x, T)) :: qs') (Universal_Counterexample (t, c)) =
bulwahn@43237
   417
    if p = 0 then t else mk_case_term ctxt (p - 1) qs' c
bulwahn@43237
   418
bulwahn@45039
   419
val post_process = (perhaps (try Quickcheck_Common.post_process_term)) o eval_finite_functions
bulwahn@45039
   420
bulwahn@43237
   421
fun mk_terms ctxt qs result =
bulwahn@43237
   422
  let
bulwahn@43237
   423
    val
bulwahn@43237
   424
      ps = filter (fn (_, (@{const_name All}, _)) => true | _ => false) (map_index I qs)
bulwahn@43237
   425
    in
bulwahn@43237
   426
      map (fn (p, (_, (x, T))) => (x, mk_case_term ctxt p qs result)) ps
bulwahn@45039
   427
      |> map (apsnd post_process)
bulwahn@43237
   428
    end
bulwahn@43237
   429
  
bulwahn@45418
   430
fun test_term ctxt (t, eval_terms) =
bulwahn@41905
   431
  let
bulwahn@43585
   432
    fun dest_result (Quickcheck.Result r) = r 
bulwahn@43585
   433
    val opts =
bulwahn@45756
   434
      ((not (Config.get ctxt Quickcheck.potential), Config.get ctxt Quickcheck.quiet),
bulwahn@45685
   435
        Config.get ctxt Quickcheck.size)
wenzelm@42361
   436
    val thy = Proof_Context.theory_of ctxt
bulwahn@43237
   437
    val t' = fold_rev (fn (x, T) => fn t => HOLogic.mk_all (x, T, t)) (Term.add_frees t []) t
bulwahn@43237
   438
    val pnf_t = make_pnf_term thy t'
bulwahn@41905
   439
  in
bulwahn@43237
   440
    if Config.get ctxt allow_existentials andalso contains_existentials pnf_t then
bulwahn@43237
   441
      let
bulwahn@43240
   442
        fun wrap f (qs, t) =
bulwahn@43240
   443
          let val (qs1, qs2) = split_list qs in
bulwahn@43240
   444
          apfst (map2 pair qs1) (f (qs2, t)) end
bulwahn@43240
   445
        val finitize = if Config.get ctxt finite_functions then wrap finitize_functions else I
bulwahn@43240
   446
        val (qs, prop_t) = finitize (strip_quantifiers pnf_t)
bulwahn@43585
   447
        val (counterexample, result) = dynamic_value_strict (true, opts)
bulwahn@45756
   448
          ((K true, fn _ => error ""), (Existential_Counterexample.get, Existential_Counterexample.put,
bulwahn@45756
   449
            "Narrowing_Generators.put_existential_counterexample"))
bulwahn@45002
   450
          thy (apfst o Option.map o map_counterexample) (mk_property qs prop_t)
bulwahn@43237
   451
      in
bulwahn@43585
   452
        Quickcheck.Result
bulwahn@45728
   453
         {counterexample = Option.map (pair true o mk_terms ctxt qs) counterexample,
bulwahn@43585
   454
          evaluation_terms = Option.map (K []) counterexample,
bulwahn@43585
   455
          timings = #timings (dest_result result), reports = #reports (dest_result result)}
bulwahn@43237
   456
      end
bulwahn@43240
   457
    else
bulwahn@43240
   458
      let
bulwahn@45756
   459
        val frees = Term.add_frees t []
bulwahn@45756
   460
        val t' = fold_rev absfree frees t
bulwahn@43240
   461
        fun wrap f t = list_abs (f (strip_abs t))
bulwahn@43240
   462
        val finitize = if Config.get ctxt finite_functions then wrap finitize_functions else I
bulwahn@43240
   463
        fun ensure_testable t =
bulwahn@43240
   464
          Const (@{const_name Quickcheck_Narrowing.ensure_testable}, fastype_of t --> fastype_of t) $ t
bulwahn@45756
   465
        fun is_genuine (SOME (true, _)) = true 
bulwahn@45756
   466
          | is_genuine _ = false
bulwahn@45756
   467
        val counterexample_of = Option.map (apsnd (curry (op ~~) (map fst frees) o map post_process))
bulwahn@43585
   468
        val (counterexample, result) = dynamic_value_strict (false, opts)
bulwahn@45756
   469
          ((is_genuine, counterexample_of),
bulwahn@45756
   470
            (Counterexample.get, Counterexample.put, "Narrowing_Generators.put_counterexample"))
bulwahn@45725
   471
          thy (apfst o Option.map o apsnd o map) (ensure_testable (finitize t'))
bulwahn@43240
   472
      in
bulwahn@43585
   473
        Quickcheck.Result
bulwahn@45756
   474
         {counterexample = counterexample_of counterexample,
bulwahn@43585
   475
          evaluation_terms = Option.map (K []) counterexample,
bulwahn@43585
   476
          timings = #timings (dest_result result), reports = #reports (dest_result result)}
bulwahn@43240
   477
      end
bulwahn@41905
   478
  end;
bulwahn@41905
   479
bulwahn@45419
   480
fun test_goals ctxt _ insts goals =
bulwahn@43314
   481
  if (not (getenv "ISABELLE_GHC" = "")) then
bulwahn@43314
   482
    let
bulwahn@45159
   483
      val correct_inst_goals = Quickcheck_Common.instantiate_goals ctxt insts goals
bulwahn@43314
   484
    in
bulwahn@45418
   485
      Quickcheck_Common.collect_results (test_term ctxt) (maps (map snd) correct_inst_goals) []
bulwahn@43314
   486
    end
bulwahn@43314
   487
  else
bulwahn@43314
   488
    (if Config.get ctxt Quickcheck.quiet then () else Output.urgent_message
bulwahn@43314
   489
      ("Environment variable ISABELLE_GHC is not set. To use narrowing-based quickcheck, please set "
bulwahn@43911
   490
        ^ "this variable to your GHC Haskell compiler in your settings file. "
bulwahn@43911
   491
        ^ "To deactivate narrowing-based quickcheck, set quickcheck_narrowing_active to false.");
bulwahn@43911
   492
      [Quickcheck.empty_result])
bulwahn@43114
   493
bulwahn@43047
   494
(* setup *)
bulwahn@41905
   495
bulwahn@44272
   496
val active = Attrib.setup_config_bool @{binding quickcheck_narrowing_active} (K true);
bulwahn@43878
   497
bulwahn@41905
   498
val setup =
bulwahn@43047
   499
  Code.datatype_interpretation ensure_partial_term_of
bulwahn@43047
   500
  #> Code.datatype_interpretation ensure_partial_term_of_code
bulwahn@43047
   501
  #> Datatype.interpretation (Quickcheck_Common.ensure_sort_datatype
bulwahn@42258
   502
    (((@{sort typerep}, @{sort term_of}), @{sort narrowing}), instantiate_narrowing_datatype))
bulwahn@43878
   503
  #> Context.theory_map (Quickcheck.add_tester ("narrowing", (active, test_goals)))
bulwahn@41905
   504
    
bulwahn@44272
   505
end;