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