src/Pure/Isar/code.ML
author haftmann
Mon Apr 19 11:30:08 2010 +0200 (2010-04-19 ago)
changeset 36202 43ea1f28fc7c
parent 36122 45f8898fe4cf
child 36209 566be5d48090
permissions -rw-r--r--
explicit check sorts in abstract certificates; abstractor is part of dependencies
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@34874
    26
  (*code equations and certificates*)
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@31957
    31
  val const_typ_eqn: theory -> thm -> string * typ
haftmann@34895
    32
  val expand_eta: theory -> int -> thm -> thm
haftmann@34895
    33
  type cert
haftmann@34891
    34
  val empty_cert: theory -> string -> cert
haftmann@34891
    35
  val cert_of_eqns: theory -> string -> (thm * bool) list -> cert
haftmann@34874
    36
  val constrain_cert: theory -> sort list -> cert -> cert
haftmann@35226
    37
  val typargs_deps_of_cert: theory -> cert -> (string * sort) list * (string * typ list) list
haftmann@35226
    38
  val equations_of_cert: theory -> cert ->
haftmann@35226
    39
    ((string * sort) list * typ) * ((string option * (term list * term)) * (thm option * bool)) list
haftmann@35226
    40
  val bare_thms_of_cert: theory -> cert -> thm list
haftmann@34895
    41
  val pretty_cert: theory -> cert -> Pretty.T list
haftmann@31156
    42
haftmann@31962
    43
  (*executable code*)
haftmann@33940
    44
  val add_type: string -> theory -> theory
haftmann@33940
    45
  val add_type_cmd: string -> theory -> theory
haftmann@33940
    46
  val add_signature: string * typ -> theory -> theory
haftmann@33940
    47
  val add_signature_cmd: string * string -> theory -> theory
haftmann@31156
    48
  val add_datatype: (string * typ) list -> theory -> theory
haftmann@31156
    49
  val add_datatype_cmd: string list -> theory -> theory
haftmann@35299
    50
  val datatype_interpretation:
haftmann@35299
    51
    (string * ((string * sort) list * (string * typ list) list)
haftmann@35299
    52
      -> theory -> theory) -> theory -> theory
haftmann@36112
    53
  val add_abstype: thm -> theory -> theory
haftmann@35299
    54
  val abstype_interpretation:
haftmann@35299
    55
    (string * ((string * sort) list * ((string * typ) * (string * thm)))
haftmann@31156
    56
      -> theory -> theory) -> theory -> theory
haftmann@28368
    57
  val add_eqn: thm -> theory -> theory
haftmann@31088
    58
  val add_nbe_eqn: thm -> theory -> theory
haftmann@28368
    59
  val add_default_eqn: thm -> theory -> theory
haftmann@28703
    60
  val add_default_eqn_attribute: attribute
haftmann@28703
    61
  val add_default_eqn_attrib: Attrib.src
haftmann@28368
    62
  val del_eqn: thm -> theory -> theory
haftmann@28368
    63
  val del_eqns: string -> theory -> theory
haftmann@24844
    64
  val add_case: thm -> theory -> theory
haftmann@24844
    65
  val add_undefined: string -> theory -> theory
haftmann@35299
    66
  val get_type: theory -> string -> ((string * sort) list * (string * typ list) list)
haftmann@35299
    67
  val get_type_of_constr_or_abstr: theory -> string -> (string * bool) option
haftmann@35226
    68
  val is_constr: theory -> string -> bool
haftmann@35226
    69
  val is_abstr: theory -> string -> bool
haftmann@34891
    70
  val get_cert: theory -> ((thm * bool) list -> (thm * bool) list) -> string -> cert
haftmann@30023
    71
  val get_case_scheme: theory -> string -> (int * (int * string list)) option
haftmann@31890
    72
  val undefineds: theory -> string list
haftmann@24219
    73
  val print_codesetup: theory -> unit
haftmann@31957
    74
haftmann@31957
    75
  (*infrastructure*)
haftmann@31998
    76
  val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory
haftmann@31957
    77
  val purge_data: theory -> theory
haftmann@24219
    78
end;
haftmann@24219
    79
haftmann@24219
    80
signature CODE_DATA_ARGS =
haftmann@24219
    81
sig
haftmann@24219
    82
  type T
haftmann@24219
    83
  val empty: T
haftmann@24219
    84
end;
haftmann@24219
    85
haftmann@24219
    86
signature CODE_DATA =
haftmann@24219
    87
sig
haftmann@24219
    88
  type T
haftmann@34251
    89
  val change: theory -> (T -> T) -> T
haftmann@34251
    90
  val change_yield: theory -> (T -> 'a * T) -> 'a * T
haftmann@24219
    91
end;
haftmann@24219
    92
haftmann@24219
    93
signature PRIVATE_CODE =
haftmann@24219
    94
sig
haftmann@24219
    95
  include CODE
haftmann@34173
    96
  val declare_data: Object.T -> serial
haftmann@24219
    97
  val change_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@34251
    98
    -> theory -> ('a -> 'a) -> 'a
haftmann@24219
    99
  val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@34251
   100
    -> theory -> ('a -> 'b * 'a) -> 'b * 'a
haftmann@24219
   101
end;
haftmann@24219
   102
haftmann@24219
   103
structure Code : PRIVATE_CODE =
haftmann@24219
   104
struct
haftmann@24219
   105
haftmann@31962
   106
(** auxiliary **)
haftmann@31962
   107
haftmann@31962
   108
(* printing *)
haftmann@31156
   109
wenzelm@32966
   110
fun string_of_typ thy = setmp_CRITICAL show_sorts true (Syntax.string_of_typ_global thy);
haftmann@31962
   111
haftmann@31156
   112
fun string_of_const thy c = case AxClass.inst_of_param thy c
haftmann@31156
   113
 of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco)
haftmann@31156
   114
  | NONE => Sign.extern_const thy c;
haftmann@31156
   115
haftmann@31962
   116
haftmann@31962
   117
(* constants *)
haftmann@31156
   118
haftmann@33940
   119
fun typ_equiv tys = Type.raw_instance tys andalso Type.raw_instance (swap tys);
haftmann@33940
   120
haftmann@31962
   121
fun check_bare_const thy t = case try dest_Const t
haftmann@31962
   122
 of SOME c_ty => c_ty
haftmann@31962
   123
  | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
haftmann@31156
   124
haftmann@31962
   125
fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy;
haftmann@31962
   126
haftmann@31962
   127
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
haftmann@31962
   128
haftmann@31962
   129
fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy;
haftmann@31156
   130
haftmann@32872
   131
haftmann@31962
   132
(** data store **)
haftmann@31962
   133
haftmann@35226
   134
(* datatypes *)
haftmann@35226
   135
haftmann@35226
   136
datatype typ_spec = Constructors of (string * typ list) list
haftmann@35226
   137
  | Abstractor of (string * typ) * (string * thm);
haftmann@31962
   138
haftmann@35226
   139
fun constructors_of (Constructors cos) = (cos, false)
haftmann@35226
   140
  | constructors_of (Abstractor ((co, ty), _)) = ([(co, [ty])], true);
haftmann@35226
   141
haftmann@35226
   142
haftmann@35226
   143
(* functions *)
haftmann@31962
   144
haftmann@35226
   145
datatype fun_spec = Default of (thm * bool) list
haftmann@35226
   146
  | Eqns of (thm * bool) list
haftmann@35226
   147
  | Proj of term * string
haftmann@35226
   148
  | Abstr of thm * string;
haftmann@31962
   149
haftmann@35226
   150
val empty_fun_spec = Default [];
haftmann@31962
   151
haftmann@35226
   152
fun is_default (Default _) = true
haftmann@35226
   153
  | is_default _ = false;
haftmann@35226
   154
haftmann@35226
   155
fun associated_abstype (Abstr (_, tyco)) = SOME tyco
haftmann@35226
   156
  | associated_abstype _ = NONE;
haftmann@31962
   157
haftmann@31962
   158
haftmann@31962
   159
(* executable code data *)
haftmann@31962
   160
haftmann@31962
   161
datatype spec = Spec of {
haftmann@31962
   162
  history_concluded: bool,
haftmann@33940
   163
  signatures: int Symtab.table * typ Symtab.table,
haftmann@35226
   164
  functions: ((bool * fun_spec) * (serial * fun_spec) list) Symtab.table
haftmann@31962
   165
    (*with explicit history*),
haftmann@35299
   166
  types: ((serial * ((string * sort) list * typ_spec)) list) Symtab.table
haftmann@31962
   167
    (*with explicit history*),
haftmann@31962
   168
  cases: (int * (int * string list)) Symtab.table * unit Symtab.table
haftmann@31962
   169
};
haftmann@31962
   170
haftmann@35299
   171
fun make_spec (history_concluded, ((signatures, functions), (types, cases))) =
haftmann@33940
   172
  Spec { history_concluded = history_concluded,
haftmann@35299
   173
    signatures = signatures, functions = functions, types = types, cases = cases };
haftmann@33940
   174
fun map_spec f (Spec { history_concluded = history_concluded, signatures = signatures,
haftmann@35299
   175
  functions = functions, types = types, cases = cases }) =
haftmann@35299
   176
  make_spec (f (history_concluded, ((signatures, functions), (types, cases))));
haftmann@35226
   177
fun merge_spec (Spec { history_concluded = _, signatures = (tycos1, sigs1), functions = functions1,
haftmann@35299
   178
    types = types1, cases = (cases1, undefs1) },
haftmann@35226
   179
  Spec { history_concluded = _, signatures = (tycos2, sigs2), functions = functions2,
haftmann@35299
   180
    types = types2, cases = (cases2, undefs2) }) =
haftmann@31156
   181
  let
haftmann@33940
   182
    val signatures = (Symtab.merge (op =) (tycos1, tycos2),
haftmann@33940
   183
      Symtab.merge typ_equiv (sigs1, sigs2));
haftmann@35226
   184
    fun merge_functions ((_, history1), (_, history2)) =
haftmann@31962
   185
      let
haftmann@31962
   186
        val raw_history = AList.merge (op = : serial * serial -> bool)
haftmann@35226
   187
          (K true) (history1, history2);
haftmann@35226
   188
        val filtered_history = filter_out (is_default o snd) raw_history;
haftmann@31962
   189
        val history = if null filtered_history
haftmann@31962
   190
          then raw_history else filtered_history;
haftmann@31962
   191
      in ((false, (snd o hd) history), history) end;
haftmann@35226
   192
    val functions = Symtab.join (K merge_functions) (functions1, functions2);
haftmann@35299
   193
    val types = Symtab.join (K (AList.merge (op =) (K true))) (types1, types2);
haftmann@31962
   194
    val cases = (Symtab.merge (K true) (cases1, cases2),
haftmann@31962
   195
      Symtab.merge (K true) (undefs1, undefs2));
haftmann@35299
   196
  in make_spec (false, ((signatures, functions), (types, cases))) end;
haftmann@31962
   197
haftmann@31962
   198
fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
haftmann@33940
   199
fun the_signatures (Spec { signatures, ... }) = signatures;
haftmann@35226
   200
fun the_functions (Spec { functions, ... }) = functions;
haftmann@35299
   201
fun the_types (Spec { types, ... }) = types;
haftmann@31962
   202
fun the_cases (Spec { cases, ... }) = cases;
haftmann@32544
   203
val map_history_concluded = map_spec o apfst;
haftmann@33940
   204
val map_signatures = map_spec o apsnd o apfst o apfst;
haftmann@35226
   205
val map_functions = map_spec o apsnd o apfst o apsnd;
haftmann@35226
   206
val map_typs = map_spec o apsnd o apsnd o apfst;
haftmann@31962
   207
val map_cases = map_spec o apsnd o apsnd o apsnd;
haftmann@31962
   208
haftmann@31962
   209
haftmann@31962
   210
(* data slots dependent on executable code *)
haftmann@31962
   211
haftmann@31962
   212
(*private copy avoids potential conflict of table exceptions*)
wenzelm@31971
   213
structure Datatab = Table(type key = int val ord = int_ord);
haftmann@31962
   214
haftmann@31962
   215
local
haftmann@31962
   216
haftmann@34173
   217
type kind = { empty: Object.T };
haftmann@31962
   218
wenzelm@32738
   219
val kinds = Unsynchronized.ref (Datatab.empty: kind Datatab.table);
haftmann@31962
   220
haftmann@31962
   221
fun invoke f k = case Datatab.lookup (! kinds) k
haftmann@31962
   222
 of SOME kind => f kind
haftmann@31962
   223
  | NONE => sys_error "Invalid code data identifier";
haftmann@31962
   224
haftmann@31962
   225
in
haftmann@31962
   226
haftmann@34173
   227
fun declare_data empty =
haftmann@31962
   228
  let
haftmann@31962
   229
    val k = serial ();
haftmann@34173
   230
    val kind = { empty = empty };
haftmann@34173
   231
    val _ = CRITICAL (fn () => Unsynchronized.change kinds (Datatab.update (k, kind)));
haftmann@31962
   232
  in k end;
haftmann@31962
   233
haftmann@31962
   234
fun invoke_init k = invoke (fn kind => #empty kind) k;
haftmann@31962
   235
haftmann@31962
   236
end; (*local*)
haftmann@31962
   237
haftmann@31962
   238
haftmann@31962
   239
(* theory store *)
haftmann@31962
   240
haftmann@31962
   241
local
haftmann@31962
   242
haftmann@31962
   243
type data = Object.T Datatab.table;
haftmann@34244
   244
fun empty_dataref () = Synchronized.var "code data" (NONE : (data * theory_ref) option);
haftmann@31962
   245
haftmann@34244
   246
structure Code_Data = Theory_Data
haftmann@31962
   247
(
haftmann@34244
   248
  type T = spec * (data * theory_ref) option Synchronized.var;
haftmann@33940
   249
  val empty = (make_spec (false, (((Symtab.empty, Symtab.empty), Symtab.empty),
haftmann@34244
   250
    (Symtab.empty, (Symtab.empty, Symtab.empty)))), empty_dataref ());
haftmann@34244
   251
  val extend = I
haftmann@34244
   252
  fun merge ((spec1, _), (spec2, _)) =
haftmann@34244
   253
    (merge_spec (spec1, spec2), empty_dataref ());
haftmann@31962
   254
);
haftmann@31962
   255
haftmann@31962
   256
in
haftmann@31962
   257
haftmann@35226
   258
haftmann@31962
   259
(* access to executable code *)
haftmann@31962
   260
haftmann@31962
   261
val the_exec = fst o Code_Data.get;
haftmann@31962
   262
haftmann@34244
   263
fun map_exec_purge f = Code_Data.map (fn (exec, _) => (f exec, empty_dataref ()));
haftmann@31962
   264
haftmann@34244
   265
val purge_data = (Code_Data.map o apsnd) (fn _ => empty_dataref ());
haftmann@31962
   266
haftmann@35226
   267
fun change_fun_spec delete c f = (map_exec_purge o map_functions
haftmann@35226
   268
  o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, empty_fun_spec), [])))
