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