src/Pure/codegen.ML
author haftmann
Tue Nov 29 16:04:57 2005 +0100 (2005-11-29)
changeset 18281 591e8cdea6f7
parent 18103 7a524bfa8d65
child 18320 ce523820ff75
permissions -rw-r--r--
exported customized syntax interface
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@16769
    18
    | Module
berghofe@11520
    19
    | Pretty of Pretty.T
berghofe@12452
    20
    | Quote of 'a;
berghofe@11520
    21
berghofe@16649
    22
  type deftab
berghofe@17144
    23
  type node
berghofe@16649
    24
  type codegr
berghofe@12452
    25
  type 'a codegen
berghofe@12452
    26
berghofe@12452
    27
  val add_codegen: string -> term codegen -> theory -> theory
berghofe@12452
    28
  val add_tycodegen: string -> typ codegen -> theory -> theory
berghofe@14197
    29
  val add_attribute: string -> (Args.T list -> theory attribute * Args.T list) -> theory -> theory
berghofe@15261
    30
  val add_preprocessor: (theory -> thm list -> thm list) -> theory -> theory
berghofe@15261
    31
  val preprocess: theory -> thm list -> thm list
berghofe@17549
    32
  val preprocess_term: theory -> term -> term
berghofe@11520
    33
  val print_codegens: theory -> unit
berghofe@17144
    34
  val generate_code: theory -> string list -> string -> (string * string) list ->
berghofe@17144
    35
    (string * string) list * codegr
berghofe@17144
    36
  val generate_code_i: theory -> string list -> string -> (string * term) list ->
berghofe@17144
    37
    (string * string) list * codegr
berghofe@16769
    38
  val assoc_consts: (xstring * string option * (term mixfix list *
berghofe@16769
    39
    (string * string) list)) list -> theory -> theory
berghofe@16769
    40
  val assoc_consts_i: (xstring * typ option * (term mixfix list *
berghofe@16769
    41
    (string * string) list)) list -> theory -> theory
berghofe@16769
    42
  val assoc_types: (xstring * (typ mixfix list *
berghofe@16769
    43
    (string * string) list)) list -> theory -> theory
berghofe@16769
    44
  val get_assoc_code: theory -> string -> typ ->
berghofe@16769
    45
    (term mixfix list * (string * string) list) option
berghofe@16769
    46
  val get_assoc_type: theory -> string ->
berghofe@16769
    47
    (typ mixfix list * (string * string) list) option
berghofe@17144
    48
  val codegen_error: codegr -> string -> string -> 'a
berghofe@16649
    49
  val invoke_codegen: theory -> deftab -> string -> string -> bool ->
berghofe@16649
    50
    codegr * term -> codegr * Pretty.T
berghofe@16649
    51
  val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
berghofe@16649
    52
    codegr * typ -> codegr * Pretty.T
berghofe@14858
    53
  val mk_id: string -> string
berghofe@17144
    54
  val mk_qual_id: string -> string * string -> string
berghofe@17144
    55
  val mk_const_id: string -> string -> codegr -> codegr * (string * string)
berghofe@17144
    56
  val get_const_id: string -> codegr -> string * string
berghofe@17144
    57
  val mk_type_id: string -> string -> codegr -> codegr * (string * string)
berghofe@17144
    58
  val get_type_id: string -> codegr -> string * string
berghofe@16649
    59
  val thyname_of_type: string -> theory -> string
berghofe@16649
    60
  val thyname_of_const: string -> theory -> string
berghofe@16649
    61
  val rename_terms: term list -> term list
berghofe@11520
    62
  val rename_term: term -> term
berghofe@15398
    63
  val new_names: term -> string list -> string list
berghofe@15398
    64
  val new_name: term -> string -> string
berghofe@17144
    65
  val if_library: 'a -> 'a -> 'a
berghofe@16649
    66
  val get_defn: theory -> deftab -> string -> typ ->
berghofe@16649
    67
    ((typ * (string * (term list * term))) * int option) option
berghofe@11520
    68
  val is_instance: theory -> typ -> typ -> bool
berghofe@11520
    69
  val parens: Pretty.T -> Pretty.T
berghofe@11520
    70
  val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
berghofe@11520
    71
  val eta_expand: term -> term list -> int -> term
berghofe@14105
    72
  val strip_tname: string -> string
berghofe@13753
    73
  val mk_type: bool -> typ -> Pretty.T
berghofe@17144
    74
  val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
berghofe@17144
    75
  val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
berghofe@14105
    76
  val test_fn: (int -> (string * term) list option) ref
berghofe@14105
    77
  val test_term: theory -> int -> int -> term -> (string * term) list option
berghofe@17549
    78
  val eval_result: term ref
berghofe@17549
    79
  val eval_term: theory -> term -> term
berghofe@12452
    80
  val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
haftmann@18102
    81
  val quotes_of: 'a mixfix list -> 'a list
haftmann@18281
    82
  val num_args_of: 'a mixfix list -> int
haftmann@18102
    83
  val replace_quotes: 'b list -> 'a mixfix list -> 'b mixfix list
haftmann@18281
    84
  val fillin_mixfix: 'a mixfix list -> Pretty.T list -> ('a -> Pretty.T) -> Pretty.T
berghofe@16649
    85
  val mk_deftab: theory -> deftab
berghofe@17549
    86
berghofe@17144
    87
  val get_node: codegr -> string -> node
berghofe@17144
    88
  val add_edge: string * string -> codegr -> codegr
berghofe@17144
    89
  val add_edge_acyclic: string * string -> codegr -> codegr
berghofe@17144
    90
  val del_nodes: string list -> codegr -> codegr
berghofe@17144
    91
  val map_node: string -> (node -> node) -> codegr -> codegr
berghofe@17144
    92
  val new_node: string * node -> codegr -> codegr
berghofe@11520
    93
end;
berghofe@11520
    94
berghofe@11520
    95
structure Codegen : CODEGEN =
berghofe@11520
    96
struct
berghofe@11520
    97
berghofe@11520
    98
val quiet_mode = ref true;
berghofe@11520
    99
fun message s = if !quiet_mode then () else writeln s;
berghofe@11520
   100
berghofe@13753
   101
val mode = ref ([] : string list);
berghofe@13753
   102
berghofe@13886
   103
val margin = ref 80;
berghofe@13886
   104
berghofe@11520
   105
(**** Mixfix syntax ****)
berghofe@11520
   106
berghofe@12452
   107
datatype 'a mixfix =
berghofe@11520
   108
    Arg
berghofe@11520
   109
  | Ignore
berghofe@16769
   110
  | Module
berghofe@11520
   111
  | Pretty of Pretty.T
berghofe@12452
   112
  | Quote of 'a;
berghofe@11520
   113
berghofe@11520
   114
fun is_arg Arg = true
berghofe@11520
   115
  | is_arg Ignore = true
berghofe@11520
   116
  | is_arg _ = false;
berghofe@11520
   117
berghofe@12452
   118
fun quotes_of [] = []
berghofe@12452
   119
  | quotes_of (Quote q :: ms) = q :: quotes_of ms
berghofe@12452
   120
  | quotes_of (_ :: ms) = quotes_of ms;
berghofe@12452
   121
berghofe@12452
   122
fun args_of [] xs = ([], xs)
berghofe@12452
   123
  | args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
berghofe@12452
   124
  | args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
berghofe@12452
   125
  | args_of (_ :: ms) xs = args_of ms xs;
berghofe@11520
   126
haftmann@18281
   127
fun num_args_of x = length (List.filter is_arg x);
berghofe@11520
   128
berghofe@11520
   129
berghofe@11520
   130
(**** theory data ****)
berghofe@11520
   131
berghofe@16649
   132
(* preprocessed definition table *)
berghofe@16649
   133
berghofe@16649
   134
type deftab =
berghofe@16649
   135
  (typ *              (* type of constant *)
berghofe@16649
   136
    (string *         (* name of theory containing definition of constant *)
berghofe@16649
   137
      (term list *    (* parameters *)
berghofe@16649
   138
       term)))        (* right-hand side *)
berghofe@16649
   139
  list Symtab.table;
berghofe@16649
   140
berghofe@16649
   141
(* code dependency graph *)
berghofe@16649
   142
berghofe@17144
   143
type nametab = (string * string) Symtab.table * unit Symtab.table;
berghofe@17144
   144
berghofe@17144
   145
