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