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