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