src/Pure/codegen.ML
author berghofe
Fri Jul 09 16:23:57 2004 +0200 (2004-07-09)
changeset 15029 a4d0ed993050
parent 14981 e73f8140af78
child 15261 ba3c9fdbace3
permissions -rw-r--r--
- Removed obsolete clause in function check_str
- test_term now temporarily sets print_mode to [] as well
berghofe@11520
     1
(*  Title:      Pure/codegen.ML
berghofe@11520
     2
    ID:         $Id$
wenzelm@11539
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11520
     4
wenzelm@11539
     5
Generic code generator.
berghofe@11520
     6
*)
berghofe@11520
     7
berghofe@11520
     8
signature CODEGEN =
berghofe@11520
     9
sig
berghofe@11520
    10
  val quiet_mode : bool ref
berghofe@11520
    11
  val message : string -> unit
berghofe@13753
    12
  val mode : string list ref
berghofe@13886
    13
  val margin : int ref
berghofe@11520
    14
berghofe@12452
    15
  datatype 'a mixfix =
berghofe@11520
    16
      Arg
berghofe@11520
    17
    | Ignore
berghofe@11520
    18
    | Pretty of Pretty.T
berghofe@12452
    19
    | Quote of 'a;
berghofe@11520
    20
berghofe@12452
    21
  type 'a codegen
berghofe@12452
    22
berghofe@12452
    23
  val add_codegen: string -> term codegen -> theory -> theory
berghofe@12452
    24
  val add_tycodegen: string -> typ codegen -> theory -> theory
berghofe@14197
    25
  val add_attribute: string -> (Args.T list -> theory attribute * Args.T list) -> theory -> theory
berghofe@11520
    26
  val print_codegens: theory -> unit
berghofe@11520
    27
  val generate_code: theory -> (string * string) list -> string
berghofe@11520
    28
  val generate_code_i: theory -> (string * term) list -> string
berghofe@12452
    29
  val assoc_consts: (xstring * string option * term mixfix list) list -> theory -> theory
berghofe@12452
    30
  val assoc_consts_i: (xstring * typ option * term mixfix list) list -> theory -> theory
berghofe@12452
    31
  val assoc_types: (xstring * typ mixfix list) list -> theory -> theory
berghofe@12452
    32
  val get_assoc_code: theory -> string -> typ -> term mixfix list option
berghofe@12452
    33
  val get_assoc_type: theory -> string -> typ mixfix list option
berghofe@12452
    34
  val invoke_codegen: theory -> string -> bool ->
berghofe@12452
    35
    (exn option * string) Graph.T * term -> (exn option * string) Graph.T * Pretty.T
berghofe@12452
    36
  val invoke_tycodegen: theory -> string -> bool ->
berghofe@12452
    37
    (exn option * string) Graph.T * typ -> (exn option * string) Graph.T * Pretty.T
berghofe@14858
    38
  val mk_id: string -> string
berghofe@11520
    39
  val mk_const_id: Sign.sg -> string -> string
berghofe@11520
    40
  val mk_type_id: Sign.sg -> string -> string
berghofe@11520
    41
  val rename_term: term -> term
berghofe@11520
    42
  val get_defn: theory -> string -> typ -> ((term list * term) * int option) option
berghofe@11520
    43
  val is_instance: theory -> typ -> typ -> bool
berghofe@11520
    44
  val parens: Pretty.T -> Pretty.T
berghofe@11520
    45
  val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
berghofe@11520
    46
  val eta_expand: term -> term list -> int -> term
berghofe@14105
    47
  val strip_tname: string -> string
berghofe@13753
    48
  val mk_type: bool -> typ -> Pretty.T
berghofe@13753
    49
  val mk_term_of: Sign.sg -> bool -> typ -> Pretty.T
berghofe@14105
    50
  val mk_gen: Sign.sg -> bool -> string list -> string -> typ -> Pretty.T
berghofe@14105
    51
  val test_fn: (int -> (string * term) list option) ref
berghofe@14105
    52
  val test_term: theory -> int -> int -> term -> (string * term) list option
berghofe@12452
    53
  val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
berghofe@11520
    54
  val parsers: OuterSyntax.parser list
berghofe@11520
    55
  val setup: (theory -> theory) list
berghofe@11520
    56
end;
berghofe@11520
    57
berghofe@11520
    58
structure Codegen : CODEGEN =
berghofe@11520
    59
struct
berghofe@11520
    60
berghofe@11520
    61
val quiet_mode = ref true;
berghofe@11520
    62
fun message s = if !quiet_mode then () else writeln s;
berghofe@11520
    63
berghofe@13753
    64
val mode = ref ([] : string list);
berghofe@13753
    65
berghofe@13886
    66
val margin = ref 80;
berghofe@13886
    67
berghofe@11520
    68
(**** Mixfix syntax ****)
berghofe@11520
    69
berghofe@12452
    70
datatype 'a mixfix =
berghofe@11520
    71
    Arg
berghofe@11520
    72
  | Ignore
berghofe@11520
    73
  | Pretty of Pretty.T
berghofe@12452
    74
  | Quote of 'a;
berghofe@11520
    75
berghofe@11520
    76
fun is_arg Arg = true
berghofe@11520
    77
  | is_arg Ignore = true
berghofe@11520
    78
  | is_arg _ = false;
berghofe@11520
    79
berghofe@12452
    80
fun quotes_of [] = []
berghofe@12452
    81
  | quotes_of (Quote q :: ms) = q :: quotes_of ms
berghofe@12452
    82
  | quotes_of (_ :: ms) = quotes_of ms;
berghofe@12452
    83
berghofe@12452
    84
fun args_of [] xs = ([], xs)
berghofe@12452
    85
  | args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
berghofe@12452
    86
  | args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
berghofe@12452
    87
  | args_of (_ :: ms) xs = args_of ms xs;
berghofe@11520
    88
wenzelm@12490
    89
fun num_args x = length (filter is_arg x);
berghofe@11520
    90
berghofe@11520
    91
berghofe@11520
    92
(**** theory data ****)
berghofe@11520
    93
berghofe@14105
    94
(* type of code generators *)
berghofe@11520
    95
berghofe@12452
    96
