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