src/Pure/Isar/code.ML
author haftmann
Mon Jul 14 11:04:46 2008 +0200 (2008-07-14 ago)
changeset 27557 151731493264
parent 26970 bc28e7bcb765
child 27582 367aff8d7ffd
permissions -rw-r--r--
simpsets as pre/postprocessors; generic preprocessor now named function transformators
haftmann@24219
     1
(*  Title:      Pure/Isar/code.ML
haftmann@24219
     2
    ID:         $Id$
haftmann@24219
     3
    Author:     Florian Haftmann, TU Muenchen
haftmann@24219
     4
haftmann@24219
     5
Abstract executable content of theory.  Management of data dependent on
haftmann@25485
     6
executable content.  Cache assumes non-concurrent processing of a single theory.
haftmann@24219
     7
*)
haftmann@24219
     8
haftmann@24219
     9
signature CODE =
haftmann@24219
    10
sig
haftmann@24624
    11
  val add_func: thm -> theory -> theory
haftmann@24624
    12
  val add_liberal_func: thm -> theory -> theory
haftmann@24624
    13
  val add_default_func: thm -> theory -> theory
haftmann@24624
    14
  val add_default_func_attr: Attrib.src
haftmann@24219
    15
  val del_func: thm -> theory -> theory
haftmann@26021
    16
  val del_funcs: string -> theory -> theory
haftmann@24423
    17
  val add_funcl: string * thm list Susp.T -> theory -> theory
haftmann@27557
    18
  val map_pre: (MetaSimplifier.simpset -> MetaSimplifier.simpset) -> theory -> theory
haftmann@27557
    19
  val map_post: (MetaSimplifier.simpset -> MetaSimplifier.simpset) -> theory -> theory
haftmann@24219
    20
  val add_inline: thm -> theory -> theory
haftmann@24219
    21
  val del_inline: thm -> theory -> theory
haftmann@24219
    22
  val add_post: thm -> theory -> theory
haftmann@24219
    23
  val del_post: thm -> theory -> theory
haftmann@27557
    24
  val add_functrans: string * (theory -> thm list -> thm list) -> theory -> theory
haftmann@27557
    25
  val del_functrans: string -> theory -> theory
haftmann@24423
    26
  val add_datatype: (string * typ) list -> theory -> theory
haftmann@24423
    27
  val add_datatype_cmd: string list -> theory -> theory
haftmann@25485
    28
  val type_interpretation:
haftmann@25485
    29
    (string * ((string * sort) list * (string * typ list) list)
haftmann@25485
    30
      -> theory -> theory) -> theory -> theory
haftmann@24844
    31
  val add_case: thm -> theory -> theory
haftmann@24844
    32
  val add_undefined: string -> theory -> theory
haftmann@24219
    33
haftmann@24219
    34
  val coregular_algebra: theory -> Sorts.algebra
haftmann@24219
    35
  val operational_algebra: theory -> (sort -> sort) * Sorts.algebra
haftmann@24423
    36
  val these_funcs: theory -> string -> thm list
haftmann@24219
    37
  val get_datatype: theory -> string -> ((string * sort) list * (string * typ list) list)
haftmann@24423
    38
  val get_datatype_of_constr: theory -> string -> string option
haftmann@24844
    39
  val get_case_data: theory -> string -> (int * string list) option
haftmann@24844
    40
  val is_undefined: theory -> string -> bool
haftmann@26970
    41
  val default_typ: theory -> string -> (string * sort) list * typ
haftmann@24219
    42
haftmann@24219
    43
  val preprocess_conv: cterm -> thm
haftmann@24837
    44
  val preprocess_term: theory -> term -> term
haftmann@24219
    45
  val postprocess_conv: cterm -> thm
haftmann@24837
    46
  val postprocess_term: theory -> term -> term
haftmann@24219
    47
haftmann@24219
    48
  val add_attribute: string * (Args.T list -> attribute * Args.T list) -> theory -> theory
haftmann@24219
    49
haftmann@24219
    50
  val print_codesetup: theory -> unit
haftmann@24219
    51
end;
haftmann@24219
    52
haftmann@24219
    53
signature CODE_DATA_ARGS =
haftmann@24219
    54
sig
haftmann@24219
    55
  type T
haftmann@24219
    56
  val empty: T
haftmann@24219
    57
  val merge: Pretty.pp -> T * T -> T
haftmann@24423
    58
  val purge: theory option -> string list option -> T -> T
haftmann@24219
    59
end;
haftmann@24219
    60
haftmann@24219
    61
signature CODE_DATA =
haftmann@24219
    62
sig
haftmann@24219
    63
  type T
haftmann@24219
    64
  val get: theory -> T
haftmann@24219
    65
  val change: theory -> (T -> T) -> T
haftmann@24219
    66
  val change_yield: theory -> (T -> 'a * T) -> 'a * T
haftmann@24219
    67
end;
haftmann@24219
    68
haftmann@24219
    69
signature PRIVATE_CODE =
haftmann@24219
    70
sig
haftmann@24219
    71
  include CODE
haftmann@24219
    72
  val declare_data: Object.T -> (Pretty.pp -> Object.T * Object.T -> Object.T)
haftmann@24423
    73
    -> (theory option -> string list option -> Object.T -> Object.T) -> serial
haftmann@24219
    74
  val get_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    75
    -> theory -> 'a
haftmann@24219
    76
  val change_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    77
    -> theory -> ('a -> 'a) -> 'a
haftmann@24219
    78
  val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    79
    -> theory -> ('a -> 'b * 'a) -> 'b * 'a
haftmann@24219
    80
end;
haftmann@24219
    81
haftmann@24219
    82
structure Code : PRIVATE_CODE =
haftmann@24219
    83
struct
haftmann@24219
    84
haftmann@25312
    85
(** code attributes **)
haftmann@25312
    86
haftmann@25312
    87
structure CodeAttr = TheoryDataFun (
haftmann@25312
    88
  type T = (string * (Args.T list -> attribute * Args.T list)) list;
haftmann@25312
    89
  val empty = [];
haftmann@25312
    90
  val copy = I;
haftmann@25312
    91
  val extend = I;
haftmann@26970
    92
  fun merge _ = AList.merge (op = : string * string -> bool) (K true);
haftmann@25312
    93
);
haftmann@24219
    94
haftmann@25312
    95
fun add_attribute (attr as (name, _)) =
haftmann@25312
    96
  let
haftmann@25312
    97
    fun add_parser ("", parser) attrs = attrs @ [("", parser)]
haftmann@25312
    98
      | add_parser (name, parser) attrs = (name, Args.$$$ name |-- parser) :: attrs;
haftmann@25312
    99
    fun error "" = error ("Code attribute already declared")
haftmann@25312
   100
      | error name = error ("Code attribute " ^ name ^ " already declared")
haftmann@25312
   101
  in CodeAttr.map (fn attrs => if AList.defined (op =) attrs name
haftmann@25312
   102
    then error name else add_parser attr attrs)
haftmann@25312
   103
  end;
haftmann@25312
   104
haftmann@25312
   105
val _ =
haftmann@25312
   106
  let
haftmann@25312
   107
    val code_attr = Attrib.syntax (Scan.peek (fn context =>
haftmann@25312
   108
      List.foldr op || Scan.fail (map snd (CodeAttr.get (Context.theory_of context)))));
haftmann@25312
   109
  in
wenzelm@26463
   110
    Context.>> (Context.map_theory
wenzelm@26463
   111
      (Attrib.add_attributes
wenzelm@26463
   112
        [("code", code_attr, "declare theorems for code generation")]))
haftmann@25312
   113
  end;
haftmann@25312
   114
haftmann@25312
   115
haftmann@25312
   116
(** certificate theorems **)
haftmann@24219
   117
haftmann@24219
   118
fun string_of_lthms r = case Susp.peek r
wenzelm@26928
   119
 of SOME thms => (map Display.string_of_thm o rev) thms
haftmann@24219
   120
  | NONE => ["[...]"];
haftmann@24219
   121
haftmann@24219
   122
fun pretty_lthms ctxt r = case Susp.peek r
haftmann@24219
   123
 of SOME thms => map (ProofContext.pretty_thm ctxt) thms
haftmann@24219
   124
  | NONE => [Pretty.str "[...]"];
haftmann@24219
   125
haftmann@24219
   126
fun certificate thy f r =
haftmann@24219
   127
  case Susp.peek r
haftmann@24219
   128
   of SOME thms => (Susp.value o f thy) thms
haftmann@24844
   129
    | NONE => let
haftmann@24844
   130
        val thy_ref = Theory.check_thy thy;
haftmann@24844
   131
      in Susp.delay (fn () => (f (Theory.deref thy_ref) o Susp.force) r) end;
haftmann@24219
   132
haftmann@24219
   133
haftmann@25312
   134
(** logical and syntactical specification of executable code **)
haftmann@24219
   135
haftmann@24219
   136
(* pairs of (selected, deleted) defining equations *)
haftmann@24219
   137
haftmann@24219
   138
type sdthms = thm list Susp.T * thm list;
haftmann@24219
   139
haftmann@24219
   140
fun add_drop_redundant thm (sels, dels) =
haftmann@24219
   141
  let
haftmann@24219
   142
    val thy = Thm.theory_of_thm thm;
haftmann@24219
   143
    val args_of = snd o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@24219
   144
    val args = args_of thm;
haftmann@24219
   145
    fun matches [] _ = true
haftmann@24219
   146
      | matches (Var _ :: xs) [] = matches xs []
haftmann@24219
   147
      | matches (_ :: _) [] = false
haftmann@24219
   148
      | matches (x :: xs) (y :: ys) = Pattern.matches thy (x, y) andalso matches xs ys;
haftmann@24219
   149
    fun drop thm' = not (matches args (args_of thm'))
