src/Pure/Isar/code.ML
author haftmann
Wed Dec 02 17:53:35 2009 +0100 (2009-12-02 ago)
changeset 33940 317933ce3712
parent 33756 47b7c9e0bf6e
child 33972 daf65be6bfe5
child 33974 01dcd9b926bf
permissions -rw-r--r--
crude support for type aliasses and corresponding constant signatures
haftmann@24219
     1
(*  Title:      Pure/Isar/code.ML
haftmann@24219
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24219
     3
haftmann@31962
     4
Abstract executable code of theory.  Management of data dependent on
haftmann@31962
     5
executable code.  Cache assumes non-concurrent processing of a single theory.
haftmann@24219
     6
*)
haftmann@24219
     7
haftmann@24219
     8
signature CODE =
haftmann@24219
     9
sig
haftmann@31957
    10
  (*constants*)
haftmann@31957
    11
  val check_const: theory -> term -> string
haftmann@31957
    12
  val read_bare_const: theory -> string -> string * typ
haftmann@31957
    13
  val read_const: theory -> string -> string
haftmann@31962
    14
  val string_of_const: theory -> string -> string
haftmann@33940
    15
  val cert_signature: theory -> typ -> typ
haftmann@33940
    16
  val read_signature: theory -> string -> typ
haftmann@33940
    17
  val const_typ: theory -> string -> typ
haftmann@33940
    18
  val subst_signatures: theory -> term -> term
haftmann@31962
    19
  val args_number: theory -> string -> int
haftmann@31957
    20
haftmann@31156
    21
  (*constructor sets*)
haftmann@31156
    22
  val constrset_of_consts: theory -> (string * typ) list
haftmann@31156
    23
    -> string * ((string * sort) list * (string * typ list) list)
haftmann@31156
    24
haftmann@31156
    25
  (*code equations*)
haftmann@31962
    26
  val mk_eqn: theory -> thm * bool -> thm * bool
haftmann@31962
    27
  val mk_eqn_warning: theory -> thm -> (thm * bool) option
haftmann@31962
    28
  val mk_eqn_liberal: theory -> thm -> (thm * bool) option
haftmann@31156
    29
  val assert_eqn: theory -> thm * bool -> thm * bool
haftmann@31156
    30
  val assert_eqns_const: theory -> string
haftmann@31156
    31
    -> (thm * bool) list -> (thm * bool) list
haftmann@31957
    32
  val const_typ_eqn: theory -> thm -> string * typ
haftmann@31156
    33
  val typscheme_eqn: theory -> thm -> (string * sort) list * typ
haftmann@32873
    34
  val typscheme_eqns: theory -> string -> thm list -> (string * sort) list * typ
haftmann@32929
    35
  val standard_typscheme: theory -> thm list -> thm list
haftmann@31156
    36
haftmann@31962
    37
  (*executable code*)
haftmann@33940
    38
  val add_type: string -> theory -> theory
haftmann@33940
    39
  val add_type_cmd: string -> theory -> theory
haftmann@33940
    40
  val add_signature: string * typ -> theory -> theory
haftmann@33940
    41
  val add_signature_cmd: string * string -> theory -> theory
haftmann@31156
    42
  val add_datatype: (string * typ) list -> theory -> theory
haftmann@31156
    43
  val add_datatype_cmd: string list -> theory -> theory
haftmann@31156
    44
  val type_interpretation:
haftmann@31156
    45
    (string * ((string * sort) list * (string * typ list) list)
haftmann@31156
    46
      -> theory -> theory) -> theory -> theory
haftmann@28368
    47
  val add_eqn: thm -> theory -> theory
haftmann@31088
    48
  val add_nbe_eqn: thm -> theory -> theory
haftmann@28368
    49
  val add_default_eqn: thm -> theory -> theory
haftmann@28703
    50
  val add_default_eqn_attribute: attribute
haftmann@28703
    51
  val add_default_eqn_attrib: Attrib.src
haftmann@28368
    52
  val del_eqn: thm -> theory -> theory
haftmann@28368
    53
  val del_eqns: string -> theory -> theory
haftmann@24844
    54
  val add_case: thm -> theory -> theory
haftmann@24844
    55
  val add_undefined: string -> theory -> theory
haftmann@24219
    56
  val get_datatype: theory -> string -> ((string * sort) list * (string * typ list) list)
haftmann@24423
    57
  val get_datatype_of_constr: theory -> string -> string option
haftmann@31156
    58
  val these_eqns: theory -> string -> (thm * bool) list
haftmann@31642
    59
  val all_eqns: theory -> (thm * bool) list
haftmann@30023
    60
  val get_case_scheme: theory -> string -> (int * (int * string list)) option
haftmann@31890
    61
  val undefineds: theory -> string list
haftmann@24219
    62
  val print_codesetup: theory -> unit
haftmann@31957
    63
haftmann@31957
    64
  (*infrastructure*)
haftmann@31998
    65
  val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory
haftmann@31957
    66
  val purge_data: theory -> theory
haftmann@24219
    67
end;
haftmann@24219
    68
haftmann@24219
    69
signature CODE_DATA_ARGS =
haftmann@24219
    70
sig
haftmann@24219
    71
  type T
haftmann@24219
    72
  val empty: T
haftmann@27609
    73
  val purge: theory -> string list -> T -> T
haftmann@24219
    74
end;
haftmann@24219
    75
haftmann@24219
    76
signature CODE_DATA =
haftmann@24219
    77
sig
haftmann@24219
    78
  type T
haftmann@24219
    79
  val get: theory -> T
haftmann@24219
    80
  val change: theory -> (T -> T) -> T
