src/Pure/Isar/code.ML
author haftmann
Mon Apr 19 15:31:56 2010 +0200 (2010-04-19 ago)
changeset 36209 566be5d48090
parent 36202 43ea1f28fc7c
child 36610 bafd82950e24
permissions -rw-r--r--
more appropriate representation of valid positions for abstractors; more accurate checking of abstype certificates
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@36209
    38
  val equations_of_cert: theory -> cert -> ((string * sort) list * typ)
haftmann@36209
    39
    * (((term * string option) list * (term * string option)) * (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@36209
   464
fun check_decl_ty thy (c, ty) =
haftmann@36209
   465
  let
haftmann@36209
   466
    val ty_decl = Sign.the_const_type thy c;
haftmann@36209
   467
  in if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty) then ()
haftmann@36209
   468
    else bad_thm ("Type\n" ^ string_of_typ thy ty
haftmann@36209
   469
      ^ "\nof constant " ^ quote c
haftmann@36209
   470
      ^ "\nis incompatible with declared type\n"
haftmann@36209
   471
      ^ string_of_typ thy ty_decl)
haftmann@36209
   472
  end; 
haftmann@36209
   473
haftmann@35226
   474
fun check_eqn thy { allow_nonlinear, allow_consts, allow_pats } thm (lhs, rhs) =
haftmann@31156
   475
  let
haftmann@34894
   476
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@31156
   477
    fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
haftmann@34894
   478
      | Free _ => bad "Illegal free variable in equation"
haftmann@31156
   479
      | _ => I) t [];
haftmann@31156
   480
    fun tvars_of t = fold_term_types (fn _ =>
haftmann@31156
   481
      fold_atyps (fn TVar (v, _) => insert (op =) v
haftmann@34894
   482
        | TFree _ => bad "Illegal free type variable in equation")) t [];
haftmann@31156
   483
    val lhs_vs = vars_of lhs;
haftmann@31156
   484
    val rhs_vs = vars_of rhs;
haftmann@31156
   485
    val lhs_tvs = tvars_of lhs;
haftmann@31156
   486
    val rhs_tvs = tvars_of rhs;
haftmann@31156
   487
    val _ = if null (subtract (op =) lhs_vs rhs_vs)
haftmann@31156
   488
      then ()
haftmann@34894
   489
      else bad "Free variables on right hand side of equation";
haftmann@31156
   490
    val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
haftmann@31156
   491
      then ()
haftmann@34894
   492
      else bad "Free type variables on right hand side of equation";
haftmann@34894
   493
    val (head, args) = strip_comb lhs;
haftmann@31156
   494
    val (c, ty) = case head
haftmann@31156
   495
     of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
haftmann@34894
   496
      | _ => bad "Equation not headed by constant";
haftmann@34894
   497
    fun check _ (Abs _) = bad "Abstraction on left hand side of equation"
haftmann@31156
   498
      | check 0 (Var _) = ()
haftmann@34894
   499
      | check _ (Var _) = bad "Variable with application on left hand side of equation"
haftmann@31156
   500
      | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
haftmann@34894
   501
      | check n (Const (c_ty as (c, ty))) =
haftmann@35226
   502
          if allow_pats then let
haftmann@33940
   503
            val c' = AxClass.unoverload_const thy c_ty
