src/Pure/Isar/code.ML
author haftmann
Wed Jul 08 08:18:07 2009 +0200 (2009-07-08 ago)
changeset 31962 baa8dce5bc45
parent 31957 a9742afd403e
child 31971 8c1b845ed105
permissions -rw-r--r--
tuned structure Code internally
haftmann@24219
     1
(*  Title:      Pure/Isar/code.ML
haftmann@24219
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24219
     3
haftmann@31962
     4
Abstract executable code of theory.  Management of data dependent on
haftmann@31962
     5
executable code.  Cache assumes non-concurrent processing of a single theory.
haftmann@24219
     6
*)
haftmann@24219
     7
haftmann@24219
     8
signature CODE =
haftmann@24219
     9
sig
haftmann@31957
    10
  (*constants*)
haftmann@31957
    11
  val check_const: theory -> term -> string
haftmann@31957
    12
  val read_bare_const: theory -> string -> string * typ
haftmann@31957
    13
  val read_const: theory -> string -> string
haftmann@31962
    14
  val string_of_const: theory -> string -> string
haftmann@31962
    15
  val args_number: theory -> string -> int
haftmann@31957
    16
  val typscheme: theory -> string * typ -> (string * sort) list * typ
haftmann@31957
    17
haftmann@31156
    18
  (*constructor sets*)
haftmann@31156
    19
  val constrset_of_consts: theory -> (string * typ) list
haftmann@31156
    20
    -> string * ((string * sort) list * (string * typ list) list)
haftmann@31156
    21
haftmann@31156
    22
  (*constant aliasses*)
haftmann@31156
    23
  val add_const_alias: thm -> theory -> theory
haftmann@31156
    24
  val triv_classes: theory -> class list
haftmann@31156
    25
  val resubst_alias: theory -> string -> string
haftmann@31156
    26
haftmann@31156
    27
  (*code equations*)
haftmann@31962
    28
  val mk_eqn: theory -> thm * bool -> thm * bool
haftmann@31962
    29
  val mk_eqn_warning: theory -> thm -> (thm * bool) option
haftmann@31962
    30
  val mk_eqn_liberal: theory -> thm -> (thm * bool) option
haftmann@31156
    31
  val assert_eqn: theory -> thm * bool -> thm * bool
haftmann@31156
    32
  val assert_eqns_const: theory -> string
haftmann@31156
    33
    -> (thm * bool) list -> (thm * bool) list
haftmann@31957
    34
  val const_typ_eqn: theory -> thm -> string * typ
haftmann@31156
    35
  val typscheme_eqn: theory -> thm -> (string * sort) list * typ
haftmann@31156
    36
  val expand_eta: theory -> int -> thm -> thm
haftmann@31156
    37
  val norm_args: theory -> thm list -> thm list 
haftmann@31156
    38
  val norm_varnames: theory -> thm list -> thm 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@31156
    43
  val type_interpretation:
haftmann@31156
    44
    (string * ((string * sort) list * (string * typ list) list)
haftmann@31156
    45
      -> theory -> theory) -> theory -> theory
haftmann@28368
    46
  val add_eqn: thm -> theory -> theory
haftmann@31957
    47
  val add_eqnl: string * (thm * bool) list lazy -> theory -> theory
haftmann@31088
    48
  val add_nbe_eqn: thm -> theory -> theory
haftmann@28368
    49
  val add_default_eqn: thm -> theory -> theory
haftmann@28703
    50
  val add_default_eqn_attribute: attribute
haftmann@28703
    51
  val add_default_eqn_attrib: Attrib.src
haftmann@28368
    52
  val del_eqn: thm -> theory -> theory
haftmann@28368
    53
  val del_eqns: string -> theory -> theory
haftmann@24844
    54
  val add_case: thm -> theory -> theory
haftmann@24844
    55
  val add_undefined: string -> theory -> theory
haftmann@24219
    56
  val get_datatype: theory -> string -> ((string * sort) list * (string * typ list) list)
haftmann@24423
    57
  val get_datatype_of_constr: theory -> string -> string option
haftmann@31156
    58
  val these_eqns: theory -> string -> (thm * bool) list
haftmann@31642
    59
  val all_eqns: theory -> (thm * bool) list
haftmann@30023
    60
  val get_case_scheme: theory -> string -> (int * (int * string list)) option
haftmann@31890
    61
  val undefineds: theory -> string list
haftmann@24219
    62
  val print_codesetup: theory -> unit
haftmann@31957
    63
haftmann@31957
    64
  (*infrastructure*)
haftmann@31957
    65
  val add_attribute: string * attribute parser -> theory -> theory
haftmann@31957
    66
  val purge_data: theory -> theory
haftmann@24219
    67
end;
haftmann@24219
    68
haftmann@24219
    69
signature CODE_DATA_ARGS =
haftmann@24219
    70
sig
haftmann@24219
    71
  type T
haftmann@24219
    72
  val empty: T
haftmann@27609
    73
  val purge: theory -> string list -> T -> T
haftmann@24219
    74
end;
haftmann@24219
    75
haftmann@24219
    76
signature CODE_DATA =
haftmann@24219
    77
sig
haftmann@24219
    78
  type T
haftmann@24219
    79
  val get: theory -> T
haftmann@24219
    80
  val change: theory -> (T -> T) -> T
haftmann@24219
    81
  val change_yield: theory -> (T -> 'a * T) -> 'a * T
haftmann@24219
    82
end;
haftmann@24219
    83
haftmann@24219
    84
signature PRIVATE_CODE =
haftmann@24219
    85
sig
haftmann@24219
    86
  include CODE
haftmann@27609
    87
  val declare_data: Object.T -> (theory -> string list -> Object.T -> Object.T)
haftmann@27609
    88
    -> serial
haftmann@24219
    89
  val get_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    90
    -> theory -> 'a
haftmann@24219
    91
  val change_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    92
    -> theory -> ('a -> 'a) -> 'a
haftmann@24219
    93
  val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    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
haftmann@31156
   104
fun string_of_typ thy = setmp show_sorts true (Syntax.string_of_typ_global thy);
haftmann@31962
   105
haftmann@31156
   106
fun string_of_const thy c = case AxClass.inst_of_param thy c
haftmann@31156
   107
 of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco)
haftmann@31156
   108
  | NONE => Sign.extern_const thy c;
haftmann@31156
   109
haftmann@31962
   110
haftmann@31962
   111
(* constants *)
haftmann@31156
   112
haftmann@31962
   113
fun check_bare_const thy t = case try dest_Const t
haftmann@31962
   114
 of SOME c_ty => c_ty
haftmann@31962
   115
  | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
haftmann@31156
   116
haftmann@31962
   117
fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy;
haftmann@31962
   118
haftmann@31962
   119
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
haftmann@31962
   120
haftmann@31962
   121
fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy;
haftmann@31156
   122
haftmann@31156
   123
fun typscheme thy (c, ty) =
haftmann@31156
   124
  let
haftmann@31156
   125
    val ty' = Logic.unvarifyT ty;
