haftmann@24219: (*  Title:      Tools/code/code_thingol.ML
haftmann@24219:     Author:     Florian Haftmann, TU Muenchen
haftmann@24219: 
haftmann@24219: Intermediate language ("Thin-gol") representing executable code.
haftmann@24918: Representation and translation.
haftmann@24219: *)
haftmann@24219: 
haftmann@24219: infix 8 `%%;
haftmann@24219: infix 4 `$;
haftmann@24219: infix 4 `$$;
haftmann@31724: infixr 3 `|=>;
haftmann@31724: infixr 3 `|==>;
haftmann@24219: 
haftmann@24219: signature BASIC_CODE_THINGOL =
haftmann@24219: sig
haftmann@24219:   type vname = string;
haftmann@24219:   datatype dict =
haftmann@24219:       DictConst of string * dict list list
haftmann@24219:     | DictVar of string list * (vname * (int * int));
haftmann@24219:   datatype itype =
haftmann@24219:       `%% of string * itype list
haftmann@24219:     | ITyVar of vname;
haftmann@31049:   type const = string * ((itype list * dict list list) * itype list (*types of arguments*))
haftmann@24219:   datatype iterm =
haftmann@24591:       IConst of const
haftmann@24219:     | IVar of vname
haftmann@24219:     | `$ of iterm * iterm
haftmann@31724:     | `|=> of (vname * itype) * iterm
haftmann@24219:     | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
haftmann@24219:         (*((term, type), [(selector pattern, body term )]), primitive term)*)
haftmann@24219:   val `$$ : iterm * iterm list -> iterm;
haftmann@31724:   val `|==> : (vname * itype) list * iterm -> iterm;
haftmann@24219:   type typscheme = (vname * sort) list * itype;
haftmann@24219: end;
haftmann@24219: 
haftmann@24219: signature CODE_THINGOL =
haftmann@24219: sig
haftmann@28663:   include BASIC_CODE_THINGOL
haftmann@28663:   val unfoldl: ('a -> ('a * 'b) option) -> 'a -> 'a * 'b list
haftmann@28663:   val unfoldr: ('a -> ('b * 'a) option) -> 'a -> 'b list * 'a
haftmann@28663:   val unfold_fun: itype -> itype list * itype
haftmann@28663:   val unfold_app: iterm -> iterm * iterm list
haftmann@28663:   val split_abs: iterm -> (((vname * iterm option) * itype) * iterm) option
haftmann@28663:   val unfold_abs: iterm -> ((vname * iterm option) * itype) list * iterm
haftmann@28663:   val split_let: iterm -> (((iterm * itype) * iterm) * iterm) option
haftmann@28663:   val unfold_let: iterm -> ((iterm * itype) * iterm) list * iterm
haftmann@31049:   val unfold_const_app: iterm -> (const * iterm list) option
haftmann@24219:   val collapse_let: ((vname * itype) * iterm) * iterm
haftmann@28663:     -> (iterm * itype) * (iterm * iterm) list
haftmann@31049:   val eta_expand: int -> const * iterm list -> iterm
haftmann@28663:   val contains_dictvar: iterm -> bool
haftmann@28663:   val locally_monomorphic: iterm -> bool
haftmann@28663:   val fold_constnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663:   val fold_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663:   val fold_unbound_varnames: (string -> 'a -> 'a) -> iterm -> 'a -> 'a
haftmann@28663: 
haftmann@28663:   type naming
haftmann@28706:   val empty_naming: naming
haftmann@28663:   val lookup_class: naming -> class -> string option
haftmann@28663:   val lookup_classrel: naming -> class * class -> string option
haftmann@28663:   val lookup_tyco: naming -> string -> string option
haftmann@28663:   val lookup_instance: naming -> class * string -> string option
haftmann@28663:   val lookup_const: naming -> string -> string option
haftmann@31054:   val ensure_declared_const: theory -> string -> naming -> string * naming
haftmann@24219: 
haftmann@24918:   datatype stmt =
haftmann@27024:       NoStmt
haftmann@28663:     | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
haftmann@28663:     | Datatype of string * ((vname * sort) list * (string * itype list) list)
haftmann@28663:     | Datatypecons of string * string
haftmann@28663:     | Class of class * (vname * ((class * string) list * (string * itype) list))
haftmann@24219:     | Classrel of class * class
haftmann@28663:     | Classparam of string * class
haftmann@24219:     | Classinst of (class * (string * (vname * sort) list))
haftmann@24219:           * ((class * (string * (string * dict list list))) list
haftmann@28663:         * ((string * const) * (thm * bool)) list)
haftmann@28663:   type program = stmt Graph.T
haftmann@28663:   val empty_funs: program -> string list
haftmann@28663:   val map_terms_bottom_up: (iterm -> iterm) -> iterm -> iterm
haftmann@28663:   val map_terms_stmt: (iterm -> iterm) -> stmt -> stmt
haftmann@28663:   val is_cons: program -> string -> bool
haftmann@28663:   val contr_classparam_typs: program -> string -> itype option list
haftmann@24219: 
haftmann@31036:   val read_const_exprs: theory -> string list -> string list * string list
haftmann@28663:   val consts_program: theory -> string list -> string list * (naming * program)
haftmann@28663:   val cached_program: theory -> naming * program
haftmann@30947:   val eval_conv: theory -> (sort -> sort)
haftmann@31063:     -> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> cterm -> thm)
haftmann@28663:     -> cterm -> thm
haftmann@30970:   val eval: theory -> (sort -> sort) -> ((term -> term) -> 'a -> 'a)
haftmann@31063:     -> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> 'a)
haftmann@28663:     -> term -> 'a
haftmann@24219: end;
haftmann@24219: 
haftmann@28054: structure Code_Thingol: CODE_THINGOL =
haftmann@24219: struct
haftmann@24219: 
haftmann@24219: (** auxiliary **)
haftmann@24219: 
haftmann@24219: fun unfoldl dest x =
haftmann@24219:   case dest x
haftmann@24219:    of NONE => (x, [])
haftmann@24219:     | SOME (x1, x2) =>
haftmann@24219:         let val (x', xs') = unfoldl dest x1 in (x', xs' @ [x2]) end;
haftmann@24219: 
haftmann@24219: fun unfoldr dest x =
haftmann@24219:   case dest x
haftmann@24219:    of NONE => ([], x)
haftmann@24219:     | SOME (x1, x2) =>
haftmann@24219:         let val (xs', x') = unfoldr dest x2 in (x1::xs', x') end;
haftmann@24219: 
haftmann@24219: 
haftmann@29962: (** language core - types, terms **)
haftmann@24219: 
haftmann@24219: type vname = string;
haftmann@24219: 
haftmann@24219: datatype dict =
haftmann@24219:     DictConst of string * dict list list
haftmann@24219:   | DictVar of string list * (vname * (int * int));
haftmann@24219: 
haftmann@24219: datatype itype =
haftmann@24219:     `%% of string * itype list
haftmann@24219:   | ITyVar of vname;
haftmann@24219: 
haftmann@31049: type const = string * ((itype list * dict list list) * itype list (*types of arguments*))
haftmann@24591: 
haftmann@24219: datatype iterm =
haftmann@24591:     IConst of const
haftmann@24219:   | IVar of vname
haftmann@24219:   | `$ of iterm * iterm
haftmann@31724:   | `|=> of (vname * itype) * iterm
haftmann@24219:   | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm;
haftmann@24219:     (*see also signature*)
haftmann@24219: 
haftmann@24219: val op `$$ = Library.foldl (op `$);
haftmann@31724: val op `|==> = Library.foldr (op `|=>);
haftmann@24219: 
haftmann@24219: val unfold_app = unfoldl
haftmann@24219:   (fn op `$ t => SOME t
haftmann@24219:     | _ => NONE);
haftmann@24219: 
haftmann@24219: val split_abs =
haftmann@31724:   (fn (v, ty) `|=> (t as ICase (((IVar w, _), [(p, t')]), _)) =>
haftmann@24219:         if v = w then SOME (((v, SOME p), ty), t') else SOME (((v, NONE), ty), t)
haftmann@31724:     | (v, ty) `|=> t => SOME (((v, NONE), ty), t)
haftmann@24219:     | _ => NONE);
haftmann@24219: 
haftmann@24219: val unfold_abs = unfoldr split_abs;
haftmann@24219: 
haftmann@24219: val split_let = 
haftmann@24219:   (fn ICase (((td, ty), [(p, t)]), _) => SOME (((p, ty), td), t)
haftmann@24219:     | _ => NONE);
haftmann@24219: 
haftmann@24219: val unfold_let = unfoldr split_let;
haftmann@24219: 
haftmann@24219: fun unfold_const_app t =
haftmann@24219:  case unfold_app t
haftmann@24219:   of (IConst c, ts) => SOME (c, ts)
haftmann@24219:    | _ => NONE;
haftmann@24219: 
haftmann@24219: fun fold_aiterms f (t as IConst _) = f t
haftmann@24219:   | fold_aiterms f (t as IVar _) = f t
haftmann@24219:   | fold_aiterms f (t1 `$ t2) = fold_aiterms f t1 #> fold_aiterms f t2
haftmann@31724:   | fold_aiterms f (t as _ `|=> t') = f t #> fold_aiterms f t'
haftmann@24219:   | fold_aiterms f (ICase (_, t)) = fold_aiterms f t;
haftmann@24219: 
haftmann@24219: fun fold_constnames f =
haftmann@24219:   let
haftmann@24219:     fun add (IConst (c, _)) = f c
haftmann@24219:       | add _ = I;
haftmann@24219:   in fold_aiterms add end;
haftmann@24219: 
haftmann@24219: fun fold_varnames f =
haftmann@24219:   let
haftmann@24219:     fun add (IVar v) = f v
haftmann@31724:       | add ((v, _) `|=> _) = f v
haftmann@24219:       | add _ = I;
haftmann@24219:   in fold_aiterms add end;
haftmann@24219: 
haftmann@24219: fun fold_unbound_varnames f =
haftmann@24219:   let
haftmann@24219:     fun add _ (IConst _) = I
haftmann@24219:       | add vs (IVar v) = if not (member (op =) vs v) then f v else I
haftmann@24219:       | add vs (t1 `$ t2) = add vs t1 #> add vs t2
haftmann@31724:       | add vs ((v, _) `|=> t) = add (insert (op =) v vs) t
haftmann@24219:       | add vs (ICase (_, t)) = add vs t;
haftmann@24219:   in add [] end;
haftmann@24219: 
haftmann@24219: fun collapse_let (((v, ty), se), be as ICase (((IVar w, _), ds), _)) =
haftmann@24219:       let
haftmann@24219:         fun exists_v t = fold_unbound_varnames (fn w => fn b =>
haftmann@24219:           b orelse v = w) t false;
haftmann@24219:       in if v = w andalso forall (fn (t1, t2) =>
haftmann@24219:         exists_v t1 orelse not (exists_v t2)) ds
haftmann@24219:         then ((se, ty), ds)
haftmann@24219:         else ((se, ty), [(IVar v, be)])
haftmann@24219:       end
haftmann@24219:   | collapse_let (((v, ty), se), be) =
haftmann@24219:       ((se, ty), [(IVar v, be)])
haftmann@24219: 
haftmann@27711: fun eta_expand k (c as (_, (_, tys)), ts) =
haftmann@24219:   let
haftmann@24219:     val j = length ts;
haftmann@24219:     val l = k - j;
haftmann@24219:     val ctxt = (fold o fold_varnames) Name.declare ts Name.context;
haftmann@24219:     val vs_tys = Name.names ctxt "a" ((curry Library.take l o curry Library.drop j) tys);
haftmann@31724:   in vs_tys `|==> IConst c `$$ ts @ map (fn (v, _) => IVar v) vs_tys end;
haftmann@24219: 
haftmann@24662: fun contains_dictvar t =
haftmann@24662:   let
haftmann@24662:     fun contains (DictConst (_, dss)) = (fold o fold) contains dss
haftmann@24662:       | contains (DictVar _) = K true;
haftmann@24662:   in
haftmann@24662:     fold_aiterms
haftmann@31049:       (fn IConst (_, ((_, dss), _)) => (fold o fold) contains dss | _ => I) t false
haftmann@24662:   end;
haftmann@24662:   
haftmann@25621: fun locally_monomorphic (IConst _) = false
haftmann@25621:   | locally_monomorphic (IVar _) = true
haftmann@25621:   | locally_monomorphic (t `$ _) = locally_monomorphic t
haftmann@31724:   | locally_monomorphic (_ `|=> t) = locally_monomorphic t
haftmann@25621:   | locally_monomorphic (ICase ((_, ds), _)) = exists (locally_monomorphic o snd) ds;
haftmann@25621: 
haftmann@25621: 
haftmann@28688: (** namings **)
haftmann@28663: 
haftmann@28663: (* policies *)
haftmann@28663: 
haftmann@28663: local
haftmann@28663:   fun thyname_of thy f x = the (AList.lookup (op =) (f x) Markup.theory_nameN);
haftmann@28663:   fun thyname_of_class thy =
haftmann@28663:     thyname_of thy (ProofContext.query_class (ProofContext.init thy));
haftmann@28663:   fun thyname_of_tyco thy =
haftmann@28663:     thyname_of thy (Type.the_tags (Sign.tsig_of thy));
haftmann@28663:   fun thyname_of_instance thy inst = case AxClass.arity_property thy inst Markup.theory_nameN
haftmann@28663:    of [] => error ("no such instance: " ^ quote (snd inst ^ " :: " ^ fst inst))
haftmann@28663:     | thyname :: _ => thyname;
haftmann@28706:   fun thyname_of_const thy c = case AxClass.class_of_param thy c
haftmann@28706:    of SOME class => thyname_of_class thy class
haftmann@28706:     | NONE => (case Code.get_datatype_of_constr thy c
haftmann@28706:        of SOME dtco => thyname_of_tyco thy dtco
haftmann@28706:         | NONE => thyname_of thy (Consts.the_tags (Sign.consts_of thy)) c);
haftmann@31036:   fun purify_base "op &" = "and"
haftmann@31036:     | purify_base "op |" = "or"
haftmann@31036:     | purify_base "op -->" = "implies"
haftmann@31036:     | purify_base "op :" = "member"
haftmann@31036:     | purify_base "op =" = "eq"
haftmann@31036:     | purify_base "*" = "product"
haftmann@31036:     | purify_base "+" = "sum"
haftmann@31036:     | purify_base s = Name.desymbolize false s;
haftmann@28663:   fun namify thy get_basename get_thyname name =
haftmann@28663:     let
haftmann@28663:       val prefix = get_thyname thy name;
haftmann@31036:       val base = (purify_base o get_basename) name;
wenzelm@30364:     in Long_Name.append prefix base end;
haftmann@28663: in
haftmann@28663: 
wenzelm@30364: fun namify_class thy = namify thy Long_Name.base_name thyname_of_class;
haftmann@28663: fun namify_classrel thy = namify thy (fn (class1, class2) => 
wenzelm@30364:   Long_Name.base_name class2 ^ "_" ^ Long_Name.base_name class1) (fn thy => thyname_of_class thy o fst);
haftmann@28663:   (*order fits nicely with composed projections*)
haftmann@28688: fun namify_tyco thy "fun" = "Pure.fun"
wenzelm@30364:   | namify_tyco thy tyco = namify thy Long_Name.base_name thyname_of_tyco tyco;
haftmann@28663: fun namify_instance thy = namify thy (fn (class, tyco) => 
wenzelm@30364:   Long_Name.base_name class ^ "_" ^ Long_Name.base_name tyco) thyname_of_instance;
wenzelm@30364: fun namify_const thy = namify thy Long_Name.base_name thyname_of_const;
haftmann@28663: 
haftmann@28663: end; (* local *)
haftmann@28663: 
haftmann@28663: 
haftmann@28688: (* data *)
haftmann@28663: 
haftmann@28663: datatype naming = Naming of {
haftmann@28663:   class: class Symtab.table * Name.context,
haftmann@30648:   classrel: string Symreltab.table * Name.context,
haftmann@28663:   tyco: string Symtab.table * Name.context,
haftmann@30648:   instance: string Symreltab.table * Name.context,
haftmann@28663:   const: string Symtab.table * Name.context
haftmann@28663: }
haftmann@28663: 
haftmann@28663: fun dest_Naming (Naming naming) = naming;
haftmann@28663: 
haftmann@28663: val empty_naming = Naming {
haftmann@28663:   class = (Symtab.empty, Name.context),
haftmann@30648:   classrel = (Symreltab.empty, Name.context),
haftmann@28663:   tyco = (Symtab.empty, Name.context),
haftmann@30648:   instance = (Symreltab.empty, Name.context),
haftmann@28663:   const = (Symtab.empty, Name.context)
haftmann@28663: };
haftmann@28663: 
haftmann@28663: local
haftmann@28663:   fun mk_naming (class, classrel, tyco, instance, const) =
haftmann@28663:     Naming { class = class, classrel = classrel,
haftmann@28663:       tyco = tyco, instance = instance, const = const };
haftmann@28663:   fun map_naming f (Naming { class, classrel, tyco, instance, const }) =
haftmann@28663:     mk_naming (f (class, classrel, tyco, instance, const));
haftmann@28663: in
haftmann@28663:   fun map_class f = map_naming
haftmann@28663:     (fn (class, classrel, tyco, inst, const) =>
haftmann@28663:       (f class, classrel, tyco, inst, const));
haftmann@28663:   fun map_classrel f = map_naming
haftmann@28663:     (fn (class, classrel, tyco, inst, const) =>
haftmann@28663:       (class, f classrel, tyco, inst, const));
haftmann@28663:   fun map_tyco f = map_naming
haftmann@28663:     (fn (class, classrel, tyco, inst, const) =>
haftmann@28663:       (class, classrel, f tyco, inst, const));
haftmann@28663:   fun map_instance f = map_naming
haftmann@28663:     (fn (class, classrel, tyco, inst, const) =>
haftmann@28663:       (class, classrel, tyco, f inst, const));
haftmann@28663:   fun map_const f = map_naming
haftmann@28663:     (fn (class, classrel, tyco, inst, const) =>
haftmann@28663:       (class, classrel, tyco, inst, f const));
haftmann@28663: end; (*local*)
haftmann@28663: 
haftmann@28663: fun add_variant update (thing, name) (tab, used) =
haftmann@28663:   let
haftmann@28663:     val (name', used') = yield_singleton Name.variants name used;
haftmann@28663:     val tab' = update (thing, name') tab;
haftmann@28663:   in (tab', used') end;
haftmann@28663: 
haftmann@28663: fun declare thy mapp lookup update namify thing =
haftmann@28663:   mapp (add_variant update (thing, namify thy thing))
haftmann@28663:   #> `(fn naming => the (lookup naming thing));
haftmann@28663: 
haftmann@28688: 
haftmann@28688: (* lookup and declare *)
haftmann@28688: 
haftmann@28688: local
haftmann@28688: 
haftmann@28688: val suffix_class = "class";
haftmann@28688: val suffix_classrel = "classrel"
haftmann@28688: val suffix_tyco = "tyco";
haftmann@28688: val suffix_instance = "inst";
haftmann@28688: val suffix_const = "const";
haftmann@28688: 
haftmann@28688: fun add_suffix nsp NONE = NONE
wenzelm@30364:   | add_suffix nsp (SOME name) = SOME (Long_Name.append name nsp);
haftmann@28688: 
haftmann@28688: in
haftmann@28688: 
haftmann@28663: val lookup_class = add_suffix suffix_class
haftmann@28663:   oo Symtab.lookup o fst o #class o dest_Naming;
haftmann@28663: val lookup_classrel = add_suffix suffix_classrel
haftmann@30648:   oo Symreltab.lookup o fst o #classrel o dest_Naming;
haftmann@28663: val lookup_tyco = add_suffix suffix_tyco
haftmann@28663:   oo Symtab.lookup o fst o #tyco o dest_Naming;
haftmann@28663: val lookup_instance = add_suffix suffix_instance
haftmann@30648:   oo Symreltab.lookup o fst o #instance o dest_Naming;
haftmann@28663: val lookup_const = add_suffix suffix_const
haftmann@28663:   oo Symtab.lookup o fst o #const o dest_Naming;
haftmann@28663: 
haftmann@28663: fun declare_class thy = declare thy map_class
haftmann@28663:   lookup_class Symtab.update_new namify_class;
haftmann@28663: fun declare_classrel thy = declare thy map_classrel
haftmann@30648:   lookup_classrel Symreltab.update_new namify_classrel;
haftmann@28663: fun declare_tyco thy = declare thy map_tyco
haftmann@28663:   lookup_tyco Symtab.update_new namify_tyco;
haftmann@28663: fun declare_instance thy = declare thy map_instance
haftmann@30648:   lookup_instance Symreltab.update_new namify_instance;
haftmann@28663: fun declare_const thy = declare thy map_const
haftmann@28663:   lookup_const Symtab.update_new namify_const;
haftmann@28663: 
haftmann@31054: fun ensure_declared_const thy const naming =
haftmann@31054:   case lookup_const naming const
haftmann@31054:    of SOME const' => (const', naming)
haftmann@31054:     | NONE => declare_const thy const naming;
haftmann@31054: 
haftmann@28688: val unfold_fun = unfoldr
haftmann@28688:   (fn "Pure.fun.tyco" `%% [ty1, ty2] => SOME (ty1, ty2)
haftmann@28688:     | _ => NONE); (*depends on suffix_tyco and namify_tyco!*)
haftmann@28688: 
haftmann@28688: end; (* local *)
haftmann@28688: 
haftmann@24219: 
haftmann@27103: (** statements, abstract programs **)
haftmann@24219: 
haftmann@24219: type typscheme = (vname * sort) list * itype;
haftmann@24918: datatype stmt =
haftmann@27024:     NoStmt
haftmann@28663:   | Fun of string * (typscheme * ((iterm list * iterm) * (thm * bool)) list)
haftmann@28663:   | Datatype of string * ((vname * sort) list * (string * itype list) list)
haftmann@28663:   | Datatypecons of string * string
haftmann@28663:   | Class of class * (vname * ((class * string) list * (string * itype) list))
haftmann@24219:   | Classrel of class * class
haftmann@28663:   | Classparam of string * class
haftmann@24219:   | Classinst of (class * (string * (vname * sort) list))
haftmann@24219:         * ((class * (string * (string * dict list list))) list
haftmann@28350:       * ((string * const) * (thm * bool)) list);
haftmann@24219: 
haftmann@27103: type program = stmt Graph.T;
haftmann@24219: 
haftmann@27103: fun empty_funs program =
haftmann@28663:   Graph.fold (fn (name, (Fun (c, (_, [])), _)) => cons c
haftmann@27103:                | _ => I) program [];
haftmann@24219: 
haftmann@27711: fun map_terms_bottom_up f (t as IConst _) = f t
haftmann@27711:   | map_terms_bottom_up f (t as IVar _) = f t
haftmann@27711:   | map_terms_bottom_up f (t1 `$ t2) = f
haftmann@27711:       (map_terms_bottom_up f t1 `$ map_terms_bottom_up f t2)
haftmann@31724:   | map_terms_bottom_up f ((v, ty) `|=> t) = f
haftmann@31724:       ((v, ty) `|=> map_terms_bottom_up f t)
haftmann@27711:   | map_terms_bottom_up f (ICase (((t, ty), ps), t0)) = f
haftmann@27711:       (ICase (((map_terms_bottom_up f t, ty), (map o pairself)
haftmann@27711:         (map_terms_bottom_up f) ps), map_terms_bottom_up f t0));
haftmann@27711: 
haftmann@27711: fun map_terms_stmt f NoStmt = NoStmt
haftmann@28663:   | map_terms_stmt f (Fun (c, (tysm, eqs))) = Fun (c, (tysm, (map o apfst)
haftmann@28663:       (fn (ts, t) => (map f ts, f t)) eqs))
haftmann@27711:   | map_terms_stmt f (stmt as Datatype _) = stmt
haftmann@27711:   | map_terms_stmt f (stmt as Datatypecons _) = stmt
haftmann@27711:   | map_terms_stmt f (stmt as Class _) = stmt
haftmann@27711:   | map_terms_stmt f (stmt as Classrel _) = stmt
haftmann@27711:   | map_terms_stmt f (stmt as Classparam _) = stmt
haftmann@27711:   | map_terms_stmt f (Classinst (arity, (superarities, classparms))) =
haftmann@27711:       Classinst (arity, (superarities, (map o apfst o apsnd) (fn const =>
haftmann@27711:         case f (IConst const) of IConst const' => const') classparms));
haftmann@27711: 
haftmann@27103: fun is_cons program name = case Graph.get_node program name
haftmann@24219:  of Datatypecons _ => true
haftmann@24219:   | _ => false;
haftmann@24219: 
haftmann@27103: fun contr_classparam_typs program name = case Graph.get_node program name
haftmann@28663:  of Classparam (_, class) => let
haftmann@28663:         val Class (_, (_, (_, params))) = Graph.get_node program class;
haftmann@25621:         val SOME ty = AList.lookup (op =) params name;
haftmann@25621:         val (tys, res_ty) = unfold_fun ty;
haftmann@25621:         fun no_tyvar (_ `%% tys) = forall no_tyvar tys
haftmann@25621:           | no_tyvar (ITyVar _) = false;
haftmann@25621:       in if no_tyvar res_ty
haftmann@25621:         then map (fn ty => if no_tyvar ty then NONE else SOME ty) tys
haftmann@25621:         else []
haftmann@25621:       end
haftmann@25621:   | _ => [];
haftmann@25621: 
haftmann@24219: 
haftmann@27103: (** translation kernel **)
haftmann@24219: 
haftmann@28724: (* generic mechanisms *)
haftmann@28724: 
haftmann@28663: fun ensure_stmt lookup declare generate thing (dep, (naming, program)) =
haftmann@24219:   let
haftmann@28706:     fun add_dep name = case dep of NONE => I
haftmann@28706:       | SOME dep => Graph.add_edge (dep, name);
haftmann@28706:     val (name, naming') = case lookup naming thing
haftmann@28706:      of SOME name => (name, naming)
haftmann@28706:       | NONE => declare thing naming;
haftmann@28706:   in case try (Graph.get_node program) name
haftmann@28706:    of SOME stmt => program
haftmann@28663:         |> add_dep name
haftmann@28706:         |> pair naming'
haftmann@28663:         |> pair dep
haftmann@28663:         |> pair name
haftmann@28706:     | NONE => program
haftmann@28706:         |> Graph.default_node (name, NoStmt)
haftmann@28706:         |> add_dep name
haftmann@28706:         |> pair naming'
haftmann@28706:         |> curry generate (SOME name)
haftmann@28706:         ||> snd
haftmann@28706:         |-> (fn stmt => (apsnd o Graph.map_node name) (K stmt))
haftmann@28706:         |> pair dep
haftmann@28706:         |> pair name
haftmann@24219:   end;
haftmann@24219: 
haftmann@26972: fun not_wellsorted thy thm ty sort e =
haftmann@26972:   let
haftmann@26972:     val err_class = Sorts.class_error (Syntax.pp_global thy) e;
haftmann@26972:     val err_thm = case thm
haftmann@30023:      of SOME thm => "\n(in code equation " ^ Display.string_of_thm thm ^ ")" | NONE => "";
haftmann@26972:     val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort "
haftmann@26972:       ^ Syntax.string_of_sort_global thy sort;
haftmann@26972:   in error ("Wellsortedness error" ^ err_thm ^ ":\n" ^ err_typ ^ "\n" ^ err_class) end;
haftmann@26972: 
haftmann@28724: 
haftmann@28724: (* translation *)
haftmann@28724: 
haftmann@30932: fun ensure_tyco thy algbr funcgr tyco =
haftmann@30932:   let
haftmann@30932:     val stmt_datatype =
haftmann@30932:       let
haftmann@30932:         val (vs, cos) = Code.get_datatype thy tyco;
haftmann@30932:       in
haftmann@30932:         fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@30932:         ##>> fold_map (fn (c, tys) =>
haftmann@30932:           ensure_const thy algbr funcgr c
haftmann@30932:           ##>> fold_map (translate_typ thy algbr funcgr) tys) cos
haftmann@30932:         #>> (fn info => Datatype (tyco, info))
haftmann@30932:       end;
haftmann@30932:   in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end
haftmann@30932: and ensure_const thy algbr funcgr c =
haftmann@30932:   let
haftmann@30932:     fun stmt_datatypecons tyco =
haftmann@30932:       ensure_tyco thy algbr funcgr tyco
haftmann@30932:       #>> (fn tyco => Datatypecons (c, tyco));
haftmann@30932:     fun stmt_classparam class =
haftmann@30932:       ensure_class thy algbr funcgr class
haftmann@30932:       #>> (fn class => Classparam (c, class));
haftmann@30932:     fun stmt_fun ((vs, ty), raw_thms) =
haftmann@30932:       let
haftmann@30932:         val thms = if null (Term.add_tfreesT ty []) orelse (null o fst o strip_type) ty
haftmann@30932:           then raw_thms
haftmann@31156:           else (map o apfst) (Code.expand_eta thy 1) raw_thms;
haftmann@30932:       in
haftmann@30932:         fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@30932:         ##>> translate_typ thy algbr funcgr ty
haftmann@30932:         ##>> fold_map (translate_eq thy algbr funcgr) thms
haftmann@30932:         #>> (fn info => Fun (c, info))
haftmann@30932:       end;
haftmann@30932:     val stmt_const = case Code.get_datatype_of_constr thy c
haftmann@30932:      of SOME tyco => stmt_datatypecons tyco
haftmann@30932:       | NONE => (case AxClass.class_of_param thy c
haftmann@30932:          of SOME class => stmt_classparam class
haftmann@31125:           | NONE => stmt_fun (Code_Preproc.typ funcgr c, Code_Preproc.eqns funcgr c))
haftmann@30932:   in ensure_stmt lookup_const (declare_const thy) stmt_const c end
haftmann@30932: and ensure_class thy (algbr as (_, algebra)) funcgr class =
haftmann@24918:   let
haftmann@28924:     val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
wenzelm@24969:     val cs = #params (AxClass.get_info thy class);
haftmann@24918:     val stmt_class =
haftmann@24918:       fold_map (fn superclass => ensure_class thy algbr funcgr superclass
haftmann@24918:         ##>> ensure_classrel thy algbr funcgr (class, superclass)) superclasses
haftmann@24918:       ##>> fold_map (fn (c, ty) => ensure_const thy algbr funcgr c
haftmann@28688:         ##>> translate_typ thy algbr funcgr ty) cs
haftmann@28663:       #>> (fn info => Class (class, (unprefix "'" Name.aT, info)))
haftmann@28663:   in ensure_stmt lookup_class (declare_class thy) stmt_class class end
haftmann@24918: and ensure_classrel thy algbr funcgr (subclass, superclass) =
haftmann@24918:   let
haftmann@24918:     val stmt_classrel =
haftmann@24918:       ensure_class thy algbr funcgr subclass
haftmann@24918:       ##>> ensure_class thy algbr funcgr superclass
haftmann@24918:       #>> Classrel;
haftmann@28663:   in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (subclass, superclass) end
haftmann@26972: and ensure_inst thy (algbr as (_, algebra)) funcgr (class, tyco) =
haftmann@24918:   let
haftmann@28924:     val superclasses = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class;
wenzelm@24969:     val classparams = these (try (#params o AxClass.get_info thy) class);
haftmann@24918:     val vs = Name.names Name.context "'a" (Sorts.mg_domain algebra tyco [class]);
haftmann@24918:     val sorts' = Sorts.mg_domain (Sign.classes_of thy) tyco [class];
haftmann@24918:     val vs' = map2 (fn (v, sort1) => fn sort2 => (v,
haftmann@24918:       Sorts.inter_sort (Sign.classes_of thy) (sort1, sort2))) vs sorts';
haftmann@24918:     val arity_typ = Type (tyco, map TFree vs);
haftmann@24918:     val arity_typ' = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) vs');
haftmann@28688:     fun translate_superarity superclass =
haftmann@24918:       ensure_class thy algbr funcgr superclass
haftmann@24918:       ##>> ensure_classrel thy algbr funcgr (class, superclass)
haftmann@28688:       ##>> translate_dicts thy algbr funcgr NONE (arity_typ, [superclass])
haftmann@24918:       #>> (fn ((superclass, classrel), [DictConst (inst, dss)]) =>
haftmann@24918:             (superclass, (classrel, (inst, dss))));
haftmann@28688:     fun translate_classparam_inst (c, ty) =
haftmann@24918:       let
haftmann@24918:         val c_inst = Const (c, map_type_tfree (K arity_typ') ty);
haftmann@25597:         val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy c_inst);
haftmann@24918:         val c_ty = (apsnd Logic.unvarifyT o dest_Const o snd
haftmann@24918:           o Logic.dest_equals o Thm.prop_of) thm;
haftmann@24918:       in
haftmann@24918:         ensure_const thy algbr funcgr c
haftmann@28688:         ##>> translate_const thy algbr funcgr (SOME thm) c_ty
haftmann@28350:         #>> (fn (c, IConst c_inst) => ((c, c_inst), (thm, true)))
haftmann@24918:       end;
haftmann@24918:     val stmt_inst =
haftmann@24918:       ensure_class thy algbr funcgr class
haftmann@24918:       ##>> ensure_tyco thy algbr funcgr tyco
haftmann@28688:       ##>> fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@28688:       ##>> fold_map translate_superarity superclasses
haftmann@28688:       ##>> fold_map translate_classparam_inst classparams
haftmann@24918:       #>> (fn ((((class, tyco), arity), superarities), classparams) =>
haftmann@24918:              Classinst ((class, (tyco, arity)), (superarities, classparams)));
haftmann@28663:   in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end
haftmann@30932: and translate_typ thy algbr funcgr (TFree (v, _)) =
haftmann@30932:       pair (ITyVar (unprefix "'" v))
haftmann@30932:   | translate_typ thy algbr funcgr (Type (tyco, tys)) =
haftmann@24918:       ensure_tyco thy algbr funcgr tyco
haftmann@30932:       ##>> fold_map (translate_typ thy algbr funcgr) tys
haftmann@30932:       #>> (fn (tyco, tys) => tyco `%% tys)
haftmann@28688: and translate_term thy algbr funcgr thm (Const (c, ty)) =
haftmann@28688:       translate_app thy algbr funcgr thm ((c, ty), [])
haftmann@28688:   | translate_term thy algbr funcgr thm (Free (v, _)) =
haftmann@24918:       pair (IVar v)
haftmann@28688:   | translate_term thy algbr funcgr thm (Abs (abs as (_, ty, _))) =
haftmann@24918:       let
haftmann@24918:         val (v, t) = Syntax.variant_abs abs;
haftmann@24918:       in
haftmann@28688:         translate_typ thy algbr funcgr ty
haftmann@28688:         ##>> translate_term thy algbr funcgr thm t
haftmann@31724:         #>> (fn (ty, t) => (v, ty) `|=> t)
haftmann@24918:       end
haftmann@28688:   | translate_term thy algbr funcgr thm (t as _ $ _) =
haftmann@24918:       case strip_comb t
haftmann@24918:        of (Const (c, ty), ts) =>
haftmann@28688:             translate_app thy algbr funcgr thm ((c, ty), ts)
haftmann@24918:         | (t', ts) =>
haftmann@28688:             translate_term thy algbr funcgr thm t'
haftmann@28688:             ##>> fold_map (translate_term thy algbr funcgr thm) ts
haftmann@24918:             #>> (fn (t, ts) => t `$$ ts)
haftmann@31088: and translate_eq thy algbr funcgr (thm, proper) =
haftmann@30932:   let
haftmann@30932:     val (args, rhs) = (apfst (snd o strip_comb) o Logic.dest_equals
haftmann@30932:       o Logic.unvarify o prop_of) thm;
haftmann@30932:   in
haftmann@30932:     fold_map (translate_term thy algbr funcgr (SOME thm)) args
haftmann@30932:     ##>> translate_term thy algbr funcgr (SOME thm) rhs
haftmann@31088:     #>> rpair (thm, proper)
haftmann@30932:   end
haftmann@28688: and translate_const thy algbr funcgr thm (c, ty) =
haftmann@26972:   let
haftmann@26972:     val tys = Sign.const_typargs thy (c, ty);
haftmann@31125:     val sorts = (map snd o fst o Code_Preproc.typ funcgr) c;
haftmann@26972:     val tys_args = (fst o Term.strip_type) ty;
haftmann@26972:   in
haftmann@26972:     ensure_const thy algbr funcgr c
haftmann@31049:     ##>> fold_map (translate_typ thy algbr funcgr) tys
haftmann@28688:     ##>> fold_map (translate_dicts thy algbr funcgr thm) (tys ~~ sorts)
haftmann@28688:     ##>> fold_map (translate_typ thy algbr funcgr) tys_args
haftmann@31049:     #>> (fn (((c, tys), iss), tys_args) => IConst (c, ((tys, iss), tys_args)))
haftmann@26972:   end
haftmann@29973: and translate_app_const thy algbr funcgr thm (c_ty, ts) =
haftmann@28688:   translate_const thy algbr funcgr thm c_ty
haftmann@28688:   ##>> fold_map (translate_term thy algbr funcgr thm) ts
haftmann@24918:   #>> (fn (t, ts) => t `$$ ts)
haftmann@29952: and translate_case thy algbr funcgr thm (num_args, (t_pos, case_pats)) (c_ty, ts) =
haftmann@24918:   let
haftmann@29952:     val (tys, _) = (chop num_args o fst o strip_type o snd) c_ty;
haftmann@29952:     val t = nth ts t_pos;
haftmann@29952:     val ty = nth tys t_pos;
haftmann@29952:     val ts_clause = nth_drop t_pos ts;
haftmann@29952:     fun mk_clause (co, num_co_args) t =
haftmann@24918:       let
haftmann@29952:         val (vs, body) = Term.strip_abs_eta num_co_args t;
haftmann@29952:         val not_undefined = case body
haftmann@29952:          of (Const (c, _)) => not (Code.is_undefined thy c)
haftmann@29952:           | _ => true;
haftmann@29952:         val pat = list_comb (Const (co, map snd vs ---> ty), map Free vs);
haftmann@29952:       in (not_undefined, (pat, body)) end;
haftmann@29952:     val clauses = if null case_pats then let val ([v_ty], body) =
haftmann@29952:         Term.strip_abs_eta 1 (the_single ts_clause)
haftmann@29952:       in [(true, (Free v_ty, body))] end
haftmann@29952:       else map (uncurry mk_clause)
haftmann@31156:         (AList.make (Code.no_args thy) case_pats ~~ ts_clause);
haftmann@29952:     fun retermify ty (_, (IVar x, body)) =
haftmann@31724:           (x, ty) `|=> body
haftmann@29952:       | retermify _ (_, (pat, body)) =
haftmann@24918:           let
haftmann@29952:             val (IConst (_, (_, tys)), ts) = unfold_app pat;
haftmann@29952:             val vs = map2 (fn IVar x => fn ty => (x, ty)) ts tys;
haftmann@31724:           in vs `|==> body end;
haftmann@29952:     fun mk_icase const t ty clauses =
haftmann@29952:       let
haftmann@29952:         val (ts1, ts2) = chop t_pos (map (retermify ty) clauses);
haftmann@29952:       in
haftmann@29952:         ICase (((t, ty), map_filter (fn (b, d) => if b then SOME d else NONE) clauses),
haftmann@29952:           const `$$ (ts1 @ t :: ts2))
haftmann@29952:       end;
haftmann@24918:   in
haftmann@29952:     translate_const thy algbr funcgr thm c_ty
haftmann@29952:     ##>> translate_term thy algbr funcgr thm t
haftmann@29952:     ##>> translate_typ thy algbr funcgr ty
haftmann@29952:     ##>> fold_map (fn (b, (pat, body)) => translate_term thy algbr funcgr thm pat
haftmann@29952:       ##>> translate_term thy algbr funcgr thm body
haftmann@29952:       #>> pair b) clauses
haftmann@29952:     #>> (fn (((const, t), ty), ds) => mk_icase const t ty ds)
haftmann@24918:   end
haftmann@29973: and translate_app_case thy algbr funcgr thm (case_scheme as (num_args, _)) ((c, ty), ts) =
haftmann@29973:   if length ts < num_args then
haftmann@29973:     let
haftmann@29973:       val k = length ts;
haftmann@29973:       val tys = (curry Library.take (num_args - k) o curry Library.drop k o fst o strip_type) ty;
haftmann@29973:       val ctxt = (fold o fold_aterms) Term.declare_term_frees ts Name.context;
haftmann@29973:       val vs = Name.names ctxt "a" tys;
haftmann@29973:     in
haftmann@29973:       fold_map (translate_typ thy algbr funcgr) tys
haftmann@29973:       ##>> translate_case thy algbr funcgr thm case_scheme ((c, ty), ts @ map Free vs)
haftmann@31724:       #>> (fn (tys, t) => map2 (fn (v, _) => pair v) vs tys `|==> t)
haftmann@29973:     end
haftmann@29973:   else if length ts > num_args then
haftmann@29973:     translate_case thy algbr funcgr thm case_scheme ((c, ty), Library.take (num_args, ts))
haftmann@29973:     ##>> fold_map (translate_term thy algbr funcgr thm) (Library.drop (num_args, ts))
haftmann@29973:     #>> (fn (t, ts) => t `$$ ts)
haftmann@29973:   else
haftmann@29973:     translate_case thy algbr funcgr thm case_scheme ((c, ty), ts)
haftmann@29973: and translate_app thy algbr funcgr thm (c_ty_ts as ((c, _), _)) =
haftmann@29973:   case Code.get_case_scheme thy c
haftmann@30023:    of SOME case_scheme => translate_app_case thy algbr funcgr thm case_scheme c_ty_ts
haftmann@30932:     | NONE => translate_app_const thy algbr funcgr thm c_ty_ts
haftmann@30932: and translate_tyvar_sort thy (algbr as (proj_sort, _)) funcgr (v, sort) =
haftmann@30932:   fold_map (ensure_class thy algbr funcgr) (proj_sort sort)
haftmann@30932:   #>> (fn sort => (unprefix "'" v, sort))
haftmann@30932: and translate_dicts thy (algbr as (proj_sort, algebra)) funcgr thm (ty, sort) =
haftmann@30932:   let
haftmann@30932:     val pp = Syntax.pp_global thy;
haftmann@30932:     datatype typarg =
haftmann@30932:         Global of (class * string) * typarg list list
haftmann@30932:       | Local of (class * class) list * (string * (int * sort));
haftmann@30932:     fun class_relation (Global ((_, tyco), yss), _) class =
haftmann@30932:           Global ((class, tyco), yss)
haftmann@30932:       | class_relation (Local (classrels, v), subclass) superclass =
haftmann@30932:           Local ((subclass, superclass) :: classrels, v);
haftmann@30932:     fun type_constructor tyco yss class =
haftmann@30932:       Global ((class, tyco), (map o map) fst yss);
haftmann@30932:     fun type_variable (TFree (v, sort)) =
haftmann@30932:       let
haftmann@30932:         val sort' = proj_sort sort;
haftmann@30932:       in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end;
haftmann@30932:     val typargs = Sorts.of_sort_derivation pp algebra
haftmann@30932:       {class_relation = class_relation, type_constructor = type_constructor,
haftmann@30932:        type_variable = type_variable} (ty, proj_sort sort)
haftmann@30932:       handle Sorts.CLASS_ERROR e => not_wellsorted thy thm ty sort e;
haftmann@30932:     fun mk_dict (Global (inst, yss)) =
haftmann@30932:           ensure_inst thy algbr funcgr inst
haftmann@30932:           ##>> (fold_map o fold_map) mk_dict yss
haftmann@30932:           #>> (fn (inst, dss) => DictConst (inst, dss))
haftmann@30932:       | mk_dict (Local (classrels, (v, (k, sort)))) =
haftmann@30932:           fold_map (ensure_classrel thy algbr funcgr) classrels
haftmann@30932:           #>> (fn classrels => DictVar (classrels, (unprefix "'" v, (k, length sort))))
haftmann@30932:   in fold_map mk_dict typargs end;
haftmann@24918: 
haftmann@25969: 
haftmann@27103: (* store *)
haftmann@27103: 
haftmann@27103: structure Program = CodeDataFun
haftmann@27103: (
haftmann@28663:   type T = naming * program;
haftmann@28663:   val empty = (empty_naming, Graph.empty);
haftmann@28706:   fun purge thy cs (naming, program) =
haftmann@27609:     let
haftmann@28706:       val names_delete = cs
haftmann@28706:         |> map_filter (lookup_const naming)
haftmann@28706:         |> filter (can (Graph.get_node program))
haftmann@28706:         |> Graph.all_preds program;
haftmann@28706:       val program' = Graph.del_nodes names_delete program;
haftmann@28706:     in (naming, program') end;
haftmann@27103: );
haftmann@27103: 
haftmann@27103: val cached_program = Program.get;
haftmann@25969: 
haftmann@28924: fun invoke_generation thy (algebra, funcgr) f name =
haftmann@28663:   Program.change_yield thy (fn naming_program => (NONE, naming_program)
haftmann@28924:     |> f thy algebra funcgr name
haftmann@28663:     |-> (fn name => fn (_, naming_program) => (name, naming_program)));
haftmann@27103: 
haftmann@27103: 
haftmann@27103: (* program generation *)
haftmann@27103: 
haftmann@27103: fun consts_program thy cs =
haftmann@27103:   let
haftmann@28663:     fun project_consts cs (naming, program) =
haftmann@27103:       let
haftmann@27103:         val cs_all = Graph.all_succs program cs;
haftmann@28663:       in (cs, (naming, Graph.subgraph (member (op =) cs_all) program)) end;
haftmann@27103:     fun generate_consts thy algebra funcgr =
haftmann@27103:       fold_map (ensure_const thy algebra funcgr);
haftmann@27103:   in
haftmann@31125:     invoke_generation thy (Code_Preproc.obtain thy cs []) generate_consts cs
haftmann@27103:     |-> project_consts
haftmann@27103:   end;
haftmann@27103: 
haftmann@27103: 
haftmann@27103: (* value evaluation *)
haftmann@25969: 
haftmann@31063: fun ensure_value thy algbr funcgr t =
haftmann@24918:   let
haftmann@24918:     val ty = fastype_of t;
haftmann@24918:     val vs = fold_term_types (K (fold_atyps (insert (eq_fst op =)
haftmann@24918:       o dest_TFree))) t [];
haftmann@24918:     val stmt_value =
haftmann@28688:       fold_map (translate_tyvar_sort thy algbr funcgr) vs
haftmann@28688:       ##>> translate_typ thy algbr funcgr ty
haftmann@28688:       ##>> translate_term thy algbr funcgr NONE t
haftmann@28663:       #>> (fn ((vs, ty), t) => Fun
haftmann@28663:         (Term.dummy_patternN, ((vs, ty), [(([], t), (Drule.dummy_thm, true))])));
haftmann@31063:     fun term_value (dep, (naming, program1)) =
haftmann@25969:       let
haftmann@30947:         val Fun (_, (vs_ty, [(([], t), _)])) =
haftmann@28663:           Graph.get_node program1 Term.dummy_patternN;
haftmann@28663:         val deps = Graph.imm_succs program1 Term.dummy_patternN;
haftmann@28663:         val program2 = Graph.del_nodes [Term.dummy_patternN] program1;
haftmann@27103:         val deps_all = Graph.all_succs program2 deps;
haftmann@27103:         val program3 = Graph.subgraph (member (op =) deps_all) program2;
haftmann@31063:       in (((naming, program3), ((vs_ty, t), deps)), (dep, (naming, program2))) end;
haftmann@26011:   in
haftmann@28663:     ensure_stmt ((K o K) NONE) pair stmt_value Term.dummy_patternN
haftmann@26011:     #> snd
haftmann@31063:     #> term_value
haftmann@26011:   end;
haftmann@24219: 
haftmann@30947: fun base_evaluator thy evaluator algebra funcgr vs t =
haftmann@30942:   let
haftmann@31063:     val (((naming, program), (((vs', ty'), t'), deps)), _) =
haftmann@31063:       invoke_generation thy (algebra, funcgr) ensure_value t;
haftmann@30947:     val vs'' = map (fn (v, _) => (v, (the o AList.lookup (op =) vs o prefix "'") v)) vs';
haftmann@31063:   in evaluator naming program ((vs'', (vs', ty')), t') deps end;
haftmann@30942: 
haftmann@31125: fun eval_conv thy prep_sort = Code_Preproc.eval_conv thy prep_sort o base_evaluator thy;
haftmann@31125: fun eval thy prep_sort postproc = Code_Preproc.eval thy prep_sort postproc o base_evaluator thy;
haftmann@30942: 
haftmann@30942: 
haftmann@30942: (** diagnostic commands **)
haftmann@30942: 
haftmann@31036: fun read_const_exprs thy =
haftmann@31036:   let
haftmann@31036:     fun consts_of some_thyname =
haftmann@31036:       let
haftmann@31036:         val thy' = case some_thyname
haftmann@31036:          of SOME thyname => ThyInfo.the_theory thyname thy
haftmann@31036:           | NONE => thy;
haftmann@31036:         val cs = Symtab.fold (fn (c, (_, NONE)) => cons c | _ => I)
haftmann@31036:           ((snd o #constants o Consts.dest o #consts o Sign.rep_sg) thy') [];
haftmann@31036:         fun belongs_here c =
haftmann@31036:           not (exists (fn thy'' => Sign.declared_const thy'' c) (Theory.parents_of thy'))
haftmann@31036:       in case some_thyname
haftmann@31036:        of NONE => cs
haftmann@31036:         | SOME thyname => filter belongs_here cs
haftmann@31036:       end;
haftmann@31036:     fun read_const_expr "*" = ([], consts_of NONE)
haftmann@31036:       | read_const_expr s = if String.isSuffix ".*" s
haftmann@31036:           then ([], consts_of (SOME (unsuffix ".*" s)))
haftmann@31156:           else ([Code.read_const thy s], []);
haftmann@31036:   in pairself flat o split_list o map read_const_expr end;
haftmann@31036: 
haftmann@30942: fun code_depgr thy consts =
haftmann@30942:   let
haftmann@31125:     val (_, eqngr) = Code_Preproc.obtain thy consts [];
haftmann@30942:     val select = Graph.all_succs eqngr consts;
haftmann@30942:   in
haftmann@30942:     eqngr
haftmann@30942:     |> not (null consts) ? Graph.subgraph (member (op =) select) 
haftmann@30942:     |> Graph.map_nodes ((apsnd o map o apfst) (AxClass.overload thy))
haftmann@30942:   end;
haftmann@30942: 
haftmann@31125: fun code_thms thy = Pretty.writeln o Code_Preproc.pretty thy o code_depgr thy;
haftmann@30942: 
haftmann@30942: fun code_deps thy consts =
haftmann@27103:   let
haftmann@30942:     val eqngr = code_depgr thy consts;
haftmann@30942:     val constss = Graph.strong_conn eqngr;
haftmann@30942:     val mapping = Symtab.empty |> fold (fn consts => fold (fn const =>
haftmann@30942:       Symtab.update (const, consts)) consts) constss;
haftmann@30942:     fun succs consts = consts
haftmann@30942:       |> maps (Graph.imm_succs eqngr)
haftmann@30942:       |> subtract (op =) consts
haftmann@30942:       |> map (the o Symtab.lookup mapping)
haftmann@30942:       |> distinct (op =);
haftmann@30942:     val conn = [] |> fold (fn consts => cons (consts, succs consts)) constss;
haftmann@31156:     fun namify consts = map (Code.string_of_const thy) consts
haftmann@30942:       |> commas;
haftmann@30942:     val prgr = map (fn (consts, constss) =>
haftmann@30942:       { name = namify consts, ID = namify consts, dir = "", unfold = true,
haftmann@30942:         path = "", parents = map namify constss }) conn;
haftmann@30942:   in Present.display_graph prgr end;
haftmann@30942: 
haftmann@30942: local
haftmann@27103: 
haftmann@30942: structure P = OuterParse
haftmann@30942: and K = OuterKeyword
haftmann@30942: 
haftmann@31036: fun code_thms_cmd thy = code_thms thy o op @ o read_const_exprs thy;
haftmann@31036: fun code_deps_cmd thy = code_deps thy o op @ o read_const_exprs thy;
haftmann@30942: 
haftmann@30942: in
haftmann@30942: 
haftmann@30942: val _ =
haftmann@30942:   OuterSyntax.improper_command "code_thms" "print system of code equations for code" OuterKeyword.diag
haftmann@30942:     (Scan.repeat P.term_group
haftmann@30942:       >> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory
haftmann@30942:         o Toplevel.keep ((fn thy => code_thms_cmd thy cs) o Toplevel.theory_of)));
haftmann@30942: 
haftmann@30942: val _ =
haftmann@30942:   OuterSyntax.improper_command "code_deps" "visualize dependencies of code equations for code" OuterKeyword.diag
haftmann@30942:     (Scan.repeat P.term_group
haftmann@30942:       >> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory
haftmann@30942:         o Toplevel.keep ((fn thy => code_deps_cmd thy cs) o Toplevel.theory_of)));
haftmann@30942: 
haftmann@30942: end;
haftmann@27103: 
haftmann@24219: end; (*struct*)
haftmann@24219: 
haftmann@24219: 
haftmann@28054: structure Basic_Code_Thingol: BASIC_CODE_THINGOL = Code_Thingol;