fun merge_nametabs ((tab, used), (tab', used')) =
berghofe@17144
   146
  (Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
berghofe@17144
   147
berghofe@17144
   148
type node =
berghofe@16649
   149
  (exn option *    (* slot for arbitrary data *)
berghofe@16649
   150
   string *        (* name of structure containing piece of code *)
berghofe@17144
   151
   string);        (* piece of code *)
berghofe@17144
   152
berghofe@17144
   153
type codegr =
berghofe@17144
   154
  node Graph.T *
berghofe@17144
   155
  (nametab *       (* table for assigned constant names *)
berghofe@17144
   156
   nametab);       (* table for assigned type names *)
berghofe@17144
   157
berghofe@17144
   158
val emptygr : codegr = (Graph.empty,
berghofe@17144
   159
  ((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
berghofe@16649
   160
berghofe@14105
   161
(* type of code generators *)
berghofe@11520
   162
berghofe@16649
   163
type 'a codegen =
berghofe@16649
   164
  theory ->    (* theory in which generate_code was called *)
berghofe@16649
   165
  deftab ->    (* definition table (for efficiency) *)
berghofe@16649
   166
  codegr ->    (* code dependency graph *)
berghofe@16649
   167
  string ->    (* node name of caller (for recording dependencies) *)
berghofe@17144
   168
  string ->    (* module name of caller (for modular code generation) *)
berghofe@16649
   169
  bool ->      (* whether to parenthesize generated expression *)
berghofe@16649
   170
  'a ->        (* item to generate code from *)
berghofe@16649
   171
  (codegr * Pretty.T) option;
berghofe@12452
   172
berghofe@14105
   173
(* parameters for random testing *)
berghofe@14105
   174
berghofe@14105
   175
type test_params =
berghofe@14105
   176
  {size: int, iterations: int, default_type: typ option};
berghofe@14105
   177
berghofe@14105
   178
fun merge_test_params
berghofe@14105
   179
  {size = size1, iterations = iterations1, default_type = default_type1}
berghofe@14105
   180
  {size = size2, iterations = iterations2, default_type = default_type2} =
berghofe@14105
   181
  {size = Int.max (size1, size2),
berghofe@14105
   182
   iterations = Int.max (iterations1, iterations2),
berghofe@14105
   183
   default_type = case default_type1 of
skalberg@15531
   184
       NONE => default_type2
berghofe@14105
   185
     | _ => default_type1};
berghofe@14105
   186
berghofe@14105
   187
val default_test_params : test_params =
skalberg@15531
   188
  {size = 10, iterations = 100, default_type = NONE};
berghofe@14105
   189
berghofe@14105
   190
fun set_size size ({iterations, default_type, ...} : test_params) =
berghofe@14105
   191
  {size = size, iterations = iterations, default_type = default_type};
berghofe@14105
   192
berghofe@14105
   193
fun set_iterations iterations ({size, default_type, ...} : test_params) =
berghofe@14105
   194
  {size = size, iterations = iterations, default_type = default_type};
berghofe@14105
   195
wenzelm@16458
   196
fun set_default_type s thy ({size, iterations, ...} : test_params) =
berghofe@14105
   197
  {size = size, iterations = iterations,
wenzelm@16458
   198
   default_type = SOME (typ_of (read_ctyp thy s))};
berghofe@14105
   199
berghofe@14105
   200
(* data kind 'Pure/codegen' *)
wenzelm@16458
   201
wenzelm@16458
   202
structure CodegenData = TheoryDataFun
wenzelm@16458
   203
(struct
berghofe@11520
   204
  val name = "Pure/codegen";
berghofe@11520
   205
  type T =
berghofe@12452
   206
    {codegens : (string * term codegen) list,
berghofe@12452
   207
     tycodegens : (string * typ codegen) list,
berghofe@16769
   208
     consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
berghofe@16769
   209
     types : (string * (typ mixfix list * (string * string) list)) list,
berghofe@14197
   210
     attrs: (string * (Args.T list -> theory attribute * Args.T list)) list,
berghofe@15261
   211
     preprocs: (stamp * (theory -> thm list -> thm list)) list,
berghofe@17144
   212
     modules: codegr Symtab.table,
berghofe@14105
   213
     test_params: test_params};
berghofe@11520
   214
berghofe@12555
   215
  val empty =
berghofe@14105
   216
    {codegens = [], tycodegens = [], consts = [], types = [], attrs = [],
berghofe@17144
   217
     preprocs = [], modules = Symtab.empty, test_params = default_test_params};
berghofe@11520
   218
  val copy = I;
wenzelm@16458
   219
  val extend = I;
berghofe@11520
   220
wenzelm@16458
   221
  fun merge _
berghofe@12555
   222
    ({codegens = codegens1, tycodegens = tycodegens1,
berghofe@14105
   223
      consts = consts1, types = types1, attrs = attrs1,
berghofe@17144
   224
      preprocs = preprocs1, modules = modules1, test_params = test_params1},
berghofe@12555
   225
     {codegens = codegens2, tycodegens = tycodegens2,
berghofe@14105
   226
      consts = consts2, types = types2, attrs = attrs2,
berghofe@17144
   227
      preprocs = preprocs2, modules = modules2, test_params = test_params2}) =
berghofe@15261
   228
    {codegens = merge_alists' codegens1 codegens2,
berghofe@15261
   229
     tycodegens = merge_alists' tycodegens1 tycodegens2,
berghofe@12555
   230
     consts = merge_alists consts1 consts2,
berghofe@12555
   231
     types = merge_alists types1 types2,
berghofe@14105
   232
     attrs = merge_alists attrs1 attrs2,
berghofe@15261
   233
     preprocs = merge_alists' preprocs1 preprocs2,
berghofe@17144
   234
     modules = Symtab.merge (K true) (modules1, modules2),
berghofe@14105
   235
     test_params = merge_test_params test_params1 test_params2};
berghofe@11520
   236
wenzelm@16458
   237
  fun print _ ({codegens, tycodegens, ...} : T) =
berghofe@12452
   238
    Pretty.writeln (Pretty.chunks
berghofe@12452
   239
      [Pretty.strs ("term code generators:" :: map fst codegens),
berghofe@12452
   240
       Pretty.strs ("type code generators:" :: map fst tycodegens)]);
wenzelm@16458
   241
end);
berghofe@11520
   242
wenzelm@15801
   243
val _ = Context.add_setup [CodegenData.init];
berghofe@11520
   244
val print_codegens = CodegenData.print;
berghofe@11520
   245
berghofe@11520
   246
berghofe@14105
   247
(**** access parameters for random testing ****)
berghofe@14105
   248
berghofe@14105
   249
fun get_test_params thy = #test_params (CodegenData.get thy);
berghofe@14105
   250
berghofe@14105
   251
fun map_test_params f thy =
berghofe@17144
   252
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   253
    CodegenData.get thy;
berghofe@14105
   254
  in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
berghofe@15261
   255
    consts = consts, types = types, attrs = attrs, preprocs = preprocs,
berghofe@17144
   256
    modules = modules, test_params = f test_params} thy
berghofe@17144
   257
  end;
berghofe@17144
   258
berghofe@17144
   259
berghofe@17144
   260
(**** access modules ****)
berghofe@17144
   261
berghofe@17144
   262
fun get_modules thy = #modules (CodegenData.get thy);
berghofe@17144
   263
berghofe@17144
   264
fun map_modules f thy =
berghofe@17144
   265
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@17144
   266
    CodegenData.get thy;
berghofe@17144
   267
  in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
berghofe@17144
   268
    consts = consts, types = types, attrs = attrs, preprocs = preprocs,
berghofe@17144
   269
    modules = f modules, test_params = test_params} thy
berghofe@14105
   270
  end;
berghofe@14105
   271
berghofe@14105
   272
berghofe@12452
   273
(**** add new code generators to theory ****)
berghofe@11520
   274
berghofe@11520
   275
fun add_codegen name f thy =
berghofe@17144
   276
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   277
    CodegenData.get thy
haftmann@17521
   278
  in (case AList.lookup (op =) codegens name of
skalberg@15531
   279
      NONE => CodegenData.put {codegens = (name, f) :: codegens,
berghofe@12555
   280
        tycodegens = tycodegens, consts = consts, types = types,
berghofe@17144
   281
        attrs = attrs, preprocs = preprocs, modules = modules,
berghofe@17144
   282
        test_params = test_params} thy
skalberg@15531
   283
    | SOME _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@12452
   284
  end;
berghofe@12452
   285
berghofe@12452
   286
fun add_tycodegen name f thy =
berghofe@17144
   287
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   288
    CodegenData.get thy
haftmann@17521
   289
  in (case AList.lookup (op =) tycodegens name of
skalberg@15531
   290
      NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
berghofe@12555
   291
        codegens = codegens, consts = consts, types = types,
berghofe@17144
   292
        attrs = attrs, preprocs = preprocs, modules = modules,
berghofe@17144
   293
        test_params = test_params} thy
skalberg@15531
   294
    | SOME _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@11520
   295
  end;
berghofe@11520
   296
berghofe@11520
   297
berghofe@12555
   298
(**** code attribute ****)
berghofe@12555
   299
berghofe@12555
   300
fun add_attribute name att thy =
berghofe@17144
   301
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   302
    CodegenData.get thy
haftmann@17521
   303
  in (case AList.lookup (op =) attrs name of
skalberg@15531
   304
      NONE => CodegenData.put {tycodegens = tycodegens,
berghofe@12555
   305
        codegens = codegens, consts = consts, types = types,
berghofe@15261
   306
        attrs = if name = "" then attrs @ [(name, att)] else (name, att) :: attrs,
berghofe@17144
   307
        preprocs = preprocs, modules = modules,
berghofe@15261
   308
        test_params = test_params} thy
skalberg@15531
   309
    | SOME _ => error ("Code attribute " ^ name ^ " already declared"))
berghofe@12555
   310
  end;
berghofe@12555
   311
berghofe@14197
   312
fun mk_parser (a, p) = (if a = "" then Scan.succeed "" else Args.$$$ a) |-- p;
berghofe@14197
   313
berghofe@12555
   314
val code_attr =
wenzelm@15664
   315
  Attrib.syntax (Scan.peek (fn thy => foldr op || Scan.fail (map mk_parser
wenzelm@15664
   316
    (#attrs (CodegenData.get thy)))));
berghofe@12555
   317
wenzelm@15801
   318
val _ = Context.add_setup
wenzelm@15801
   319
 [Attrib.add_attributes
wenzelm@15801
   320
  [("code", (code_attr, K Attrib.undef_local_attribute),
wenzelm@15801
   321
     "declare theorems for code generation")]];
wenzelm@15801
   322
berghofe@12555
   323
berghofe@15261
   324
(**** preprocessors ****)
berghofe@15261
   325
berghofe@15261
   326
fun add_preprocessor p thy =
berghofe@17144
   327
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@15261
   328
    CodegenData.get thy
berghofe@15261
   329
  in CodegenData.put {tycodegens = tycodegens,
berghofe@15261
   330
    codegens = codegens, consts = consts, types = types,
berghofe@15261
   331
    attrs = attrs, preprocs = (stamp (), p) :: preprocs,
berghofe@17144
   332
    modules = modules, test_params = test_params} thy
berghofe@15261
   333
  end;
berghofe@15261
   334
berghofe@15261
   335
fun preprocess thy ths =
berghofe@15261
   336
  let val {preprocs, ...} = CodegenData.get thy
skalberg@15570
   337
  in Library.foldl (fn (ths, (_, f)) => f thy ths) (ths, preprocs) end;
berghofe@15261
   338
berghofe@17549
   339
fun preprocess_term thy t =
berghofe@17549
   340
  let
berghofe@17549
   341
    val x = Free (variant (add_term_names (t, [])) "x", fastype_of t);
berghofe@17549
   342
    (* fake definition *)
berghofe@17549
   343
    val eq = setmp quick_and_dirty true (SkipProof.make_thm thy)
berghofe@17549
   344
      (Logic.mk_equals (x, t));
berghofe@17549
   345
    fun err () = error "preprocess_term: bad preprocessor"
berghofe@17549
   346
  in case map prop_of (preprocess thy [eq]) of
berghofe@17549
   347
      [Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
berghofe@17549
   348
    | _ => err ()
berghofe@17549
   349
  end;
haftmann@18281
   350
berghofe@15261
   351
fun unfold_attr (thy, eqn) =
berghofe@15261
   352
  let
berghofe@17666
   353
    val names = term_consts
berghofe@17666
   354
      (fst (Logic.dest_equals (prop_of eqn)));
berghofe@15261
   355
    fun prep thy = map (fn th =>
berghofe@17666
   356
      let val prop = prop_of th
berghofe@17666
   357
      in
berghofe@17666
   358
        if forall (fn name => exists_Const (equal name o fst) prop) names
berghofe@17666
   359
        then rewrite_rule [eqn] (Thm.transfer thy th)
berghofe@17666
   360
        else th
berghofe@17666
   361
      end)
berghofe@15261
   362
  in (add_preprocessor prep thy, eqn) end;
berghofe@15261
   363
wenzelm@15801
   364
val _ = Context.add_setup [add_attribute "unfold" (Scan.succeed unfold_attr)];
wenzelm@15801
   365
berghofe@15261
   366
berghofe@11520
   367
(**** associate constants with target language code ****)
berghofe@11520
   368
skalberg@15570
   369
fun gen_assoc_consts prep_type xs thy = Library.foldl (fn (thy, (s, tyopt, syn)) =>
berghofe@11520
   370
  let
berghofe@17144
   371
    val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   372
      CodegenData.get thy;
wenzelm@16458
   373
    val cname = Sign.intern_const thy s;
berghofe@11520
   374
  in
wenzelm@16458
   375
    (case Sign.const_type thy cname of
skalberg@15531
   376
       SOME T =>
berghofe@11520
   377
         let val T' = (case tyopt of
skalberg@15531
   378
                NONE => T
skalberg@15531
   379
              | SOME ty =>
wenzelm@16458
   380
                  let val U = prep_type thy ty
wenzelm@16458
   381
                  in if Sign.typ_instance thy (U, T) then U
berghofe@11520
   382
                    else error ("Illegal type constraint for constant " ^ cname)
berghofe@11520
   383
                  end)
haftmann@17521
   384
         in (case AList.lookup (op =) consts (cname, T') of
skalberg@15531
   385
             NONE => CodegenData.put {codegens = codegens,
berghofe@12452
   386
               tycodegens = tycodegens,
berghofe@12555
   387
               consts = ((cname, T'), syn) :: consts,
berghofe@15261
   388
               types = types, attrs = attrs, preprocs = preprocs,
berghofe@17144
   389
               modules = modules, test_params = test_params} thy
skalberg@15531
   390
           | SOME _ => error ("Constant " ^ cname ^ " already associated with code"))
berghofe@11520
   391
         end
berghofe@11520
   392
     | _ => error ("Not a constant: " ^ s))
berghofe@11520
   393
  end) (thy, xs);
berghofe@11520
   394
berghofe@11520
   395
val assoc_consts_i = gen_assoc_consts (K I);
wenzelm@16458
   396
val assoc_consts = gen_assoc_consts (typ_of oo read_ctyp);
berghofe@11520
   397
wenzelm@15801
   398
berghofe@11520
   399
(**** associate types with target language types ****)
berghofe@11520
   400
skalberg@15570
   401
fun assoc_types xs thy = Library.foldl (fn (thy, (s, syn)) =>
berghofe@11520
   402
  let
berghofe@17144
   403
    val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   404
      CodegenData.get thy;
berghofe@16649
   405
    val tc = Sign.intern_type thy s
berghofe@11520
   406
  in
haftmann@17521
   407
    (case AList.lookup (op =) types tc of
skalberg@15531
   408
       NONE => CodegenData.put {codegens = codegens,
berghofe@12452
   409
         tycodegens = tycodegens, consts = consts,
berghofe@14105
   410
         types = (tc, syn) :: types, attrs = attrs,
berghofe@17144
   411
         preprocs = preprocs, modules = modules, test_params = test_params} thy
skalberg@15531
   412
     | SOME _ => error ("Type " ^ tc ^ " already associated with code"))
berghofe@11520
   413
  end) (thy, xs);
berghofe@11520
   414
haftmann@17521
   415
fun get_assoc_type thy s = AList.lookup (op =) ((#types o CodegenData.get) thy) s;
wenzelm@11546
   416
berghofe@11520
   417
berghofe@11520
   418
(**** make valid ML identifiers ****)
berghofe@11520
   419
berghofe@14858
   420
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
berghofe@14858
   421
  Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
berghofe@14858
   422
berghofe@14858
   423
fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of
berghofe@14858
   424
    ("<" :: "^" :: xs, ">") => (true, implode xs)
berghofe@14858
   425
  | ("<" :: xs, ">") => (false, implode xs)
berghofe@14858
   426
  | _ => sys_error "dest_sym");
wenzelm@16458
   427
berghofe@14858
   428
fun mk_id s = if s = "" then "" else
berghofe@11520
   429
  let
berghofe@14858
   430
    fun check_str [] = []
berghofe@14858
   431
      | check_str xs = (case take_prefix is_ascii_letdig xs of
berghofe@14858
   432
          ([], " " :: zs) => check_str zs
berghofe@14858
   433
        | ([], z :: zs) =>
berghofe@14858
   434
          if size z = 1 then string_of_int (ord z) :: check_str zs
berghofe@14858
   435
          else (case dest_sym z of
berghofe@14858
   436
              (true, "isub") => check_str zs
berghofe@14858
   437
            | (true, "isup") => "" :: check_str zs
berghofe@14858
   438
            | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
berghofe@14858
   439
        | (ys, zs) => implode ys :: check_str zs);
berghofe@14858
   440
    val s' = space_implode "_"
skalberg@15570
   441
      (List.concat (map (check_str o Symbol.explode) (NameSpace.unpack s)))
berghofe@11520
   442
  in
berghofe@14858
   443
    if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
berghofe@11520
   444
  end;
berghofe@11520
   445
berghofe@17144
   446
fun mk_long_id (p as (tab, used)) module s =
berghofe@16649
   447
  let
berghofe@17144
   448
    fun find_name [] = sys_error "mk_long_id"
berghofe@17144
   449
      | find_name (ys :: yss) =
berghofe@17144
   450
          let
berghofe@17144
   451
            val s' = NameSpace.pack ys
berghofe@17144
   452
            val s'' = NameSpace.append module s'
wenzelm@17412
   453
          in case Symtab.lookup used s'' of
wenzelm@17261
   454
              NONE => ((module, s'),
wenzelm@17412
   455
                (Symtab.update_new (s, (module, s')) tab,
wenzelm@17412
   456
                 Symtab.update_new (s'', ()) used))
berghofe@17144
   457
            | SOME _ => find_name yss
berghofe@17144
   458
          end
wenzelm@17412
   459
  in case Symtab.lookup tab s of
berghofe@17144
   460
      NONE => find_name (Library.suffixes1 (NameSpace.unpack s))
berghofe@17144
   461
    | SOME name => (name, p)
berghofe@16649
   462
  end;
berghofe@16649
   463
berghofe@17144
   464
(* module:  module name for caller                                        *)
berghofe@17144
   465
(* module': module name for callee                                        *)
berghofe@17144
   466
(* if caller and callee reside in different modules, use qualified access *)
berghofe@16649
   467
berghofe@17144
   468
fun mk_qual_id module (module', s) =
berghofe@17144
   469
  if module = module' orelse module' = "" then s else module' ^ "." ^ s;
berghofe@17144
   470
berghofe@17144
   471
fun mk_const_id module cname (gr, (tab1, tab2)) =
berghofe@16649
   472
  let
berghofe@17144
   473
    val ((module, s), tab1') = mk_long_id tab1 module cname
berghofe@17144
   474
    val s' = mk_id s;
berghofe@16649
   475
    val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_const" else s'
berghofe@17144
   476
  in ((gr, (tab1', tab2)), (module, s'')) end;
berghofe@13073
   477
berghofe@17144
   478
fun get_const_id cname (gr, (tab1, tab2)) =
wenzelm@17412
   479
  case Symtab.lookup (fst tab1) cname of
berghofe@17144
   480
    NONE => error ("get_const_id: no such constant: " ^ quote cname)
berghofe@17144
   481
  | SOME (module, s) =>
berghofe@17144
   482
      let
berghofe@17144
   483
        val s' = mk_id s;
berghofe@17144
   484
        val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_const" else s'
berghofe@17144
   485
      in (module, s'') end;
berghofe@17144
   486
berghofe@17144
   487
fun mk_type_id module tyname (gr, (tab1, tab2)) =
berghofe@16649
   488
  let
berghofe@17144
   489
    val ((module, s), tab2') = mk_long_id tab2 module tyname
berghofe@17144
   490
    val s' = mk_id s;
berghofe@17144
   491
    val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_type" else s'
berghofe@17144
   492
  in ((gr, (tab1, tab2')), (module, s'')) end;
berghofe@16649
   493
berghofe@17144
   494
fun get_type_id tyname (gr, (tab1, tab2)) =
wenzelm@17412
   495
  case Symtab.lookup (fst tab2) tyname of
berghofe@17144
   496
    NONE => error ("get_type_id: no such type: " ^ quote tyname)
berghofe@17144
   497
  | SOME (module, s) =>
berghofe@17144
   498
      let
berghofe@17144
   499
        val s' = mk_id s;
berghofe@17144
   500
        val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_type" else s'
berghofe@17144
   501
      in (module, s'') end;
berghofe@17144
   502
berghofe@17144
   503
fun get_type_id' f tyname tab = apsnd f (get_type_id tyname tab);
berghofe@17144
   504
berghofe@17144
   505
fun get_node (gr, x) k = Graph.get_node gr k;
berghofe@17144
   506
fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
berghofe@17144
   507
fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
berghofe@17144
   508
fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
berghofe@17144
   509
fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
berghofe@17144
   510
fun new_node p (gr, x) = (Graph.new_node p gr, x);
berghofe@16649
   511
haftmann@18281
   512
fun theory_of_type s thy =
berghofe@16649
   513
  if Sign.declared_tyname thy s
berghofe@16649
   514
  then SOME (if_none (get_first (theory_of_type s) (Theory.parents_of thy)) thy)
berghofe@16649
   515
  else NONE;
berghofe@16649
   516
haftmann@18281
   517
fun theory_of_const s thy =
berghofe@16649
   518
  if Sign.declared_const thy s
berghofe@16649
   519
  then SOME (if_none (get_first (theory_of_const s) (Theory.parents_of thy)) thy)
berghofe@16649
   520
  else NONE;
berghofe@16649
   521
berghofe@16649
   522
fun thyname_of_type s thy = (case theory_of_type s thy of
berghofe@16649
   523
    NONE => error ("thyname_of_type: no such type: " ^ quote s)
berghofe@16649
   524
  | SOME thy' => Context.theory_name thy');
berghofe@16649
   525
berghofe@16649
   526
fun thyname_of_const s thy = (case theory_of_const s thy of
berghofe@16649
   527
    NONE => error ("thyname_of_const: no such constant: " ^ quote s)
berghofe@16649
   528
  | SOME thy' => Context.theory_name thy');
berghofe@11520
   529
berghofe@13731
   530
fun rename_terms ts =
berghofe@11520
   531
  let
skalberg@15574
   532
    val names = foldr add_term_names
skalberg@15574
   533
      (map (fst o fst) (Drule.vars_of_terms ts)) ts;
berghofe@14858
   534
    val reserved = names inter ThmDatabase.ml_reserved;
skalberg@15570
   535
    val (illegal, alt_names) = split_list (List.mapPartial (fn s =>
skalberg@15531
   536
      let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
berghofe@14858
   537
    val ps = (reserved @ illegal) ~~
berghofe@14858
   538
      variantlist (map (suffix "'") reserved @ alt_names, names);
berghofe@11520
   539
haftmann@17521
   540
    fun rename_id s = AList.lookup (op =) ps s |> the_default s;
berghofe@14858
   541
berghofe@14858
   542
    fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
berghofe@14858
   543
      | rename (Free (a, T)) = Free (rename_id a, T)
berghofe@11520
   544
      | rename (Abs (s, T, t)) = Abs (s, T, rename t)
berghofe@11520
   545
      | rename (t $ u) = rename t $ rename u
berghofe@11520
   546
      | rename t = t;
berghofe@11520
   547
  in
berghofe@13731
   548
    map rename ts
berghofe@13731
   549
  end;
berghofe@13731
   550
berghofe@13731
   551
val rename_term = hd o rename_terms o single;
berghofe@13731
   552
berghofe@13731
   553
berghofe@13731
   554
(**** retrieve definition of constant ****)
berghofe@13731
   555
berghofe@13731
   556
fun is_instance thy T1 T2 =
berghofe@16649
   557
  Sign.typ_instance thy (T1, Type.varifyT T2);
berghofe@13731
   558
haftmann@18098
   559
fun get_assoc_code thy s T = Option.map snd (Library.find_first (fn ((s', T'), _) =>
berghofe@13731
   560
  s = s' andalso is_instance thy T T') (#consts (CodegenData.get thy)));
berghofe@13731
   561
berghofe@16769
   562
fun get_aux_code xs = List.mapPartial (fn (m, code) =>
berghofe@16769
   563
  if m = "" orelse m mem !mode then SOME code else NONE) xs;
berghofe@16769
   564
berghofe@16649
   565
fun mk_deftab thy =
berghofe@13731
   566
  let
berghofe@16649
   567
    val axmss = map (fn thy' =>
berghofe@16649
   568
      (Context.theory_name thy', snd (#axioms (Theory.rep_theory thy'))))
berghofe@16649
   569
      (thy :: Theory.ancestors_of thy);
berghofe@15261
   570
    fun prep_def def = (case preprocess thy [def] of
berghofe@16649
   571
      [def'] => prop_of def' | _ => error "mk_deftab: bad preprocessor");
berghofe@15261
   572
    fun dest t =
berghofe@15261
   573
      let
berghofe@15261
   574
        val (lhs, rhs) = Logic.dest_equals t;
berghofe@15261
   575
        val (c, args) = strip_comb lhs;
berghofe@16649
   576
        val (s, T) = dest_Const c
berghofe@16649
   577
      in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
skalberg@15531
   578
      end handle TERM _ => NONE;
berghofe@16649
   579
    fun add_def thyname (defs, (name, t)) = (case dest t of
berghofe@16649
   580
        NONE => defs
berghofe@16649
   581
      | SOME _ => (case dest (prep_def (Thm.get_axiom thy name)) of
berghofe@16649
   582
          NONE => defs
wenzelm@17412
   583
        | SOME (s, (T, (args, rhs))) => Symtab.update
wenzelm@17261
   584
            (s, (T, (thyname, split_last (rename_terms (args @ [rhs])))) ::
wenzelm@17412
   585
            if_none (Symtab.lookup defs s) []) defs))
berghofe@13731
   586
  in
berghofe@16649
   587
    foldl (fn ((thyname, axms), defs) =>
berghofe@16649
   588
      Symtab.foldl (add_def thyname) (defs, axms)) Symtab.empty axmss
berghofe@11520
   589
  end;
berghofe@11520
   590
wenzelm@17412
   591
fun get_defn thy defs s T = (case Symtab.lookup defs s of
berghofe@16649
   592
    NONE => NONE
berghofe@16649
   593
  | SOME ds =>
berghofe@16649
   594
      let val i = find_index (is_instance thy T o fst) ds
berghofe@16649
   595
      in if i >= 0 then
berghofe@16649
   596
          SOME (List.nth (ds, i), if length ds = 1 then NONE else SOME i)
berghofe@16649
   597
        else NONE
berghofe@16649
   598
      end);
berghofe@16649
   599
berghofe@11520
   600
berghofe@12452
   601
(**** invoke suitable code generator for term / type ****)
berghofe@11520
   602
berghofe@17144
   603
fun codegen_error (gr, _) dep s =
berghofe@17144
   604
  error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
berghofe@17144
   605
berghofe@17144
   606
fun invoke_codegen thy defs dep module brack (gr, t) = (case get_first
berghofe@17144
   607
   (fn (_, f) => f thy defs gr dep module brack t) (#codegens (CodegenData.get thy)) of
berghofe@17144
   608
      NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
berghofe@17144
   609
        Sign.string_of_term thy t)
skalberg@15531
   610
    | SOME x => x);
berghofe@12452
   611
berghofe@17144
   612
fun invoke_tycodegen thy defs dep module brack (gr, T) = (case get_first
berghofe@17144
   613
   (fn (_, f) => f thy defs gr dep module brack T) (#tycodegens (CodegenData.get thy)) of
berghofe@17144
   614
      NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
berghofe@17144
   615
        Sign.string_of_typ thy T)
skalberg@15531
   616
    | SOME x => x);
berghofe@11520
   617
berghofe@11520
   618
berghofe@11520
   619
(**** code generator for mixfix expressions ****)
berghofe@11520
   620
berghofe@11520
   621
fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"];
berghofe@11520
   622
berghofe@11520
   623
fun pretty_fn [] p = [p]
berghofe@11520
   624
  | pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") ::
berghofe@11520
   625
      Pretty.brk 1 :: pretty_fn xs p;
berghofe@11520
   626
berghofe@16769
   627
fun pretty_mixfix _ _ [] [] _ = []
berghofe@16769
   628
  | pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
berghofe@16769
   629
      p :: pretty_mixfix module module' ms ps qs
berghofe@16769
   630
  | pretty_mixfix module module' (Ignore :: ms) ps qs =
berghofe@16769
   631
      pretty_mixfix module module' ms ps qs
berghofe@16769
   632
  | pretty_mixfix module module' (Module :: ms) ps qs =
berghofe@17144
   633
      (if module <> module'
berghofe@16769
   634
       then cons (Pretty.str (module' ^ ".")) else I)
berghofe@16769
   635
      (pretty_mixfix module module' ms ps qs)
berghofe@16769
   636
  | pretty_mixfix module module' (Pretty p :: ms) ps qs =
berghofe@16769
   637
      p :: pretty_mixfix module module' ms ps qs
berghofe@16769
   638
  | pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
berghofe@16769
   639
      q :: pretty_mixfix module module' ms ps qs;
berghofe@11520
   640
haftmann@18102
   641
fun replace_quotes [] [] = []
haftmann@18102
   642
  | replace_quotes xs (Arg :: ms) =
haftmann@18102
   643
      Arg :: replace_quotes xs ms
haftmann@18102
   644
  | replace_quotes xs (Ignore :: ms) =
haftmann@18102
   645
      Ignore :: replace_quotes xs ms
haftmann@18102
   646
  | replace_quotes xs (Module :: ms) =
haftmann@18102
   647
      Module :: replace_quotes xs ms
haftmann@18102
   648
  | replace_quotes xs (Pretty p :: ms) =
haftmann@18102
   649
      Pretty p :: replace_quotes xs ms
haftmann@18102
   650
  | replace_quotes (x::xs) (Quote _ :: ms) =
haftmann@18102
   651
      Quote x :: replace_quotes xs ms;
haftmann@18102
   652
haftmann@18103
   653
fun fillin_mixfix ms args f =
haftmann@18098
   654
  let
haftmann@18281
   655
    fun fillin [] [] =
haftmann@18281
   656
         []
haftmann@18281
   657
      | fillin (Arg :: ms) (a :: args) =
haftmann@18281
   658
          a :: fillin ms args
haftmann@18281
   659
      | fillin (Ignore :: ms) args =
haftmann@18281
   660
          fillin ms args
haftmann@18281
   661
      | fillin (Module :: ms) args =
haftmann@18281
   662
          fillin ms args
haftmann@18281
   663
      | fillin (Pretty p :: ms) args =
haftmann@18281
   664
          p :: fillin ms args
haftmann@18281
   665
      | fillin (Quote q :: ms) args =
haftmann@18281
   666
          (f q) :: fillin ms args
haftmann@18281
   667
  in Pretty.block (fillin ms args) end;
haftmann@18098
   668
berghofe@11520
   669
berghofe@12452
   670
(**** default code generators ****)
berghofe@11520
   671
berghofe@11520
   672
fun eta_expand t ts i =
berghofe@11520
   673
  let
berghofe@11520
   674
    val (Ts, _) = strip_type (fastype_of t);
berghofe@11520
   675
    val j = i - length ts
berghofe@11520
   676
  in
skalberg@15574
   677
    foldr (fn (T, t) => Abs ("x", T, t))
skalberg@15574
   678
      (list_comb (t, ts @ map Bound (j-1 downto 0))) (Library.take (j, Ts))
berghofe@11520
   679
  end;
berghofe@11520
   680
berghofe@11520
   681
fun mk_app _ p [] = p
berghofe@11520
   682
  | mk_app brack p ps = if brack then
berghofe@11520
   683
       Pretty.block (Pretty.str "(" ::
berghofe@11520
   684
         separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"])
berghofe@11520
   685
     else Pretty.block (separate (Pretty.brk 1) (p :: ps));
berghofe@11520
   686
berghofe@14858
   687
fun new_names t xs = variantlist (map mk_id xs,
berghofe@11520
   688
  map (fst o fst o dest_Var) (term_vars t) union
berghofe@11520
   689
  add_term_names (t, ThmDatabase.ml_reserved));
berghofe@11520
   690
berghofe@11520
   691
fun new_name t x = hd (new_names t [x]);
berghofe@11520
   692
berghofe@17144
   693
fun if_library x y = if "library" mem !mode then x else y;
berghofe@17144
   694
berghofe@17144
   695
fun default_codegen thy defs gr dep module brack t =
berghofe@11520
   696
  let
berghofe@11520
   697
    val (u, ts) = strip_comb t;
berghofe@17144
   698
    fun codegens brack = foldl_map (invoke_codegen thy defs dep module brack)
berghofe@11520
   699
  in (case u of
berghofe@14105
   700
      Var ((s, i), T) =>
berghofe@14105
   701
        let
berghofe@14105
   702
          val (gr', ps) = codegens true (gr, ts);
berghofe@17144
   703
          val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
skalberg@15531
   704
        in SOME (gr'', mk_app brack (Pretty.str (s ^
berghofe@11520
   705
           (if i=0 then "" else string_of_int i))) ps)
berghofe@11520
   706
        end
berghofe@11520
   707
berghofe@14105
   708
    | Free (s, T) =>
berghofe@14105
   709
        let
berghofe@14105
   710
          val (gr', ps) = codegens true (gr, ts);
berghofe@17144
   711
          val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
skalberg@15531
   712
        in SOME (gr'', mk_app brack (Pretty.str s) ps) end
berghofe@11520
   713
berghofe@11520
   714
    | Const (s, T) =>
berghofe@11520
   715
      (case get_assoc_code thy s T of
berghofe@16769
   716
         SOME (ms, aux) =>
haftmann@18281
   717
           let val i = num_args_of ms
berghofe@11520
   718
           in if length ts < i then
berghofe@17144
   719
               default_codegen thy defs gr dep module brack (eta_expand u ts i)
berghofe@11520
   720
             else
berghofe@11520
   721
               let
berghofe@12452
   722
                 val (ts1, ts2) = args_of ms ts;
berghofe@12452
   723
                 val (gr1, ps1) = codegens false (gr, ts1);
berghofe@12452
   724
                 val (gr2, ps2) = codegens true (gr1, ts2);
berghofe@12452
   725
                 val (gr3, ps3) = codegens false (gr2, quotes_of ms);
berghofe@17549
   726
                 val (gr4, _) = invoke_tycodegen thy defs dep module false
berghofe@17549
   727
                   (gr3, funpow (length ts) (hd o tl o snd o dest_Type) T);
berghofe@17144
   728
                 val (module', suffix) = (case get_defn thy defs s T of
berghofe@17144
   729
                     NONE => (if_library (thyname_of_const s thy) module, "")
berghofe@17144
   730
                   | SOME ((U, (module', _)), NONE) =>
berghofe@17144
   731
                       (if_library module' module, "")
berghofe@17144
   732
                   | SOME ((U, (module', _)), SOME i) =>
berghofe@17144
   733
                       (if_library module' module, " def" ^ string_of_int i));
berghofe@16769
   734
                 val node_id = s ^ suffix;
berghofe@17144
   735
                 fun p module' = mk_app brack (Pretty.block
berghofe@17144
   736
                   (pretty_mixfix module module' ms ps1 ps3)) ps2
berghofe@17549
   737
               in SOME (case try (get_node gr4) node_id of
berghofe@16769
   738
                   NONE => (case get_aux_code aux of
berghofe@17549
   739
                       [] => (gr4, p module)
berghofe@17144
   740
                     | xs => (add_edge (node_id, dep) (new_node
berghofe@17549
   741
                         (node_id, (NONE, module', space_implode "\n" xs ^ "\n")) gr4),
berghofe@17144
   742
                           p module'))
berghofe@17144
   743
                 | SOME (_, module'', _) =>
berghofe@17549
   744
                     (add_edge (node_id, dep) gr4, p module''))
berghofe@11520
   745
               end
berghofe@11520
   746
           end
berghofe@16649
   747
       | NONE => (case get_defn thy defs s T of
skalberg@15531
   748
           NONE => NONE
berghofe@17144
   749
         | SOME ((U, (thyname, (args, rhs))), k) =>
berghofe@11520
   750
             let
berghofe@17144
   751
               val module' = if_library thyname module;
berghofe@17144
   752
               val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
berghofe@16649
   753
               val node_id = s ^ suffix;
berghofe@17144
   754
               val (gr', (ps, def_id)) = codegens true (gr, ts) |>>>
berghofe@17144
   755
                 mk_const_id module' (s ^ suffix);
berghofe@17144
   756
               val p = mk_app brack (Pretty.str (mk_qual_id module def_id)) ps
berghofe@17144
   757
             in SOME (case try (get_node gr') node_id of
berghofe@17144
   758
                 NONE =>
berghofe@17144
   759
                   let
berghofe@17144
   760
                     val _ = message ("expanding definition of " ^ s);
berghofe@17144
   761
                     val (Ts, _) = strip_type T;
berghofe@17144
   762
                     val (args', rhs') =
berghofe@17144
   763
                       if not (null args) orelse null Ts then (args, rhs) else
berghofe@17144
   764
                         let val v = Free (new_name rhs "x", hd Ts)
berghofe@17144
   765
                         in ([v], betapply (rhs, v)) end;
berghofe@17144
   766
                     val (gr1, p') = invoke_codegen thy defs node_id module' false
berghofe@17144
   767
                       (add_edge (node_id, dep)
berghofe@17144
   768
                          (new_node (node_id, (NONE, "", "")) gr'), rhs');
berghofe@17144
   769
                     val (gr2, xs) = codegens false (gr1, args');
berghofe@17144
   770
                     val (gr3, _) = invoke_tycodegen thy defs dep module false (gr2, T);
berghofe@17144
   771
                     val (gr4, ty) = invoke_tycodegen thy defs node_id module' false (gr3, U);
berghofe@17144
   772
                   in (map_node node_id (K (NONE, module', Pretty.string_of
berghofe@17144
   773
                       (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   774
                         (if null args' then
berghofe@17144
   775
                            [Pretty.str ("val " ^ snd def_id ^ " :"), ty]
berghofe@17144
   776
                          else Pretty.str ("fun " ^ snd def_id) :: xs) @
berghofe@17144
   777
                        [Pretty.str " =", Pretty.brk 1, p', Pretty.str ";"])) ^ "\n\n")) gr4,
berghofe@17144
   778
                     p)
berghofe@17144
   779
                   end
berghofe@17144
   780
               | SOME _ => (add_edge (node_id, dep) gr', p))
berghofe@11520
   781
             end))
berghofe@11520
   782
berghofe@11520
   783
    | Abs _ =>
berghofe@11520
   784
      let
berghofe@11520
   785
        val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
berghofe@11520
   786
        val t = strip_abs_body u
berghofe@11520
   787
        val bs' = new_names t bs;
berghofe@12452
   788
        val (gr1, ps) = codegens true (gr, ts);
berghofe@17144
   789
        val (gr2, p) = invoke_codegen thy defs dep module false
berghofe@12452
   790
          (gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t));
berghofe@11520
   791
      in
skalberg@15531
   792
        SOME (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @
berghofe@11520
   793
          [Pretty.str ")"])) ps)
berghofe@11520
   794
      end
berghofe@11520
   795
skalberg@15531
   796
    | _ => NONE)
berghofe@11520
   797
  end;
berghofe@11520
   798
berghofe@17144
   799
fun default_tycodegen thy defs gr dep module brack (TVar ((s, i), _)) =
skalberg@15531
   800
      SOME (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i)))
berghofe@17144
   801
  | default_tycodegen thy defs gr dep module brack (TFree (s, _)) =
berghofe@16649
   802
      SOME (gr, Pretty.str s)
berghofe@17144
   803
  | default_tycodegen thy defs gr dep module brack (Type (s, Ts)) =
haftmann@17521
   804
      (case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
skalberg@15531
   805
         NONE => NONE
berghofe@16769
   806
       | SOME (ms, aux) =>
berghofe@12452
   807
           let
berghofe@12452
   808
             val (gr', ps) = foldl_map
berghofe@17144
   809
               (invoke_tycodegen thy defs dep module false)
berghofe@16649
   810
               (gr, fst (args_of ms Ts));
berghofe@12452
   811
             val (gr'', qs) = foldl_map
berghofe@17144
   812
               (invoke_tycodegen thy defs dep module false)
berghofe@16769
   813
               (gr', quotes_of ms);
berghofe@17144
   814
             val module' = if_library (thyname_of_type s thy) module;
berghofe@16769
   815
             val node_id = s ^ " (type)";
berghofe@17144
   816
             fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
berghofe@17144
   817
           in SOME (case try (get_node gr'') node_id of
berghofe@16769
   818
               NONE => (case get_aux_code aux of
berghofe@17144
   819
                   [] => (gr'', p module')
berghofe@17144
   820
                 | xs => (fst (mk_type_id module' s
berghofe@17144
   821
                       (add_edge (node_id, dep) (new_node (node_id,
berghofe@17144
   822
                         (NONE, module', space_implode "\n" xs ^ "\n")) gr''))),
berghofe@17144
   823
                     p module'))
berghofe@17144
   824
             | SOME (_, module'', _) =>
berghofe@17144
   825
                 (add_edge (node_id, dep) gr'', p module''))
berghofe@16769
   826
           end);
berghofe@12452
   827
wenzelm@15801
   828
val _ = Context.add_setup
wenzelm@15801
   829
 [add_codegen "default" default_codegen,
wenzelm@15801
   830
  add_tycodegen "default" default_tycodegen];
wenzelm@15801
   831
berghofe@11520
   832
berghofe@16649
   833
fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
berghofe@16649
   834
haftmann@17521
   835
fun add_to_module name s = AList.map_entry (op =) name (suffix s);
berghofe@16649
   836
berghofe@17144
   837
fun output_code gr module xs =
berghofe@16649
   838
  let
berghofe@17144
   839
    val code = List.mapPartial (fn s =>
berghofe@17144
   840
      let val c as (_, module', _) = Graph.get_node gr s
berghofe@17144
   841
      in if module = "" orelse module = module' then SOME (s, c) else NONE end)
berghofe@17144
   842
        (rev (Graph.all_preds gr xs));
berghofe@16649
   843
    fun string_of_cycle (a :: b :: cs) =
berghofe@16649
   844
          let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
berghofe@16649
   845
            if a = a' then Option.map (pair x)
haftmann@18098
   846
              (Library.find_first (equal b o #2 o Graph.get_node gr)
berghofe@16649
   847
                (Graph.imm_succs gr x))
berghofe@16649
   848
            else NONE) code
berghofe@16649
   849
          in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
berghofe@16649
   850
      | string_of_cycle _ = ""
berghofe@16649
   851
  in
berghofe@17144
   852
    if module = "" then
berghofe@16649
   853
      let
berghofe@16649
   854
        val modules = distinct (map (#2 o snd) code);
berghofe@16649
   855
        val mod_gr = foldr (uncurry Graph.add_edge_acyclic)
berghofe@16649
   856
          (foldr (uncurry (Graph.new_node o rpair ())) Graph.empty modules)
berghofe@17144
   857
          (List.concat (map (fn (s, (_, module, _)) => map (pair module)
berghofe@17144
   858
            (filter_out (equal module) (map (#2 o Graph.get_node gr)
berghofe@16649
   859
              (Graph.imm_succs gr s)))) code));
berghofe@16649
   860
        val modules' =
berghofe@16649
   861
          rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
berghofe@16649
   862
      in
berghofe@17144
   863
        foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
berghofe@16649
   864
          (map (rpair "") modules') code
berghofe@16649
   865
      end handle Graph.CYCLES (cs :: _) =>
berghofe@16649
   866
        error ("Cyclic dependency of modules:\n" ^ commas cs ^
berghofe@16649
   867
          "\n" ^ string_of_cycle cs)
berghofe@17144
   868
    else [(module, implode (map (#3 o snd) code))]
berghofe@16649
   869
  end;
berghofe@11520
   870
berghofe@17144
   871
fun gen_generate_code prep_term thy modules module =
berghofe@14598
   872
  setmp print_mode [] (Pretty.setmp_margin (!margin) (fn xs =>
berghofe@11520
   873
  let
berghofe@17144
   874
    val _ = assert (module <> "" orelse
berghofe@17144
   875
        "library" mem !mode andalso forall (equal "" o fst) xs)
berghofe@17144
   876
      "missing module name";
berghofe@17144
   877
    val graphs = get_modules thy;
berghofe@16649
   878
    val defs = mk_deftab thy;
berghofe@17144
   879
    val gr = new_node ("<Top>", (NONE, module, ""))
berghofe@17144
   880
      (foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
berghofe@17144
   881
        (Graph.merge (fn ((_, module, _), (_, module', _)) =>
berghofe@17144
   882
           module = module') (gr, gr'),
berghofe@17144
   883
         (merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
wenzelm@17412
   884
           (map (fn s => case Symtab.lookup graphs s of
berghofe@17144
   885
                NONE => error ("Undefined code module: " ^ s)
berghofe@17144
   886
              | SOME gr => gr) modules))
berghofe@17144
   887
      handle Graph.DUPS ks => error ("Duplicate code for " ^ commas ks);
berghofe@16649
   888
    fun expand (t as Abs _) = t
berghofe@16649
   889
      | expand t = (case fastype_of t of
berghofe@16649
   890
          Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
berghofe@11520
   891
    val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s)
berghofe@17144
   892
      (invoke_codegen thy defs "<Top>" module false (gr, t)))
berghofe@17549
   893
        (gr, map (apsnd (expand o preprocess_term thy o prep_term thy)) xs);
berghofe@17144
   894
    val code = List.mapPartial
berghofe@17144
   895
      (fn ("", _) => NONE
berghofe@17144
   896
        | (s', p) => SOME (Pretty.string_of (Pretty.block
berghofe@17144
   897
          [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"]))) ps;
berghofe@17144
   898
    val code' = space_implode "\n\n" code ^ "\n\n";
berghofe@17144
   899
    val code'' =
berghofe@17144
   900
      List.mapPartial (fn (name, s) =>
berghofe@17144
   901
          if "library" mem !mode andalso name = module andalso null code
berghofe@17144
   902
          then NONE
berghofe@17144
   903
          else SOME (name, mk_struct name s))
berghofe@17144
   904
        ((if null code then I
berghofe@17144
   905
          else add_to_module module code')
berghofe@17144
   906
           (output_code (fst gr') (if_library "" module) ["<Top>"]))
berghofe@16649
   907
  in
berghofe@17144
   908
    (code'', del_nodes ["<Top>"] gr')
berghofe@16649
   909
  end));
berghofe@11520
   910
berghofe@11520
   911
val generate_code_i = gen_generate_code (K I);
berghofe@11520
   912
val generate_code = gen_generate_code
wenzelm@16458
   913
  (fn thy => term_of o read_cterm thy o rpair TypeInfer.logicT);
berghofe@11520
   914
berghofe@12452
   915
berghofe@13753
   916
(**** Reflection ****)
berghofe@13753
   917
berghofe@13753
   918
val strip_tname = implode o tl o explode;
berghofe@13753
   919
berghofe@13753
   920
fun pretty_list xs = Pretty.block (Pretty.str "[" ::
skalberg@15570
   921
  List.concat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
berghofe@13753
   922
  [Pretty.str "]"]);
berghofe@13753
   923
berghofe@13753
   924
fun mk_type p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   925
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
berghofe@13753
   926
  | mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T")
berghofe@13753
   927
  | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@13753
   928
      [Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","),
berghofe@13753
   929
       Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]);
berghofe@13753
   930
berghofe@17144
   931
fun mk_term_of gr module p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   932
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
berghofe@17144
   933
  | mk_term_of gr module p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F")
berghofe@17144
   934
  | mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
berghofe@16649
   935
      (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   936
        (Pretty.str (mk_qual_id module
berghofe@17144
   937
          (get_type_id' (fn s' => "term_of_" ^ s') s gr)) ::
berghofe@16649
   938
        List.concat (map (fn T =>
berghofe@17144
   939
          [mk_term_of gr module true T, mk_type true T]) Ts))));
berghofe@13753
   940
berghofe@13753
   941
berghofe@14105
   942
(**** Test data generators ****)
berghofe@14105
   943
berghofe@17144
   944
fun mk_gen gr module p xs a (TVar ((s, i), _)) = Pretty.str
berghofe@14105
   945
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
berghofe@17144
   946
  | mk_gen gr module p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G")
berghofe@17144
   947
  | mk_gen gr module p xs a (Type (s, Ts)) = (if p then parens else I)
berghofe@16649
   948
      (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   949
        (Pretty.str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') s gr) ^
berghofe@16649
   950
          (if s mem xs then "'" else "")) ::
berghofe@17144
   951
         map (mk_gen gr module true xs a) Ts @
berghofe@16649
   952
         (if s mem xs then [Pretty.str a] else []))));
berghofe@14105
   953
skalberg@15531
   954
val test_fn : (int -> (string * term) list option) ref = ref (fn _ => NONE);
berghofe@14105
   955
berghofe@17638
   956
fun test_term thy sz i t =
berghofe@14105
   957
  let
berghofe@14105
   958
    val _ = assert (null (term_tvars t) andalso null (term_tfrees t))
berghofe@14105
   959
      "Term to be tested contains type variables";
berghofe@14105
   960
    val _ = assert (null (term_vars t))
berghofe@14105
   961
      "Term to be tested contains schematic variables";
berghofe@14105
   962
    val frees = map dest_Free (term_frees t);
berghofe@17549
   963
    val frees' = frees ~~
berghofe@17549
   964
      map (fn i => "arg" ^ string_of_int i) (1 upto length frees);
berghofe@17144
   965
    val (code, gr) = setmp mode ["term_of", "test"]
berghofe@17144
   966
      (generate_code_i thy [] "Generated") [("testf", list_abs_free (frees, t))];
berghofe@17638
   967
    val s = setmp print_mode [] (fn () => "structure TestTerm =\nstruct\n\n" ^
berghofe@17144
   968
      space_implode "\n" (map snd code) ^
berghofe@16649
   969
      "\nopen Generated;\n\n" ^ Pretty.string_of
berghofe@14105
   970
        (Pretty.block [Pretty.str "val () = Codegen.test_fn :=",
berghofe@17549
   971
          Pretty.brk 1, Pretty.str ("(fn i =>"), Pretty.brk 1,
berghofe@14105
   972
          Pretty.blk (0, [Pretty.str "let", Pretty.brk 1,
berghofe@17549
   973
            Pretty.blk (0, separate Pretty.fbrk (map (fn ((s, T), s') =>
berghofe@17549
   974
              Pretty.block [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1,
berghofe@17144
   975
              mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
berghofe@17549
   976
              Pretty.str "i;"]) frees')),
berghofe@14105
   977
            Pretty.brk 1, Pretty.str "in", Pretty.brk 1,
berghofe@14105
   978
            Pretty.block [Pretty.str "if ",
berghofe@17549
   979
              mk_app false (Pretty.str "testf") (map (Pretty.str o snd) frees'),
skalberg@15531
   980
              Pretty.brk 1, Pretty.str "then NONE",
berghofe@14105
   981
              Pretty.brk 1, Pretty.str "else ",
skalberg@15531
   982
              Pretty.block [Pretty.str "SOME ", Pretty.block (Pretty.str "[" ::
skalberg@15570
   983
                List.concat (separate [Pretty.str ",", Pretty.brk 1]
berghofe@17549
   984
                  (map (fn ((s, T), s') => [Pretty.block
berghofe@15326
   985
                    [Pretty.str ("(" ^ Library.quote (Symbol.escape s) ^ ","), Pretty.brk 1,
berghofe@17144
   986
                     mk_app false (mk_term_of gr "Generated" false T)
berghofe@17549
   987
                       [Pretty.str s'], Pretty.str ")"]]) frees')) @
berghofe@14105
   988
                  [Pretty.str "]"])]],
wenzelm@14980
   989
            Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^
berghofe@17638
   990
      "\n\nend;\n") ();
berghofe@14105
   991
    val _ = use_text Context.ml_output false s;
skalberg@15531
   992
    fun iter f k = if k > i then NONE
berghofe@14135
   993
      else (case (f () handle Match =>
skalberg@15531
   994
          (warning "Exception Match raised in generated code"; NONE)) of
skalberg@15531
   995
        NONE => iter f (k+1) | SOME x => SOME x);
skalberg@15531
   996
    fun test k = if k > sz then NONE
berghofe@14105
   997
      else (priority ("Test data size: " ^ string_of_int k);
berghofe@14105
   998
        case iter (fn () => !test_fn k) 1 of
skalberg@15531
   999
          NONE => test (k+1) | SOME x => SOME x);
berghofe@17638
  1000
  in test 0 end;
berghofe@14105
  1001
berghofe@14105
  1002
fun test_goal ({size, iterations, default_type}, tvinsts) i st =
berghofe@14105
  1003
  let
wenzelm@16458
  1004
    val thy = Toplevel.theory_of st;
berghofe@14105
  1005
    fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t
berghofe@14105
  1006
      | strip t = t;
berghofe@14105
  1007
    val (gi, frees) = Logic.goal_params
berghofe@14105
  1008
      (prop_of (snd (snd (Proof.get_goal (Toplevel.proof_of st))))) i;
wenzelm@16458
  1009
    val gi' = ObjectLogic.atomize_term thy (map_term_types
haftmann@17521
  1010
      (map_type_tfree (fn p as (s, _) => getOpt (AList.lookup (op =) tvinsts s,
haftmann@17521
  1011
        getOpt (default_type, TFree p)))) (subst_bounds (frees, strip gi)));
berghofe@14105
  1012
  in case test_term (Toplevel.theory_of st) size iterations gi' of
skalberg@15531
  1013
      NONE => writeln "No counterexamples found."
skalberg@15531
  1014
    | SOME cex => writeln ("Counterexample found:\n" ^
berghofe@14105
  1015
        Pretty.string_of (Pretty.chunks (map (fn (s, t) =>
berghofe@14105
  1016
          Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1,
wenzelm@16458
  1017
            Sign.pretty_term thy t]) cex)))
berghofe@14105
  1018
  end;
berghofe@14105
  1019
berghofe@14105
  1020
berghofe@17549
  1021
(**** Evaluator for terms ****)
berghofe@17549
  1022
berghofe@17549
  1023
val eval_result = ref (Bound 0);
berghofe@17549
  1024
berghofe@17549
  1025
fun eval_term thy = setmp print_mode [] (fn t =>
berghofe@17549
  1026
  let
berghofe@17549
  1027
    val _ = assert (null (term_tvars t) andalso null (term_tfrees t))
berghofe@17549
  1028
      "Term to be evaluated contains type variables";
berghofe@17549
  1029
    val _ = assert (null (term_vars t) andalso null (term_frees t))
berghofe@17549
  1030
      "Term to be evaluated contains variables";
berghofe@17549
  1031
    val (code, gr) = setmp mode ["term_of"]
berghofe@17549
  1032
      (generate_code_i thy [] "Generated") [("result", t)];
berghofe@17549
  1033
    val s = "structure EvalTerm =\nstruct\n\n" ^
berghofe@17549
  1034
      space_implode "\n" (map snd code) ^
berghofe@17549
  1035
      "\nopen Generated;\n\n" ^ Pretty.string_of
berghofe@17549
  1036
        (Pretty.block [Pretty.str "val () = Codegen.eval_result :=",
berghofe@17549
  1037
          Pretty.brk 1,
berghofe@17549
  1038
          mk_app false (mk_term_of gr "Generated" false (fastype_of t))
berghofe@17549
  1039
            [Pretty.str "result"],
berghofe@17549
  1040
          Pretty.str ";"])  ^
berghofe@17549
  1041
      "\n\nend;\n";
berghofe@17549
  1042
    val _ = use_text Context.ml_output false s
berghofe@17549
  1043
  in !eval_result end);
berghofe@17549
  1044
berghofe@17549
  1045
fun print_evaluated_term s = Toplevel.keep (fn state =>
berghofe@17549
  1046
  let
berghofe@17549
  1047
    val state' = Toplevel.enter_forward_proof state;
berghofe@17549
  1048
    val ctxt = Proof.context_of state';
berghofe@17549
  1049
    val t = eval_term (Proof.theory_of state') (ProofContext.read_term ctxt s);
berghofe@17549
  1050
    val T = Term.type_of t;
berghofe@17549
  1051
  in
berghofe@17549
  1052
    writeln (Pretty.string_of
berghofe@17549
  1053
      (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
berghofe@17549
  1054
        Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)]))
berghofe@17549
  1055
  end);
berghofe@17549
  1056
berghofe@17549
  1057
berghofe@12452
  1058
(**** Interface ****)
berghofe@12452
  1059
berghofe@13731
  1060
val str = setmp print_mode [] Pretty.str;
berghofe@13731
  1061
berghofe@11520
  1062
fun parse_mixfix rd s =
berghofe@11520
  1063
  (case Scan.finite Symbol.stopper (Scan.repeat
berghofe@11520
  1064
     (   $$ "_" >> K Arg
berghofe@11520
  1065
      || $$ "?" >> K Ignore
berghofe@16769
  1066
      || $$ "\\<module>" >> K Module
berghofe@11520
  1067
      || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
berghofe@11520
  1068
      || $$ "{" |-- $$ "*" |-- Scan.repeat1
berghofe@11520
  1069
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@11520
  1070
            || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.not_eof)) --|
berghofe@12452
  1071
         $$ "*" --| $$ "}" >> (Quote o rd o implode)
berghofe@11520
  1072
      || Scan.repeat1
berghofe@11520
  1073
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@16769
  1074
            || Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
berghofe@13731
  1075
                 (Scan.one Symbol.not_eof)) >> (Pretty o str o implode)))
berghofe@11520
  1076
       (Symbol.explode s) of
berghofe@11520
  1077
     (p, []) => p
berghofe@11520
  1078
   | _ => error ("Malformed annotation: " ^ quote s));
berghofe@11520
  1079
wenzelm@15801
  1080
val _ = Context.add_setup
berghofe@16769
  1081
  [assoc_types [("fun", (parse_mixfix (K dummyT) "(_ ->/ _)",
berghofe@16769
  1082
     [("term_of",
berghofe@16769
  1083
       "fun term_of_fun_type _ T _ U _ = Free (\"<function>\", T --> U);\n"),
berghofe@16769
  1084
      ("test",
berghofe@16769
  1085
       "fun gen_fun_type _ G i =\n\
berghofe@16769
  1086
       \  let\n\
berghofe@16769
  1087
       \    val f = ref (fn x => raise ERROR);\n\
berghofe@16769
  1088
       \    val _ = (f := (fn x =>\n\
berghofe@16769
  1089
       \      let\n\
berghofe@16769
  1090
       \        val y = G i;\n\
berghofe@16769
  1091
       \        val f' = !f\n\
berghofe@16769
  1092
       \      in (f := (fn x' => if x = x' then y else f' x'); y) end))\n\
berghofe@16769
  1093
       \  in (fn x => !f x) end;\n")]))]];
wenzelm@15801
  1094
wenzelm@15801
  1095
wenzelm@17057
  1096
structure P = OuterParse and K = OuterKeyword;
berghofe@11520
  1097
berghofe@17144
  1098
fun strip_whitespace s = implode (fst (take_suffix (equal "\n" orf equal " ")
berghofe@17144
  1099
  (snd (take_prefix (equal "\n" orf equal " ") (explode s))))) ^ "\n";
berghofe@16769
  1100
berghofe@16769
  1101
val parse_attach = Scan.repeat (P.$$$ "attach" |--
berghofe@16769
  1102
  Scan.optional (P.$$$ "(" |-- P.xname --| P.$$$ ")") "" --
berghofe@17144
  1103
    (P.verbatim >> strip_whitespace));
berghofe@16769
  1104
berghofe@11520
  1105
val assoc_typeP =
berghofe@11520
  1106
  OuterSyntax.command "types_code"
wenzelm@11546
  1107
  "associate types with target language types" K.thy_decl
berghofe@16769
  1108
    (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
berghofe@12452
  1109
     (fn xs => Toplevel.theory (fn thy => assoc_types
berghofe@16769
  1110
       (map (fn ((name, mfx), aux) => (name, (parse_mixfix
berghofe@16769
  1111
         (typ_of o read_ctyp thy) mfx, aux))) xs) thy)));
berghofe@11520
  1112
berghofe@11520
  1113
val assoc_constP =
berghofe@11520
  1114
  OuterSyntax.command "consts_code"
wenzelm@11546
  1115
  "associate constants with target language code" K.thy_decl
berghofe@11520
  1116
    (Scan.repeat1
wenzelm@13003
  1117
       (P.xname -- (Scan.option (P.$$$ "::" |-- P.typ)) --|
berghofe@16769
  1118
        P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
berghofe@11520
  1119
     (fn xs => Toplevel.theory (fn thy => assoc_consts
berghofe@16769
  1120
       (map (fn (((name, optype), mfx), aux) => (name, optype, (parse_mixfix
berghofe@16769
  1121
         (term_of o read_cterm thy o rpair TypeInfer.logicT) mfx, aux)))
berghofe@11520
  1122
           xs) thy)));
berghofe@11520
  1123
berghofe@17144
  1124
fun parse_code lib =
berghofe@17144
  1125
  Scan.optional (P.$$$ "(" |-- P.enum "," P.xname --| P.$$$ ")") (!mode) --
berghofe@17144
  1126
  (if lib then Scan.optional P.name "" else P.name) --
berghofe@17144
  1127
  Scan.option (P.$$$ "file" |-- P.name) --
berghofe@17144
  1128
  (if lib then Scan.succeed []
berghofe@17144
  1129
   else Scan.optional (P.$$$ "imports" |-- Scan.repeat1 P.name) []) --|
berghofe@17144
  1130
  P.$$$ "contains" --
berghofe@17144
  1131
  (   Scan.repeat1 (P.name --| P.$$$ "=" -- P.term)
berghofe@17144
  1132
   || Scan.repeat1 (P.term >> pair "")) >>
berghofe@17144
  1133
  (fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
berghofe@17144
  1134
     let
berghofe@17144
  1135
       val mode'' = if lib then "library" ins (mode' \ "library")
berghofe@17144
  1136
         else mode' \ "library";
berghofe@17144
  1137
       val (code, gr) = setmp mode mode'' (generate_code thy modules module) xs
berghofe@17144
  1138
     in ((case opt_fname of
berghofe@17144
  1139
         NONE => use_text Context.ml_output false
berghofe@17144
  1140
           (space_implode "\n" (map snd code))
berghofe@17144
  1141
       | SOME fname =>
berghofe@17144
  1142
           if lib then
berghofe@17144
  1143
             app (fn (name, s) => File.write
berghofe@17144
  1144
                 (Path.append (Path.unpack fname) (Path.basic (name ^ ".ML"))) s)
berghofe@17144
  1145
               (("ROOT", implode (map (fn (name, _) =>
berghofe@17144
  1146
                   "use \"" ^ name ^ ".ML\";\n") code)) :: code)
berghofe@17144
  1147
           else File.write (Path.unpack fname) (snd (hd code)));
berghofe@17144
  1148
           if lib then thy
wenzelm@17412
  1149
           else map_modules (Symtab.update (module, gr)) thy)
berghofe@17144
  1150
     end));
berghofe@17144
  1151
berghofe@17144
  1152
val code_libraryP =
berghofe@17144
  1153
  OuterSyntax.command "code_library"
berghofe@17144
  1154
    "generates code for terms (one structure for each theory)" K.thy_decl
berghofe@17144
  1155
    (parse_code true);
berghofe@17144
  1156
berghofe@17144
  1157
val code_moduleP =
berghofe@17144
  1158
  OuterSyntax.command "code_module"
berghofe@17144
  1159
    "generates code for terms (single structure, incremental)" K.thy_decl
berghofe@17144
  1160
    (parse_code false);
berghofe@11520
  1161
berghofe@14105
  1162
val params =
berghofe@14105
  1163
  [("size", P.nat >> (K o set_size)),
berghofe@14105
  1164
   ("iterations", P.nat >> (K o set_iterations)),
berghofe@14105
  1165
   ("default_type", P.typ >> set_default_type)];
berghofe@14105
  1166
berghofe@14105
  1167
val parse_test_params = P.short_ident :-- (fn s =>
haftmann@17521
  1168
  P.$$$ "=" |-- (AList.lookup (op =) params s |> the_default Scan.fail)) >> snd;
berghofe@14105
  1169
berghofe@14105
  1170
fun parse_tyinst xs =
wenzelm@16458
  1171
  (P.type_ident --| P.$$$ "=" -- P.typ >> (fn (v, s) => fn thy =>
wenzelm@16458
  1172
    fn (x, ys) => (x, (v, typ_of (read_ctyp thy s)) :: ys))) xs;
berghofe@14105
  1173
berghofe@14105
  1174
fun app [] x = x
berghofe@14105
  1175
  | app (f :: fs) x = app fs (f x);
berghofe@14105
  1176
berghofe@14105
  1177
val test_paramsP =
berghofe@14105
  1178
  OuterSyntax.command "quickcheck_params" "set parameters for random testing" K.thy_decl
berghofe@14105
  1179
    (P.$$$ "[" |-- P.list1 parse_test_params --| P.$$$ "]" >>
berghofe@14105
  1180
      (fn fs => Toplevel.theory (fn thy =>
berghofe@16649
  1181
         map_test_params (app (map (fn f => f thy) fs)) thy)));
berghofe@14105
  1182
berghofe@14105
  1183
val testP =
berghofe@14105
  1184
  OuterSyntax.command "quickcheck" "try to find counterexample for subgoal" K.diag
berghofe@14105
  1185
  (Scan.option (P.$$$ "[" |-- P.list1
wenzelm@16458
  1186
    (   parse_test_params >> (fn f => fn thy => apfst (f thy))
berghofe@14105
  1187
     || parse_tyinst) --| P.$$$ "]") -- Scan.optional P.nat 1 >>
berghofe@14105
  1188
    (fn (ps, g) => Toplevel.keep (fn st =>
skalberg@15570
  1189
      test_goal (app (getOpt (Option.map
skalberg@15570
  1190
          (map (fn f => f (Toplevel.sign_of st))) ps, []))
berghofe@14105
  1191
        (get_test_params (Toplevel.theory_of st), [])) g st)));
berghofe@14105
  1192
berghofe@17549
  1193
val valueP =
berghofe@17549
  1194
  OuterSyntax.improper_command "value" "read, evaluate and print term" K.diag
berghofe@17549
  1195
    (P.term >> (Toplevel.no_timing oo print_evaluated_term));
berghofe@17549
  1196
berghofe@17144
  1197
val _ = OuterSyntax.add_keywords ["attach", "file", "contains"];
berghofe@16769
  1198
wenzelm@15801
  1199
val _ = OuterSyntax.add_parsers
berghofe@17549
  1200
  [assoc_typeP, assoc_constP, code_libraryP, code_moduleP, test_paramsP, testP, valueP];
berghofe@11520
  1201
berghofe@11520
  1202
end;