haftmann@31957
   126
  in (map dest_TFree (Sign.const_typargs thy (c, ty')), Type.strip_sorts ty') end;
haftmann@31156
   127
haftmann@31962
   128
haftmann@31962
   129
(* code equation transformations *)
haftmann@31962
   130
haftmann@31156
   131
fun expand_eta thy k thm =
haftmann@31156
   132
  let
haftmann@31156
   133
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@31156
   134
    val (head, args) = strip_comb lhs;
haftmann@31156
   135
    val l = if k = ~1
haftmann@31156
   136
      then (length o fst o strip_abs) rhs
haftmann@31156
   137
      else Int.max (0, k - length args);
haftmann@31156
   138
    val used = Name.make_context (map (fst o fst) (Term.add_vars lhs []));
haftmann@31156
   139
    fun get_name _ 0 = pair []
haftmann@31156
   140
      | get_name (Abs (v, ty, t)) k =
haftmann@31156
   141
          Name.variants [v]
haftmann@31156
   142
          ##>> get_name t (k - 1)
haftmann@31156
   143
          #>> (fn ([v'], vs') => (v', ty) :: vs')
haftmann@31156
   144
      | get_name t k = 
haftmann@31156
   145
          let
haftmann@31156
   146
            val (tys, _) = (strip_type o fastype_of) t
haftmann@31156
   147
          in case tys
haftmann@31156
   148
           of [] => raise TERM ("expand_eta", [t])
haftmann@31156
   149
            | ty :: _ =>
haftmann@31156
   150
                Name.variants [""]
haftmann@31156
   151
                #-> (fn [v] => get_name (t $ Var ((v, 0), ty)) (k - 1)
haftmann@31156
   152
                #>> (fn vs' => (v, ty) :: vs'))
haftmann@31156
   153
          end;
haftmann@31156
   154
    val (vs, _) = get_name rhs l used;
haftmann@31156
   155
    fun expand (v, ty) thm = Drule.fun_cong_rule thm
haftmann@31156
   156
      (Thm.cterm_of thy (Var ((v, 0), ty)));
haftmann@31156
   157
  in
haftmann@31156
   158
    thm
haftmann@31156
   159
    |> fold expand vs
haftmann@31156
   160
    |> Conv.fconv_rule Drule.beta_eta_conversion
haftmann@31156
   161
  end;
haftmann@31156
   162
haftmann@31156
   163
fun norm_args thy thms =
haftmann@31156
   164
  let
haftmann@31156
   165
    val num_args_of = length o snd o strip_comb o fst o Logic.dest_equals;
haftmann@31156
   166
    val k = fold (curry Int.max o num_args_of o Thm.prop_of) thms 0;
haftmann@31156
   167
  in
haftmann@31156
   168
    thms
haftmann@31156
   169
    |> map (expand_eta thy k)
haftmann@31156
   170
    |> map (Conv.fconv_rule Drule.beta_eta_conversion)
haftmann@31156
   171
  end;
haftmann@31156
   172
haftmann@31156
   173
fun canonical_tvars thy thm =
haftmann@31156
   174
  let
haftmann@31156
   175
    val ctyp = Thm.ctyp_of thy;
haftmann@31156
   176
    val purify_tvar = unprefix "'" #> Name.desymbolize false #> prefix "'";
haftmann@31156
   177
    fun tvars_subst_for thm = (fold_types o fold_atyps)
haftmann@31156
   178
      (fn TVar (v_i as (v, _), sort) => let
haftmann@31156
   179
            val v' = purify_tvar v
haftmann@31156
   180
          in if v = v' then I
haftmann@31156
   181
          else insert (op =) (v_i, (v', sort)) end
haftmann@31156
   182
        | _ => I) (prop_of thm) [];
haftmann@31156
   183
    fun mk_inst (v_i, (v', sort)) (maxidx, acc) =
haftmann@31156
   184
      let
haftmann@31156
   185
        val ty = TVar (v_i, sort)
haftmann@31156
   186
      in
haftmann@31156
   187
        (maxidx + 1, (ctyp ty, ctyp (TVar ((v', maxidx), sort))) :: acc)
haftmann@31156
   188
      end;
haftmann@31156
   189
    val maxidx = Thm.maxidx_of thm + 1;
haftmann@31156
   190
    val (_, inst) = fold mk_inst (tvars_subst_for thm) (maxidx + 1, []);
haftmann@31156
   191
  in Thm.instantiate (inst, []) thm end;
haftmann@31156
   192
haftmann@31156
   193
fun canonical_vars thy thm =
haftmann@31156
   194
  let
haftmann@31156
   195
    val cterm = Thm.cterm_of thy;
haftmann@31156
   196
    val purify_var = Name.desymbolize false;
haftmann@31156
   197
    fun vars_subst_for thm = fold_aterms
haftmann@31156
   198
      (fn Var (v_i as (v, _), ty) => let
haftmann@31156
   199
            val v' = purify_var v
haftmann@31156
   200
          in if v = v' then I
haftmann@31156
   201
          else insert (op =) (v_i, (v', ty)) end
haftmann@31156
   202
        | _ => I) (prop_of thm) [];
haftmann@31156
   203
    fun mk_inst (v_i as (v, i), (v', ty)) (maxidx, acc) =
haftmann@31156
   204
      let
haftmann@31156
   205
        val t = Var (v_i, ty)
haftmann@31156
   206
      in
haftmann@31156
   207
        (maxidx + 1, (cterm t, cterm (Var ((v', maxidx), ty))) :: acc)
haftmann@31156
   208
      end;
haftmann@31156
   209
    val maxidx = Thm.maxidx_of thm + 1;
haftmann@31156
   210
    val (_, inst) = fold mk_inst (vars_subst_for thm) (maxidx + 1, []);
haftmann@31156
   211
  in Thm.instantiate ([], inst) thm end;
haftmann@31156
   212
haftmann@31156
   213
fun canonical_absvars thm =
haftmann@31156
   214
  let
haftmann@31156
   215
    val t = Thm.plain_prop_of thm;
haftmann@31156
   216
    val purify_var = Name.desymbolize false;
haftmann@31156
   217
    val t' = Term.map_abs_vars purify_var t;
haftmann@31156
   218
  in Thm.rename_boundvars t t' thm end;
haftmann@31156
   219
haftmann@31156
   220
fun norm_varnames thy thms =
haftmann@31156
   221
  let
haftmann@31156
   222
    fun burrow_thms f [] = []
haftmann@31156
   223
      | burrow_thms f thms =
haftmann@31156
   224
          thms
haftmann@31156
   225
          |> Conjunction.intr_balanced
haftmann@31156
   226
          |> f
haftmann@31156
   227
          |> Conjunction.elim_balanced (length thms)
haftmann@31156
   228
  in
haftmann@31156
   229
    thms
haftmann@31156
   230
    |> map (canonical_vars thy)
haftmann@31156
   231
    |> map canonical_absvars
haftmann@31156
   232
    |> map Drule.zero_var_indexes
haftmann@31156
   233
    |> burrow_thms (canonical_tvars thy)
haftmann@31156
   234
    |> Drule.zero_var_indexes_list
haftmann@31156
   235
  end;
haftmann@31156
   236
haftmann@31156
   237
haftmann@31962
   238
(** code attributes **)
haftmann@31957
   239
haftmann@31962
   240
structure Code_Attr = TheoryDataFun (
haftmann@31962
   241
  type T = (string * attribute parser) list;
haftmann@31962
   242
  val empty = [];
haftmann@31156
   243
  val copy = I;
haftmann@31156
   244
  val extend = I;
haftmann@31962
   245
  fun merge _ = AList.merge (op = : string * string -> bool) (K true);
haftmann@31156
   246
);
haftmann@31156
   247
haftmann@31962
   248
fun add_attribute (attr as (name, _)) =
haftmann@31962
   249
  let
haftmann@31962
   250
    fun add_parser ("", parser) attrs = attrs |> rev |> AList.update (op =) ("", parser) |> rev
haftmann@31962
   251
      | add_parser (name, parser) attrs = (name, Args.$$$ name |-- parser) :: attrs;
haftmann@31962
   252
  in Code_Attr.map (fn attrs => if not (name = "") andalso AList.defined (op =) attrs name
haftmann@31962
   253
    then error ("Code attribute " ^ name ^ " already declared") else add_parser attr attrs)
haftmann@31962
   254
  end;
haftmann@31962
   255
haftmann@31962
   256
val _ = Context.>> (Context.map_theory
haftmann@31962
   257
  (Attrib.setup (Binding.name "code")
haftmann@31962
   258
    (Scan.peek (fn context =>
haftmann@31962
   259
      List.foldr op || Scan.fail (map snd (Code_Attr.get (Context.theory_of context)))))
haftmann@31962
   260
    "declare theorems for code generation"));
haftmann@31962
   261
haftmann@31962
   262
haftmann@31962
   263
(** data store **)
haftmann@31962
   264
haftmann@31962
   265
(* code equations *)
haftmann@31962
   266
haftmann@31962
   267
type eqns = bool * (thm * bool) list lazy;
haftmann@31962
   268
  (*default flag, theorems with proper flag (perhaps lazy)*)
haftmann@31962
   269
haftmann@31962
   270
fun pretty_lthms ctxt r = case Lazy.peek r
haftmann@31962
   271
 of SOME thms => map (ProofContext.pretty_thm ctxt o fst) (Exn.release thms)
haftmann@31962
   272
  | NONE => [Pretty.str "[...]"];
haftmann@31962
   273
haftmann@31962
   274
fun certificate thy f r =
haftmann@31962
   275
  case Lazy.peek r
haftmann@31962
   276
   of SOME thms => (Lazy.value o f thy) (Exn.release thms)
haftmann@31962
   277
    | NONE => let
haftmann@31962
   278
        val thy_ref = Theory.check_thy thy;
haftmann@31962
   279
      in Lazy.lazy (fn () => (f (Theory.deref thy_ref) o Lazy.force) r) end;
haftmann@31962
   280
haftmann@31962
   281
fun add_drop_redundant thy (thm, proper) thms =
haftmann@31962
   282
  let
haftmann@31962
   283
    val args_of = snd o strip_comb o map_types Type.strip_sorts
haftmann@31962
   284
      o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31962
   285
    val args = args_of thm;
haftmann@31962
   286
    val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
haftmann@31962
   287
    fun matches_args args' = length args <= length args' andalso
haftmann@31962
   288
      Pattern.matchess thy (args, (map incr_idx o curry Library.take (length args)) args');
haftmann@31962
   289
    fun drop (thm', proper') = if (proper orelse not proper')
haftmann@31962
   290
      andalso matches_args (args_of thm') then 
haftmann@31962
   291
        (warning ("Code generator: dropping redundant code equation\n" ^ Display.string_of_thm thm'); true)
haftmann@31962
   292
      else false;
haftmann@31962
   293
  in (thm, proper) :: filter_out drop thms end;
haftmann@31962
   294
haftmann@31962
   295
fun add_thm thy _ thm (false, thms) = (false, Lazy.map_force (add_drop_redundant thy thm) thms)
haftmann@31962
   296
  | add_thm thy true thm (true, thms) = (true, Lazy.map_force (fn thms => thms @ [thm]) thms)
haftmann@31962
   297
  | add_thm thy false thm (true, thms) = (false, Lazy.value [thm]);
haftmann@31962
   298
haftmann@31962
   299
fun add_lthms lthms _ = (false, lthms);
haftmann@31962
   300
haftmann@31962
   301
fun del_thm thm = (apsnd o Lazy.map_force) (remove (eq_fst Thm.eq_thm_prop) (thm, true));
haftmann@31962
   302
haftmann@31962
   303
haftmann@31962
   304
(* executable code data *)
haftmann@31962
   305
haftmann@31962
   306
datatype spec = Spec of {
haftmann@31962
   307
  history_concluded: bool,
haftmann@31962
   308
  aliasses: ((string * string) * thm) list * class list,
haftmann@31962
   309
  eqns: ((bool * eqns) * (serial * eqns) list) Symtab.table
haftmann@31962
   310
    (*with explicit history*),
haftmann@31962
   311
  dtyps: ((serial * ((string * sort) list * (string * typ list) list)) list) Symtab.table
haftmann@31962
   312
    (*with explicit history*),
haftmann@31962
   313
  cases: (int * (int * string list)) Symtab.table * unit Symtab.table
haftmann@31962
   314
};
haftmann@31962
   315
haftmann@31962
   316
fun make_spec ((history_concluded, aliasses), (eqns, (dtyps, cases))) =
haftmann@31962
   317
  Spec { history_concluded = history_concluded, aliasses = aliasses,
haftmann@31962
   318
    eqns = eqns, dtyps = dtyps, cases = cases };
haftmann@31962
   319
fun map_spec f (Spec { history_concluded = history_concluded, aliasses = aliasses, eqns = eqns,
haftmann@31962
   320
  dtyps = dtyps, cases = cases }) =
haftmann@31962
   321
  make_spec (f ((history_concluded, aliasses), (eqns, (dtyps, cases))));
haftmann@31962
   322
fun merge_spec (Spec { history_concluded = _, aliasses = aliasses1, eqns = eqns1,
haftmann@31962
   323
    dtyps = dtyps1, cases = (cases1, undefs1) },
haftmann@31962
   324
  Spec { history_concluded = _, aliasses = aliasses2, eqns = eqns2,
haftmann@31962
   325
    dtyps = dtyps2, cases = (cases2, undefs2) }) =
haftmann@31156
   326
  let
haftmann@31962
   327
    val aliasses = (Library.merge (eq_snd Thm.eq_thm_prop) (pairself fst (aliasses1, aliasses2)),
haftmann@31962
   328
      Library.merge (op =) (pairself snd (aliasses1, aliasses2)));
haftmann@31962
   329
    fun merge_eqns ((_, history1), (_, history2)) =
haftmann@31962
   330
      let
haftmann@31962
   331
        val raw_history = AList.merge (op = : serial * serial -> bool)
haftmann@31962
   332
          (K true) (history1, history2)
haftmann@31962
   333
        val filtered_history = filter_out (fst o snd) raw_history
haftmann@31962
   334
        val history = if null filtered_history
haftmann@31962
   335
          then raw_history else filtered_history;
haftmann@31962
   336
      in ((false, (snd o hd) history), history) end;
haftmann@31962
   337
    val eqns = Symtab.join (K merge_eqns) (eqns1, eqns2);
haftmann@31962
   338
    val dtyps = Symtab.join (K (AList.merge (op =) (K true))) (dtyps1, dtyps2);
haftmann@31962
   339
    val cases = (Symtab.merge (K true) (cases1, cases2),
haftmann@31962
   340
      Symtab.merge (K true) (undefs1, undefs2));
haftmann@31962
   341
  in make_spec ((false, aliasses), (eqns, (dtyps, cases))) end;
haftmann@31962
   342
haftmann@31962
   343
fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
haftmann@31962
   344
fun the_aliasses (Spec { aliasses, ... }) = aliasses;
haftmann@31962
   345
fun the_eqns (Spec { eqns, ... }) = eqns;
haftmann@31962
   346
fun the_dtyps (Spec { dtyps, ... }) = dtyps;
haftmann@31962
   347
fun the_cases (Spec { cases, ... }) = cases;
haftmann@31962
   348
val map_history_concluded = map_spec o apfst o apfst;
haftmann@31962
   349
val map_aliasses = map_spec o apfst o apsnd;
haftmann@31962
   350
val map_eqns = map_spec o apsnd o apfst;
haftmann@31962
   351
val map_dtyps = map_spec o apsnd o apsnd o apfst;
haftmann@31962
   352
val map_cases = map_spec o apsnd o apsnd o apsnd;
haftmann@31962
   353
haftmann@31962
   354
haftmann@31962
   355
(* data slots dependent on executable code *)
haftmann@31962
   356
haftmann@31962
   357
(*private copy avoids potential conflict of table exceptions*)
haftmann@31962
   358
structure Datatab = TableFun(type key = int val ord = int_ord);
haftmann@31962
   359
haftmann@31962
   360
local
haftmann@31962
   361
haftmann@31962
   362
type kind = {
haftmann@31962
   363
  empty: Object.T,
haftmann@31962
   364
  purge: theory -> string list -> Object.T -> Object.T
haftmann@31962
   365
};
haftmann@31962
   366
haftmann@31962
   367
val kinds = ref (Datatab.empty: kind Datatab.table);
haftmann@31962
   368
val kind_keys = ref ([]: serial list);
haftmann@31962
   369
haftmann@31962
   370
fun invoke f k = case Datatab.lookup (! kinds) k
haftmann@31962
   371
 of SOME kind => f kind
haftmann@31962
   372
  | NONE => sys_error "Invalid code data identifier";
haftmann@31962
   373
haftmann@31962
   374
in
haftmann@31962
   375
haftmann@31962
   376
fun declare_data empty purge =
haftmann@31962
   377
  let
haftmann@31962
   378
    val k = serial ();
haftmann@31962
   379
    val kind = {empty = empty, purge = purge};
haftmann@31962
   380
    val _ = change kinds (Datatab.update (k, kind));
haftmann@31962
   381
    val _ = change kind_keys (cons k);
haftmann@31962
   382
  in k end;
haftmann@31962
   383
haftmann@31962
   384
fun invoke_init k = invoke (fn kind => #empty kind) k;
haftmann@31962
   385
haftmann@31962
   386
fun invoke_purge_all thy cs =
haftmann@31962
   387
  fold (fn k => Datatab.map_entry k
haftmann@31962
   388
    (invoke (fn kind => #purge kind thy cs) k)) (! kind_keys);
haftmann@31962
   389
haftmann@31962
   390
end; (*local*)
haftmann@31962
   391
haftmann@31962
   392
haftmann@31962
   393
(* theory store *)
haftmann@31962
   394
haftmann@31962
   395
local
haftmann@31962
   396
haftmann@31962
   397
type data = Object.T Datatab.table;
haftmann@31962
   398
val empty_data = Datatab.empty : data;
haftmann@31962
   399
haftmann@31962
   400
structure Code_Data = TheoryDataFun
haftmann@31962
   401
(
haftmann@31962
   402
  type T = spec * data ref;
haftmann@31962
   403
  val empty = (make_spec ((false, ([], [])),
haftmann@31962
   404
    (Symtab.empty, (Symtab.empty, (Symtab.empty, Symtab.empty)))), ref empty_data);
haftmann@31962
   405
  fun copy (spec, data) = (spec, ref (! data));
haftmann@31962
   406
  val extend = copy;
haftmann@31962
   407
  fun merge pp ((spec1, data1), (spec2, data2)) =
haftmann@31962
   408
    (merge_spec (spec1, spec2), ref empty_data);
haftmann@31962
   409
);
haftmann@31962
   410
haftmann@31962
   411
fun thy_data f thy = f ((snd o Code_Data.get) thy);
haftmann@31962
   412
haftmann@31962
   413
fun get_ensure_init kind data_ref =
haftmann@31962
   414
  case Datatab.lookup (! data_ref) kind
haftmann@31962
   415
   of SOME x => x
haftmann@31962
   416
    | NONE => let val y = invoke_init kind
haftmann@31962
   417
        in (change data_ref (Datatab.update (kind, y)); y) end;
haftmann@31962
   418
haftmann@31962
   419
in
haftmann@31962
   420
haftmann@31962
   421
(* access to executable code *)
haftmann@31962
   422
haftmann@31962
   423
val the_exec = fst o Code_Data.get;
haftmann@31962
   424
haftmann@31962
   425
fun complete_class_params thy cs =
haftmann@31962
   426
  fold (fn c => case AxClass.inst_of_param thy c
haftmann@31962
   427
   of NONE => insert (op =) c
haftmann@31962
   428
    | SOME (c', _) => insert (op =) c' #> insert (op =) c) cs [];
haftmann@31962
   429
haftmann@31962
   430
fun map_exec_purge touched f thy =
haftmann@31962
   431
  Code_Data.map (fn (exec, data) => (f exec, ref (case touched
haftmann@31962
   432
   of SOME cs => invoke_purge_all thy (complete_class_params thy cs) (! data)
haftmann@31962
   433
    | NONE => empty_data))) thy;
haftmann@31962
   434
haftmann@31962
   435
val purge_data = (Code_Data.map o apsnd) (K (ref empty_data));
haftmann@31962
   436
haftmann@31962
   437
fun change_eqns delete c f = (map_exec_purge (SOME [c]) o map_eqns
haftmann@31962
   438
  o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, (true, Lazy.value [])), [])))
haftmann@31962
   439
    o apfst) (fn (_, eqns) => (true, f eqns));
haftmann@31962
   440
haftmann@31962
   441
fun del_eqns c = change_eqns true c (K (false, Lazy.value []));
haftmann@31962
   442
haftmann@31962
   443
haftmann@31962
   444
(* tackling equation history *)
haftmann@31962
   445
haftmann@31962
   446
fun get_eqns thy c =
haftmann@31962
   447
  Symtab.lookup ((the_eqns o the_exec) thy) c
haftmann@31962
   448
  |> Option.map (Lazy.force o snd o snd o fst)
haftmann@31962
   449
  |> these;
haftmann@31962
   450
haftmann@31962
   451
fun continue_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   452
  then thy
haftmann@31962
   453
    |> (Code_Data.map o apfst o map_history_concluded) (K false)
haftmann@31962
   454
    |> SOME
haftmann@31962
   455
  else NONE;
haftmann@31962
   456
haftmann@31962
   457
fun conclude_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   458
  then NONE
haftmann@31962
   459
  else thy
haftmann@31962
   460
    |> (Code_Data.map o apfst)
haftmann@31962
   461
        ((map_eqns o Symtab.map) (fn ((changed, current), history) =>
haftmann@31962
   462
          ((false, current),
haftmann@31962
   463
            if changed then (serial (), current) :: history else history))
haftmann@31962
   464
        #> map_history_concluded (K true))
haftmann@31962
   465
    |> SOME;
haftmann@31962
   466
haftmann@31962
   467
val _ = Context.>> (Context.map_theory (Code_Data.init
haftmann@31962
   468
  #> Theory.at_begin continue_history
haftmann@31962
   469
  #> Theory.at_end conclude_history));
haftmann@31962
   470
haftmann@31962
   471
haftmann@31962
   472
(* access to data dependent on abstract executable code *)
haftmann@31962
   473
haftmann@31962
   474
fun get_data (kind, _, dest) = thy_data (get_ensure_init kind #> dest);
haftmann@31962
   475
haftmann@31962
   476
fun change_data (kind, mk, dest) =
haftmann@31962
   477
  let
haftmann@31962
   478
    fun chnge data_ref f =
haftmann@31962
   479
      let
haftmann@31962
   480
        val data = get_ensure_init kind data_ref;
haftmann@31962
   481
        val data' = f (dest data);
haftmann@31962
   482
      in (change data_ref (Datatab.update (kind, mk data')); data') end;
haftmann@31962
   483
  in thy_data chnge end;
haftmann@31962
   484
haftmann@31962
   485
fun change_yield_data (kind, mk, dest) =
haftmann@31962
   486
  let
haftmann@31962
   487
    fun chnge data_ref f =
haftmann@31962
   488
      let
haftmann@31962
   489
        val data = get_ensure_init kind data_ref;
haftmann@31962
   490
        val (x, data') = f (dest data);
haftmann@31962
   491
      in (x, (change data_ref (Datatab.update (kind, mk data')); data')) end;
haftmann@31962
   492
  in thy_data chnge end;
haftmann@31962
   493
haftmann@31962
   494
end; (*local*)
haftmann@31962
   495
haftmann@31962
   496
haftmann@31962
   497
(** retrieval interfaces **)
haftmann@31962
   498
haftmann@31962
   499
(* constant aliasses *)
haftmann@31156
   500
haftmann@31156
   501
fun resubst_alias thy =
haftmann@31156
   502
  let
haftmann@31962
   503
    val alias = (fst o the_aliasses o the_exec) thy;
haftmann@31156
   504
    val subst_inst_param = Option.map fst o AxClass.inst_of_param thy;
haftmann@31156
   505
    fun subst_alias c =
haftmann@31156
   506
      get_first (fn ((c', c''), _) => if c = c'' then SOME c' else NONE) alias;
haftmann@31156
   507
  in
haftmann@31156
   508
    perhaps subst_inst_param
haftmann@31156
   509
    #> perhaps subst_alias
haftmann@31156
   510
  end;
haftmann@31156
   511
haftmann@31962
   512
val triv_classes = snd o the_aliasses o the_exec;
haftmann@31156
   513
haftmann@31156
   514
haftmann@31962
   515
(** foundation **)
haftmann@31962
   516
haftmann@31962
   517
(* constants *)
haftmann@31962
   518
haftmann@31962
   519
fun args_number thy = length o fst o strip_type o Sign.the_const_type thy;
haftmann@31962
   520
haftmann@31962
   521
haftmann@31962
   522
(* datatypes *)
haftmann@31156
   523
haftmann@31156
   524
fun constrset_of_consts thy cs =
haftmann@31156
   525
  let
haftmann@31156
   526
    val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
haftmann@31156
   527
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
haftmann@31156
   528
    fun no_constr (c, ty) = error ("Not a datatype constructor: " ^ string_of_const thy c
haftmann@31156
   529
      ^ " :: " ^ string_of_typ thy ty);
haftmann@31156
   530
    fun last_typ c_ty ty =
haftmann@31156
   531
      let
haftmann@31156
   532
        val frees = OldTerm.typ_tfrees ty;
haftmann@31156
   533
        val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty
haftmann@31156
   534
          handle TYPE _ => no_constr c_ty
haftmann@31156
   535
        val _ = if has_duplicates (eq_fst (op =)) vs then no_constr c_ty else ();
haftmann@31156
   536
        val _ = if length frees <> length vs then no_constr c_ty else ();
haftmann@31156
   537
      in (tyco, vs) end;
haftmann@31156
   538
    fun ty_sorts (c, ty) =
haftmann@31156
   539
      let
haftmann@31156
   540
        val ty_decl = (Logic.unvarifyT o Sign.the_const_type thy) c;
haftmann@31156
   541
        val (tyco, _) = last_typ (c, ty) ty_decl;
haftmann@31156
   542
        val (_, vs) = last_typ (c, ty) ty;
haftmann@31156
   543
      in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
haftmann@31156
   544
    fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
haftmann@31156
   545
      let
haftmann@31156
   546
        val _ = if tyco' <> tyco
haftmann@31156
   547
          then error "Different type constructors in constructor set"
haftmann@31156
   548
          else ();
haftmann@31156
   549
        val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
haftmann@31156
   550
      in ((tyco, sorts), c :: cs) end;
haftmann@31156
   551
    fun inst vs' (c, (vs, ty)) =
haftmann@31156
   552
      let
haftmann@31156
   553
        val the_v = the o AList.lookup (op =) (vs ~~ vs');
haftmann@31156
   554
        val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty;
haftmann@31156
   555
      in (c, (fst o strip_type) ty') end;
haftmann@31156
   556
    val c' :: cs' = map ty_sorts cs;
haftmann@31156
   557
    val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
haftmann@31156
   558
    val vs = Name.names Name.context Name.aT sorts;
haftmann@31156
   559
    val cs''' = map (inst vs) cs'';
haftmann@31156
   560
  in (tyco, (vs, rev cs''')) end;
haftmann@31156
   561
haftmann@31962
   562
fun get_datatype thy tyco =
haftmann@31962
   563
  case these (Symtab.lookup ((the_dtyps o the_exec) thy) tyco)
haftmann@31962
   564
   of (_, spec) :: _ => spec
haftmann@31962
   565
    | [] => Sign.arity_number thy tyco
haftmann@31962
   566
        |> Name.invents Name.context Name.aT
haftmann@31962
   567
        |> map (rpair [])
haftmann@31962
   568
        |> rpair [];
haftmann@31962
   569
haftmann@31962
   570
fun get_datatype_of_constr thy c =
haftmann@31962
   571
  case (snd o strip_type o Sign.the_const_type thy) c
haftmann@31962
   572
   of Type (tyco, _) => if member (op =) ((map fst o snd o get_datatype thy) tyco) c
haftmann@31962
   573
       then SOME tyco else NONE
haftmann@31962
   574
    | _ => NONE;
haftmann@31962
   575
haftmann@31962
   576
fun is_constr thy = is_some o get_datatype_of_constr thy;
haftmann@31962
   577
haftmann@31156
   578
haftmann@31156
   579
(* code equations *)
haftmann@31156
   580
haftmann@31156
   581
exception BAD_THM of string;
haftmann@31156
   582
fun bad_thm msg = raise BAD_THM msg;
haftmann@31156
   583
fun error_thm f thm = f thm handle BAD_THM msg => error msg;
haftmann@31642
   584
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
haftmann@31156
   585
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
haftmann@31156
   586
haftmann@31156
   587
fun is_linear thm =
haftmann@31156
   588
  let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@31156
   589
  in not (has_duplicates (op =) ((fold o fold_aterms)
haftmann@31156
   590
    (fn Var (v, _) => cons v | _ => I) args [])) end;
haftmann@31156
   591
haftmann@31962
   592
fun gen_assert_eqn thy is_constr_pat (thm, proper) =
haftmann@31156
   593
  let
haftmann@31156
   594
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@31156
   595
      handle TERM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm thm)
haftmann@31156
   596
           | THM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm thm);
haftmann@31156
   597
    fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
haftmann@31156
   598
      | Free _ => bad_thm ("Illegal free variable in equation\n"
haftmann@31156
   599
          ^ Display.string_of_thm thm)
haftmann@31156
   600
      | _ => I) t [];
haftmann@31156
   601
    fun tvars_of t = fold_term_types (fn _ =>
haftmann@31156
   602
      fold_atyps (fn TVar (v, _) => insert (op =) v
haftmann@31156
   603
        | TFree _ => bad_thm 
haftmann@31156
   604
      ("Illegal free type variable in equation\n" ^ Display.string_of_thm thm))) t [];
haftmann@31156
   605
    val lhs_vs = vars_of lhs;
haftmann@31156
   606
    val rhs_vs = vars_of rhs;
haftmann@31156
   607
    val lhs_tvs = tvars_of lhs;
haftmann@31156
   608
    val rhs_tvs = tvars_of rhs;
haftmann@31156
   609
    val _ = if null (subtract (op =) lhs_vs rhs_vs)
haftmann@31156
   610
      then ()
haftmann@31156
   611
      else bad_thm ("Free variables on right hand side of equation\n"
haftmann@31156
   612
        ^ Display.string_of_thm thm);
haftmann@31156
   613
    val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
haftmann@31156
   614
      then ()
haftmann@31156
   615
      else bad_thm ("Free type variables on right hand side of equation\n"
haftmann@31156
   616
        ^ Display.string_of_thm thm)    val (head, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@31156
   617
    val (c, ty) = case head
haftmann@31156
   618
     of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
haftmann@31156
   619
      | _ => bad_thm ("Equation not headed by constant\n" ^ Display.string_of_thm thm);
haftmann@31156
   620
    fun check _ (Abs _) = bad_thm
haftmann@31156
   621
          ("Abstraction on left hand side of equation\n"
haftmann@31156
   622
            ^ Display.string_of_thm thm)
haftmann@31156
   623
      | check 0 (Var _) = ()
haftmann@31156
   624
      | check _ (Var _) = bad_thm
haftmann@31156
   625
          ("Variable with application on left hand side of equation\n"
haftmann@31156
   626
            ^ Display.string_of_thm thm)
haftmann@31156
   627
      | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
haftmann@31156
   628
      | check n (Const (c_ty as (c, ty))) = if n = (length o fst o strip_type) ty
haftmann@31156
   629
          then if not proper orelse is_constr_pat (AxClass.unoverload_const thy c_ty)
haftmann@31156
   630
            then ()
haftmann@31156
   631
            else bad_thm (quote c ^ " is not a constructor, on left hand side of equation\n"
haftmann@31156
   632
              ^ Display.string_of_thm thm)
haftmann@31156
   633
          else bad_thm
haftmann@31156
   634
            ("Partially applied constant " ^ quote c ^ " on left hand side of equation\n"
haftmann@31156
   635
               ^ Display.string_of_thm thm);
haftmann@31156
   636
    val _ = map (check 0) args;
haftmann@31156
   637
    val _ = if not proper orelse is_linear thm then ()
haftmann@31156
   638
      else bad_thm ("Duplicate variables on left hand side of equation\n"
haftmann@31156
   639
        ^ Display.string_of_thm thm);
haftmann@31156
   640
    val _ = if (is_none o AxClass.class_of_param thy) c
haftmann@31156
   641
      then ()
haftmann@31156
   642
      else bad_thm ("Polymorphic constant as head in equation\n"
haftmann@31156
   643
        ^ Display.string_of_thm thm)
haftmann@31962
   644
    val _ = if not (is_constr thy c)
haftmann@31156
   645
      then ()
haftmann@31156
   646
      else bad_thm ("Constructor as head in equation\n"
haftmann@31156
   647
        ^ Display.string_of_thm thm)
haftmann@31156
   648
    val ty_decl = Sign.the_const_type thy c;
haftmann@31156
   649
    val _ = if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty)
haftmann@31156
   650
      then () else bad_thm ("Type\n" ^ string_of_typ thy ty
haftmann@31156
   651
           ^ "\nof equation\n"
haftmann@31156
   652
           ^ Display.string_of_thm thm
haftmann@31156
   653
           ^ "\nis incompatible with declared function type\n"
haftmann@31156
   654
           ^ string_of_typ thy ty_decl)
haftmann@31156
   655
  in (thm, proper) end;
haftmann@31156
   656
haftmann@31962
   657
fun assert_eqn thy = error_thm (gen_assert_eqn thy (is_constr thy));
haftmann@31962
   658
haftmann@31962
   659
fun meta_rewrite thy = LocalDefs.meta_rewrite_rule (ProofContext.init thy);
haftmann@31156
   660
haftmann@31962
   661
fun mk_eqn thy = error_thm (gen_assert_eqn thy (K true)) o
haftmann@31962
   662
  apfst (meta_rewrite thy);
haftmann@31962
   663
haftmann@31962
   664
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962
   665
  o warning_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31962
   666
haftmann@31962
   667
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962
   668
  o try_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31156
   669
haftmann@31156
   670
(*those following are permissive wrt. to overloaded constants!*)
haftmann@31156
   671
haftmann@31957
   672
fun const_typ_eqn thy thm =
haftmann@31156
   673
  let
haftmann@31957
   674
    val (c, ty) = (dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@31156
   675
    val c' = AxClass.unoverload_const thy (c, ty);
haftmann@31156
   676
  in (c', ty) end;
haftmann@31156
   677
haftmann@31957
   678
fun typscheme_eqn thy = typscheme thy o const_typ_eqn thy;
haftmann@31957
   679
fun const_eqn thy = fst o const_typ_eqn thy;
haftmann@31156
   680
haftmann@31962
   681
fun assert_eqns_const thy c eqns =
haftmann@31962
   682
  let
haftmann@31962
   683
    fun cert (eqn as (thm, _)) = if c = const_eqn thy thm
haftmann@31962
   684
      then eqn else error ("Wrong head of code equation,\nexpected constant "
haftmann@31962
   685
        ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm thm)
haftmann@31962
   686
  in map (cert o assert_eqn thy) eqns end;
haftmann@31156
   687
haftmann@31962
   688
fun common_typ_eqns thy [] = []
haftmann@31962
   689
  | common_typ_eqns thy [thm] = [thm]
haftmann@31962
   690
  | common_typ_eqns thy (thms as thm :: _) = (*FIXME is too general*)
haftmann@31962
   691
      let
haftmann@31962
   692
        fun incr_thm thm max =
haftmann@31962
   693
          let
haftmann@31962
   694
            val thm' = incr_indexes max thm;
haftmann@31962
   695
            val max' = Thm.maxidx_of thm' + 1;
haftmann@31962
   696
          in (thm', max') end;
haftmann@31962
   697
        val (thms', maxidx) = fold_map incr_thm thms 0;
haftmann@31962
   698
        val ty1 :: tys = map (snd o const_typ_eqn thy) thms';
haftmann@31962
   699
        fun unify ty env = Sign.typ_unify thy (ty1, ty) env
haftmann@31962
   700
          handle Type.TUNIFY =>
haftmann@31962
   701
            error ("Type unificaton failed, while unifying code equations\n"
haftmann@31962
   702
            ^ (cat_lines o map Display.string_of_thm) thms
haftmann@31962
   703
            ^ "\nwith types\n"
haftmann@31962
   704
            ^ (cat_lines o map (string_of_typ thy)) (ty1 :: tys));
haftmann@31962
   705
        val (env, _) = fold unify tys (Vartab.empty, maxidx)
haftmann@31962
   706
        val instT = Vartab.fold (fn (x_i, (sort, ty)) =>
haftmann@31962
   707
          cons (Thm.ctyp_of thy (TVar (x_i, sort)), Thm.ctyp_of thy ty)) env [];
haftmann@31962
   708
      in map (Thm.instantiate (instT, [])) thms' end;
haftmann@31962
   709
haftmann@31962
   710
fun these_eqns thy c =
haftmann@31962
   711
  get_eqns thy c
haftmann@31962
   712
  |> (map o apfst) (Thm.transfer thy)
haftmann@31962
   713
  |> burrow_fst (common_typ_eqns thy);
haftmann@31962
   714
haftmann@31962
   715
fun all_eqns thy =
haftmann@31962
   716
  Symtab.dest ((the_eqns o the_exec) thy)
haftmann@31962
   717
  |> maps (Lazy.force o snd o snd o fst o snd);
haftmann@31962
   718
haftmann@31962
   719
haftmann@31962
   720
(* cases *)
haftmann@31156
   721
haftmann@31156
   722
fun case_certificate thm =
haftmann@31156
   723
  let
haftmann@31156
   724
    val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
haftmann@31156
   725
      o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.prop_of) thm;
haftmann@31156
   726
    val _ = case head of Free _ => true
haftmann@31156
   727
      | Var _ => true
haftmann@31156
   728
      | _ => raise TERM ("case_cert", []);
haftmann@31156
   729
    val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
haftmann@31156
   730
    val (Const (case_const, _), raw_params) = strip_comb case_expr;
haftmann@31156
   731
    val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
haftmann@31156
   732
    val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
haftmann@31156
   733
    val params = map (fst o dest_Var) (nth_drop n raw_params);
haftmann@31156
   734
    fun dest_case t =
haftmann@31156
   735
      let
haftmann@31156
   736
        val (head' $ t_co, rhs) = Logic.dest_equals t;
haftmann@31156
   737
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   738
        val (Const (co, _), args) = strip_comb t_co;
haftmann@31156
   739
        val (Var (param, _), args') = strip_comb rhs;
haftmann@31156
   740
        val _ = if args' = args then () else raise TERM ("case_cert", []);
haftmann@31156
   741
      in (param, co) end;
haftmann@31156
   742
    fun analyze_cases cases =
haftmann@31156
   743
      let
haftmann@31156
   744
        val co_list = fold (AList.update (op =) o dest_case) cases [];
haftmann@31156
   745
      in map (the o AList.lookup (op =) co_list) params end;
haftmann@31156
   746
    fun analyze_let t =
haftmann@31156
   747
      let
haftmann@31156
   748
        val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
haftmann@31156
   749
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   750
        val _ = if arg' = arg then () else raise TERM ("case_cert", []);
haftmann@31156
   751
        val _ = if [param'] = params then () else raise TERM ("case_cert", []);
haftmann@31156
   752
      in [] end;
haftmann@31156
   753
    fun analyze (cases as [let_case]) =
haftmann@31156
   754
          (analyze_cases cases handle Bind => analyze_let let_case)
haftmann@31156
   755
      | analyze cases = analyze_cases cases;
haftmann@31156
   756
  in (case_const, (n, analyze cases)) end;
haftmann@31156
   757
haftmann@31156
   758
fun case_cert thm = case_certificate thm
haftmann@31156
   759
  handle Bind => error "bad case certificate"
haftmann@31156
   760
       | TERM _ => error "bad case certificate";
haftmann@31156
   761
haftmann@31962
   762
fun get_case_scheme thy = Symtab.lookup ((fst o the_cases o the_exec) thy);
haftmann@24219
   763
haftmann@31962
   764
val undefineds = Symtab.keys o snd o the_cases o the_exec;
haftmann@24219
   765
haftmann@24219
   766
haftmann@31962
   767
(* diagnostic *)
haftmann@24219
   768
haftmann@24219
   769
fun print_codesetup thy =
haftmann@24219
   770
  let
haftmann@24219
   771
    val ctxt = ProofContext.init thy;
haftmann@24844
   772
    val exec = the_exec thy;
haftmann@28368
   773
    fun pretty_eqn (s, (_, lthms)) =
haftmann@24219
   774
      (Pretty.block o Pretty.fbreaks) (
haftmann@28143
   775
        Pretty.str s :: pretty_lthms ctxt lthms
haftmann@24219
   776
      );
haftmann@24219
   777
    fun pretty_dtyp (s, []) =
haftmann@24219
   778
          Pretty.str s
haftmann@24219
   779
      | pretty_dtyp (s, cos) =
haftmann@24219
   780
          (Pretty.block o Pretty.breaks) (
haftmann@24219
   781
            Pretty.str s
haftmann@24219
   782
            :: Pretty.str "="
haftmann@31156
   783
            :: separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
haftmann@24219
   784
                 | (c, tys) =>
haftmann@24219
   785
                     (Pretty.block o Pretty.breaks)
haftmann@31156
   786
                        (Pretty.str (string_of_const thy c)
wenzelm@26947
   787
                          :: Pretty.str "of"
wenzelm@26947
   788
                          :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@24219
   789
          );
haftmann@28368
   790
    val eqns = the_eqns exec
haftmann@24423
   791
      |> Symtab.dest
haftmann@31156
   792
      |> (map o apfst) (string_of_const thy)
haftmann@28695
   793
      |> (map o apsnd) (snd o fst)
haftmann@24219
   794
      |> sort (string_ord o pairself fst);
haftmann@24219
   795
    val dtyps = the_dtyps exec
haftmann@24219
   796
      |> Symtab.dest
haftmann@28695
   797
      |> map (fn (dtco, (_, (vs, cos)) :: _) =>
haftmann@31957
   798
          (string_of_typ thy (Type (dtco, map TFree vs)), cos))
haftmann@24219
   799
      |> sort (string_ord o pairself fst)
haftmann@24219
   800
  in
haftmann@24219
   801
    (Pretty.writeln o Pretty.chunks) [
haftmann@24219
   802
      Pretty.block (
haftmann@30023
   803
        Pretty.str "code equations:"
haftmann@24219
   804
        :: Pretty.fbrk
haftmann@28368
   805
        :: (Pretty.fbreaks o map pretty_eqn) eqns
haftmann@24219
   806
      ),
haftmann@25968
   807
      Pretty.block (
haftmann@24219
   808
        Pretty.str "datatypes:"
haftmann@24219
   809
        :: Pretty.fbrk
haftmann@24219
   810
        :: (Pretty.fbreaks o map pretty_dtyp) dtyps
haftmann@24219
   811
      )
haftmann@24219
   812
    ]
haftmann@24219
   813
  end;
haftmann@24219
   814
haftmann@24219
   815
haftmann@31962
   816
(** declaring executable ingredients **)
haftmann@31962
   817
haftmann@31962
   818
(* constant aliasses *)
haftmann@24219
   819
haftmann@31962
   820
fun add_const_alias thm thy =
haftmann@31962
   821
  let
haftmann@31962
   822
    val (ofclass, eqn) = case try Logic.dest_equals (Thm.prop_of thm)
haftmann@31962
   823
     of SOME ofclass_eq => ofclass_eq
haftmann@31962
   824
      | _ => error ("Bad certificate: " ^ Display.string_of_thm thm);
haftmann@31962
   825
    val (T, class) = case try Logic.dest_of_class ofclass
haftmann@31962
   826
     of SOME T_class => T_class
haftmann@31962
   827
      | _ => error ("Bad certificate: " ^ Display.string_of_thm thm);
haftmann@31962
   828
    val tvar = case try Term.dest_TVar T
haftmann@31962
   829
     of SOME tvar => tvar
haftmann@31962
   830
      | _ => error ("Bad type: " ^ Display.string_of_thm thm);
haftmann@31962
   831
    val _ = if Term.add_tvars eqn [] = [tvar] then ()
haftmann@31962
   832
      else error ("Inconsistent type: " ^ Display.string_of_thm thm);
haftmann@31962
   833
    val lhs_rhs = case try Logic.dest_equals eqn
haftmann@31962
   834
     of SOME lhs_rhs => lhs_rhs
haftmann@31962
   835
      | _ => error ("Not an equation: " ^ Syntax.string_of_term_global thy eqn);
haftmann@31962
   836
    val c_c' = case try (pairself (check_const thy)) lhs_rhs
haftmann@31962
   837
     of SOME c_c' => c_c'
haftmann@31962
   838
      | _ => error ("Not an equation with two constants: "
haftmann@31962
   839
          ^ Syntax.string_of_term_global thy eqn);
haftmann@31962
   840
    val _ = if the_list (AxClass.class_of_param thy (snd c_c')) = [class] then ()
haftmann@31962
   841
      else error ("Inconsistent class: " ^ Display.string_of_thm thm);
haftmann@31962
   842
  in thy |>
haftmann@31962
   843
    (map_exec_purge NONE o map_aliasses) (fn (alias, classes) =>
haftmann@31962
   844
      ((c_c', thm) :: alias, insert (op =) class classes))
haftmann@31962
   845
  end;
haftmann@24219
   846
haftmann@24219
   847
haftmann@31962
   848
(* datatypes *)
haftmann@31090
   849
haftmann@31962
   850
structure Type_Interpretation = InterpretationFun(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@25462
   851
haftmann@24423
   852
fun add_datatype raw_cs thy =
haftmann@24219
   853
  let
haftmann@25597
   854
    val cs = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) raw_cs;
haftmann@31156
   855
    val (tyco, vs_cos) = constrset_of_consts thy cs;
haftmann@30076
   856
    val old_cs = (map fst o snd o get_datatype thy) tyco;
haftmann@30076
   857
    fun drop_outdated_cases cases = fold Symtab.delete_safe
haftmann@30076
   858
      (Symtab.fold (fn (c, (_, (_, cos))) =>
haftmann@30076
   859
        if exists (member (op =) old_cs) cos
haftmann@30076
   860
          then insert (op =) c else I) cases []) cases;
haftmann@24219
   861
  in
haftmann@24219
   862
    thy
haftmann@31091
   863
    |> fold (del_eqns o fst) cs
haftmann@28703
   864
    |> map_exec_purge NONE
haftmann@28695
   865
        ((map_dtyps o Symtab.map_default (tyco, [])) (cons (serial (), vs_cos))
haftmann@30076
   866
        #> (map_cases o apfst) drop_outdated_cases)
haftmann@31962
   867
    |> Type_Interpretation.data (tyco, serial ())
haftmann@24219
   868
  end;
haftmann@24219
   869
haftmann@31962
   870
fun type_interpretation f =  Type_Interpretation.interpretation
haftmann@25485
   871
  (fn (tyco, _) => fn thy => f (tyco, get_datatype thy tyco) thy);
haftmann@25485
   872
haftmann@24423
   873
fun add_datatype_cmd raw_cs thy =
haftmann@24423
   874
  let
haftmann@31156
   875
    val cs = map (read_bare_const thy) raw_cs;
haftmann@24423
   876
  in add_datatype cs thy end;
haftmann@24219
   877
haftmann@31962
   878
haftmann@31962
   879
(* code equations *)
haftmann@31962
   880
haftmann@31962
   881
fun gen_add_eqn default (eqn as (thm, _)) thy =
haftmann@31962
   882
  let val c = const_eqn thy thm
haftmann@31962
   883
  in change_eqns false c (add_thm thy default eqn) thy end;
haftmann@31962
   884
haftmann@31962
   885
fun add_eqn thm thy =
haftmann@31962
   886
  gen_add_eqn false (mk_eqn thy (thm, true)) thy;
haftmann@31962
   887
haftmann@31962
   888
fun add_warning_eqn thm thy =
haftmann@31962
   889
  case mk_eqn_warning thy thm
haftmann@31962
   890
   of SOME eqn => gen_add_eqn false eqn thy
haftmann@31962
   891
    | NONE => thy;
haftmann@31962
   892
haftmann@31962
   893
fun add_default_eqn thm thy =
haftmann@31962
   894
  case mk_eqn_liberal thy thm
haftmann@31962
   895
   of SOME eqn => gen_add_eqn true eqn thy
haftmann@31962
   896
    | NONE => thy;
haftmann@31962
   897
haftmann@31962
   898
fun add_nbe_eqn thm thy =
haftmann@31962
   899
  gen_add_eqn false (mk_eqn thy (thm, false)) thy;
haftmann@31962
   900
haftmann@31962
   901
fun add_eqnl (c, lthms) thy =
haftmann@31962
   902
  let
haftmann@31962
   903
    val lthms' = certificate thy (fn thy => assert_eqns_const thy c) lthms;
haftmann@31962
   904
  in change_eqns false c (add_lthms lthms') thy end;
haftmann@31962
   905
haftmann@31962
   906
val add_default_eqn_attribute = Thm.declaration_attribute
haftmann@31962
   907
  (fn thm => Context.mapping (add_default_eqn thm) I);
haftmann@31962
   908
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
haftmann@31962
   909
haftmann@31962
   910
fun del_eqn thm thy = case mk_eqn_liberal thy thm
haftmann@31962
   911
 of SOME (thm, _) => change_eqns true (const_eqn thy thm) (del_thm thm) thy
haftmann@31962
   912
  | NONE => thy;
haftmann@31962
   913
haftmann@31962
   914
val _ = Context.>> (Context.map_theory
haftmann@31962
   915
  (let
haftmann@31962
   916
    fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@31962
   917
    fun add_simple_attribute (name, f) =
haftmann@31962
   918
      add_attribute (name, Scan.succeed (mk_attribute f));
haftmann@31962
   919
    fun add_del_attribute (name, (add, del)) =
haftmann@31962
   920
      add_attribute (name, Args.del |-- Scan.succeed (mk_attribute del)
haftmann@31962
   921
        || Scan.succeed (mk_attribute add))
haftmann@31962
   922
  in
haftmann@31962
   923
    Type_Interpretation.init
haftmann@31962
   924
    #> add_del_attribute ("", (add_warning_eqn, del_eqn))
haftmann@31962
   925
    #> add_simple_attribute ("nbe", add_nbe_eqn)
haftmann@31962
   926
  end));
haftmann@31962
   927
haftmann@31962
   928
haftmann@31962
   929
(* cases *)
haftmann@31962
   930
haftmann@24844
   931
fun add_case thm thy =
haftmann@24844
   932
  let
haftmann@31156
   933
    val (c, (k, case_pats)) = case_cert thm;
haftmann@31088
   934
    val _ = case filter_out (is_constr thy) case_pats
haftmann@30076
   935
     of [] => ()
haftmann@30076
   936
      | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
haftmann@30076
   937
    val entry = (1 + Int.max (1, length case_pats), (k, case_pats))
haftmann@30076
   938
  in (map_exec_purge (SOME [c]) o map_cases o apfst) (Symtab.update (c, entry)) thy end;
haftmann@24844
   939
haftmann@24844
   940
fun add_undefined c thy =
haftmann@24844
   941
  (map_exec_purge (SOME [c]) o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@24844
   942
haftmann@24219
   943
end; (*struct*)
haftmann@24219
   944
haftmann@24219
   945
haftmann@31962
   946
(** type-safe interfaces for data depedent on executable code **)
haftmann@24219
   947
haftmann@31962
   948
functor Code_Data_Fun(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219
   949
struct
haftmann@24219
   950
haftmann@24219
   951
type T = Data.T;
haftmann@24219
   952
exception Data of T;
haftmann@24219
   953
fun dest (Data x) = x
haftmann@24219
   954
haftmann@24219
   955
val kind = Code.declare_data (Data Data.empty)
haftmann@27609
   956
  (fn thy => fn cs => fn Data x => Data (Data.purge thy cs x));
haftmann@24219
   957
haftmann@24219
   958
val data_op = (kind, Data, dest);
haftmann@24219
   959
haftmann@24219
   960
val get = Code.get_data data_op;
haftmann@24219
   961
val change = Code.change_data data_op;
haftmann@24219
   962
fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219
   963
haftmann@24219
   964
end;
haftmann@24219
   965
haftmann@28143
   966
structure Code : CODE = struct open Code; end;