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