haftmann@35226
   269
    o apfst) (fn (_, spec) => (true, f spec));
haftmann@31962
   270
haftmann@31962
   271
haftmann@31962
   272
(* tackling equation history *)
haftmann@31962
   273
haftmann@31962
   274
fun continue_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   275
  then thy
haftmann@31962
   276
    |> (Code_Data.map o apfst o map_history_concluded) (K false)
haftmann@31962
   277
    |> SOME
haftmann@31962
   278
  else NONE;
haftmann@31962
   279
haftmann@31962
   280
fun conclude_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   281
  then NONE
haftmann@31962
   282
  else thy
haftmann@31962
   283
    |> (Code_Data.map o apfst)
haftmann@35226
   284
        ((map_functions o Symtab.map) (fn ((changed, current), history) =>
haftmann@31962
   285
          ((false, current),
haftmann@31962
   286
            if changed then (serial (), current) :: history else history))
haftmann@31962
   287
        #> map_history_concluded (K true))
haftmann@31962
   288
    |> SOME;
haftmann@31962
   289
haftmann@34244
   290
val _ = Context.>> (Context.map_theory (Theory.at_begin continue_history #> Theory.at_end conclude_history));
haftmann@31962
   291
haftmann@31962
   292
haftmann@31962
   293
(* access to data dependent on abstract executable code *)
haftmann@31962
   294
haftmann@34244
   295
fun change_yield_data (kind, mk, dest) theory f =
haftmann@31962
   296
  let
haftmann@34244
   297
    val dataref = (snd o Code_Data.get) theory;
haftmann@34251
   298
    val (datatab, thy_ref) = case Synchronized.value dataref
haftmann@34251
   299
     of SOME (datatab, thy_ref) => if Theory.eq_thy (theory, Theory.deref thy_ref)
haftmann@34251
   300
          then (datatab, thy_ref)
haftmann@34251
   301
          else (Datatab.empty, Theory.check_thy theory)
haftmann@34251
   302
      | NONE => (Datatab.empty, Theory.check_thy theory)
haftmann@34244
   303
    val data = case Datatab.lookup datatab kind
haftmann@34244
   304
     of SOME data => data
haftmann@34244
   305
      | NONE => invoke_init kind;
haftmann@34251
   306
    val result as (x, data') = f (dest data);
haftmann@34244
   307
    val _ = Synchronized.change dataref
haftmann@34244
   308
      ((K o SOME) (Datatab.update (kind, mk data') datatab, thy_ref));
haftmann@34244
   309
  in result end;
haftmann@31962
   310
haftmann@34251
   311
fun change_data ops theory f = change_yield_data ops theory (f #> pair ()) |> snd;
haftmann@31962
   312
haftmann@31962
   313
end; (*local*)
haftmann@31962
   314
haftmann@31962
   315
haftmann@31962
   316
(** foundation **)
haftmann@31962
   317
haftmann@31962
   318
(* constants *)
haftmann@31962
   319
haftmann@33940
   320
fun arity_number thy tyco = case Symtab.lookup ((fst o the_signatures o the_exec) thy) tyco
haftmann@33940
   321
 of SOME n => n
haftmann@33940
   322
  | NONE => Sign.arity_number thy tyco;
haftmann@33940
   323
haftmann@33940
   324
fun build_tsig thy =
haftmann@33940
   325
  let
haftmann@33940
   326
    val (tycos, _) = (the_signatures o the_exec) thy;
haftmann@33940
   327
    val decls = (#types o Type.rep_tsig o Sign.tsig_of) thy
haftmann@34272
   328
      |> snd 
haftmann@34272
   329
      |> Symtab.fold (fn (tyco, n) =>
haftmann@34272
   330
          Symtab.update (tyco, Type.LogicalType n)) tycos;
haftmann@34272
   331
  in
haftmann@34272
   332
    Type.empty_tsig
haftmann@34272
   333
    |> Symtab.fold (fn (tyco, Type.LogicalType n) => Type.add_type Name_Space.default_naming
haftmann@34272
   334
        (Binding.qualified_name tyco, n) | _ => I) decls
haftmann@34272
   335
  end;
haftmann@33940
   336
wenzelm@35845
   337
fun cert_signature thy = Logic.varifyT_global o Type.cert_typ (build_tsig thy) o Type.no_tvars;
haftmann@33940
   338
haftmann@33940
   339
fun read_signature thy = cert_signature thy o Type.strip_sorts
haftmann@33940
   340
  o Syntax.parse_typ (ProofContext.init thy);
haftmann@33940
   341
haftmann@33940
   342
fun expand_signature thy = Type.cert_typ_mode Type.mode_syntax (Sign.tsig_of thy);
haftmann@33940
   343
haftmann@33940
   344
fun lookup_typ thy = Symtab.lookup ((snd o the_signatures o the_exec) thy);
haftmann@33940
   345
haftmann@33940
   346
fun const_typ thy c = case lookup_typ thy c
haftmann@33940
   347
 of SOME ty => ty
haftmann@33940
   348
  | NONE => (Type.strip_sorts o Sign.the_const_type thy) c;
haftmann@33940
   349
haftmann@33940
   350
fun subst_signature thy c ty =
haftmann@33940
   351
  let
haftmann@33940
   352
    fun mk_subst (Type (tyco, tys1)) (ty2 as Type (tyco2, tys2)) =
haftmann@33940
   353
          fold2 mk_subst tys1 tys2
haftmann@33940
   354
      | mk_subst ty (TVar (v, sort)) = Vartab.update (v, ([], ty))
haftmann@33940
   355
  in case lookup_typ thy c
haftmann@33940
   356
   of SOME ty' => Envir.subst_type (mk_subst ty (expand_signature thy ty') Vartab.empty) ty'
haftmann@33940
   357
    | NONE => ty
haftmann@33940
   358
  end;
haftmann@33940
   359
haftmann@33940
   360
fun subst_signatures thy = map_aterms (fn Const (c, ty) => Const (c, subst_signature thy c ty) | t => t);
haftmann@33940
   361
haftmann@33940
   362
fun args_number thy = length o fst o strip_type o const_typ thy;
haftmann@31962
   363
haftmann@31962
   364
haftmann@31962
   365
(* datatypes *)
haftmann@31156
   366
haftmann@35226
   367
fun no_constr thy s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c
haftmann@35226
   368
  ^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s);
haftmann@35226
   369
haftmann@35226
   370
fun ty_sorts thy (c, raw_ty) =
haftmann@31156
   371
  let
haftmann@35226
   372
    val _ = Thm.cterm_of thy (Const (c, raw_ty));
haftmann@35226
   373
    val ty = subst_signature thy c raw_ty;
wenzelm@35845
   374
    val ty_decl = (Logic.unvarifyT_global o const_typ thy) c;
haftmann@31156
   375
    fun last_typ c_ty ty =
haftmann@31156
   376
      let
haftmann@33531
   377
        val tfrees = Term.add_tfreesT ty [];
haftmann@31156
   378
        val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty
haftmann@35226
   379
          handle TYPE _ => no_constr thy "bad type" c_ty
haftmann@36112
   380
        val _ = if tyco = "fun" then no_constr thy "bad type" c_ty else ();
haftmann@33531
   381
        val _ = if has_duplicates (eq_fst (op =)) vs
haftmann@35226
   382
          then no_constr thy "duplicate type variables in datatype" c_ty else ();
haftmann@33531
   383
        val _ = if length tfrees <> length vs
haftmann@35226
   384
          then no_constr thy "type variables missing in datatype" c_ty else ();
haftmann@31156
   385
      in (tyco, vs) end;
haftmann@35226
   386
    val (tyco, _) = last_typ (c, ty) ty_decl;
haftmann@35226
   387
    val (_, vs) = last_typ (c, ty) ty;
haftmann@35226
   388
  in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
haftmann@35226
   389
haftmann@35226
   390
fun constrset_of_consts thy cs =
haftmann@35226
   391
  let
haftmann@35226
   392
    val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
haftmann@35226
   393
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
haftmann@31156
   394
    fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
haftmann@31156
   395
      let
haftmann@31998
   396
        val _ = if (tyco' : string) <> tyco
haftmann@31156
   397
          then error "Different type constructors in constructor set"
haftmann@31156
   398
          else ();
haftmann@31156
   399
        val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
haftmann@31156
   400
      in ((tyco, sorts), c :: cs) end;
haftmann@31156
   401
    fun inst vs' (c, (vs, ty)) =
haftmann@31156
   402
      let
haftmann@31156
   403
        val the_v = the o AList.lookup (op =) (vs ~~ vs');
haftmann@31156
   404
        val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty;
haftmann@31156
   405
      in (c, (fst o strip_type) ty') end;
haftmann@35226
   406
    val c' :: cs' = map (ty_sorts thy) cs;
haftmann@31156
   407
    val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
haftmann@31156
   408
    val vs = Name.names Name.context Name.aT sorts;
haftmann@31156
   409
    val cs''' = map (inst vs) cs'';
haftmann@31156
   410
  in (tyco, (vs, rev cs''')) end;
haftmann@31156
   411
haftmann@35299
   412
fun get_type_entry thy tyco = case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
haftmann@35226
   413
 of (_, entry) :: _ => SOME entry
haftmann@35226
   414
  | _ => NONE;
haftmann@31962
   415
haftmann@35299
   416
fun get_type_spec thy tyco = case get_type_entry thy tyco
haftmann@35226
   417
 of SOME (vs, spec) => apfst (pair vs) (constructors_of spec)
haftmann@35226
   418
  | NONE => arity_number thy tyco
haftmann@35226
   419
      |> Name.invents Name.context Name.aT
haftmann@35226
   420
      |> map (rpair [])
haftmann@35226
   421
      |> rpair []
haftmann@35226
   422
      |> rpair false;
haftmann@35226
   423
haftmann@35299
   424
fun get_abstype_spec thy tyco = case get_type_entry thy tyco
haftmann@35226
   425
 of SOME (vs, Abstractor spec) => (vs, spec)
haftmann@36122
   426
  | _ => error ("Not an abstract type: " ^ tyco);
haftmann@35226
   427
 
haftmann@35299
   428
fun get_type thy = fst o get_type_spec thy;
haftmann@35226
   429
haftmann@35299
   430
fun get_type_of_constr_or_abstr thy c =
haftmann@33940
   431
  case (snd o strip_type o const_typ thy) c
haftmann@35299
   432
   of Type (tyco, _) => let val ((vs, cos), abstract) = get_type_spec thy tyco
haftmann@35226
   433
        in if member (op =) (map fst cos) c then SOME (tyco, abstract) else NONE end
haftmann@31962
   434
    | _ => NONE;
haftmann@31962
   435
haftmann@35299
   436
fun is_constr thy c = case get_type_of_constr_or_abstr thy c
haftmann@35226
   437
 of SOME (_, false) => true
haftmann@35226
   438
   | _ => false;
haftmann@35226
   439
haftmann@35299
   440
fun is_abstr thy c = case get_type_of_constr_or_abstr thy c
haftmann@35226
   441
 of SOME (_, true) => true
haftmann@35226
   442
   | _ => false;
haftmann@31962
   443
haftmann@31156
   444
haftmann@34874
   445
(* bare code equations *)
haftmann@31156
   446
haftmann@35226
   447
(* convention for variables:
haftmann@35226
   448
    ?x ?'a   for free-floating theorems (e.g. in the data store)
haftmann@35226
   449
    ?x  'a   for certificates
haftmann@35226
   450
     x  'a   for final representation of equations
haftmann@35226
   451
*)
haftmann@35226
   452
haftmann@31156
   453
exception BAD_THM of string;
haftmann@31156
   454
fun bad_thm msg = raise BAD_THM msg;
haftmann@31156
   455
fun error_thm f thm = f thm handle BAD_THM msg => error msg;
haftmann@31642
   456
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
haftmann@31156
   457
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
haftmann@31156
   458
haftmann@31156
   459
fun is_linear thm =
haftmann@31156
   460
  let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@31156
   461
  in not (has_duplicates (op =) ((fold o fold_aterms)
haftmann@31156
   462
    (fn Var (v, _) => cons v | _ => I) args [])) end;
haftmann@31156
   463
haftmann@35226
   464
fun check_eqn thy { allow_nonlinear, allow_consts, allow_pats } thm (lhs, rhs) =
haftmann@31156
   465
  let
haftmann@34894
   466
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@31156
   467
    fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
haftmann@34894
   468
      | Free _ => bad "Illegal free variable in equation"
haftmann@31156
   469
      | _ => I) t [];
haftmann@31156
   470
    fun tvars_of t = fold_term_types (fn _ =>
haftmann@31156
   471
      fold_atyps (fn TVar (v, _) => insert (op =) v
haftmann@34894
   472
        | TFree _ => bad "Illegal free type variable in equation")) t [];
haftmann@31156
   473
    val lhs_vs = vars_of lhs;
haftmann@31156
   474
    val rhs_vs = vars_of rhs;
haftmann@31156
   475
    val lhs_tvs = tvars_of lhs;
haftmann@31156
   476
    val rhs_tvs = tvars_of rhs;
haftmann@31156
   477
    val _ = if null (subtract (op =) lhs_vs rhs_vs)
haftmann@31156
   478
      then ()
haftmann@34894
   479
      else bad "Free variables on right hand side of equation";
haftmann@31156
   480
    val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
haftmann@31156
   481
      then ()
haftmann@34894
   482
      else bad "Free type variables on right hand side of equation";
haftmann@34894
   483
    val (head, args) = strip_comb lhs;
haftmann@31156
   484
    val (c, ty) = case head
haftmann@31156
   485
     of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
haftmann@34894
   486
      | _ => bad "Equation not headed by constant";
haftmann@34894
   487
    fun check _ (Abs _) = bad "Abstraction on left hand side of equation"
haftmann@31156
   488
      | check 0 (Var _) = ()
haftmann@34894
   489
      | check _ (Var _) = bad "Variable with application on left hand side of equation"
haftmann@31156
   490
      | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
haftmann@34894
   491
      | check n (Const (c_ty as (c, ty))) =
haftmann@35226
   492
          if allow_pats then let
haftmann@33940
   493
            val c' = AxClass.unoverload_const thy c_ty
haftmann@33940
   494
          in if n = (length o fst o strip_type o subst_signature thy c') ty
haftmann@35226
   495
            then if allow_consts orelse is_constr thy c'
haftmann@33940
   496
              then ()
haftmann@34894
   497
              else bad (quote c ^ " is not a constructor, on left hand side of equation")
haftmann@34894
   498
            else bad ("Partially applied constant " ^ quote c ^ " on left hand side of equation")
haftmann@35226
   499
          end else bad ("Pattern not allowed, but constant " ^ quote c ^ " encountered on left hand side")
haftmann@31156
   500
    val _ = map (check 0) args;
haftmann@35226
   501
    val _ = if allow_nonlinear orelse is_linear thm then ()
haftmann@34894
   502
      else bad "Duplicate variables on left hand side of equation";
haftmann@34894
   503
    val _ = if (is_none o AxClass.class_of_param thy) c then ()
haftmann@34894
   504
      else bad "Overloaded constant as head in equation";
haftmann@34894
   505
    val _ = if not (is_constr thy c) then ()
haftmann@34894
   506
      else bad "Constructor as head in equation";
haftmann@35226
   507
    val _ = if not (is_abstr thy c) then ()
haftmann@35226
   508
      else bad "Abstractor as head in equation";
haftmann@31156
   509
    val ty_decl = Sign.the_const_type thy c;
haftmann@31156
   510
    val _ = if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty)
haftmann@31156
   511
      then () else bad_thm ("Type\n" ^ string_of_typ thy ty
haftmann@34894
   512
        ^ "\nof equation\n"
haftmann@34894
   513
        ^ Display.string_of_thm_global thy thm
haftmann@34894
   514
        ^ "\nis incompatible with declared function type\n"
haftmann@34894
   515
        ^ string_of_typ thy ty_decl)
haftmann@35226
   516
  in () end;
haftmann@35226
   517
haftmann@35226
   518
fun gen_assert_eqn thy check_patterns (thm, proper) =
haftmann@35226
   519
  let
haftmann@35226
   520
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@35226
   521
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@35226
   522
      handle TERM _ => bad "Not an equation"
haftmann@35226
   523
           | THM _ => bad "Not a proper equation";
haftmann@35226
   524
    val _ = check_eqn thy { allow_nonlinear = not proper,
haftmann@35226
   525
      allow_consts = not (proper andalso check_patterns), allow_pats = true } thm (lhs, rhs);
haftmann@31156
   526
  in (thm, proper) end;
haftmann@31156
   527
haftmann@35226
   528
fun assert_abs_eqn thy some_tyco thm =
haftmann@35226
   529
  let
haftmann@35226
   530
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@35226
   531
    val (full_lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@35226
   532
      handle TERM _ => bad "Not an equation"
haftmann@35226
   533
           | THM _ => bad "Not a proper equation";
haftmann@35226
   534
    val (rep, lhs) = dest_comb full_lhs
haftmann@35226
   535
      handle TERM _ => bad "Not an abstract equation";
haftmann@36202
   536
    val (rep_const, ty) = dest_Const rep;
haftmann@36202
   537
    val (tyco, sorts) = ((apsnd o map) (snd o dest_TVar) o dest_Type o domain_type) ty
haftmann@35226
   538
      handle TERM _ => bad "Not an abstract equation";
haftmann@35226
   539
    val _ = case some_tyco of SOME tyco' => if tyco = tyco' then ()
haftmann@35226
   540
          else bad ("Abstract type mismatch:" ^ quote tyco ^ " vs. " ^ quote tyco')
haftmann@35226
   541
      | NONE => ();
haftmann@36202
   542
    val (vs', (_, (rep', _))) = get_abstype_spec thy tyco;
haftmann@35226
   543
    val _ = if rep_const = rep' then ()
haftmann@35226
   544
      else bad ("Projection mismatch: " ^ quote rep_const ^ " vs. " ^ quote rep');
haftmann@35226
   545
    val _ = check_eqn thy { allow_nonlinear = false,
haftmann@35226
   546
      allow_consts = false, allow_pats = false } thm (lhs, rhs);
haftmann@36202
   547
    val _ = if forall (Sign.subsort thy) (sorts ~~ map snd  vs') then ()
haftmann@36202
   548
      else error ("Sort constraints on type arguments are weaker than in abstype certificate.")
haftmann@35226
   549
  in (thm, tyco) end;
haftmann@35226
   550
haftmann@34894
   551
fun assert_eqn thy = error_thm (gen_assert_eqn thy true);
haftmann@31962
   552
wenzelm@35624
   553
fun meta_rewrite thy = Local_Defs.meta_rewrite_rule (ProofContext.init thy);
haftmann@31156
   554
haftmann@34894
   555
fun mk_eqn thy = error_thm (gen_assert_eqn thy false) o
haftmann@31962
   556
  apfst (meta_rewrite thy);
haftmann@31962
   557
haftmann@31962
   558
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@34894
   559
  o warning_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
haftmann@31962
   560
haftmann@31962
   561
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@34894
   562
  o try_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
haftmann@31156
   563
haftmann@35226
   564
fun mk_abs_eqn thy = error_thm (assert_abs_eqn thy NONE) o meta_rewrite thy;
haftmann@35226
   565
haftmann@33940
   566
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31156
   567
haftmann@31957
   568
fun const_typ_eqn thy thm =
haftmann@31156
   569
  let
haftmann@32640
   570
    val (c, ty) = head_eqn thm;
haftmann@31156
   571
    val c' = AxClass.unoverload_const thy (c, ty);
haftmann@33940
   572
      (*permissive wrt. to overloaded constants!*)
haftmann@31156
   573
  in (c', ty) end;
haftmann@33940
   574
haftmann@31957
   575
fun const_eqn thy = fst o const_typ_eqn thy;
haftmann@31156
   576
haftmann@35226
   577
fun const_abs_eqn thy = AxClass.unoverload_const thy o dest_Const o fst o strip_comb o snd
haftmann@35226
   578
  o dest_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@35226
   579
haftmann@34874
   580
fun logical_typscheme thy (c, ty) =
haftmann@32873
   581
  (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
haftmann@33940
   582
haftmann@34874
   583
fun typscheme thy (c, ty) = logical_typscheme thy (c, subst_signature thy c ty);
haftmann@33940
   584
haftmann@35226
   585
fun mk_proj tyco vs ty abs rep =
haftmann@35226
   586
  let
haftmann@35226
   587
    val ty_abs = Type (tyco, map TFree vs);
haftmann@35226
   588
    val xarg = Var (("x", 0), ty);
haftmann@35226
   589
  in Logic.mk_equals (Const (rep, ty_abs --> ty) $ (Const (abs, ty --> ty_abs) $ xarg), xarg) end;
haftmann@35226
   590
haftmann@34895
   591
haftmann@34895
   592
(* technical transformations of code equations *)
haftmann@34895
   593
haftmann@34895
   594
fun expand_eta thy k thm =
haftmann@34895
   595
  let
haftmann@34895
   596
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@34895
   597
    val (_, args) = strip_comb lhs;
haftmann@34895
   598
    val l = if k = ~1
haftmann@34895
   599
      then (length o fst o strip_abs) rhs
haftmann@34895
   600
      else Int.max (0, k - length args);
haftmann@34895
   601
    val (raw_vars, _) = Term.strip_abs_eta l rhs;
haftmann@34895
   602
    val vars = burrow_fst (Name.variant_list (map (fst o fst) (Term.add_vars lhs [])))
haftmann@34895
   603
      raw_vars;
haftmann@34895
   604
    fun expand (v, ty) thm = Drule.fun_cong_rule thm
haftmann@34895
   605
      (Thm.cterm_of thy (Var ((v, 0), ty)));
haftmann@34895
   606
  in
haftmann@34895
   607
    thm
haftmann@34895
   608
    |> fold expand vars
haftmann@34895
   609
    |> Conv.fconv_rule Drule.beta_eta_conversion
haftmann@34895
   610
  end;
haftmann@34895
   611
haftmann@34895
   612
fun same_arity thy thms =
haftmann@31962
   613
  let
haftmann@34895
   614
    val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals;
haftmann@34895
   615
    val k = fold (Integer.max o num_args_of o Thm.prop_of) thms 0;
haftmann@34895
   616
  in map (expand_eta thy k) thms end;
haftmann@34895
   617
haftmann@34895
   618
fun mk_desymbolization pre post mk vs =
haftmann@34895
   619
  let
haftmann@34895
   620
    val names = map (pre o fst o fst) vs
haftmann@34895
   621
      |> map (Name.desymbolize false)
haftmann@34895
   622
      |> Name.variant_list []
haftmann@34895
   623
      |> map post;
haftmann@34895
   624
  in map_filter (fn (((v, i), x), v') =>
haftmann@34895
   625
    if v = v' andalso i = 0 then NONE
haftmann@34895
   626
    else SOME (((v, i), x), mk ((v', 0), x))) (vs ~~ names)
haftmann@34895
   627
  end;
haftmann@34895
   628
haftmann@34895
   629
fun desymbolize_tvars thy thms =
haftmann@34895
   630
  let
haftmann@34895
   631
    val tvs = fold (Term.add_tvars o Thm.prop_of) thms [];
haftmann@34895
   632
    val tvar_subst = mk_desymbolization (unprefix "'") (prefix "'") TVar tvs;
haftmann@34895
   633
  in map (Thm.certify_instantiate (tvar_subst, [])) thms end;
haftmann@34895
   634
haftmann@34895
   635
fun desymbolize_vars thy thm =
haftmann@34895
   636
  let
haftmann@34895
   637
    val vs = Term.add_vars (Thm.prop_of thm) [];
haftmann@34895
   638
    val var_subst = mk_desymbolization I I Var vs;
haftmann@34895
   639
  in Thm.certify_instantiate ([], var_subst) thm end;
haftmann@34895
   640
haftmann@34895
   641
fun canonize_thms thy = desymbolize_tvars thy #> same_arity thy #> map (desymbolize_vars thy);
haftmann@31156
   642
haftmann@34874
   643
haftmann@36112
   644
(* abstype certificates *)
haftmann@36112
   645
haftmann@36112
   646
fun check_abstype_cert thy proto_thm =
haftmann@36112
   647
  let
haftmann@36112
   648
    val thm = meta_rewrite thy proto_thm;
haftmann@36112
   649
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@36112
   650
    val (lhs, rhs) = Logic.dest_equals (Thm.plain_prop_of thm)
haftmann@36112
   651
      handle TERM _ => bad "Not an equation"
haftmann@36112
   652
           | THM _ => bad "Not a proper equation";
haftmann@36112
   653
    val ((abs, raw_ty), ((rep, _), param)) = (apsnd (apfst dest_Const o dest_comb)
haftmann@36112
   654
        o apfst dest_Const o dest_comb) lhs
haftmann@36112
   655
      handle TERM _ => bad "Not an abstype certificate";
haftmann@36112
   656
    val var = (fst o dest_Var) param
haftmann@36112
   657
      handle TERM _ => bad "Not an abstype certificate";
haftmann@36112
   658
    val _ = if param = rhs then () else bad "Not an abstype certificate";
haftmann@36112
   659
    val _ = pairself (fn c => if (is_some o AxClass.class_of_param thy) c
haftmann@36112
   660
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) (abs, rep);
haftmann@36112
   661
    val ((tyco, sorts), (abs, (vs, ty'))) = ty_sorts thy (abs, Logic.unvarifyT_global raw_ty);
haftmann@36112
   662
    val ty = domain_type ty';
haftmann@36112
   663
    val ty_abs = range_type ty';
haftmann@36112
   664
  in (tyco, (vs ~~ sorts, ((abs, ty), (rep, thm)))) end;
haftmann@36112
   665
haftmann@36112
   666
haftmann@34874
   667
(* code equation certificates *)
haftmann@34874
   668
haftmann@34895
   669
fun build_head thy (c, ty) =
haftmann@34895
   670
  Thm.cterm_of thy (Logic.mk_equals (Free ("HEAD", ty), Const (c, ty)));
haftmann@34874
   671
haftmann@34895
   672
fun get_head thy cert_thm =
haftmann@34895
   673
  let
haftmann@34895
   674
    val [head] = (#hyps o Thm.crep_thm) cert_thm;
haftmann@34895
   675
    val (_, Const (c, ty)) = (Logic.dest_equals o Thm.term_of) head;
haftmann@34895
   676
  in (typscheme thy (c, ty), head) end;
haftmann@34895
   677
haftmann@35226
   678
fun typscheme_projection thy =
haftmann@35226
   679
  typscheme thy o dest_Const o fst o dest_comb o fst o Logic.dest_equals;
haftmann@35226
   680
haftmann@35226
   681
fun typscheme_abs thy =
haftmann@35226
   682
  typscheme thy o dest_Const o fst o strip_comb o snd o dest_comb o fst o Logic.dest_equals o Thm.prop_of;
haftmann@35226
   683
haftmann@35226
   684
fun constrain_thm thy vs sorts thm =
haftmann@35226
   685
  let
haftmann@35226
   686
    val mapping = map2 (fn (v, sort) => fn sort' =>
haftmann@35226
   687
      (v, Sorts.inter_sort (Sign.classes_of thy) (sort, sort'))) vs sorts;
haftmann@35226
   688
    val inst = map2 (fn (v, sort) => fn (_, sort') =>
haftmann@35226
   689
      (((v, 0), sort), TFree (v, sort'))) vs mapping;
haftmann@35226
   690
    val subst = (map_types o map_atyps)
haftmann@35226
   691
      (fn TFree (v, _) => TFree (v, the (AList.lookup (op =) mapping v)));
haftmann@35226
   692
  in
haftmann@35226
   693
    thm
wenzelm@35845
   694
    |> Thm.varifyT_global
haftmann@35226
   695
    |> Thm.certify_instantiate (inst, [])
haftmann@35226
   696
    |> pair subst
haftmann@35226
   697
  end;
haftmann@35226
   698
haftmann@35226
   699
fun concretify_abs thy tyco abs_thm =
haftmann@35226
   700
  let
haftmann@35226
   701
    val (vs, ((c, _), (_, cert))) = get_abstype_spec thy tyco;
haftmann@35226
   702
    val lhs = (fst o Logic.dest_equals o Thm.prop_of) abs_thm
haftmann@35226
   703
    val ty = fastype_of lhs;
haftmann@35226
   704
    val ty_abs = (fastype_of o snd o dest_comb) lhs;
haftmann@35226
   705
    val abs = Thm.cterm_of thy (Const (c, ty --> ty_abs));
haftmann@35226
   706
    val raw_concrete_thm = Drule.transitive_thm OF [Thm.symmetric cert, Thm.combination (Thm.reflexive abs) abs_thm];
wenzelm@35845
   707
  in (c, (Thm.varifyT_global o zero_var_indexes) raw_concrete_thm) end;
haftmann@35226
   708
haftmann@35226
   709
fun add_rhss_of_eqn thy t =
haftmann@35226
   710
  let
haftmann@35226
   711
    val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy) t;
haftmann@35226
   712
    fun add_const (Const (c, ty)) = insert (op =) (c, Sign.const_typargs thy (c, ty))
haftmann@35226
   713
      | add_const _ = I
haftmann@35226
   714
  in fold_aterms add_const t end;
haftmann@35226
   715
wenzelm@35845
   716
fun dest_eqn thy =
wenzelm@35845
   717
  apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy o Logic.unvarify_global;
haftmann@35226
   718
haftmann@35226
   719
abstype cert = Equations of thm * bool list
haftmann@35226
   720
  | Projection of term * string
haftmann@35226
   721
  | Abstract of thm * string
haftmann@35226
   722
with
haftmann@34891
   723
haftmann@34891
   724
fun empty_cert thy c = 
haftmann@34891
   725
  let
haftmann@34891
   726
    val raw_ty = const_typ thy c;
haftmann@34891
   727
    val tvars = Term.add_tvar_namesT raw_ty [];
haftmann@34891
   728
    val tvars' = case AxClass.class_of_param thy c
haftmann@34891
   729
     of SOME class => [TFree (Name.aT, [class])]
haftmann@34891
   730
      | NONE => Name.invent_list [] Name.aT (length tvars)
haftmann@34891
   731
          |> map (fn v => TFree (v, []));
haftmann@34891
   732
    val ty = typ_subst_TVars (tvars ~~ tvars') raw_ty;
haftmann@34895
   733
    val chead = build_head thy (c, ty);
haftmann@35226
   734
  in Equations (Thm.weaken chead Drule.dummy_thm, []) end;
haftmann@34891
   735
haftmann@34891
   736
fun cert_of_eqns thy c [] = empty_cert thy c
haftmann@34895
   737
  | cert_of_eqns thy c raw_eqns = 
haftmann@34874
   738
      let
haftmann@34895
   739
        val eqns = burrow_fst (canonize_thms thy) raw_eqns;
haftmann@34895
   740
        val _ = map (assert_eqn thy) eqns;
haftmann@34891
   741
        val (thms, propers) = split_list eqns;
haftmann@34895
   742
        val _ = map (fn thm => if c = const_eqn thy thm then ()
haftmann@34895
   743
          else error ("Wrong head of code equation,\nexpected constant "
haftmann@34895
   744
            ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)) thms;
haftmann@34891
   745
        fun tvars_of T = rev (Term.add_tvarsT T []);
haftmann@34891
   746
        val vss = map (tvars_of o snd o head_eqn) thms;
haftmann@34891
   747
        fun inter_sorts vs =
haftmann@34891
   748
          fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
haftmann@34891
   749
        val sorts = map_transpose inter_sorts vss;
haftmann@34891
   750
        val vts = Name.names Name.context Name.aT sorts;
haftmann@34891
   751
        val thms as thm :: _ =
haftmann@34891
   752
          map2 (fn vs => Thm.certify_instantiate (vs ~~ map TFree vts, [])) vss thms;
haftmann@34895
   753
        val head_thm = Thm.symmetric (Thm.assume (build_head thy (head_eqn (hd thms))));
haftmann@34874
   754
        fun head_conv ct = if can Thm.dest_comb ct
haftmann@34874
   755
          then Conv.fun_conv head_conv ct
haftmann@34874
   756
          else Conv.rewr_conv head_thm ct;
haftmann@34874
   757
        val rewrite_head = Conv.fconv_rule (Conv.arg1_conv head_conv);
haftmann@34891
   758
        val cert_thm = Conjunction.intr_balanced (map rewrite_head thms);
haftmann@35226
   759
      in Equations (cert_thm, propers) end;
haftmann@34891
   760
haftmann@35226
   761
fun cert_of_proj thy c tyco =
haftmann@35226
   762
  let
haftmann@35226
   763
    val (vs, ((abs, ty), (rep, cert))) = get_abstype_spec thy tyco;
haftmann@35226
   764
    val _ = if c = rep then () else
haftmann@35226
   765
      error ("Wrong head of projection,\nexpected constant " ^ string_of_const thy rep);
haftmann@35226
   766
  in Projection (mk_proj tyco vs ty abs rep, tyco) end;
haftmann@35226
   767
haftmann@35226
   768
fun cert_of_abs thy tyco c raw_abs_thm =
haftmann@34874
   769
  let
haftmann@35226
   770
    val abs_thm = singleton (canonize_thms thy) raw_abs_thm;
haftmann@35226
   771
    val _ = assert_abs_eqn thy (SOME tyco) abs_thm;
haftmann@35226
   772
    val _ = if c = const_abs_eqn thy abs_thm then ()
haftmann@35226
   773
      else error ("Wrong head of abstract code equation,\nexpected constant "
haftmann@35226
   774
        ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy abs_thm);
haftmann@35226
   775
  in Abstract (Thm.freezeT abs_thm, tyco) end;
haftmann@34874
   776
haftmann@35226
   777
fun constrain_cert thy sorts (Equations (cert_thm, propers)) =
haftmann@35226
   778
      let
haftmann@35226
   779
        val ((vs, _), head) = get_head thy cert_thm;
haftmann@35226
   780
        val (subst, cert_thm') = cert_thm
haftmann@35226
   781
          |> Thm.implies_intr head
haftmann@35226
   782
          |> constrain_thm thy vs sorts;
haftmann@35226
   783
        val head' = Thm.term_of head
haftmann@35226
   784
          |> subst
haftmann@35226
   785
          |> Thm.cterm_of thy;
haftmann@35226
   786
        val cert_thm'' = cert_thm'
haftmann@35226
   787
          |> Thm.elim_implies (Thm.assume head');
haftmann@35226
   788
      in Equations (cert_thm'', propers) end
haftmann@35226
   789
  | constrain_cert thy _ (cert as Projection _) =
haftmann@35226
   790
      cert
haftmann@35226
   791
  | constrain_cert thy sorts (Abstract (abs_thm, tyco)) =
haftmann@35226
   792
      Abstract (snd (constrain_thm thy (fst (typscheme_abs thy abs_thm)) sorts abs_thm), tyco);
haftmann@35226
   793
haftmann@35226
   794
fun typscheme_of_cert thy (Equations (cert_thm, _)) =
haftmann@35226
   795
      fst (get_head thy cert_thm)
haftmann@35226
   796
  | typscheme_of_cert thy (Projection (proj, _)) =
haftmann@35226
   797
      typscheme_projection thy proj
haftmann@35226
   798
  | typscheme_of_cert thy (Abstract (abs_thm, _)) =
haftmann@35226
   799
      typscheme_abs thy abs_thm;
haftmann@34874
   800
haftmann@35226
   801
fun typargs_deps_of_cert thy (Equations (cert_thm, propers)) =
haftmann@35226
   802
      let
haftmann@35226
   803
        val vs = (fst o fst) (get_head thy cert_thm);
haftmann@35226
   804
        val equations = if null propers then [] else
haftmann@35226
   805
          Thm.prop_of cert_thm
haftmann@35226
   806
          |> Logic.dest_conjunction_balanced (length propers);
haftmann@35226
   807
      in (vs, fold (add_rhss_of_eqn thy) equations []) end
haftmann@35226
   808
  | typargs_deps_of_cert thy (Projection (t, tyco)) =
haftmann@35226
   809
      (fst (typscheme_projection thy t), add_rhss_of_eqn thy t [])
haftmann@35226
   810
  | typargs_deps_of_cert thy (Abstract (abs_thm, tyco)) =
haftmann@35226
   811
      let
haftmann@35226
   812
        val vs = fst (typscheme_abs thy abs_thm);
haftmann@35226
   813
        val (_, concrete_thm) = concretify_abs thy tyco abs_thm;
haftmann@36202
   814
      in (vs, add_rhss_of_eqn thy (map_types Logic.unvarifyT_global (Thm.prop_of concrete_thm)) []) end;
haftmann@34895
   815
haftmann@35226
   816
fun equations_of_cert thy (cert as Equations (cert_thm, propers)) =
haftmann@35226
   817
      let
haftmann@35226
   818
        val tyscm = typscheme_of_cert thy cert;
haftmann@35226
   819
        val thms = if null propers then [] else
haftmann@35226
   820
          cert_thm
wenzelm@35624
   821
          |> Local_Defs.expand [snd (get_head thy cert_thm)]
wenzelm@35845
   822
          |> Thm.varifyT_global
haftmann@35226
   823
          |> Conjunction.elim_balanced (length propers);
haftmann@35226
   824
      in (tyscm, map (pair NONE o dest_eqn thy o Thm.prop_of) thms ~~ (map SOME thms ~~ propers)) end
haftmann@35226
   825
  | equations_of_cert thy (Projection (t, tyco)) =
haftmann@35226
   826
      let
haftmann@35226
   827
        val (_, ((abs, _), _)) = get_abstype_spec thy tyco;
haftmann@35226
   828
        val tyscm = typscheme_projection thy t;
wenzelm@35845
   829
        val t' = map_types Logic.varifyT_global t;
haftmann@35226
   830
      in (tyscm, [((SOME abs, dest_eqn thy t'), (NONE, true))]) end
haftmann@35226
   831
  | equations_of_cert thy (Abstract (abs_thm, tyco)) =
haftmann@35226
   832
      let
haftmann@35226
   833
        val tyscm = typscheme_abs thy abs_thm;
haftmann@35226
   834
        val (abs, concrete_thm) = concretify_abs thy tyco abs_thm;
haftmann@35226
   835
        val _ = fold_aterms (fn Const (c, _) => if c = abs
haftmann@35226
   836
          then error ("Abstraction violation in abstract code equation\n" ^ Display.string_of_thm_global thy abs_thm)
haftmann@35226
   837
          else I | _ => I) (Thm.prop_of abs_thm);
wenzelm@35845
   838
      in
wenzelm@35845
   839
        (tyscm, [((SOME abs, dest_eqn thy (Thm.prop_of concrete_thm)), (SOME (Thm.varifyT_global abs_thm), true))])
wenzelm@35845
   840
      end;
haftmann@34895
   841
haftmann@35226
   842
fun pretty_cert thy (cert as Equations _) =
haftmann@35226
   843
      (map_filter (Option.map (Display.pretty_thm_global thy o AxClass.overload thy) o fst o snd)
haftmann@35226
   844
         o snd o equations_of_cert thy) cert
haftmann@35226
   845
  | pretty_cert thy (Projection (t, _)) =
wenzelm@35845
   846
      [Syntax.pretty_term_global thy (map_types Logic.varifyT_global t)]
haftmann@35226
   847
  | pretty_cert thy (Abstract (abs_thm, tyco)) =
wenzelm@35845
   848
      [(Display.pretty_thm_global thy o AxClass.overload thy o Thm.varifyT_global) abs_thm];
haftmann@35226
   849
haftmann@35226
   850
fun bare_thms_of_cert thy (cert as Equations _) =
haftmann@35226
   851
      (map_filter (fn (_, (some_thm, proper)) => if proper then some_thm else NONE)
haftmann@35226
   852
        o snd o equations_of_cert thy) cert
haftmann@35376
   853
  | bare_thms_of_cert thy (Projection _) = []
haftmann@35376
   854
  | bare_thms_of_cert thy (Abstract (abs_thm, tyco)) =
wenzelm@35845
   855
      [Thm.varifyT_global (snd (concretify_abs thy tyco abs_thm))];
haftmann@34895
   856
haftmann@34895
   857
end;
haftmann@34891
   858
haftmann@34874
   859
haftmann@35226
   860
(* code certificate access *)
haftmann@35226
   861
haftmann@35226
   862
fun retrieve_raw thy c =
haftmann@35226
   863
  Symtab.lookup ((the_functions o the_exec) thy) c
haftmann@35226
   864
  |> Option.map (snd o fst)
haftmann@35226
   865
  |> the_default (Default [])
haftmann@34874
   866
haftmann@35226
   867
fun get_cert thy f c = case retrieve_raw thy c
haftmann@35226
   868
 of Default eqns => eqns
haftmann@35226
   869
      |> (map o apfst) (Thm.transfer thy)
haftmann@35226
   870
      |> f
haftmann@35226
   871
      |> (map o apfst) (AxClass.unoverload thy)
haftmann@35226
   872
      |> cert_of_eqns thy c
haftmann@35226
   873
  | Eqns eqns => eqns
haftmann@35226
   874
      |> (map o apfst) (Thm.transfer thy)
haftmann@35226
   875
      |> f
haftmann@35226
   876
      |> (map o apfst) (AxClass.unoverload thy)
haftmann@35226
   877
      |> cert_of_eqns thy c
haftmann@35226
   878
  | Proj (_, tyco) =>
haftmann@35226
   879
      cert_of_proj thy c tyco
haftmann@35226
   880
  | Abstr (abs_thm, tyco) => abs_thm
haftmann@35226
   881
      |> Thm.transfer thy
haftmann@35226
   882
      |> AxClass.unoverload thy
haftmann@35226
   883
      |> cert_of_abs thy tyco c;
haftmann@31962
   884
haftmann@31962
   885
haftmann@31962
   886
(* cases *)
haftmann@31156
   887
haftmann@31156
   888
fun case_certificate thm =
haftmann@31156
   889
  let
haftmann@31156
   890
    val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
haftmann@32640
   891
      o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
haftmann@31156
   892
    val _ = case head of Free _ => true
haftmann@31156
   893
      | Var _ => true
haftmann@31156
   894
      | _ => raise TERM ("case_cert", []);
haftmann@31156
   895
    val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
haftmann@31156
   896
    val (Const (case_const, _), raw_params) = strip_comb case_expr;
haftmann@31156
   897
    val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
haftmann@31156
   898
    val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
haftmann@31156
   899
    val params = map (fst o dest_Var) (nth_drop n raw_params);
haftmann@31156
   900
    fun dest_case t =
haftmann@31156
   901
      let
haftmann@31156
   902
        val (head' $ t_co, rhs) = Logic.dest_equals t;
haftmann@31156
   903
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   904
        val (Const (co, _), args) = strip_comb t_co;
haftmann@31156
   905
        val (Var (param, _), args') = strip_comb rhs;
haftmann@31156
   906
        val _ = if args' = args then () else raise TERM ("case_cert", []);
haftmann@31156
   907
      in (param, co) end;
haftmann@31156
   908
    fun analyze_cases cases =
haftmann@31156
   909
      let
haftmann@31156
   910
        val co_list = fold (AList.update (op =) o dest_case) cases [];
haftmann@31156
   911
      in map (the o AList.lookup (op =) co_list) params end;
haftmann@31156
   912
    fun analyze_let t =
haftmann@31156
   913
      let
haftmann@31156
   914
        val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
haftmann@31156
   915
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   916
        val _ = if arg' = arg then () else raise TERM ("case_cert", []);
haftmann@31156
   917
        val _ = if [param'] = params then () else raise TERM ("case_cert", []);
haftmann@31156
   918
      in [] end;
haftmann@31156
   919
    fun analyze (cases as [let_case]) =
haftmann@31156
   920
          (analyze_cases cases handle Bind => analyze_let let_case)
haftmann@31156
   921
      | analyze cases = analyze_cases cases;
haftmann@31156
   922
  in (case_const, (n, analyze cases)) end;
haftmann@31156
   923
haftmann@31156
   924
fun case_cert thm = case_certificate thm
haftmann@31156
   925
  handle Bind => error "bad case certificate"
haftmann@31156
   926
       | TERM _ => error "bad case certificate";
haftmann@31156
   927
haftmann@31962
   928
fun get_case_scheme thy = Symtab.lookup ((fst o the_cases o the_exec) thy);
haftmann@24219
   929
haftmann@31962
   930
val undefineds = Symtab.keys o snd o the_cases o the_exec;
haftmann@24219
   931
haftmann@24219
   932
haftmann@31962
   933
(* diagnostic *)
haftmann@24219
   934
haftmann@24219
   935
fun print_codesetup thy =
haftmann@24219
   936
  let
haftmann@24219
   937
    val ctxt = ProofContext.init thy;
haftmann@24844
   938
    val exec = the_exec thy;
haftmann@35226
   939
    fun pretty_equations const thms =
haftmann@24219
   940
      (Pretty.block o Pretty.fbreaks) (
haftmann@35226
   941
        Pretty.str (string_of_const thy const) :: map (Display.pretty_thm ctxt) thms
haftmann@24219
   942
      );
haftmann@35226
   943
    fun pretty_function (const, Default eqns) = pretty_equations const (map fst eqns)
haftmann@35226
   944
      | pretty_function (const, Eqns eqns) = pretty_equations const (map fst eqns)
haftmann@35226
   945
      | pretty_function (const, Proj (proj, _)) = Pretty.block
haftmann@35226
   946
          [Pretty.str (string_of_const thy const), Pretty.fbrk, Syntax.pretty_term ctxt proj]
haftmann@35226
   947
      | pretty_function (const, Abstr (thm, _)) = pretty_equations const [thm];
haftmann@35226
   948
    fun pretty_typ (tyco, vs) = Pretty.str
haftmann@35226
   949
      (string_of_typ thy (Type (tyco, map TFree vs)));
haftmann@35226
   950
    fun pretty_typspec (typ, (cos, abstract)) = if null cos
haftmann@35226
   951
      then pretty_typ typ
haftmann@35226
   952
      else (Pretty.block o Pretty.breaks) (
haftmann@35226
   953
        pretty_typ typ
haftmann@35226
   954
        :: Pretty.str "="
haftmann@35226
   955
        :: (if abstract then [Pretty.str "(abstract)"] else [])
haftmann@35226
   956
        @ separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
haftmann@35226
   957
             | (c, tys) =>
haftmann@35226
   958
                 (Pretty.block o Pretty.breaks)
haftmann@35226
   959
                    (Pretty.str (string_of_const thy c)
haftmann@35226
   960
                      :: Pretty.str "of"
haftmann@35226
   961
                      :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@35226
   962
      );
haftmann@34901
   963
    fun pretty_case (const, (_, (_, []))) = Pretty.str (string_of_const thy const)
haftmann@34901
   964
      | pretty_case (const, (_, (_, cos))) = (Pretty.block o Pretty.breaks) [
haftmann@34901
   965
          Pretty.str (string_of_const thy const), Pretty.str "with",
haftmann@34901
   966
          (Pretty.block o Pretty.commas o map (Pretty.str o string_of_const thy)) cos];
haftmann@35226
   967
    val functions = the_functions exec
haftmann@24423
   968
      |> Symtab.dest
haftmann@28695
   969
      |> (map o apsnd) (snd o fst)
haftmann@24219
   970
      |> sort (string_ord o pairself fst);
haftmann@35299
   971
    val datatypes = the_types exec
haftmann@24219
   972
      |> Symtab.dest
haftmann@35226
   973
      |> map (fn (tyco, (_, (vs, spec)) :: _) =>
haftmann@35226
   974
          ((tyco, vs), constructors_of spec))
haftmann@35226
   975
      |> sort (string_ord o pairself (fst o fst));
haftmann@34901
   976
    val cases = Symtab.dest ((fst o the_cases o the_exec) thy);
haftmann@34901
   977
    val undefineds = Symtab.keys ((snd o the_cases o the_exec) thy);
haftmann@24219
   978
  in
haftmann@24219
   979
    (Pretty.writeln o Pretty.chunks) [
haftmann@24219
   980
      Pretty.block (
haftmann@34901
   981
        Pretty.str "code equations:" :: Pretty.fbrk
haftmann@35226
   982
        :: (Pretty.fbreaks o map pretty_function) functions
haftmann@24219
   983
      ),
haftmann@25968
   984
      Pretty.block (
haftmann@34901
   985
        Pretty.str "datatypes:" :: Pretty.fbrk
haftmann@35226
   986
        :: (Pretty.fbreaks o map pretty_typspec) datatypes
haftmann@34901
   987
      ),
haftmann@34901
   988
      Pretty.block (
haftmann@34901
   989
        Pretty.str "cases:" :: Pretty.fbrk
haftmann@34901
   990
        :: (Pretty.fbreaks o map pretty_case) cases
haftmann@34901
   991
      ),
haftmann@34901
   992
      Pretty.block (
haftmann@34901
   993
        Pretty.str "undefined:" :: Pretty.fbrk
haftmann@34901
   994
        :: (Pretty.commas o map (Pretty.str o string_of_const thy)) undefineds
haftmann@24219
   995
      )
haftmann@24219
   996
    ]
haftmann@24219
   997
  end;
haftmann@24219
   998
haftmann@24219
   999
haftmann@31962
  1000
(** declaring executable ingredients **)
haftmann@31962
  1001
haftmann@33940
  1002
(* constant signatures *)
haftmann@33940
  1003
haftmann@33940
  1004
fun add_type tyco thy =
haftmann@33940
  1005
  case Symtab.lookup ((snd o #types o Type.rep_tsig o Sign.tsig_of) thy) tyco
haftmann@33940
  1006
   of SOME (Type.Abbreviation (vs, _, _)) =>
haftmann@34173
  1007
          (map_exec_purge o map_signatures o apfst)
haftmann@33940
  1008
            (Symtab.update (tyco, length vs)) thy
haftmann@33940
  1009
    | _ => error ("No such type abbreviation: " ^ quote tyco);
haftmann@33940
  1010
haftmann@33940
  1011
fun add_type_cmd s thy = add_type (Sign.intern_type thy s) thy;
haftmann@33940
  1012
haftmann@33940
  1013
fun gen_add_signature prep_const prep_signature (raw_c, raw_ty) thy =
haftmann@33940
  1014
  let
haftmann@33940
  1015
    val c = prep_const thy raw_c;
haftmann@33940
  1016
    val ty = prep_signature thy raw_ty;
haftmann@33940
  1017
    val ty' = expand_signature thy ty;
haftmann@33940
  1018
    val ty'' = Sign.the_const_type thy c;
haftmann@33940
  1019
    val _ = if typ_equiv (ty', ty'') then () else
haftmann@33940
  1020
      error ("Illegal constant signature: " ^ Syntax.string_of_typ_global thy ty);
haftmann@33940
  1021
  in
haftmann@33940
  1022
    thy
haftmann@34173
  1023
    |> (map_exec_purge o map_signatures o apsnd) (Symtab.update (c, ty))
haftmann@33940
  1024
  end;
haftmann@33940
  1025
haftmann@33940
  1026
val add_signature = gen_add_signature (K I) cert_signature;
haftmann@33940
  1027
val add_signature_cmd = gen_add_signature read_const read_signature;
haftmann@33940
  1028
haftmann@33940
  1029
haftmann@31962
  1030
(* code equations *)
haftmann@31962
  1031
haftmann@35226
  1032
fun gen_add_eqn default (raw_thm, proper) thy =
haftmann@33075
  1033
  let
haftmann@35226
  1034
    val thm = Thm.close_derivation raw_thm;
haftmann@35226
  1035
    val c = const_eqn thy thm;
haftmann@35226
  1036
    fun add_eqn' true (Default eqns) = Default (eqns @ [(thm, proper)])
haftmann@35226
  1037
      | add_eqn' _ (Eqns eqns) =
haftmann@35226
  1038
          let
haftmann@35226
  1039
            val args_of = snd o strip_comb o map_types Type.strip_sorts
haftmann@35226
  1040
              o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@35226
  1041
            val args = args_of thm;
haftmann@35226
  1042
            val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
haftmann@35226
  1043
            fun matches_args args' = length args <= length args' andalso
haftmann@35226
  1044
              Pattern.matchess thy (args, (map incr_idx o take (length args)) args');
haftmann@35226
  1045
            fun drop (thm', proper') = if (proper orelse not proper')
haftmann@35226
  1046
              andalso matches_args (args_of thm') then 
haftmann@35226
  1047
                (warning ("Code generator: dropping redundant code equation\n" ^
haftmann@35226
  1048
                    Display.string_of_thm_global thy thm'); true)
haftmann@35226
  1049
              else false;
haftmann@35226
  1050
          in Eqns ((thm, proper) :: filter_out drop eqns) end
haftmann@35226
  1051
      | add_eqn' false _ = Eqns [(thm, proper)];
haftmann@35226
  1052
  in change_fun_spec false c (add_eqn' default) thy end;
haftmann@31962
  1053
haftmann@31962
  1054
fun add_eqn thm thy =
haftmann@31962
  1055
  gen_add_eqn false (mk_eqn thy (thm, true)) thy;
haftmann@31962
  1056
haftmann@31962
  1057
fun add_warning_eqn thm thy =
haftmann@31962
  1058
  case mk_eqn_warning thy thm
haftmann@31962
  1059
   of SOME eqn => gen_add_eqn false eqn thy
haftmann@31962
  1060
    | NONE => thy;
haftmann@31962
  1061
haftmann@31962
  1062
fun add_default_eqn thm thy =
haftmann@31962
  1063
  case mk_eqn_liberal thy thm
haftmann@31962
  1064
   of SOME eqn => gen_add_eqn true eqn thy
haftmann@31962
  1065
    | NONE => thy;
haftmann@31962
  1066
haftmann@31962
  1067
fun add_nbe_eqn thm thy =
haftmann@31962
  1068
  gen_add_eqn false (mk_eqn thy (thm, false)) thy;
haftmann@31962
  1069
haftmann@31962
  1070
val add_default_eqn_attribute = Thm.declaration_attribute
haftmann@31962
  1071
  (fn thm => Context.mapping (add_default_eqn thm) I);
haftmann@31962
  1072
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
haftmann@31962
  1073
haftmann@35226
  1074
fun add_abs_eqn raw_thm thy =
haftmann@35226
  1075
  let
haftmann@35226
  1076
    val (abs_thm, tyco) = (apfst Thm.close_derivation o mk_abs_eqn thy) raw_thm;
haftmann@35226
  1077
    val c = const_abs_eqn thy abs_thm;
haftmann@35226
  1078
  in change_fun_spec false c (K (Abstr (abs_thm, tyco))) thy end;
haftmann@35226
  1079
haftmann@31962
  1080
fun del_eqn thm thy = case mk_eqn_liberal thy thm
haftmann@35226
  1081
 of SOME (thm, _) => let
haftmann@35226
  1082
        fun del_eqn' (Default eqns) = empty_fun_spec
haftmann@35226
  1083
          | del_eqn' (Eqns eqns) =
haftmann@35226
  1084
              Eqns (filter_out (fn (thm', _) => Thm.eq_thm_prop (thm, thm')) eqns)
haftmann@35226
  1085
          | del_eqn' spec = spec
haftmann@35226
  1086
      in change_fun_spec true (const_eqn thy thm) del_eqn' thy end
haftmann@31962
  1087
  | NONE => thy;
haftmann@31962
  1088
haftmann@35226
  1089
fun del_eqns c = change_fun_spec true c (K empty_fun_spec);
haftmann@34244
  1090
haftmann@34244
  1091
haftmann@34244
  1092
(* cases *)
haftmann@34244
  1093
haftmann@34244
  1094
fun add_case thm thy =
haftmann@34244
  1095
  let
haftmann@34244
  1096
    val (c, (k, case_pats)) = case_cert thm;
haftmann@34244
  1097
    val _ = case filter_out (is_constr thy) case_pats
haftmann@34244
  1098
     of [] => ()
haftmann@34244
  1099
      | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
haftmann@34244
  1100
    val entry = (1 + Int.max (1, length case_pats), (k, case_pats))
haftmann@34244
  1101
  in (map_exec_purge o map_cases o apfst) (Symtab.update (c, entry)) thy end;
haftmann@34244
  1102
haftmann@34244
  1103
fun add_undefined c thy =
haftmann@34244
  1104
  (map_exec_purge o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@34244
  1105
haftmann@34244
  1106
haftmann@35299
  1107
(* types *)
haftmann@34244
  1108
haftmann@35299
  1109
fun register_type (tyco, vs_spec) thy =
haftmann@34244
  1110
  let
haftmann@35226
  1111
    val (old_constrs, some_old_proj) =
haftmann@35299
  1112
      case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
haftmann@35226
  1113
       of (_, (_, Constructors cos)) :: _ => (map fst cos, NONE)
haftmann@35226
  1114
        | (_, (_, Abstractor (_, (co, _)))) :: _ => ([], SOME co)
haftmann@35226
  1115
        | [] => ([], NONE)
haftmann@35226
  1116
    val outdated_funs = case some_old_proj
haftmann@35304
  1117
     of NONE => old_constrs
haftmann@35226
  1118
      | SOME old_proj => Symtab.fold
haftmann@35226
  1119
          (fn (c, ((_, spec), _)) => if member (op =) (the_list (associated_abstype spec)) tyco
haftmann@35226
  1120
            then insert (op =) c else I)
haftmann@35304
  1121
            ((the_functions o the_exec) thy) (old_proj :: old_constrs);
haftmann@34244
  1122
    fun drop_outdated_cases cases = fold Symtab.delete_safe
haftmann@34244
  1123
      (Symtab.fold (fn (c, (_, (_, cos))) =>
haftmann@35226
  1124
        if exists (member (op =) old_constrs) cos
haftmann@34244
  1125
          then insert (op =) c else I) cases []) cases;
haftmann@34244
  1126
  in
haftmann@34244
  1127
    thy
haftmann@35226
  1128
    |> fold del_eqns outdated_funs
haftmann@34244
  1129
    |> map_exec_purge
haftmann@35226
  1130
        ((map_typs o Symtab.map_default (tyco, [])) (cons (serial (), vs_spec))
haftmann@34244
  1131
        #> (map_cases o apfst) drop_outdated_cases)
haftmann@34244
  1132
  end;
haftmann@34244
  1133
haftmann@35299
  1134
fun unoverload_const_typ thy (c, ty) = (AxClass.unoverload_const thy (c, ty), ty);
haftmann@34244
  1135
haftmann@35299
  1136
structure Datatype_Interpretation =
haftmann@35299
  1137
  Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@35299
  1138
haftmann@35299
  1139
fun datatype_interpretation f = Datatype_Interpretation.interpretation
haftmann@35299
  1140
  (fn (tyco, _) => fn thy => f (tyco, get_type thy tyco) thy);
haftmann@35226
  1141
haftmann@35226
  1142
fun add_datatype proto_constrs thy =
haftmann@35226
  1143
  let
haftmann@35226
  1144
    val constrs = map (unoverload_const_typ thy) proto_constrs;
haftmann@35226
  1145
    val (tyco, (vs, cos)) = constrset_of_consts thy constrs;
haftmann@35226
  1146
  in
haftmann@35226
  1147
    thy
haftmann@35226
  1148
    |> fold (del_eqns o fst) constrs
haftmann@35299
  1149
    |> register_type (tyco, (vs, Constructors cos))
haftmann@35299
  1150
    |> Datatype_Interpretation.data (tyco, serial ())
haftmann@35226
  1151
  end;
haftmann@35226
  1152
haftmann@35226
  1153
fun add_datatype_cmd raw_constrs thy =
haftmann@35226
  1154
  add_datatype (map (read_bare_const thy) raw_constrs) thy;
haftmann@35226
  1155
haftmann@35299
  1156
structure Abstype_Interpretation =
haftmann@35299
  1157
  Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@35299
  1158
haftmann@35299
  1159
fun abstype_interpretation f = Abstype_Interpretation.interpretation
haftmann@35299
  1160
  (fn (tyco, _) => fn thy => f (tyco, get_abstype_spec thy tyco) thy);
haftmann@35299
  1161
haftmann@36112
  1162
fun add_abstype proto_thm thy =
haftmann@34244
  1163
  let
haftmann@36112
  1164
    val (tyco, (vs, (abs_ty as (abs, ty), (rep, cert)))) =
haftmann@36112
  1165
      check_abstype_cert thy proto_thm;
haftmann@35226
  1166
  in
haftmann@35226
  1167
    thy
haftmann@36112
  1168
    |> del_eqns abs
haftmann@36112
  1169
    |> register_type (tyco, (vs, Abstractor (abs_ty, (rep, cert))))
haftmann@36112
  1170
    |> change_fun_spec false rep ((K o Proj)
haftmann@36112
  1171
        (map_types Logic.varifyT_global (mk_proj tyco vs ty abs rep), tyco))
haftmann@36112
  1172
    |> Abstype_Interpretation.data (tyco, serial ())
haftmann@35226
  1173
  end;
haftmann@34244
  1174
haftmann@35226
  1175
haftmann@35226
  1176
(** infrastructure **)
haftmann@34244
  1177
haftmann@32070
  1178
(* c.f. src/HOL/Tools/recfun_codegen.ML *)
haftmann@32070
  1179
wenzelm@33522
  1180
structure Code_Target_Attr = Theory_Data
wenzelm@33522
  1181
(
haftmann@31998
  1182
  type T = (string -> thm -> theory -> theory) option;
haftmann@31998
  1183
  val empty = NONE;
haftmann@31998
  1184
  val extend = I;
wenzelm@33522
  1185
  fun merge (f1, f2) = if is_some f1 then f1 else f2;
haftmann@31998
  1186
);
haftmann@31998
  1187
haftmann@32070
  1188
fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
haftmann@32070
  1189
haftmann@32070
  1190
fun code_target_attr prefix thm thy =
haftmann@32070
  1191
  let
haftmann@32070
  1192
    val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
haftmann@32070
  1193
  in thy |> add_warning_eqn thm |> attr prefix thm end;
haftmann@35226
  1194
haftmann@35226
  1195
haftmann@32070
  1196
(* setup *)
haftmann@31998
  1197
haftmann@31962
  1198
val _ = Context.>> (Context.map_theory
haftmann@31962
  1199
  (let
haftmann@31962
  1200
    fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@31998
  1201
    val code_attribute_parser =
haftmann@31998
  1202
      Args.del |-- Scan.succeed (mk_attribute del_eqn)
haftmann@31998
  1203
      || Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
haftmann@36112
  1204
      || Args.$$$ "abstype" |-- Scan.succeed (mk_attribute add_abstype)
haftmann@35226
  1205
      || Args.$$$ "abstract" |-- Scan.succeed (mk_attribute add_abs_eqn)
haftmann@31998
  1206
      || (Args.$$$ "target" |-- Args.colon |-- Args.name >>
haftmann@32070
  1207
           (mk_attribute o code_target_attr))
haftmann@31998
  1208
      || Scan.succeed (mk_attribute add_warning_eqn);
haftmann@31962
  1209
  in
haftmann@35299
  1210
    Datatype_Interpretation.init
haftmann@31998
  1211
    #> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
haftmann@31998
  1212
        "declare theorems for code generation"
haftmann@31962
  1213
  end));
haftmann@31962
  1214
haftmann@24219
  1215
end; (*struct*)
haftmann@24219
  1216
haftmann@24219
  1217
haftmann@35226
  1218
(* type-safe interfaces for data dependent on executable code *)
haftmann@24219
  1219
haftmann@34173
  1220
functor Code_Data(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219
  1221
struct
haftmann@24219
  1222
haftmann@24219
  1223
type T = Data.T;
haftmann@24219
  1224
exception Data of T;
haftmann@24219
  1225
fun dest (Data x) = x
haftmann@24219
  1226
haftmann@34173
  1227
val kind = Code.declare_data (Data Data.empty);
haftmann@24219
  1228
haftmann@24219
  1229
val data_op = (kind, Data, dest);
haftmann@24219
  1230
haftmann@24219
  1231
val change = Code.change_data data_op;
haftmann@24219
  1232
fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219
  1233
haftmann@24219
  1234
end;
haftmann@24219
  1235
haftmann@28143
  1236
structure Code : CODE = struct open Code; end;