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