src/Pure/codegen.ML
author berghofe
Tue Oct 26 16:32:09 2004 +0200 (2004-10-26)
changeset 15261 ba3c9fdbace3
parent 15029 a4d0ed993050
child 15326 ff21cddee442
permissions -rw-r--r--
Added preprocessors.
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
berghofe@11520
    41
  val mk_const_id: Sign.sg -> string -> string
berghofe@11520
    42
  val mk_type_id: Sign.sg -> string -> string
berghofe@11520
    43
  val rename_term: term -> term
berghofe@11520
    44
  val get_defn: theory -> string -> typ -> ((term list * term) * int option) option
berghofe@11520
    45
  val is_instance: theory -> typ -> typ -> bool
berghofe@11520
    46
  val parens: Pretty.T -> Pretty.T
berghofe@11520
    47
  val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
berghofe@11520
    48
  val eta_expand: term -> term list -> int -> term
berghofe@14105
    49
  val strip_tname: string -> string
berghofe@13753
    50
  val mk_type: bool -> typ -> Pretty.T
berghofe@13753
    51
  val mk_term_of: Sign.sg -> bool -> typ -> Pretty.T
berghofe@14105
    52
  val mk_gen: Sign.sg -> bool -> string list -> string -> typ -> Pretty.T
berghofe@14105
    53
  val test_fn: (int -> (string * term) list option) ref
berghofe@14105
    54
  val test_term: theory -> int -> int -> term -> (string * term) list option
berghofe@12452
    55
  val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
berghofe@11520
    56
  val parsers: OuterSyntax.parser list
berghofe@11520
    57
  val setup: (theory -> theory) 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
wenzelm@12490
    91
fun num_args x = length (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
berghofe@14105
   112
       None => default_type2
berghofe@14105
   113
     | _ => default_type1};
berghofe@14105
   114
berghofe@14105
   115
val default_test_params : test_params =
berghofe@14105
   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
berghofe@14105
   124
fun set_default_type s sg ({size, iterations, ...} : test_params) =
berghofe@14105
   125
  {size = size, iterations = iterations,
berghofe@14105
   126
   default_type = Some (typ_of (read_ctyp sg s))};
berghofe@14105
   127
berghofe@14105
   128
(* data kind 'Pure/codegen' *)
berghofe@14105
   129
 
berghofe@11520
   130
structure CodegenArgs =
berghofe@11520
   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;
berghofe@11520
   146
  val prep_ext = I;
berghofe@11520
   147
berghofe@12555
   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
berghofe@12452
   163
  fun print sg ({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)]);
berghofe@11520
   167
end;
berghofe@11520
   168
berghofe@11520
   169
structure CodegenData = TheoryDataFun(CodegenArgs);
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
berghofe@12452
   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
berghofe@12452
   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
berghofe@12452
   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
berghofe@11520
   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
berghofe@12555
   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
berghofe@12555
   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 =
