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