haftmann@33940
   504
          in if n = (length o fst o strip_type o subst_signature thy c') ty
haftmann@35226
   505
            then if allow_consts orelse is_constr thy c'
haftmann@33940
   506
              then ()
haftmann@34894
   507
              else bad (quote c ^ " is not a constructor, on left hand side of equation")
haftmann@34894
   508
            else bad ("Partially applied constant " ^ quote c ^ " on left hand side of equation")
haftmann@36209
   509
          end else bad ("Pattern not allowed here, but constant " ^ quote c ^ " encountered on left hand side")
haftmann@31156
   510
    val _ = map (check 0) args;
haftmann@35226
   511
    val _ = if allow_nonlinear orelse is_linear thm then ()
haftmann@34894
   512
      else bad "Duplicate variables on left hand side of equation";
haftmann@34894
   513
    val _ = if (is_none o AxClass.class_of_param thy) c then ()
haftmann@34894
   514
      else bad "Overloaded constant as head in equation";
haftmann@34894
   515
    val _ = if not (is_constr thy c) then ()
haftmann@34894
   516
      else bad "Constructor as head in equation";
haftmann@35226
   517
    val _ = if not (is_abstr thy c) then ()
haftmann@35226
   518
      else bad "Abstractor as head in equation";
haftmann@36209
   519
    val _ = check_decl_ty thy (c, ty);
haftmann@35226
   520
  in () end;
haftmann@35226
   521
haftmann@35226
   522
fun gen_assert_eqn thy check_patterns (thm, proper) =
haftmann@35226
   523
  let
haftmann@35226
   524
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@35226
   525
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@35226
   526
      handle TERM _ => bad "Not an equation"
haftmann@35226
   527
           | THM _ => bad "Not a proper equation";
haftmann@35226
   528
    val _ = check_eqn thy { allow_nonlinear = not proper,
haftmann@35226
   529
      allow_consts = not (proper andalso check_patterns), allow_pats = true } thm (lhs, rhs);
haftmann@31156
   530
  in (thm, proper) end;
haftmann@31156
   531
haftmann@35226
   532
fun assert_abs_eqn thy some_tyco thm =
haftmann@35226
   533
  let
haftmann@35226
   534
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@35226
   535
    val (full_lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@35226
   536
      handle TERM _ => bad "Not an equation"
haftmann@35226
   537
           | THM _ => bad "Not a proper equation";
haftmann@35226
   538
    val (rep, lhs) = dest_comb full_lhs
haftmann@35226
   539
      handle TERM _ => bad "Not an abstract equation";
haftmann@36202
   540
    val (rep_const, ty) = dest_Const rep;
haftmann@36202
   541
    val (tyco, sorts) = ((apsnd o map) (snd o dest_TVar) o dest_Type o domain_type) ty
haftmann@35226
   542
      handle TERM _ => bad "Not an abstract equation";
haftmann@35226
   543
    val _ = case some_tyco of SOME tyco' => if tyco = tyco' then ()
haftmann@35226
   544
          else bad ("Abstract type mismatch:" ^ quote tyco ^ " vs. " ^ quote tyco')
haftmann@35226
   545
      | NONE => ();
haftmann@36202
   546
    val (vs', (_, (rep', _))) = get_abstype_spec thy tyco;
haftmann@35226
   547
    val _ = if rep_const = rep' then ()
haftmann@35226
   548
      else bad ("Projection mismatch: " ^ quote rep_const ^ " vs. " ^ quote rep');
haftmann@35226
   549
    val _ = check_eqn thy { allow_nonlinear = false,
haftmann@35226
   550
      allow_consts = false, allow_pats = false } thm (lhs, rhs);
haftmann@36202
   551
    val _ = if forall (Sign.subsort thy) (sorts ~~ map snd  vs') then ()
haftmann@36202
   552
      else error ("Sort constraints on type arguments are weaker than in abstype certificate.")
haftmann@35226
   553
  in (thm, tyco) end;
haftmann@35226
   554
haftmann@34894
   555
fun assert_eqn thy = error_thm (gen_assert_eqn thy true);
haftmann@31962
   556
wenzelm@35624
   557
fun meta_rewrite thy = Local_Defs.meta_rewrite_rule (ProofContext.init thy);
haftmann@31156
   558
haftmann@34894
   559
fun mk_eqn thy = error_thm (gen_assert_eqn thy false) o
haftmann@31962
   560
  apfst (meta_rewrite thy);
haftmann@31962
   561
haftmann@31962
   562
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@34894
   563
  o warning_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
haftmann@31962
   564
haftmann@31962
   565
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@34894
   566
  o try_thm (gen_assert_eqn thy false) o rpair false o meta_rewrite thy;
haftmann@31156
   567
haftmann@35226
   568
fun mk_abs_eqn thy = error_thm (assert_abs_eqn thy NONE) o meta_rewrite thy;
haftmann@35226
   569
haftmann@33940
   570
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31156
   571
haftmann@31957
   572
fun const_typ_eqn thy thm =
haftmann@31156
   573
  let
haftmann@32640
   574
    val (c, ty) = head_eqn thm;
haftmann@31156
   575
    val c' = AxClass.unoverload_const thy (c, ty);
haftmann@33940
   576
      (*permissive wrt. to overloaded constants!*)
haftmann@31156
   577
  in (c', ty) end;
haftmann@33940
   578
haftmann@31957
   579
fun const_eqn thy = fst o const_typ_eqn thy;
haftmann@31156
   580
haftmann@35226
   581
fun const_abs_eqn thy = AxClass.unoverload_const thy o dest_Const o fst o strip_comb o snd
haftmann@35226
   582
  o dest_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@35226
   583
haftmann@34874
   584
fun logical_typscheme thy (c, ty) =
haftmann@32873
   585
  (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
haftmann@33940
   586
haftmann@34874
   587
fun typscheme thy (c, ty) = logical_typscheme thy (c, subst_signature thy c ty);
haftmann@33940
   588
haftmann@35226
   589
fun mk_proj tyco vs ty abs rep =
haftmann@35226
   590
  let
haftmann@35226
   591
    val ty_abs = Type (tyco, map TFree vs);
haftmann@35226
   592
    val xarg = Var (("x", 0), ty);
haftmann@35226
   593
  in Logic.mk_equals (Const (rep, ty_abs --> ty) $ (Const (abs, ty --> ty_abs) $ xarg), xarg) end;
haftmann@35226
   594
haftmann@34895
   595
haftmann@34895
   596
(* technical transformations of code equations *)
haftmann@34895
   597
haftmann@34895
   598
fun expand_eta thy k thm =
haftmann@34895
   599
  let
haftmann@34895
   600
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@34895
   601
    val (_, args) = strip_comb lhs;
haftmann@34895
   602
    val l = if k = ~1
haftmann@34895
   603
      then (length o fst o strip_abs) rhs
haftmann@34895
   604
      else Int.max (0, k - length args);
haftmann@34895
   605
    val (raw_vars, _) = Term.strip_abs_eta l rhs;
haftmann@34895
   606
    val vars = burrow_fst (Name.variant_list (map (fst o fst) (Term.add_vars lhs [])))
haftmann@34895
   607
      raw_vars;
haftmann@34895
   608
    fun expand (v, ty) thm = Drule.fun_cong_rule thm
haftmann@34895
   609
      (Thm.cterm_of thy (Var ((v, 0), ty)));
haftmann@34895
   610
  in
haftmann@34895
   611
    thm
haftmann@34895
   612
    |> fold expand vars
haftmann@34895
   613
    |> Conv.fconv_rule Drule.beta_eta_conversion
haftmann@34895
   614
  end;
haftmann@34895
   615
haftmann@34895
   616
fun same_arity thy thms =
haftmann@31962
   617
  let
haftmann@34895
   618
    val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals;
haftmann@34895
   619
    val k = fold (Integer.max o num_args_of o Thm.prop_of) thms 0;
haftmann@34895
   620
  in map (expand_eta thy k) thms end;
haftmann@34895
   621
haftmann@34895
   622
fun mk_desymbolization pre post mk vs =
haftmann@34895
   623
  let
haftmann@34895
   624
    val names = map (pre o fst o fst) vs
haftmann@34895
   625
      |> map (Name.desymbolize false)
haftmann@34895
   626
      |> Name.variant_list []
haftmann@34895
   627
      |> map post;
haftmann@34895
   628
  in map_filter (fn (((v, i), x), v') =>
haftmann@34895
   629
    if v = v' andalso i = 0 then NONE
haftmann@34895
   630
    else SOME (((v, i), x), mk ((v', 0), x))) (vs ~~ names)
haftmann@34895
   631
  end;
haftmann@34895
   632
haftmann@34895
   633
fun desymbolize_tvars thy thms =
haftmann@34895
   634
  let
haftmann@34895
   635
    val tvs = fold (Term.add_tvars o Thm.prop_of) thms [];
haftmann@34895
   636
    val tvar_subst = mk_desymbolization (unprefix "'") (prefix "'") TVar tvs;
haftmann@34895
   637
  in map (Thm.certify_instantiate (tvar_subst, [])) thms end;
haftmann@34895
   638
haftmann@34895
   639
fun desymbolize_vars thy thm =
haftmann@34895
   640
  let
haftmann@34895
   641
    val vs = Term.add_vars (Thm.prop_of thm) [];
haftmann@34895
   642
    val var_subst = mk_desymbolization I I Var vs;
haftmann@34895
   643
  in Thm.certify_instantiate ([], var_subst) thm end;
haftmann@34895
   644
haftmann@34895
   645
fun canonize_thms thy = desymbolize_tvars thy #> same_arity thy #> map (desymbolize_vars thy);
haftmann@31156
   646
haftmann@34874
   647
haftmann@36112
   648
(* abstype certificates *)
haftmann@36112
   649
haftmann@36112
   650
fun check_abstype_cert thy proto_thm =
haftmann@36112
   651
  let
haftmann@36209
   652
    val thm = (AxClass.unoverload thy o meta_rewrite thy) proto_thm;
haftmann@36112
   653
    fun bad s = bad_thm (s ^ ":\n" ^ Display.string_of_thm_global thy thm);
haftmann@36112
   654
    val (lhs, rhs) = Logic.dest_equals (Thm.plain_prop_of thm)
haftmann@36112
   655
      handle TERM _ => bad "Not an equation"
haftmann@36112
   656
           | THM _ => bad "Not a proper equation";
haftmann@36209
   657
    val ((abs, raw_ty), ((rep, rep_ty), param)) = (apsnd (apfst dest_Const o dest_comb)
haftmann@36112
   658
        o apfst dest_Const o dest_comb) lhs
haftmann@36112
   659
      handle TERM _ => bad "Not an abstype certificate";
haftmann@36209
   660
    val _ = pairself (fn c => if (is_some o AxClass.class_of_param thy) c
haftmann@36209
   661
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) (abs, rep);
haftmann@36209
   662
    val _ = check_decl_ty thy (abs, raw_ty);
haftmann@36209
   663
    val _ = check_decl_ty thy (rep, rep_ty);
haftmann@36112
   664
    val var = (fst o dest_Var) param
haftmann@36112
   665
      handle TERM _ => bad "Not an abstype certificate";
haftmann@36112
   666
    val _ = if param = rhs then () else bad "Not an abstype certificate";
haftmann@36112
   667
    val ((tyco, sorts), (abs, (vs, ty'))) = ty_sorts thy (abs, Logic.unvarifyT_global raw_ty);
haftmann@36112
   668
    val ty = domain_type ty';
haftmann@36112
   669
    val ty_abs = range_type ty';
haftmann@36112
   670
  in (tyco, (vs ~~ sorts, ((abs, ty), (rep, thm)))) end;
haftmann@36112
   671
haftmann@36112
   672
haftmann@34874
   673
(* code equation certificates *)
haftmann@34874
   674
haftmann@34895
   675
fun build_head thy (c, ty) =
haftmann@34895
   676
  Thm.cterm_of thy (Logic.mk_equals (Free ("HEAD", ty), Const (c, ty)));
haftmann@34874
   677
haftmann@34895
   678
fun get_head thy cert_thm =
haftmann@34895
   679
  let
haftmann@34895
   680
    val [head] = (#hyps o Thm.crep_thm) cert_thm;
haftmann@34895
   681
    val (_, Const (c, ty)) = (Logic.dest_equals o Thm.term_of) head;
haftmann@34895
   682
  in (typscheme thy (c, ty), head) end;
haftmann@34895
   683
haftmann@35226
   684
fun typscheme_projection thy =
haftmann@35226
   685
  typscheme thy o dest_Const o fst o dest_comb o fst o Logic.dest_equals;
haftmann@35226
   686
haftmann@35226
   687
fun typscheme_abs thy =
haftmann@35226
   688
  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
   689
haftmann@35226
   690
fun constrain_thm thy vs sorts thm =
haftmann@35226
   691
  let
haftmann@35226
   692
    val mapping = map2 (fn (v, sort) => fn sort' =>
haftmann@35226
   693
      (v, Sorts.inter_sort (Sign.classes_of thy) (sort, sort'))) vs sorts;
haftmann@35226
   694
    val inst = map2 (fn (v, sort) => fn (_, sort') =>
haftmann@35226
   695
      (((v, 0), sort), TFree (v, sort'))) vs mapping;
haftmann@35226
   696
    val subst = (map_types o map_atyps)
haftmann@35226
   697
      (fn TFree (v, _) => TFree (v, the (AList.lookup (op =) mapping v)));
haftmann@35226
   698
  in
haftmann@35226
   699
    thm
wenzelm@35845
   700
    |> Thm.varifyT_global
haftmann@35226
   701
    |> Thm.certify_instantiate (inst, [])
haftmann@35226
   702
    |> pair subst
haftmann@35226
   703
  end;
haftmann@35226
   704
haftmann@35226
   705
fun concretify_abs thy tyco abs_thm =
haftmann@35226
   706
  let
haftmann@35226
   707
    val (vs, ((c, _), (_, cert))) = get_abstype_spec thy tyco;
haftmann@35226
   708
    val lhs = (fst o Logic.dest_equals o Thm.prop_of) abs_thm
haftmann@35226
   709
    val ty = fastype_of lhs;
haftmann@35226
   710
    val ty_abs = (fastype_of o snd o dest_comb) lhs;
haftmann@35226
   711
    val abs = Thm.cterm_of thy (Const (c, ty --> ty_abs));
haftmann@35226
   712
    val raw_concrete_thm = Drule.transitive_thm OF [Thm.symmetric cert, Thm.combination (Thm.reflexive abs) abs_thm];
wenzelm@35845
   713
  in (c, (Thm.varifyT_global o zero_var_indexes) raw_concrete_thm) end;
haftmann@35226
   714
haftmann@35226
   715
fun add_rhss_of_eqn thy t =
haftmann@35226
   716
  let
haftmann@35226
   717
    val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy) t;
haftmann@35226
   718
    fun add_const (Const (c, ty)) = insert (op =) (c, Sign.const_typargs thy (c, ty))
haftmann@35226
   719
      | add_const _ = I
haftmann@35226
   720
  in fold_aterms add_const t end;
haftmann@35226
   721
wenzelm@35845
   722
fun dest_eqn thy =
wenzelm@35845
   723
  apfst (snd o strip_comb) o Logic.dest_equals o subst_signatures thy o Logic.unvarify_global;
haftmann@35226
   724
haftmann@35226
   725
abstype cert = Equations of thm * bool list
haftmann@35226
   726
  | Projection of term * string
haftmann@35226
   727
  | Abstract of thm * string
haftmann@35226
   728
with
haftmann@34891
   729
haftmann@34891
   730
fun empty_cert thy c = 
haftmann@34891
   731
  let
haftmann@34891
   732
    val raw_ty = const_typ thy c;
haftmann@34891
   733
    val tvars = Term.add_tvar_namesT raw_ty [];
haftmann@34891
   734
    val tvars' = case AxClass.class_of_param thy c
haftmann@34891
   735
     of SOME class => [TFree (Name.aT, [class])]
haftmann@34891
   736
      | NONE => Name.invent_list [] Name.aT (length tvars)
haftmann@34891
   737
          |> map (fn v => TFree (v, []));
haftmann@34891
   738
    val ty = typ_subst_TVars (tvars ~~ tvars') raw_ty;
haftmann@34895
   739
    val chead = build_head thy (c, ty);
haftmann@35226
   740
  in Equations (Thm.weaken chead Drule.dummy_thm, []) end;
haftmann@34891
   741
haftmann@34891
   742
fun cert_of_eqns thy c [] = empty_cert thy c
haftmann@34895
   743
  | cert_of_eqns thy c raw_eqns = 
haftmann@34874
   744
      let
haftmann@34895
   745
        val eqns = burrow_fst (canonize_thms thy) raw_eqns;
haftmann@34895
   746
        val _ = map (assert_eqn thy) eqns;
haftmann@34891
   747
        val (thms, propers) = split_list eqns;
haftmann@34895
   748
        val _ = map (fn thm => if c = const_eqn thy thm then ()
haftmann@34895
   749
          else error ("Wrong head of code equation,\nexpected constant "
haftmann@34895
   750
            ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)) thms;
haftmann@34891
   751
        fun tvars_of T = rev (Term.add_tvarsT T []);
haftmann@34891
   752
        val vss = map (tvars_of o snd o head_eqn) thms;
haftmann@34891
   753
        fun inter_sorts vs =
haftmann@34891
   754
          fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
haftmann@34891
   755
        val sorts = map_transpose inter_sorts vss;
haftmann@34891
   756
        val vts = Name.names Name.context Name.aT sorts;
haftmann@34891
   757
        val thms as thm :: _ =
haftmann@34891
   758
          map2 (fn vs => Thm.certify_instantiate (vs ~~ map TFree vts, [])) vss thms;
haftmann@34895
   759
        val head_thm = Thm.symmetric (Thm.assume (build_head thy (head_eqn (hd thms))));
haftmann@34874
   760
        fun head_conv ct = if can Thm.dest_comb ct
haftmann@34874
   761
          then Conv.fun_conv head_conv ct
haftmann@34874
   762
          else Conv.rewr_conv head_thm ct;
haftmann@34874
   763
        val rewrite_head = Conv.fconv_rule (Conv.arg1_conv head_conv);
haftmann@34891
   764
        val cert_thm = Conjunction.intr_balanced (map rewrite_head thms);
haftmann@35226
   765
      in Equations (cert_thm, propers) end;
haftmann@34891
   766
haftmann@35226
   767
fun cert_of_proj thy c tyco =
haftmann@35226
   768
  let
haftmann@35226
   769
    val (vs, ((abs, ty), (rep, cert))) = get_abstype_spec thy tyco;
haftmann@35226
   770
    val _ = if c = rep then () else
haftmann@35226
   771
      error ("Wrong head of projection,\nexpected constant " ^ string_of_const thy rep);
haftmann@35226
   772
  in Projection (mk_proj tyco vs ty abs rep, tyco) end;
haftmann@35226
   773
haftmann@35226
   774
fun cert_of_abs thy tyco c raw_abs_thm =
haftmann@34874
   775
  let
haftmann@35226
   776
    val abs_thm = singleton (canonize_thms thy) raw_abs_thm;
haftmann@35226
   777
    val _ = assert_abs_eqn thy (SOME tyco) abs_thm;
haftmann@35226
   778
    val _ = if c = const_abs_eqn thy abs_thm then ()
haftmann@35226
   779
      else error ("Wrong head of abstract code equation,\nexpected constant "
haftmann@35226
   780
        ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy abs_thm);
haftmann@35226
   781
  in Abstract (Thm.freezeT abs_thm, tyco) end;
haftmann@34874
   782
haftmann@35226
   783
fun constrain_cert thy sorts (Equations (cert_thm, propers)) =
haftmann@35226
   784
      let
haftmann@35226
   785
        val ((vs, _), head) = get_head thy cert_thm;
haftmann@35226
   786
        val (subst, cert_thm') = cert_thm
haftmann@35226
   787
          |> Thm.implies_intr head
haftmann@35226
   788
          |> constrain_thm thy vs sorts;
haftmann@35226
   789
        val head' = Thm.term_of head
haftmann@35226
   790
          |> subst
haftmann@35226
   791
          |> Thm.cterm_of thy;
haftmann@35226
   792
        val cert_thm'' = cert_thm'
haftmann@35226
   793
          |> Thm.elim_implies (Thm.assume head');
haftmann@35226
   794
      in Equations (cert_thm'', propers) end
haftmann@35226
   795
  | constrain_cert thy _ (cert as Projection _) =
haftmann@35226
   796
      cert
haftmann@35226
   797
  | constrain_cert thy sorts (Abstract (abs_thm, tyco)) =
haftmann@35226
   798
      Abstract (snd (constrain_thm thy (fst (typscheme_abs thy abs_thm)) sorts abs_thm), tyco);
haftmann@35226
   799
haftmann@35226
   800
fun typscheme_of_cert thy (Equations (cert_thm, _)) =
haftmann@35226
   801
      fst (get_head thy cert_thm)
haftmann@35226
   802
  | typscheme_of_cert thy (Projection (proj, _)) =
haftmann@35226
   803
      typscheme_projection thy proj
haftmann@35226
   804
  | typscheme_of_cert thy (Abstract (abs_thm, _)) =
haftmann@35226
   805
      typscheme_abs thy abs_thm;
haftmann@34874
   806
haftmann@35226
   807
fun typargs_deps_of_cert thy (Equations (cert_thm, propers)) =
haftmann@35226
   808
      let
haftmann@35226
   809
        val vs = (fst o fst) (get_head thy cert_thm);
haftmann@35226
   810
        val equations = if null propers then [] else
haftmann@35226
   811
          Thm.prop_of cert_thm
haftmann@35226
   812
          |> Logic.dest_conjunction_balanced (length propers);
haftmann@35226
   813
      in (vs, fold (add_rhss_of_eqn thy) equations []) end
haftmann@35226
   814
  | typargs_deps_of_cert thy (Projection (t, tyco)) =
haftmann@35226
   815
      (fst (typscheme_projection thy t), add_rhss_of_eqn thy t [])
haftmann@35226
   816
  | typargs_deps_of_cert thy (Abstract (abs_thm, tyco)) =
haftmann@35226
   817
      let
haftmann@35226
   818
        val vs = fst (typscheme_abs thy abs_thm);
haftmann@35226
   819
        val (_, concrete_thm) = concretify_abs thy tyco abs_thm;
haftmann@36202
   820
      in (vs, add_rhss_of_eqn thy (map_types Logic.unvarifyT_global (Thm.prop_of concrete_thm)) []) end;
haftmann@34895
   821
haftmann@35226
   822
fun equations_of_cert thy (cert as Equations (cert_thm, propers)) =
haftmann@35226
   823
      let
haftmann@35226
   824
        val tyscm = typscheme_of_cert thy cert;
haftmann@35226
   825
        val thms = if null propers then [] else
haftmann@35226
   826
          cert_thm
wenzelm@35624
   827
          |> Local_Defs.expand [snd (get_head thy cert_thm)]
wenzelm@35845
   828
          |> Thm.varifyT_global
haftmann@35226
   829
          |> Conjunction.elim_balanced (length propers);
haftmann@36209
   830
        fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, NONE));
haftmann@36209
   831
      in (tyscm, map (abstractions o dest_eqn thy o Thm.prop_of) thms ~~ (map SOME thms ~~ propers)) end
haftmann@35226
   832
  | equations_of_cert thy (Projection (t, tyco)) =
haftmann@35226
   833
      let
haftmann@35226
   834
        val (_, ((abs, _), _)) = get_abstype_spec thy tyco;
haftmann@35226
   835
        val tyscm = typscheme_projection thy t;
wenzelm@35845
   836
        val t' = map_types Logic.varifyT_global t;
haftmann@36209
   837
        fun abstractions (args, rhs) = (map (rpair (SOME abs)) args, (rhs, NONE));
haftmann@36209
   838
      in (tyscm, [((abstractions o dest_eqn thy) t', (NONE, true))]) end
haftmann@35226
   839
  | equations_of_cert thy (Abstract (abs_thm, tyco)) =
haftmann@35226
   840
      let
haftmann@35226
   841
        val tyscm = typscheme_abs thy abs_thm;
haftmann@35226
   842
        val (abs, concrete_thm) = concretify_abs thy tyco abs_thm;
haftmann@36209
   843
        fun abstractions (args, rhs) = (map (rpair NONE) args, (rhs, (SOME abs)));
wenzelm@35845
   844
      in
haftmann@36209
   845
        (tyscm, [((abstractions o dest_eqn thy o Thm.prop_of) concrete_thm,
haftmann@36209
   846
          (SOME (Thm.varifyT_global abs_thm), true))])
wenzelm@35845
   847
      end;
haftmann@34895
   848
haftmann@35226
   849
fun pretty_cert thy (cert as Equations _) =
haftmann@35226
   850
      (map_filter (Option.map (Display.pretty_thm_global thy o AxClass.overload thy) o fst o snd)
haftmann@35226
   851
         o snd o equations_of_cert thy) cert
haftmann@35226
   852
  | pretty_cert thy (Projection (t, _)) =
wenzelm@35845
   853
      [Syntax.pretty_term_global thy (map_types Logic.varifyT_global t)]
haftmann@35226
   854
  | pretty_cert thy (Abstract (abs_thm, tyco)) =
wenzelm@35845
   855
      [(Display.pretty_thm_global thy o AxClass.overload thy o Thm.varifyT_global) abs_thm];
haftmann@35226
   856
haftmann@35226
   857
fun bare_thms_of_cert thy (cert as Equations _) =
haftmann@35226
   858
      (map_filter (fn (_, (some_thm, proper)) => if proper then some_thm else NONE)
haftmann@35226
   859
        o snd o equations_of_cert thy) cert
haftmann@35376
   860
  | bare_thms_of_cert thy (Projection _) = []
haftmann@35376
   861
  | bare_thms_of_cert thy (Abstract (abs_thm, tyco)) =
wenzelm@35845
   862
      [Thm.varifyT_global (snd (concretify_abs thy tyco abs_thm))];
haftmann@34895
   863
haftmann@34895
   864
end;
haftmann@34891
   865
haftmann@34874
   866
haftmann@35226
   867
(* code certificate access *)
haftmann@35226
   868
haftmann@35226
   869
fun retrieve_raw thy c =
haftmann@35226
   870
  Symtab.lookup ((the_functions o the_exec) thy) c
haftmann@35226
   871
  |> Option.map (snd o fst)
haftmann@35226
   872
  |> the_default (Default [])
haftmann@34874
   873
haftmann@35226
   874
fun get_cert thy f c = case retrieve_raw thy c
haftmann@35226
   875
 of Default eqns => eqns
haftmann@35226
   876
      |> (map o apfst) (Thm.transfer thy)
haftmann@35226
   877
      |> f
haftmann@35226
   878
      |> (map o apfst) (AxClass.unoverload thy)
haftmann@35226
   879
      |> cert_of_eqns thy c
haftmann@35226
   880
  | Eqns eqns => eqns
haftmann@35226
   881
      |> (map o apfst) (Thm.transfer thy)
haftmann@35226
   882
      |> f
haftmann@35226
   883
      |> (map o apfst) (AxClass.unoverload thy)
haftmann@35226
   884
      |> cert_of_eqns thy c
haftmann@35226
   885
  | Proj (_, tyco) =>
haftmann@35226
   886
      cert_of_proj thy c tyco
haftmann@35226
   887
  | Abstr (abs_thm, tyco) => abs_thm
haftmann@35226
   888
      |> Thm.transfer thy
haftmann@35226
   889
      |> AxClass.unoverload thy
haftmann@35226
   890
      |> cert_of_abs thy tyco c;
haftmann@31962
   891
haftmann@31962
   892
haftmann@31962
   893
(* cases *)
haftmann@31156
   894
haftmann@31156
   895
fun case_certificate thm =
haftmann@31156
   896
  let
haftmann@31156
   897
    val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
haftmann@32640
   898
      o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
haftmann@31156
   899
    val _ = case head of Free _ => true
haftmann@31156
   900
      | Var _ => true
haftmann@31156
   901
      | _ => raise TERM ("case_cert", []);
haftmann@31156
   902
    val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
haftmann@31156
   903
    val (Const (case_const, _), raw_params) = strip_comb case_expr;
haftmann@31156
   904
    val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
haftmann@31156
   905
    val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
haftmann@31156
   906
    val params = map (fst o dest_Var) (nth_drop n raw_params);
haftmann@31156
   907
    fun dest_case t =
haftmann@31156
   908
      let
haftmann@31156
   909
        val (head' $ t_co, rhs) = Logic.dest_equals t;
haftmann@31156
   910
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   911
        val (Const (co, _), args) = strip_comb t_co;
haftmann@31156
   912
        val (Var (param, _), args') = strip_comb rhs;
haftmann@31156
   913
        val _ = if args' = args then () else raise TERM ("case_cert", []);
haftmann@31156
   914
      in (param, co) end;
haftmann@31156
   915
    fun analyze_cases cases =
haftmann@31156
   916
      let
haftmann@31156
   917
        val co_list = fold (AList.update (op =) o dest_case) cases [];
haftmann@31156
   918
      in map (the o AList.lookup (op =) co_list) params end;
haftmann@31156
   919
    fun analyze_let t =
haftmann@31156
   920
      let
haftmann@31156
   921
        val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
haftmann@31156
   922
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   923
        val _ = if arg' = arg then () else raise TERM ("case_cert", []);
haftmann@31156
   924
        val _ = if [param'] = params then () else raise TERM ("case_cert", []);
haftmann@31156
   925
      in [] end;
haftmann@31156
   926
    fun analyze (cases as [let_case]) =
haftmann@31156
   927
          (analyze_cases cases handle Bind => analyze_let let_case)
haftmann@31156
   928
      | analyze cases = analyze_cases cases;
haftmann@31156
   929
  in (case_const, (n, analyze cases)) end;
haftmann@31156
   930
haftmann@31156
   931
fun case_cert thm = case_certificate thm
haftmann@31156
   932
  handle Bind => error "bad case certificate"
haftmann@31156
   933
       | TERM _ => error "bad case certificate";
haftmann@31156
   934
haftmann@31962
   935
fun get_case_scheme thy = Symtab.lookup ((fst o the_cases o the_exec) thy);
haftmann@24219
   936
haftmann@31962
   937
val undefineds = Symtab.keys o snd o the_cases o the_exec;
haftmann@24219
   938
haftmann@24219
   939
haftmann@31962
   940
(* diagnostic *)
haftmann@24219
   941
haftmann@24219
   942
fun print_codesetup thy =
haftmann@24219
   943
  let
haftmann@24219
   944
    val ctxt = ProofContext.init thy;
haftmann@24844
   945
    val exec = the_exec thy;
haftmann@35226
   946
    fun pretty_equations const thms =
haftmann@24219
   947
      (Pretty.block o Pretty.fbreaks) (
haftmann@35226
   948
        Pretty.str (string_of_const thy const) :: map (Display.pretty_thm ctxt) thms
haftmann@24219
   949
      );
haftmann@35226
   950
    fun pretty_function (const, Default eqns) = pretty_equations const (map fst eqns)
haftmann@35226
   951
      | pretty_function (const, Eqns eqns) = pretty_equations const (map fst eqns)
haftmann@35226
   952
      | pretty_function (const, Proj (proj, _)) = Pretty.block
haftmann@35226
   953
          [Pretty.str (string_of_const thy const), Pretty.fbrk, Syntax.pretty_term ctxt proj]
haftmann@35226
   954
      | pretty_function (const, Abstr (thm, _)) = pretty_equations const [thm];
haftmann@35226
   955
    fun pretty_typ (tyco, vs) = Pretty.str
haftmann@35226
   956
      (string_of_typ thy (Type (tyco, map TFree vs)));
haftmann@35226
   957
    fun pretty_typspec (typ, (cos, abstract)) = if null cos
haftmann@35226
   958
      then pretty_typ typ
haftmann@35226
   959
      else (Pretty.block o Pretty.breaks) (
haftmann@35226
   960
        pretty_typ typ
haftmann@35226
   961
        :: Pretty.str "="
haftmann@35226
   962
        :: (if abstract then [Pretty.str "(abstract)"] else [])
haftmann@35226
   963
        @ separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
haftmann@35226
   964
             | (c, tys) =>
haftmann@35226
   965
                 (Pretty.block o Pretty.breaks)
haftmann@35226
   966
                    (Pretty.str (string_of_const thy c)
haftmann@35226
   967
                      :: Pretty.str "of"
haftmann@35226
   968
                      :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@35226
   969
      );
haftmann@34901
   970
    fun pretty_case (const, (_, (_, []))) = Pretty.str (string_of_const thy const)
haftmann@34901
   971
      | pretty_case (const, (_, (_, cos))) = (Pretty.block o Pretty.breaks) [
haftmann@34901
   972
          Pretty.str (string_of_const thy const), Pretty.str "with",
haftmann@34901
   973
          (Pretty.block o Pretty.commas o map (Pretty.str o string_of_const thy)) cos];
haftmann@35226
   974
    val functions = the_functions exec
haftmann@24423
   975
      |> Symtab.dest
haftmann@28695
   976
      |> (map o apsnd) (snd o fst)
haftmann@24219
   977
      |> sort (string_ord o pairself fst);
haftmann@35299
   978
    val datatypes = the_types exec
haftmann@24219
   979
      |> Symtab.dest
haftmann@35226
   980
      |> map (fn (tyco, (_, (vs, spec)) :: _) =>
haftmann@35226
   981
          ((tyco, vs), constructors_of spec))
haftmann@35226
   982
      |> sort (string_ord o pairself (fst o fst));
haftmann@34901
   983
    val cases = Symtab.dest ((fst o the_cases o the_exec) thy);
haftmann@34901
   984
    val undefineds = Symtab.keys ((snd o the_cases o the_exec) thy);
haftmann@24219
   985
  in
haftmann@24219
   986
    (Pretty.writeln o Pretty.chunks) [
haftmann@24219
   987
      Pretty.block (
haftmann@34901
   988
        Pretty.str "code equations:" :: Pretty.fbrk
haftmann@35226
   989
        :: (Pretty.fbreaks o map pretty_function) functions
haftmann@24219
   990
      ),
haftmann@25968
   991
      Pretty.block (
haftmann@34901
   992
        Pretty.str "datatypes:" :: Pretty.fbrk
haftmann@35226
   993
        :: (Pretty.fbreaks o map pretty_typspec) datatypes
haftmann@34901
   994
      ),
haftmann@34901
   995
      Pretty.block (
haftmann@34901
   996
        Pretty.str "cases:" :: Pretty.fbrk
haftmann@34901
   997
        :: (Pretty.fbreaks o map pretty_case) cases
haftmann@34901
   998
      ),
haftmann@34901
   999
      Pretty.block (
haftmann@34901
  1000
        Pretty.str "undefined:" :: Pretty.fbrk
haftmann@34901
  1001
        :: (Pretty.commas o map (Pretty.str o string_of_const thy)) undefineds
haftmann@24219
  1002
      )
haftmann@24219
  1003
    ]
haftmann@24219
  1004
  end;
haftmann@24219
  1005
haftmann@24219
  1006
haftmann@31962
  1007
(** declaring executable ingredients **)
haftmann@31962
  1008
haftmann@33940
  1009
(* constant signatures *)
haftmann@33940
  1010
haftmann@33940
  1011
fun add_type tyco thy =
haftmann@33940
  1012
  case Symtab.lookup ((snd o #types o Type.rep_tsig o Sign.tsig_of) thy) tyco
haftmann@33940
  1013
   of SOME (Type.Abbreviation (vs, _, _)) =>
haftmann@34173
  1014
          (map_exec_purge o map_signatures o apfst)
haftmann@33940
  1015
            (Symtab.update (tyco, length vs)) thy
haftmann@33940
  1016
    | _ => error ("No such type abbreviation: " ^ quote tyco);
haftmann@33940
  1017
haftmann@33940
  1018
fun add_type_cmd s thy = add_type (Sign.intern_type thy s) thy;
haftmann@33940
  1019
haftmann@33940
  1020
fun gen_add_signature prep_const prep_signature (raw_c, raw_ty) thy =
haftmann@33940
  1021
  let
haftmann@33940
  1022
    val c = prep_const thy raw_c;
haftmann@33940
  1023
    val ty = prep_signature thy raw_ty;
haftmann@33940
  1024
    val ty' = expand_signature thy ty;
haftmann@33940
  1025
    val ty'' = Sign.the_const_type thy c;
haftmann@33940
  1026
    val _ = if typ_equiv (ty', ty'') then () else
haftmann@33940
  1027
      error ("Illegal constant signature: " ^ Syntax.string_of_typ_global thy ty);
haftmann@33940
  1028
  in
haftmann@33940
  1029
    thy
haftmann@34173
  1030
    |> (map_exec_purge o map_signatures o apsnd) (Symtab.update (c, ty))
haftmann@33940
  1031
  end;
haftmann@33940
  1032
haftmann@33940
  1033
val add_signature = gen_add_signature (K I) cert_signature;
haftmann@33940
  1034
val add_signature_cmd = gen_add_signature read_const read_signature;
haftmann@33940
  1035
haftmann@33940
  1036
haftmann@31962
  1037
(* code equations *)
haftmann@31962
  1038
haftmann@35226
  1039
fun gen_add_eqn default (raw_thm, proper) thy =
haftmann@33075
  1040
  let
haftmann@35226
  1041
    val thm = Thm.close_derivation raw_thm;
haftmann@35226
  1042
    val c = const_eqn thy thm;
haftmann@35226
  1043
    fun add_eqn' true (Default eqns) = Default (eqns @ [(thm, proper)])
haftmann@35226
  1044
      | add_eqn' _ (Eqns eqns) =
haftmann@35226
  1045
          let
haftmann@35226
  1046
            val args_of = snd o strip_comb o map_types Type.strip_sorts
haftmann@35226
  1047
              o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@35226
  1048
            val args = args_of thm;
haftmann@35226
  1049
            val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
haftmann@35226
  1050
            fun matches_args args' = length args <= length args' andalso
haftmann@35226
  1051
              Pattern.matchess thy (args, (map incr_idx o take (length args)) args');
haftmann@35226
  1052
            fun drop (thm', proper') = if (proper orelse not proper')
haftmann@35226
  1053
              andalso matches_args (args_of thm') then 
haftmann@35226
  1054
                (warning ("Code generator: dropping redundant code equation\n" ^
haftmann@35226
  1055
                    Display.string_of_thm_global thy thm'); true)
haftmann@35226
  1056
              else false;
haftmann@35226
  1057
          in Eqns ((thm, proper) :: filter_out drop eqns) end
haftmann@35226
  1058
      | add_eqn' false _ = Eqns [(thm, proper)];
haftmann@35226
  1059
  in change_fun_spec false c (add_eqn' default) thy end;
haftmann@31962
  1060
haftmann@31962
  1061
fun add_eqn thm thy =
haftmann@31962
  1062
  gen_add_eqn false (mk_eqn thy (thm, true)) thy;
haftmann@31962
  1063
haftmann@31962
  1064
fun add_warning_eqn thm thy =
haftmann@31962
  1065
  case mk_eqn_warning thy thm
haftmann@31962
  1066
   of SOME eqn => gen_add_eqn false eqn thy
haftmann@31962
  1067
    | NONE => thy;
haftmann@31962
  1068
haftmann@31962
  1069
fun add_default_eqn thm thy =
haftmann@31962
  1070
  case mk_eqn_liberal thy thm
haftmann@31962
  1071
   of SOME eqn => gen_add_eqn true eqn thy
haftmann@31962
  1072
    | NONE => thy;
haftmann@31962
  1073
haftmann@31962
  1074
fun add_nbe_eqn thm thy =
haftmann@31962
  1075
  gen_add_eqn false (mk_eqn thy (thm, false)) thy;
haftmann@31962
  1076
haftmann@31962
  1077
val add_default_eqn_attribute = Thm.declaration_attribute
haftmann@31962
  1078
  (fn thm => Context.mapping (add_default_eqn thm) I);
haftmann@31962
  1079
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
haftmann@31962
  1080
haftmann@35226
  1081
fun add_abs_eqn raw_thm thy =
haftmann@35226
  1082
  let
haftmann@35226
  1083
    val (abs_thm, tyco) = (apfst Thm.close_derivation o mk_abs_eqn thy) raw_thm;
haftmann@35226
  1084
    val c = const_abs_eqn thy abs_thm;
haftmann@35226
  1085
  in change_fun_spec false c (K (Abstr (abs_thm, tyco))) thy end;
haftmann@35226
  1086
haftmann@31962
  1087
fun del_eqn thm thy = case mk_eqn_liberal thy thm
haftmann@35226
  1088
 of SOME (thm, _) => let
haftmann@35226
  1089
        fun del_eqn' (Default eqns) = empty_fun_spec
haftmann@35226
  1090
          | del_eqn' (Eqns eqns) =
haftmann@35226
  1091
              Eqns (filter_out (fn (thm', _) => Thm.eq_thm_prop (thm, thm')) eqns)
haftmann@35226
  1092
          | del_eqn' spec = spec
haftmann@35226
  1093
      in change_fun_spec true (const_eqn thy thm) del_eqn' thy end
haftmann@31962
  1094
  | NONE => thy;
haftmann@31962
  1095
haftmann@35226
  1096
fun del_eqns c = change_fun_spec true c (K empty_fun_spec);
haftmann@34244
  1097
haftmann@34244
  1098
haftmann@34244
  1099
(* cases *)
haftmann@34244
  1100
haftmann@34244
  1101
fun add_case thm thy =
haftmann@34244
  1102
  let
haftmann@34244
  1103
    val (c, (k, case_pats)) = case_cert thm;
haftmann@34244
  1104
    val _ = case filter_out (is_constr thy) case_pats
haftmann@34244
  1105
     of [] => ()
haftmann@34244
  1106
      | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
haftmann@34244
  1107
    val entry = (1 + Int.max (1, length case_pats), (k, case_pats))
haftmann@34244
  1108
  in (map_exec_purge o map_cases o apfst) (Symtab.update (c, entry)) thy end;
haftmann@34244
  1109
haftmann@34244
  1110
fun add_undefined c thy =
haftmann@34244
  1111
  (map_exec_purge o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@34244
  1112
haftmann@34244
  1113
haftmann@35299
  1114
(* types *)
haftmann@34244
  1115
haftmann@35299
  1116
fun register_type (tyco, vs_spec) thy =
haftmann@34244
  1117
  let
haftmann@35226
  1118
    val (old_constrs, some_old_proj) =
haftmann@35299
  1119
      case these (Symtab.lookup ((the_types o the_exec) thy) tyco)
haftmann@35226
  1120
       of (_, (_, Constructors cos)) :: _ => (map fst cos, NONE)
haftmann@36209
  1121
        | (_, (_, Abstractor ((co, _), (proj, _)))) :: _ => ([co], SOME proj)
haftmann@35226
  1122
        | [] => ([], NONE)
haftmann@35226
  1123
    val outdated_funs = case some_old_proj
haftmann@35304
  1124
     of NONE => old_constrs
haftmann@35226
  1125
      | SOME old_proj => Symtab.fold
haftmann@36209
  1126
          (fn (c, ((_, spec), _)) =>
haftmann@36209
  1127
            if member (op =) (the_list (associated_abstype spec)) tyco
haftmann@35226
  1128
            then insert (op =) c else I)
haftmann@35304
  1129
            ((the_functions o the_exec) thy) (old_proj :: old_constrs);
haftmann@34244
  1130
    fun drop_outdated_cases cases = fold Symtab.delete_safe
haftmann@34244
  1131
      (Symtab.fold (fn (c, (_, (_, cos))) =>
haftmann@35226
  1132
        if exists (member (op =) old_constrs) cos
haftmann@34244
  1133
          then insert (op =) c else I) cases []) cases;
haftmann@34244
  1134
  in
haftmann@34244
  1135
    thy
haftmann@35226
  1136
    |> fold del_eqns outdated_funs
haftmann@34244
  1137
    |> map_exec_purge
haftmann@35226
  1138
        ((map_typs o Symtab.map_default (tyco, [])) (cons (serial (), vs_spec))
haftmann@34244
  1139
        #> (map_cases o apfst) drop_outdated_cases)
haftmann@34244
  1140
  end;
haftmann@34244
  1141
haftmann@35299
  1142
fun unoverload_const_typ thy (c, ty) = (AxClass.unoverload_const thy (c, ty), ty);
haftmann@34244
  1143
haftmann@35299
  1144
structure Datatype_Interpretation =
haftmann@35299
  1145
  Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@35299
  1146
haftmann@35299
  1147
fun datatype_interpretation f = Datatype_Interpretation.interpretation
haftmann@35299
  1148
  (fn (tyco, _) => fn thy => f (tyco, get_type thy tyco) thy);
haftmann@35226
  1149
haftmann@35226
  1150
fun add_datatype proto_constrs thy =
haftmann@35226
  1151
  let
haftmann@35226
  1152
    val constrs = map (unoverload_const_typ thy) proto_constrs;
haftmann@35226
  1153
    val (tyco, (vs, cos)) = constrset_of_consts thy constrs;
haftmann@35226
  1154
  in
haftmann@35226
  1155
    thy
haftmann@35226
  1156
    |> fold (del_eqns o fst) constrs
haftmann@35299
  1157
    |> register_type (tyco, (vs, Constructors cos))
haftmann@35299
  1158
    |> Datatype_Interpretation.data (tyco, serial ())
haftmann@35226
  1159
  end;
haftmann@35226
  1160
haftmann@35226
  1161
fun add_datatype_cmd raw_constrs thy =
haftmann@35226
  1162
  add_datatype (map (read_bare_const thy) raw_constrs) thy;
haftmann@35226
  1163
haftmann@35299
  1164
structure Abstype_Interpretation =
haftmann@35299
  1165
  Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@35299
  1166
haftmann@35299
  1167
fun abstype_interpretation f = Abstype_Interpretation.interpretation
haftmann@35299
  1168
  (fn (tyco, _) => fn thy => f (tyco, get_abstype_spec thy tyco) thy);
haftmann@35299
  1169
haftmann@36112
  1170
fun add_abstype proto_thm thy =
haftmann@34244
  1171
  let
haftmann@36112
  1172
    val (tyco, (vs, (abs_ty as (abs, ty), (rep, cert)))) =
haftmann@36209
  1173
      error_thm (check_abstype_cert thy) proto_thm;
haftmann@35226
  1174
  in
haftmann@35226
  1175
    thy
haftmann@36112
  1176
    |> del_eqns abs
haftmann@36112
  1177
    |> register_type (tyco, (vs, Abstractor (abs_ty, (rep, cert))))
haftmann@36112
  1178
    |> change_fun_spec false rep ((K o Proj)
haftmann@36112
  1179
        (map_types Logic.varifyT_global (mk_proj tyco vs ty abs rep), tyco))
haftmann@36112
  1180
    |> Abstype_Interpretation.data (tyco, serial ())
haftmann@35226
  1181
  end;
haftmann@34244
  1182
haftmann@35226
  1183
haftmann@35226
  1184
(** infrastructure **)
haftmann@34244
  1185
haftmann@32070
  1186
(* c.f. src/HOL/Tools/recfun_codegen.ML *)
haftmann@32070
  1187
wenzelm@33522
  1188
structure Code_Target_Attr = Theory_Data
wenzelm@33522
  1189
(
haftmann@31998
  1190
  type T = (string -> thm -> theory -> theory) option;
haftmann@31998
  1191
  val empty = NONE;
haftmann@31998
  1192
  val extend = I;
wenzelm@33522
  1193
  fun merge (f1, f2) = if is_some f1 then f1 else f2;
haftmann@31998
  1194
);
haftmann@31998
  1195
haftmann@32070
  1196
fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
haftmann@32070
  1197
haftmann@32070
  1198
fun code_target_attr prefix thm thy =
haftmann@32070
  1199
  let
haftmann@32070
  1200
    val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
haftmann@32070
  1201
  in thy |> add_warning_eqn thm |> attr prefix thm end;
haftmann@35226
  1202
haftmann@35226
  1203
haftmann@32070
  1204
(* setup *)
haftmann@31998
  1205
haftmann@31962
  1206
val _ = Context.>> (Context.map_theory
haftmann@31962
  1207
  (let
haftmann@31962
  1208
    fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@31998
  1209
    val code_attribute_parser =
haftmann@31998
  1210
      Args.del |-- Scan.succeed (mk_attribute del_eqn)
haftmann@31998
  1211
      || Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
haftmann@36112
  1212
      || Args.$$$ "abstype" |-- Scan.succeed (mk_attribute add_abstype)
haftmann@35226
  1213
      || Args.$$$ "abstract" |-- Scan.succeed (mk_attribute add_abs_eqn)
haftmann@31998
  1214
      || (Args.$$$ "target" |-- Args.colon |-- Args.name >>
haftmann@32070
  1215
           (mk_attribute o code_target_attr))
haftmann@31998
  1216
      || Scan.succeed (mk_attribute add_warning_eqn);
haftmann@31962
  1217
  in
haftmann@35299
  1218
    Datatype_Interpretation.init
haftmann@31998
  1219
    #> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
haftmann@31998
  1220
        "declare theorems for code generation"
haftmann@31962
  1221
  end));
haftmann@31962
  1222
haftmann@24219
  1223
end; (*struct*)
haftmann@24219
  1224
haftmann@24219
  1225
haftmann@35226
  1226
(* type-safe interfaces for data dependent on executable code *)
haftmann@24219
  1227
haftmann@34173
  1228
functor Code_Data(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219
  1229
struct
haftmann@24219
  1230
haftmann@24219
  1231
type T = Data.T;
haftmann@24219
  1232
exception Data of T;
haftmann@24219
  1233
fun dest (Data x) = x
haftmann@24219
  1234
haftmann@34173
  1235
val kind = Code.declare_data (Data Data.empty);
haftmann@24219
  1236
haftmann@24219
  1237
val data_op = (kind, Data, dest);
haftmann@24219
  1238
haftmann@24219
  1239
val change = Code.change_data data_op;
haftmann@24219
  1240
fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219
  1241
haftmann@24219
  1242
end;
haftmann@24219
  1243
haftmann@28143
  1244
structure Code : CODE = struct open Code; end;