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