haftmann@24219: (*  Title:      Pure/Isar/code.ML
haftmann@24219:     Author:     Florian Haftmann, TU Muenchen
haftmann@24219: 
haftmann@31962: Abstract executable code of theory.  Management of data dependent on
haftmann@31962: executable code.  Cache assumes non-concurrent processing of a single theory.
haftmann@24219: *)
haftmann@24219: 
haftmann@24219: signature CODE =
haftmann@24219: sig
haftmann@31957:   (*constants*)
haftmann@31957:   val check_const: theory -> term -> string
haftmann@31957:   val read_bare_const: theory -> string -> string * typ
haftmann@31957:   val read_const: theory -> string -> string
haftmann@31962:   val string_of_const: theory -> string -> string
haftmann@31962:   val args_number: theory -> string -> int
haftmann@31957: 
haftmann@31156:   (*constructor sets*)
haftmann@31156:   val constrset_of_consts: theory -> (string * typ) list
haftmann@31156:     -> string * ((string * sort) list * (string * typ list) list)
haftmann@31156: 
haftmann@31156:   (*code equations*)
haftmann@31962:   val mk_eqn: theory -> thm * bool -> thm * bool
haftmann@31962:   val mk_eqn_warning: theory -> thm -> (thm * bool) option
haftmann@31962:   val mk_eqn_liberal: theory -> thm -> (thm * bool) option
haftmann@31156:   val assert_eqn: theory -> thm * bool -> thm * bool
haftmann@31156:   val assert_eqns_const: theory -> string
haftmann@31156:     -> (thm * bool) list -> (thm * bool) list
haftmann@31957:   val const_typ_eqn: theory -> thm -> string * typ
haftmann@31156:   val typscheme_eqn: theory -> thm -> (string * sort) list * typ
haftmann@32873:   val typscheme_eqns: theory -> string -> thm list -> (string * sort) list * typ
haftmann@32929:   val standard_typscheme: theory -> thm list -> thm list
haftmann@31156: 
haftmann@31962:   (*executable code*)
haftmann@31156:   val add_datatype: (string * typ) list -> theory -> theory
haftmann@31156:   val add_datatype_cmd: string list -> theory -> theory
haftmann@31156:   val type_interpretation:
haftmann@31156:     (string * ((string * sort) list * (string * typ list) list)
haftmann@31156:       -> theory -> theory) -> theory -> theory
haftmann@28368:   val add_eqn: thm -> theory -> theory
haftmann@31088:   val add_nbe_eqn: thm -> theory -> theory
haftmann@28368:   val add_default_eqn: thm -> theory -> theory
haftmann@28703:   val add_default_eqn_attribute: attribute
haftmann@28703:   val add_default_eqn_attrib: Attrib.src
haftmann@28368:   val del_eqn: thm -> theory -> theory
haftmann@28368:   val del_eqns: string -> theory -> theory
haftmann@24844:   val add_case: thm -> theory -> theory
haftmann@24844:   val add_undefined: string -> theory -> theory
haftmann@24219:   val get_datatype: theory -> string -> ((string * sort) list * (string * typ list) list)
haftmann@24423:   val get_datatype_of_constr: theory -> string -> string option
haftmann@31156:   val these_eqns: theory -> string -> (thm * bool) list
haftmann@31642:   val all_eqns: theory -> (thm * bool) list
haftmann@30023:   val get_case_scheme: theory -> string -> (int * (int * string list)) option
haftmann@31890:   val undefineds: theory -> string list
haftmann@24219:   val print_codesetup: theory -> unit
haftmann@31957: 
haftmann@31957:   (*infrastructure*)
haftmann@31998:   val set_code_target_attr: (string -> thm -> theory -> theory) -> theory -> theory
haftmann@31957:   val purge_data: theory -> theory
haftmann@24219: end;
haftmann@24219: 
haftmann@24219: signature CODE_DATA_ARGS =
haftmann@24219: sig
haftmann@24219:   type T
haftmann@24219:   val empty: T
haftmann@27609:   val purge: theory -> string list -> T -> T
haftmann@24219: end;
haftmann@24219: 
haftmann@24219: signature CODE_DATA =
haftmann@24219: sig
haftmann@24219:   type T
haftmann@24219:   val get: theory -> T
haftmann@24219:   val change: theory -> (T -> T) -> T
haftmann@24219:   val change_yield: theory -> (T -> 'a * T) -> 'a * T
haftmann@24219: end;
haftmann@24219: 
haftmann@24219: signature PRIVATE_CODE =
haftmann@24219: sig
haftmann@24219:   include CODE
haftmann@27609:   val declare_data: Object.T -> (theory -> string list -> Object.T -> Object.T)
haftmann@27609:     -> serial
haftmann@24219:   val get_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219:     -> theory -> 'a
haftmann@24219:   val change_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219:     -> theory -> ('a -> 'a) -> 'a
haftmann@24219:   val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a)
haftmann@24219:     -> theory -> ('a -> 'b * 'a) -> 'b * 'a
haftmann@24219: end;
haftmann@24219: 
haftmann@24219: structure Code : PRIVATE_CODE =
haftmann@24219: struct
haftmann@24219: 
haftmann@31962: (** auxiliary **)
haftmann@31962: 
haftmann@31962: (* printing *)
haftmann@31156: 
wenzelm@32966: fun string_of_typ thy = setmp_CRITICAL show_sorts true (Syntax.string_of_typ_global thy);
haftmann@31962: 
haftmann@31156: fun string_of_const thy c = case AxClass.inst_of_param thy c
haftmann@31156:  of SOME (c, tyco) => Sign.extern_const thy c ^ " " ^ enclose "[" "]" (Sign.extern_type thy tyco)
haftmann@31156:   | NONE => Sign.extern_const thy c;
haftmann@31156: 
haftmann@31962: 
haftmann@31962: (* constants *)
haftmann@31156: 
haftmann@31962: fun check_bare_const thy t = case try dest_Const t
haftmann@31962:  of SOME c_ty => c_ty
haftmann@31962:   | NONE => error ("Not a constant: " ^ Syntax.string_of_term_global thy t);
haftmann@31156: 
haftmann@31962: fun check_const thy = AxClass.unoverload_const thy o check_bare_const thy;
haftmann@31962: 
haftmann@31962: fun read_bare_const thy = check_bare_const thy o Syntax.read_term_global thy;
haftmann@31962: 
haftmann@31962: fun read_const thy = AxClass.unoverload_const thy o read_bare_const thy;
haftmann@31156: 
haftmann@32872: 
haftmann@31962: 
haftmann@31962: (** data store **)
haftmann@31962: 
haftmann@31962: (* code equations *)
haftmann@31962: 
haftmann@33006: type eqns = bool * (thm * bool) list;
haftmann@33006:   (*default flag, theorems with proper flag *)
haftmann@31962: 
haftmann@31962: fun add_drop_redundant thy (thm, proper) thms =
haftmann@31962:   let
haftmann@31962:     val args_of = snd o strip_comb o map_types Type.strip_sorts
haftmann@31962:       o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31962:     val args = args_of thm;
haftmann@31962:     val incr_idx = Logic.incr_indexes ([], Thm.maxidx_of thm + 1);
haftmann@31962:     fun matches_args args' = length args <= length args' andalso
haftmann@33955:       Pattern.matchess thy (args, (map incr_idx o curry (uncurry take) (length args)) args');
haftmann@31962:     fun drop (thm', proper') = if (proper orelse not proper')
haftmann@31962:       andalso matches_args (args_of thm') then 
wenzelm@32091:         (warning ("Code generator: dropping redundant code equation\n" ^
wenzelm@32091:             Display.string_of_thm_global thy thm'); true)
haftmann@31962:       else false;
haftmann@31962:   in (thm, proper) :: filter_out drop thms end;
haftmann@31962: 
haftmann@33006: fun add_thm thy _ thm (false, thms) = (false, add_drop_redundant thy thm thms)
haftmann@33006:   | add_thm thy true thm (true, thms) = (true, thms @ [thm])
haftmann@33006:   | add_thm thy false thm (true, thms) = (false, [thm]);
haftmann@31962: 
haftmann@33006: fun del_thm thm = apsnd (remove (eq_fst Thm.eq_thm_prop) (thm, true));
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* executable code data *)
haftmann@31962: 
haftmann@31962: datatype spec = Spec of {
haftmann@31962:   history_concluded: bool,
haftmann@31962:   eqns: ((bool * eqns) * (serial * eqns) list) Symtab.table
haftmann@31962:     (*with explicit history*),
haftmann@31962:   dtyps: ((serial * ((string * sort) list * (string * typ list) list)) list) Symtab.table
haftmann@31962:     (*with explicit history*),
haftmann@31962:   cases: (int * (int * string list)) Symtab.table * unit Symtab.table
haftmann@31962: };
haftmann@31962: 
haftmann@32544: fun make_spec (history_concluded, (eqns, (dtyps, cases))) =
haftmann@32544:   Spec { history_concluded = history_concluded, eqns = eqns, dtyps = dtyps, cases = cases };
haftmann@32544: fun map_spec f (Spec { history_concluded = history_concluded, eqns = eqns,
haftmann@31962:   dtyps = dtyps, cases = cases }) =
haftmann@32544:   make_spec (f (history_concluded, (eqns, (dtyps, cases))));
haftmann@32544: fun merge_spec (Spec { history_concluded = _, eqns = eqns1,
haftmann@31962:     dtyps = dtyps1, cases = (cases1, undefs1) },
haftmann@32544:   Spec { history_concluded = _, eqns = eqns2,
haftmann@31962:     dtyps = dtyps2, cases = (cases2, undefs2) }) =
haftmann@31156:   let
haftmann@31962:     fun merge_eqns ((_, history1), (_, history2)) =
haftmann@31962:       let
haftmann@31962:         val raw_history = AList.merge (op = : serial * serial -> bool)
haftmann@31962:           (K true) (history1, history2)
haftmann@31962:         val filtered_history = filter_out (fst o snd) raw_history
haftmann@31962:         val history = if null filtered_history
haftmann@31962:           then raw_history else filtered_history;
haftmann@31962:       in ((false, (snd o hd) history), history) end;
haftmann@31962:     val eqns = Symtab.join (K merge_eqns) (eqns1, eqns2);
haftmann@31962:     val dtyps = Symtab.join (K (AList.merge (op =) (K true))) (dtyps1, dtyps2);
haftmann@31962:     val cases = (Symtab.merge (K true) (cases1, cases2),
haftmann@31962:       Symtab.merge (K true) (undefs1, undefs2));
haftmann@32544:   in make_spec (false, (eqns, (dtyps, cases))) end;
haftmann@31962: 
haftmann@31962: fun history_concluded (Spec { history_concluded, ... }) = history_concluded;
haftmann@31962: fun the_eqns (Spec { eqns, ... }) = eqns;
haftmann@31962: fun the_dtyps (Spec { dtyps, ... }) = dtyps;
haftmann@31962: fun the_cases (Spec { cases, ... }) = cases;
haftmann@32544: val map_history_concluded = map_spec o apfst;
haftmann@31962: val map_eqns = map_spec o apsnd o apfst;
haftmann@31962: val map_dtyps = map_spec o apsnd o apsnd o apfst;
haftmann@31962: val map_cases = map_spec o apsnd o apsnd o apsnd;
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* data slots dependent on executable code *)
haftmann@31962: 
haftmann@31962: (*private copy avoids potential conflict of table exceptions*)
wenzelm@31971: structure Datatab = Table(type key = int val ord = int_ord);
haftmann@31962: 
haftmann@31962: local
haftmann@31962: 
haftmann@31962: type kind = {
haftmann@31962:   empty: Object.T,
haftmann@31962:   purge: theory -> string list -> Object.T -> Object.T
haftmann@31962: };
haftmann@31962: 
wenzelm@32738: val kinds = Unsynchronized.ref (Datatab.empty: kind Datatab.table);
wenzelm@32738: val kind_keys = Unsynchronized.ref ([]: serial list);
haftmann@31962: 
haftmann@31962: fun invoke f k = case Datatab.lookup (! kinds) k
haftmann@31962:  of SOME kind => f kind
haftmann@31962:   | NONE => sys_error "Invalid code data identifier";
haftmann@31962: 
haftmann@31962: in
haftmann@31962: 
haftmann@31962: fun declare_data empty purge =
haftmann@31962:   let
haftmann@31962:     val k = serial ();
haftmann@31962:     val kind = {empty = empty, purge = purge};
wenzelm@32738:     val _ = Unsynchronized.change kinds (Datatab.update (k, kind));
wenzelm@32738:     val _ = Unsynchronized.change kind_keys (cons k);
haftmann@31962:   in k end;
haftmann@31962: 
haftmann@31962: fun invoke_init k = invoke (fn kind => #empty kind) k;
haftmann@31962: 
haftmann@31962: fun invoke_purge_all thy cs =
haftmann@31962:   fold (fn k => Datatab.map_entry k
haftmann@31962:     (invoke (fn kind => #purge kind thy cs) k)) (! kind_keys);
haftmann@31962: 
haftmann@31962: end; (*local*)
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* theory store *)
haftmann@31962: 
haftmann@31962: local
haftmann@31962: 
haftmann@31962: type data = Object.T Datatab.table;
haftmann@31962: val empty_data = Datatab.empty : data;
haftmann@31962: 
haftmann@31962: structure Code_Data = TheoryDataFun
haftmann@31962: (
wenzelm@32738:   type T = spec * data Unsynchronized.ref;
haftmann@32544:   val empty = (make_spec (false,
wenzelm@32738:     (Symtab.empty, (Symtab.empty, (Symtab.empty, Symtab.empty)))), Unsynchronized.ref empty_data);
wenzelm@32738:   fun copy (spec, data) = (spec, Unsynchronized.ref (! data));
haftmann@31962:   val extend = copy;
haftmann@31962:   fun merge pp ((spec1, data1), (spec2, data2)) =
wenzelm@32738:     (merge_spec (spec1, spec2), Unsynchronized.ref empty_data);
haftmann@31962: );
haftmann@31962: 
haftmann@31962: fun thy_data f thy = f ((snd o Code_Data.get) thy);
haftmann@31962: 
haftmann@31962: fun get_ensure_init kind data_ref =
haftmann@31962:   case Datatab.lookup (! data_ref) kind
haftmann@31962:    of SOME x => x
haftmann@31962:     | NONE => let val y = invoke_init kind
wenzelm@32738:         in (Unsynchronized.change data_ref (Datatab.update (kind, y)); y) end;
haftmann@31962: 
haftmann@31962: in
haftmann@31962: 
haftmann@31962: (* access to executable code *)
haftmann@31962: 
haftmann@31962: val the_exec = fst o Code_Data.get;
haftmann@31962: 
haftmann@31962: fun complete_class_params thy cs =
haftmann@31962:   fold (fn c => case AxClass.inst_of_param thy c
haftmann@31962:    of NONE => insert (op =) c
haftmann@31962:     | SOME (c', _) => insert (op =) c' #> insert (op =) c) cs [];
haftmann@31962: 
haftmann@31962: fun map_exec_purge touched f thy =
wenzelm@32738:   Code_Data.map (fn (exec, data) => (f exec, Unsynchronized.ref (case touched
haftmann@31962:    of SOME cs => invoke_purge_all thy (complete_class_params thy cs) (! data)
haftmann@31962:     | NONE => empty_data))) thy;
haftmann@31962: 
haftmann@33708: val purge_data = (Code_Data.map o apsnd) (fn _ => Unsynchronized.ref empty_data);
haftmann@31962: 
haftmann@31962: fun change_eqns delete c f = (map_exec_purge (SOME [c]) o map_eqns
haftmann@33006:   o (if delete then Symtab.map_entry c else Symtab.map_default (c, ((false, (true, [])), [])))
haftmann@31962:     o apfst) (fn (_, eqns) => (true, f eqns));
haftmann@31962: 
haftmann@33006: fun del_eqns c = change_eqns true c (K (false, []));
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* tackling equation history *)
haftmann@31962: 
haftmann@31962: fun get_eqns thy c =
haftmann@31962:   Symtab.lookup ((the_eqns o the_exec) thy) c
haftmann@33006:   |> Option.map (snd o snd o fst)
haftmann@31962:   |> these;
haftmann@31962: 
haftmann@31962: fun continue_history thy = if (history_concluded o the_exec) thy
haftmann@31962:   then thy
haftmann@31962:     |> (Code_Data.map o apfst o map_history_concluded) (K false)
haftmann@31962:     |> SOME
haftmann@31962:   else NONE;
haftmann@31962: 
haftmann@31962: fun conclude_history thy = if (history_concluded o the_exec) thy
haftmann@31962:   then NONE
haftmann@31962:   else thy
haftmann@31962:     |> (Code_Data.map o apfst)
haftmann@31962:         ((map_eqns o Symtab.map) (fn ((changed, current), history) =>
haftmann@31962:           ((false, current),
haftmann@31962:             if changed then (serial (), current) :: history else history))
haftmann@31962:         #> map_history_concluded (K true))
haftmann@31962:     |> SOME;
haftmann@31962: 
haftmann@31962: val _ = Context.>> (Context.map_theory (Code_Data.init
haftmann@31962:   #> Theory.at_begin continue_history
haftmann@31962:   #> Theory.at_end conclude_history));
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* access to data dependent on abstract executable code *)
haftmann@31962: 
haftmann@31962: fun get_data (kind, _, dest) = thy_data (get_ensure_init kind #> dest);
haftmann@31962: 
haftmann@31962: fun change_data (kind, mk, dest) =
haftmann@31962:   let
haftmann@31962:     fun chnge data_ref f =
haftmann@31962:       let
haftmann@31962:         val data = get_ensure_init kind data_ref;
haftmann@31962:         val data' = f (dest data);
wenzelm@32738:       in (Unsynchronized.change data_ref (Datatab.update (kind, mk data')); data') end;
haftmann@31962:   in thy_data chnge end;
haftmann@31962: 
haftmann@31962: fun change_yield_data (kind, mk, dest) =
haftmann@31962:   let
haftmann@31962:     fun chnge data_ref f =
haftmann@31962:       let
haftmann@31962:         val data = get_ensure_init kind data_ref;
haftmann@31962:         val (x, data') = f (dest data);
wenzelm@32738:       in (x, (Unsynchronized.change data_ref (Datatab.update (kind, mk data')); data')) end;
haftmann@31962:   in thy_data chnge end;
haftmann@31962: 
haftmann@31962: end; (*local*)
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (** foundation **)
haftmann@31962: 
haftmann@31962: (* constants *)
haftmann@31962: 
haftmann@31962: fun args_number thy = length o fst o strip_type o Sign.the_const_type thy;
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* datatypes *)
haftmann@31156: 
haftmann@31156: fun constrset_of_consts thy cs =
haftmann@31156:   let
haftmann@31156:     val _ = map (fn (c, _) => if (is_some o AxClass.class_of_param thy) c
haftmann@31156:       then error ("Is a class parameter: " ^ string_of_const thy c) else ()) cs;
haftmann@33531:     fun no_constr s (c, ty) = error ("Not a datatype constructor:\n" ^ string_of_const thy c
haftmann@33531:       ^ " :: " ^ string_of_typ thy ty ^ "\n" ^ enclose "(" ")" s);
haftmann@31156:     fun last_typ c_ty ty =
haftmann@31156:       let
haftmann@33531:         val tfrees = Term.add_tfreesT ty [];
haftmann@31156:         val (tyco, vs) = ((apsnd o map) (dest_TFree) o dest_Type o snd o strip_type) ty
haftmann@33531:           handle TYPE _ => no_constr "bad type" c_ty
haftmann@33531:         val _ = if has_duplicates (eq_fst (op =)) vs
haftmann@33531:           then no_constr "duplicate type variables in datatype" c_ty else ();
haftmann@33531:         val _ = if length tfrees <> length vs
haftmann@33531:           then no_constr "type variables missing in datatype" c_ty else ();
haftmann@31156:       in (tyco, vs) end;
haftmann@31156:     fun ty_sorts (c, ty) =
haftmann@31156:       let
haftmann@31156:         val ty_decl = (Logic.unvarifyT o Sign.the_const_type thy) c;
haftmann@31156:         val (tyco, _) = last_typ (c, ty) ty_decl;
haftmann@31156:         val (_, vs) = last_typ (c, ty) ty;
haftmann@31156:       in ((tyco, map snd vs), (c, (map fst vs, ty))) end;
haftmann@31156:     fun add ((tyco', sorts'), c) ((tyco, sorts), cs) =
haftmann@31156:       let
haftmann@31998:         val _ = if (tyco' : string) <> tyco
haftmann@31156:           then error "Different type constructors in constructor set"
haftmann@31156:           else ();
haftmann@31156:         val sorts'' = map2 (curry (Sorts.inter_sort (Sign.classes_of thy))) sorts' sorts
haftmann@31156:       in ((tyco, sorts), c :: cs) end;
haftmann@31156:     fun inst vs' (c, (vs, ty)) =
haftmann@31156:       let
haftmann@31156:         val the_v = the o AList.lookup (op =) (vs ~~ vs');
haftmann@31156:         val ty' = map_atyps (fn TFree (v, _) => TFree (the_v v)) ty;
haftmann@31156:       in (c, (fst o strip_type) ty') end;
haftmann@31156:     val c' :: cs' = map ty_sorts cs;
haftmann@31156:     val ((tyco, sorts), cs'') = fold add cs' (apsnd single c');
haftmann@31156:     val vs = Name.names Name.context Name.aT sorts;
haftmann@31156:     val cs''' = map (inst vs) cs'';
haftmann@31156:   in (tyco, (vs, rev cs''')) end;
haftmann@31156: 
haftmann@31962: fun get_datatype thy tyco =
haftmann@31962:   case these (Symtab.lookup ((the_dtyps o the_exec) thy) tyco)
haftmann@31962:    of (_, spec) :: _ => spec
haftmann@31962:     | [] => Sign.arity_number thy tyco
haftmann@31962:         |> Name.invents Name.context Name.aT
haftmann@31962:         |> map (rpair [])
haftmann@31962:         |> rpair [];
haftmann@31962: 
haftmann@31962: fun get_datatype_of_constr thy c =
haftmann@31962:   case (snd o strip_type o Sign.the_const_type thy) c
haftmann@31962:    of Type (tyco, _) => if member (op =) ((map fst o snd o get_datatype thy) tyco) c
haftmann@31962:        then SOME tyco else NONE
haftmann@31962:     | _ => NONE;
haftmann@31962: 
haftmann@31962: fun is_constr thy = is_some o get_datatype_of_constr thy;
haftmann@31962: 
haftmann@31156: 
haftmann@31156: (* code equations *)
haftmann@31156: 
haftmann@31156: exception BAD_THM of string;
haftmann@31156: fun bad_thm msg = raise BAD_THM msg;
haftmann@31156: fun error_thm f thm = f thm handle BAD_THM msg => error msg;
haftmann@31642: fun warning_thm f thm = SOME (f thm) handle BAD_THM msg => (warning msg; NONE)
haftmann@31156: fun try_thm f thm = SOME (f thm) handle BAD_THM _ => NONE;
haftmann@31156: 
haftmann@31156: fun is_linear thm =
haftmann@31156:   let val (_, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm
haftmann@31156:   in not (has_duplicates (op =) ((fold o fold_aterms)
haftmann@31156:     (fn Var (v, _) => cons v | _ => I) args [])) end;
haftmann@31156: 
haftmann@31962: fun gen_assert_eqn thy is_constr_pat (thm, proper) =
haftmann@31156:   let
haftmann@31156:     val (lhs, rhs) = (Logic.dest_equals o Thm.plain_prop_of) thm
wenzelm@32091:       handle TERM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm_global thy thm)
wenzelm@32091:            | THM _ => bad_thm ("Not an equation: " ^ Display.string_of_thm_global thy thm);
haftmann@31156:     fun vars_of t = fold_aterms (fn Var (v, _) => insert (op =) v
haftmann@31156:       | Free _ => bad_thm ("Illegal free variable in equation\n"
wenzelm@32091:           ^ Display.string_of_thm_global thy thm)
haftmann@31156:       | _ => I) t [];
haftmann@31156:     fun tvars_of t = fold_term_types (fn _ =>
haftmann@31156:       fold_atyps (fn TVar (v, _) => insert (op =) v
haftmann@31156:         | TFree _ => bad_thm 
wenzelm@32091:       ("Illegal free type variable in equation\n" ^ Display.string_of_thm_global thy thm))) t [];
haftmann@31156:     val lhs_vs = vars_of lhs;
haftmann@31156:     val rhs_vs = vars_of rhs;
haftmann@31156:     val lhs_tvs = tvars_of lhs;
haftmann@31156:     val rhs_tvs = tvars_of rhs;
haftmann@31156:     val _ = if null (subtract (op =) lhs_vs rhs_vs)
haftmann@31156:       then ()
haftmann@31156:       else bad_thm ("Free variables on right hand side of equation\n"
wenzelm@32091:         ^ Display.string_of_thm_global thy thm);
haftmann@31156:     val _ = if null (subtract (op =) lhs_tvs rhs_tvs)
haftmann@31156:       then ()
haftmann@31156:       else bad_thm ("Free type variables on right hand side of equation\n"
wenzelm@32091:         ^ Display.string_of_thm_global thy thm)
wenzelm@32091:     val (head, args) = (strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of) thm;
haftmann@31156:     val (c, ty) = case head
haftmann@31156:      of Const (c_ty as (_, ty)) => (AxClass.unoverload_const thy c_ty, ty)
wenzelm@32091:       | _ => bad_thm ("Equation not headed by constant\n" ^ Display.string_of_thm_global thy thm);
haftmann@31156:     fun check _ (Abs _) = bad_thm
haftmann@31156:           ("Abstraction on left hand side of equation\n"
wenzelm@32091:             ^ Display.string_of_thm_global thy thm)
haftmann@31156:       | check 0 (Var _) = ()
haftmann@31156:       | check _ (Var _) = bad_thm
haftmann@31156:           ("Variable with application on left hand side of equation\n"
wenzelm@32091:             ^ Display.string_of_thm_global thy thm)
haftmann@31156:       | check n (t1 $ t2) = (check (n+1) t1; check 0 t2)
haftmann@31156:       | check n (Const (c_ty as (c, ty))) = if n = (length o fst o strip_type) ty
haftmann@31156:           then if not proper orelse is_constr_pat (AxClass.unoverload_const thy c_ty)
haftmann@31156:             then ()
haftmann@31156:             else bad_thm (quote c ^ " is not a constructor, on left hand side of equation\n"
wenzelm@32091:               ^ Display.string_of_thm_global thy thm)
haftmann@31156:           else bad_thm
haftmann@31156:             ("Partially applied constant " ^ quote c ^ " on left hand side of equation\n"
wenzelm@32091:                ^ Display.string_of_thm_global thy thm);
haftmann@31156:     val _ = map (check 0) args;
haftmann@31156:     val _ = if not proper orelse is_linear thm then ()
haftmann@31156:       else bad_thm ("Duplicate variables on left hand side of equation\n"
wenzelm@32091:         ^ Display.string_of_thm_global thy thm);
haftmann@31156:     val _ = if (is_none o AxClass.class_of_param thy) c
haftmann@31156:       then ()
haftmann@31156:       else bad_thm ("Polymorphic constant as head in equation\n"
wenzelm@32091:         ^ Display.string_of_thm_global thy thm)
haftmann@31962:     val _ = if not (is_constr thy c)
haftmann@31156:       then ()
haftmann@31156:       else bad_thm ("Constructor as head in equation\n"
wenzelm@32091:         ^ Display.string_of_thm_global thy thm)
haftmann@31156:     val ty_decl = Sign.the_const_type thy c;
haftmann@31156:     val _ = if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty)
haftmann@31156:       then () else bad_thm ("Type\n" ^ string_of_typ thy ty
haftmann@31156:            ^ "\nof equation\n"
wenzelm@32091:            ^ Display.string_of_thm_global thy thm
haftmann@31156:            ^ "\nis incompatible with declared function type\n"
haftmann@31156:            ^ string_of_typ thy ty_decl)
haftmann@31156:   in (thm, proper) end;
haftmann@31156: 
haftmann@31962: fun assert_eqn thy = error_thm (gen_assert_eqn thy (is_constr thy));
haftmann@31962: 
haftmann@31962: fun meta_rewrite thy = LocalDefs.meta_rewrite_rule (ProofContext.init thy);
haftmann@31156: 
haftmann@31962: fun mk_eqn thy = error_thm (gen_assert_eqn thy (K true)) o
haftmann@31962:   apfst (meta_rewrite thy);
haftmann@31962: 
haftmann@31962: fun mk_eqn_warning thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962:   o warning_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31962: 
haftmann@31962: fun mk_eqn_liberal thy = Option.map (fn (thm, _) => (thm, is_linear thm))
haftmann@31962:   o try_thm (gen_assert_eqn thy (K true)) o rpair false o meta_rewrite thy;
haftmann@31156: 
haftmann@31156: (*those following are permissive wrt. to overloaded constants!*)
haftmann@31156: 
haftmann@32640: val head_eqn = dest_Const o fst o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of;
haftmann@31957: fun const_typ_eqn thy thm =
haftmann@31156:   let
haftmann@32640:     val (c, ty) = head_eqn thm;
haftmann@31156:     val c' = AxClass.unoverload_const thy (c, ty);
haftmann@31156:   in (c', ty) end;
haftmann@31957: fun const_eqn thy = fst o const_typ_eqn thy;
haftmann@31156: 
haftmann@32873: fun typscheme thy (c, ty) =
haftmann@32873:   (map dest_TFree (Sign.const_typargs thy (c, ty)), Type.strip_sorts ty);
haftmann@32873: fun typscheme_eqn thy = typscheme thy o apsnd Logic.unvarifyT o const_typ_eqn thy;
haftmann@32873: fun typscheme_eqns thy c [] = 
haftmann@32873:       let
haftmann@32873:         val raw_ty = Sign.the_const_type thy c;
haftmann@32873:         val tvars = Term.add_tvar_namesT raw_ty [];
haftmann@32873:         val tvars' = case AxClass.class_of_param thy c
haftmann@32873:          of SOME class => [TFree (Name.aT, [class])]
haftmann@32873:           | NONE => Name.invent_list [] Name.aT (length tvars)
haftmann@32873:               |> map (fn v => TFree (v, []));
haftmann@32873:         val ty = typ_subst_TVars (tvars ~~ tvars') raw_ty;
haftmann@32873:       in typscheme thy (c, ty) end
haftmann@32873:   | typscheme_eqns thy c (thms as thm :: _) = typscheme_eqn thy thm;
haftmann@32872: 
haftmann@31962: fun assert_eqns_const thy c eqns =
haftmann@31962:   let
haftmann@31962:     fun cert (eqn as (thm, _)) = if c = const_eqn thy thm
haftmann@31962:       then eqn else error ("Wrong head of code equation,\nexpected constant "
wenzelm@32091:         ^ string_of_const thy c ^ "\n" ^ Display.string_of_thm_global thy thm)
haftmann@31962:   in map (cert o assert_eqn thy) eqns end;
haftmann@31156: 
haftmann@32929: fun standard_typscheme thy thms =
haftmann@32354:   let
haftmann@32640:     fun tvars_of T = rev (Term.add_tvarsT T []);
haftmann@32640:     val vss = map (tvars_of o snd o head_eqn) thms;
haftmann@32354:     fun inter_sorts vs =
haftmann@32354:       fold (curry (Sorts.inter_sort (Sign.classes_of thy)) o snd) vs [];
haftmann@32354:     val sorts = map_transpose inter_sorts vss;
haftmann@32873:     val vts = Name.names Name.context Name.aT sorts
haftmann@32354:       |> map (fn (v, sort) => TVar ((v, 0), sort));
haftmann@32354:   in map2 (fn vs => Thm.certify_instantiate (vs ~~ vts, [])) vss thms end;
haftmann@31962: 
haftmann@31962: fun these_eqns thy c =
haftmann@31962:   get_eqns thy c
haftmann@31962:   |> (map o apfst) (Thm.transfer thy)
haftmann@32929:   |> burrow_fst (standard_typscheme thy);
haftmann@31962: 
haftmann@31962: fun all_eqns thy =
haftmann@31962:   Symtab.dest ((the_eqns o the_exec) thy)
haftmann@33006:   |> maps (snd o snd o fst o snd);
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* cases *)
haftmann@31156: 
haftmann@31156: fun case_certificate thm =
haftmann@31156:   let
haftmann@31156:     val ((head, raw_case_expr), cases) = (apfst Logic.dest_equals
haftmann@32640:       o apsnd Logic.dest_conjunctions o Logic.dest_implies o Thm.plain_prop_of) thm;
haftmann@31156:     val _ = case head of Free _ => true
haftmann@31156:       | Var _ => true
haftmann@31156:       | _ => raise TERM ("case_cert", []);
haftmann@31156:     val ([(case_var, _)], case_expr) = Term.strip_abs_eta 1 raw_case_expr;
haftmann@31156:     val (Const (case_const, _), raw_params) = strip_comb case_expr;
haftmann@31156:     val n = find_index (fn Free (v, _) => v = case_var | _ => false) raw_params;
haftmann@31156:     val _ = if n = ~1 then raise TERM ("case_cert", []) else ();
haftmann@31156:     val params = map (fst o dest_Var) (nth_drop n raw_params);
haftmann@31156:     fun dest_case t =
haftmann@31156:       let
haftmann@31156:         val (head' $ t_co, rhs) = Logic.dest_equals t;
haftmann@31156:         val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156:         val (Const (co, _), args) = strip_comb t_co;
haftmann@31156:         val (Var (param, _), args') = strip_comb rhs;
haftmann@31156:         val _ = if args' = args then () else raise TERM ("case_cert", []);
haftmann@31156:       in (param, co) end;
haftmann@31156:     fun analyze_cases cases =
haftmann@31156:       let
haftmann@31156:         val co_list = fold (AList.update (op =) o dest_case) cases [];
haftmann@31156:       in map (the o AList.lookup (op =) co_list) params end;
haftmann@31156:     fun analyze_let t =
haftmann@31156:       let
haftmann@31156:         val (head' $ arg, Var (param', _) $ arg') = Logic.dest_equals t;
haftmann@31156:         val _ = if head' = head then () else raise TERM ("case_cert", []);
haftmann@31156:         val _ = if arg' = arg then () else raise TERM ("case_cert", []);
haftmann@31156:         val _ = if [param'] = params then () else raise TERM ("case_cert", []);
haftmann@31156:       in [] end;
haftmann@31156:     fun analyze (cases as [let_case]) =
haftmann@31156:           (analyze_cases cases handle Bind => analyze_let let_case)
haftmann@31156:       | analyze cases = analyze_cases cases;
haftmann@31156:   in (case_const, (n, analyze cases)) end;
haftmann@31156: 
haftmann@31156: fun case_cert thm = case_certificate thm
haftmann@31156:   handle Bind => error "bad case certificate"
haftmann@31156:        | TERM _ => error "bad case certificate";
haftmann@31156: 
haftmann@31962: fun get_case_scheme thy = Symtab.lookup ((fst o the_cases o the_exec) thy);
haftmann@24219: 
haftmann@31962: val undefineds = Symtab.keys o snd o the_cases o the_exec;
haftmann@24219: 
haftmann@24219: 
haftmann@31962: (* diagnostic *)
haftmann@24219: 
haftmann@24219: fun print_codesetup thy =
haftmann@24219:   let
haftmann@24219:     val ctxt = ProofContext.init thy;
haftmann@24844:     val exec = the_exec thy;
haftmann@33006:     fun pretty_eqns (s, (_, eqns)) =
haftmann@24219:       (Pretty.block o Pretty.fbreaks) (
haftmann@33006:         Pretty.str s :: map (Display.pretty_thm ctxt o fst) eqns
haftmann@24219:       );
haftmann@24219:     fun pretty_dtyp (s, []) =
haftmann@24219:           Pretty.str s
haftmann@24219:       | pretty_dtyp (s, cos) =
haftmann@24219:           (Pretty.block o Pretty.breaks) (
haftmann@24219:             Pretty.str s
haftmann@24219:             :: Pretty.str "="
haftmann@31156:             :: separate (Pretty.str "|") (map (fn (c, []) => Pretty.str (string_of_const thy c)
haftmann@24219:                  | (c, tys) =>
haftmann@24219:                      (Pretty.block o Pretty.breaks)
haftmann@31156:                         (Pretty.str (string_of_const thy c)
wenzelm@26947:                           :: Pretty.str "of"
wenzelm@26947:                           :: map (Pretty.quote o Syntax.pretty_typ_global thy) tys)) cos)
haftmann@24219:           );
haftmann@28368:     val eqns = the_eqns exec
haftmann@24423:       |> Symtab.dest
haftmann@31156:       |> (map o apfst) (string_of_const thy)
haftmann@28695:       |> (map o apsnd) (snd o fst)
haftmann@24219:       |> sort (string_ord o pairself fst);
haftmann@24219:     val dtyps = the_dtyps exec
haftmann@24219:       |> Symtab.dest
haftmann@28695:       |> map (fn (dtco, (_, (vs, cos)) :: _) =>
haftmann@31957:           (string_of_typ thy (Type (dtco, map TFree vs)), cos))
haftmann@24219:       |> sort (string_ord o pairself fst)
haftmann@24219:   in
haftmann@24219:     (Pretty.writeln o Pretty.chunks) [
haftmann@24219:       Pretty.block (
haftmann@30023:         Pretty.str "code equations:"
haftmann@24219:         :: Pretty.fbrk
haftmann@33006:         :: (Pretty.fbreaks o map pretty_eqns) eqns
haftmann@24219:       ),
haftmann@25968:       Pretty.block (
haftmann@24219:         Pretty.str "datatypes:"
haftmann@24219:         :: Pretty.fbrk
haftmann@24219:         :: (Pretty.fbreaks o map pretty_dtyp) dtyps
haftmann@24219:       )
haftmann@24219:     ]
haftmann@24219:   end;
haftmann@24219: 
haftmann@24219: 
haftmann@31962: (** declaring executable ingredients **)
haftmann@31962: 
haftmann@31962: (* datatypes *)
haftmann@31090: 
wenzelm@33314: structure Type_Interpretation =
wenzelm@33314:   Interpretation(type T = string * serial val eq = eq_snd (op =) : T * T -> bool);
haftmann@25462: 
haftmann@24423: fun add_datatype raw_cs thy =
haftmann@24219:   let
haftmann@25597:     val cs = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) raw_cs;
haftmann@31156:     val (tyco, vs_cos) = constrset_of_consts thy cs;
haftmann@30076:     val old_cs = (map fst o snd o get_datatype thy) tyco;
haftmann@30076:     fun drop_outdated_cases cases = fold Symtab.delete_safe
haftmann@30076:       (Symtab.fold (fn (c, (_, (_, cos))) =>
haftmann@30076:         if exists (member (op =) old_cs) cos
haftmann@30076:           then insert (op =) c else I) cases []) cases;
haftmann@24219:   in
haftmann@24219:     thy
haftmann@31091:     |> fold (del_eqns o fst) cs
haftmann@28703:     |> map_exec_purge NONE
haftmann@28695:         ((map_dtyps o Symtab.map_default (tyco, [])) (cons (serial (), vs_cos))
haftmann@30076:         #> (map_cases o apfst) drop_outdated_cases)
haftmann@31962:     |> Type_Interpretation.data (tyco, serial ())
haftmann@24219:   end;
haftmann@24219: 
haftmann@31962: fun type_interpretation f =  Type_Interpretation.interpretation
haftmann@25485:   (fn (tyco, _) => fn thy => f (tyco, get_datatype thy tyco) thy);
haftmann@25485: 
haftmann@24423: fun add_datatype_cmd raw_cs thy =
haftmann@24423:   let
haftmann@31156:     val cs = map (read_bare_const thy) raw_cs;
haftmann@24423:   in add_datatype cs thy end;
haftmann@24219: 
haftmann@31962: 
haftmann@31962: (* code equations *)
haftmann@31962: 
haftmann@33075: fun gen_add_eqn default (thm, proper) thy =
haftmann@33075:   let
haftmann@33075:     val thm' = Thm.close_derivation thm;
haftmann@33075:     val c = const_eqn thy thm';
haftmann@33075:   in change_eqns false c (add_thm thy default (thm', proper)) thy end;
haftmann@31962: 
haftmann@31962: fun add_eqn thm thy =
haftmann@31962:   gen_add_eqn false (mk_eqn thy (thm, true)) thy;
haftmann@31962: 
haftmann@31962: fun add_warning_eqn thm thy =
haftmann@31962:   case mk_eqn_warning thy thm
haftmann@31962:    of SOME eqn => gen_add_eqn false eqn thy
haftmann@31962:     | NONE => thy;
haftmann@31962: 
haftmann@31962: fun add_default_eqn thm thy =
haftmann@31962:   case mk_eqn_liberal thy thm
haftmann@31962:    of SOME eqn => gen_add_eqn true eqn thy
haftmann@31962:     | NONE => thy;
haftmann@31962: 
haftmann@31962: fun add_nbe_eqn thm thy =
haftmann@31962:   gen_add_eqn false (mk_eqn thy (thm, false)) thy;
haftmann@31962: 
haftmann@31962: val add_default_eqn_attribute = Thm.declaration_attribute
haftmann@31962:   (fn thm => Context.mapping (add_default_eqn thm) I);
haftmann@31962: val add_default_eqn_attrib = Attrib.internal (K add_default_eqn_attribute);
haftmann@31962: 
haftmann@31962: fun del_eqn thm thy = case mk_eqn_liberal thy thm
haftmann@31962:  of SOME (thm, _) => change_eqns true (const_eqn thy thm) (del_thm thm) thy
haftmann@31962:   | NONE => thy;
haftmann@31962: 
haftmann@32070: (* c.f. src/HOL/Tools/recfun_codegen.ML *)
haftmann@32070: 
wenzelm@33522: structure Code_Target_Attr = Theory_Data
wenzelm@33522: (
haftmann@31998:   type T = (string -> thm -> theory -> theory) option;
haftmann@31998:   val empty = NONE;
haftmann@31998:   val extend = I;
wenzelm@33522:   fun merge (f1, f2) = if is_some f1 then f1 else f2;
haftmann@31998: );
haftmann@31998: 
haftmann@32070: fun set_code_target_attr f = Code_Target_Attr.map (K (SOME f));
haftmann@32070: 
haftmann@32070: fun code_target_attr prefix thm thy =
haftmann@32070:   let
haftmann@32070:     val attr = the_default ((K o K) I) (Code_Target_Attr.get thy);
haftmann@32070:   in thy |> add_warning_eqn thm |> attr prefix thm end;
haftmann@32070: 
haftmann@32070: (* setup *)
haftmann@31998: 
haftmann@31962: val _ = Context.>> (Context.map_theory
haftmann@31962:   (let
haftmann@31962:     fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
haftmann@31998:     val code_attribute_parser =
haftmann@31998:       Args.del |-- Scan.succeed (mk_attribute del_eqn)
haftmann@31998:       || Args.$$$ "nbe" |-- Scan.succeed (mk_attribute add_nbe_eqn)
haftmann@31998:       || (Args.$$$ "target" |-- Args.colon |-- Args.name >>
haftmann@32070:            (mk_attribute o code_target_attr))
haftmann@31998:       || Scan.succeed (mk_attribute add_warning_eqn);
haftmann@31962:   in
haftmann@31962:     Type_Interpretation.init
haftmann@31998:     #> Attrib.setup (Binding.name "code") (Scan.lift code_attribute_parser)
haftmann@31998:         "declare theorems for code generation"
haftmann@31962:   end));
haftmann@31962: 
haftmann@31962: 
haftmann@31962: (* cases *)
haftmann@31962: 
haftmann@24844: fun add_case thm thy =
haftmann@24844:   let
haftmann@31156:     val (c, (k, case_pats)) = case_cert thm;
haftmann@31088:     val _ = case filter_out (is_constr thy) case_pats
haftmann@30076:      of [] => ()
haftmann@30076:       | cs => error ("Non-constructor(s) in case certificate: " ^ commas (map quote cs));
haftmann@30076:     val entry = (1 + Int.max (1, length case_pats), (k, case_pats))
haftmann@30076:   in (map_exec_purge (SOME [c]) o map_cases o apfst) (Symtab.update (c, entry)) thy end;
haftmann@24844: 
haftmann@24844: fun add_undefined c thy =
haftmann@24844:   (map_exec_purge (SOME [c]) o map_cases o apsnd) (Symtab.update (c, ())) thy;
haftmann@24844: 
haftmann@24219: end; (*struct*)
haftmann@24219: 
haftmann@24219: 
bulwahn@32661: (** type-safe interfaces for data dependent on executable code **)
haftmann@24219: 
haftmann@31962: functor Code_Data_Fun(Data: CODE_DATA_ARGS): CODE_DATA =
haftmann@24219: struct
haftmann@24219: 
haftmann@24219: type T = Data.T;
haftmann@24219: exception Data of T;
haftmann@24219: fun dest (Data x) = x
haftmann@24219: 
haftmann@24219: val kind = Code.declare_data (Data Data.empty)
haftmann@27609:   (fn thy => fn cs => fn Data x => Data (Data.purge thy cs x));
haftmann@24219: 
haftmann@24219: val data_op = (kind, Data, dest);
haftmann@24219: 
haftmann@24219: val get = Code.get_data data_op;
haftmann@24219: val change = Code.change_data data_op;
haftmann@24219: fun change_yield thy = Code.change_yield_data data_op thy;
haftmann@24219: 
haftmann@24219: end;
haftmann@24219: 
haftmann@28143: structure Code : CODE = struct open Code; end;