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