src/HOL/Tools/inductive_codegen.ML
author wenzelm
Mon Aug 08 17:23:15 2011 +0200 (2011-08-08)
changeset 44058 ae85c5d64913
parent 43878 eeb10fdd9535
child 44121 44adaa6db327
permissions -rw-r--r--
misc tuning -- eliminated old-fashioned rep_thm;
haftmann@24584
     1
(*  Title:      HOL/Tools/inductive_codegen.ML
wenzelm@11539
     2
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11537
     3
wenzelm@11539
     4
Code generator for inductive predicates.
berghofe@11537
     5
*)
berghofe@11537
     6
berghofe@11537
     7
signature INDUCTIVE_CODEGEN =
berghofe@11537
     8
sig
wenzelm@42427
     9
  val add: string option -> int option -> attribute
wenzelm@42427
    10
  val poke_test_fn: (int * int * int -> term list option) -> unit
wenzelm@42427
    11
  val test_term: Proof.context -> (term * term list) list -> int list ->
wenzelm@42427
    12
    term list option * Quickcheck.report option
wenzelm@42427
    13
  val setup: theory -> theory
wenzelm@42427
    14
  val quickcheck_setup: theory -> theory
berghofe@11537
    15
end;
berghofe@11537
    16
haftmann@37390
    17
structure Inductive_Codegen : INDUCTIVE_CODEGEN =
berghofe@11537
    18
struct
berghofe@11537
    19
berghofe@12557
    20
(**** theory data ****)
berghofe@12557
    21
wenzelm@18930
    22
fun merge_rules tabs =
haftmann@22642
    23
  Symtab.join (fn _ => AList.merge (Thm.eq_thm_prop) (K true)) tabs;
wenzelm@18930
    24
wenzelm@33522
    25
structure CodegenData = Theory_Data
wenzelm@22846
    26
(
berghofe@15031
    27
  type T =
berghofe@22271
    28
    {intros : (thm * (string * int)) list Symtab.table,
berghofe@15031
    29
     graph : unit Graph.T,
berghofe@16645
    30
     eqns : (thm * string) list Symtab.table};
berghofe@15031
    31
  val empty =
berghofe@15031
    32
    {intros = Symtab.empty, graph = Graph.empty, eqns = Symtab.empty};
wenzelm@16424
    33
  val extend = I;
wenzelm@41472
    34
  fun merge
wenzelm@41472
    35
    ({intros = intros1, graph = graph1, eqns = eqns1},
wenzelm@41472
    36
      {intros = intros2, graph = graph2, eqns = eqns2}) : T =
wenzelm@18930
    37
    {intros = merge_rules (intros1, intros2),
berghofe@15031
    38
     graph = Graph.merge (K true) (graph1, graph2),
wenzelm@18930
    39
     eqns = merge_rules (eqns1, eqns2)};
wenzelm@22846
    40
);
berghofe@12557
    41
berghofe@12557
    42
wenzelm@42428
    43
fun warn thy thm =
wenzelm@42428
    44
  warning ("Inductive_Codegen: Not a proper clause:\n" ^
wenzelm@42428
    45
    Display.string_of_thm_global thy thm);
berghofe@11537
    46
wenzelm@33244
    47
fun add_node x g = Graph.new_node (x, ()) g handle Graph.DUP _ => g;
berghofe@14162
    48
berghofe@22271
    49
fun add optmod optnparms = Thm.declaration_attribute (fn thm => Context.mapping (fn thy =>
berghofe@16645
    50
  let
berghofe@16645
    51
    val {intros, graph, eqns} = CodegenData.get thy;
berghofe@16645
    52
    fun thyname_of s = (case optmod of
haftmann@27398
    53
      NONE => Codegen.thyname_of_const thy s | SOME s => s);
wenzelm@42428
    54
  in
wenzelm@42428
    55
    (case Option.map strip_comb (try HOLogic.dest_Trueprop (concl_of thm)) of
haftmann@38864
    56
      SOME (Const (@{const_name HOL.eq}, _), [t, _]) =>
wenzelm@35364
    57
        (case head_of t of
wenzelm@35364
    58
          Const (s, _) =>
wenzelm@35364
    59
            CodegenData.put {intros = intros, graph = graph,
wenzelm@35364
    60
               eqns = eqns |> Symtab.map_default (s, [])
wenzelm@35364
    61
                 (AList.update Thm.eq_thm_prop (thm, thyname_of s))} thy
wenzelm@42428
    62
        | _ => (warn thy thm; thy))
berghofe@22271
    63
    | SOME (Const (s, _), _) =>
berghofe@22271
    64
        let
wenzelm@29287
    65
          val cs = fold Term.add_const_names (Thm.prems_of thm) [];
berghofe@22271
    66
          val rules = Symtab.lookup_list intros s;
wenzelm@41489
    67
          val nparms =
wenzelm@41489
    68
            (case optnparms of
wenzelm@41489
    69
              SOME k => k
wenzelm@41489
    70
            | NONE =>
wenzelm@41489
    71
                (case rules of
wenzelm@41489
    72
                  [] =>
wenzelm@42361
    73
                    (case try (Inductive.the_inductive (Proof_Context.init_global thy)) s of
wenzelm@41489
    74
                      SOME (_, {raw_induct, ...}) =>
wenzelm@41489
    75
                        length (Inductive.params_of raw_induct)
wenzelm@41489
    76
                    | NONE => 0)
wenzelm@41489
    77
                | xs => snd (snd (List.last xs))))
berghofe@22271
    78
        in CodegenData.put
berghofe@22271
    79
          {intros = intros |>
haftmann@22642
    80
           Symtab.update (s, (AList.update Thm.eq_thm_prop
haftmann@22642
    81
             (thm, (thyname_of s, nparms)) rules)),
wenzelm@33338
    82
           graph = fold_rev (Graph.add_edge o pair s) cs (fold add_node (s :: cs) graph),
berghofe@22271
    83
           eqns = eqns} thy
berghofe@22271
    84
        end
wenzelm@42428
    85
    | _ => (warn thy thm; thy))
wenzelm@20897
    86
  end) I);
berghofe@12557
    87
berghofe@12557
    88
fun get_clauses thy s =
wenzelm@42428
    89
  let val {intros, graph, ...} = CodegenData.get thy in
wenzelm@42428
    90
    (case Symtab.lookup intros s of
wenzelm@42428
    91
      NONE =>
wenzelm@42428
    92
        (case try (Inductive.the_inductive (Proof_Context.init_global thy)) s of
wenzelm@42428
    93
          NONE => NONE
wenzelm@42428
    94
        | SOME ({names, ...}, {intrs, raw_induct, ...}) =>
wenzelm@42428
    95
            SOME (names, Codegen.thyname_of_const thy s,
wenzelm@42428
    96
              length (Inductive.params_of raw_induct),
wenzelm@42428
    97
              Codegen.preprocess thy intrs))
skalberg@15531
    98
    | SOME _ =>
berghofe@16645
    99
        let
berghofe@16645
   100
          val SOME names = find_first
haftmann@22642
   101
            (fn xs => member (op =) xs s) (Graph.strong_conn graph);
haftmann@22642
   102
          val intrs as (_, (thyname, nparms)) :: _ =
haftmann@22642
   103
            maps (the o Symtab.lookup intros) names;
wenzelm@42428
   104
        in SOME (names, thyname, nparms, Codegen.preprocess thy (map fst (rev intrs))) end)
berghofe@14162
   105
  end;
berghofe@12557
   106
berghofe@12557
   107
berghofe@11537
   108
(**** check if a term contains only constructor functions ****)
berghofe@11537
   109
berghofe@11537
   110
fun is_constrt thy =
berghofe@11537
   111
  let