type 'a codegen = theory -> (exn option * string) Graph.T ->
berghofe@12452
    97
  string -> bool -> 'a -> ((exn option * string) Graph.T * Pretty.T) option;
berghofe@12452
    98
berghofe@14105
    99
(* parameters for random testing *)
berghofe@14105
   100
berghofe@14105
   101
type test_params =
berghofe@14105
   102
  {size: int, iterations: int, default_type: typ option};
berghofe@14105
   103
berghofe@14105
   104
fun merge_test_params
berghofe@14105
   105
  {size = size1, iterations = iterations1, default_type = default_type1}
berghofe@14105
   106
  {size = size2, iterations = iterations2, default_type = default_type2} =
berghofe@14105
   107
  {size = Int.max (size1, size2),
berghofe@14105
   108
   iterations = Int.max (iterations1, iterations2),
berghofe@14105
   109
   default_type = case default_type1 of
berghofe@14105
   110
       None => default_type2
berghofe@14105
   111
     | _ => default_type1};
berghofe@14105
   112
berghofe@14105
   113
val default_test_params : test_params =
berghofe@14105
   114
  {size = 10, iterations = 100, default_type = None};
berghofe@14105
   115
berghofe@14105
   116
fun set_size size ({iterations, default_type, ...} : test_params) =
berghofe@14105
   117
  {size = size, iterations = iterations, default_type = default_type};
berghofe@14105
   118
berghofe@14105
   119
fun set_iterations iterations ({size, default_type, ...} : test_params) =
berghofe@14105
   120
  {size = size, iterations = iterations, default_type = default_type};
berghofe@14105
   121
berghofe@14105
   122
fun set_default_type s sg ({size, iterations, ...} : test_params) =
berghofe@14105
   123
  {size = size, iterations = iterations,
berghofe@14105
   124
   default_type = Some (typ_of (read_ctyp sg s))};
berghofe@14105
   125
berghofe@14105
   126
(* data kind 'Pure/codegen' *)
berghofe@14105
   127
 
berghofe@11520
   128
structure CodegenArgs =
berghofe@11520
   129
struct
berghofe@11520
   130
  val name = "Pure/codegen";
berghofe@11520
   131
  type T =
berghofe@12452
   132
    {codegens : (string * term codegen) list,
berghofe@12452
   133
     tycodegens : (string * typ codegen) list,
berghofe@12452
   134
     consts : ((string * typ) * term mixfix list) list,
berghofe@12555
   135
     types : (string * typ mixfix list) list,
berghofe@14197
   136
     attrs: (string * (Args.T list -> theory attribute * Args.T list)) list,
berghofe@14105
   137
     test_params: test_params};
berghofe@11520
   138
berghofe@12555
   139
  val empty =
berghofe@14105
   140
    {codegens = [], tycodegens = [], consts = [], types = [], attrs = [],
berghofe@14105
   141
     test_params = default_test_params};
berghofe@11520
   142
  val copy = I;
berghofe@11520
   143
  val prep_ext = I;
berghofe@11520
   144
berghofe@12555
   145
  fun merge
berghofe@12555
   146
    ({codegens = codegens1, tycodegens = tycodegens1,
berghofe@14105
   147
      consts = consts1, types = types1, attrs = attrs1,
berghofe@14105
   148
      test_params = test_params1},
berghofe@12555
   149
     {codegens = codegens2, tycodegens = tycodegens2,
berghofe@14105
   150
      consts = consts2, types = types2, attrs = attrs2,
berghofe@14105
   151
      test_params = test_params2}) =
berghofe@11520
   152
    {codegens = rev (merge_alists (rev codegens1) (rev codegens2)),
berghofe@12452
   153
     tycodegens = rev (merge_alists (rev tycodegens1) (rev tycodegens2)),
berghofe@12555
   154
     consts = merge_alists consts1 consts2,
berghofe@12555
   155
     types = merge_alists types1 types2,
berghofe@14105
   156
     attrs = merge_alists attrs1 attrs2,
berghofe@14105
   157
     test_params = merge_test_params test_params1 test_params2};
berghofe@11520
   158
berghofe@12452
   159
  fun print sg ({codegens, tycodegens, ...} : T) =
berghofe@12452
   160
    Pretty.writeln (Pretty.chunks
berghofe@12452
   161
      [Pretty.strs ("term code generators:" :: map fst codegens),
berghofe@12452
   162
       Pretty.strs ("type code generators:" :: map fst tycodegens)]);
berghofe@11520
   163
end;
berghofe@11520
   164
berghofe@11520
   165
structure CodegenData = TheoryDataFun(CodegenArgs);
berghofe@11520
   166
val print_codegens = CodegenData.print;
berghofe@11520
   167
berghofe@11520
   168
berghofe@14105
   169
(**** access parameters for random testing ****)
berghofe@14105
   170
berghofe@14105
   171
fun get_test_params thy = #test_params (CodegenData.get thy);
berghofe@14105
   172
berghofe@14105
   173
fun map_test_params f thy =
berghofe@14105
   174
  let val {codegens, tycodegens, consts, types, attrs, test_params} =
berghofe@14105
   175
    CodegenData.get thy;
berghofe@14105
   176
  in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
berghofe@14105
   177
    consts = consts, types = types, attrs = attrs,
berghofe@14105
   178
    test_params = f test_params} thy
berghofe@14105
   179
  end;
berghofe@14105
   180
berghofe@14105
   181
berghofe@12452
   182
(**** add new code generators to theory ****)
berghofe@11520
   183
berghofe@11520
   184
fun add_codegen name f thy =
berghofe@14105
   185
  let val {codegens, tycodegens, consts, types, attrs, test_params} =
berghofe@14105
   186
    CodegenData.get thy
