src/Pure/Isar/code.ML
author wenzelm
Sun Nov 08 18:43:42 2009 +0100 (2009-11-08 ago)
changeset 33522 737589bb9bb8
parent 33519 e31a85f92ce9
child 33531 2c0a4adbcf13
permissions -rw-r--r--
adapted Theory_Data;
tuned;
haftmann@24219
     1
(*  Title:      Pure/Isar/code.ML
haftmann@24219
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24219
     3
haftmann@31962
     4
Abstract executable code of theory.  Management of data dependent on
haftmann@31962
     5
executable code.  Cache assumes non-concurrent processing of a single theory.
haftmann@24219
     6
*)
haftmann@24219
     7
haftmann@24219
     8
signature CODE =
haftmann@24219
     9
sig
haftmann@31957
    10
  (*constants*)
haftmann@31957
    11
  val check_const: theory -> term -> string
haftmann@31957
    12
  val read_bare_const: theory -> string -> string * typ
haftmann@31957
    13
  val read_const: theory -> string -> string
haftmann@31962
    14
  val string_of_const: theory -> string -> string
haftmann@31962
    15
  val args_number: theory -> string -> int
haftmann@31957
    16
haftmann@31156
    17
  (*constructor sets*)
haftmann@31156
    18
  val constrset_of_consts: theory -> (string * typ) list
haftmann@31156
    19
    -> string * ((string * sort) list * (string * typ list) list)
haftmann@31156
    20
haftmann@31156
    21
  (*code equations*)
haftmann@31962
    22
  val mk_eqn: theory -> thm * bool -> thm * bool
haftmann@31962
    23
  val mk_eqn_warning: theory -> thm -> (thm * bool) option
haftmann@31962
    24
  val mk_eqn_liberal: theory -> thm -> (thm * bool) option
haftmann@31156
    25
  val assert_eqn: theory -> thm * bool -> thm * bool
haftmann@31156
    26
  val assert_eqns_const: theory -> string
haftmann@31156
    27
    -> (thm * bool) list -> (thm * bool) list
haftmann@31957
    28
  val const_typ_eqn: theory -> thm -> string * typ
haftmann@31156
    29
  val typscheme_eqn: theory -> thm -> (string * sort) list * typ
haftmann@32873
    30
  val typscheme_eqns: theory -> string -> thm list -> (string * sort) list * typ
haftmann@32929
    31
  val standard_typscheme: theory -> thm list -> thm list
haftmann@31156
    32
haftmann@31962
    33
  (*executable code*)
haftmann@31156
    34
  val add_datatype: (string * typ) list -> theory -> theory
haftmann@31156
    35
  val add_datatype_cmd: string list -> theory -> theory
haftmann@31156
    36
  val type_interpretation:
haftmann@31156
    37
    (string * ((string * sort) list * (string * typ list) list)
haftmann@31156
    38
      -> theory -> theory) -> theory -> theory
haftmann@28368
    39
  val add_eqn: thm -> theory -> theory
haftmann@31088
    40
  val add_nbe_eqn: thm -> theory -> theory
haftmann@28368
    41
  val add_default_eqn: thm -> theory -> theory
haftmann@28703
    42
  val add_default_eqn_attribute: attribute
haftmann@28703
    43
  val add_default_eqn_attrib: Attrib.src
haftmann@28368
    44
  val del_eqn: thm -> theory -> theory
haftmann@28368
    45
  val del_eqns: string -> theory -> theory
haftmann@24844
    46
  val add_case: thm -> theory -> theory
haftmann@24844
    47
  val add_undefined: string -> theory -> theory
haftmann@24219
    48
  val get_datatype: theory -> string -> ((string * sort) list * (string * typ list) list)
haftmann@24423
    49
  val get_datatype_of_constr: theory -> string -> string option
haftmann@31156
    50
  val these_eqns: theory -> string -> (thm * bool) list
haftmann@31642
    51
  val all_eqns: theory -> (thm * bool) list
haftmann@30023
    52
  val get_case_scheme: theory -> string -> (int * (int * string list)) option
haftmann@31890
    53
  val undefineds: theory -> string list
haftmann@24219
    54
  val print_codesetup: theory -> unit
haftmann@31957
    55
haftmann@31957
    56
  (*infrastructure*)
haftmann@31998
    57
  val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory
haftmann@31957
    58
  val purge_data: theory -> theory
haftmann@24219
    59
end;
haftmann@24219
    60
haftmann@24219
    61
signature CODE_DATA_ARGS =
haftmann@24219
    62
sig
haftmann@24219
    63
  type T
haftmann@24219
    64
  val empty: T
haftmann@27609
    65
  val purge: theory -> string list -> T -> T
haftmann@24219
    66
end;
haftmann@24219
    67
haftmann@24219
    68
signature CODE_DATA =
haftmann@24219
    69
sig
haftmann@24219
    70
  type T
haftmann@24219
    71
  val get: theory -> T
haftmann@24219
    72
  val change: theory -> (T -> T) -> T