haftmann@24219
    81
  val change_yield: theory -> (T -> 'a * T) -> 'a * T
haftmann@24219
    82
end;
haftmann@24219
    83
haftmann@24219
    84
signature PRIVATE_CODE =
haftmann@24219
    85
sig
haftmann@24219
    86
  include CODE
haftmann@27609
    87
  val declare_data: Object.T -> (theory -> string list -> Object.T -> Object.T)
haftmann@27609
    88
    -> serial
haftmann@24219
    89
  val get_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    90
    -> theory -> 'a
haftmann@24219
    91
  val change_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    92
    -> theory -> ('a -> 'a) -> 'a
haftmann@24219
    93
  val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219
    94
    -> theory -> ('a -> 'b * 'a) -> 'b * 'a
haftmann@24219
    95
end;
haftmann@24219
    96
haftmann@24219
    97
structure Code : PRIVATE_CODE =
haftmann@24219
    98
struct
haftmann@24219
    99
haftmann@31962
   100
(** auxiliary **)
haftmann@31962
   101
haftmann@31962
   102
(* printing *)
haftmann@31156
   103
wenzelm@32966
   104
fun string_of_typ thy = setmp_CRITICAL show_sorts true (Syntax.string_of_typ_global thy);
haftmann@31962
   105
haftmann@31156
   106
fun string_of_const thy c = case AxClass.inst_of_param thy c
haftmann@31156
   107
 of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco)
haftmann@31156
   108
  | NONE => Sign.extern_const thy c;
haftmann@31156
   109
haftmann@31962
   110
haftmann@31962
   111
(* constants *)
haftmann@31156
   112
haftmann@33940
   113
fun typ_equiv tys = Type.raw_instance tys andalso Type.raw_instance (swap tys);
haftmann@33940
   114
haftmann@31962
   115
fun check_bare_const thy t = case try dest_Const t
haftmann@31962
   116
 of SOME c_ty => c_ty
haftmann@31962
   117
  | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
haftmann@31156
   118
haftmann@31962
   119
fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy;
haftmann@31962
   120
haftmann@31962
   121
fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
haftmann@31962
   122
haftmann@31962
   123
fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy;
haftmann@31156
   124
haftmann@32872
   125
haftmann@31962
   126
haftmann@31962
   127
(** data store **)
haftmann@31962
   128
haftmann@31962
   129
(* code equations *)
haftmann@31962
   130
haftmann@33006
   131
type eqns = bool * (thm * bool) list;
haftmann@33006
   132
  (*default flag, theorems with proper flag *)
haftmann@31962
   133
haftmann@31962
   134
fun add_drop_redundant thy (thm, proper) thms =
haftmann@31962
   135
  let
haftmann@31962
   136
    val args_of = snd o strip_comb o map_types Type.strip_sorts
haftmann@31962
   137
      o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31962
   138
    val args = args_of thm;
haftmann@31962
   139
    val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
haftmann@31962
   140
    fun matches_args args' = length args <= length args' andalso
haftmann@31962
   141
      Pattern.matchess thy (args, (map incr_idx o curry Library.take (length args)) args');
haftmann@31962
   142
    fun drop (thm', proper') = if (proper orelse not proper')
haftmann@31962
   143
      andalso matches_args (args_of thm') then 
wenzelm@32091
   144
        (warning ("Code generator: dropping redundant code equation\n" ^
wenzelm@32091
   145
            Display.string_of_thm_global thy thm'); true)
haftmann@31962
   146
      else false;
haftmann@31962
   147
  in (thm, proper) :: filter_out drop thms end;
haftmann@31962
   148
haftmann@33006
   149
fun add_thm thy _ thm (false, thms) = (false, add_drop_redundant thy thm thms)
haftmann@33006
   150
  | add_thm thy true thm (true, thms) = (true, thms @ [thm])
haftmann@33006
   151
  | add_thm thy false thm (true, thms) = (false, [thm]);
haftmann@31962
   152
haftmann@33006
   153
fun del_thm thm = apsnd (remove (eq_fst Thm.eq_thm_prop) (thm, true));
haftmann@31962
   154
haftmann@31962
   155
haftmann@31962
   156
(* executable code data *)
haftmann@31962
   157
haftmann@31962
   158
datatype spec = Spec of {
haftmann@31962
   159
  history_concluded: bool,
haftmann@33940
   160
  signatures: int Symtab.table * typ Symtab.table,
haftmann@31962
   161
  eqns: ((bool * eqns) * (serial * eqns) list) Symtab.table
haftmann@31962
   162
    (*with explicit history*),
haftmann@31962
   163
  dtyps: ((serial * ((string * sort) list * (string * typ list) list)) list) Symtab.table
haftmann@31962
   164
    (*with explicit history*),
haftmann@31962
   165
  cases: (int * (int * string list)) Symtab.table * unit Symtab.table
haftmann@31962
   166
};
haftmann@31962
   167
haftmann@33940
   168
fun make_spec (history_concluded, ((signatures, eqns), (dtyps, cases))) =
haftmann@33940
   169
  Spec { history_concluded = history_concluded,
haftmann@33940
   170
    signatures = signatures, eqns = eqns, dtyps = dtyps, cases = cases };
haftmann@33940
   171
fun map_spec f (Spec { history_concluded = history_concluded, signatures = signatures,
haftmann@33940
   172
  eqns = eqns, dtyps = dtyps, cases = cases }) =
haftmann@33940
   173
  make_spec (f (history_concluded, ((signatures, eqns), (dtyps, cases))));
haftmann@33940
   174
fun merge_spec (Spec { history_concluded = _, signatures = (tycos1, sigs1), eqns = eqns1,
haftmann@31962
   175
    dtyps = dtyps1, cases = (cases1, undefs1) },
haftmann@33940
   176
  Spec { history_concluded = _, signatures = (tycos2, sigs2), eqns = eqns2,
haftmann@31962
   177
    dtyps = dtyps2, cases = (cases2, undefs2) }) =
haftmann@31156
   178
  let
haftmann@33940
   179
    val signatures = (Symtab.merge (op =) (tycos1, tycos2),
haftmann@33940
   180
      Symtab.merge typ_equiv (sigs1, sigs2));
haftmann@31962
   181
    fun merge_eqns ((_, history1), (_, history2)) =
haftmann@31962
   182
      let
haftmann@31962
   183
        val raw_history = AList.merge (op = : serial * serial -> bool)
haftmann@31962
   184
          (K true) (history1, history2)
haftmann@31962
   185
        val filtered_history = filter_out (fst o snd) raw_history
haftmann@31962
   186
        val history = if null filtered_history
haftmann@31962
   187
          then raw_history else filtered_history;
haftmann@31962
   188
      in ((false, (snd o hd) history), history) end;
haftmann@31962
   189
    val eqns = Symtab.join (K merge_eqns) (eqns1, eqns2);
haftmann@31962
   190
    val dtyps = Symtab.join (K (AList.merge (op =) (K true))) (dtyps1, dtyps2);
haftmann@31962
   191
    val cases = (Symtab.merge (K true) (cases1, cases2),
haftmann@31962
   192
      Symtab.merge (K true) (undefs1, undefs2));
haftmann@33940
   193
  in make_spec (false, ((signatures, eqns), (dtyps, cases))) end;
haftmann@31962
   194
haftmann@31962
   195
fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
haftmann@33940
   196
fun the_signatures (Spec { signatures, ... }) = signatures;
haftmann@31962
   197
fun the_eqns (Spec { eqns, ... }) = eqns;
haftmann@31962
   198
fun the_dtyps (Spec { dtyps, ... }) = dtyps;
haftmann@31962
   199
fun the_cases (Spec { cases, ... }) = cases;
haftmann@32544
   200
val map_history_concluded = map_spec o apfst;
haftmann@33940
   201
val map_signatures = map_spec o apsnd o apfst o apfst;
haftmann@33940
   202
val map_eqns = map_spec o apsnd o apfst o apsnd;
haftmann@31962
   203
val map_dtyps = map_spec o apsnd o apsnd o apfst;
haftmann@31962
   204
val map_cases = map_spec o apsnd o apsnd o apsnd;
haftmann@31962
   205
haftmann@31962
   206
haftmann@31962
   207
(* data slots dependent on executable code *)
haftmann@31962
   208
haftmann@31962
   209
(*private copy avoids potential conflict of table exceptions*)
wenzelm@31971
   210
structure Datatab = Table(type key = int val ord = int_ord);
haftmann@31962
   211
haftmann@31962
   212
local
haftmann@31962
   213
haftmann@31962
   214
type kind = {
haftmann@31962
   215
  empty: Object.T,
haftmann@31962
   216
  purge: theory -> string list -> Object.T -> Object.T
haftmann@31962
   217
};
haftmann@31962
   218
wenzelm@32738
   219
val kinds = Unsynchronized.ref (Datatab.empty: kind Datatab.table);
wenzelm@32738
   220
val kind_keys = Unsynchronized.ref ([]: serial list);
haftmann@31962
   221
haftmann@31962
   222
fun invoke f k = case Datatab.lookup (! kinds) k
haftmann@31962
   223
 of SOME kind => f kind
haftmann@31962
   224
  | NONE => sys_error "Invalid code data identifier";
haftmann@31962
   225
haftmann@31962
   226
in
haftmann@31962
   227
haftmann@31962
   228
fun declare_data empty purge =
haftmann@31962
   229
  let
haftmann@31962
   230
    val k = serial ();
haftmann@31962
   231
    val kind = {empty = empty, purge = purge};
wenzelm@32738
   232
    val _ = Unsynchronized.change kinds (Datatab.update (k, kind));
wenzelm@32738
   233
    val _ = Unsynchronized.change kind_keys (cons k);
haftmann@31962
   234
  in k end;
haftmann@31962
   235
haftmann@31962
   236
fun invoke_init k = invoke (fn kind => #empty kind) k;
haftmann@31962
   237
haftmann@31962
   238
fun invoke_purge_all thy cs =
haftmann@31962
   239
  fold (fn k => Datatab.map_entry k
haftmann@31962
   240
    (invoke (fn kind => #purge kind thy cs) k)) (! kind_keys);
haftmann@31962
   241
haftmann@31962
   242
end; (*local*)
haftmann@31962
   243
haftmann@31962
   244
haftmann@31962
   245
(* theory store *)
haftmann@31962
   246
haftmann@31962
   247
local
haftmann@31962
   248
haftmann@31962
   249
type data = Object.T Datatab.table;
haftmann@31962
   250
val empty_data = Datatab.empty : data;
haftmann@31962
   251
haftmann@31962
   252
structure Code_Data = TheoryDataFun
haftmann@31962
   253
(
wenzelm@32738
   254
  type T = spec * data Unsynchronized.ref;
haftmann@33940
   255
  val empty = (make_spec (false, (((Symtab.empty, Symtab.empty), Symtab.empty),
haftmann@33940
   256
    (Symtab.empty, (Symtab.empty, Symtab.empty)))), Unsynchronized.ref empty_data);
wenzelm@32738
   257
  fun copy (spec, data) = (spec, Unsynchronized.ref (! data));
haftmann@31962
   258
  val extend = copy;
haftmann@33940
   259
  fun merge _ ((spec1, data1), (spec2, data2)) =
wenzelm@32738
   260
    (merge_spec (spec1, spec2), Unsynchronized.ref empty_data);
haftmann@31962
   261
);
haftmann@31962
   262
haftmann@31962
   263
fun thy_data f thy = f ((snd o Code_Data.get) thy);
haftmann@31962
   264
haftmann@31962
   265
fun get_ensure_init kind data_ref =
haftmann@31962
   266
  case Datatab.lookup (! data_ref) kind
haftmann@31962
   267
   of SOME x => x
haftmann@31962
   268
    | NONE => let val y = invoke_init kind
wenzelm@32738
   269
        in (Unsynchronized.change data_ref (Datatab.update (kind, y)); y) end;
haftmann@31962
   270
haftmann@31962
   271
in
haftmann@31962
   272
haftmann@31962
   273
(* access to executable code *)
haftmann@31962
   274
haftmann@31962
   275
val the_exec = fst o Code_Data.get;
haftmann@31962
   276
haftmann@31962
   277
fun complete_class_params thy cs =
haftmann@31962
   278
  fold (fn c => case AxClass.inst_of_param thy c
haftmann@31962
   279
   of NONE => insert (op =) c
haftmann@31962
   280
    | SOME (c', _) => insert (op =) c' #> insert (op =) c) cs [];
haftmann@31962
   281
haftmann@31962
   282
fun map_exec_purge touched f thy =
wenzelm@32738
   283
  Code_Data.map (fn (exec, data) => (f exec, Unsynchronized.ref (case touched
haftmann@31962
   284
   of SOME cs => invoke_purge_all thy (complete_class_params thy cs) (! data)
haftmann@31962
   285
    | NONE => empty_data))) thy;
haftmann@31962
   286
haftmann@33708
   287
val purge_data = (Code_Data.map o apsnd) (fn _ => Unsynchronized.ref empty_data);
haftmann@31962
   288
haftmann@31962
   289
fun change_eqns delete c f = (map_exec_purge (SOME [c]) o map_eqns
haftmann@33006
   290
  o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, (true, [])), [])))
haftmann@31962
   291
    o apfst) (fn (_, eqns) => (true, f eqns));
haftmann@31962
   292
haftmann@33006
   293
fun del_eqns c = change_eqns true c (K (false, []));
haftmann@31962
   294
haftmann@31962
   295
haftmann@31962
   296
(* tackling equation history *)
haftmann@31962
   297
haftmann@31962
   298
fun get_eqns thy c =
haftmann@31962
   299
  Symtab.lookup ((the_eqns o the_exec) thy) c
haftmann@33006
   300
  |> Option.map (snd o snd o fst)
haftmann@31962
   301
  |> these;
haftmann@31962
   302
haftmann@31962
   303
fun continue_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   304
  then thy
haftmann@31962
   305
    |> (Code_Data.map o apfst o map_history_concluded) (K false)
haftmann@31962
   306
    |> SOME
haftmann@31962
   307
  else NONE;
haftmann@31962
   308
haftmann@31962
   309
fun conclude_history thy = if (history_concluded o the_exec) thy
haftmann@31962
   310
  then NONE
haftmann@31962
   311
  else thy
haftmann@31962
   312
    |> (Code_Data.map o apfst)
haftmann@31962
   313
        ((map_eqns o Symtab.map) (fn ((changed, current), history) =>
haftmann@31962
   314
          ((false, current),
haftmann@31962
   315
            if changed then (serial (), current) :: history else history))
haftmann@31962
   316
        #> map_history_concluded (K true))
haftmann@31962
   317
    |> SOME;
haftmann@31962
   318
haftmann@31962
   319
val _ = Context.>> (Context.map_theory (Code_Data.init
haftmann@31962
   320
  #> Theory.at_begin continue_history
haftmann@31962
   321
  #> Theory.at_end conclude_history));
haftmann@31962
   322
haftmann@31962
   323
haftmann@31962
   324
(* access to data dependent on abstract executable code *)
haftmann@31962
   325
haftmann@31962
   326
fun get_data (kind, _, dest) = thy_data (get_ensure_init kind #> dest);
haftmann@31962
   327
haftmann@31962
   328
fun change_data (kind, mk, dest) =
haftmann@31962
   329
  let
haftmann@31962
   330
    fun chnge data_ref f =
haftmann@31962
   331
      let
haftmann@31962
   332
        val data = get_ensure_init kind data_ref;
haftmann@31962
   333
        val data' = f (dest data);
wenzelm@32738
   334
      in (Unsynchronized.change data_ref (Datatab.update (kind, mk data')); data') end;
haftmann@31962
   335
  in thy_data chnge end;
haftmann@31962
   336
haftmann@31962
   337
fun change_yield_data (kind, mk, dest) =
haftmann@31962
   338
  let
haftmann@31962
   339
    fun chnge data_ref f =
haftmann@31962
   340
      let
haftmann@31962
   341
        val data = get_ensure_init kind data_ref;
haftmann@31962
   342
        val (x, data') = f (dest data);
wenzelm@32738
   343
      in (x, (Unsynchronized.change data_ref (Datatab.update (kind, mk data')); data')) end;
haftmann@31962
   344
  in thy_data chnge end;
haftmann@31962
   345
haftmann@31962
   346
end; (*local*)
haftmann@31962
   347
haftmann@31962
   348
haftmann@31962
   349
(** foundation **)
haftmann@31962
   350
haftmann@31962
   351
(* constants *)
haftmann@31962
   352
haftmann@33940
   353
fun arity_number thy tyco = case Symtab.lookup ((fst o the_signatures o the_exec) thy) tyco
haftmann@33940
   354
 of SOME n => n
haftmann@33940
   355
  | NONE => Sign.arity_number thy tyco;
haftmann@33940
   356
haftmann@33940
   357
fun build_tsig thy =
haftmann@33940
   358
  let
haftmann@33940
   359
    val (tycos, _) = (the_signatures o the_exec) thy;
haftmann@33940
   360
    val decls = (#types o Type.rep_tsig o Sign.tsig_of) thy
haftmann@33940
   361
      |> apsnd (Symtab.fold (fn (tyco, n) =>
haftmann@33940
   362
          Symtab.update (tyco, Type.LogicalType n)) tycos);
haftmann@33940
   363
  in Type.build_tsig ((Name_Space.empty "", Sorts.empty_algebra), [], decls) end;
haftmann@33940
   364
haftmann@33940
   365
fun cert_signature thy = Logic.varifyT o Type.cert_typ (build_tsig thy) o Type.no_tvars;
haftmann@33940
   366
haftmann@33940
   367
fun read_signature thy = cert_signature thy o Type.strip_sorts
haftmann@33940
   368
  o Syntax.parse_typ (ProofContext.init thy);
haftmann@33940
   369
haftmann@33940
   370
fun expand_signature thy = Type.cert_typ_mode Type.mode_syntax (Sign.tsig_of thy);
haftmann@33940
   371
haftmann@33940
   372
fun lookup_typ thy = Symtab.lookup ((snd o the_signatures o the_exec) thy);
haftmann@33940
   373
haftmann@33940
   374
fun const_typ thy c = case lookup_typ thy c
haftmann@33940
   375
 of SOME ty => ty
haftmann@33940
   376
  | NONE => (Type.strip_sorts o Sign.the_const_type thy) c;
haftmann@33940
   377
haftmann@33940
   378
fun subst_signature thy c ty =
haftmann@33940
   379
  let
haftmann@33940
   380
    fun mk_subst (Type (tyco, tys1)) (ty2 as Type (tyco2, tys2)) =
haftmann@33940
   381
          fold2 mk_subst tys1 tys2
haftmann@33940
   382
      | mk_subst ty (TVar (v, sort)) = Vartab.update (v, ([], ty))
haftmann@33940
   383
  in case lookup_typ thy c
haftmann@33940
   384
   of SOME ty' => Envir.subst_type (mk_subst ty (expand_signature thy ty') Vartab.empty) ty'
haftmann@33940
   385
    | NONE => ty
haftmann@33940
   386
  end;
haftmann@33940
   387
haftmann@33940
   388
fun subst_signatures thy = map_aterms (fn Const (c, ty) => Const (c, subst_signature thy c ty) | t => t);
haftmann@33940
   389
haftmann@33940
   390
fun args_number thy = length o fst o strip_type o const_typ thy;
haftmann@31962
   391
haftmann@31962
   392
haftmann@31962
   393
(* datatypes *)
haftmann@31156
   394
haftmann@31156
   395
fun constrset_of_consts thy cs =
haftmann@31156
   396
  let
haftmann@31156
   397
    val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
haftmann@31156
   398
      then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
haftmann@33531
   399
    fun no_constr s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c
haftmann@33531
   400
      ^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s);
haftmann@31156
   401
    fun last_typ c_ty ty =
haftmann@31156
   402
      let
haftmann@33531
   403
        val tfrees = Term.add_tfreesT ty [];
haftmann@31156
   404
        val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty
haftmann@33531
   405
          handle TYPE _ => no_constr "bad type" c_ty
haftmann@33531
   406
        val _ = if has_duplicates (eq_fst (op =)) vs
haftmann@33531
   407
          then no_constr "duplicate type variables in datatype" c_ty else ();
haftmann@33531
   408
        val _ = if length tfrees <> length vs
haftmann@33531
   409
          then no_constr "type variables missing in datatype" c_ty else ();
haftmann@31156
   410
      in (tyco, vs) end;
haftmann@33940
   411
    fun ty_sorts (c, raw_ty) =
haftmann@31156
   412
      let
haftmann@33940
   413
        val ty = subst_signature thy c raw_ty;
haftmann@33940
   414
        val ty_decl = (Logic.unvarifyT o const_typ thy) c;
haftmann@31156
   415
        val (tyco, _) = last_typ (c, ty) ty_decl;
haftmann@31156
   416
        val (_, vs) = last_typ (c, ty) ty;
haftmann@31156
   417
      in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
haftmann@31156
   418
    fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
haftmann@31156
   419
      let
haftmann@31998
   420
        val _ = if (tyco' : string) <> tyco
haftmann@31156
   421
          then error "Different type constructors in constructor set"
haftmann@31156
   422
          else ();
haftmann@31156
   423
        val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
haftmann@31156
   424
      in ((tyco, sorts), c :: cs) end;
haftmann@31156
   425
    fun inst vs' (c, (vs, ty)) =
haftmann@31156
   426
      let
haftmann@31156
   427
        val the_v = the o AList.lookup (op =) (vs ~~ vs');
haftmann@31156
   428
        val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty;
haftmann@31156
   429
      in (c, (fst o strip_type) ty') end;
haftmann@31156
   430
    val c' :: cs' = map ty_sorts cs;
haftmann@31156
   431
    val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
haftmann@31156
   432
    val vs = Name.names Name.context Name.aT sorts;
haftmann@31156
   433
    val cs''' = map (inst vs) cs'';
haftmann@31156
   434
  in (tyco, (vs, rev cs''')) end;
haftmann@31156
   435
haftmann@31962
   436
fun get_datatype thy tyco =
haftmann@31962
   437
  case these (Symtab.lookup ((the_dtyps o the_exec) thy) tyco)
haftmann@31962
   438
   of (_, spec) :: _ => spec
haftmann@33940
   439
    | [] => arity_number thy tyco
haftmann@31962
   440
        |> Name.invents Name.context Name.aT
haftmann@31962
   441
        |> map (rpair [])
haftmann@31962
   442
        |> rpair [];
haftmann@31962
   443
haftmann@31962
   444
fun get_datatype_of_constr thy c =
haftmann@33940
   445
  case (snd o strip_type o const_typ thy) c
haftmann@31962
   446
   of Type (tyco, _) => if member (op =) ((map fst o snd o get_datatype thy) tyco) c
haftmann@31962
   447
       then SOME tyco else NONE
haftmann@31962
   448
    | _ => NONE;
haftmann@31962
   449
haftmann@31962
   450
fun is_constr thy = is_some o get_datatype_of_constr thy;
haftmann@31962
   451
haftmann@31156
   452
haftmann@31156
   453
(* code equations *)
haftmann@31156
   454
haftmann@31156
   455
exception BAD_THM of string;
haftmann@31156
   456
fun bad_thm msg = raise BAD_THM msg;
haftmann@31156
   457
fun error_thm f thm = f thm handle BAD_THM msg => error msg;
haftmann@31642
   458
fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
haftmann@31156
   459
fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
haftmann@31156
   460
haftmann@31156
   461
fun is_linear thm =
haftmann@31156
   462
  let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@31156
   463
  in not (has_duplicates (op =) ((fold o fold_aterms)
haftmann@31156
   464
    (fn Var (v, _) => cons v | _ => I) args [])) end;
haftmann@31156
   465
haftmann@31962
   466
fun gen_assert_eqn thy is_constr_pat (thm, proper) =
haftmann@31156
   467
  let
haftmann@31156
   468
    val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
wenzelm@32091
   469
      handle TERM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm_global thy thm)
wenzelm@32091
   470
           | THM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm_global thy thm);
haftmann@31156
   471
    fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
haftmann@31156
   472
      | Free _ => bad_thm ("Illegal free variable in equation\n"
wenzelm@32091
   473
          ^ Display.string_of_thm_global thy thm)
haftmann@31156
   474
      | _ => I) t [];
haftmann@31156
   475
    fun tvars_of t = fold_term_types (fn _ =>
haftmann@31156
   476
      fold_atyps (fn TVar (v, _) => insert (op =) v
haftmann@31156
   477
        | TFree _ => bad_thm 
wenzelm@32091
   478
      ("Illegal free type variable in equation\n" ^ Display.string_of_thm_global thy thm))) t [];
haftmann@31156
   479
    val lhs_vs = vars_of lhs;
haftmann@31156
   480
    val rhs_vs = vars_of rhs;
haftmann@31156
   481
    val lhs_tvs = tvars_of lhs;
haftmann@31156
   482
    val rhs_tvs = tvars_of rhs;
haftmann@31156
   483
    val _ = if null (subtract (op =) lhs_vs rhs_vs)
haftmann@31156
   484
      then ()
haftmann@31156
   485
      else bad_thm ("Free variables on right hand side of equation\n"
wenzelm@32091
   486
        ^ Display.string_of_thm_global thy thm);
haftmann@31156
   487
    val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
haftmann@31156
   488
      then ()
haftmann@31156
   489
      else bad_thm ("Free type variables on right hand side of equation\n"
wenzelm@32091
   490
        ^ Display.string_of_thm_global thy thm)
wenzelm@32091
   491
    val (head, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@31156
   492
    val (c, ty) = case head
haftmann@31156
   493
     of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
wenzelm@32091
   494
      | _ => bad_thm ("Equation not headed by constant\n" ^ Display.string_of_thm_global thy thm);
haftmann@31156
   495
    fun check _ (Abs _) = bad_thm
haftmann@31156
   496
          ("Abstraction on left hand side of equation\n"
wenzelm@32091
   497
            ^ Display.string_of_thm_global thy thm)
haftmann@31156
   498
      | check 0 (Var _) = ()
haftmann@31156
   499
      | check _ (Var _) = bad_thm
haftmann@31156
   500
          ("Variable with application on left hand side of equation\n"
wenzelm@32091
   501
            ^ Display.string_of_thm_global thy thm)
haftmann@31156
   502
      | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
haftmann@33940
   503
      | check n (Const (c_ty as (_, ty))) =
haftmann@33940
   504
          let
haftmann@33940
   505
            val c' = AxClass.unoverload_const thy c_ty
haftmann@33940
   506
          in if n = (length o fst o strip_type o subst_signature thy c') ty
haftmann@33940
   507
            then if not proper orelse is_constr_pat c'
haftmann@33940
   508
              then ()
haftmann@33940
   509
              else bad_thm (quote c ^ " is not a constructor, on left hand side of equation\n"
haftmann@33940
   510
                ^ Display.string_of_thm_global thy thm)
haftmann@33940
   511
            else bad_thm
haftmann@33940
   512
              ("Partially applied constant " ^ quote c ^ " on left hand side of equation\n"
haftmann@33940
   513
                 ^ Display.string_of_thm_global thy thm)
haftmann@33940
   514
          end;
haftmann@31156
   515
    val _ = map (check 0) args;
haftmann@31156
   516
    val _ = if not proper orelse is_linear thm then ()
haftmann@31156
   517
      else bad_thm ("Duplicate variables on left hand side of equation\n"
wenzelm@32091
   518
        ^ Display.string_of_thm_global thy thm);
haftmann@31156
   519
    val _ = if (is_none o AxClass.class_of_param thy) c
haftmann@31156
   520
      then ()
haftmann@33940
   521
      else bad_thm ("Overloaded constant as head in equation\n"
wenzelm@32091
   522
        ^ Display.string_of_thm_global thy thm)
haftmann@31962
   523
    val _ = if not (is_constr thy c)
haftmann@31156
   524
      then ()
haftmann@31156
   525
      else bad_thm ("Constructor as head in equation\n"
wenzelm@32091
   526
        ^ Display.string_of_thm_global thy thm)
haftmann@31156
   527
    val ty_decl = Sign.the_const_type thy c;
haftmann@31156
   528
    val _ = if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty)
haftmann@31156
   529
      then () else bad_thm ("Type\n" ^ string_of_typ thy ty
haftmann@31156
   530
           ^ "\nof equation\n"
wenzelm@32091
   531
           ^ Display.string_of_thm_global thy thm
haftmann@31156
   532
           ^ "\nis incompatible with declared function type\n"
haftmann@31156
   533
           ^ string_of_typ thy ty_decl)
haftmann@31156
   534
  in (thm, proper) end;
haftmann@31156
   535
haftmann@31962
   536
fun assert_eqn thy = error_thm (gen_assert_eqn thy (is_constr thy));
haftmann@31962
   537
haftmann@31962
   538
fun meta_rewrite thy = LocalDefs.meta_rewrite_rule (ProofContext.init thy);
haftmann@31156
   539
haftmann@31962
   540
fun mk_eqn thy = error_thm (gen_assert_eqn thy (K true)) o
haftmann@31962
   541
  apfst (meta_rewrite thy);
haftmann@31962
   542
haftmann@31962
   543
fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962
   544
  o warning_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31962
   545
haftmann@31962
   546
fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962
   547
  o try_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31156
   548
haftmann@33940
   549
val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31156
   550
haftmann@31957
   551
fun const_typ_eqn thy thm =
haftmann@31156
   552
  let
haftmann@32640
   553
    val (c, ty) = head_eqn thm;
haftmann@31156
   554
    val c' = AxClass.unoverload_const thy (c, ty);
haftmann@33940
   555
      (*permissive wrt. to overloaded constants!*)
haftmann@31156
   556
  in (c', ty) end;
haftmann@33940
   557
haftmann@31957
   558
fun const_eqn thy = fst o const_typ_eqn thy;
haftmann@31156
   559
haftmann@33940
   560
fun raw_typscheme thy (c, ty) =
haftmann@32873
   561
  (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
haftmann@33940
   562
haftmann@33940
   563
fun typscheme thy (c, ty) = raw_typscheme thy (c, subst_signature thy c ty);
haftmann@33940
   564
haftmann@32873
   565
fun typscheme_eqn thy = typscheme thy o apsnd Logic.unvarifyT o const_typ_eqn thy;
haftmann@33940
   566
haftmann@32873
   567
fun typscheme_eqns thy c [] = 
haftmann@32873
   568
      let
haftmann@33940
   569
        val raw_ty = const_typ thy c;
haftmann@32873
   570
        val tvars = Term.add_tvar_namesT raw_ty [];
haftmann@32873
   571
        val tvars' = case AxClass.class_of_param thy c
haftmann@32873
   572
         of SOME class => [TFree (Name.aT, [class])]
haftmann@32873
   573
          | NONE => Name.invent_list [] Name.aT (length tvars)
haftmann@32873
   574
              |> map (fn v => TFree (v, []));
haftmann@32873
   575
        val ty = typ_subst_TVars (tvars ~~ tvars') raw_ty;
haftmann@33940
   576
      in raw_typscheme thy (c, ty) end
haftmann@32873
   577
  | typscheme_eqns thy c (thms as thm :: _) = typscheme_eqn thy thm;
haftmann@32872
   578
haftmann@31962
   579
fun assert_eqns_const thy c eqns =
haftmann@31962
   580
  let
haftmann@31962
   581
    fun cert (eqn as (thm, _)) = if c = const_eqn thy thm
haftmann@31962
   582
      then eqn else error ("Wrong head of code equation,\nexpected constant "
wenzelm@32091
   583
        ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)
haftmann@31962
   584
  in map (cert o assert_eqn thy) eqns end;
haftmann@31156
   585
haftmann@32929
   586
fun standard_typscheme thy thms =
haftmann@32354
   587
  let
haftmann@32640
   588
    fun tvars_of T = rev (Term.add_tvarsT T []);
haftmann@32640
   589
    val vss = map (tvars_of o snd o head_eqn) thms;
haftmann@32354
   590
    fun inter_sorts vs =
haftmann@32354
   591
      fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
haftmann@32354
   592
    val sorts = map_transpose inter_sorts vss;
haftmann@32873
   593
    val vts = Name.names Name.context Name.aT sorts
haftmann@32354
   594
      |> map (fn (v, sort) => TVar ((v, 0), sort));
haftmann@32354
   595
  in map2 (fn vs => Thm.certify_instantiate (vs ~~ vts, [])) vss thms end;
haftmann@31962
   596
haftmann@31962
   597
fun these_eqns thy c =
haftmann@31962
   598
  get_eqns thy c
haftmann@31962
   599
  |> (map o apfst) (Thm.transfer thy)
haftmann@32929
   600
  |> burrow_fst (standard_typscheme thy);
haftmann@31962
   601
haftmann@31962
   602
fun all_eqns thy =
haftmann@31962
   603
  Symtab.dest ((the_eqns o the_exec) thy)
haftmann@33006
   604
  |> maps (snd o snd o fst o snd);
haftmann@31962
   605
haftmann@31962
   606
haftmann@31962
   607
(* cases *)
haftmann@31156
   608
haftmann@31156
   609
fun case_certificate thm =
haftmann@31156
   610
  let
haftmann@31156
   611
    val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
haftmann@32640
   612
      o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
haftmann@31156
   613
    val _ = case head of Free _ => true
haftmann@31156
   614
      | Var _ => true
haftmann@31156
   615
      | _ => raise TERM ("case_cert", []);
haftmann@31156
   616
    val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
haftmann@31156
   617
    val (Const (case_const, _), raw_params) = strip_comb case_expr;
haftmann@31156
   618
    val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
haftmann@31156
   619
    val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
haftmann@31156
   620
    val params = map (fst o dest_Var) (nth_drop n raw_params);
haftmann@31156
   621
    fun dest_case t =
haftmann@31156
   622
      let
haftmann@31156
   623
        val (head' $ t_co, rhs) = Logic.dest_equals t;
haftmann@31156
   624
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   625
        val (Const (co, _), args) = strip_comb t_co;
haftmann@31156
   626
        val (Var (param, _), args') = strip_comb rhs;
haftmann@31156
   627
        val _ = if args' = args then () else raise TERM ("case_cert", []);
haftmann@31156
   628
      in (param, co) end;
haftmann@31156
   629
    fun analyze_cases cases =
haftmann@31156
   630
      let
haftmann@31156
   631
        val co_list = fold (AList.update (op =) o dest_case) cases [];
haftmann@31156
   632
      in map (the o AList.lookup (op =) co_list) params end;
haftmann@31156
   633
    fun analyze_let t =
haftmann@31156
   634
      let
haftmann@31156
   635
        val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
haftmann@31156
   636
        val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156
   637
        val _ = if arg' = arg then () else raise TERM ("case_cert", []);
haftmann@31156
   638
        val _ = if [param'] = params then () else raise TERM ("case_cert", []);
haftmann@31156
   639
      in [] end;
haftmann@31156
   640
    fun analyze (cases as [let_case]) =
haftmann@31156
   641
          (analyze_cases cases handle Bind => analyze_let let_case)
haftmann@31156
   642
      | analyze cases = analyze_cases cases;
haftmann@31156
   643
  in (case_const, (n, analyze cases)) end;
haftmann@31156
   644
haftmann@31156
   645
fun case_cert thm = case_certificate thm
haftmann@31156
   646
  handle Bind => error "bad case certificate"
haftmann@31156
   647
       | TERM _ => error "bad case certificate";
haftmann@31156
   648
haftmann@31962
   649
fun get_case_scheme thy = Symtab.lookup ((fst o the_cases o the_exec) thy);
haftmann@24219
   650
haftmann@31962
   651
val undefineds = Symtab.keys o snd o the_cases o the_exec;
haftmann@24219
   652
haftmann@24219
   653
haftmann@31962
   654
(* diagnostic *)
haftmann@24219
   655
haftmann@24219
   656
fun print_codesetup thy =
haftmann@24219
   657
  let
haftmann@24219
   658
    val ctxt = ProofContext.init thy;
haftmann@24844
   659
    val exec = the_exec thy;
haftmann@33006
   660
    fun pretty_eqns (s, (_, eqns)) =
haftmann@24219
   661
      (Pretty.block o Pretty.fbreaks) (
haftmann@33006
   662
        Pretty.str s :: map (Display.pretty_thm ctxt o fst) eqns
haftmann@24219
   663
      );
haftmann@24219
   664
    fun pretty_dtyp (s, []) =
haftmann@24219
   665
          Pretty.str s
haftmann@24219
   666
      | pretty_dtyp (s, cos) =
haftmann@24219
   667
          (Pretty.block o Pretty.breaks) (
haftmann@24219
   668
            Pretty.str s
haftmann@24219
   669
            :: Pretty.str "="
haftmann@31156
   670
            :: separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
haftmann@24219
   671
                 | (c, tys) =>
haftmann@24219
   672
                     (Pretty.block o Pretty.breaks)
haftmann@31156
   673
                        (Pretty.str (string_of_const thy c)
wenzelm@26947
   674
                          :: Pretty.str "of"
wenzelm@26947
   675
                          :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@24219
   676
          );
haftmann@28368
   677
    val eqns = the_eqns exec
haftmann@24423
   678
      |> Symtab.dest
haftmann@31156
   679
      |> (map o apfst) (string_of_const thy)
haftmann@28695
   680
      |> (map o apsnd) (snd o fst)
haftmann@24219
   681
      |> sort (string_ord o pairself fst);
haftmann@24219
   682
    val dtyps = the_dtyps exec
haftmann@24219
   683
      |> Symtab.dest
haftmann@28695
   684
      |> map (fn (dtco, (_, (vs, cos)) :: _) =>
haftmann@31957
   685
          (string_of_typ thy (Type (dtco, map TFree vs)), cos))
haftmann@24219
   686
      |> sort (string_ord o pairself fst)
haftmann@24219
   687
  in
haftmann@24219
   688
    (Pretty.writeln o Pretty.chunks) [
haftmann@24219
   689
      Pretty.block (
haftmann@30023
   690
        Pretty.str "code equations:"
haftmann@24219
   691
        :: Pretty.fbrk
haftmann@33006
   692
        :: (Pretty.fbreaks o map pretty_eqns) eqns
haftmann@24219
   693
      ),
haftmann@25968
   694
      Pretty.block (
haftmann@24219
   695
        Pretty.str "datatypes:"
haftmann@24219
   696
        :: Pretty.fbrk
haftmann@24219
   697
        :: (Pretty.fbreaks o map pretty_dtyp) dtyps
haftmann@24219
   698
      )
haftmann@24219
   699
    ]
haftmann@24219
   700
  end;
haftmann@24219
   701
haftmann@24219
   702
haftmann@31962
   703
(** declaring executable ingredients **)
haftmann@31962
   704
haftmann@33940
   705
(* constant signatures *)
haftmann@33940
   706
haftmann@33940
   707
fun add_type tyco thy =
haftmann@33940
   708
  case Symtab.lookup ((snd o #types o Type.rep_tsig o Sign.tsig_of) thy) tyco
haftmann@33940
   709
   of SOME (Type.Abbreviation (vs, _, _)) =>
haftmann@33940
   710
          (map_exec_purge NONE o map_signatures o apfst)
haftmann@33940
   711
            (Symtab.update (tyco, length vs)) thy
haftmann@33940
   712
    | _ => error ("No such type abbreviation: " ^ quote tyco);
haftmann@33940
   713
haftmann@33940
   714
fun add_type_cmd s thy = add_type (Sign.intern_type thy s) thy;
haftmann@33940
   715
haftmann@33940
   716
fun gen_add_signature prep_const prep_signature (raw_c, raw_ty) thy =
haftmann@33940
   717
  let
haftmann@33940
   718
    val c = prep_const thy raw_c;
haftmann@33940
   719
    val ty = prep_signature thy raw_ty;
haftmann@33940
   720
    val ty' = expand_signature thy ty;
haftmann@33940
   721
    val ty'' = Sign.the_const_type thy c;
haftmann@33940
   722
    val _ = if typ_equiv (ty', ty'') then () else
haftmann@33940
   723
      error ("Illegal constant signature: " ^ Syntax.string_of_typ_global thy ty);
haftmann@33940
   724
  in
haftmann@33940
   725
    thy
haftmann@33940
   726
    |> (map_exec_purge NONE o map_signatures o apsnd) (Symtab.update (c, ty))
haftmann@33940
   727
  end;
haftmann@33940
   728
haftmann@33940
   729
val add_signature = gen_add_signature (K I) cert_signature;
haftmann@33940
   730
val add_signature_cmd = gen_add_signature read_const read_signature;
haftmann@33940
   731
haftmann@33940
   732
haftmann@31962
   733
(* datatypes *)
haftmann@31090
   734
wenzelm@33314
   735
structure Type_Interpretation =
wenzelm@33314
   736
  Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@25462
   737
haftmann@24423
   738
fun add_datatype raw_cs thy =
haftmann@24219
   739
  let
haftmann@25597
   740
    val cs = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) raw_cs;
haftmann@31156
   741
    val (tyco, vs_cos) = constrset_of_consts thy cs;
haftmann@30076
   742
    val old_cs = (map fst o snd o get_datatype thy) tyco;
haftmann@30076
   743
    fun drop_outdated_cases cases = fold Symtab.delete_safe
haftmann@30076
   744
      (Symtab.fold (fn (c, (_, (_, cos))) =>
haftmann@30076
   745
        if exists (member (op =) old_cs) cos
haftmann@30076
   746
          then insert (op =) c else I) cases []) cases;
haftmann@24219
   747
  in
haftmann@24219
   748
    thy
haftmann@31091
   749
    |> fold (del_eqns o fst) cs
haftmann@28703
   750
    |> map_exec_purge NONE
haftmann@28695
   751
        ((map_dtyps o Symtab.map_default (tyco, [])) (cons (serial (), vs_cos))
haftmann@30076
   752
        #> (map_cases o apfst) drop_outdated_cases)
haftmann@31962
   753
    |> Type_Interpretation.data (tyco, serial ())
haftmann@24219
   754
  end;
haftmann@24219
   755
haftmann@31962
   756
fun type_interpretation f =  Type_Interpretation.interpretation
haftmann@25485
   757
  (fn (tyco, _) => fn thy => f (tyco, get_datatype thy tyco) thy);
haftmann@25485
   758
haftmann@24423
   759
fun add_datatype_cmd raw_cs thy =
haftmann@24423
   760
  let
haftmann@31156
   761
    val cs = map (read_bare_const thy) raw_cs;
haftmann@24423
   762
  in add_datatype cs thy end;
haftmann@24219
   763
haftmann@31962
   764
haftmann@31962
   765
(* code equations *)
haftmann@31962
   766
haftmann@33075
   767
fun gen_add_eqn default (thm, proper) thy =
haftmann@33075
   768
  let
haftmann@33075
   769
    val thm' = Thm.close_derivation thm;
haftmann@33075
   770
    val c = const_eqn thy thm';
haftmann@33075
   771
  in change_eqns false c (add_thm thy default (thm', proper)) thy end;
haftmann@31962
   772
haftmann@31962
   773
fun add_eqn thm thy =
haftmann@31962
   774
  gen_add_eqn false (mk_eqn thy (thm, true)) thy;
haftmann@31962
   775
haftmann@31962
   776
fun add_warning_eqn thm thy =
haftmann@31962
   777
  case mk_eqn_warning thy thm
haftmann@31962
   778
   of SOME eqn => gen_add_eqn false eqn thy
haftmann@31962
   779
    | NONE => thy;
haftmann@31962
   780
haftmann@31962
   781
fun add_default_eqn thm thy =
haftmann@31962
   782
  case mk_eqn_liberal thy thm
haftmann@31962
   783
   of SOME eqn => gen_add_eqn true eqn thy
haftmann@31962
   784
    | NONE => thy;
haftmann@31962
   785
haftmann@31962
   786
fun add_nbe_eqn thm thy =
haftmann@31962
   787
  gen_add_eqn false (mk_eqn thy (thm, false)) thy;
haftmann@31962
   788
haftmann@31962
   789
val add_default_eqn_attribute = Thm.declaration_attribute
haftmann@31962
   790
  (fn thm => Context.mapping (add_default_eqn thm) I);
haftmann@31962
   791
val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
haftmann@31962
   792
haftmann@31962
   793
fun del_eqn thm thy = case mk_eqn_liberal thy thm
haftmann@31962
   794
 of SOME (thm, _) => change_eqns true (const_eqn thy thm) (del_thm thm) thy
haftmann@31962
   795
  | NONE => thy;
haftmann@31962
   796
haftmann@32070
   797
(* c.f. src/HOL/Tools/recfun_codegen.ML *)
haftmann@32070
   798
wenzelm@33522
   799
structure Code_Target_Attr = Theory_Data
wenzelm@33522
   800
(
haftmann@31998
   801
  type T = (string -> thm -> theory -> theory) option;
haftmann@31998
   802
  val empty = NONE;
haftmann@31998
   803
  val extend = I;
wenzelm@33522
   804
  fun merge (f1, f2) = if is_some f1 then f1 else f2;
haftmann@31998
   805
);
haftmann@31998
   806
haftmann@32070
   807
fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
haftmann@32070
   808
haftmann@32070
   809
fun code_target_attr prefix thm thy =
haftmann@32070
   810
  let
haftmann@32070
   811
    val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
haftmann@32070
   812
  in thy |> add_warning_eqn thm |> attr prefix thm end;
haftmann@32070
   813
haftmann@32070
   814
(* setup *)
haftmann@31998
   815
haftmann@31962
   816
val _ = Context.>> (Context.map_theory
haftmann@31962
   817
  (let
haftmann@31962
   818
    fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@31998
   819
    val code_attribute_parser =
haftmann@31998
   820
      Args.del |-- Scan.succeed (mk_attribute del_eqn)
haftmann@31998
   821
      || Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
haftmann@31998
   822
      || (Args.$$$ "target" |-- Args.colon |-- Args.name >>
haftmann@32070
   823
           (mk_attribute o code_target_attr))
haftmann@31998
   824
      || Scan.succeed (mk_attribute add_warning_eqn);
haftmann@31962
   825
  in
haftmann@31962
   826
    Type_Interpretation.init
haftmann@31998
   827
    #> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
haftmann@31998
   828
        "declare theorems for code generation"
haftmann@31962
   829
  end));
haftmann@31962
   830
haftmann@31962
   831
haftmann@31962
   832
(* cases *)
haftmann@31962
   833
haftmann@24844
   834
fun add_case thm thy =
haftmann@24844
   835
  let
haftmann@31156
   836
    val (c, (k, case_pats)) = case_cert thm;
haftmann@31088
   837
    val _ = case filter_out (is_constr thy) case_pats
haftmann@30076
   838
     of [] => ()
haftmann@30076
   839
      | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
haftmann@30076
   840
    val entry = (1 + Int.max (1, length case_pats), (k, case_pats))
haftmann@30076
   841
  in (map_exec_purge (SOME [c]) o map_cases o apfst) (Symtab.update (c, entry)) thy end;
haftmann@24844
   842
haftmann@24844
   843
fun add_undefined c thy =
haftmann@24844
   844
  (map_exec_purge (SOME [c]) o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@24844
   845
haftmann@24219
   846
end; (*struct*)
haftmann@24219
   847
haftmann@24219
   848
bulwahn@32661
   849
(** type-safe interfaces for data dependent on executable code **)
haftmann@24219
   850
haftmann@31962
   851
functor Code_Data_Fun(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219
   852
struct
haftmann@24219
   853
haftmann@24219
   854
type T = Data.T;
haftmann@24219
   855
exception Data of T;
haftmann@24219
   856
fun dest (Data x) = x
haftmann@24219
   857
haftmann@24219
   858
val kind = Code.declare_data (Data Data.empty)
haftmann@27609
   859
  (fn thy => fn cs => fn Data x => Data (Data.purge thy cs x));
haftmann@24219
   860
haftmann@24219
   861
val data_op = (kind, Data, dest);
haftmann@24219
   862
haftmann@24219
   863
val get = Code.get_data data_op;
haftmann@24219
   864
val change = Code.change_data data_op;
haftmann@24219
   865
fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219
   866
haftmann@24219
   867
end;
haftmann@24219
   868
haftmann@28143
   869
structure Code : CODE = struct open Code; end;