berghofe@11520
   187
  in (case assoc (codegens, name) of
berghofe@12452
   188
      None => CodegenData.put {codegens = (name, f) :: codegens,
berghofe@12555
   189
        tycodegens = tycodegens, consts = consts, types = types,
berghofe@14105
   190
        attrs = attrs, test_params = test_params} thy
berghofe@12452
   191
    | Some _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@12452
   192
  end;
berghofe@12452
   193
berghofe@12452
   194
fun add_tycodegen name f thy =
berghofe@14105
   195
  let val {codegens, tycodegens, consts, types, attrs, test_params} =
berghofe@14105
   196
    CodegenData.get thy
berghofe@12452
   197
  in (case assoc (tycodegens, name) of
berghofe@12452
   198
      None => CodegenData.put {tycodegens = (name, f) :: tycodegens,
berghofe@12555
   199
        codegens = codegens, consts = consts, types = types,
berghofe@14105
   200
        attrs = attrs, test_params = test_params} thy
berghofe@11520
   201
    | Some _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@11520
   202
  end;
berghofe@11520
   203
berghofe@11520
   204
berghofe@12555
   205
(**** code attribute ****)
berghofe@12555
   206
berghofe@12555
   207
fun add_attribute name att thy =
berghofe@14105
   208
  let val {codegens, tycodegens, consts, types, attrs, test_params} =
berghofe@14105
   209
    CodegenData.get thy
berghofe@12555
   210
  in (case assoc (attrs, name) of
berghofe@12555
   211
      None => CodegenData.put {tycodegens = tycodegens,
berghofe@12555
   212
        codegens = codegens, consts = consts, types = types,
berghofe@14105
   213
        attrs = (name, att) :: attrs, test_params = test_params} thy
berghofe@12555
   214
    | Some _ => error ("Code attribute " ^ name ^ " already declared"))
berghofe@12555
   215
  end;
berghofe@12555
   216
berghofe@14197
   217
fun mk_parser (a, p) = (if a = "" then Scan.succeed "" else Args.$$$ a) |-- p;
berghofe@14197
   218
berghofe@12555
   219
val code_attr =
berghofe@14197
   220
  Attrib.syntax (Scan.depend (fn thy => foldr op || (map mk_parser
berghofe@14197
   221
    (#attrs (CodegenData.get thy)), Scan.fail) >> pair thy));
berghofe@12555
   222
berghofe@12555
   223
berghofe@11520
   224
(**** associate constants with target language code ****)
berghofe@11520
   225
berghofe@11520
   226
fun gen_assoc_consts prep_type xs thy = foldl (fn (thy, (s, tyopt, syn)) =>
berghofe@11520
   227
  let
berghofe@11520
   228
    val sg = sign_of thy;
berghofe@14105
   229
    val {codegens, tycodegens, consts, types, attrs, test_params} =
berghofe@14105
   230
      CodegenData.get thy;
berghofe@11520
   231
    val cname = Sign.intern_const sg s;
berghofe@11520
   232
  in
berghofe@11520
   233
    (case Sign.const_type sg cname of
berghofe@11520
   234
       Some T =>
berghofe@11520
   235
         let val T' = (case tyopt of
berghofe@11520
   236
                None => T
berghofe@11520
   237
              | Some ty =>
berghofe@11520
   238
                  let val U = prep_type sg ty
wenzelm@14769
   239
                  in if Sign.typ_instance sg (U, T) then U
berghofe@11520
   240
                    else error ("Illegal type constraint for constant " ^ cname)
berghofe@11520
   241
                  end)
berghofe@11520
   242
         in (case assoc (consts, (cname, T')) of
berghofe@11520
   243
             None => CodegenData.put {codegens = codegens,
berghofe@12452
   244
               tycodegens = tycodegens,
berghofe@12555
   245
               consts = ((cname, T'), syn) :: consts,
berghofe@14105
   246
               types = types, attrs = attrs, test_params = test_params} thy
berghofe@11520
   247
           | Some _ => error ("Constant " ^ cname ^ " already associated with code"))
berghofe@11520
   248
         end
berghofe@11520
   249
     | _ => error ("Not a constant: " ^ s))
berghofe@11520
   250
  end) (thy, xs);
berghofe@11520
   251
berghofe@11520
   252
val assoc_consts_i = gen_assoc_consts (K I);
berghofe@11520
   253
val assoc_consts = gen_assoc_consts (fn sg => typ_of o read_ctyp sg);
berghofe@11520
   254
berghofe@11520
   255
(**** associate types with target language types ****)
berghofe@11520
   256
berghofe@11520
   257
fun assoc_types xs thy = foldl (fn (thy, (s, syn)) =>
berghofe@11520
   258
  let
berghofe@14105
   259
    val {codegens, tycodegens, consts, types, attrs, test_params} =
berghofe@14105
   260
      CodegenData.get thy;
berghofe@11520
   261
    val tc = Sign.intern_tycon (sign_of thy) s
berghofe@11520
   262
  in
berghofe@11520
   263
    (case assoc (types, tc) of
berghofe@12452
   264
       None => CodegenData.put {codegens = codegens,
berghofe@12452
   265
         tycodegens = tycodegens, consts = consts,
berghofe@14105
   266
         types = (tc, syn) :: types, attrs = attrs,
berghofe@14105
   267
         test_params = test_params} thy
berghofe@11520
   268
     | Some _ => error ("Type " ^ tc ^ " already associated with code"))
berghofe@11520
   269
  end) (thy, xs);
berghofe@11520
   270
berghofe@12452
   271
fun get_assoc_type thy s = assoc (#types (CodegenData.get thy), s);
wenzelm@11546
   272
berghofe@11520
   273
berghofe@11520
   274
(**** make valid ML identifiers ****)
berghofe@11520
   275
berghofe@14858
   276
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
berghofe@14858
   277
  Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
berghofe@14858
   278
berghofe@14858
   279
fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of
berghofe@14858
   280
    ("<" :: "^" :: xs, ">") => (true, implode xs)
berghofe@14858
   281
  | ("<" :: xs, ">") => (false, implode xs)
berghofe@14858
   282
  | _ => sys_error "dest_sym");
berghofe@14858
   283
  
berghofe@14858
   284
fun mk_id s = if s = "" then "" else
berghofe@11520
   285
  let
berghofe@14858
   286
    fun check_str [] = []
berghofe@14858
   287
      | check_str xs = (case take_prefix is_ascii_letdig xs of
berghofe@14858
   288
          ([], " " :: zs) => check_str zs
berghofe@14858
   289
        | ([], z :: zs) =>
berghofe@14858
   290
          if size z = 1 then string_of_int (ord z) :: check_str zs
berghofe@14858
   291
          else (case dest_sym z of
berghofe@14858
   292
              (true, "isub") => check_str zs
berghofe@14858
   293
            | (true, "isup") => "" :: check_str zs
berghofe@14858
   294
            | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
berghofe@14858
   295
        | (ys, zs) => implode ys :: check_str zs);
berghofe@14858
   296
    val s' = space_implode "_"
berghofe@14858
   297
      (flat (map (check_str o Symbol.explode) (NameSpace.unpack s)))
berghofe@11520
   298
  in
berghofe@14858
   299
    if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
berghofe@11520
   300
  end;
berghofe@11520
   301
berghofe@14858
   302
fun mk_const_id sg s =
berghofe@14858
   303
  let val s' = mk_id (Sign.cond_extern sg Sign.constK s)
berghofe@14858
   304
  in if s' mem ThmDatabase.ml_reserved then s' ^ "_const" else s' end;
berghofe@13073
   305
berghofe@14858
   306
fun mk_type_id sg s =
berghofe@14858
   307
  let val s' = mk_id (Sign.cond_extern sg Sign.typeK s)
berghofe@14858
   308
  in if s' mem ThmDatabase.ml_reserved then s' ^ "_type" else s' end;
berghofe@11520
   309
berghofe@13731
   310
fun rename_terms ts =
berghofe@11520
   311
  let
berghofe@13731
   312
    val names = foldr add_term_names
berghofe@13731
   313
      (ts, map (fst o fst) (Drule.vars_of_terms ts));
berghofe@14858
   314
    val reserved = names inter ThmDatabase.ml_reserved;
berghofe@14858
   315
    val (illegal, alt_names) = split_list (mapfilter (fn s =>
berghofe@14858
   316
      let val s' = mk_id s in if s = s' then None else Some (s, s') end) names)
berghofe@14858
   317
    val ps = (reserved @ illegal) ~~
berghofe@14858
   318
      variantlist (map (suffix "'") reserved @ alt_names, names);
berghofe@11520
   319
berghofe@14858
   320
    fun rename_id s = if_none (assoc (ps, s)) s;
berghofe@14858
   321
berghofe@14858
   322
    fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
berghofe@14858
   323
      | rename (Free (a, T)) = Free (rename_id a, T)
berghofe@11520
   324
      | rename (Abs (s, T, t)) = Abs (s, T, rename t)
berghofe@11520
   325
      | rename (t $ u) = rename t $ rename u
berghofe@11520
   326
      | rename t = t;
berghofe@11520
   327
  in
berghofe@13731
   328
    map rename ts
berghofe@13731
   329
  end;
berghofe@13731
   330
berghofe@13731
   331
val rename_term = hd o rename_terms o single;
berghofe@13731
   332
berghofe@13731
   333
berghofe@13731
   334
(**** retrieve definition of constant ****)
berghofe@13731
   335
berghofe@13731
   336
fun is_instance thy T1 T2 =
wenzelm@14769
   337
  Sign.typ_instance (sign_of thy) (T1, Type.varifyT T2);
berghofe@13731
   338
berghofe@13731
   339
fun get_assoc_code thy s T = apsome snd (find_first (fn ((s', T'), _) =>
berghofe@13731
   340
  s = s' andalso is_instance thy T T') (#consts (CodegenData.get thy)));
berghofe@13731
   341
berghofe@13731
   342
fun get_defn thy s T =
berghofe@13731
   343
  let
berghofe@13731
   344
    val axms = flat (map (Symtab.dest o #axioms o Theory.rep_theory)
berghofe@13731
   345
      (thy :: Theory.ancestors_of thy));
berghofe@13731
   346
    val defs = mapfilter (fn (_, t) =>
berghofe@13731
   347
      (let
berghofe@13731
   348
         val (lhs, rhs) = Logic.dest_equals t;
berghofe@13731
   349
         val (c, args) = strip_comb lhs;
berghofe@13731
   350
         val (s', T') = dest_Const c
berghofe@13731
   351
       in if s=s' then Some (T', split_last (rename_terms (args @ [rhs])))
berghofe@13731
   352
         else None end) handle TERM _ => None) axms;
berghofe@13731
   353
    val i = find_index (is_instance thy T o fst) defs
berghofe@13731
   354
  in
berghofe@13731
   355
    if i>=0 then Some (snd (nth_elem (i, defs)),
berghofe@13731
   356
      if length defs = 1 then None else Some i)
berghofe@13731
   357
    else None
berghofe@11520
   358
  end;
berghofe@11520
   359
berghofe@11520
   360
berghofe@12452
   361
(**** invoke suitable code generator for term / type ****)
berghofe@11520
   362
berghofe@12452
   363
fun invoke_codegen thy dep brack (gr, t) = (case get_first
berghofe@11520
   364
   (fn (_, f) => f thy gr dep brack t) (#codegens (CodegenData.get thy)) of
berghofe@11520
   365
      None => error ("Unable to generate code for term:\n" ^
berghofe@11520
   366
        Sign.string_of_term (sign_of thy) t ^ "\nrequired by:\n" ^
berghofe@11520
   367
        commas (Graph.all_succs gr [dep]))
berghofe@12452
   368
    | Some x => x);
berghofe@12452
   369
berghofe@12452
   370
fun invoke_tycodegen thy dep brack (gr, T) = (case get_first
berghofe@12452
   371
   (fn (_, f) => f thy gr dep brack T) (#tycodegens (CodegenData.get thy)) of
berghofe@12452
   372
      None => error ("Unable to generate code for type:\n" ^
berghofe@12452
   373
        Sign.string_of_typ (sign_of thy) T ^ "\nrequired by:\n" ^
berghofe@12452
   374
        commas (Graph.all_succs gr [dep]))
berghofe@12452
   375
    | Some x => x);
berghofe@11520
   376
berghofe@11520
   377
berghofe@11520
   378
(**** code generator for mixfix expressions ****)
berghofe@11520
   379
berghofe@11520
   380
fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"];
berghofe@11520
   381
berghofe@11520
   382
fun pretty_fn [] p = [p]
berghofe@11520
   383
  | pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") ::
berghofe@11520
   384
      Pretty.brk 1 :: pretty_fn xs p;
berghofe@11520
   385
berghofe@11520
   386
fun pretty_mixfix [] [] _ = []
berghofe@11520
   387
  | pretty_mixfix (Arg :: ms) (p :: ps) qs = p :: pretty_mixfix ms ps qs
berghofe@12452
   388
  | pretty_mixfix (Ignore :: ms) ps qs = pretty_mixfix ms ps qs
berghofe@11520
   389
  | pretty_mixfix (Pretty p :: ms) ps qs = p :: pretty_mixfix ms ps qs
berghofe@12452
   390
  | pretty_mixfix (Quote _ :: ms) ps (q :: qs) = q :: pretty_mixfix ms ps qs;
berghofe@11520
   391
berghofe@11520
   392
berghofe@12452
   393
(**** default code generators ****)
berghofe@11520
   394
berghofe@11520
   395
fun eta_expand t ts i =
berghofe@11520
   396
  let
berghofe@11520
   397
    val (Ts, _) = strip_type (fastype_of t);
berghofe@11520
   398
    val j = i - length ts
berghofe@11520
   399
  in
berghofe@11520
   400
    foldr (fn (T, t) => Abs ("x", T, t))
berghofe@11520
   401
      (take (j, Ts), list_comb (t, ts @ map Bound (j-1 downto 0)))
berghofe@11520
   402
  end;
berghofe@11520
   403
berghofe@11520
   404
fun mk_app _ p [] = p
berghofe@11520
   405
  | mk_app brack p ps = if brack then
berghofe@11520
   406
       Pretty.block (Pretty.str "(" ::
berghofe@11520
   407
         separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"])
berghofe@11520
   408
     else Pretty.block (separate (Pretty.brk 1) (p :: ps));
berghofe@11520
   409
berghofe@14858
   410
fun new_names t xs = variantlist (map mk_id xs,
berghofe@11520
   411
  map (fst o fst o dest_Var) (term_vars t) union
berghofe@11520
   412
  add_term_names (t, ThmDatabase.ml_reserved));
berghofe@11520
   413
berghofe@11520
   414
fun new_name t x = hd (new_names t [x]);
berghofe@11520
   415
berghofe@11520
   416
fun default_codegen thy gr dep brack t =
berghofe@11520
   417
  let
berghofe@11520
   418
    val (u, ts) = strip_comb t;
berghofe@12452
   419
    fun codegens brack = foldl_map (invoke_codegen thy dep brack)
berghofe@11520
   420
  in (case u of
berghofe@14105
   421
      Var ((s, i), T) =>
berghofe@14105
   422
        let
berghofe@14105
   423
          val (gr', ps) = codegens true (gr, ts);
berghofe@14105
   424
          val (gr'', _) = invoke_tycodegen thy dep false (gr', T)
berghofe@14105
   425
        in Some (gr'', mk_app brack (Pretty.str (s ^
berghofe@11520
   426
           (if i=0 then "" else string_of_int i))) ps)
berghofe@11520
   427
        end
berghofe@11520
   428
berghofe@14105
   429
    | Free (s, T) =>
berghofe@14105
   430
        let
berghofe@14105
   431
          val (gr', ps) = codegens true (gr, ts);
berghofe@14105
   432
          val (gr'', _) = invoke_tycodegen thy dep false (gr', T)
berghofe@14105
   433
        in Some (gr'', mk_app brack (Pretty.str s) ps) end
berghofe@11520
   434
berghofe@11520
   435
    | Const (s, T) =>
berghofe@11520
   436
      (case get_assoc_code thy s T of
berghofe@11520
   437
         Some ms =>
berghofe@11520
   438
           let val i = num_args ms
berghofe@11520
   439
           in if length ts < i then
berghofe@11520
   440
               default_codegen thy gr dep brack (eta_expand u ts i)
berghofe@11520
   441
             else
berghofe@11520
   442
               let
berghofe@12452
   443
                 val (ts1, ts2) = args_of ms ts;
berghofe@12452
   444
                 val (gr1, ps1) = codegens false (gr, ts1);
berghofe@12452
   445
                 val (gr2, ps2) = codegens true (gr1, ts2);
berghofe@12452
   446
                 val (gr3, ps3) = codegens false (gr2, quotes_of ms);
berghofe@11520
   447
               in
berghofe@11520
   448
                 Some (gr3, mk_app brack (Pretty.block (pretty_mixfix ms ps1 ps3)) ps2)
berghofe@11520
   449
               end
berghofe@11520
   450
           end
berghofe@11520
   451
       | None => (case get_defn thy s T of
berghofe@11520
   452
           None => None
berghofe@11520
   453
         | Some ((args, rhs), k) =>
berghofe@11520
   454
             let
berghofe@11520
   455
               val id = mk_const_id (sign_of thy) s ^ (case k of
berghofe@11520
   456
                 None => "" | Some i => "_def" ^ string_of_int i);
berghofe@12452
   457
               val (gr', ps) = codegens true (gr, ts);
berghofe@11520
   458
             in
berghofe@11520
   459
               Some (Graph.add_edge (id, dep) gr' handle Graph.UNDEF _ =>
berghofe@11520
   460
                 let
berghofe@11520
   461
                   val _ = message ("expanding definition of " ^ s);
berghofe@11520
   462
                   val (Ts, _) = strip_type T;
berghofe@11520
   463
                   val (args', rhs') =
berghofe@11520
   464
                     if not (null args) orelse null Ts then (args, rhs) else
berghofe@11520
   465
                       let val v = Free (new_name rhs "x", hd Ts)
berghofe@11520
   466
                       in ([v], betapply (rhs, v)) end;
berghofe@12452
   467
                   val (gr1, p) = invoke_codegen thy id false
berghofe@12452
   468
                     (Graph.add_edge (id, dep)
berghofe@12452
   469
                        (Graph.new_node (id, (None, "")) gr'), rhs');
berghofe@12452
   470
                   val (gr2, xs) = codegens false (gr1, args');
berghofe@12580
   471
                   val (gr3, ty) = invoke_tycodegen thy id false (gr2, T);
wenzelm@14980
   472
                 in Graph.map_node id (K (None, Pretty.string_of (Pretty.block
berghofe@12580
   473
                   (separate (Pretty.brk 1) (if null args' then
berghofe@12580
   474
                       [Pretty.str ("val " ^ id ^ " :"), ty]
berghofe@12580
   475
                     else Pretty.str ("fun " ^ id) :: xs) @
wenzelm@14980
   476
                    [Pretty.str " =", Pretty.brk 1, p, Pretty.str ";"])) ^ "\n\n")) gr3
berghofe@11520
   477
                 end, mk_app brack (Pretty.str id) ps)
berghofe@11520
   478
             end))
berghofe@11520
   479
berghofe@11520
   480
    | Abs _ =>
berghofe@11520
   481
      let
berghofe@11520
   482
        val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
berghofe@11520
   483
        val t = strip_abs_body u
berghofe@11520
   484
        val bs' = new_names t bs;
berghofe@12452
   485
        val (gr1, ps) = codegens true (gr, ts);
berghofe@12452
   486
        val (gr2, p) = invoke_codegen thy dep false
berghofe@12452
   487
          (gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t));
berghofe@11520
   488
      in
berghofe@11520
   489
        Some (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @
berghofe@11520
   490
          [Pretty.str ")"])) ps)
berghofe@11520
   491
      end
berghofe@11520
   492
berghofe@11520
   493
    | _ => None)
berghofe@11520
   494
  end;
berghofe@11520
   495
berghofe@12452
   496
fun default_tycodegen thy gr dep brack (TVar ((s, i), _)) =
berghofe@12452
   497
      Some (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i)))
berghofe@12452
   498
  | default_tycodegen thy gr dep brack (TFree (s, _)) = Some (gr, Pretty.str s)
berghofe@12452
   499
  | default_tycodegen thy gr dep brack (Type (s, Ts)) =
berghofe@12452
   500
      (case assoc (#types (CodegenData.get thy), s) of
berghofe@12452
   501
         None => None
berghofe@12452
   502
       | Some ms =>
berghofe@12452
   503
           let
berghofe@12452
   504
             val (gr', ps) = foldl_map
berghofe@12452
   505
               (invoke_tycodegen thy dep false) (gr, fst (args_of ms Ts));
berghofe@12452
   506
             val (gr'', qs) = foldl_map
berghofe@12452
   507
               (invoke_tycodegen thy dep false) (gr', quotes_of ms)
berghofe@12452
   508
           in Some (gr'', Pretty.block (pretty_mixfix ms ps qs)) end);
berghofe@12452
   509
berghofe@11520
   510
berghofe@11520
   511
fun output_code gr xs = implode (map (snd o Graph.get_node gr)
berghofe@11520
   512
  (rev (Graph.all_preds gr xs)));
berghofe@11520
   513
berghofe@14598
   514
fun gen_generate_code prep_term thy =
berghofe@14598
   515
  setmp print_mode [] (Pretty.setmp_margin (!margin) (fn xs =>
berghofe@11520
   516
  let
berghofe@11520
   517
    val sg = sign_of thy;
berghofe@11520
   518
    val gr = Graph.new_node ("<Top>", (None, "")) Graph.empty;
berghofe@11520
   519
    val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s)
berghofe@12452
   520
      (invoke_codegen thy "<Top>" false (gr, t)))
berghofe@12452
   521
        (gr, map (apsnd (prep_term sg)) xs)
wenzelm@14818
   522
    val code =
wenzelm@14818
   523
      "structure Generated =\nstruct\n\n" ^
wenzelm@14818
   524
      output_code gr' ["<Top>"] ^
wenzelm@14818
   525
      space_implode "\n\n" (map (fn (s', p) => Pretty.string_of (Pretty.block
wenzelm@14818
   526
        [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"])) ps) ^
wenzelm@14818
   527
      "\n\nend;\n\nopen Generated;\n";
wenzelm@14980
   528
  in code end));
berghofe@11520
   529
berghofe@11520
   530
val generate_code_i = gen_generate_code (K I);
berghofe@11520
   531
val generate_code = gen_generate_code
berghofe@11520
   532
  (fn sg => term_of o read_cterm sg o rpair TypeInfer.logicT);
berghofe@11520
   533
berghofe@12452
   534
berghofe@13753
   535
(**** Reflection ****)
berghofe@13753
   536
berghofe@13753
   537
val strip_tname = implode o tl o explode;
berghofe@13753
   538
berghofe@13753
   539
fun pretty_list xs = Pretty.block (Pretty.str "[" ::
berghofe@13753
   540
  flat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
berghofe@13753
   541
  [Pretty.str "]"]);
berghofe@13753
   542
berghofe@13753
   543
fun mk_type p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   544
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
berghofe@13753
   545
  | mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T")
berghofe@13753
   546
  | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@13753
   547
      [Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","),
berghofe@13753
   548
       Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]);
berghofe@13753
   549
berghofe@13753
   550
fun mk_term_of sg p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   551
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
berghofe@13753
   552
  | mk_term_of sg p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F")
berghofe@13753
   553
  | mk_term_of sg p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@13753
   554
      (separate (Pretty.brk 1) (Pretty.str ("term_of_" ^ mk_type_id sg s) ::
berghofe@13753
   555
        flat (map (fn T => [mk_term_of sg true T, mk_type true T]) Ts))));
berghofe@13753
   556
berghofe@13753
   557
berghofe@14105
   558
(**** Test data generators ****)
berghofe@14105
   559
berghofe@14105
   560
fun mk_gen sg p xs a (TVar ((s, i), _)) = Pretty.str
berghofe@14105
   561
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
berghofe@14105
   562
  | mk_gen sg p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G")
berghofe@14105
   563
  | mk_gen sg p xs a (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@14105
   564
      (separate (Pretty.brk 1) (Pretty.str ("gen_" ^ mk_type_id sg s ^
berghofe@14105
   565
        (if s mem xs then "'" else "")) :: map (mk_gen sg true xs a) Ts @
berghofe@14105
   566
        (if s mem xs then [Pretty.str a] else []))));
berghofe@14105
   567
berghofe@14105
   568
val test_fn : (int -> (string * term) list option) ref = ref (fn _ => None);
berghofe@14105
   569
berghofe@15029
   570
fun test_term thy sz i = setmp print_mode [] (fn t =>
berghofe@14105
   571
  let
berghofe@14105
   572
    val _ = assert (null (term_tvars t) andalso null (term_tfrees t))
berghofe@14105
   573
      "Term to be tested contains type variables";
berghofe@14105
   574
    val _ = assert (null (term_vars t))
berghofe@14105
   575
      "Term to be tested contains schematic variables";
berghofe@14105
   576
    val sg = sign_of thy;
berghofe@14105
   577
    val frees = map dest_Free (term_frees t);
berghofe@14140
   578
    val szname = variant (map fst frees) "i";
berghofe@14105
   579
    val s = "structure TestTerm =\nstruct\n\n" ^
berghofe@14105
   580
      setmp mode ["term_of", "test"] (generate_code_i thy)
berghofe@14105
   581
        [("testf", list_abs_free (frees, t))] ^
wenzelm@14980
   582
      "\n" ^ Pretty.string_of
berghofe@14105
   583
        (Pretty.block [Pretty.str "val () = Codegen.test_fn :=",
berghofe@14140
   584
          Pretty.brk 1, Pretty.str ("(fn " ^ szname ^ " =>"), Pretty.brk 1,
berghofe@14105
   585
          Pretty.blk (0, [Pretty.str "let", Pretty.brk 1,
berghofe@14105
   586
            Pretty.blk (0, separate Pretty.fbrk (map (fn (s, T) =>
berghofe@14886
   587
              Pretty.block [Pretty.str ("val " ^ mk_id s ^ " ="), Pretty.brk 1,
berghofe@14105
   588
              mk_gen sg false [] "" T, Pretty.brk 1,
berghofe@14140
   589
              Pretty.str (szname ^ ";")]) frees)),
berghofe@14105
   590
            Pretty.brk 1, Pretty.str "in", Pretty.brk 1,
berghofe@14105
   591
            Pretty.block [Pretty.str "if ",
berghofe@14886
   592
              mk_app false (Pretty.str "testf") (map (Pretty.str o mk_id o fst) frees),
kleing@14110
   593
              Pretty.brk 1, Pretty.str "then Library.None",
berghofe@14105
   594
              Pretty.brk 1, Pretty.str "else ",
kleing@14110
   595
              Pretty.block [Pretty.str "Library.Some ", Pretty.block (Pretty.str "[" ::
berghofe@14105
   596
                flat (separate [Pretty.str ",", Pretty.brk 1]
berghofe@14105
   597
                  (map (fn (s, T) => [Pretty.block
berghofe@14598
   598
                    [Pretty.str ("(" ^ Library.quote s ^ ","), Pretty.brk 1,
berghofe@14105
   599
                     mk_app false (mk_term_of sg false T)
berghofe@14886
   600
                       [Pretty.str (mk_id s)], Pretty.str ")"]]) frees)) @
berghofe@14105
   601
                  [Pretty.str "]"])]],
wenzelm@14980
   602
            Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^
berghofe@14105
   603
      "\n\nend;\n";
berghofe@14105
   604
    val _ = use_text Context.ml_output false s;
berghofe@14105
   605
    fun iter f k = if k > i then None
berghofe@14135
   606
      else (case (f () handle Match =>
berghofe@14135
   607
          (warning "Exception Match raised in generated code"; None)) of
berghofe@14135
   608
        None => iter f (k+1) | Some x => Some x);
berghofe@14105
   609
    fun test k = if k > sz then None
berghofe@14105
   610
      else (priority ("Test data size: " ^ string_of_int k);
berghofe@14105
   611
        case iter (fn () => !test_fn k) 1 of
berghofe@14105
   612
          None => test (k+1) | Some x => Some x);
berghofe@15029
   613
  in test 0 end);
berghofe@14105
   614
berghofe@14105
   615
fun test_goal ({size, iterations, default_type}, tvinsts) i st =
berghofe@14105
   616
  let
berghofe@14105
   617
    val sg = Toplevel.sign_of st;
berghofe@14105
   618
    fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t
berghofe@14105
   619
      | strip t = t;
berghofe@14105
   620
    val (gi, frees) = Logic.goal_params
berghofe@14105
   621
      (prop_of (snd (snd (Proof.get_goal (Toplevel.proof_of st))))) i;
berghofe@14105
   622
    val gi' = ObjectLogic.atomize_term sg (map_term_types
berghofe@14105
   623
      (map_type_tfree (fn p as (s, _) => if_none (assoc (tvinsts, s))
berghofe@14105
   624
        (if_none default_type (TFree p)))) (subst_bounds (frees, strip gi)));
berghofe@14105
   625
  in case test_term (Toplevel.theory_of st) size iterations gi' of
berghofe@14105
   626
      None => writeln "No counterexamples found."
berghofe@14105
   627
    | Some cex => writeln ("Counterexample found:\n" ^
berghofe@14105
   628
        Pretty.string_of (Pretty.chunks (map (fn (s, t) =>
berghofe@14105
   629
          Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1,
berghofe@14105
   630
            Sign.pretty_term sg t]) cex)))
berghofe@14105
   631
  end;
berghofe@14105
   632
berghofe@14105
   633
berghofe@12452
   634
(**** Interface ****)
berghofe@12452
   635
berghofe@13731
   636
val str = setmp print_mode [] Pretty.str;
berghofe@13731
   637
berghofe@11520
   638
fun parse_mixfix rd s =
berghofe@11520
   639
  (case Scan.finite Symbol.stopper (Scan.repeat
berghofe@11520
   640
     (   $$ "_" >> K Arg
berghofe@11520
   641
      || $$ "?" >> K Ignore
berghofe@11520
   642
      || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
berghofe@11520
   643
      || $$ "{" |-- $$ "*" |-- Scan.repeat1
berghofe@11520
   644
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@11520
   645
            || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.not_eof)) --|
berghofe@12452
   646
         $$ "*" --| $$ "}" >> (Quote o rd o implode)
berghofe@11520
   647
      || Scan.repeat1
berghofe@11520
   648
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@11520
   649
            || Scan.unless ($$ "_" || $$ "?" || $$ "/" || $$ "{" |-- $$ "*")
berghofe@13731
   650
                 (Scan.one Symbol.not_eof)) >> (Pretty o str o implode)))
berghofe@11520
   651
       (Symbol.explode s) of
berghofe@11520
   652
     (p, []) => p
berghofe@11520
   653
   | _ => error ("Malformed annotation: " ^ quote s));
berghofe@11520
   654
wenzelm@11546
   655
structure P = OuterParse and K = OuterSyntax.Keyword;
berghofe@11520
   656
berghofe@11520
   657
val assoc_typeP =
berghofe@11520
   658
  OuterSyntax.command "types_code"
wenzelm@11546
   659
  "associate types with target language types" K.thy_decl
berghofe@11520
   660
    (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")") >>
berghofe@12452
   661
     (fn xs => Toplevel.theory (fn thy => assoc_types
berghofe@12452
   662
       (map (fn (name, mfx) => (name, parse_mixfix
berghofe@12452
   663
         (typ_of o read_ctyp (sign_of thy)) mfx)) xs) thy)));
berghofe@11520
   664
berghofe@11520
   665
val assoc_constP =
berghofe@11520
   666
  OuterSyntax.command "consts_code"
wenzelm@11546
   667
  "associate constants with target language code" K.thy_decl
berghofe@11520
   668
    (Scan.repeat1
wenzelm@13003
   669
       (P.xname -- (Scan.option (P.$$$ "::" |-- P.typ)) --|
berghofe@11520
   670
        P.$$$ "(" -- P.string --| P.$$$ ")") >>
berghofe@11520
   671
     (fn xs => Toplevel.theory (fn thy => assoc_consts
berghofe@11520
   672
       (map (fn ((name, optype), mfx) => (name, optype, parse_mixfix
berghofe@11520
   673
         (term_of o read_cterm (sign_of thy) o rpair TypeInfer.logicT) mfx))
berghofe@11520
   674
           xs) thy)));
berghofe@11520
   675
berghofe@11520
   676
val generate_codeP =
wenzelm@11546
   677
  OuterSyntax.command "generate_code" "generates code for terms" K.thy_decl
wenzelm@13003
   678
    (Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") --
berghofe@13753
   679
     Scan.optional (P.$$$ "[" |-- P.enum "," P.xname --| P.$$$ "]") (!mode) --
wenzelm@13003
   680
     Scan.repeat1 (P.name --| P.$$$ "=" -- P.term) >>
berghofe@13753
   681
     (fn ((opt_fname, mode'), xs) => Toplevel.theory (fn thy =>
berghofe@11520
   682
        ((case opt_fname of
berghofe@11520
   683
            None => use_text Context.ml_output false
berghofe@11520
   684
          | Some fname => File.write (Path.unpack fname))
berghofe@13753
   685
              (setmp mode mode' (generate_code thy) xs); thy))));
berghofe@11520
   686
berghofe@14105
   687
val params =
berghofe@14105
   688
  [("size", P.nat >> (K o set_size)),
berghofe@14105
   689
   ("iterations", P.nat >> (K o set_iterations)),
berghofe@14105
   690
   ("default_type", P.typ >> set_default_type)];
berghofe@14105
   691
berghofe@14105
   692
val parse_test_params = P.short_ident :-- (fn s =>
berghofe@14105
   693
  P.$$$ "=" |-- if_none (assoc (params, s)) Scan.fail) >> snd;
berghofe@14105
   694
berghofe@14105
   695
fun parse_tyinst xs =
berghofe@14105
   696
  (P.type_ident --| P.$$$ "=" -- P.typ >> (fn (v, s) => fn sg =>
berghofe@14105
   697
    fn (x, ys) => (x, (v, typ_of (read_ctyp sg s)) :: ys))) xs;
berghofe@14105
   698
berghofe@14105
   699
fun app [] x = x
berghofe@14105
   700
  | app (f :: fs) x = app fs (f x);
berghofe@14105
   701
berghofe@14105
   702
val test_paramsP =
berghofe@14105
   703
  OuterSyntax.command "quickcheck_params" "set parameters for random testing" K.thy_decl
berghofe@14105
   704
    (P.$$$ "[" |-- P.list1 parse_test_params --| P.$$$ "]" >>
berghofe@14105
   705
      (fn fs => Toplevel.theory (fn thy =>
berghofe@14105
   706
         map_test_params (app (map (fn f => f (sign_of thy)) fs)) thy)));
berghofe@14105
   707
berghofe@14105
   708
val testP =
berghofe@14105
   709
  OuterSyntax.command "quickcheck" "try to find counterexample for subgoal" K.diag
berghofe@14105
   710
  (Scan.option (P.$$$ "[" |-- P.list1
berghofe@14105
   711
    (   parse_test_params >> (fn f => fn sg => apfst (f sg))
berghofe@14105
   712
     || parse_tyinst) --| P.$$$ "]") -- Scan.optional P.nat 1 >>
berghofe@14105
   713
    (fn (ps, g) => Toplevel.keep (fn st =>
berghofe@14105
   714
      test_goal (app (if_none (apsome
berghofe@14105
   715
          (map (fn f => f (Toplevel.sign_of st))) ps) [])
berghofe@14105
   716
        (get_test_params (Toplevel.theory_of st), [])) g st)));
berghofe@14105
   717
berghofe@14105
   718
val parsers = [assoc_typeP, assoc_constP, generate_codeP, test_paramsP, testP];
berghofe@11520
   719
berghofe@12452
   720
val setup =
berghofe@12452
   721
  [CodegenData.init,
berghofe@12452
   722
   add_codegen "default" default_codegen,
berghofe@12452
   723
   add_tycodegen "default" default_tycodegen,
berghofe@12555
   724
   assoc_types [("fun", parse_mixfix (K dummyT) "(_ ->/ _)")],
berghofe@12555
   725
   Attrib.add_attributes [("code",
berghofe@12555
   726
     (code_attr, K Attrib.undef_local_attribute),
berghofe@12555
   727
     "declare theorems for code generation")]];
berghofe@11520
   728
berghofe@11520
   729
end;
berghofe@11520
   730
berghofe@11520
   731
OuterSyntax.add_parsers Codegen.parsers;