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