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