berghofe@14197
   226
  Attrib.syntax (Scan.depend (fn thy => foldr op || (map mk_parser
berghofe@14197
   227
    (#attrs (CodegenData.get thy)), Scan.fail) >> pair thy));
berghofe@12555
   228
berghofe@12555
   229
berghofe@15261
   230
(**** preprocessors ****)
berghofe@15261
   231
berghofe@15261
   232
fun add_preprocessor p thy =
berghofe@15261
   233
  let val {codegens, tycodegens, consts, types, attrs, preprocs, test_params} =
berghofe@15261
   234
    CodegenData.get thy
berghofe@15261
   235
  in CodegenData.put {tycodegens = tycodegens,
berghofe@15261
   236
    codegens = codegens, consts = consts, types = types,
berghofe@15261
   237
    attrs = attrs, preprocs = (stamp (), p) :: preprocs,
berghofe@15261
   238
    test_params = test_params} thy
berghofe@15261
   239
  end;
berghofe@15261
   240
berghofe@15261
   241
fun preprocess thy ths =
berghofe@15261
   242
  let val {preprocs, ...} = CodegenData.get thy
berghofe@15261
   243
  in foldl (fn (ths, (_, f)) => f thy ths) (ths, preprocs) end;
berghofe@15261
   244
berghofe@15261
   245
fun unfold_attr (thy, eqn) =
berghofe@15261
   246
  let
berghofe@15261
   247
    val (name, _) = dest_Const (head_of
berghofe@15261
   248
      (fst (Logic.dest_equals (prop_of eqn))));
berghofe@15261
   249
    fun prep thy = map (fn th =>
berghofe@15261
   250
      if name mem term_consts (prop_of th) then
berghofe@15261
   251
        let val sg = sign_of_thm eqn
berghofe@15261
   252
        in rewrite_rule [eqn] (if Sign.subsig (sign_of_thm th, sg) then
berghofe@15261
   253
          Thm.transfer_sg sg th else th)
berghofe@15261
   254
        end
berghofe@15261
   255
      else th)
berghofe@15261
   256
  in (add_preprocessor prep thy, eqn) end;
berghofe@15261
   257
berghofe@15261
   258
berghofe@11520
   259
(**** associate constants with target language code ****)
berghofe@11520
   260
berghofe@11520
   261
fun gen_assoc_consts prep_type xs thy = foldl (fn (thy, (s, tyopt, syn)) =>
berghofe@11520
   262
  let
berghofe@11520
   263
    val sg = sign_of thy;
berghofe@15261
   264
    val {codegens, tycodegens, consts, types, attrs, preprocs, test_params} =
berghofe@14105
   265
      CodegenData.get thy;
berghofe@11520
   266
    val cname = Sign.intern_const sg s;
berghofe@11520
   267
  in
berghofe@11520
   268
    (case Sign.const_type sg cname of
berghofe@11520
   269
       Some T =>
berghofe@11520
   270
         let val T' = (case tyopt of
berghofe@11520
   271
                None => T
berghofe@11520
   272
              | Some ty =>
berghofe@11520
   273
                  let val U = prep_type sg ty
wenzelm@14769
   274
                  in if Sign.typ_instance sg (U, T) then U
berghofe@11520
   275
                    else error ("Illegal type constraint for constant " ^ cname)
berghofe@11520
   276
                  end)
berghofe@11520
   277
         in (case assoc (consts, (cname, T')) of
berghofe@11520
   278
             None => CodegenData.put {codegens = codegens,
berghofe@12452
   279
               tycodegens = tycodegens,
berghofe@12555
   280
               consts = ((cname, T'), syn) :: consts,
berghofe@15261
   281
               types = types, attrs = attrs, preprocs = preprocs,
berghofe@15261
   282
               test_params = test_params} thy
berghofe@11520
   283
           | Some _ => error ("Constant " ^ cname ^ " already associated with code"))
berghofe@11520
   284
         end
berghofe@11520
   285
     | _ => error ("Not a constant: " ^ s))
berghofe@11520
   286
  end) (thy, xs);
berghofe@11520
   287
berghofe@11520
   288
val assoc_consts_i = gen_assoc_consts (K I);
berghofe@11520
   289
val assoc_consts = gen_assoc_consts (fn sg => typ_of o read_ctyp sg);
berghofe@11520
   290
berghofe@11520
   291
(**** associate types with target language types ****)
berghofe@11520
   292
berghofe@11520
   293
fun assoc_types xs thy = foldl (fn (thy, (s, syn)) =>
berghofe@11520
   294
  let
berghofe@15261
   295
    val {codegens, tycodegens, consts, types, attrs, preprocs, test_params} =
berghofe@14105
   296
      CodegenData.get thy;
berghofe@11520
   297
    val tc = Sign.intern_tycon (sign_of thy) s
berghofe@11520
   298
  in
berghofe@11520
   299
    (case assoc (types, tc) of
berghofe@12452
   300
       None => CodegenData.put {codegens = codegens,
berghofe@12452
   301
         tycodegens = tycodegens, consts = consts,
berghofe@14105
   302
         types = (tc, syn) :: types, attrs = attrs,
berghofe@15261
   303
         preprocs = preprocs, test_params = test_params} thy
berghofe@11520
   304
     | Some _ => error ("Type " ^ tc ^ " already associated with code"))
berghofe@11520
   305
  end) (thy, xs);
berghofe@11520
   306
berghofe@12452
   307
fun get_assoc_type thy s = assoc (#types (CodegenData.get thy), s);
wenzelm@11546
   308
berghofe@11520
   309
berghofe@11520
   310
(**** make valid ML identifiers ****)
berghofe@11520
   311
berghofe@14858
   312
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
berghofe@14858
   313
  Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
berghofe@14858
   314
berghofe@14858
   315
fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of
berghofe@14858
   316
    ("<" :: "^" :: xs, ">") => (true, implode xs)
berghofe@14858
   317
  | ("<" :: xs, ">") => (false, implode xs)
berghofe@14858
   318
  | _ => sys_error "dest_sym");
berghofe@14858
   319
  
berghofe@14858
   320
fun mk_id s = if s = "" then "" else
berghofe@11520
   321
  let
berghofe@14858
   322
    fun check_str [] = []
berghofe@14858
   323
      | check_str xs = (case take_prefix is_ascii_letdig xs of
berghofe@14858
   324
          ([], " " :: zs) => check_str zs
berghofe@14858
   325
        | ([], z :: zs) =>
berghofe@14858
   326
          if size z = 1 then string_of_int (ord z) :: check_str zs
berghofe@14858
   327
          else (case dest_sym z of
berghofe@14858
   328
              (true, "isub") => check_str zs
berghofe@14858
   329
            | (true, "isup") => "" :: check_str zs
berghofe@14858
   330
            | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
berghofe@14858
   331
        | (ys, zs) => implode ys :: check_str zs);
berghofe@14858
   332
    val s' = space_implode "_"
berghofe@14858
   333
      (flat (map (check_str o Symbol.explode) (NameSpace.unpack s)))
berghofe@11520
   334
  in
berghofe@14858
   335
    if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
berghofe@11520
   336
  end;
berghofe@11520
   337
berghofe@14858
   338
fun mk_const_id sg s =
berghofe@14858
   339
  let val s' = mk_id (Sign.cond_extern sg Sign.constK s)
berghofe@14858
   340
  in if s' mem ThmDatabase.ml_reserved then s' ^ "_const" else s' end;
berghofe@13073
   341
berghofe@14858
   342
fun mk_type_id sg s =
berghofe@14858
   343
  let val s' = mk_id (Sign.cond_extern sg Sign.typeK s)
berghofe@14858
   344
  in if s' mem ThmDatabase.ml_reserved then s' ^ "_type" else s' end;
berghofe@11520
   345
berghofe@13731
   346
fun rename_terms ts =
berghofe@11520
   347
  let
berghofe@13731
   348
    val names = foldr add_term_names
berghofe@13731
   349
      (ts, map (fst o fst) (Drule.vars_of_terms ts));
berghofe@14858
   350
    val reserved = names inter ThmDatabase.ml_reserved;
berghofe@14858
   351
    val (illegal, alt_names) = split_list (mapfilter (fn s =>
berghofe@14858
   352
      let val s' = mk_id s in if s = s' then None else Some (s, s') end) names)
berghofe@14858
   353
    val ps = (reserved @ illegal) ~~
berghofe@14858
   354
      variantlist (map (suffix "'") reserved @ alt_names, names);
berghofe@11520
   355
berghofe@14858
   356
    fun rename_id s = if_none (assoc (ps, s)) s;
berghofe@14858
   357
berghofe@14858
   358
    fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
berghofe@14858
   359
      | rename (Free (a, T)) = Free (rename_id a, T)
berghofe@11520
   360
      | rename (Abs (s, T, t)) = Abs (s, T, rename t)
berghofe@11520
   361
      | rename (t $ u) = rename t $ rename u
berghofe@11520
   362
      | rename t = t;
berghofe@11520
   363
  in
berghofe@13731
   364
    map rename ts
berghofe@13731
   365
  end;
berghofe@13731
   366
berghofe@13731
   367
val rename_term = hd o rename_terms o single;
berghofe@13731
   368
berghofe@13731
   369
berghofe@13731
   370
(**** retrieve definition of constant ****)
berghofe@13731
   371
berghofe@13731
   372
fun is_instance thy T1 T2 =
wenzelm@14769
   373
  Sign.typ_instance (sign_of thy) (T1, Type.varifyT T2);
berghofe@13731
   374
berghofe@13731
   375
fun get_assoc_code thy s T = apsome snd (find_first (fn ((s', T'), _) =>
berghofe@13731
   376
  s = s' andalso is_instance thy T T') (#consts (CodegenData.get thy)));
berghofe@13731
   377
berghofe@13731
   378
fun get_defn thy s T =
berghofe@13731
   379
  let
berghofe@13731
   380
    val axms = flat (map (Symtab.dest o #axioms o Theory.rep_theory)
berghofe@13731
   381
      (thy :: Theory.ancestors_of thy));
berghofe@15261
   382
    fun prep_def def = (case preprocess thy [def] of
berghofe@15261
   383
      [def'] => prop_of def' | _ => error "get_defn: bad preprocessor");
berghofe@15261
   384
    fun dest t =
berghofe@15261
   385
      let
berghofe@15261
   386
        val (lhs, rhs) = Logic.dest_equals t;
berghofe@15261
   387
        val (c, args) = strip_comb lhs;
berghofe@15261
   388
        val (s', T') = dest_Const c
berghofe@15261
   389
      in if s = s' then Some (T', (args, rhs)) else None
berghofe@15261
   390
      end handle TERM _ => None;
berghofe@15261
   391
    val defs = mapfilter (fn (name, t) => apsome (pair name) (dest t)) axms;
berghofe@15261
   392
    val i = find_index (is_instance thy T o fst o snd) defs
berghofe@13731
   393
  in
berghofe@15261
   394
    if i >= 0 then
berghofe@15261
   395
      let val (name, (T', (args, _))) = nth_elem (i, defs)
berghofe@15261
   396
      in case dest (prep_def (Thm.get_axiom thy name)) of
berghofe@15261
   397
          None => None
berghofe@15261
   398
        | Some (T'', p as (args', rhs)) =>
berghofe@15261
   399
            if T' = T'' andalso args = args' then
berghofe@15261
   400
              Some (split_last (rename_terms (args @ [rhs])),
berghofe@15261
   401
                if length defs = 1 then None else Some i)
berghofe@15261
   402
            else None
berghofe@15261
   403
      end
berghofe@13731
   404
    else None
berghofe@11520
   405
  end;
berghofe@11520
   406
berghofe@11520
   407
berghofe@12452
   408
(**** invoke suitable code generator for term / type ****)
berghofe@11520
   409
berghofe@12452
   410
fun invoke_codegen thy dep brack (gr, t) = (case get_first
berghofe@11520
   411
   (fn (_, f) => f thy gr dep brack t) (#codegens (CodegenData.get thy)) of
berghofe@11520
   412
      None => error ("Unable to generate code for term:\n" ^
berghofe@11520
   413
        Sign.string_of_term (sign_of thy) t ^ "\nrequired by:\n" ^
berghofe@11520
   414
        commas (Graph.all_succs gr [dep]))
berghofe@12452
   415
    | Some x => x);
berghofe@12452
   416
berghofe@12452
   417
fun invoke_tycodegen thy dep brack (gr, T) = (case get_first
berghofe@12452
   418
   (fn (_, f) => f thy gr dep brack T) (#tycodegens (CodegenData.get thy)) of
berghofe@12452
   419
      None => error ("Unable to generate code for type:\n" ^
berghofe@12452
   420
        Sign.string_of_typ (sign_of thy) T ^ "\nrequired by:\n" ^
berghofe@12452
   421
        commas (Graph.all_succs gr [dep]))
berghofe@12452
   422
    | Some x => x);
berghofe@11520
   423
berghofe@11520
   424
berghofe@11520
   425
(**** code generator for mixfix expressions ****)
berghofe@11520
   426
berghofe@11520
   427
fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"];
berghofe@11520
   428
berghofe@11520
   429
fun pretty_fn [] p = [p]
berghofe@11520
   430
  | pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") ::
berghofe@11520
   431
      Pretty.brk 1 :: pretty_fn xs p;
berghofe@11520
   432
berghofe@11520
   433
fun pretty_mixfix [] [] _ = []
berghofe@11520
   434
  | pretty_mixfix (Arg :: ms) (p :: ps) qs = p :: pretty_mixfix ms ps qs
berghofe@12452
   435
  | pretty_mixfix (Ignore :: ms) ps qs = pretty_mixfix ms ps qs
berghofe@11520
   436
  | pretty_mixfix (Pretty p :: ms) ps qs = p :: pretty_mixfix ms ps qs
berghofe@12452
   437
  | pretty_mixfix (Quote _ :: ms) ps (q :: qs) = q :: pretty_mixfix ms ps qs;
berghofe@11520
   438
berghofe@11520
   439
berghofe@12452
   440
(**** default code generators ****)
berghofe@11520
   441
berghofe@11520
   442
fun eta_expand t ts i =
berghofe@11520
   443
  let
berghofe@11520
   444
    val (Ts, _) = strip_type (fastype_of t);
berghofe@11520
   445
    val j = i - length ts
berghofe@11520
   446
  in
berghofe@11520
   447
    foldr (fn (T, t) => Abs ("x", T, t))
berghofe@11520
   448
      (take (j, Ts), list_comb (t, ts @ map Bound (j-1 downto 0)))
berghofe@11520
   449
  end;
berghofe@11520
   450
berghofe@11520
   451
fun mk_app _ p [] = p
berghofe@11520
   452
  | mk_app brack p ps = if brack then
berghofe@11520
   453
       Pretty.block (Pretty.str "(" ::
berghofe@11520
   454
         separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"])
berghofe@11520
   455
     else Pretty.block (separate (Pretty.brk 1) (p :: ps));
berghofe@11520
   456
berghofe@14858
   457
fun new_names t xs = variantlist (map mk_id xs,
berghofe@11520
   458
  map (fst o fst o dest_Var) (term_vars t) union
berghofe@11520
   459
  add_term_names (t, ThmDatabase.ml_reserved));
berghofe@11520
   460
berghofe@11520
   461
fun new_name t x = hd (new_names t [x]);
berghofe@11520
   462
berghofe@11520
   463
fun default_codegen thy gr dep brack t =
berghofe@11520
   464
  let
berghofe@11520
   465
    val (u, ts) = strip_comb t;
berghofe@12452
   466
    fun codegens brack = foldl_map (invoke_codegen thy dep brack)
berghofe@11520
   467
  in (case u of
berghofe@14105
   468
      Var ((s, i), T) =>
berghofe@14105
   469
        let
berghofe@14105
   470
          val (gr', ps) = codegens true (gr, ts);
berghofe@14105
   471
          val (gr'', _) = invoke_tycodegen thy dep false (gr', T)
berghofe@14105
   472
        in Some (gr'', mk_app brack (Pretty.str (s ^
berghofe@11520
   473
           (if i=0 then "" else string_of_int i))) ps)
berghofe@11520
   474
        end
berghofe@11520
   475
berghofe@14105
   476
    | Free (s, T) =>
berghofe@14105
   477
        let
berghofe@14105
   478
          val (gr', ps) = codegens true (gr, ts);
berghofe@14105
   479
          val (gr'', _) = invoke_tycodegen thy dep false (gr', T)
berghofe@14105
   480
        in Some (gr'', mk_app brack (Pretty.str s) ps) end
berghofe@11520
   481
berghofe@11520
   482
    | Const (s, T) =>
berghofe@11520
   483
      (case get_assoc_code thy s T of
berghofe@11520
   484
         Some ms =>
berghofe@11520
   485
           let val i = num_args ms
berghofe@11520
   486
           in if length ts < i then
berghofe@11520
   487
               default_codegen thy gr dep brack (eta_expand u ts i)
berghofe@11520
   488
             else
berghofe@11520
   489
               let
berghofe@12452
   490
                 val (ts1, ts2) = args_of ms ts;
berghofe@12452
   491
                 val (gr1, ps1) = codegens false (gr, ts1);
berghofe@12452
   492
                 val (gr2, ps2) = codegens true (gr1, ts2);
berghofe@12452
   493
                 val (gr3, ps3) = codegens false (gr2, quotes_of ms);
berghofe@11520
   494
               in
berghofe@11520
   495
                 Some (gr3, mk_app brack (Pretty.block (pretty_mixfix ms ps1 ps3)) ps2)
berghofe@11520
   496
               end
berghofe@11520
   497
           end
berghofe@11520
   498
       | None => (case get_defn thy s T of
berghofe@11520
   499
           None => None
berghofe@11520
   500
         | Some ((args, rhs), k) =>
berghofe@11520
   501
             let
berghofe@11520
   502
               val id = mk_const_id (sign_of thy) s ^ (case k of
berghofe@11520
   503
                 None => "" | Some i => "_def" ^ string_of_int i);
berghofe@12452
   504
               val (gr', ps) = codegens true (gr, ts);
berghofe@11520
   505
             in
berghofe@11520
   506
               Some (Graph.add_edge (id, dep) gr' handle Graph.UNDEF _ =>
berghofe@11520
   507
                 let
berghofe@11520
   508
                   val _ = message ("expanding definition of " ^ s);
berghofe@11520
   509
                   val (Ts, _) = strip_type T;
berghofe@11520
   510
                   val (args', rhs') =
berghofe@11520
   511
                     if not (null args) orelse null Ts then (args, rhs) else
berghofe@11520
   512
                       let val v = Free (new_name rhs "x", hd Ts)
berghofe@11520
   513
                       in ([v], betapply (rhs, v)) end;
berghofe@12452
   514
                   val (gr1, p) = invoke_codegen thy id false
berghofe@12452
   515
                     (Graph.add_edge (id, dep)
berghofe@12452
   516
                        (Graph.new_node (id, (None, "")) gr'), rhs');
berghofe@12452
   517
                   val (gr2, xs) = codegens false (gr1, args');
berghofe@12580
   518
                   val (gr3, ty) = invoke_tycodegen thy id false (gr2, T);
wenzelm@14980
   519
                 in Graph.map_node id (K (None, Pretty.string_of (Pretty.block
berghofe@12580
   520
                   (separate (Pretty.brk 1) (if null args' then
berghofe@12580
   521
                       [Pretty.str ("val " ^ id ^ " :"), ty]
berghofe@12580
   522
                     else Pretty.str ("fun " ^ id) :: xs) @
wenzelm@14980
   523
                    [Pretty.str " =", Pretty.brk 1, p, Pretty.str ";"])) ^ "\n\n")) gr3
berghofe@11520
   524
                 end, mk_app brack (Pretty.str id) ps)
berghofe@11520
   525
             end))
berghofe@11520
   526
berghofe@11520
   527
    | Abs _ =>
berghofe@11520
   528
      let
berghofe@11520
   529
        val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
berghofe@11520
   530
        val t = strip_abs_body u
berghofe@11520
   531
        val bs' = new_names t bs;
berghofe@12452
   532
        val (gr1, ps) = codegens true (gr, ts);
berghofe@12452
   533
        val (gr2, p) = invoke_codegen thy dep false
berghofe@12452
   534
          (gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t));
berghofe@11520
   535
      in
berghofe@11520
   536
        Some (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @
berghofe@11520
   537
          [Pretty.str ")"])) ps)
berghofe@11520
   538
      end
berghofe@11520
   539
berghofe@11520
   540
    | _ => None)
berghofe@11520
   541
  end;
berghofe@11520
   542
berghofe@12452
   543
fun default_tycodegen thy gr dep brack (TVar ((s, i), _)) =
berghofe@12452
   544
      Some (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i)))
berghofe@12452
   545
  | default_tycodegen thy gr dep brack (TFree (s, _)) = Some (gr, Pretty.str s)
berghofe@12452
   546
  | default_tycodegen thy gr dep brack (Type (s, Ts)) =
berghofe@12452
   547
      (case assoc (#types (CodegenData.get thy), s) of
berghofe@12452
   548
         None => None
berghofe@12452
   549
       | Some ms =>
berghofe@12452
   550
           let
berghofe@12452
   551
             val (gr', ps) = foldl_map
berghofe@12452
   552
               (invoke_tycodegen thy dep false) (gr, fst (args_of ms Ts));
berghofe@12452
   553
             val (gr'', qs) = foldl_map
berghofe@12452
   554
               (invoke_tycodegen thy dep false) (gr', quotes_of ms)
berghofe@12452
   555
           in Some (gr'', Pretty.block (pretty_mixfix ms ps qs)) end);
berghofe@12452
   556
berghofe@11520
   557
berghofe@11520
   558
fun output_code gr xs = implode (map (snd o Graph.get_node gr)
berghofe@11520
   559
  (rev (Graph.all_preds gr xs)));
berghofe@11520
   560
berghofe@14598
   561
fun gen_generate_code prep_term thy =
berghofe@14598
   562
  setmp print_mode [] (Pretty.setmp_margin (!margin) (fn xs =>
berghofe@11520
   563
  let
berghofe@11520
   564
    val sg = sign_of thy;
berghofe@11520
   565
    val gr = Graph.new_node ("<Top>", (None, "")) Graph.empty;
berghofe@11520
   566
    val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s)
berghofe@12452
   567
      (invoke_codegen thy "<Top>" false (gr, t)))
berghofe@12452
   568
        (gr, map (apsnd (prep_term sg)) xs)
wenzelm@14818
   569
    val code =
wenzelm@14818
   570
      "structure Generated =\nstruct\n\n" ^
wenzelm@14818
   571
      output_code gr' ["<Top>"] ^
wenzelm@14818
   572
      space_implode "\n\n" (map (fn (s', p) => Pretty.string_of (Pretty.block
wenzelm@14818
   573
        [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"])) ps) ^
wenzelm@14818
   574
      "\n\nend;\n\nopen Generated;\n";
wenzelm@14980
   575
  in code end));
berghofe@11520
   576
berghofe@11520
   577
val generate_code_i = gen_generate_code (K I);
berghofe@11520
   578
val generate_code = gen_generate_code
berghofe@11520
   579
  (fn sg => term_of o read_cterm sg o rpair TypeInfer.logicT);
berghofe@11520
   580
berghofe@12452
   581
berghofe@13753
   582
(**** Reflection ****)
berghofe@13753
   583
berghofe@13753
   584
val strip_tname = implode o tl o explode;
berghofe@13753
   585
berghofe@13753
   586
fun pretty_list xs = Pretty.block (Pretty.str "[" ::
berghofe@13753
   587
  flat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
berghofe@13753
   588
  [Pretty.str "]"]);
berghofe@13753
   589
berghofe@13753
   590
fun mk_type p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   591
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
berghofe@13753
   592
  | mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T")
berghofe@13753
   593
  | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@13753
   594
      [Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","),
berghofe@13753
   595
       Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]);
berghofe@13753
   596
berghofe@13753
   597
fun mk_term_of sg p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   598
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
berghofe@13753
   599
  | mk_term_of sg p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F")
berghofe@13753
   600
  | mk_term_of sg p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@13753
   601
      (separate (Pretty.brk 1) (Pretty.str ("term_of_" ^ mk_type_id sg s) ::
berghofe@13753
   602
        flat (map (fn T => [mk_term_of sg true T, mk_type true T]) Ts))));
berghofe@13753
   603
berghofe@13753
   604
berghofe@14105
   605
(**** Test data generators ****)
berghofe@14105
   606
berghofe@14105
   607
fun mk_gen sg p xs a (TVar ((s, i), _)) = Pretty.str
berghofe@14105
   608
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
berghofe@14105
   609
  | mk_gen sg p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G")
berghofe@14105
   610
  | mk_gen sg p xs a (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@14105
   611
      (separate (Pretty.brk 1) (Pretty.str ("gen_" ^ mk_type_id sg s ^
berghofe@14105
   612
        (if s mem xs then "'" else "")) :: map (mk_gen sg true xs a) Ts @
berghofe@14105
   613
        (if s mem xs then [Pretty.str a] else []))));
berghofe@14105
   614
berghofe@14105
   615
val test_fn : (int -> (string * term) list option) ref = ref (fn _ => None);
berghofe@14105
   616
berghofe@15029
   617
fun test_term thy sz i = setmp print_mode [] (fn t =>
berghofe@14105
   618
  let
berghofe@14105
   619
    val _ = assert (null (term_tvars t) andalso null (term_tfrees t))
berghofe@14105
   620
      "Term to be tested contains type variables";
berghofe@14105
   621
    val _ = assert (null (term_vars t))
berghofe@14105
   622
      "Term to be tested contains schematic variables";
berghofe@14105
   623
    val sg = sign_of thy;
berghofe@14105
   624
    val frees = map dest_Free (term_frees t);
berghofe@14140
   625
    val szname = variant (map fst frees) "i";
berghofe@14105
   626
    val s = "structure TestTerm =\nstruct\n\n" ^
berghofe@14105
   627
      setmp mode ["term_of", "test"] (generate_code_i thy)
berghofe@14105
   628
        [("testf", list_abs_free (frees, t))] ^
wenzelm@14980
   629
      "\n" ^ Pretty.string_of
berghofe@14105
   630
        (Pretty.block [Pretty.str "val () = Codegen.test_fn :=",
berghofe@14140
   631
          Pretty.brk 1, Pretty.str ("(fn " ^ szname ^ " =>"), Pretty.brk 1,
berghofe@14105
   632
          Pretty.blk (0, [Pretty.str "let", Pretty.brk 1,
berghofe@14105
   633
            Pretty.blk (0, separate Pretty.fbrk (map (fn (s, T) =>
berghofe@14886
   634
              Pretty.block [Pretty.str ("val " ^ mk_id s ^ " ="), Pretty.brk 1,
berghofe@14105
   635
              mk_gen sg false [] "" T, Pretty.brk 1,
berghofe@14140
   636
              Pretty.str (szname ^ ";")]) frees)),
berghofe@14105
   637
            Pretty.brk 1, Pretty.str "in", Pretty.brk 1,
berghofe@14105
   638
            Pretty.block [Pretty.str "if ",
berghofe@14886
   639
              mk_app false (Pretty.str "testf") (map (Pretty.str o mk_id o fst) frees),
kleing@14110
   640
              Pretty.brk 1, Pretty.str "then Library.None",
berghofe@14105
   641
              Pretty.brk 1, Pretty.str "else ",
kleing@14110
   642
              Pretty.block [Pretty.str "Library.Some ", Pretty.block (Pretty.str "[" ::
berghofe@14105
   643
                flat (separate [Pretty.str ",", Pretty.brk 1]
berghofe@14105
   644
                  (map (fn (s, T) => [Pretty.block
berghofe@14598
   645
                    [Pretty.str ("(" ^ Library.quote s ^ ","), Pretty.brk 1,
berghofe@14105
   646
                     mk_app false (mk_term_of sg false T)
berghofe@14886
   647
                       [Pretty.str (mk_id s)], Pretty.str ")"]]) frees)) @
berghofe@14105
   648
                  [Pretty.str "]"])]],
wenzelm@14980
   649
            Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^
berghofe@14105
   650
      "\n\nend;\n";
berghofe@14105
   651
    val _ = use_text Context.ml_output false s;
berghofe@14105
   652
    fun iter f k = if k > i then None
berghofe@14135
   653
      else (case (f () handle Match =>
berghofe@14135
   654
          (warning "Exception Match raised in generated code"; None)) of
berghofe@14135
   655
        None => iter f (k+1) | Some x => Some x);
berghofe@14105
   656
    fun test k = if k > sz then None
berghofe@14105
   657
      else (priority ("Test data size: " ^ string_of_int k);
berghofe@14105
   658
        case iter (fn () => !test_fn k) 1 of
berghofe@14105
   659
          None => test (k+1) | Some x => Some x);
berghofe@15029
   660
  in test 0 end);
berghofe@14105
   661
berghofe@14105
   662
fun test_goal ({size, iterations, default_type}, tvinsts) i st =
berghofe@14105
   663
  let
berghofe@14105
   664
    val sg = Toplevel.sign_of st;
berghofe@14105
   665
    fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t
berghofe@14105
   666
      | strip t = t;
berghofe@14105
   667
    val (gi, frees) = Logic.goal_params
berghofe@14105
   668
      (prop_of (snd (snd (Proof.get_goal (Toplevel.proof_of st))))) i;
berghofe@14105
   669
    val gi' = ObjectLogic.atomize_term sg (map_term_types
berghofe@14105
   670
      (map_type_tfree (fn p as (s, _) => if_none (assoc (tvinsts, s))
berghofe@14105
   671
        (if_none default_type (TFree p)))) (subst_bounds (frees, strip gi)));
berghofe@14105
   672
  in case test_term (Toplevel.theory_of st) size iterations gi' of
berghofe@14105
   673
      None => writeln "No counterexamples found."
berghofe@14105
   674
    | Some cex => writeln ("Counterexample found:\n" ^
berghofe@14105
   675
        Pretty.string_of (Pretty.chunks (map (fn (s, t) =>
berghofe@14105
   676
          Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1,
berghofe@14105
   677
            Sign.pretty_term sg t]) cex)))
berghofe@14105
   678
  end;
berghofe@14105
   679
berghofe@14105
   680
berghofe@12452
   681
(**** Interface ****)
berghofe@12452
   682
berghofe@13731
   683
val str = setmp print_mode [] Pretty.str;
berghofe@13731
   684
berghofe@11520
   685
fun parse_mixfix rd s =
berghofe@11520
   686
  (case Scan.finite Symbol.stopper (Scan.repeat
berghofe@11520
   687
     (   $$ "_" >> K Arg
berghofe@11520
   688
      || $$ "?" >> K Ignore
berghofe@11520
   689
      || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
berghofe@11520
   690
      || $$ "{" |-- $$ "*" |-- Scan.repeat1
berghofe@11520
   691
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@11520
   692
            || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.not_eof)) --|
berghofe@12452
   693
         $$ "*" --| $$ "}" >> (Quote o rd o implode)
berghofe@11520
   694
      || Scan.repeat1
berghofe@11520
   695
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@11520
   696
            || Scan.unless ($$ "_" || $$ "?" || $$ "/" || $$ "{" |-- $$ "*")
berghofe@13731
   697
                 (Scan.one Symbol.not_eof)) >> (Pretty o str o implode)))
berghofe@11520
   698
       (Symbol.explode s) of
berghofe@11520
   699
     (p, []) => p
berghofe@11520
   700
   | _ => error ("Malformed annotation: " ^ quote s));
berghofe@11520
   701
wenzelm@11546
   702
structure P = OuterParse and K = OuterSyntax.Keyword;
berghofe@11520
   703
berghofe@11520
   704
val assoc_typeP =
berghofe@11520
   705
  OuterSyntax.command "types_code"
wenzelm@11546
   706
  "associate types with target language types" K.thy_decl
berghofe@11520
   707
    (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")") >>
berghofe@12452
   708
     (fn xs => Toplevel.theory (fn thy => assoc_types
berghofe@12452
   709
       (map (fn (name, mfx) => (name, parse_mixfix
berghofe@12452
   710
         (typ_of o read_ctyp (sign_of thy)) mfx)) xs) thy)));
berghofe@11520
   711
berghofe@11520
   712
val assoc_constP =
berghofe@11520
   713
  OuterSyntax.command "consts_code"
wenzelm@11546
   714
  "associate constants with target language code" K.thy_decl
berghofe@11520
   715
    (Scan.repeat1
wenzelm@13003
   716
       (P.xname -- (Scan.option (P.$$$ "::" |-- P.typ)) --|
berghofe@11520
   717
        P.$$$ "(" -- P.string --| P.$$$ ")") >>
berghofe@11520
   718
     (fn xs => Toplevel.theory (fn thy => assoc_consts
berghofe@11520
   719
       (map (fn ((name, optype), mfx) => (name, optype, parse_mixfix
berghofe@11520
   720
         (term_of o read_cterm (sign_of thy) o rpair TypeInfer.logicT) mfx))
berghofe@11520
   721
           xs) thy)));
berghofe@11520
   722
berghofe@11520
   723
val generate_codeP =
wenzelm@11546
   724
  OuterSyntax.command "generate_code" "generates code for terms" K.thy_decl
wenzelm@13003
   725
    (Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") --
berghofe@13753
   726
     Scan.optional (P.$$$ "[" |-- P.enum "," P.xname --| P.$$$ "]") (!mode) --
wenzelm@13003
   727
     Scan.repeat1 (P.name --| P.$$$ "=" -- P.term) >>
berghofe@13753
   728
     (fn ((opt_fname, mode'), xs) => Toplevel.theory (fn thy =>
berghofe@11520
   729
        ((case opt_fname of
berghofe@11520
   730
            None => use_text Context.ml_output false
berghofe@11520
   731
          | Some fname => File.write (Path.unpack fname))
berghofe@13753
   732
              (setmp mode mode' (generate_code thy) xs); thy))));
berghofe@11520
   733
berghofe@14105
   734
val params =
berghofe@14105
   735
  [("size", P.nat >> (K o set_size)),
berghofe@14105
   736
   ("iterations", P.nat >> (K o set_iterations)),
berghofe@14105
   737
   ("default_type", P.typ >> set_default_type)];
berghofe@14105
   738
berghofe@14105
   739
val parse_test_params = P.short_ident :-- (fn s =>
berghofe@14105
   740
  P.$$$ "=" |-- if_none (assoc (params, s)) Scan.fail) >> snd;
berghofe@14105
   741
berghofe@14105
   742
fun parse_tyinst xs =
berghofe@14105
   743
  (P.type_ident --| P.$$$ "=" -- P.typ >> (fn (v, s) => fn sg =>
berghofe@14105
   744
    fn (x, ys) => (x, (v, typ_of (read_ctyp sg s)) :: ys))) xs;
berghofe@14105
   745
berghofe@14105
   746
fun app [] x = x
berghofe@14105
   747
  | app (f :: fs) x = app fs (f x);
berghofe@14105
   748
berghofe@14105
   749
val test_paramsP =
berghofe@14105
   750
  OuterSyntax.command "quickcheck_params" "set parameters for random testing" K.thy_decl
berghofe@14105
   751
    (P.$$$ "[" |-- P.list1 parse_test_params --| P.$$$ "]" >>
berghofe@14105
   752
      (fn fs => Toplevel.theory (fn thy =>
berghofe@14105
   753
         map_test_params (app (map (fn f => f (sign_of thy)) fs)) thy)));
berghofe@14105
   754
berghofe@14105
   755
val testP =
berghofe@14105
   756
  OuterSyntax.command "quickcheck" "try to find counterexample for subgoal" K.diag
berghofe@14105
   757
  (Scan.option (P.$$$ "[" |-- P.list1
berghofe@14105
   758
    (   parse_test_params >> (fn f => fn sg => apfst (f sg))
berghofe@14105
   759
     || parse_tyinst) --| P.$$$ "]") -- Scan.optional P.nat 1 >>
berghofe@14105
   760
    (fn (ps, g) => Toplevel.keep (fn st =>
berghofe@14105
   761
      test_goal (app (if_none (apsome
berghofe@14105
   762
          (map (fn f => f (Toplevel.sign_of st))) ps) [])
berghofe@14105
   763
        (get_test_params (Toplevel.theory_of st), [])) g st)));
berghofe@14105
   764
berghofe@14105
   765
val parsers = [assoc_typeP, assoc_constP, generate_codeP, test_paramsP, testP];
berghofe@11520
   766
berghofe@12452
   767
val setup =
berghofe@12452
   768
  [CodegenData.init,
berghofe@12452
   769
   add_codegen "default" default_codegen,
berghofe@12452
   770
   add_tycodegen "default" default_tycodegen,
berghofe@12555
   771
   assoc_types [("fun", parse_mixfix (K dummyT) "(_ ->/ _)")],
berghofe@12555
   772
   Attrib.add_attributes [("code",
berghofe@12555
   773
     (code_attr, K Attrib.undef_local_attribute),
berghofe@15261
   774
     "declare theorems for code generation")],
berghofe@15261
   775
   add_attribute "unfold" (Scan.succeed unfold_attr)];
berghofe@11520
   776
berghofe@11520
   777
end;
berghofe@11520
   778
berghofe@11520
   779
OuterSyntax.add_parsers Codegen.parsers;