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