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