haftmann@31784
   112
    val cnstrs = flat (maps
berghofe@11537
   113
      (map (fn (_, (_, _, cs)) => map (apsnd length) cs) o #descr o snd)
haftmann@33963
   114
      (Symtab.dest (Datatype_Data.get_all thy)));
wenzelm@42428
   115
    fun check t =
wenzelm@42428
   116
      (case strip_comb t of
berghofe@11537
   117
        (Var _, []) => true
wenzelm@42428
   118
      | (Const (s, _), ts) =>
wenzelm@42428
   119
          (case AList.lookup (op =) cnstrs s of
skalberg@15531
   120
            NONE => false
skalberg@15531
   121
          | SOME i => length ts = i andalso forall check ts)
wenzelm@42428
   122
      | _ => false);
berghofe@11537
   123
  in check end;
berghofe@11537
   124
wenzelm@42428
   125
berghofe@11537
   126
(**** check if a type is an equality type (i.e. doesn't contain fun) ****)
berghofe@11537
   127
berghofe@11537
   128
fun is_eqT (Type (s, Ts)) = s <> "fun" andalso forall is_eqT Ts
berghofe@11537
   129
  | is_eqT _ = true;
berghofe@11537
   130
wenzelm@42428
   131
berghofe@11537
   132
(**** mode inference ****)
berghofe@11537
   133
berghofe@15204
   134
fun string_of_mode (iss, is) = space_implode " -> " (map
skalberg@15531
   135
  (fn NONE => "X"
skalberg@15531
   136
    | SOME js => enclose "[" "]" (commas (map string_of_int js)))
skalberg@15531
   137
       (iss @ [SOME is]));
berghofe@15204
   138
wenzelm@41448
   139
fun print_modes modes = Codegen.message ("Inferred modes:\n" ^
wenzelm@26931
   140
  cat_lines (map (fn (s, ms) => s ^ ": " ^ commas (map
berghofe@33771
   141
    (fn (m, rnd) => string_of_mode m ^
berghofe@33771
   142
       (if rnd then " (random)" else "")) ms)) modes));
berghofe@15204
   143
wenzelm@29265
   144
val term_vs = map (fst o fst o dest_Var) o OldTerm.term_vars;
wenzelm@32952
   145
val terms_vs = distinct (op =) o maps term_vs;
berghofe@11537
   146
berghofe@11537
   147
(** collect all Vars in a term (with duplicates!) **)
wenzelm@16861
   148
fun term_vTs tm =
wenzelm@16861
   149
  fold_aterms (fn Var ((x, _), T) => cons (x, T) | _ => I) tm [];
berghofe@11537
   150
berghofe@11537
   151
fun get_args _ _ [] = ([], [])
haftmann@36692
   152
  | get_args is i (x::xs) = (if member (op =) is i then apfst else apsnd) (cons x)
berghofe@11537
   153
      (get_args is (i+1) xs);
berghofe@11537
   154
berghofe@11537
   155
fun merge xs [] = xs
berghofe@11537
   156
  | merge [] ys = ys
berghofe@11537
   157
  | merge (x::xs) (y::ys) = if length x >= length y then x::merge xs (y::ys)
berghofe@11537
   158
      else y::merge (x::xs) ys;
berghofe@11537
   159
berghofe@11537
   160
fun subsets i j = if i <= j then
berghofe@11537
   161
       let val is = subsets (i+1) j
berghofe@11537
   162
       in merge (map (fn ks => i::ks) is) is end
berghofe@11537
   163
     else [[]];
berghofe@11537
   164
berghofe@12557
   165
fun cprod ([], ys) = []
berghofe@12557
   166
  | cprod (x :: xs, ys) = map (pair x) ys @ cprod (xs, ys);
berghofe@12557
   167
wenzelm@30190
   168
fun cprods xss = List.foldr (map op :: o cprod) [[]] xss;
berghofe@12557
   169
berghofe@33771
   170
datatype mode = Mode of ((int list option list * int list) * bool) * int list * mode option list;
berghofe@33771
   171
berghofe@33771
   172
fun needs_random (Mode ((_, b), _, ms)) =
berghofe@33771
   173
  b orelse exists (fn NONE => false | SOME m => needs_random m) ms;
berghofe@12557
   174
berghofe@12557
   175
fun modes_of modes t =
berghofe@12557
   176
  let
berghofe@22271
   177
    val ks = 1 upto length (binder_types (fastype_of t));
berghofe@33771
   178
    val default = [Mode ((([], ks), false), ks, [])];
wenzelm@32952
   179
    fun mk_modes name args = Option.map
berghofe@33771
   180
     (maps (fn (m as ((iss, is), _)) =>
berghofe@22271
   181
        let
berghofe@22271
   182
          val (args1, args2) =
berghofe@22271
   183
            if length args < length iss then
berghofe@22271
   184
              error ("Too few arguments for inductive predicate " ^ name)
berghofe@22271
   185
            else chop (length iss) args;
berghofe@22271
   186
          val k = length args2;
berghofe@22271
   187
          val prfx = 1 upto k
berghofe@22271
   188
        in
berghofe@22271
   189
          if not (is_prefix op = prfx is) then [] else
berghofe@22271
   190
          let val is' = map (fn i => i - k) (List.drop (is, k))
berghofe@22271
   191
          in map (fn x => Mode (m, is', x)) (cprods (map
berghofe@22271
   192
            (fn (NONE, _) => [NONE]
wenzelm@33317
   193
              | (SOME js, arg) => map SOME (filter
berghofe@22271
   194
                  (fn Mode (_, js', _) => js=js') (modes_of modes arg)))
berghofe@22271
   195
                    (iss ~~ args1)))
berghofe@22271
   196
          end
berghofe@22271
   197
        end)) (AList.lookup op = modes name)
berghofe@12557
   198
wenzelm@42428
   199
  in
wenzelm@42428
   200
    (case strip_comb t of
haftmann@38864
   201
      (Const (@{const_name HOL.eq}, Type (_, [T, _])), _) =>
berghofe@33771
   202
        [Mode ((([], [1]), false), [1], []), Mode ((([], [2]), false), [2], [])] @
berghofe@33771
   203
        (if is_eqT T then [Mode ((([], [1, 2]), false), [1, 2], [])] else [])
berghofe@22271
   204
    | (Const (name, _), args) => the_default default (mk_modes name args)
berghofe@22271
   205
    | (Var ((name, _), _), args) => the (mk_modes name args)
berghofe@22271
   206
    | (Free (name, _), args) => the (mk_modes name args)
berghofe@22271
   207
    | _ => default)
berghofe@12557
   208
  end;
berghofe@12557
   209
berghofe@26806
   210
datatype indprem = Prem of term list * term * bool | Sidecond of term;
berghofe@12557
   211
berghofe@33771
   212
fun missing_vars vs ts = subtract (fn (x, ((y, _), _)) => x = y) vs
berghofe@33771
   213
  (fold Term.add_vars ts []);
berghofe@33771
   214
berghofe@33771
   215
fun monomorphic_vars vs = null (fold (Term.add_tvarsT o snd) vs []);
berghofe@33771
   216
berghofe@33771
   217
fun mode_ord p = int_ord (pairself (fn (Mode ((_, rnd), _, _), vs) =>
berghofe@33771
   218
  length vs + (if null vs then 0 else 1) + (if rnd then 1 else 0)) p);
berghofe@33771
   219
berghofe@11537
   220
fun select_mode_prem thy modes vs ps =
berghofe@33771
   221
  sort (mode_ord o pairself (hd o snd))
berghofe@33771
   222
    (filter_out (null o snd) (ps ~~ map
berghofe@33771
   223
      (fn Prem (us, t, is_set) => sort mode_ord
wenzelm@42429
   224
          (map_filter (fn m as Mode (_, is, _) =>
berghofe@33771
   225
            let
berghofe@33771
   226
              val (in_ts, out_ts) = get_args is 1 us;
berghofe@33771
   227
              val (out_ts', in_ts') = List.partition (is_constrt thy) out_ts;
berghofe@33771
   228
              val vTs = maps term_vTs out_ts';
berghofe@33771
   229
              val dupTs = map snd (duplicates (op =) vTs) @
berghofe@33771
   230
                map_filter (AList.lookup (op =) vTs) vs;
berghofe@33771
   231
              val missing_vs = missing_vars vs (t :: in_ts @ in_ts')
berghofe@33771
   232
            in
berghofe@33771
   233
              if forall (is_eqT o fastype_of) in_ts' andalso forall is_eqT dupTs
berghofe@33771
   234
                andalso monomorphic_vars missing_vs
berghofe@33771
   235
              then SOME (m, missing_vs)
berghofe@33771
   236
              else NONE
berghofe@33771
   237
            end)
berghofe@33771
   238
              (if is_set then [Mode ((([], []), false), [], [])]
berghofe@33771
   239
               else modes_of modes t handle Option =>
berghofe@33771
   240
                 error ("Bad predicate: " ^ Syntax.string_of_term_global thy t)))
berghofe@33771
   241
        | Sidecond t =>
berghofe@33771
   242
            let val missing_vs = missing_vars vs [t]
berghofe@33771
   243
            in
berghofe@33771
   244
              if monomorphic_vars missing_vs
berghofe@33771
   245
              then [(Mode ((([], []), false), [], []), missing_vs)]
berghofe@33771
   246
              else []
berghofe@33771
   247
            end)
berghofe@33771
   248
              ps));
berghofe@11537
   249
wenzelm@42411
   250
fun use_random codegen_mode = member (op =) codegen_mode "random_ind";
berghofe@33771
   251
wenzelm@42411
   252
fun check_mode_clause thy codegen_mode arg_vs modes ((iss, is), rnd) (ts, ps) =
berghofe@11537
   253
  let
wenzelm@32952
   254
    val modes' = modes @ map_filter
berghofe@33771
   255
      (fn (_, NONE) => NONE | (v, SOME js) => SOME (v, [(([], js), false)]))
berghofe@12557
   256
        (arg_vs ~~ iss);
berghofe@33771
   257
    fun check_mode_prems vs rnd [] = SOME (vs, rnd)
wenzelm@42428
   258
      | check_mode_prems vs rnd ps =
wenzelm@42428
   259
          (case select_mode_prem thy modes' vs ps of
wenzelm@42428
   260
            (x, (m, []) :: _) :: _ =>
wenzelm@42428
   261
              check_mode_prems
wenzelm@42428
   262
                (case x of Prem (us, _, _) => union (op =) vs (terms_vs us) | _ => vs)
wenzelm@42428
   263
                (rnd orelse needs_random m)
wenzelm@42428
   264
                (filter_out (equal x) ps)
wenzelm@42428
   265
          | (_, (_, vs') :: _) :: _ =>
wenzelm@42428
   266
              if use_random codegen_mode then
wenzelm@42428
   267
                check_mode_prems (union (op =) vs (map (fst o fst) vs')) true ps
wenzelm@42428
   268
              else NONE
wenzelm@42428
   269
          | _ => NONE);
skalberg@15570
   270
    val (in_ts, in_ts') = List.partition (is_constrt thy) (fst (get_args is 1 ts));
berghofe@11537
   271
    val in_vs = terms_vs in_ts;
berghofe@11537
   272
  in
berghofe@33771
   273
    if forall is_eqT (map snd (duplicates (op =) (maps term_vTs in_ts))) andalso
berghofe@33771
   274
      forall (is_eqT o fastype_of) in_ts'
wenzelm@42428
   275
    then
wenzelm@42428
   276
      (case check_mode_prems (union (op =) arg_vs in_vs) rnd ps of
wenzelm@42428
   277
        NONE => NONE
wenzelm@42428
   278
      | SOME (vs, rnd') =>
wenzelm@42428
   279
          let val missing_vs = missing_vars vs ts
wenzelm@42428
   280
          in
wenzelm@42428
   281
            if null missing_vs orelse
wenzelm@42428
   282
              use_random codegen_mode andalso monomorphic_vars missing_vs
wenzelm@42428
   283
            then SOME (rnd' orelse not (null missing_vs))
wenzelm@42428
   284
            else NONE
wenzelm@42428
   285
          end)
berghofe@33771
   286
    else NONE
berghofe@11537
   287
  end;
berghofe@11537
   288
wenzelm@42411
   289
fun check_modes_pred thy codegen_mode arg_vs preds modes (p, ms) =
wenzelm@42428
   290
  let val SOME rs = AList.lookup (op =) preds p in
wenzelm@42429
   291
    (p, map_filter (fn m as (m', _) =>
wenzelm@42428
   292
      let val xs = map (check_mode_clause thy codegen_mode arg_vs modes m) rs in
wenzelm@42428
   293
        (case find_index is_none xs of
wenzelm@42428
   294
          ~1 => SOME (m', exists (fn SOME b => b) xs)
wenzelm@42428
   295
        | i => (Codegen.message ("Clause " ^ string_of_int (i+1) ^ " of " ^
wenzelm@42428
   296
          p ^ " violates mode " ^ string_of_mode m'); NONE))
wenzelm@42428
   297
      end) ms)
berghofe@15204
   298
  end;
berghofe@11537
   299
berghofe@33771
   300
fun fixp f (x : (string * ((int list option list * int list) * bool) list) list) =
berghofe@11537
   301
  let val y = f x
berghofe@11537
   302
  in if x = y then x else fixp f y end;
berghofe@11537
   303
wenzelm@42411
   304
fun infer_modes thy codegen_mode extra_modes arities arg_vs preds = fixp (fn modes =>
wenzelm@42411
   305
  map (check_modes_pred thy codegen_mode arg_vs preds (modes @ extra_modes)) modes)
berghofe@33771
   306
    (map (fn (s, (ks, k)) => (s, map (rpair false) (cprod (cprods (map
skalberg@15531
   307
      (fn NONE => [NONE]
berghofe@22271
   308
        | SOME k' => map SOME (subsets 1 k')) ks),
berghofe@33771
   309
      subsets 1 k)))) arities);
berghofe@11537
   310
wenzelm@42428
   311
berghofe@11537
   312
(**** code generation ****)
berghofe@11537
   313
berghofe@11537
   314
fun mk_eq (x::xs) =
wenzelm@42428
   315
  let
wenzelm@42428
   316
    fun mk_eqs _ [] = []
wenzelm@42428
   317
      | mk_eqs a (b :: cs) = Codegen.str (a ^ " = " ^ b) :: mk_eqs b cs;
berghofe@11537
   318
  in mk_eqs x xs end;
berghofe@11537
   319
wenzelm@42428
   320
fun mk_tuple xs =
wenzelm@42428
   321
  Pretty.block (Codegen.str "(" ::
wenzelm@42428
   322
    flat (separate [Codegen.str ",", Pretty.brk 1] (map single xs)) @
wenzelm@42428
   323
    [Codegen.str ")"]);
berghofe@11537
   324
wenzelm@33244
   325
fun mk_v s (names, vs) =
wenzelm@33244
   326
  (case AList.lookup (op =) vs s of
wenzelm@33244
   327
    NONE => (s, (names, (s, [s])::vs))
wenzelm@33244
   328
  | SOME xs =>
wenzelm@43324
   329
      let val s' = singleton (Name.variant_list names) s
wenzelm@33244
   330
      in (s', (s'::names, AList.update (op =) (s, s'::xs) vs)) end);
berghofe@11537
   331
wenzelm@33244
   332
fun distinct_v (Var ((s, 0), T)) nvs =
wenzelm@33244
   333
      let val (s', nvs') = mk_v s nvs
wenzelm@33244
   334
      in (Var ((s', 0), T), nvs') end
wenzelm@33244
   335
  | distinct_v (t $ u) nvs =
berghofe@11537
   336
      let
wenzelm@33244
   337
        val (t', nvs') = distinct_v t nvs;
wenzelm@33244
   338
        val (u', nvs'') = distinct_v u nvs';
wenzelm@33244
   339
      in (t' $ u', nvs'') end
wenzelm@33244
   340
  | distinct_v t nvs = (t, nvs);
berghofe@11537
   341
berghofe@15061
   342
fun is_exhaustive (Var _) = true
haftmann@37390
   343
  | is_exhaustive (Const (@{const_name Pair}, _) $ t $ u) =
berghofe@15061
   344
      is_exhaustive t andalso is_exhaustive u
berghofe@15061
   345
  | is_exhaustive _ = false;
berghofe@15061
   346
berghofe@15061
   347
fun compile_match nvs eq_ps out_ps success_p can_fail =
wenzelm@41448
   348
  let val eqs = flat (separate [Codegen.str " andalso", Pretty.brk 1]
wenzelm@32952
   349
    (map single (maps (mk_eq o snd) nvs @ eq_ps)));
berghofe@11537
   350
  in
berghofe@11537
   351
    Pretty.block
wenzelm@41448
   352
     ([Codegen.str "(fn ", mk_tuple out_ps, Codegen.str " =>", Pretty.brk 1] @
wenzelm@41448
   353
      (Pretty.block ((if null eqs then [] else Codegen.str "if " ::
wenzelm@41448
   354
         [Pretty.block eqs, Pretty.brk 1, Codegen.str "then "]) @
berghofe@11537
   355
         (success_p ::
wenzelm@41448
   356
          (if null eqs then [] else [Pretty.brk 1, Codegen.str "else DSeq.empty"]))) ::
berghofe@15061
   357
       (if can_fail then
wenzelm@41448
   358
          [Pretty.brk 1, Codegen.str "| _ => DSeq.empty)"]
wenzelm@41448
   359
        else [Codegen.str ")"])))
berghofe@11537
   360
  end;
berghofe@11537
   361
berghofe@17144
   362
fun modename module s (iss, is) gr =
haftmann@38864
   363
  let val (id, gr') = if s = @{const_name HOL.eq} then (("", "equal"), gr)
wenzelm@41448
   364
    else Codegen.mk_const_id module s gr
haftmann@28537
   365
  in (space_implode "__"
wenzelm@41448
   366
    (Codegen.mk_qual_id module id ::
wenzelm@32952
   367
      map (space_implode "_" o map string_of_int) (map_filter I iss @ [is])), gr')
berghofe@17144
   368
  end;
berghofe@11537
   369
wenzelm@41448
   370
fun mk_funcomp brack s k p = (if brack then Codegen.parens else I)
wenzelm@41448
   371
  (Pretty.block [Pretty.block ((if k = 0 then [] else [Codegen.str "("]) @
wenzelm@41448
   372
    separate (Pretty.brk 1) (Codegen.str s :: replicate k (Codegen.str "|> ???")) @
wenzelm@41448
   373
    (if k = 0 then [] else [Codegen.str ")"])), Pretty.brk 1, p]);
berghofe@22271
   374
wenzelm@42411
   375
fun compile_expr thy codegen_mode defs dep module brack modes (NONE, t) gr =
wenzelm@42411
   376
      apfst single (Codegen.invoke_codegen thy codegen_mode defs dep module brack t gr)
wenzelm@42411
   377
  | compile_expr _ _ _ _ _ _ _ (SOME _, Var ((name, _), _)) gr =
wenzelm@41448
   378
      ([Codegen.str name], gr)
wenzelm@42428
   379
  | compile_expr thy codegen_mode
wenzelm@42428
   380
        defs dep module brack modes (SOME (Mode ((mode, _), _, ms)), t) gr =
berghofe@22271
   381
      (case strip_comb t of
wenzelm@42428
   382
        (Const (name, _), args) =>
wenzelm@42428
   383
          if name = @{const_name HOL.eq} orelse AList.defined op = modes name then
wenzelm@42428
   384
            let
wenzelm@42428
   385
              val (args1, args2) = chop (length ms) args;
wenzelm@42428
   386
              val ((ps, mode_id), gr') =
wenzelm@42428
   387
                gr |> fold_map
wenzelm@42428
   388
                  (compile_expr thy codegen_mode defs dep module true modes) (ms ~~ args1)
wenzelm@42428
   389
                ||>> modename module name mode;
wenzelm@42428
   390
               val (ps', gr'') =
wenzelm@42428
   391
                (case mode of
wenzelm@41448
   392
                   ([], []) => ([Codegen.str "()"], gr')
haftmann@28537
   393
                 | _ => fold_map
wenzelm@42428
   394
                     (Codegen.invoke_codegen thy codegen_mode defs dep module true) args2 gr');
wenzelm@42428
   395
             in
wenzelm@42428
   396
              ((if brack andalso not (null ps andalso null ps') then
wenzelm@42428
   397
                single o Codegen.parens o Pretty.block else I)
wenzelm@42428
   398
                  (flat (separate [Pretty.brk 1]
wenzelm@42428
   399
                    ([Codegen.str mode_id] :: ps @ map single ps'))), gr')
berghofe@22271
   400
             end
wenzelm@42428
   401
          else
wenzelm@42428
   402
            apfst (single o mk_funcomp brack "??" (length (binder_types (fastype_of t))))
wenzelm@42428
   403
              (Codegen.invoke_codegen thy codegen_mode defs dep module true t gr)
wenzelm@42428
   404
      | _ =>
wenzelm@42428
   405
        apfst (single o mk_funcomp brack "??" (length (binder_types (fastype_of t))))
wenzelm@42428
   406
          (Codegen.invoke_codegen thy codegen_mode defs dep module true t gr));
berghofe@12557
   407
wenzelm@42411
   408
fun compile_clause thy codegen_mode defs dep module all_vs arg_vs modes (iss, is) (ts, ps) inp gr =
berghofe@11537
   409
  let
wenzelm@32952
   410
    val modes' = modes @ map_filter
berghofe@33771
   411
      (fn (_, NONE) => NONE | (v, SOME js) => SOME (v, [(([], js), false)]))
berghofe@12557
   412
        (arg_vs ~~ iss);
berghofe@12557
   413
wenzelm@33244
   414
    fun check_constrt t (names, eqs) =
wenzelm@33244
   415
      if is_constrt thy t then (t, (names, eqs))
wenzelm@33244
   416
      else
wenzelm@43324
   417
        let val s = singleton (Name.variant_list names) "x";
wenzelm@33244
   418
        in (Var ((s, 0), fastype_of t), (s::names, (s, t)::eqs)) end;
berghofe@11537
   419
haftmann@28537
   420
    fun compile_eq (s, t) gr =
wenzelm@41448
   421
      apfst (Pretty.block o cons (Codegen.str (s ^ " = ")) o single)
wenzelm@42411
   422
        (Codegen.invoke_codegen thy codegen_mode defs dep module false t gr);
berghofe@15031
   423
berghofe@12557
   424
    val (in_ts, out_ts) = get_args is 1 ts;
wenzelm@33244
   425
    val (in_ts', (all_vs', eqs)) = fold_map check_constrt in_ts (all_vs, []);
berghofe@11537
   426
haftmann@28537
   427
    fun compile_prems out_ts' vs names [] gr =
berghofe@11537
   428
          let
wenzelm@33244
   429
            val (out_ps, gr2) =
wenzelm@42428
   430
              fold_map (Codegen.invoke_codegen thy codegen_mode defs dep module false)
wenzelm@42428
   431
                out_ts gr;
haftmann@28537
   432
            val (eq_ps, gr3) = fold_map compile_eq eqs gr2;
wenzelm@33244
   433
            val (out_ts'', (names', eqs')) = fold_map check_constrt out_ts' (names, []);
wenzelm@33244
   434
            val (out_ts''', nvs) =
wenzelm@33244
   435
              fold_map distinct_v out_ts'' (names', map (fn x => (x, [x])) vs);
wenzelm@33244
   436
            val (out_ps', gr4) =
wenzelm@42428
   437
              fold_map (Codegen.invoke_codegen thy codegen_mode defs dep module false)
wenzelm@42428
   438
                out_ts''' gr3;
haftmann@28537
   439
            val (eq_ps', gr5) = fold_map compile_eq eqs' gr4;
berghofe@33771
   440
            val vs' = distinct (op =) (flat (vs :: map term_vs out_ts'));
berghofe@33771
   441
            val missing_vs = missing_vars vs' out_ts;
berghofe@33771
   442
            val final_p = Pretty.block
wenzelm@41448
   443
              [Codegen.str "DSeq.single", Pretty.brk 1, mk_tuple out_ps]
berghofe@11537
   444
          in
berghofe@33771
   445
            if null missing_vs then
berghofe@33771
   446
              (compile_match (snd nvs) (eq_ps @ eq_ps') out_ps'
berghofe@33771
   447
                 final_p (exists (not o is_exhaustive) out_ts'''), gr5)
berghofe@33771
   448
            else
berghofe@33771
   449
              let
wenzelm@42428
   450
                val (pat_p, gr6) =
wenzelm@42428
   451
                  Codegen.invoke_codegen thy codegen_mode defs dep module true
wenzelm@42428
   452
                    (HOLogic.mk_tuple (map Var missing_vs)) gr5;
wenzelm@41448
   453
                val gen_p =
wenzelm@41448
   454
                  Codegen.mk_gen gr6 module true [] ""
wenzelm@42428
   455
                    (HOLogic.mk_tupleT (map snd missing_vs));
berghofe@33771
   456
              in
berghofe@33771
   457
                (compile_match (snd nvs) eq_ps' out_ps'
wenzelm@42428
   458
                  (Pretty.block [Codegen.str "DSeq.generator ", gen_p,
wenzelm@42428
   459
                    Codegen.str " :->", Pretty.brk 1,
wenzelm@42428
   460
                    compile_match [] eq_ps [pat_p] final_p false])
wenzelm@42428
   461
                  (exists (not o is_exhaustive) out_ts'''),
berghofe@33771
   462
                 gr6)
berghofe@33771
   463
              end
berghofe@11537
   464
          end
haftmann@28537
   465
      | compile_prems out_ts vs names ps gr =
berghofe@11537
   466
          let
haftmann@31852
   467
            val vs' = distinct (op =) (flat (vs :: map term_vs out_ts));
wenzelm@33244
   468
            val (out_ts', (names', eqs)) = fold_map check_constrt out_ts (names, []);
wenzelm@42428
   469
            val (out_ts'', nvs) =
wenzelm@42428
   470
              fold_map distinct_v out_ts' (names', map (fn x => (x, [x])) vs);
wenzelm@41448
   471
            val (out_ps, gr0) =
wenzelm@42428
   472
              fold_map (Codegen.invoke_codegen thy codegen_mode defs dep module false)
wenzelm@42428
   473
                out_ts'' gr;
haftmann@28537
   474
            val (eq_ps, gr1) = fold_map compile_eq eqs gr0;
berghofe@11537
   475
          in
berghofe@33771
   476
            (case hd (select_mode_prem thy modes' vs' ps) of
wenzelm@42428
   477
              (p as Prem (us, t, is_set), (mode as Mode (_, js, _), []) :: _) =>
wenzelm@42428
   478
                let
wenzelm@42428
   479
                  val ps' = filter_out (equal p) ps;
wenzelm@42428
   480
                  val (in_ts, out_ts''') = get_args js 1 us;
wenzelm@42428
   481
                  val (in_ps, gr2) =
wenzelm@42428
   482
                    fold_map (Codegen.invoke_codegen thy codegen_mode defs dep module true)
wenzelm@42428
   483
                      in_ts gr1;
wenzelm@42428
   484
                  val (ps, gr3) =
wenzelm@42428
   485
                    if not is_set then
wenzelm@42428
   486
                      apfst (fn ps => ps @
wenzelm@42428
   487
                          (if null in_ps then [] else [Pretty.brk 1]) @
wenzelm@42428
   488
                          separate (Pretty.brk 1) in_ps)
wenzelm@42428
   489
                        (compile_expr thy codegen_mode defs dep module false modes
wenzelm@42428
   490
                          (SOME mode, t) gr2)
wenzelm@42428
   491
                    else
wenzelm@42428
   492
                      apfst (fn p =>
wenzelm@42428
   493
                        Pretty.breaks [Codegen.str "DSeq.of_list", Codegen.str "(case", p,
wenzelm@42428
   494
                        Codegen.str "of", Codegen.str "Set", Codegen.str "xs", Codegen.str "=>",
wenzelm@42428
   495
                        Codegen.str "xs)"])
wenzelm@42428
   496
                        (*this is a very strong assumption about the generated code!*)
wenzelm@42428
   497
                        (Codegen.invoke_codegen thy codegen_mode defs dep module true t gr2);
haftmann@28537
   498
                   val (rest, gr4) = compile_prems out_ts''' vs' (fst nvs) ps' gr3;
berghofe@11537
   499
                 in
haftmann@28537
   500
                   (compile_match (snd nvs) eq_ps out_ps
wenzelm@42428
   501
                     (Pretty.block (ps @
wenzelm@42428
   502
                       [Codegen.str " :->", Pretty.brk 1, rest]))
wenzelm@42428
   503
                       (exists (not o is_exhaustive) out_ts''), gr4)
berghofe@11537
   504
                 end
wenzelm@42428
   505
            | (p as Sidecond t, [(_, [])]) =>
wenzelm@42428
   506
                let
wenzelm@42428
   507
                  val ps' = filter_out (equal p) ps;
wenzelm@42428
   508
                  val (side_p, gr2) =
wenzelm@42411
   509
                    Codegen.invoke_codegen thy codegen_mode defs dep module true t gr1;
wenzelm@42428
   510
                  val (rest, gr3) = compile_prems [] vs' (fst nvs) ps' gr2;
wenzelm@42428
   511
                in
wenzelm@42428
   512
                  (compile_match (snd nvs) eq_ps out_ps
wenzelm@42428
   513
                    (Pretty.block [Codegen.str "?? ", side_p,
wenzelm@42428
   514
                      Codegen.str " :->", Pretty.brk 1, rest])
wenzelm@42428
   515
                    (exists (not o is_exhaustive) out_ts''), gr3)
wenzelm@42428
   516
                end
wenzelm@42428
   517
            | (_, (_, missing_vs) :: _) =>
wenzelm@42428
   518
                let
wenzelm@42428
   519
                  val T = HOLogic.mk_tupleT (map snd missing_vs);
wenzelm@42428
   520
                  val (_, gr2) =
wenzelm@42411
   521
                    Codegen.invoke_tycodegen thy codegen_mode defs dep module false T gr1;
wenzelm@42428
   522
                  val gen_p = Codegen.mk_gen gr2 module true [] "" T;
wenzelm@42428
   523
                  val (rest, gr3) = compile_prems
wenzelm@42428
   524
                    [HOLogic.mk_tuple (map Var missing_vs)] vs' (fst nvs) ps gr2;
wenzelm@42428
   525
                in
wenzelm@42428
   526
                  (compile_match (snd nvs) eq_ps out_ps
wenzelm@42428
   527
                    (Pretty.block [Codegen.str "DSeq.generator", Pretty.brk 1,
wenzelm@42428
   528
                      gen_p, Codegen.str " :->", Pretty.brk 1, rest])
wenzelm@42428
   529
                    (exists (not o is_exhaustive) out_ts''), gr3)
wenzelm@42428
   530
                end)
berghofe@11537
   531
          end;
berghofe@11537
   532
haftmann@28537
   533
    val (prem_p, gr') = compile_prems in_ts' arg_vs all_vs' ps gr ;
berghofe@11537
   534
  in
wenzelm@41448
   535
    (Pretty.block [Codegen.str "DSeq.single", Pretty.brk 1, inp,
wenzelm@41448
   536
       Codegen.str " :->", Pretty.brk 1, prem_p], gr')
berghofe@11537
   537
  end;
berghofe@11537
   538
wenzelm@42411
   539
fun compile_pred thy codegen_mode defs dep module prfx all_vs arg_vs modes s cls mode gr =
berghofe@22271
   540
  let
wenzelm@41448
   541
    val xs = map Codegen.str (Name.variant_list arg_vs
berghofe@22271
   542
      (map (fn i => "x" ^ string_of_int i) (snd mode)));
haftmann@28537
   543
    val ((cl_ps, mode_id), gr') = gr |>
wenzelm@42411
   544
      fold_map (fn cl => compile_clause thy codegen_mode defs
haftmann@28537
   545
        dep module all_vs arg_vs modes mode cl (mk_tuple xs)) cls ||>>
berghofe@22271
   546
      modename module s mode
berghofe@11537
   547
  in
haftmann@28537
   548
    (Pretty.block
berghofe@11537
   549
      ([Pretty.block (separate (Pretty.brk 1)
wenzelm@41448
   550
         (Codegen.str (prfx ^ mode_id) ::
wenzelm@41448
   551
           map Codegen.str arg_vs @
wenzelm@41448
   552
           (case mode of ([], []) => [Codegen.str "()"] | _ => xs)) @
wenzelm@41448
   553
         [Codegen.str " ="]),
berghofe@11537
   554
        Pretty.brk 1] @
wenzelm@41448
   555
       flat (separate [Codegen.str " ++", Pretty.brk 1] (map single cl_ps))), (gr', "and "))
berghofe@11537
   556
  end;
berghofe@11537
   557
wenzelm@42411
   558
fun compile_preds thy codegen_mode defs dep module all_vs arg_vs modes preds gr =
haftmann@28537
   559
  let val (prs, (gr', _)) = fold_map (fn (s, cls) =>
wenzelm@42411
   560
    fold_map (fn (mode, _) => fn (gr', prfx') => compile_pred thy codegen_mode defs
haftmann@28537
   561
      dep module prfx' all_vs arg_vs modes s cls mode gr')
haftmann@28537
   562
        (((the o AList.lookup (op =) modes) s))) preds (gr, "fun ")
berghofe@11537
   563
  in
wenzelm@41448
   564
    (space_implode "\n\n" (map Codegen.string_of (flat prs)) ^ ";\n\n", gr')
berghofe@11537
   565
  end;
berghofe@11537
   566
berghofe@11537
   567
(**** processing of introduction rules ****)
berghofe@11537
   568
berghofe@12557
   569
exception Modes of
berghofe@33771
   570
  (string * ((int list option list * int list) * bool) list) list *
berghofe@22271
   571
  (string * (int option list * int)) list;
berghofe@12557
   572
wenzelm@32952
   573
fun lookup_modes gr dep = apfst flat (apsnd flat (ListPair.unzip
wenzelm@41448
   574
  (map ((fn (SOME (Modes x), _, _) => x | _ => ([], [])) o Codegen.get_node gr)
berghofe@17144
   575
    (Graph.all_preds (fst gr) [dep]))));
berghofe@12557
   576
wenzelm@41448
   577
fun print_arities arities = Codegen.message ("Arities:\n" ^
wenzelm@26931
   578
  cat_lines (map (fn (s, (ks, k)) => s ^ ": " ^
berghofe@12557
   579
    space_implode " -> " (map
berghofe@22271
   580
      (fn NONE => "X" | SOME k' => string_of_int k')
berghofe@22271
   581
        (ks @ [SOME k]))) arities));
berghofe@11537
   582
wenzelm@41448
   583
fun prep_intrs intrs =
wenzelm@44058
   584
  map (Codegen.rename_term o Thm.prop_of o Drule.export_without_context) intrs;
berghofe@15031
   585
berghofe@15031
   586
fun constrain cs [] = []
wenzelm@33244
   587
  | constrain cs ((s, xs) :: ys) =
wenzelm@33244
   588
      (s,
wenzelm@42428
   589
        (case AList.lookup (op =) cs (s : string) of
wenzelm@33244
   590
          NONE => xs
wenzelm@42428
   591
        | SOME xs' => inter (op = o apfst fst) xs' xs)) :: constrain cs ys;
berghofe@15031
   592
wenzelm@42411
   593
fun mk_extra_defs thy codegen_mode defs gr dep names module ts =
wenzelm@33244
   594
  fold (fn name => fn gr =>
haftmann@36692
   595
    if member (op =) names name then gr
wenzelm@33244
   596
    else
wenzelm@33244
   597
      (case get_clauses thy name of
skalberg@15531
   598
        NONE => gr
berghofe@22271
   599
      | SOME (names, thyname, nparms, intrs) =>
wenzelm@42411
   600
          mk_ind_def thy codegen_mode defs gr dep names
wenzelm@42411
   601
            (Codegen.if_library codegen_mode thyname module)
berghofe@22271
   602
            [] (prep_intrs intrs) nparms))
wenzelm@33244
   603
    (fold Term.add_const_names ts []) gr
berghofe@12557
   604
wenzelm@42411
   605
and mk_ind_def thy codegen_mode defs gr dep names module modecs intrs nparms =
wenzelm@41448
   606
  Codegen.add_edge_acyclic (hd names, dep) gr handle
berghofe@24129
   607
    Graph.CYCLES (xs :: _) =>
haftmann@37390
   608
      error ("Inductive_Codegen: illegal cyclic dependencies:\n" ^ commas xs)
berghofe@24129
   609
  | Graph.UNDEF _ =>
berghofe@11537
   610
    let
berghofe@22271
   611
      val _ $ u = Logic.strip_imp_concl (hd intrs);
berghofe@22271
   612
      val args = List.take (snd (strip_comb u), nparms);
wenzelm@32952
   613
      val arg_vs = maps term_vs args;
berghofe@15031
   614
haftmann@36692
   615
      fun get_nparms s = if member (op =) names s then SOME nparms else
berghofe@22271
   616
        Option.map #3 (get_clauses thy s);
berghofe@11537
   617
haftmann@37677
   618
      fun dest_prem (_ $ (Const (@{const_name Set.member}, _) $ t $ u)) =
wenzelm@35364
   619
            Prem ([t], Envir.beta_eta_contract u, true)
haftmann@38864
   620
        | dest_prem (_ $ ((eq as Const (@{const_name HOL.eq}, _)) $ t $ u)) =
wenzelm@35364
   621
            Prem ([t, u], eq, false)
berghofe@22271
   622
        | dest_prem (_ $ t) =
berghofe@22271
   623
            (case strip_comb t of
wenzelm@42428
   624
              (v as Var _, ts) =>
wenzelm@42428
   625
                if member (op =) args v then Prem (ts, v, false) else Sidecond t
wenzelm@35364
   626
            | (c as Const (s, _), ts) =>
wenzelm@35364
   627
                (case get_nparms s of
wenzelm@35364
   628
                  NONE => Sidecond t
wenzelm@35364
   629
                | SOME k =>
wenzelm@35364
   630
                    let val (ts1, ts2) = chop k ts
wenzelm@35364
   631
                    in Prem (ts2, list_comb (c, ts1), false) end)
wenzelm@35364
   632
            | _ => Sidecond t);
berghofe@22271
   633
berghofe@22271
   634
      fun add_clause intr (clauses, arities) =
berghofe@11537
   635
        let
berghofe@22271
   636
          val _ $ t = Logic.strip_imp_concl intr;
berghofe@22271
   637
          val (Const (name, T), ts) = strip_comb t;
berghofe@22271
   638
          val (ts1, ts2) = chop nparms ts;
berghofe@22271
   639
          val prems = map dest_prem (Logic.strip_imp_prems intr);
berghofe@22271
   640
          val (Ts, Us) = chop nparms (binder_types T)
berghofe@11537
   641
        in
berghofe@22271
   642
          (AList.update op = (name, these (AList.lookup op = clauses name) @
berghofe@22271
   643
             [(ts2, prems)]) clauses,
wenzelm@42428
   644
           AList.update op = (name, (map (fn U =>
wenzelm@42428
   645
              (case strip_type U of
wenzelm@42428
   646
                (Rs as _ :: _, @{typ bool}) => SOME (length Rs)
wenzelm@42428
   647
              | _ => NONE)) Ts,
berghofe@22271
   648
             length Us)) arities)
berghofe@11537
   649
        end;
berghofe@11537
   650
wenzelm@42411
   651
      val gr' = mk_extra_defs thy codegen_mode defs
wenzelm@41448
   652
        (Codegen.add_edge (hd names, dep)
wenzelm@41448
   653
          (Codegen.new_node (hd names, (NONE, "", "")) gr)) (hd names) names module intrs;
berghofe@22271
   654
      val (extra_modes, extra_arities) = lookup_modes gr' (hd names);
berghofe@22271
   655
      val (clauses, arities) = fold add_clause intrs ([], []);
berghofe@15031
   656
      val modes = constrain modecs
wenzelm@42411
   657
        (infer_modes thy codegen_mode extra_modes arities arg_vs clauses);
berghofe@22271
   658
      val _ = print_arities arities;
berghofe@11537
   659
      val _ = print_modes modes;
wenzelm@42428
   660
      val (s, gr'') =
wenzelm@42428
   661
        compile_preds thy codegen_mode defs (hd names) module (terms_vs intrs)
wenzelm@42428
   662
          arg_vs (modes @ extra_modes) clauses gr';
berghofe@11537
   663
    in
wenzelm@41448
   664
      (Codegen.map_node (hd names)
berghofe@22271
   665
        (K (SOME (Modes (modes, arities)), module, s)) gr'')
berghofe@16645
   666
    end;
berghofe@11537
   667
wenzelm@42428
   668
fun find_mode gr dep s u modes is =
wenzelm@42428
   669
  (case find_first (fn Mode (_, js, _) => is = js) (modes_of modes u handle Option => []) of
wenzelm@42428
   670
    NONE =>
wenzelm@42428
   671
      Codegen.codegen_error gr dep
wenzelm@42428
   672
        ("No such mode for " ^ s ^ ": " ^ string_of_mode ([], is))
wenzelm@42428
   673
  | mode => mode);
berghofe@15031
   674
wenzelm@42411
   675
fun mk_ind_call thy codegen_mode defs dep module is_query s T ts names thyname k intrs gr =
berghofe@22271
   676
  let
berghofe@22271
   677
    val (ts1, ts2) = chop k ts;
berghofe@22271
   678
    val u = list_comb (Const (s, T), ts1);
berghofe@22271
   679
wenzelm@42428
   680
    fun mk_mode (Const (@{const_name dummy_pattern}, _)) ((ts, mode), i) =
wenzelm@42428
   681
          ((ts, mode), i + 1)
wenzelm@33244
   682
      | mk_mode t ((ts, mode), i) = ((ts @ [t], mode @ [i]), i + 1);
berghofe@11537
   683
wenzelm@42411
   684
    val module' = Codegen.if_library codegen_mode thyname module;
wenzelm@42428
   685
    val gr1 =
wenzelm@42428
   686
      mk_extra_defs thy codegen_mode defs
wenzelm@42428
   687
        (mk_ind_def thy codegen_mode defs gr dep names module'
wenzelm@42428
   688
        [] (prep_intrs intrs) k) dep names module' [u];
berghofe@22271
   689
    val (modes, _) = lookup_modes gr1 dep;
wenzelm@33244
   690
    val (ts', is) =
wenzelm@33244
   691
      if is_query then fst (fold mk_mode ts2 (([], []), 1))
berghofe@22271
   692
      else (ts2, 1 upto length (binder_types T) - k);
berghofe@22271
   693
    val mode = find_mode gr1 dep s u modes is;
berghofe@33771
   694
    val _ = if is_query orelse not (needs_random (the mode)) then ()
berghofe@33771
   695
      else warning ("Illegal use of random data generators in " ^ s);
wenzelm@42411
   696
    val (in_ps, gr2) =
wenzelm@42428
   697
      fold_map (Codegen.invoke_codegen thy codegen_mode defs dep module true)
wenzelm@42428
   698
        ts' gr1;
wenzelm@42428
   699
    val (ps, gr3) =
wenzelm@42428
   700
      compile_expr thy codegen_mode defs dep module false modes (mode, u) gr2;
berghofe@22271
   701
  in
haftmann@28537
   702
    (Pretty.block (ps @ (if null in_ps then [] else [Pretty.brk 1]) @
haftmann@28537
   703
       separate (Pretty.brk 1) in_ps), gr3)
berghofe@22271
   704
  end;
berghofe@15031
   705
berghofe@15031
   706
fun clause_of_eqn eqn =
berghofe@15031
   707
  let
berghofe@15031
   708
    val (t, u) = HOLogic.dest_eq (HOLogic.dest_Trueprop (concl_of eqn));
berghofe@15031
   709
    val (Const (s, T), ts) = strip_comb t;
berghofe@15031
   710
    val (Ts, U) = strip_type T
berghofe@15031
   711
  in
wenzelm@41448
   712
    Codegen.rename_term (Logic.list_implies (prems_of eqn, HOLogic.mk_Trueprop
berghofe@22271
   713
      (list_comb (Const (s ^ "_aux", Ts @ [U] ---> HOLogic.boolT), ts @ [u]))))
berghofe@15031
   714
  end;
berghofe@15031
   715
wenzelm@42411
   716
fun mk_fun thy codegen_mode defs name eqns dep module module' gr =
wenzelm@42428
   717
  (case try (Codegen.get_node gr) name of
berghofe@17144
   718
    NONE =>
wenzelm@42428
   719
      let
wenzelm@42428
   720
        val clauses = map clause_of_eqn eqns;
wenzelm@42428
   721
        val pname = name ^ "_aux";
wenzelm@42428
   722
        val arity =
wenzelm@42428
   723
          length (snd (strip_comb (fst (HOLogic.dest_eq
wenzelm@42428
   724
            (HOLogic.dest_Trueprop (concl_of (hd eqns)))))));
wenzelm@42428
   725
        val mode = 1 upto arity;
wenzelm@42428
   726
        val ((fun_id, mode_id), gr') = gr |>
wenzelm@42428
   727
          Codegen.mk_const_id module' name ||>>
wenzelm@42428
   728
          modename module' pname ([], mode);
wenzelm@42428
   729
        val vars = map (fn i => Codegen.str ("x" ^ string_of_int i)) mode;
wenzelm@42428
   730
        val s = Codegen.string_of (Pretty.block
wenzelm@42428
   731
          [Codegen.mk_app false (Codegen.str ("fun " ^ snd fun_id)) vars, Codegen.str " =",
wenzelm@42428
   732
           Pretty.brk 1, Codegen.str "DSeq.hd", Pretty.brk 1,
wenzelm@42428
   733
           Codegen.parens (Pretty.block (separate (Pretty.brk 1) (Codegen.str mode_id ::
wenzelm@42428
   734
             vars)))]) ^ ";\n\n";
wenzelm@42428
   735
        val gr'' = mk_ind_def thy codegen_mode defs (Codegen.add_edge (name, dep)
wenzelm@42428
   736
          (Codegen.new_node (name, (NONE, module', s)) gr')) name [pname] module'
wenzelm@42428
   737
          [(pname, [([], mode)])] clauses 0;
wenzelm@42428
   738
        val (modes, _) = lookup_modes gr'' dep;
wenzelm@42428
   739
        val _ = find_mode gr'' dep pname (head_of (HOLogic.dest_Trueprop
wenzelm@42428
   740
          (Logic.strip_imp_concl (hd clauses)))) modes mode
wenzelm@42428
   741
      in (Codegen.mk_qual_id module fun_id, gr'') end
berghofe@17144
   742
  | SOME _ =>
wenzelm@42428
   743
      (Codegen.mk_qual_id module (Codegen.get_const_id gr name),
wenzelm@42428
   744
        Codegen.add_edge (name, dep) gr));
berghofe@15031
   745
berghofe@23761
   746
(* convert n-tuple to nested pairs *)
berghofe@23761
   747
berghofe@23761
   748
fun conv_ntuple fs ts p =
berghofe@23761
   749
  let
berghofe@23761
   750
    val k = length fs;
wenzelm@41448
   751
    val xs = map_range (fn i => Codegen.str ("x" ^ string_of_int i)) (k + 1);
berghofe@23761
   752
    val xs' = map (fn Bound i => nth xs (k - i)) ts;
berghofe@23761
   753
    fun conv xs js =
haftmann@36692
   754
      if member (op =) fs js then
berghofe@23761
   755
        let
berghofe@23761
   756
          val (p, xs') = conv xs (1::js);
berghofe@23761
   757
          val (q, xs'') = conv xs' (2::js)
berghofe@23761
   758
        in (mk_tuple [p, q], xs'') end
berghofe@23761
   759
      else (hd xs, tl xs)
berghofe@23761
   760
  in
berghofe@23761
   761
    if k > 0 then
berghofe@23761
   762
      Pretty.block
wenzelm@41448
   763
        [Codegen.str "DSeq.map (fn", Pretty.brk 1,
wenzelm@41448
   764
         mk_tuple xs', Codegen.str " =>", Pretty.brk 1, fst (conv xs []),
wenzelm@41448
   765
         Codegen.str ")", Pretty.brk 1, Codegen.parens p]
berghofe@23761
   766
    else p
berghofe@23761
   767
  end;
berghofe@23761
   768
wenzelm@42428
   769
fun inductive_codegen thy codegen_mode defs dep module brack t gr =
wenzelm@42428
   770
  (case strip_comb t of
wenzelm@35364
   771
    (Const (@{const_name Collect}, _), [u]) =>
wenzelm@42428
   772
      let val (r, Ts, fs) = HOLogic.strip_psplits u in
wenzelm@42428
   773
        (case strip_comb r of
berghofe@23761
   774
          (Const (s, T), ts) =>
wenzelm@41448
   775
            (case (get_clauses thy s, Codegen.get_assoc_code thy (s, T)) of
berghofe@23761
   776
              (SOME (names, thyname, k, intrs), NONE) =>
berghofe@23761
   777
                let
berghofe@23761
   778
                  val (ts1, ts2) = chop k ts;
berghofe@23761
   779
                  val ts2' = map
haftmann@34962
   780
                    (fn Bound i => Term.dummy_pattern (nth Ts (length Ts - i - 1)) | t => t) ts2;
berghofe@23761
   781
                  val (ots, its) = List.partition is_Bound ts2;
wenzelm@42428
   782
                  val closed = forall (not o Term.is_open);
berghofe@23761
   783
                in
berghofe@23761
   784
                  if null (duplicates op = ots) andalso
wenzelm@42083
   785
                    closed ts1 andalso closed its
berghofe@23761
   786
                  then
wenzelm@42428
   787
                    let
wenzelm@42428
   788
                      val (call_p, gr') =
wenzelm@42428
   789
                        mk_ind_call thy codegen_mode defs dep module true
wenzelm@42428
   790
                          s T (ts1 @ ts2') names thyname k intrs gr;
wenzelm@42428
   791
                    in
wenzelm@42428
   792
                      SOME ((if brack then Codegen.parens else I) (Pretty.block
wenzelm@42428
   793
                        [Codegen.str "Set", Pretty.brk 1, Codegen.str "(DSeq.list_of", Pretty.brk 1,
wenzelm@42428
   794
                         Codegen.str "(", conv_ntuple fs ots call_p, Codegen.str "))"]),
wenzelm@42428
   795
                         (*this is a very strong assumption about the generated code!*)
wenzelm@42428
   796
                         gr')
berghofe@23761
   797
                    end
berghofe@23761
   798
                  else NONE
berghofe@23761
   799
                end
berghofe@23761
   800
            | _ => NONE)
wenzelm@42428
   801
        | _ => NONE)
berghofe@23761
   802
      end
wenzelm@41448
   803
  | (Const (s, T), ts) =>
wenzelm@42428
   804
      (case Symtab.lookup (#eqns (CodegenData.get thy)) s of
wenzelm@42428
   805
        NONE =>
wenzelm@42428
   806
          (case (get_clauses thy s, Codegen.get_assoc_code thy (s, T)) of
wenzelm@42428
   807
            (SOME (names, thyname, k, intrs), NONE) =>
wenzelm@42428
   808
              if length ts < k then NONE else
wenzelm@42428
   809
                SOME
wenzelm@42428
   810
                  (let
wenzelm@42428
   811
                    val (call_p, gr') = mk_ind_call thy codegen_mode defs dep module false
wenzelm@42428
   812
                      s T (map Term.no_dummy_patterns ts) names thyname k intrs gr
wenzelm@42428
   813
                   in
wenzelm@42428
   814
                    (mk_funcomp brack "?!"
wenzelm@42428
   815
                      (length (binder_types T) - length ts) (Codegen.parens call_p), gr')
wenzelm@42428
   816
                   end
wenzelm@42428
   817
                   handle TERM _ =>
wenzelm@42428
   818
                    mk_ind_call thy codegen_mode defs dep module true
wenzelm@42428
   819
                      s T ts names thyname k intrs gr)
wenzelm@42428
   820
          | _ => NONE)
wenzelm@42428
   821
      | SOME eqns =>
wenzelm@42428
   822
          let
wenzelm@42428
   823
            val (_, thyname) :: _ = eqns;
wenzelm@42428
   824
            val (id, gr') =
wenzelm@42428
   825
              mk_fun thy codegen_mode defs s (Codegen.preprocess thy (map fst (rev eqns)))
wenzelm@42428
   826
                dep module (Codegen.if_library codegen_mode thyname module) gr;
wenzelm@42428
   827
            val (ps, gr'') =
wenzelm@42428
   828
              fold_map (Codegen.invoke_codegen thy codegen_mode defs dep module true)
wenzelm@42428
   829
                ts gr';
wenzelm@42428
   830
          in SOME (Codegen.mk_app brack (Codegen.str id) ps, gr'') end)
berghofe@22271
   831
  | _ => NONE);
berghofe@11537
   832
berghofe@12557
   833
val setup =
wenzelm@41448
   834
  Codegen.add_codegen "inductive" inductive_codegen #>
wenzelm@33244
   835
  Attrib.setup @{binding code_ind}
wenzelm@33244
   836
    (Scan.lift (Scan.option (Args.$$$ "target" |-- Args.colon |-- Args.name) --
wenzelm@36960
   837
      Scan.option (Args.$$$ "params" |-- Args.colon |-- Parse.nat) >> uncurry add))
haftmann@31998
   838
    "introduction rules for executable predicates";
berghofe@11537
   839
wenzelm@42427
   840
berghofe@33771
   841
(**** Quickcheck involving inductive predicates ****)
berghofe@33771
   842
wenzelm@42427
   843
structure Result = Proof_Data
wenzelm@42427
   844
(
wenzelm@42427
   845
  type T = int * int * int -> term list option;
wenzelm@42427
   846
  fun init _ = (fn _ => NONE);
wenzelm@42427
   847
);
wenzelm@42427
   848
wenzelm@42427
   849
val get_test_fn = Result.get;
wenzelm@42427
   850
fun poke_test_fn f = Context.>> (Context.map_proof (Result.put f));
wenzelm@42427
   851
berghofe@33771
   852
berghofe@33771
   853
fun strip_imp p =
berghofe@33771
   854
  let val (q, r) = HOLogic.dest_imp p
berghofe@33771
   855
  in strip_imp r |>> cons q end
berghofe@33771
   856
  handle TERM _ => ([], p);
berghofe@33771
   857
berghofe@33771
   858
fun deepen bound f i =
berghofe@33771
   859
  if i > bound then NONE
wenzelm@42428
   860
  else
wenzelm@42428
   861
    (case f i of
berghofe@33771
   862
      NONE => deepen bound f (i + 1)
berghofe@33771
   863
    | SOME x => SOME x);
berghofe@33771
   864
bulwahn@43878
   865
val active = Attrib.setup_config_bool @{binding quickcheck_inductive_SML_active} (K false);
bulwahn@43878
   866
    
wenzelm@42616
   867
val depth_bound = Attrib.setup_config_int @{binding ind_quickcheck_depth} (K 10);
wenzelm@42616
   868
val depth_start = Attrib.setup_config_int @{binding ind_quickcheck_depth_start} (K 1);
wenzelm@42616
   869
val random_values = Attrib.setup_config_int @{binding ind_quickcheck_random} (K 5);
wenzelm@42616
   870
val size_offset = Attrib.setup_config_int @{binding ind_quickcheck_size_offset} (K 0);
berghofe@33771
   871
bulwahn@42159
   872
fun test_term ctxt [(t, [])] =
wenzelm@42427
   873
      let
wenzelm@42427
   874
        val t' = list_abs_free (Term.add_frees t [], t)
wenzelm@42427
   875
        val thy = Proof_Context.theory_of ctxt;
wenzelm@42427
   876
        val (xs, p) = strip_abs t';
wenzelm@42427
   877
        val args' = map_index (fn (i, (_, T)) => ("arg" ^ string_of_int i, T)) xs;
wenzelm@42427
   878
        val args = map Free args';
wenzelm@42427
   879
        val (ps, q) = strip_imp p;
wenzelm@42427
   880
        val Ts = map snd xs;
wenzelm@42427
   881
        val T = Ts ---> HOLogic.boolT;
wenzelm@42427
   882
        val rl = Logic.list_implies
wenzelm@42427
   883
          (map (HOLogic.mk_Trueprop o curry subst_bounds (rev args)) ps @
wenzelm@42427
   884
           [HOLogic.mk_Trueprop (HOLogic.mk_not (subst_bounds (rev args, q)))],
wenzelm@42427
   885
           HOLogic.mk_Trueprop (list_comb (Free ("quickcheckp", T), args)));
wenzelm@42427
   886
        val (_, thy') = Inductive.add_inductive_global
wenzelm@42427
   887
          {quiet_mode=true, verbose=false, alt_name=Binding.empty, coind=false,
wenzelm@42427
   888
           no_elim=true, no_ind=false, skip_mono=false, fork_mono=false}
wenzelm@43619
   889
          [((@{binding quickcheckp}, T), NoSyn)] []
wenzelm@42427
   890
          [(Attrib.empty_binding, rl)] [] (Theory.copy thy);
wenzelm@42427
   891
        val pred = HOLogic.mk_Trueprop (list_comb
wenzelm@42427
   892
          (Const (Sign.intern_const thy' "quickcheckp", T),
wenzelm@42427
   893
           map Term.dummy_pattern Ts));
wenzelm@42427
   894
        val (code, gr) =
wenzelm@42427
   895
          Codegen.generate_code_i thy' ["term_of", "test", "random_ind"] [] "Generated"
wenzelm@42427
   896
            [("testf", pred)];
wenzelm@42427
   897
        val s = "structure Test_Term =\nstruct\n\n" ^
wenzelm@42427
   898
          cat_lines (map snd code) ^
wenzelm@42427
   899
          "\nopen Generated;\n\n" ^ Codegen.string_of
wenzelm@42427
   900
            (Pretty.block [Codegen.str "val () = Inductive_Codegen.poke_test_fn",
wenzelm@42427
   901
              Pretty.brk 1, Codegen.str "(fn p =>", Pretty.brk 1,
wenzelm@42427
   902
              Codegen.str "case Seq.pull (testf p) of", Pretty.brk 1,
wenzelm@42427
   903
              Codegen.str "SOME ",
wenzelm@42427
   904
              mk_tuple [mk_tuple (map (Codegen.str o fst) args'), Codegen.str "_"],
wenzelm@42427
   905
              Codegen.str " =>", Pretty.brk 1, Codegen.str "SOME ",
wenzelm@42427
   906
              Pretty.enum "," "[" "]"
wenzelm@42427
   907
                (map (fn (s, T) => Pretty.block
wenzelm@42427
   908
                  [Codegen.mk_term_of gr "Generated" false T, Pretty.brk 1, Codegen.str s]) args'),
wenzelm@42427
   909
              Pretty.brk 1,
wenzelm@42427
   910
              Codegen.str "| NONE => NONE);"]) ^
wenzelm@42427
   911
          "\n\nend;\n";
wenzelm@42427
   912
        val test_fn =
wenzelm@42427
   913
          ctxt
wenzelm@42427
   914
          |> Context.proof_map
wenzelm@42427
   915
              (ML_Context.exec (fn () => ML_Context.eval_text false Position.none s))
wenzelm@42427
   916
          |> get_test_fn;
wenzelm@42427
   917
        val values = Config.get ctxt random_values;
wenzelm@42427
   918
        val bound = Config.get ctxt depth_bound;
wenzelm@42427
   919
        val start = Config.get ctxt depth_start;
wenzelm@42427
   920
        val offset = Config.get ctxt size_offset;
wenzelm@42427
   921
        fun test [k] = (deepen bound (fn i =>
wenzelm@42427
   922
          (Output.urgent_message ("Search depth: " ^ string_of_int i);
wenzelm@42427
   923
           test_fn (i, values, k+offset))) start, NONE);
wenzelm@42427
   924
      in test end
wenzelm@42427
   925
  | test_term ctxt [_] = error "Option eval is not supported by tester SML_inductive"
wenzelm@42427
   926
  | test_term ctxt _ =
wenzelm@42427
   927
      error "Compilation of multiple instances is not supported by tester SML_inductive";
berghofe@33771
   928
bulwahn@43877
   929
val test_goal = Quickcheck.generator_test_goal_terms test_term;
bulwahn@43877
   930
berghofe@33771
   931
val quickcheck_setup =
bulwahn@43878
   932
  Context.theory_map (Quickcheck.add_tester ("SML_inductive", (active, test_goal)));
berghofe@33771
   933
berghofe@11537
   934
end;