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