haftmann@24219
    73
  val change_yield: theory -> (T -> 'a * T) -> 'a * T
haftmann@24219
    74
end;
haftmann@24219
    75
haftmann@24219
    76
signature PRIVATE_CODE =
haftmann@24219
    77
sig
haftmann@24219
    78
  include CODE
haftmann@27609
    79
  val declare_data: Object.T -> (theory -> string list -> Object.T -> Object.T)
haftmann@27609
    80
    -> serial
haftmann@24219
    81
  val get_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    82
    -> theory -> 'a
haftmann@24219
    83
  val change_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    84
    -> theory -> ('a -> 'a) -> 'a
haftmann@24219
    85
  val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    86
    -> theory -> ('a -> 'b * 'a) -> 'b * 'a
haftmann@24219
    87
end;
haftmann@24219
    88
haftmann@24219
    89
structure Code : PRIVATE_CODE =
haftmann@24219
    90
struct
haftmann@24219
    91
haftmann@31962
    92
(** auxiliary **)
haftmann@31962
    93
haftmann@31962
    94
(* printing *)
haftmann@31156
    95
wenzelm@32966
    96
fun string_of_typ thy = setmp_CRITICAL show_sorts true (Syntax.string_of_typ_global thy);
haftmann@31962
    97
haftmann@31156
    98
fun string_of_const thy c = case AxClass.inst_of_param thy c
haftmann@31156
    99
 of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco)
haftmann@31156
   100
  | NONE => Sign.extern_const thy c;
haftmann@31156
   101
haftmann@31962
   102
haftmann@31962
   103
(* constants *)
haftmann@31156
   104
haftmann@31962
   105
fun check_bare_const thy t = case try dest_Const t
haftmann@31962
   106
 of SOME c_ty => c_ty
haftmann@31962
   107
  | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
haftmann@31156
   108
haftmann@31962
   109
fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy;
haftmann@31962
   110
haftmann@31962
   111
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
haftmann@31962
   112
haftmann@31962
   113
fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy;
haftmann@31156
   114
haftmann@32872
   115
haftmann@31962
   116
haftmann@31962
   117
(** data store **)
haftmann@31962
   118
haftmann@31962
   119
(* code equations *)
haftmann@31962
   120
haftmann@33006
   121
type eqns = bool * (thm * bool) list;
haftmann@33006
   122
  (*default flag, theorems with proper flag *)
haftmann@31962
   123
haftmann@31962
   124
fun add_drop_redundant thy (thm, proper) thms =
haftmann@31962
   125
  let
haftmann@31962
   126
    val args_of = snd o strip_comb o map_types Type.strip_sorts
haftmann@31962
   127
      o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31962
   128
    val args = args_of thm;
haftmann@31962
   129
    val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
haftmann@31962
   130
    fun matches_args args' = length args <= length args' andalso
haftmann@31962
   131
      Pattern.matchess thy (args, (map incr_idx o curry Library.take (length args)) args');
haftmann@31962
   132
    fun drop (thm', proper') = if (proper orelse not proper')
haftmann@31962
   133
      andalso matches_args (args_of thm') then 
wenzelm@32091
   134
        (warning ("Code generator: dropping redundant code equation\n" ^
wenzelm@32091
   135
            Display.string_of_thm_global thy thm'); true)
haftmann@31962
   136
      else false;
haftmann@31962
   137
  in (thm, proper) :: filter_out drop thms end;
haftmann@31962
   138
haftmann@33006
   139
fun add_thm thy _ thm (false, thms) = (false, add_drop_redundant thy thm thms)
haftmann@33006
   140
  | add_thm thy true thm (true, thms) = (true, thms @ [thm])
haftmann@33006
   141
  | add_thm thy false thm (true, thms) = (false, [thm]);
haftmann@31962
   142
haftmann@33006
   143
fun del_thm thm = apsnd (remove (eq_fst Thm.eq_thm_prop) (thm, true));
haftmann@31962
   144
haftmann@31962
   145
haftmann@31962
   146
(* executable code data *)
haftmann@31962
   147
haftmann@31962
   148
datatype spec = Spec of {
haftmann@31962
   149
  history_concluded: bool,
haftmann@31962
   150
  eqns: ((bool * eqns) * (serial * eqns) list) Symtab.table
haftmann@31962
   151
    (*with explicit history*),
haftmann@31962
   152
  dtyps: ((serial * ((string * sort) list * (string * typ list) list)) list) Symtab.table
haftmann@31962
   153
    (*with explicit history*),
haftmann@31962
   154
  cases: (int * (int * string list)) Symtab.table * unit Symtab.table
haftmann@31962
   155
};
haftmann@31962
   156
haftmann@32544
   157
fun make_spec (history_concluded, (eqns, (dtyps, cases))) =
haftmann@32544
   158
  Spec { history_concluded = history_concluded, eqns = eqns, dtyps = dtyps, cases = cases };
haftmann@32544
   159
fun map_spec f (Spec { history_concluded = history_concluded, eqns = eqns,
haftmann@31962
   160
  dtyps = dtyps, cases = cases }) =
haftmann@32544
   161
  make_spec (f (history_concluded, (eqns, (dtyps, cases))));
haftmann@32544
   162
fun merge_spec (Spec { history_concluded = _, eqns = eqns1,
haftmann@31962
   163
    dtyps = dtyps1, cases = (cases1, undefs1) },
haftmann@32544
   164
  Spec { history_concluded = _, eqns = eqns2,
haftmann@31962
   165
    dtyps = dtyps2, cases = (cases2, undefs2) }) =
haftmann@31156
   166
  let
haftmann@31962
   167
    fun merge_eqns ((_, history1), (_, history2)) =
haftmann@31962
   168
      let
haftmann@31962
   169
        val raw_history = AList.merge (op = : serial * serial -> bool)
haftmann@31962
   170
          (K true) (history1, history2)
haftmann@31962
   171
        val filtered_history = filter_out (fst o snd) raw_history
haftmann@31962
   172
        val history = if null filtered_history
haftmann@31962
   173
          then raw_history else filtered_history;
haftmann@31962
   174
      in ((false, (snd o hd) history), history) end;
haftmann@31962
   175
    val eqns = Symtab.join (K merge_eqns) (eqns1, eqns2);
haftmann@31962
   176
    val dtyps = Symtab.join (K (AList.merge (op =) (K true))) (dtyps1, dtyps2);
haftmann@31962
   177
    val cases = (Symtab.merge (K true) (cases1, cases2),
haftmann@31962
   178
      Symtab.merge (K true) (undefs1, undefs2));
haftmann@32544
   179
  in make_spec (false, (eqns, (dtyps, cases))) end;
haftmann@31962
   180
haftmann@31962
   181
fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
haftmann@31962
   182
fun the_eqns (Spec { eqns, ... }) = eqns;
haftmann@31962
   183
fun the_dtyps (Spec { dtyps, ... }) = dtyps;
haftmann@31962
   184
fun the_cases (Spec { cases, ... }) = cases;
haftmann@32544
   185
val map_history_concluded = map_spec o apfst;
haftmann@31962
   186
val map_eqns = map_spec o apsnd o apfst;
haftmann@31962
   187
val map_dtyps = map_spec o apsnd o apsnd o apfst;
haftmann@31962
   188
val map_cases = map_spec o apsnd o apsnd o apsnd;
haftmann@31962
   189
haftmann@31962
   190
haftmann@31962
   191
(* data slots dependent on executable code *)
haftmann@31962
   192
haftmann@31962
   193
(*private copy avoids potential conflict of table exceptions*)
wenzelm@31971
   194
structure Datatab = Table(type key = int val ord = int_ord);
haftmann@31962
   195
haftmann@31962
   196
local
haftmann@31962
   197
haftmann@31962
   198
type kind = {
haftmann@31962
   199
  empty: Object.T,
haftmann@31962
   200
  purge: theory -> string list -> Object.T -> Object.T
haftmann@31962
   201
};
haftmann@31962
   202
wenzelm@32738
   203
val kinds = Unsynchronized.ref (Datatab.empty: kind Datatab.table);
wenzelm@32738
   204
val kind_keys = Unsynchronized.ref ([]: serial list);
haftmann@31962
   205
haftmann@31962
   206
fun invoke f k = case Datatab.lookup (! kinds) k
haftmann@31962
   207
 of SOME kind => f kind
haftmann@31962
   208
  | NONE => sys_error "Invalid code data identifier";
haftmann@31962
   209
haftmann@31962
   210
in
haftmann@31962
   211
haftmann@31962
   212
fun declare_data empty purge =
haftmann@31962
   213
  let
haftmann@31962
   214
    val k = serial ();
haftmann@31962
   215
    val kind = {empty = empty, purge = purge};
wenzelm@32738
   216
    val _ = Unsynchronized.change kinds (Datatab.update (k, kind));
wenzelm@32738
   217
    val _ = Unsynchronized.change kind_keys (cons k);
haftmann@31962
   218
  in k end;
haftmann@31962
   219
haftmann@31962
   220
fun invoke_init k = invoke (fn kind => #empty kind) k;
haftmann@31962
   221
haftmann@31962
   222
fun invoke_purge_all thy cs =
haftmann@31962
   223
  fold (fn k => Datatab.map_entry k
haftmann@31962
   224
    (invoke (fn kind => #purge kind thy cs) k)) (! kind_keys);
haftmann@31962
   225
haftmann@31962
   226
end; (*local*)
haftmann@31962
   227
haftmann@31962
   228
haftmann@31962
   229
(* theory store *)
haftmann@31962
   230
haftmann@31962
   231
local
haftmann@31962
   232
haftmann@31962
   233
type data = Object.T Datatab.table;
haftmann@31962
   234
val empty_data = Datatab.empty : data;
haftmann@31962
   235
haftmann@31962
   236
structure Code_Data = TheoryDataFun
haftmann@31962
   237
(
wenzelm@32738
   238
  type T = spec * data Unsynchronized.ref;
haftmann@32544
   239
  val empty = (make_spec (false,
wenzelm@32738
   240
    (Symtab.empty, (Symtab.empty, (Symtab.empty, Symtab.empty)))), Unsynchronized.ref empty_data);
wenzelm@32738
   241
  fun copy (spec, data) = (spec, Unsynchronized.ref (! data));
haftmann@31962
   242
  val extend = copy;
haftmann@31962
   243
  fun merge pp ((spec1, data1), (spec2, data2)) =
wenzelm@32738
   244
    (merge_spec (spec1, spec2), Unsynchronized.ref empty_data);
haftmann@31962
   245
);
haftmann@31962
   246
haftmann@31962
   247
fun thy_data f thy = f ((snd o Code_Data.get) thy);
haftmann@31962
   248
haftmann@31962
   249
fun get_ensure_init kind data_ref =
haftmann@31962
   250
  case Datatab.lookup (! data_ref) kind
haftmann@31962
   251
   of SOME x => x
haftmann@31962
   252
    | NONE => let val y = invoke_init kind
wenzelm@32738
   253
        in (Unsynchronized.change data_ref (Datatab.update (kind, y)); y) end;
haftmann@31962
   254
haftmann@31962
   255
in
haftmann@31962
   256
haftmann@31962
   257
(* access to executable code *)
haftmann@31962
   258
haftmann@31962
   259
val the_exec = fst o Code_Data.get;
haftmann@31962
   260
haftmann@31962
   261
fun complete_class_params thy cs =
haftmann@31962
   262
  fold (fn c => case AxClass.inst_of_param thy c
haftmann@31962
   263
   of NONE => insert (op =) c
haftmann@31962
   264
    | SOME (c', _) => insert (op =) c' #> insert (op =) c) cs [];
haftmann@31962
   265
haftmann@31962
   266
fun map_exec_purge touched f thy =
wenzelm@32738
   267
  Code_Data.map (fn (exec, data) => (f exec, Unsynchronized.ref (case touched
haftmann@31962
   268
   of SOME cs => invoke_purge_all thy (complete_class_params thy cs) (! data)
haftmann@31962
   269
    | NONE => empty_data))) thy;
haftmann@31962
   270
wenzelm@32738
   271
val purge_data = (Code_Data.map o apsnd) (K (Unsynchronized.ref empty_data));
haftmann@31962
   272
haftmann@31962
   273
fun change_eqns delete c f = (map_exec_purge (SOME [c]) o map_eqns
haftmann@33006
   274
  o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, (true, [])), [])))
haftmann@31962
   275
    o apfst) (fn (_, eqns) => (true, f eqns));
haftmann@31962
   276
haftmann@33006
   277
fun del_eqns c = change_eqns true c (K (false, []));
haftmann@31962
   278
haftmann@31962
   279
haftmann@31962
   280
(* tackling equation history *)
haftmann@31962
   281
haftmann@31962
   282
fun get_eqns thy c =
haftmann@31962
   283
  Symtab.lookup ((the_eqns o the_exec) thy) c
haftmann@33006
   284
  |> Option.map (snd o snd o fst)
haftmann@31962
   285
  |> these;
haftmann@31962
   286
haftmann@31962
   287
fun continue_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   288
  then thy
haftmann@31962
   289
    |> (Code_Data.map o apfst o map_history_concluded) (K false)
haftmann@31962
   290
    |> SOME
haftmann@31962
   291
  else NONE;
haftmann@31962
   292
haftmann@31962
   293
fun conclude_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   294
  then NONE
haftmann@31962
   295
  else thy
haftmann@31962
   296
    |> (Code_Data.map o apfst)
haftmann@31962
   297
        ((map_eqns o Symtab.map) (fn ((changed, current), history) =>
haftmann@31962
   298
          ((false, current),
haftmann@31962
   299
            if changed then (serial (), current) :: history else history))
haftmann@31962
   300
        #> map_history_concluded (K true))
haftmann@31962
   301
    |> SOME;
haftmann@31962
   302
haftmann@31962
   303
val _ = Context.>> (Context.map_theory (Code_Data.init
haftmann@31962
   304
  #> Theory.at_begin continue_history
haftmann@31962
   305
  #> Theory.at_end conclude_history));
haftmann@31962
   306
haftmann@31962
   307
haftmann@31962
   308
(* access to data dependent on abstract executable code *)
haftmann@31962
   309
haftmann@31962
   310
fun get_data (kind, _, dest) = thy_data (get_ensure_init kind #> dest);
haftmann@31962
   311
haftmann@31962
   312
fun change_data (kind, mk, dest) =
haftmann@31962
   313
  let
haftmann@31962
   314
    fun chnge data_ref f =
haftmann@31962
   315
      let
haftmann@31962
   316
        val data = get_ensure_init kind data_ref;
haftmann@31962
   317
        val data' = f (dest data);
wenzelm@32738
   318
      in (Unsynchronized.change data_ref (Datatab.update (kind, mk data')); data') end;
haftmann@31962
   319
  in thy_data chnge end;
haftmann@31962
   320
haftmann@31962
   321
fun change_yield_data (kind, mk, dest) =
haftmann@31962
   322
  let
haftmann@31962
   323
    fun chnge data_ref f =
haftmann@31962
   324
      let
haftmann@31962
   325
        val data = get_ensure_init kind data_ref;
haftmann@31962
   326
        val (x, data') = f (dest data);
wenzelm@32738
   327
      in (x, (Unsynchronized.change data_ref (Datatab.update (kind, mk data')); data')) end;
haftmann@31962
   328
  in thy_data chnge end;
haftmann@31962
   329
haftmann@31962
   330
end; (*local*)
haftmann@31962
   331
haftmann@31962
   332
haftmann@31962
   333
(** foundation **)
haftmann@31962
   334
haftmann@31962
   335
(* constants *)
haftmann@31962
   336
haftmann@31962
   337
fun args_number thy = length o fst o strip_type o Sign.the_const_type thy;
haftmann@31962
   338
haftmann@31962
   339
haftmann@31962
   340
(* datatypes *)
haftmann@31156
   341
haftmann@31156
   342
fun constrset_of_consts thy cs =
haftmann@31156
   343
  let
haftmann@31156
   344
    val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
haftmann@31156
   345
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
haftmann@31156
   346
    fun no_constr (c, ty) = error ("Not a datatype constructor: " ^ string_of_const thy c
haftmann@31156
   347
      ^ " :: " ^ string_of_typ thy ty);
haftmann@31156
   348
    fun last_typ c_ty ty =
haftmann@31156
   349
      let
haftmann@31156
   350
        val frees = OldTerm.typ_tfrees ty;
haftmann@31156
   351
        val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty
haftmann@31156
   352
          handle TYPE _ => no_constr c_ty
haftmann@31156
   353
        val _ = if has_duplicates (eq_fst (op =)) vs then no_constr c_ty else ();
haftmann@31156
   354
        val _ = if length frees <> length vs then no_constr c_ty else ();
haftmann@31156
   355
      in (tyco, vs) end;
haftmann@31156
   356
    fun ty_sorts (c, ty) =
haftmann@31156
   357
      let
haftmann@31156
   358
        val ty_decl = (Logic.unvarifyT o Sign.the_const_type thy) c;
haftmann@31156
   359
        val (tyco, _) = last_typ (c, ty) ty_decl;
haftmann@31156
   360
        val (_, vs) = last_typ (c, ty) ty;
haftmann@31156
   361
      in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
haftmann@31156
   362
    fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
haftmann@31156
   363
      let
haftmann@31998
   364
        val _ = if (tyco' : string) <> tyco
haftmann@31156
   365
          then error "Different type constructors in constructor set"
haftmann@31156
   366
          else ();
haftmann@31156
   367
        val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
haftmann@31156
   368
      in ((tyco, sorts), c :: cs) end;
haftmann@31156
   369
    fun inst vs' (c, (vs, ty)) =
haftmann@31156
   370
      let
haftmann@31156
   371
        val the_v = the o AList.lookup (op =) (vs ~~ vs');
haftmann@31156
   372
        val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty;
haftmann@31156
   373
      in (c, (fst o strip_type) ty') end;
haftmann@31156
   374
    val c' :: cs' = map ty_sorts cs;
haftmann@31156
   375
    val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
haftmann@31156
   376
    val vs = Name.names Name.context Name.aT sorts;
haftmann@31156
   377
    val cs''' = map (inst vs) cs'';
haftmann@31156
   378
  in (tyco, (vs, rev cs''')) end;
haftmann@31156
   379
haftmann@31962
   380
fun get_datatype thy tyco =
haftmann@31962
   381
  case these (Symtab.lookup ((the_dtyps o the_exec) thy) tyco)
haftmann@31962
   382
   of (_, spec) :: _ => spec
haftmann@31962
   383
    | [] => Sign.arity_number thy tyco
haftmann@31962
   384
        |> Name.invents Name.context Name.aT
haftmann@31962
   385
        |> map (rpair [])
haftmann@31962
   386
        |> rpair [];
haftmann@31962
   387
haftmann@31962
   388
fun get_datatype_of_constr thy c =
haftmann@31962
   389
  case (snd o strip_type o Sign.the_const_type thy) c
haftmann@31962
   390
   of Type (tyco, _) => if member (op =) ((map fst o snd o get_datatype thy) tyco) c
haftmann@31962
   391
       then SOME tyco else NONE
haftmann@31962
   392
    | _ => NONE;
haftmann@31962
   393
haftmann@31962
   394
fun is_constr thy = is_some o get_datatype_of_constr thy;
haftmann@31962
   395
haftmann@31156
   396
haftmann@31156
   397
(* code equations *)
haftmann@31156
   398
haftmann@31156
   399
exception BAD_THM of string;
haftmann@31156
   400
fun bad_thm msg = raise BAD_THM msg;
haftmann@31156
   401
fun error_thm f thm = f thm handle BAD_THM msg => error msg;
haftmann@31642
   402
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
haftmann@31156
   403
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
haftmann@31156
   404
haftmann@31156
   405
fun is_linear thm =
haftmann@31156
   406
  let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@31156
   407
  in not (has_duplicates (op =) ((fold o fold_aterms)
haftmann@31156
   408
    (fn Var (v, _) => cons v | _ => I) args [])) end;
haftmann@31156
   409
haftmann@31962
   410
fun gen_assert_eqn thy is_constr_pat (thm, proper) =
haftmann@31156
   411
  let
haftmann@31156
   412
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
wenzelm@32091
   413
      handle TERM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm_global thy thm)
wenzelm@32091
   414
           | THM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm_global thy thm);
haftmann@31156
   415
    fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
haftmann@31156
   416
      | Free _ => bad_thm ("Illegal free variable in equation\n"
wenzelm@32091
   417
          ^ Display.string_of_thm_global thy thm)
haftmann@31156
   418
      | _ => I) t [];
haftmann@31156
   419
    fun tvars_of t = fold_term_types (fn _ =>
haftmann@31156
   420
      fold_atyps (fn TVar (v, _) => insert (op =) v
haftmann@31156
   421
        | TFree _ => bad_thm 
wenzelm@32091
   422
      ("Illegal free type variable in equation\n" ^ Display.string_of_thm_global thy thm))) t [];
haftmann@31156
   423
    val lhs_vs = vars_of lhs;
haftmann@31156
   424
    val rhs_vs = vars_of rhs;
haftmann@31156
   425
    val lhs_tvs = tvars_of lhs;
haftmann@31156
   426
    val rhs_tvs = tvars_of rhs;
haftmann@31156
   427
    val _ = if null (subtract (op =) lhs_vs rhs_vs)
haftmann@31156
   428
      then ()
haftmann@31156
   429
      else bad_thm ("Free variables on right hand side of equation\n"
wenzelm@32091
   430
        ^ Display.string_of_thm_global thy thm);
haftmann@31156
   431
    val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
haftmann@31156
   432
      then ()
haftmann@31156
   433
      else bad_thm ("Free type variables on right hand side of equation\n"
wenzelm@32091
   434
        ^ Display.string_of_thm_global thy thm)
wenzelm@32091
   435
    val (head, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@31156
   436
    val (c, ty) = case head
haftmann@31156
   437
     of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
wenzelm@32091
   438
      | _ => bad_thm ("Equation not headed by constant\n" ^ Display.string_of_thm_global thy thm);
haftmann@31156
   439
    fun check _ (Abs _) = bad_thm
haftmann@31156
   440
          ("Abstraction on left hand side of equation\n"
wenzelm@32091
   441
            ^ Display.string_of_thm_global thy thm)
haftmann@31156
   442
      | check 0 (Var _) = ()
haftmann@31156
   443
      | check _ (Var _) = bad_thm
haftmann@31156
   444
          ("Variable with application on left hand side of equation\n"
wenzelm@32091
   445
            ^ Display.string_of_thm_global thy thm)
haftmann@31156
   446
      | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
haftmann@31156
   447
      | check n (Const (c_ty as (c, ty))) = if n = (length o fst o strip_type) ty
haftmann@31156
   448
          then if not proper orelse is_constr_pat (AxClass.unoverload_const thy c_ty)
haftmann@31156
   449
            then ()
haftmann@31156
   450
            else bad_thm (quote c ^ " is not a constructor, on left hand side of equation\n"
wenzelm@32091
   451
              ^ Display.string_of_thm_global thy thm)
haftmann@31156
   452
          else bad_thm
haftmann@31156
   453
            ("Partially applied constant " ^ quote c ^ " on left hand side of equation\n"
wenzelm@32091
   454
               ^ Display.string_of_thm_global thy thm);
haftmann@31156
   455
    val _ = map (check 0) args;
haftmann@31156
   456
    val _ = if not proper orelse is_linear thm then ()
haftmann@31156
   457
      else bad_thm ("Duplicate variables on left hand side of equation\n"
wenzelm@32091
   458
        ^ Display.string_of_thm_global thy thm);
haftmann@31156
   459
    val _ = if (is_none o AxClass.class_of_param thy) c
haftmann@31156
   460
      then ()
haftmann@31156
   461
      else bad_thm ("Polymorphic constant as head in equation\n"
wenzelm@32091
   462
        ^ Display.string_of_thm_global thy thm)
haftmann@31962
   463
    val _ = if not (is_constr thy c)
haftmann@31156
   464
      then ()
haftmann@31156
   465
      else bad_thm ("Constructor as head in equation\n"
wenzelm@32091
   466
        ^ Display.string_of_thm_global thy thm)
haftmann@31156
   467
    val ty_decl = Sign.the_const_type thy c;
haftmann@31156
   468
    val _ = if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty)
haftmann@31156
   469
      then () else bad_thm ("Type\n" ^ string_of_typ thy ty
haftmann@31156
   470
           ^ "\nof equation\n"
wenzelm@32091
   471
           ^ Display.string_of_thm_global thy thm
haftmann@31156
   472
           ^ "\nis incompatible with declared function type\n"
haftmann@31156
   473
           ^ string_of_typ thy ty_decl)
haftmann@31156
   474
  in (thm, proper) end;
haftmann@31156
   475
haftmann@31962
   476
fun assert_eqn thy = error_thm (gen_assert_eqn thy (is_constr thy));
haftmann@31962
   477
haftmann@31962
   478
fun meta_rewrite thy = LocalDefs.meta_rewrite_rule (ProofContext.init thy);
haftmann@31156
   479
haftmann@31962
   480
fun mk_eqn thy = error_thm (gen_assert_eqn thy (K true)) o
haftmann@31962
   481
  apfst (meta_rewrite thy);
haftmann@31962
   482
haftmann@31962
   483
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962
   484
  o warning_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31962
   485
haftmann@31962
   486
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962
   487
  o try_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31156
   488
haftmann@31156
   489
(*those following are permissive wrt. to overloaded constants!*)
haftmann@31156
   490
haftmann@32640
   491
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31957
   492
fun const_typ_eqn thy thm =
haftmann@31156
   493
  let
haftmann@32640
   494
    val (c, ty) = head_eqn thm;
haftmann@31156
   495
    val c' = AxClass.unoverload_const thy (c, ty);
haftmann@31156
   496
  in (c', ty) end;
haftmann@31957
   497
fun const_eqn thy = fst o const_typ_eqn thy;
haftmann@31156
   498
haftmann@32873
   499
fun typscheme thy (c, ty) =
haftmann@32873
   500
  (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
haftmann@32873
   501
fun typscheme_eqn thy = typscheme thy o apsnd Logic.unvarifyT o const_typ_eqn thy;
haftmann@32873
   502
fun typscheme_eqns thy c [] = 
haftmann@32873
   503
      let
haftmann@32873
   504
        val raw_ty = Sign.the_const_type thy c;
haftmann@32873
   505
        val tvars = Term.add_tvar_namesT raw_ty [];
haftmann@32873
   506
        val tvars' = case AxClass.class_of_param thy c
haftmann@32873
   507
         of SOME class => [TFree (Name.aT, [class])]
haftmann@32873
   508
          | NONE => Name.invent_list [] Name.aT (length tvars)
haftmann@32873
   509
              |> map (fn v => TFree (v, []));
haftmann@32873
   510
        val ty = typ_subst_TVars (tvars ~~ tvars') raw_ty;
haftmann@32873
   511
      in typscheme thy (c, ty) end
haftmann@32873
   512
  | typscheme_eqns thy c (thms as thm :: _) = typscheme_eqn thy thm;
haftmann@32872
   513
haftmann@31962
   514
fun assert_eqns_const thy c eqns =
haftmann@31962
   515
  let
haftmann@31962
   516
    fun cert (eqn as (thm, _)) = if c = const_eqn thy thm
haftmann@31962
   517
      then eqn else error ("Wrong head of code equation,\nexpected constant "
wenzelm@32091
   518
        ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)
haftmann@31962
   519
  in map (cert o assert_eqn thy) eqns end;
haftmann@31156
   520
haftmann@32929
   521
fun standard_typscheme thy thms =
haftmann@32354
   522
  let
haftmann@32640
   523
    fun tvars_of T = rev (Term.add_tvarsT T []);
haftmann@32640
   524
    val vss = map (tvars_of o snd o head_eqn) thms;
haftmann@32354
   525
    fun inter_sorts vs =
haftmann@32354
   526
      fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
haftmann@32354
   527
    val sorts = map_transpose inter_sorts vss;
haftmann@32873
   528
    val vts = Name.names Name.context Name.aT sorts
haftmann@32354
   529
      |> map (fn (v, sort) => TVar ((v, 0), sort));
haftmann@32354
   530
  in map2 (fn vs => Thm.certify_instantiate (vs ~~ vts, [])) vss thms end;
haftmann@31962
   531
haftmann@31962
   532
fun these_eqns thy c =
haftmann@31962
   533
  get_eqns thy c
haftmann@31962
   534
  |> (map o apfst) (Thm.transfer thy)
haftmann@32929
   535
  |> burrow_fst (standard_typscheme thy);
haftmann@31962
   536
haftmann@31962
   537
fun all_eqns thy =
haftmann@31962
   538
  Symtab.dest ((the_eqns o the_exec) thy)
haftmann@33006
   539
  |> maps (snd o snd o fst o snd);
haftmann@31962
   540
haftmann@31962
   541
haftmann@31962
   542
(* cases *)
haftmann@31156
   543
haftmann@31156
   544
fun case_certificate thm =
haftmann@31156
   545
  let
haftmann@31156
   546
    val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
haftmann@32640
   547
      o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
haftmann@31156
   548
    val _ = case head of Free _ => true
haftmann@31156
   549
      | Var _ => true
haftmann@31156
   550
      | _ => raise TERM ("case_cert", []);
haftmann@31156
   551
    val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
haftmann@31156
   552
    val (Const (case_const, _), raw_params) = strip_comb case_expr;
haftmann@31156
   553
    val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
haftmann@31156
   554
    val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
haftmann@31156
   555
    val params = map (fst o dest_Var) (nth_drop n raw_params);
haftmann@31156
   556
    fun dest_case t =
haftmann@31156
   557
      let
haftmann@31156
   558
        val (head' $ t_co, rhs) = Logic.dest_equals t;
haftmann@31156
   559
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   560
        val (Const (co, _), args) = strip_comb t_co;
haftmann@31156
   561
        val (Var (param, _), args') = strip_comb rhs;
haftmann@31156
   562
        val _ = if args' = args then () else raise TERM ("case_cert", []);
haftmann@31156
   563
      in (param, co) end;
haftmann@31156
   564
    fun analyze_cases cases =
haftmann@31156
   565
      let
haftmann@31156
   566
        val co_list = fold (AList.update (op =) o dest_case) cases [];
haftmann@31156
   567
      in map (the o AList.lookup (op =) co_list) params end;
haftmann@31156
   568
    fun analyze_let t =
haftmann@31156
   569
      let
haftmann@31156
   570
        val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
haftmann@31156
   571
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   572
        val _ = if arg' = arg then () else raise TERM ("case_cert", []);
haftmann@31156
   573
        val _ = if [param'] = params then () else raise TERM ("case_cert", []);
haftmann@31156
   574
      in [] end;
haftmann@31156
   575
    fun analyze (cases as [let_case]) =
haftmann@31156
   576
          (analyze_cases cases handle Bind => analyze_let let_case)
haftmann@31156
   577
      | analyze cases = analyze_cases cases;
haftmann@31156
   578
  in (case_const, (n, analyze cases)) end;
haftmann@31156
   579
haftmann@31156
   580
fun case_cert thm = case_certificate thm
haftmann@31156
   581
  handle Bind => error "bad case certificate"
haftmann@31156
   582
       | TERM _ => error "bad case certificate";
haftmann@31156
   583
haftmann@31962
   584
fun get_case_scheme thy = Symtab.lookup ((fst o the_cases o the_exec) thy);
haftmann@24219
   585
haftmann@31962
   586
val undefineds = Symtab.keys o snd o the_cases o the_exec;
haftmann@24219
   587
haftmann@24219
   588
haftmann@31962
   589
(* diagnostic *)
haftmann@24219
   590
haftmann@24219
   591
fun print_codesetup thy =
haftmann@24219
   592
  let
haftmann@24219
   593
    val ctxt = ProofContext.init thy;
haftmann@24844
   594
    val exec = the_exec thy;
haftmann@33006
   595
    fun pretty_eqns (s, (_, eqns)) =
haftmann@24219
   596
      (Pretty.block o Pretty.fbreaks) (
haftmann@33006
   597
        Pretty.str s :: map (Display.pretty_thm ctxt o fst) eqns
haftmann@24219
   598
      );
haftmann@24219
   599
    fun pretty_dtyp (s, []) =
haftmann@24219
   600
          Pretty.str s
haftmann@24219
   601
      | pretty_dtyp (s, cos) =
haftmann@24219
   602
          (Pretty.block o Pretty.breaks) (
haftmann@24219
   603
            Pretty.str s
haftmann@24219
   604
            :: Pretty.str "="
haftmann@31156
   605
            :: separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
haftmann@24219
   606
                 | (c, tys) =>
haftmann@24219
   607
                     (Pretty.block o Pretty.breaks)
haftmann@31156
   608
                        (Pretty.str (string_of_const thy c)
wenzelm@26947
   609
                          :: Pretty.str "of"
wenzelm@26947
   610
                          :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@24219
   611
          );
haftmann@28368
   612
    val eqns = the_eqns exec
haftmann@24423
   613
      |> Symtab.dest
haftmann@31156
   614
      |> (map o apfst) (string_of_const thy)
haftmann@28695
   615
      |> (map o apsnd) (snd o fst)
haftmann@24219
   616
      |> sort (string_ord o pairself fst);
haftmann@24219
   617
    val dtyps = the_dtyps exec
haftmann@24219
   618
      |> Symtab.dest
haftmann@28695
   619
      |> map (fn (dtco, (_, (vs, cos)) :: _) =>
haftmann@31957
   620
          (string_of_typ thy (Type (dtco, map TFree vs)), cos))
haftmann@24219
   621
      |> sort (string_ord o pairself fst)
haftmann@24219
   622
  in
haftmann@24219
   623
    (Pretty.writeln o Pretty.chunks) [
haftmann@24219
   624
      Pretty.block (
haftmann@30023
   625
        Pretty.str "code equations:"
haftmann@24219
   626
        :: Pretty.fbrk
haftmann@33006
   627
        :: (Pretty.fbreaks o map pretty_eqns) eqns
haftmann@24219
   628
      ),
haftmann@25968
   629
      Pretty.block (
haftmann@24219
   630
        Pretty.str "datatypes:"
haftmann@24219
   631
        :: Pretty.fbrk
haftmann@24219
   632
        :: (Pretty.fbreaks o map pretty_dtyp) dtyps
haftmann@24219
   633
      )
haftmann@24219
   634
    ]
haftmann@24219
   635
  end;
haftmann@24219
   636
haftmann@24219
   637
haftmann@31962
   638
(** declaring executable ingredients **)
haftmann@31962
   639
haftmann@31962
   640
(* datatypes *)
haftmann@31090
   641
wenzelm@33314
   642
structure Type_Interpretation =
wenzelm@33314
   643
  Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@25462
   644
haftmann@24423
   645
fun add_datatype raw_cs thy =
haftmann@24219
   646
  let
haftmann@25597
   647
    val cs = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) raw_cs;
haftmann@31156
   648
    val (tyco, vs_cos) = constrset_of_consts thy cs;
haftmann@30076
   649
    val old_cs = (map fst o snd o get_datatype thy) tyco;
haftmann@30076
   650
    fun drop_outdated_cases cases = fold Symtab.delete_safe
haftmann@30076
   651
      (Symtab.fold (fn (c, (_, (_, cos))) =>
haftmann@30076
   652
        if exists (member (op =) old_cs) cos
haftmann@30076
   653
          then insert (op =) c else I) cases []) cases;
haftmann@24219
   654
  in
haftmann@24219
   655
    thy
haftmann@31091
   656
    |> fold (del_eqns o fst) cs
haftmann@28703
   657
    |> map_exec_purge NONE
haftmann@28695
   658
        ((map_dtyps o Symtab.map_default (tyco, [])) (cons (serial (), vs_cos))
haftmann@30076
   659
        #> (map_cases o apfst) drop_outdated_cases)
haftmann@31962
   660
    |> Type_Interpretation.data (tyco, serial ())
haftmann@24219
   661
  end;
haftmann@24219
   662
haftmann@31962
   663
fun type_interpretation f =  Type_Interpretation.interpretation
haftmann@25485
   664
  (fn (tyco, _) => fn thy => f (tyco, get_datatype thy tyco) thy);
haftmann@25485
   665
haftmann@24423
   666
fun add_datatype_cmd raw_cs thy =
haftmann@24423
   667
  let
haftmann@31156
   668
    val cs = map (read_bare_const thy) raw_cs;
haftmann@24423
   669
  in add_datatype cs thy end;
haftmann@24219
   670
haftmann@31962
   671
haftmann@31962
   672
(* code equations *)
haftmann@31962
   673
haftmann@33075
   674
fun gen_add_eqn default (thm, proper) thy =
haftmann@33075
   675
  let
haftmann@33075
   676
    val thm' = Thm.close_derivation thm;
haftmann@33075
   677
    val c = const_eqn thy thm';
haftmann@33075
   678
  in change_eqns false c (add_thm thy default (thm', proper)) thy end;
haftmann@31962
   679
haftmann@31962
   680
fun add_eqn thm thy =
haftmann@31962
   681
  gen_add_eqn false (mk_eqn thy (thm, true)) thy;
haftmann@31962
   682
haftmann@31962
   683
fun add_warning_eqn thm thy =
haftmann@31962
   684
  case mk_eqn_warning thy thm
haftmann@31962
   685
   of SOME eqn => gen_add_eqn false eqn thy
haftmann@31962
   686
    | NONE => thy;
haftmann@31962
   687
haftmann@31962
   688
fun add_default_eqn thm thy =
haftmann@31962
   689
  case mk_eqn_liberal thy thm
haftmann@31962
   690
   of SOME eqn => gen_add_eqn true eqn thy
haftmann@31962
   691
    | NONE => thy;
haftmann@31962
   692
haftmann@31962
   693
fun add_nbe_eqn thm thy =
haftmann@31962
   694
  gen_add_eqn false (mk_eqn thy (thm, false)) thy;
haftmann@31962
   695
haftmann@31962
   696
val add_default_eqn_attribute = Thm.declaration_attribute
haftmann@31962
   697
  (fn thm => Context.mapping (add_default_eqn thm) I);
haftmann@31962
   698
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
haftmann@31962
   699
haftmann@31962
   700
fun del_eqn thm thy = case mk_eqn_liberal thy thm
haftmann@31962
   701
 of SOME (thm, _) => change_eqns true (const_eqn thy thm) (del_thm thm) thy
haftmann@31962
   702
  | NONE => thy;
haftmann@31962
   703
haftmann@32070
   704
(* c.f. src/HOL/Tools/recfun_codegen.ML *)
haftmann@32070
   705
wenzelm@33522
   706
structure Code_Target_Attr = Theory_Data
wenzelm@33522
   707
(
haftmann@31998
   708
  type T = (string -> thm -> theory -> theory) option;
haftmann@31998
   709
  val empty = NONE;
haftmann@31998
   710
  val extend = I;
wenzelm@33522
   711
  fun merge (f1, f2) = if is_some f1 then f1 else f2;
haftmann@31998
   712
);
haftmann@31998
   713
haftmann@32070
   714
fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
haftmann@32070
   715
haftmann@32070
   716
fun code_target_attr prefix thm thy =
haftmann@32070
   717
  let
haftmann@32070
   718
    val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
haftmann@32070
   719
  in thy |> add_warning_eqn thm |> attr prefix thm end;
haftmann@32070
   720
haftmann@32070
   721
(* setup *)
haftmann@31998
   722
haftmann@31962
   723
val _ = Context.>> (Context.map_theory
haftmann@31962
   724
  (let
haftmann@31962
   725
    fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@31998
   726
    val code_attribute_parser =
haftmann@31998
   727
      Args.del |-- Scan.succeed (mk_attribute del_eqn)
haftmann@31998
   728
      || Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
haftmann@31998
   729
      || (Args.$$$ "target" |-- Args.colon |-- Args.name >>
haftmann@32070
   730
           (mk_attribute o code_target_attr))
haftmann@31998
   731
      || Scan.succeed (mk_attribute add_warning_eqn);
haftmann@31962
   732
  in
haftmann@31962
   733
    Type_Interpretation.init
haftmann@31998
   734
    #> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
haftmann@31998
   735
        "declare theorems for code generation"
haftmann@31962
   736
  end));
haftmann@31962
   737
haftmann@31962
   738
haftmann@31962
   739
(* cases *)
haftmann@31962
   740
haftmann@24844
   741
fun add_case thm thy =
haftmann@24844
   742
  let
haftmann@31156
   743
    val (c, (k, case_pats)) = case_cert thm;
haftmann@31088
   744
    val _ = case filter_out (is_constr thy) case_pats
haftmann@30076
   745
     of [] => ()
haftmann@30076
   746
      | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
haftmann@30076
   747
    val entry = (1 + Int.max (1, length case_pats), (k, case_pats))
haftmann@30076
   748
  in (map_exec_purge (SOME [c]) o map_cases o apfst) (Symtab.update (c, entry)) thy end;
haftmann@24844
   749
haftmann@24844
   750
fun add_undefined c thy =
haftmann@24844
   751
  (map_exec_purge (SOME [c]) o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@24844
   752
haftmann@24219
   753
end; (*struct*)
haftmann@24219
   754
haftmann@24219
   755
bulwahn@32661
   756
(** type-safe interfaces for data dependent on executable code **)
haftmann@24219
   757
haftmann@31962
   758
functor Code_Data_Fun(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219
   759
struct
haftmann@24219
   760
haftmann@24219
   761
type T = Data.T;
haftmann@24219
   762
exception Data of T;
haftmann@24219
   763
fun dest (Data x) = x
haftmann@24219
   764
haftmann@24219
   765
val kind = Code.declare_data (Data Data.empty)
haftmann@27609
   766
  (fn thy => fn cs => fn Data x => Data (Data.purge thy cs x));
haftmann@24219
   767
haftmann@24219
   768
val data_op = (kind, Data, dest);
haftmann@24219
   769
haftmann@24219
   770
val get = Code.get_data data_op;
haftmann@24219
   771
val change = Code.change_data data_op;
haftmann@24219
   772
fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219
   773
haftmann@24219
   774
end;
haftmann@24219
   775
bulwahn@32661
   776
(** datastructure to log definitions for preprocessing of the predicate compiler **)
bulwahn@32662
   777
(* obviously a clone of Named_Thms *)
bulwahn@32662
   778
bulwahn@32662
   779
signature PREDICATE_COMPILE_PREPROC_CONST_DEFS =
bulwahn@32662
   780
sig
bulwahn@32662
   781
  val get: Proof.context -> thm list
bulwahn@32662
   782
  val add_thm: thm -> Context.generic -> Context.generic
bulwahn@32662
   783
  val del_thm: thm -> Context.generic -> Context.generic
bulwahn@32662
   784
  
bulwahn@32662
   785
  val add_attribute : attribute
bulwahn@32662
   786
  val del_attribute : attribute
bulwahn@32662
   787
  
bulwahn@32662
   788
  val add_attrib : Attrib.src
bulwahn@32662
   789
  
bulwahn@32662
   790
  val setup: theory -> theory
bulwahn@32662
   791
end;
bulwahn@32662
   792
bulwahn@32662
   793
structure Predicate_Compile_Preproc_Const_Defs : PREDICATE_COMPILE_PREPROC_CONST_DEFS =
bulwahn@32662
   794
struct
bulwahn@32662
   795
wenzelm@33519
   796
structure Data = Generic_Data
bulwahn@32661
   797
(
bulwahn@32662
   798
  type T = thm list;
bulwahn@32662
   799
  val empty = [];
bulwahn@32662
   800
  val extend = I;
wenzelm@33519
   801
  val merge = Thm.merge_thms;
bulwahn@32662
   802
);
bulwahn@32662
   803
bulwahn@32662
   804
val get = Data.get o Context.Proof;
bulwahn@32662
   805
bulwahn@32662
   806
val add_thm = Data.map o Thm.add_thm;
bulwahn@32662
   807
val del_thm = Data.map o Thm.del_thm;
bulwahn@32662
   808
bulwahn@32662
   809
val add_attribute = Thm.declaration_attribute add_thm;
bulwahn@32662
   810
val del_attribute = Thm.declaration_attribute del_thm;
bulwahn@32662
   811
bulwahn@32662
   812
val add_attrib = Attrib.internal (K add_attribute)
bulwahn@32662
   813
bulwahn@32662
   814
val setup =
bulwahn@32662
   815
  Attrib.setup (Binding.name "pred_compile_preproc") (Attrib.add_del add_attribute del_attribute)
bulwahn@32662
   816
    ("declaration of definition for preprocessing of the predicate compiler") #>
bulwahn@32662
   817
  PureThy.add_thms_dynamic (Binding.name "pred_compile_preproc", Data.get);
bulwahn@32662
   818
bulwahn@32662
   819
end;
bulwahn@32662
   820
haftmann@28143
   821
structure Code : CODE = struct open Code; end;