wenzelm@26947
   150
      orelse (warning ("Code generator: dropping redundant defining equation\n" ^ Display.string_of_thm thm'); false);
haftmann@24219
   151
    val (keeps, drops) = List.partition drop sels;
haftmann@24219
   152
  in (thm :: keeps, dels |> remove Thm.eq_thm_prop thm |> fold (insert Thm.eq_thm_prop) drops) end;
haftmann@24219
   153
haftmann@24219
   154
fun add_thm thm (sels, dels) =
haftmann@24219
   155
  apfst Susp.value (add_drop_redundant thm (Susp.force sels, dels));
haftmann@24219
   156
haftmann@24219
   157
fun add_lthms lthms (sels, []) =
haftmann@24219
   158
      (Susp.delay (fn () => fold add_drop_redundant
haftmann@24219
   159
        (Susp.force lthms) (Susp.force sels, []) |> fst), [])
haftmann@24219
   160
        (*FIXME*)
haftmann@24219
   161
  | add_lthms lthms (sels, dels) =
haftmann@24219
   162
      fold add_thm (Susp.force lthms) (sels, dels);
haftmann@24219
   163
haftmann@24219
   164
fun del_thm thm (sels, dels) =
haftmann@24219
   165
  (Susp.value (remove Thm.eq_thm_prop thm (Susp.force sels)), thm :: dels);
haftmann@24219
   166
haftmann@26021
   167
fun del_thms (sels, dels) =
haftmann@26021
   168
  let
haftmann@26021
   169
    val all_sels = Susp.force sels;
haftmann@26021
   170
  in (Susp.value [], rev all_sels @ dels) end;
haftmann@26021
   171
haftmann@24219
   172
fun pretty_sdthms ctxt (sels, _) = pretty_lthms ctxt sels;
haftmann@24219
   173
haftmann@25312
   174
haftmann@25312
   175
(* fundamental melting operations *)
haftmann@27557
   176
(*FIXME delete*)
haftmann@25312
   177
haftmann@25312
   178
fun melt _ ([], []) = (false, [])
haftmann@25312
   179
  | melt _ ([], ys) = (true, ys)
haftmann@25312
   180
  | melt eq (xs, ys) = fold_rev
haftmann@25312
   181
      (fn y => fn (t, xs) => (t orelse not (member eq xs y), insert eq y xs)) ys (false, xs);
haftmann@25312
   182
haftmann@25312
   183
fun melt_alist eq_key eq (xys as (xs, ys)) =
haftmann@25312
   184
  if eq_list (eq_pair eq_key eq) (xs, ys)
haftmann@25312
   185
  then (false, xs)
haftmann@25312
   186
  else (true, AList.merge eq_key eq xys);
haftmann@25312
   187
haftmann@25312
   188
val melt_thms = melt Thm.eq_thm_prop;
haftmann@25312
   189
haftmann@25312
   190
fun melt_lthms (r1, r2) =
haftmann@25312
   191
  if Susp.same (r1, r2)
haftmann@25312
   192
    then (false, r1)
haftmann@25312
   193
  else case Susp.peek r1
haftmann@25312
   194
   of SOME [] => (true, r2)
haftmann@25312
   195
    | _ => case Susp.peek r2
haftmann@25312
   196
       of SOME [] => (true, r1)
haftmann@25312
   197
        | _ => (apsnd (Susp.delay o K)) (melt_thms (Susp.force r1, Susp.force r2));
haftmann@25312
   198
haftmann@25312
   199
fun melt_sdthms ((sels1, dels1), (sels2, dels2)) =
haftmann@24219
   200
  let
haftmann@25312
   201
    val (dels_t, dels) = melt_thms (dels1, dels2);
haftmann@24219
   202
  in if dels_t
haftmann@24219
   203
    then let
haftmann@25312
   204
      val (_, sels) = melt_thms
haftmann@24219
   205
        (subtract Thm.eq_thm_prop dels2 (Susp.force sels1), Susp.force sels2);
haftmann@25312
   206
      val (_, dels) = melt_thms
haftmann@24219
   207
        (subtract Thm.eq_thm_prop (Susp.force sels2) dels1, dels2);
haftmann@24219
   208
    in (true, ((Susp.delay o K) sels, dels)) end
haftmann@24219
   209
    else let
haftmann@25312
   210
      val (sels_t, sels) = melt_lthms (sels1, sels2);
haftmann@24219
   211
    in (sels_t, (sels, dels)) end
haftmann@24219
   212
  end;
haftmann@24219
   213
haftmann@24219
   214
haftmann@25312
   215
(* specification data *)
haftmann@24219
   216
haftmann@25312
   217
fun melt_funcs tabs =
haftmann@24219
   218
  let
haftmann@25312
   219
    val tab' = Symtab.join (fn _ => fn ((_, a), (_, b)) => melt_sdthms (a, b)) tabs;
haftmann@25312
   220
    val touched = Symtab.fold (fn (c, (true, _)) => insert (op =) c | _ => I) tab' [];
haftmann@25312
   221
  in (touched, tab') end;
haftmann@24219
   222
haftmann@24219
   223
val eq_string = op = : string * string -> bool;
haftmann@24219
   224
fun eq_dtyp ((vs1, cs1), (vs2, cs2)) = 
haftmann@24219
   225
  gen_eq_set (eq_pair eq_string (gen_eq_set eq_string)) (vs1, vs2)
haftmann@24423
   226
    andalso gen_eq_set (eq_fst eq_string) (cs1, cs2);
haftmann@25312
   227
fun melt_dtyps (tabs as (tab1, tab2)) =
haftmann@24219
   228
  let
haftmann@24219
   229
    val tycos1 = Symtab.keys tab1;
haftmann@24219
   230
    val tycos2 = Symtab.keys tab2;
haftmann@24219
   231
    val tycos' = filter (member eq_string tycos2) tycos1;
haftmann@25312
   232
    val touched = not (gen_eq_set (op =) (tycos1, tycos2)
haftmann@25312
   233
      andalso gen_eq_set (eq_pair (op =) eq_dtyp)
haftmann@24219
   234
      (AList.make (the o Symtab.lookup tab1) tycos',
haftmann@24219
   235
       AList.make (the o Symtab.lookup tab2) tycos'));
haftmann@24219
   236
    fun join _ (cos as (_, cos2)) = if eq_dtyp cos
haftmann@24219
   237
      then raise Symtab.SAME else cos2;
haftmann@25312
   238
  in (touched, Symtab.join join tabs) end;
haftmann@24219
   239
haftmann@25312
   240
fun melt_cases ((cases1, undefs1), (cases2, undefs2)) =
haftmann@24844
   241
  let
haftmann@24844
   242
    val touched1 = subtract (op =) (Symtab.keys cases1) (Symtab.keys cases2)
haftmann@24844
   243
      @ subtract (op =) (Symtab.keys cases2) (Symtab.keys cases1);
haftmann@24844
   244
    val touched2 = subtract (op =) (Symtab.keys undefs1) (Symtab.keys undefs2)
haftmann@24844
   245
      @ subtract (op =) (Symtab.keys undefs2) (Symtab.keys undefs1);
haftmann@24844
   246
    val touched = fold (insert (op =)) touched1 touched2;
haftmann@24844
   247
  in
haftmann@24844
   248
    (touched, (Symtab.merge (K true) (cases1, cases2),
haftmann@24844
   249
      Symtab.merge (K true) (undefs1, undefs2)))
haftmann@24844
   250
  end;
haftmann@24844
   251
haftmann@24219
   252
datatype spec = Spec of {
haftmann@25312
   253
  funcs: (bool * sdthms) Symtab.table,
haftmann@24844
   254
  dtyps: ((string * sort) list * (string * typ list) list) Symtab.table,
haftmann@24844
   255
  cases: (int * string list) Symtab.table * unit Symtab.table
haftmann@24219
   256
};
haftmann@24219
   257
haftmann@24844
   258
fun mk_spec (funcs, (dtyps, cases)) =
haftmann@24844
   259
  Spec { funcs = funcs, dtyps = dtyps, cases = cases };
haftmann@24844
   260
fun map_spec f (Spec { funcs = funcs, dtyps = dtyps, cases = cases }) =
haftmann@24844
   261
  mk_spec (f (funcs, (dtyps, cases)));
haftmann@27557
   262
fun merge_spec (Spec { funcs = funcs1, dtyps = dtyps1, cases = cases1 },
haftmann@24844
   263
  Spec { funcs = funcs2, dtyps = dtyps2, cases = cases2 }) =
haftmann@24219
   264
  let
haftmann@27557
   265
    val (_, funcs) = melt_funcs (funcs1, funcs2);
haftmann@27557
   266
    val (_, dtyps) = melt_dtyps (dtyps1, dtyps2);
haftmann@27557
   267
    val (_, cases) = melt_cases (cases1, cases2);
haftmann@27557
   268
  in mk_spec (funcs, (dtyps, cases)) end;
haftmann@24219
   269
haftmann@25312
   270
haftmann@25312
   271
(* pre- and postprocessor *)
haftmann@25312
   272
haftmann@25312
   273
datatype thmproc = Thmproc of {
haftmann@27557
   274
  pre: MetaSimplifier.simpset,
haftmann@27557
   275
  post: MetaSimplifier.simpset,
haftmann@27557
   276
  functrans: (string * (serial * (theory -> thm list -> thm list))) list
haftmann@25312
   277
};
haftmann@25312
   278
haftmann@27557
   279
fun mk_thmproc ((pre, post), functrans) =
haftmann@27557
   280
  Thmproc { pre = pre, post = post, functrans = functrans };
haftmann@27557
   281
fun map_thmproc f (Thmproc { pre, post, functrans }) =
haftmann@27557
   282
  mk_thmproc (f ((pre, post), functrans));
haftmann@27557
   283
fun merge_thmproc (Thmproc { pre = pre1, post = post1, functrans = functrans1 },
haftmann@27557
   284
  Thmproc { pre = pre2, post = post2, functrans = functrans2 }) =
haftmann@25312
   285
    let
haftmann@27557
   286
      val pre = MetaSimplifier.merge_ss (pre1, pre2);
haftmann@27557
   287
      val post = MetaSimplifier.merge_ss (post1, post2);
haftmann@27557
   288
      val functrans = AList.merge (op =) (eq_fst (op =)) (functrans1, functrans2);
haftmann@27557
   289
    in mk_thmproc ((pre, post), functrans) end;
haftmann@25312
   290
haftmann@24219
   291
datatype exec = Exec of {
haftmann@24219
   292
  thmproc: thmproc,
haftmann@24219
   293
  spec: spec
haftmann@24219
   294
};
haftmann@24219
   295
haftmann@24219
   296
fun mk_exec (thmproc, spec) =
haftmann@24219
   297
  Exec { thmproc = thmproc, spec = spec };
haftmann@24219
   298
fun map_exec f (Exec { thmproc = thmproc, spec = spec }) =
haftmann@24219
   299
  mk_exec (f (thmproc, spec));
haftmann@27557
   300
fun merge_exec (Exec { thmproc = thmproc1, spec = spec1 },
haftmann@24219
   301
  Exec { thmproc = thmproc2, spec = spec2 }) =
haftmann@24219
   302
  let
haftmann@27557
   303
    val thmproc = merge_thmproc (thmproc1, thmproc2);
haftmann@27557
   304
    val spec = merge_spec (spec1, spec2);
haftmann@27557
   305
  in mk_exec (thmproc, spec) end;
haftmann@27557
   306
val empty_exec = mk_exec (mk_thmproc ((MetaSimplifier.empty_ss, MetaSimplifier.empty_ss), []),
haftmann@24844
   307
  mk_spec (Symtab.empty, (Symtab.empty, (Symtab.empty, Symtab.empty))));
haftmann@24219
   308
haftmann@25312
   309
fun the_thmproc (Exec { thmproc = Thmproc x, ...}) = x;
haftmann@24219
   310
fun the_spec (Exec { spec = Spec x, ...}) = x;
haftmann@24219
   311
val the_funcs = #funcs o the_spec;
haftmann@24219
   312
val the_dtyps = #dtyps o the_spec;
haftmann@24844
   313
val the_cases = #cases o the_spec;
haftmann@24219
   314
val map_thmproc = map_exec o apfst o map_thmproc;
haftmann@24219
   315
val map_funcs = map_exec o apsnd o map_spec o apfst;
haftmann@24844
   316
val map_dtyps = map_exec o apsnd o map_spec o apsnd o apfst;
haftmann@24844
   317
val map_cases = map_exec o apsnd o map_spec o apsnd o apsnd;
haftmann@24219
   318
haftmann@24219
   319
haftmann@24219
   320
(* data slots dependent on executable content *)
haftmann@24219
   321
haftmann@24219
   322
(*private copy avoids potential conflict of table exceptions*)
haftmann@24219
   323
structure Datatab = TableFun(type key = int val ord = int_ord);
haftmann@24219
   324
haftmann@24219
   325
local
haftmann@24219
   326
haftmann@24219
   327
type kind = {
haftmann@24219
   328
  empty: Object.T,
haftmann@24219
   329
  merge: Pretty.pp -> Object.T * Object.T -> Object.T,
haftmann@24423
   330
  purge: theory option -> string list option -> Object.T -> Object.T
haftmann@24219
   331
};
haftmann@24219
   332
haftmann@24219
   333
val kinds = ref (Datatab.empty: kind Datatab.table);
haftmann@24219
   334
val kind_keys = ref ([]: serial list);
haftmann@24219
   335
haftmann@24219
   336
fun invoke f k = case Datatab.lookup (! kinds) k
haftmann@24219
   337
 of SOME kind => f kind
haftmann@24219
   338
  | NONE => sys_error "Invalid code data identifier";
haftmann@24219
   339
haftmann@24219
   340
in
haftmann@24219
   341
haftmann@24219
   342
fun declare_data empty merge purge =
haftmann@24219
   343
  let
haftmann@24219
   344
    val k = serial ();
haftmann@24219
   345
    val kind = {empty = empty, merge = merge, purge = purge};
haftmann@24219
   346
    val _ = change kinds (Datatab.update (k, kind));
haftmann@24219
   347
    val _ = change kind_keys (cons k);
haftmann@24219
   348
  in k end;
haftmann@24219
   349
haftmann@24219
   350
fun invoke_empty k = invoke (fn kind => #empty kind) k;
haftmann@24219
   351
haftmann@24219
   352
fun invoke_merge_all pp = Datatab.join
haftmann@24219
   353
  (invoke (fn kind => #merge kind pp));
haftmann@24219
   354
haftmann@24219
   355
fun invoke_purge_all thy_opt cs =
haftmann@24219
   356
  fold (fn k => Datatab.map_entry k
haftmann@24219
   357
    (invoke (fn kind => #purge kind thy_opt cs) k)) (! kind_keys);
haftmann@24219
   358
haftmann@24219
   359
end; (*local*)
haftmann@24219
   360
haftmann@24219
   361
haftmann@25312
   362
(** theory store **)
haftmann@24219
   363
haftmann@24219
   364
local
haftmann@24219
   365
haftmann@24219
   366
type data = Object.T Datatab.table;
haftmann@24219
   367
haftmann@24219
   368
structure CodeData = TheoryDataFun
haftmann@24219
   369
(
haftmann@24219
   370
  type T = exec * data ref;
haftmann@24219
   371
  val empty = (empty_exec, ref Datatab.empty : data ref);
haftmann@24219
   372
  fun copy (exec, data) = (exec, ref (! data));
haftmann@24219
   373
  val extend = copy;
haftmann@24219
   374
  fun merge pp ((exec1, data1), (exec2, data2)) =
haftmann@24219
   375
    let
haftmann@27557
   376
      val exec = merge_exec (exec1, exec2);
haftmann@27557
   377
      val data1' = invoke_purge_all NONE NONE (! data1);
haftmann@27557
   378
      val data2' = invoke_purge_all NONE NONE (! data2);
haftmann@24219
   379
      val data = invoke_merge_all pp (data1', data2');
haftmann@24219
   380
    in (exec, ref data) end;
haftmann@24219
   381
);
haftmann@24219
   382
wenzelm@26463
   383
val _ = Context.>> (Context.map_theory CodeData.init);
haftmann@24219
   384
haftmann@24219
   385
fun thy_data f thy = f ((snd o CodeData.get) thy);
haftmann@24219
   386
haftmann@24219
   387
fun get_ensure_init kind data_ref =
haftmann@24219
   388
  case Datatab.lookup (! data_ref) kind
haftmann@24219
   389
   of SOME x => x
haftmann@24219
   390
    | NONE => let val y = invoke_empty kind
haftmann@24219
   391
        in (change data_ref (Datatab.update (kind, y)); y) end;
haftmann@24219
   392
haftmann@24219
   393
in
haftmann@24219
   394
haftmann@24219
   395
(* access to executable content *)
haftmann@24219
   396
haftmann@24844
   397
val the_exec = fst o CodeData.get;
haftmann@24219
   398
haftmann@24219
   399
fun map_exec_purge touched f thy =
haftmann@24219
   400
  CodeData.map (fn (exec, data) => 
haftmann@24219
   401
    (f exec, ref (invoke_purge_all (SOME thy) touched (! data)))) thy;
haftmann@24219
   402
haftmann@24219
   403
haftmann@24219
   404
(* access to data dependent on abstract executable content *)
haftmann@24219
   405
haftmann@24219
   406
fun get_data (kind, _, dest) = thy_data (get_ensure_init kind #> dest);
haftmann@24219
   407
haftmann@24219
   408
fun change_data (kind, mk, dest) =
haftmann@24219
   409
  let
haftmann@24219
   410
    fun chnge data_ref f =
haftmann@24219
   411
      let
haftmann@24219
   412
        val data = get_ensure_init kind data_ref;
haftmann@24219
   413
        val data' = f (dest data);
haftmann@24219
   414
      in (change data_ref (Datatab.update (kind, mk data')); data') end;
haftmann@24219
   415
  in thy_data chnge end;
haftmann@24219
   416
haftmann@24219
   417
fun change_yield_data (kind, mk, dest) =
haftmann@24219
   418
  let
haftmann@24219
   419
    fun chnge data_ref f =
haftmann@24219
   420
      let
haftmann@24219
   421
        val data = get_ensure_init kind data_ref;
haftmann@24219
   422
        val (x, data') = f (dest data);
haftmann@24219
   423
      in (x, (change data_ref (Datatab.update (kind, mk data')); data')) end;
haftmann@24219
   424
  in thy_data chnge end;
haftmann@24219
   425
haftmann@24219
   426
end; (*local*)
haftmann@24219
   427
haftmann@24219
   428
haftmann@24219
   429
(* print executable content *)
haftmann@24219
   430
haftmann@24219
   431
fun print_codesetup thy =
haftmann@24219
   432
  let
haftmann@24219
   433
    val ctxt = ProofContext.init thy;
haftmann@24844
   434
    val exec = the_exec thy;
haftmann@24219
   435
    fun pretty_func (s, lthms) =
haftmann@24219
   436
      (Pretty.block o Pretty.fbreaks) (
haftmann@24219
   437
        Pretty.str s :: pretty_sdthms ctxt lthms
haftmann@24219
   438
      );
haftmann@24219
   439
    fun pretty_dtyp (s, []) =
haftmann@24219
   440
          Pretty.str s
haftmann@24219
   441
      | pretty_dtyp (s, cos) =
haftmann@24219
   442
          (Pretty.block o Pretty.breaks) (
haftmann@24219
   443
            Pretty.str s
haftmann@24219
   444
            :: Pretty.str "="
haftmann@24219
   445
            :: separate (Pretty.str "|") (map (fn (c, []) => Pretty.str c
haftmann@24219
   446
                 | (c, tys) =>
haftmann@24219
   447
                     (Pretty.block o Pretty.breaks)
haftmann@24423
   448
                        (Pretty.str (CodeUnit.string_of_const thy c)
wenzelm@26947
   449
                          :: Pretty.str "of"
wenzelm@26947
   450
                          :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@24219
   451
          );
haftmann@27557
   452
    val pre = (#pre o the_thmproc) exec;
haftmann@27557
   453
    val post = (#post o the_thmproc) exec;
haftmann@27557
   454
    val functrans = (map fst o #functrans o the_thmproc) exec;
haftmann@24219
   455
    val funs = the_funcs exec
haftmann@24423
   456
      |> Symtab.dest
haftmann@25312
   457
      |> (map o apsnd) snd
haftmann@24219
   458
      |> (map o apfst) (CodeUnit.string_of_const thy)
haftmann@24219
   459
      |> sort (string_ord o pairself fst);
haftmann@24219
   460
    val dtyps = the_dtyps exec
haftmann@24219
   461
      |> Symtab.dest
wenzelm@26947
   462
      |> map (fn (dtco, (vs, cos)) =>
wenzelm@26947
   463
          (Syntax.string_of_typ_global thy (Type (dtco, map TFree vs)), cos))
haftmann@24219
   464
      |> sort (string_ord o pairself fst)
haftmann@24219
   465
  in
haftmann@24219
   466
    (Pretty.writeln o Pretty.chunks) [
haftmann@24219
   467
      Pretty.block (
haftmann@24219
   468
        Pretty.str "defining equations:"
haftmann@24219
   469
        :: Pretty.fbrk
haftmann@24219
   470
        :: (Pretty.fbreaks o map pretty_func) funs
haftmann@24219
   471
      ),
haftmann@27557
   472
      Pretty.block [
haftmann@27557
   473
        Pretty.str "preprocessing simpset:",
haftmann@27557
   474
        Pretty.fbrk,
haftmann@27557
   475
        MetaSimplifier.pretty_ss pre
haftmann@27557
   476
      ],
haftmann@27557
   477
      Pretty.block [
haftmann@27557
   478
        Pretty.str "postprocessing simpset:",
haftmann@27557
   479
        Pretty.fbrk,
haftmann@27557
   480
        MetaSimplifier.pretty_ss post
haftmann@27557
   481
      ],
haftmann@24219
   482
      Pretty.block (
haftmann@27557
   483
        Pretty.str "function transformators:"
haftmann@24219
   484
        :: Pretty.fbrk
haftmann@27557
   485
        :: (Pretty.fbreaks o map Pretty.str) functrans
haftmann@25968
   486
      ),
haftmann@25968
   487
      Pretty.block (
haftmann@24219
   488
        Pretty.str "datatypes:"
haftmann@24219
   489
        :: Pretty.fbrk
haftmann@24219
   490
        :: (Pretty.fbreaks o map pretty_dtyp) dtyps
haftmann@24219
   491
      )
haftmann@24219
   492
    ]
haftmann@24219
   493
  end;
haftmann@24219
   494
haftmann@24219
   495
haftmann@24219
   496
haftmann@24219
   497
(** theorem transformation and certification **)
haftmann@24219
   498
haftmann@26970
   499
fun const_of thy = dest_Const o fst o strip_comb o fst o Logic.dest_equals
haftmann@26970
   500
  o ObjectLogic.drop_judgment thy o Thm.plain_prop_of;
haftmann@26970
   501
haftmann@26970
   502
fun const_of_func thy = AxClass.unoverload_const thy o const_of thy;
haftmann@26970
   503
haftmann@24219
   504
fun common_typ_funcs [] = []
haftmann@24219
   505
  | common_typ_funcs [thm] = [thm]
haftmann@26970
   506
  | common_typ_funcs (thms as thm :: _) = (*FIXME is too general*)
haftmann@24219
   507
      let
haftmann@24219
   508
        val thy = Thm.theory_of_thm thm;
haftmann@24219
   509
        fun incr_thm thm max =
haftmann@24219
   510
          let
haftmann@24219
   511
            val thm' = incr_indexes max thm;
haftmann@24219
   512
            val max' = Thm.maxidx_of thm' + 1;
haftmann@24219
   513
          in (thm', max') end;
haftmann@24219
   514
        val (thms', maxidx) = fold_map incr_thm thms 0;
haftmann@26970
   515
        val ty1 :: tys = map (snd o const_of thy) thms';
haftmann@24219
   516
        fun unify ty env = Sign.typ_unify thy (ty1, ty) env
haftmann@24219
   517
          handle Type.TUNIFY =>
haftmann@24219
   518
            error ("Type unificaton failed, while unifying defining equations\n"
haftmann@24219
   519
            ^ (cat_lines o map Display.string_of_thm) thms
haftmann@24219
   520
            ^ "\nwith types\n"
haftmann@24219
   521
            ^ (cat_lines o map (CodeUnit.string_of_typ thy)) (ty1 :: tys));
haftmann@24219
   522
        val (env, _) = fold unify tys (Vartab.empty, maxidx)
haftmann@24219
   523
        val instT = Vartab.fold (fn (x_i, (sort, ty)) =>
haftmann@24219
   524
          cons (Thm.ctyp_of thy (TVar (x_i, sort)), Thm.ctyp_of thy ty)) env [];
haftmann@24219
   525
      in map (Thm.instantiate (instT, [])) thms' end;
haftmann@24219
   526
haftmann@24219
   527
fun certify_const thy const thms =
haftmann@24219
   528
  let
haftmann@24423
   529
    fun cert thm = if const = const_of_func thy thm
haftmann@24219
   530
      then thm else error ("Wrong head of defining equation,\nexpected constant "
wenzelm@26928
   531
        ^ CodeUnit.string_of_const thy const ^ "\n" ^ Display.string_of_thm thm)
haftmann@24219
   532
  in map cert thms end;
haftmann@24219
   533
haftmann@24219
   534
haftmann@24219
   535
haftmann@24219
   536
(** operational sort algebra and class discipline **)
haftmann@24219
   537
haftmann@24219
   538
local
haftmann@24219
   539
haftmann@24219
   540
fun aggr_neutr f y [] = y
haftmann@24219
   541
  | aggr_neutr f y (x::xs) = aggr_neutr f (f y x) xs;
haftmann@24219
   542
haftmann@24219
   543
fun aggregate f [] = NONE
haftmann@24219
   544
  | aggregate f (x::xs) = SOME (aggr_neutr f x xs);
haftmann@24219
   545
haftmann@25462
   546
fun inter_sorts algebra =
haftmann@25462
   547
  aggregate (map2 (curry (Sorts.inter_sort algebra)));
haftmann@24219
   548
haftmann@24219
   549
fun specific_constraints thy (class, tyco) =
haftmann@24219
   550
  let
haftmann@24219
   551
    val vs = Name.invents Name.context "" (Sign.arity_number thy tyco);
wenzelm@24969
   552
    val classparams = (map fst o these o try (#params o AxClass.get_info thy)) class;
haftmann@24837
   553
    val funcs = classparams
haftmann@25597
   554
      |> map_filter (fn c => try (AxClass.param_of_inst thy) (c, tyco))
haftmann@24844
   555
      |> map (Symtab.lookup ((the_funcs o the_exec) thy))
haftmann@25312
   556
      |> (map o Option.map) (Susp.force o fst o snd)
haftmann@24219
   557
      |> maps these
haftmann@24423
   558
      |> map (Thm.transfer thy)
haftmann@24423
   559
    fun sorts_of [Type (_, tys)] = map (snd o dest_TVar) tys
haftmann@24423
   560
      | sorts_of tys = map (snd o dest_TVar) tys;
haftmann@26970
   561
    val sorts = map (sorts_of o Sign.const_typargs thy o const_of thy) funcs;
haftmann@24219
   562
  in sorts end;
haftmann@24219
   563
haftmann@25462
   564
fun weakest_constraints thy algebra (class, tyco) =
haftmann@24219
   565
  let
haftmann@25462
   566
    val all_superclasses = Sorts.complete_sort algebra [class];
haftmann@25462
   567
  in case inter_sorts algebra (maps (fn class => specific_constraints thy (class, tyco)) all_superclasses)
haftmann@24219
   568
   of SOME sorts => sorts
haftmann@25462
   569
    | NONE => Sorts.mg_domain algebra tyco [class]
haftmann@24219
   570
  end;
haftmann@24219
   571
haftmann@25462
   572
fun strongest_constraints thy algebra (class, tyco) =
haftmann@24219
   573
  let
haftmann@24219
   574
    val all_subclasses = class :: Graph.all_preds ((#classes o Sorts.rep_algebra) algebra) [class];
haftmann@24219
   575
    val inst_subclasses = filter (can (Sorts.mg_domain algebra tyco) o single) all_subclasses;
haftmann@25462
   576
  in case inter_sorts algebra (maps (fn class => specific_constraints thy (class, tyco)) inst_subclasses)
haftmann@24219
   577
   of SOME sorts => sorts
haftmann@24219
   578
    | NONE => replicate
haftmann@25462
   579
        (Sign.arity_number thy tyco) (Sorts.minimize_sort algebra (Sorts.all_classes algebra))
haftmann@25462
   580
  end;
haftmann@25462
   581
haftmann@25462
   582
fun get_algebra thy (class, tyco) =
haftmann@25462
   583
  let
haftmann@25462
   584
    val base_algebra = Sign.classes_of thy;
haftmann@25462
   585
  in if can (Sorts.mg_domain base_algebra tyco) [class]
haftmann@25462
   586
    then base_algebra
haftmann@25462
   587
    else let
haftmann@25462
   588
      val superclasses = Sorts.super_classes base_algebra class;
haftmann@25462
   589
      val sorts = inter_sorts base_algebra
haftmann@25462
   590
          (map_filter (fn class => try (Sorts.mg_domain base_algebra tyco) [class]) superclasses)
haftmann@25462
   591
        |> the_default (replicate (Sign.arity_number thy tyco) [])
haftmann@25462
   592
    in
haftmann@25462
   593
      base_algebra
wenzelm@26947
   594
      |> Sorts.add_arities (Syntax.pp_global thy) (tyco, [(class, sorts)])
haftmann@25462
   595
    end
haftmann@24219
   596
  end;
haftmann@24219
   597
haftmann@24837
   598
fun gen_classparam_typ constr thy class (c, tyco) = 
haftmann@24219
   599
  let
haftmann@25462
   600
    val algebra = get_algebra thy (class, tyco);
wenzelm@24969
   601
    val cs = these (try (#params o AxClass.get_info thy) class);
haftmann@25462
   602
    val SOME ty = AList.lookup (op =) cs c;
wenzelm@24969
   603
    val sort_args = Name.names (Name.declare Name.aT Name.context) Name.aT
haftmann@25462
   604
      (constr thy algebra (class, tyco));
haftmann@24219
   605
    val ty_inst = Type (tyco, map TFree sort_args);
haftmann@24219
   606
  in Logic.varifyT (map_type_tfree (K ty_inst) ty) end;
haftmann@24219
   607
haftmann@24219
   608
fun retrieve_algebra thy operational =
wenzelm@26947
   609
  Sorts.subalgebra (Syntax.pp_global thy) operational
haftmann@25462
   610
    (weakest_constraints thy (Sign.classes_of thy))
haftmann@24219
   611
    (Sign.classes_of thy);
haftmann@24219
   612
haftmann@24219
   613
in
haftmann@24219
   614
haftmann@24219
   615
fun coregular_algebra thy = retrieve_algebra thy (K true) |> snd;
haftmann@24219
   616
fun operational_algebra thy =
haftmann@24219
   617
  let
haftmann@24219
   618
    fun add_iff_operational class =
wenzelm@24928
   619
      can (AxClass.get_info thy) class ? cons class;
haftmann@24219
   620
    val operational_classes = fold add_iff_operational (Sign.all_classes thy) []
haftmann@24219
   621
  in retrieve_algebra thy (member (op =) operational_classes) end;
haftmann@24219
   622
haftmann@24837
   623
val classparam_weakest_typ = gen_classparam_typ weakest_constraints;
haftmann@24837
   624
val classparam_strongest_typ = gen_classparam_typ strongest_constraints;
haftmann@24219
   625
haftmann@24219
   626
fun assert_func_typ thm =
haftmann@24219
   627
  let
haftmann@24219
   628
    val thy = Thm.theory_of_thm thm;
haftmann@24837
   629
    fun check_typ_classparam tyco (c, thm) =
haftmann@24219
   630
          let
haftmann@24423
   631
            val SOME class = AxClass.class_of_param thy c;
haftmann@26970
   632
            val (_, ty) = const_of thy thm;
haftmann@24837
   633
            val ty_decl = classparam_weakest_typ thy class (c, tyco);
haftmann@24837
   634
            val ty_strongest = classparam_strongest_typ thy class (c, tyco);
haftmann@24219
   635
            fun constrain thm = 
haftmann@24219
   636
              let
haftmann@24219
   637
                val max = Thm.maxidx_of thm + 1;
haftmann@24219
   638
                val ty_decl' = Logic.incr_tvar max ty_decl;
haftmann@26970
   639
                val (_, ty') = const_of thy thm;
haftmann@24219
   640
                val (env, _) = Sign.typ_unify thy (ty_decl', ty') (Vartab.empty, max);
haftmann@24219
   641
                val instT = Vartab.fold (fn (x_i, (sort, ty)) =>
haftmann@24219
   642
                  cons (Thm.ctyp_of thy (TVar (x_i, sort)), Thm.ctyp_of thy ty)) env [];
haftmann@24219
   643
              in Thm.instantiate (instT, []) thm end;
haftmann@24219
   644
          in if Sign.typ_instance thy (ty_strongest, ty)
haftmann@24219
   645
            then if Sign.typ_instance thy (ty, ty_decl)
haftmann@24219
   646
            then thm
haftmann@24219
   647
            else (warning ("Constraining type\n" ^ CodeUnit.string_of_typ thy ty
haftmann@24219
   648
              ^ "\nof defining equation\n"
wenzelm@26928
   649
              ^ Display.string_of_thm thm
haftmann@24219
   650
              ^ "\nto permitted most general type\n"
haftmann@24219
   651
              ^ CodeUnit.string_of_typ thy ty_decl);
haftmann@24219
   652
              constrain thm)
haftmann@24219
   653
            else CodeUnit.bad_thm ("Type\n" ^ CodeUnit.string_of_typ thy ty
haftmann@24219
   654
              ^ "\nof defining equation\n"
wenzelm@26928
   655
              ^ Display.string_of_thm thm
haftmann@24219
   656
              ^ "\nis incompatible with permitted least general type\n"
haftmann@24219
   657
              ^ CodeUnit.string_of_typ thy ty_strongest)
haftmann@24423
   658
          end;
haftmann@24423
   659
    fun check_typ_fun (c, thm) =
haftmann@24219
   660
      let
haftmann@26970
   661
        val (_, ty) = const_of thy thm;
haftmann@24219
   662
        val ty_decl = Sign.the_const_type thy c;
haftmann@24219
   663
      in if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty)
haftmann@24219
   664
        then thm
haftmann@24219
   665
        else CodeUnit.bad_thm ("Type\n" ^ CodeUnit.string_of_typ thy ty
haftmann@24219
   666
           ^ "\nof defining equation\n"
wenzelm@26928
   667
           ^ Display.string_of_thm thm
haftmann@24219
   668
           ^ "\nis incompatible with declared function type\n"
haftmann@24219
   669
           ^ CodeUnit.string_of_typ thy ty_decl)
haftmann@24219
   670
      end;
haftmann@24423
   671
    fun check_typ (c, thm) =
haftmann@25597
   672
      case AxClass.inst_of_param thy c
haftmann@24837
   673
       of SOME (c, tyco) => check_typ_classparam tyco (c, thm)
haftmann@24423
   674
        | NONE => check_typ_fun (c, thm);
haftmann@24423
   675
  in check_typ (const_of_func thy thm, thm) end;
haftmann@24219
   676
haftmann@24283
   677
val mk_func = CodeUnit.error_thm (assert_func_typ o CodeUnit.mk_func);
haftmann@24624
   678
val mk_liberal_func = CodeUnit.warning_thm (assert_func_typ o CodeUnit.mk_func);
haftmann@24624
   679
val mk_default_func = CodeUnit.try_thm (assert_func_typ o CodeUnit.mk_func);
haftmann@24219
   680
haftmann@24219
   681
end;
haftmann@24219
   682
haftmann@24219
   683
haftmann@24219
   684
haftmann@24219
   685
(** interfaces and attributes **)
haftmann@24219
   686
haftmann@24624
   687
fun delete_force msg key xs =
haftmann@24624
   688
  if AList.defined (op =) xs key then AList.delete (op =) key xs
haftmann@24624
   689
  else error ("No such " ^ msg ^ ": " ^ quote key);
haftmann@24624
   690
haftmann@24423
   691
fun get_datatype thy tyco =
haftmann@24844
   692
  case Symtab.lookup ((the_dtyps o the_exec) thy) tyco
haftmann@24423
   693
   of SOME spec => spec
haftmann@24423
   694
    | NONE => Sign.arity_number thy tyco
wenzelm@24848
   695
        |> Name.invents Name.context Name.aT
haftmann@24423
   696
        |> map (rpair [])
haftmann@24423
   697
        |> rpair [];
haftmann@24423
   698
haftmann@24423
   699
fun get_datatype_of_constr thy c =
haftmann@24423
   700
  case (snd o strip_type o Sign.the_const_type thy) c
haftmann@24423
   701
   of Type (tyco, _) => if member (op =)
haftmann@24844
   702
       ((the_default [] o Option.map (map fst o snd) o Symtab.lookup ((the_dtyps o the_exec) thy)) tyco) c
haftmann@24423
   703
       then SOME tyco else NONE
haftmann@24423
   704
    | _ => NONE;
haftmann@24423
   705
haftmann@24423
   706
fun get_constr_typ thy c =
haftmann@24423
   707
  case get_datatype_of_constr thy c
haftmann@24423
   708
   of SOME tyco => let
haftmann@24423
   709
          val (vs, cos) = get_datatype thy tyco;
haftmann@24423
   710
          val SOME tys = AList.lookup (op =) cos c;
haftmann@24423
   711
          val ty = tys ---> Type (tyco, map TFree vs);
haftmann@24423
   712
        in SOME (Logic.varifyT ty) end
haftmann@24423
   713
    | NONE => NONE;
haftmann@24423
   714
haftmann@24844
   715
val get_case_data = Symtab.lookup o fst o the_cases o the_exec;
haftmann@24844
   716
haftmann@24844
   717
val is_undefined = Symtab.defined o snd o the_cases o the_exec;
haftmann@24844
   718
haftmann@24624
   719
fun add_func thm thy =
haftmann@24624
   720
  let
haftmann@24624
   721
    val func = mk_func thm;
haftmann@24624
   722
    val c = const_of_func thy func;
haftmann@24624
   723
    val _ = if (is_some o AxClass.class_of_param thy) c
haftmann@24624
   724
      then error ("Rejected polymorphic equation for overloaded constant:\n"
wenzelm@26928
   725
        ^ Display.string_of_thm thm)
haftmann@24624
   726
      else ();
haftmann@24624
   727
    val _ = if (is_some o get_datatype_of_constr thy) c
haftmann@24624
   728
      then error ("Rejected equation for datatype constructor:\n"
wenzelm@26928
   729
        ^ Display.string_of_thm func)
haftmann@24624
   730
      else ();
haftmann@24624
   731
  in
haftmann@24624
   732
    (map_exec_purge (SOME [c]) o map_funcs) (Symtab.map_default
haftmann@25312
   733
      (c, (false, (Susp.value [], []))) (apsnd (add_thm func))) thy
haftmann@24624
   734
  end;
haftmann@24219
   735
haftmann@24624
   736
fun add_liberal_func thm thy =
haftmann@24624
   737
  case mk_liberal_func thm
haftmann@24624
   738
   of SOME func => let
haftmann@24624
   739
          val c = const_of_func thy func
haftmann@24624
   740
        in if (is_some o AxClass.class_of_param thy) c
haftmann@24624
   741
          orelse (is_some o get_datatype_of_constr thy) c
haftmann@24624
   742
          then thy
haftmann@24624
   743
          else map_exec_purge (SOME [c]) (map_funcs
haftmann@24624
   744
            (Symtab.map_default
haftmann@25312
   745
              (c, (false, (Susp.value [], []))) (apsnd (add_thm func)))) thy
haftmann@24624
   746
        end
haftmann@24624
   747
    | NONE => thy;
haftmann@24624
   748
haftmann@24624
   749
fun add_default_func thm thy =
haftmann@24624
   750
  case mk_default_func thm
haftmann@24624
   751
   of SOME func => let
haftmann@24624
   752
          val c = const_of_func thy func
haftmann@24624
   753
        in if (is_some o AxClass.class_of_param thy) c
haftmann@24624
   754
          orelse (is_some o get_datatype_of_constr thy) c
haftmann@24624
   755
          then thy
haftmann@24624
   756
          else map_exec_purge (SOME [c]) (map_funcs
haftmann@24624
   757
          (Symtab.map_default
haftmann@25312
   758
            (c, (false, (Susp.value [], []))) (apsnd (add_thm func)))) thy
haftmann@24624
   759
        end
haftmann@24624
   760
    | NONE => thy;
haftmann@24219
   761
haftmann@24219
   762
fun del_func thm thy =
haftmann@24659
   763
  case mk_liberal_func thm
haftmann@24659
   764
   of SOME func => let
haftmann@24659
   765
          val c = const_of_func thy func;
haftmann@24659
   766
        in map_exec_purge (SOME [c]) (map_funcs
haftmann@25312
   767
          (Symtab.map_entry c (apsnd (del_thm func)))) thy
haftmann@24659
   768
        end
haftmann@24659
   769
    | NONE => thy;
haftmann@24219
   770
haftmann@26021
   771
fun del_funcs const = map_exec_purge (SOME [const])
haftmann@26021
   772
  (map_funcs (Symtab.map_entry const (apsnd del_thms)));
haftmann@26021
   773
haftmann@24219
   774
fun add_funcl (const, lthms) thy =
haftmann@24219
   775
  let
haftmann@24219
   776
    val lthms' = certificate thy (fn thy => certify_const thy const) lthms;
haftmann@24219
   777
      (*FIXME must check compatibility with sort algebra;
haftmann@24219
   778
        alas, naive checking results in non-termination!*)
haftmann@24219
   779
  in
haftmann@25312
   780
    map_exec_purge (SOME [const])
haftmann@25312
   781
      (map_funcs (Symtab.map_default (const, (false, (Susp.value [], [])))
haftmann@25312
   782
      (apsnd (add_lthms lthms')))) thy
haftmann@24219
   783
  end;
haftmann@24219
   784
haftmann@24624
   785
val add_default_func_attr = Attrib.internal (fn _ => Thm.declaration_attribute
haftmann@24624
   786
  (fn thm => Context.mapping (add_default_func thm) I));
haftmann@24219
   787
haftmann@25485
   788
structure TypeInterpretation = InterpretationFun(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@25462
   789
haftmann@24423
   790
fun add_datatype raw_cs thy =
haftmann@24219
   791
  let
haftmann@25597
   792
    val cs = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) raw_cs;
haftmann@24423
   793
    val (tyco, vs_cos) = CodeUnit.constrset_of_consts thy cs;
haftmann@25462
   794
    val cs' = map fst (snd vs_cos);
haftmann@25462
   795
    val purge_cs = case Symtab.lookup ((the_dtyps o the_exec) thy) tyco
haftmann@25462
   796
     of SOME (vs, cos) => if null cos then NONE else SOME (cs' @ map fst cos)
haftmann@24423
   797
      | NONE => NONE;
haftmann@24219
   798
  in
haftmann@24219
   799
    thy
haftmann@25462
   800
    |> map_exec_purge purge_cs (map_dtyps (Symtab.update (tyco, vs_cos))
haftmann@24423
   801
        #> map_funcs (fold (Symtab.delete_safe o fst) cs))
haftmann@25485
   802
    |> TypeInterpretation.data (tyco, serial ())
haftmann@24219
   803
  end;
haftmann@24219
   804
haftmann@25485
   805
fun type_interpretation f =  TypeInterpretation.interpretation
haftmann@25485
   806
  (fn (tyco, _) => fn thy => f (tyco, get_datatype thy tyco) thy);
haftmann@25485
   807
haftmann@24423
   808
fun add_datatype_cmd raw_cs thy =
haftmann@24423
   809
  let
haftmann@24423
   810
    val cs = map (CodeUnit.read_bare_const thy) raw_cs;
haftmann@24423
   811
  in add_datatype cs thy end;
haftmann@24219
   812
haftmann@24844
   813
fun add_case thm thy =
haftmann@24844
   814
  let
haftmann@24844
   815
    val entry as (c, _) = CodeUnit.case_cert thm;
haftmann@24844
   816
  in
haftmann@24844
   817
    (map_exec_purge (SOME [c]) o map_cases o apfst) (Symtab.update entry) thy
haftmann@24844
   818
  end;
haftmann@24844
   819
haftmann@24844
   820
fun add_undefined c thy =
haftmann@24844
   821
  (map_exec_purge (SOME [c]) o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@24844
   822
haftmann@27557
   823
val map_pre = map_exec_purge NONE o map_thmproc o apfst o apfst;
haftmann@27557
   824
val map_post = map_exec_purge NONE o map_thmproc o apfst o apsnd;
haftmann@27557
   825
haftmann@27557
   826
fun add_inline thm thy = (map_pre o MetaSimplifier.add_simp)
haftmann@27557
   827
  (CodeUnit.error_thm CodeUnit.mk_rew thm) thy;
haftmann@27557
   828
    (*fully applied in order to get right context for mk_rew!*)
haftmann@27557
   829
haftmann@27557
   830
fun del_inline thm thy = (map_pre o MetaSimplifier.del_simp)
haftmann@27557
   831
  (CodeUnit.error_thm CodeUnit.mk_rew thm) thy;
haftmann@27557
   832
    (*fully applied in order to get right context for mk_rew!*)
haftmann@24219
   833
haftmann@27557
   834
fun add_post thm thy = (map_post o MetaSimplifier.add_simp)
haftmann@27557
   835
  (CodeUnit.error_thm CodeUnit.mk_rew thm) thy;
haftmann@27557
   836
    (*fully applied in order to get right context for mk_rew!*)
haftmann@24219
   837
haftmann@27557
   838
fun del_post thm thy = (map_post o MetaSimplifier.del_simp)
haftmann@27557
   839
  (CodeUnit.error_thm CodeUnit.mk_rew thm) thy;
haftmann@27557
   840
    (*fully applied in order to get right context for mk_rew!*)
haftmann@27557
   841
  
haftmann@27557
   842
fun add_functrans (name, f) =
haftmann@27557
   843
  (map_exec_purge NONE o map_thmproc o apsnd)
haftmann@24219
   844
    (AList.update (op =) (name, (serial (), f)));
haftmann@24219
   845
haftmann@27557
   846
fun del_functrans name =
haftmann@24219
   847
  (map_exec_purge NONE o map_thmproc o apsnd)
haftmann@27557
   848
    (delete_force "function transformator" name);
haftmann@24219
   849
wenzelm@26463
   850
val _ = Context.>> (Context.map_theory
haftmann@24219
   851
  (let
haftmann@24219
   852
    fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@24219
   853
    fun add_simple_attribute (name, f) =
haftmann@24219
   854
      add_attribute (name, Scan.succeed (mk_attribute f));
haftmann@24219
   855
    fun add_del_attribute (name, (add, del)) =
haftmann@24219
   856
      add_attribute (name, Args.del |-- Scan.succeed (mk_attribute del)
haftmann@24219
   857
        || Scan.succeed (mk_attribute add))
haftmann@24219
   858
  in
haftmann@25462
   859
    TypeInterpretation.init
haftmann@25462
   860
    #> add_del_attribute ("func", (add_func, del_func))
haftmann@24219
   861
    #> add_del_attribute ("inline", (add_inline, del_inline))
haftmann@24219
   862
    #> add_del_attribute ("post", (add_post, del_post))
wenzelm@26463
   863
  end));
haftmann@24219
   864
haftmann@24219
   865
haftmann@24219
   866
(** post- and preprocessing **)
haftmann@24219
   867
haftmann@24219
   868
local
haftmann@24219
   869
haftmann@27557
   870
fun apply_functrans thy f [] = []
haftmann@27557
   871
  | apply_functrans thy f (thms as (thm :: _)) =
haftmann@24219
   872
      let
haftmann@24423
   873
        val const = const_of_func thy thm;
haftmann@24219
   874
        val thms' = f thy thms;
haftmann@24219
   875
      in certify_const thy const thms' end;
haftmann@24219
   876
haftmann@24219
   877
fun rhs_conv conv thm =
haftmann@24219
   878
  let
haftmann@24219
   879
    val thm' = (conv o Thm.rhs_of) thm;
haftmann@24219
   880
  in Thm.transitive thm thm' end
haftmann@24219
   881
haftmann@24837
   882
fun term_of_conv thy f =
haftmann@24837
   883
  Thm.cterm_of thy
haftmann@24837
   884
  #> f
haftmann@24837
   885
  #> Thm.prop_of
haftmann@24837
   886
  #> Logic.dest_equals
haftmann@24837
   887
  #> snd;
haftmann@24837
   888
haftmann@24219
   889
in
haftmann@24219
   890
haftmann@24219
   891
fun preprocess thy thms =
haftmann@24219
   892
  thms
haftmann@27557
   893
  |> fold (fn (_, (_, f)) => apply_functrans thy f) ((#functrans o the_thmproc o the_exec) thy)
haftmann@27557
   894
  |> map (CodeUnit.rewrite_func ((#pre o the_thmproc o the_exec) thy))
haftmann@27557
   895
  (*FIXME - must check gere: rewrite rule, defining equation, proper constant *)
haftmann@26970
   896
  |> map (AxClass.unoverload thy)
haftmann@26970
   897
  |> common_typ_funcs;
haftmann@26970
   898
haftmann@24219
   899
haftmann@24219
   900
fun preprocess_conv ct =
haftmann@24219
   901
  let
haftmann@24219
   902
    val thy = Thm.theory_of_cterm ct;
haftmann@24219
   903
  in
haftmann@24219
   904
    ct
haftmann@27557
   905
    |> MetaSimplifier.rewrite' (ProofContext.init thy) false ((#pre o the_thmproc o the_exec) thy)
haftmann@25597
   906
    |> rhs_conv (AxClass.unoverload_conv thy)
haftmann@24219
   907
  end;
haftmann@24219
   908
haftmann@24837
   909
fun preprocess_term thy = term_of_conv thy preprocess_conv;
haftmann@24837
   910
haftmann@24219
   911
fun postprocess_conv ct =
haftmann@24219
   912
  let
haftmann@24219
   913
    val thy = Thm.theory_of_cterm ct;
haftmann@24219
   914
  in
haftmann@24219
   915
    ct
haftmann@25597
   916
    |> AxClass.overload_conv thy
haftmann@27557
   917
    |> rhs_conv (MetaSimplifier.rewrite' (ProofContext.init thy) false 
haftmann@27557
   918
          ((#post o the_thmproc o the_exec) thy))
haftmann@24219
   919
  end;
haftmann@24219
   920
haftmann@24837
   921
fun postprocess_term thy = term_of_conv thy postprocess_conv;
haftmann@24837
   922
haftmann@24219
   923
end; (*local*)
haftmann@24219
   924
haftmann@25597
   925
fun default_typ_proto thy c = case AxClass.inst_of_param thy c
haftmann@24837
   926
 of SOME (c, tyco) => classparam_weakest_typ thy ((the o AxClass.class_of_param thy) c)
haftmann@24423
   927
      (c, tyco) |> SOME
haftmann@24423
   928
  | NONE => (case AxClass.class_of_param thy c
haftmann@24423
   929
     of SOME class => SOME (Term.map_type_tvar
wenzelm@24848
   930
          (K (TVar ((Name.aT, 0), [class]))) (Sign.the_const_type thy c))
haftmann@24423
   931
      | NONE => get_constr_typ thy c);
haftmann@24219
   932
haftmann@24219
   933
local
haftmann@24219
   934
haftmann@24219
   935
fun get_funcs thy const =
haftmann@24844
   936
  Symtab.lookup ((the_funcs o the_exec) thy) const
haftmann@25312
   937
  |> Option.map (Susp.force o fst o snd)
haftmann@24219
   938
  |> these
haftmann@24219
   939
  |> map (Thm.transfer thy);
haftmann@24219
   940
haftmann@24219
   941
in
haftmann@24219
   942
haftmann@24219
   943
fun these_funcs thy const =
haftmann@24219
   944
  let
haftmann@24219
   945
    fun drop_refl thy = filter_out (is_equal o Term.fast_term_ord o Logic.dest_equals
haftmann@24219
   946
      o ObjectLogic.drop_judgment thy o Thm.plain_prop_of);
haftmann@24219
   947
  in
haftmann@24219
   948
    get_funcs thy const
haftmann@24219
   949
    |> preprocess thy
haftmann@24219
   950
    |> drop_refl thy
haftmann@24219
   951
  end;
haftmann@24219
   952
haftmann@24423
   953
fun default_typ thy c = case default_typ_proto thy c
haftmann@26970
   954
 of SOME ty => CodeUnit.typscheme thy (c, ty)
haftmann@24423
   955
  | NONE => (case get_funcs thy c
haftmann@25597
   956
     of thm :: _ => snd (CodeUnit.head_func (AxClass.unoverload thy thm))
haftmann@26970
   957
      | [] => CodeUnit.typscheme thy (c, Sign.the_const_type thy c));
haftmann@24219
   958
haftmann@24219
   959
end; (*local*)
haftmann@24219
   960
haftmann@24219
   961
end; (*struct*)
haftmann@24219
   962
haftmann@24219
   963
haftmann@24219
   964
(** type-safe interfaces for data depedent on executable content **)
haftmann@24219
   965
haftmann@24219
   966
functor CodeDataFun(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219
   967
struct
haftmann@24219
   968
haftmann@24219
   969
type T = Data.T;
haftmann@24219
   970
exception Data of T;
haftmann@24219
   971
fun dest (Data x) = x
haftmann@24219
   972
haftmann@24219
   973
val kind = Code.declare_data (Data Data.empty)
haftmann@24219
   974
  (fn pp => fn (Data x1, Data x2) => Data (Data.merge pp (x1, x2)))
haftmann@24219
   975
  (fn thy_opt => fn cs => fn Data x => Data (Data.purge thy_opt cs x));
haftmann@24219
   976
haftmann@24219
   977
val data_op = (kind, Data, dest);
haftmann@24219
   978
haftmann@24219
   979
val get = Code.get_data data_op;
haftmann@24219
   980
val change = Code.change_data data_op;
haftmann@24219
   981
fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219
   982
haftmann@24219
   983
end;
haftmann@24219
   984
haftmann@24219
   985
structure Code : CODE =
haftmann@24219
   986
struct
haftmann@24219
   987
haftmann@24219
   988
open Code;
haftmann@24219
   989
haftmann@24219
   990
end;