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