haftmann@37744: (* 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@31889: | IVar of vname option haftmann@24219: | `$ of iterm * iterm haftmann@31888: | `|=> of (vname option * 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@31888: val `|==> : (vname option * 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@34084: val fun_tyco: string 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@37640: val unfold_fun_n: int -> itype -> itype list * itype haftmann@28663: val unfold_app: iterm -> iterm * iterm list haftmann@31888: val unfold_abs: iterm -> (vname 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@31889: val split_pat_abs: iterm -> ((iterm * itype) * iterm) option haftmann@31889: val unfold_pat_abs: iterm -> (iterm * itype) list * iterm haftmann@31049: val unfold_const_app: iterm -> (const * iterm list) option haftmann@32909: val is_IVar: iterm -> bool 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@31935: val add_constnames: iterm -> string list -> string list haftmann@32917: val add_tyconames: iterm -> string list -> string list haftmann@28663: val fold_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@37437: | Fun of string * ((typscheme * ((iterm list * iterm) * (thm option * bool)) list) * thm option) haftmann@37448: | Datatype of string * ((vname * sort) list * haftmann@37448: ((string * vname list (*type argument wrt. canonical order*)) * itype list) list) haftmann@28663: | Datatypecons of string * string haftmann@37447: | Class of class * (vname * ((class * string) list * (string * itype) list)) haftmann@24219: | Classrel of class * class haftmann@28663: | Classparam of string * class haftmann@37448: | Classinst of (class * (string * (vname * sort) list) (*class and arity*)) haftmann@37445: * ((class * (string * (string * dict list list))) list (*super instances*) haftmann@37448: * (((string * const) * (thm * bool)) list (*class parameter instances*) haftmann@37448: * ((string * const) * (thm * bool)) list (*super class parameter instances*))) 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@37440: val is_case: stmt -> bool haftmann@28663: val contr_classparam_typs: program -> string -> itype option list haftmann@32895: val labelled_name: theory -> program -> string -> string haftmann@32895: val group_stmts: theory -> program haftmann@32895: -> ((string * stmt) list * (string * stmt) list haftmann@32895: * ((string * stmt) list * (string * stmt) list)) list haftmann@24219: haftmann@31036: val read_const_exprs: theory -> string list -> string list * string list haftmann@36272: val consts_program: theory -> bool -> string list -> string list * (naming * program) haftmann@32123: val eval_conv: theory haftmann@31063: -> (naming -> program -> ((string * sort) list * typscheme) * iterm -> string list -> cterm -> thm) haftmann@28663: -> cterm -> thm haftmann@32123: val eval: theory -> ((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@31889: | IVar of vname option haftmann@24219: | `$ of iterm * iterm haftmann@31888: | `|=> of (vname option * itype) * iterm haftmann@24219: | ICase of ((iterm * itype) * (iterm * iterm) list) * iterm; haftmann@24219: (*see also signature*) haftmann@24219: haftmann@32909: fun is_IVar (IVar _) = true haftmann@32909: | is_IVar _ = false; haftmann@32909: 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@31874: val unfold_abs = unfoldr haftmann@31874: (fn op `|=> t => SOME t haftmann@24219: | _ => NONE); 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@32917: fun fold_constexprs f = haftmann@32917: let haftmann@32917: fun fold' (IConst c) = f c haftmann@32917: | fold' (IVar _) = I haftmann@32917: | fold' (t1 `$ t2) = fold' t1 #> fold' t2 haftmann@32917: | fold' (_ `|=> t) = fold' t haftmann@32917: | fold' (ICase (((t, _), ds), _)) = fold' t haftmann@32917: #> fold (fn (pat, body) => fold' pat #> fold' body) ds haftmann@32917: in fold' end; haftmann@32917: haftmann@32917: val add_constnames = fold_constexprs (fn (c, _) => insert (op =) c); haftmann@32917: haftmann@32917: fun add_tycos (tyco `%% tys) = insert (op =) tyco #> fold add_tycos tys haftmann@32917: | add_tycos (ITyVar _) = I; haftmann@32917: haftmann@32917: val add_tyconames = fold_constexprs (fn (_, ((tys, _), _)) => fold add_tycos tys); haftmann@24219: haftmann@24219: fun fold_varnames f = haftmann@24219: let haftmann@31935: fun fold_aux add f = haftmann@31935: let haftmann@31935: fun fold_term _ (IConst _) = I haftmann@31935: | fold_term vs (IVar (SOME v)) = if member (op =) vs v then I else f v haftmann@31935: | fold_term _ (IVar NONE) = I haftmann@31935: | fold_term vs (t1 `$ t2) = fold_term vs t1 #> fold_term vs t2 haftmann@31935: | fold_term vs ((SOME v, _) `|=> t) = fold_term (insert (op =) v vs) t haftmann@31935: | fold_term vs ((NONE, _) `|=> t) = fold_term vs t haftmann@31935: | fold_term vs (ICase (((t, _), ds), _)) = fold_term vs t #> fold (fold_case vs) ds haftmann@31935: and fold_case vs (p, t) = fold_term (add p vs) t; haftmann@31935: in fold_term [] end; haftmann@31935: fun add t = fold_aux add (insert (op =)) t; haftmann@31935: in fold_aux add f end; haftmann@24219: haftmann@31935: fun exists_var t v = fold_varnames (fn w => fn b => v = w orelse b) t false; haftmann@31874: haftmann@31889: fun split_pat_abs ((NONE, ty) `|=> t) = SOME ((IVar NONE, ty), t) haftmann@31888: | split_pat_abs ((SOME v, ty) `|=> t) = SOME (case t haftmann@31889: of ICase (((IVar (SOME w), _), [(p, t')]), _) => haftmann@31888: if v = w andalso (exists_var p v orelse not (exists_var t' v)) haftmann@31889: then ((p, ty), t') haftmann@31889: else ((IVar (SOME v), ty), t) haftmann@31889: | _ => ((IVar (SOME v), ty), t)) haftmann@31888: | split_pat_abs _ = NONE; haftmann@31874: haftmann@31874: val unfold_pat_abs = unfoldr split_pat_abs; haftmann@24219: haftmann@31890: fun unfold_abs_eta [] t = ([], t) haftmann@31890: | unfold_abs_eta (_ :: tys) (v_ty `|=> t) = haftmann@31890: let haftmann@31890: val (vs_tys, t') = unfold_abs_eta tys t; haftmann@31890: in (v_ty :: vs_tys, t') end haftmann@31892: | unfold_abs_eta tys t = haftmann@31890: let haftmann@31890: val ctxt = fold_varnames Name.declare t Name.context; haftmann@31890: val vs_tys = (map o apfst) SOME (Name.names ctxt "a" tys); haftmann@31890: in (vs_tys, t `$$ map (IVar o fst) vs_tys) end; haftmann@31890: 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@31889: val vs_tys = (map o apfst) SOME haftmann@33957: (Name.names ctxt "a" ((take l o drop j) tys)); haftmann@31889: in vs_tys `|==> IConst c `$$ ts @ map (IVar o fst) vs_tys end; haftmann@24219: haftmann@24662: fun contains_dictvar t = haftmann@24662: let haftmann@31935: fun cont_dict (DictConst (_, dss)) = (exists o exists) cont_dict dss haftmann@31935: | cont_dict (DictVar _) = true; haftmann@31935: fun cont_term (IConst (_, ((_, dss), _))) = (exists o exists) cont_dict dss haftmann@31935: | cont_term (IVar _) = false haftmann@31935: | cont_term (t1 `$ t2) = cont_term t1 orelse cont_term t2 haftmann@31935: | cont_term (_ `|=> t) = cont_term t haftmann@31935: | cont_term (ICase (_, t)) = cont_term t; haftmann@31935: in cont_term t 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 wenzelm@33172: fun thyname_of_class thy = #theory_name o Name_Space.the_entry (Sign.class_space thy); wenzelm@33172: fun thyname_of_instance thy inst = case AxClass.thynames_of_arity thy inst wenzelm@33172: 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@35299: | NONE => (case Code.get_type_of_constr_or_abstr thy c haftmann@35226: of SOME (tyco, _) => Codegen.thyname_of_type thy tyco wenzelm@33172: | NONE => Codegen.thyname_of_const thy c); haftmann@33420: fun purify_base "==>" = "follows" haftmann@33420: | purify_base "op &" = "and" haftmann@31036: | purify_base "op |" = "or" haftmann@31036: | purify_base "op -->" = "implies" haftmann@31036: | purify_base "op =" = "eq" 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@37384: fun namify_classrel thy = namify thy (fn (sub_class, super_class) => haftmann@37431: Long_Name.base_name super_class ^ "_" ^ Long_Name.base_name sub_class) wenzelm@33172: (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@33172: | namify_tyco thy tyco = namify thy Long_Name.base_name Codegen.thyname_of_type 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@37384: val fun_tyco = Long_Name.append (namify_tyco Pure.thy "fun") suffix_tyco haftmann@37384: (*depends on add_suffix*); haftmann@34084: haftmann@28688: val unfold_fun = unfoldr haftmann@34084: (fn tyco `%% [ty1, ty2] => if tyco = fun_tyco then SOME (ty1, ty2) else NONE haftmann@37384: | _ => NONE); haftmann@28688: haftmann@37640: fun unfold_fun_n n ty = haftmann@37640: let haftmann@37640: val (tys1, ty1) = unfold_fun ty; haftmann@37640: val (tys3, tys2) = chop n tys1; haftmann@37640: val ty3 = Library.foldr (fn (ty1, ty2) => fun_tyco `%% [ty1, ty2]) (tys2, ty1); haftmann@37640: in (tys3, ty3) end; haftmann@37640: haftmann@28688: end; (* local *) haftmann@28688: haftmann@24219: haftmann@27103: (** statements, abstract programs **) haftmann@24219: haftmann@24219: type typscheme = (vname * sort) list * itype; haftmann@37447: datatype stmt = haftmann@27024: NoStmt haftmann@37437: | Fun of string * ((typscheme * ((iterm list * iterm) * (thm option * bool)) list) * thm option) haftmann@37448: | Datatype of string * ((vname * sort) list * ((string * vname list) * itype list) list) haftmann@28663: | Datatypecons of string * string haftmann@37447: | 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@37445: * ((class * (string * (string * dict list list))) list haftmann@37448: * (((string * const) * (thm * bool)) list haftmann@37448: * ((string * const) * (thm * bool)) list)) haftmann@37448: (*see also signature*); haftmann@24219: haftmann@27103: type program = stmt Graph.T; haftmann@24219: haftmann@27103: fun empty_funs program = haftmann@37437: 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@37448: fun map_classparam_instances_as_term f = haftmann@37448: (map o apfst o apsnd) (fn const => case f (IConst const) of IConst const' => const') haftmann@37448: haftmann@27711: fun map_terms_stmt f NoStmt = NoStmt haftmann@37437: | map_terms_stmt f (Fun (c, ((tysm, eqs), case_cong))) = Fun (c, ((tysm, (map o apfst) haftmann@37437: (fn (ts, t) => (map f ts, f t)) eqs), case_cong)) 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@37448: | map_terms_stmt f (Classinst (arity, (super_instances, classparam_instances))) = haftmann@37448: Classinst (arity, (super_instances, (pairself o map_classparam_instances_as_term) f classparam_instances)); 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@37440: fun is_case (Fun (_, (_, SOME _))) = true haftmann@37440: | is_case _ = false; haftmann@37440: 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@32895: fun labelled_name thy program name = case Graph.get_node program name haftmann@32895: of Fun (c, _) => quote (Code.string_of_const thy c) haftmann@32895: | Datatype (tyco, _) => "type " ^ quote (Sign.extern_type thy tyco) haftmann@32895: | Datatypecons (c, _) => quote (Code.string_of_const thy c) haftmann@32895: | Class (class, _) => "class " ^ quote (Sign.extern_class thy class) haftmann@32895: | Classrel (sub, super) => let haftmann@32895: val Class (sub, _) = Graph.get_node program sub haftmann@32895: val Class (super, _) = Graph.get_node program super haftmann@32895: in quote (Sign.extern_class thy sub ^ " < " ^ Sign.extern_class thy super) end haftmann@32895: | Classparam (c, _) => quote (Code.string_of_const thy c) haftmann@32895: | Classinst ((class, (tyco, _)), _) => let haftmann@32895: val Class (class, _) = Graph.get_node program class haftmann@32895: val Datatype (tyco, _) = Graph.get_node program tyco haftmann@32895: in quote (Sign.extern_type thy tyco ^ " :: " ^ Sign.extern_class thy class) end haftmann@32895: haftmann@37440: fun linear_stmts program = haftmann@37440: rev (Graph.strong_conn program) haftmann@37440: |> map (AList.make (Graph.get_node program)); haftmann@37440: haftmann@32895: fun group_stmts thy program = haftmann@32895: let haftmann@32895: fun is_fun (_, Fun _) = true | is_fun _ = false; haftmann@32895: fun is_datatypecons (_, Datatypecons _) = true | is_datatypecons _ = false; haftmann@32895: fun is_datatype (_, Datatype _) = true | is_datatype _ = false; haftmann@32895: fun is_class (_, Class _) = true | is_class _ = false; haftmann@32895: fun is_classrel (_, Classrel _) = true | is_classrel _ = false; haftmann@32895: fun is_classparam (_, Classparam _) = true | is_classparam _ = false; haftmann@32895: fun is_classinst (_, Classinst _) = true | is_classinst _ = false; haftmann@32895: fun group stmts = haftmann@32895: if forall (is_datatypecons orf is_datatype) stmts haftmann@32895: then (filter is_datatype stmts, [], ([], [])) haftmann@32895: else if forall (is_class orf is_classrel orf is_classparam) stmts haftmann@32895: then ([], filter is_class stmts, ([], [])) haftmann@32895: else if forall (is_fun orf is_classinst) stmts haftmann@32895: then ([], [], List.partition is_fun stmts) haftmann@32895: else error ("Illegal mutual dependencies: " ^ haftmann@32895: (commas o map (labelled_name thy program o fst)) stmts) haftmann@32895: in haftmann@37440: linear_stmts program haftmann@32895: |> map group haftmann@32895: end; haftmann@32895: 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@36272: exception PERMISSIVE of unit; haftmann@36272: haftmann@37698: fun translation_error thy permissive some_thm msg sub_msg = haftmann@36272: if permissive haftmann@36272: then raise PERMISSIVE () haftmann@36272: else let haftmann@35226: val err_thm = case some_thm haftmann@36272: of SOME thm => "\n(in code equation " ^ Display.string_of_thm_global thy thm ^ ")" haftmann@36272: | NONE => ""; haftmann@37698: in error (msg ^ err_thm ^ ":\n" ^ sub_msg) end; haftmann@37698: haftmann@37698: fun not_wellsorted thy permissive some_thm ty sort e = haftmann@37698: let haftmann@37698: val err_class = Sorts.class_error (Syntax.pp_global thy) e; haftmann@37698: val err_typ = "Type " ^ Syntax.string_of_typ_global thy ty ^ " not of sort " haftmann@37698: ^ Syntax.string_of_sort_global thy sort; haftmann@37698: in translation_error thy permissive some_thm "Wellsortedness error" (err_typ ^ "\n" ^ err_class) end; haftmann@26972: haftmann@28724: haftmann@28724: (* translation *) haftmann@28724: haftmann@36272: fun ensure_tyco thy algbr eqngr permissive tyco = haftmann@30932: let haftmann@36272: val (vs, cos) = Code.get_type thy tyco; haftmann@30932: val stmt_datatype = haftmann@36272: fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs haftmann@37448: ##>> fold_map (fn ((c, vs), tys) => haftmann@36272: ensure_const thy algbr eqngr permissive c haftmann@37448: ##>> pair (map (unprefix "'") vs) haftmann@36272: ##>> fold_map (translate_typ thy algbr eqngr permissive) tys) cos haftmann@36272: #>> (fn info => Datatype (tyco, info)); haftmann@30932: in ensure_stmt lookup_tyco (declare_tyco thy) stmt_datatype tyco end haftmann@36272: and ensure_const thy algbr eqngr permissive c = haftmann@30932: let haftmann@30932: fun stmt_datatypecons tyco = haftmann@36272: ensure_tyco thy algbr eqngr permissive tyco haftmann@30932: #>> (fn tyco => Datatypecons (c, tyco)); haftmann@30932: fun stmt_classparam class = haftmann@36272: ensure_class thy algbr eqngr permissive class haftmann@30932: #>> (fn class => Classparam (c, class)); haftmann@34891: fun stmt_fun cert = haftmann@32872: let haftmann@35226: val ((vs, ty), eqns) = Code.equations_of_cert thy cert; haftmann@37440: val some_case_cong = Code.get_case_cong thy c; haftmann@32872: in haftmann@36272: fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs haftmann@36272: ##>> translate_typ thy algbr eqngr permissive ty haftmann@37440: ##>> translate_eqns thy algbr eqngr permissive eqns haftmann@37440: #>> (fn info => Fun (c, (info, some_case_cong))) haftmann@32872: end; haftmann@35299: val stmt_const = case Code.get_type_of_constr_or_abstr thy c haftmann@35226: 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@34891: | NONE => stmt_fun (Code_Preproc.cert eqngr c)) haftmann@30932: in ensure_stmt lookup_const (declare_const thy) stmt_const c end haftmann@36272: and ensure_class thy (algbr as (_, algebra)) eqngr permissive class = haftmann@24918: let haftmann@37384: val super_classes = (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@37384: fold_map (fn super_class => ensure_class thy algbr eqngr permissive super_class haftmann@37384: ##>> ensure_classrel thy algbr eqngr permissive (class, super_class)) super_classes haftmann@36272: ##>> fold_map (fn (c, ty) => ensure_const thy algbr eqngr permissive c haftmann@36272: ##>> translate_typ thy algbr eqngr permissive 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@37384: and ensure_classrel thy algbr eqngr permissive (sub_class, super_class) = haftmann@24918: let haftmann@24918: val stmt_classrel = haftmann@37384: ensure_class thy algbr eqngr permissive sub_class haftmann@37384: ##>> ensure_class thy algbr eqngr permissive super_class haftmann@24918: #>> Classrel; haftmann@37384: in ensure_stmt lookup_classrel (declare_classrel thy) stmt_classrel (sub_class, super_class) end haftmann@36272: and ensure_inst thy (algbr as (_, algebra)) eqngr permissive (class, tyco) = haftmann@24918: let haftmann@37384: val super_classes = (Sorts.minimize_sort algebra o Sorts.super_classes algebra) class; haftmann@37448: val these_classparams = these o try (#params o AxClass.get_info thy); haftmann@37448: val classparams = these_classparams class; haftmann@37448: val further_classparams = maps these_classparams haftmann@37448: ((Sorts.complete_sort algebra o Sorts.super_classes algebra) 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@37384: fun translate_super_instance super_class = haftmann@37384: ensure_class thy algbr eqngr permissive super_class haftmann@37384: ##>> ensure_classrel thy algbr eqngr permissive (class, super_class) haftmann@37384: ##>> translate_dicts thy algbr eqngr permissive NONE (arity_typ, [super_class]) haftmann@37384: #>> (fn ((super_class, classrel), [DictConst (inst, dss)]) => haftmann@37384: (super_class, (classrel, (inst, dss)))); haftmann@37384: fun translate_classparam_instance (c, ty) = haftmann@24918: let haftmann@37384: val raw_const = Const (c, map_type_tfree (K arity_typ') ty); haftmann@37384: val thm = AxClass.unoverload_conv thy (Thm.cterm_of thy raw_const); haftmann@37384: val const = (apsnd Logic.unvarifyT_global o dest_Const o snd haftmann@24918: o Logic.dest_equals o Thm.prop_of) thm; haftmann@24918: in haftmann@36272: ensure_const thy algbr eqngr permissive c haftmann@37384: ##>> translate_const thy algbr eqngr permissive (SOME thm) (const, NONE) haftmann@37384: #>> (fn (c, IConst const') => ((c, const'), (thm, true))) haftmann@24918: end; haftmann@24918: val stmt_inst = haftmann@36272: ensure_class thy algbr eqngr permissive class haftmann@36272: ##>> ensure_tyco thy algbr eqngr permissive tyco haftmann@36272: ##>> fold_map (translate_tyvar_sort thy algbr eqngr permissive) vs haftmann@37384: ##>> fold_map translate_super_instance super_classes haftmann@37384: ##>> fold_map translate_classparam_instance classparams haftmann@37448: ##>> fold_map translate_classparam_instance further_classparams haftmann@37448: #>> (fn (((((class, tyco), arity_args), super_instances), haftmann@37448: classparam_instances), further_classparam_instances) => haftmann@37448: Classinst ((class, (tyco, arity_args)), (super_instances, haftmann@37448: (classparam_instances, further_classparam_instances)))); haftmann@28663: in ensure_stmt lookup_instance (declare_instance thy) stmt_inst (class, tyco) end haftmann@36272: and translate_typ thy algbr eqngr permissive (TFree (v, _)) = haftmann@30932: pair (ITyVar (unprefix "'" v)) haftmann@36272: | translate_typ thy algbr eqngr permissive (Type (tyco, tys)) = haftmann@36272: ensure_tyco thy algbr eqngr permissive tyco haftmann@36272: ##>> fold_map (translate_typ thy algbr eqngr permissive) tys haftmann@30932: #>> (fn (tyco, tys) => tyco `%% tys) haftmann@36272: and translate_term thy algbr eqngr permissive some_thm (Const (c, ty), some_abs) = haftmann@36272: translate_app thy algbr eqngr permissive some_thm (((c, ty), []), some_abs) haftmann@36272: | translate_term thy algbr eqngr permissive some_thm (Free (v, _), some_abs) = haftmann@31889: pair (IVar (SOME v)) haftmann@36272: | translate_term thy algbr eqngr permissive some_thm (Abs (v, ty, t), some_abs) = haftmann@24918: let haftmann@32273: val (v', t') = Syntax.variant_abs (Name.desymbolize false v, ty, t); haftmann@32273: val v'' = if member (op =) (Term.add_free_names t' []) v' haftmann@32273: then SOME v' else NONE haftmann@24918: in haftmann@36272: translate_typ thy algbr eqngr permissive ty haftmann@36272: ##>> translate_term thy algbr eqngr permissive some_thm (t', some_abs) haftmann@32273: #>> (fn (ty, t) => (v'', ty) `|=> t) haftmann@24918: end haftmann@36272: | translate_term thy algbr eqngr permissive some_thm (t as _ $ _, some_abs) = haftmann@24918: case strip_comb t haftmann@24918: of (Const (c, ty), ts) => haftmann@36272: translate_app thy algbr eqngr permissive some_thm (((c, ty), ts), some_abs) haftmann@24918: | (t', ts) => haftmann@36272: translate_term thy algbr eqngr permissive some_thm (t', some_abs) haftmann@36272: ##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts haftmann@24918: #>> (fn (t, ts) => t `$$ ts) haftmann@36272: and translate_eqn thy algbr eqngr permissive ((args, (rhs, some_abs)), (some_thm, proper)) = haftmann@36272: fold_map (translate_term thy algbr eqngr permissive some_thm) args haftmann@36272: ##>> translate_term thy algbr eqngr permissive some_thm (rhs, some_abs) haftmann@35226: #>> rpair (some_thm, proper) haftmann@37440: and translate_eqns thy algbr eqngr permissive eqns prgrm = haftmann@37440: prgrm |> fold_map (translate_eqn thy algbr eqngr permissive) eqns haftmann@37440: handle PERMISSIVE () => ([], prgrm) haftmann@36272: and translate_const thy algbr eqngr permissive some_thm ((c, ty), some_abs) = haftmann@30932: let haftmann@37698: val _ = if (case some_abs of NONE => true | SOME abs => not (c = abs)) haftmann@35226: andalso Code.is_abstr thy c haftmann@37698: then translation_error thy permissive some_thm haftmann@37698: "Abstraction violation" ("constant " ^ Code.string_of_const thy c) haftmann@37698: else () haftmann@37448: val arg_typs = Sign.const_typargs thy (c, ty); haftmann@32873: val sorts = Code_Preproc.sortargs eqngr c; haftmann@37448: val function_typs = (fst o Term.strip_type) ty; haftmann@26972: in haftmann@37698: ensure_const thy algbr eqngr permissive c haftmann@37448: ##>> fold_map (translate_typ thy algbr eqngr permissive) arg_typs haftmann@37448: ##>> fold_map (translate_dicts thy algbr eqngr permissive some_thm) (arg_typs ~~ sorts) haftmann@37448: ##>> fold_map (translate_typ thy algbr eqngr permissive) function_typs haftmann@37448: #>> (fn (((c, arg_typs), dss), function_typs) => IConst (c, ((arg_typs, dss), function_typs))) haftmann@26972: end haftmann@36272: and translate_app_const thy algbr eqngr permissive some_thm ((c_ty, ts), some_abs) = haftmann@36272: translate_const thy algbr eqngr permissive some_thm (c_ty, some_abs) haftmann@36272: ##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts haftmann@24918: #>> (fn (t, ts) => t `$$ ts) haftmann@36272: and translate_case thy algbr eqngr permissive some_thm (num_args, (t_pos, case_pats)) (c_ty, ts) = haftmann@24918: let haftmann@31892: fun arg_types num_args ty = (fst o chop num_args o fst o strip_type) ty; haftmann@31892: val tys = arg_types num_args (snd c_ty); haftmann@29952: val ty = nth tys t_pos; haftmann@31957: fun mk_constr c t = let val n = Code.args_number thy c haftmann@31957: in ((c, arg_types n (fastype_of t) ---> ty), n) end; haftmann@31892: val constrs = if null case_pats then [] haftmann@31892: else map2 mk_constr case_pats (nth_drop t_pos ts); haftmann@31892: fun casify naming constrs ty ts = haftmann@24918: let haftmann@31935: val undefineds = map_filter (lookup_const naming) (Code.undefineds thy); haftmann@31935: fun collapse_clause vs_map ts body = haftmann@31935: let haftmann@31935: in case body haftmann@31935: of IConst (c, _) => if member (op =) undefineds c haftmann@31935: then [] haftmann@31935: else [(ts, body)] haftmann@31935: | ICase (((IVar (SOME v), _), subclauses), _) => haftmann@31935: if forall (fn (pat', body') => exists_var pat' v haftmann@31935: orelse not (exists_var body' v)) subclauses haftmann@31935: then case AList.lookup (op =) vs_map v haftmann@31935: of SOME i => maps (fn (pat', body') => haftmann@31935: collapse_clause (AList.delete (op =) v vs_map) haftmann@31935: (nth_map i (K pat') ts) body') subclauses haftmann@31935: | NONE => [(ts, body)] haftmann@31935: else [(ts, body)] haftmann@31935: | _ => [(ts, body)] haftmann@31935: end; haftmann@31935: fun mk_clause mk tys t = haftmann@31935: let haftmann@31935: val (vs, body) = unfold_abs_eta tys t; haftmann@31935: val vs_map = fold_index (fn (i, (SOME v, _)) => cons (v, i) | _ => I) vs []; haftmann@31935: val ts = map (IVar o fst) vs; haftmann@31935: in map mk (collapse_clause vs_map ts body) end; haftmann@31892: val t = nth ts t_pos; haftmann@31892: val ts_clause = nth_drop t_pos ts; haftmann@31935: val clauses = if null case_pats haftmann@31935: then mk_clause (fn ([t], body) => (t, body)) [ty] (the_single ts_clause) haftmann@31935: else maps (fn ((constr as IConst (_, (_, tys)), n), t) => haftmann@33957: mk_clause (fn (ts, body) => (constr `$$ ts, body)) (take n tys) t) haftmann@31935: (constrs ~~ ts_clause); haftmann@31892: in ((t, ty), clauses) end; haftmann@24918: in haftmann@36272: translate_const thy algbr eqngr permissive some_thm (c_ty, NONE) haftmann@36272: ##>> fold_map (fn (constr, n) => translate_const thy algbr eqngr permissive some_thm (constr, NONE) haftmann@36272: #>> rpair n) constrs haftmann@36272: ##>> translate_typ thy algbr eqngr permissive ty haftmann@36272: ##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) ts haftmann@31892: #-> (fn (((t, constrs), ty), ts) => haftmann@31892: `(fn (_, (naming, _)) => ICase (casify naming constrs ty ts, t `$$ ts))) haftmann@24918: end haftmann@36272: and translate_app_case thy algbr eqngr permissive some_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@33957: val tys = (take (num_args - k) o 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@36272: fold_map (translate_typ thy algbr eqngr permissive) tys haftmann@36272: ##>> translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), ts @ map Free vs) haftmann@31888: #>> (fn (tys, t) => map2 (fn (v, _) => pair (SOME v)) vs tys `|==> t) haftmann@29973: end haftmann@29973: else if length ts > num_args then haftmann@36272: translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), take num_args ts) haftmann@36272: ##>> fold_map (translate_term thy algbr eqngr permissive some_thm o rpair NONE) (drop num_args ts) haftmann@29973: #>> (fn (t, ts) => t `$$ ts) haftmann@29973: else haftmann@36272: translate_case thy algbr eqngr permissive some_thm case_scheme ((c, ty), ts) haftmann@36272: and translate_app thy algbr eqngr permissive some_thm (c_ty_ts as ((c, _), _), some_abs) = haftmann@29973: case Code.get_case_scheme thy c haftmann@36272: of SOME case_scheme => translate_app_case thy algbr eqngr permissive some_thm case_scheme c_ty_ts haftmann@36272: | NONE => translate_app_const thy algbr eqngr permissive some_thm (c_ty_ts, some_abs) haftmann@36272: and translate_tyvar_sort thy (algbr as (proj_sort, _)) eqngr permissive (v, sort) = haftmann@36272: fold_map (ensure_class thy algbr eqngr permissive) (proj_sort sort) haftmann@30932: #>> (fn sort => (unprefix "'" v, sort)) haftmann@36272: and translate_dicts thy (algbr as (proj_sort, algebra)) eqngr permissive some_thm (ty, sort) = haftmann@30932: let 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@37384: | class_relation (Local (classrels, v), sub_class) super_class = haftmann@37384: Local ((sub_class, super_class) :: classrels, v); wenzelm@36102: 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@37698: val typargs = Sorts.of_sort_derivation algebra wenzelm@36102: {class_relation = K (Sorts.classrel_derivation algebra class_relation), wenzelm@35961: type_constructor = type_constructor, haftmann@37698: type_variable = type_variable} (ty, proj_sort sort) haftmann@37698: handle Sorts.CLASS_ERROR e => not_wellsorted thy permissive some_thm ty sort e; haftmann@30932: fun mk_dict (Global (inst, yss)) = haftmann@36272: ensure_inst thy algbr eqngr permissive inst haftmann@30932: ##>> (fold_map o fold_map) mk_dict yss haftmann@30932: #>> (fn (inst, dss) => DictConst (inst, dss)) haftmann@31962: | mk_dict (Local (classrels, (v, (n, sort)))) = haftmann@36272: fold_map (ensure_classrel thy algbr eqngr permissive) classrels haftmann@31962: #>> (fn classrels => DictVar (classrels, (unprefix "'" v, (n, length sort)))) haftmann@37698: in fold_map mk_dict typargs end; haftmann@24918: haftmann@25969: haftmann@27103: (* store *) haftmann@27103: haftmann@34173: structure Program = Code_Data haftmann@27103: ( haftmann@28663: type T = naming * program; haftmann@28663: val empty = (empty_naming, Graph.empty); haftmann@27103: ); haftmann@27103: haftmann@36272: fun cache_generation thy (algebra, eqngr) f name = haftmann@34251: Program.change_yield thy (fn naming_program => (NONE, naming_program) haftmann@32873: |> f thy algebra eqngr name haftmann@28663: |-> (fn name => fn (_, naming_program) => (name, naming_program))); haftmann@27103: haftmann@36272: fun transient_generation thy (algebra, eqngr) f name = haftmann@36272: (NONE, (empty_naming, Graph.empty)) haftmann@36272: |> f thy algebra eqngr name haftmann@36272: |-> (fn name => fn (_, naming_program) => (name, naming_program)); haftmann@36272: haftmann@27103: haftmann@27103: (* program generation *) haftmann@27103: haftmann@36272: fun consts_program thy permissive 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@32873: fun generate_consts thy algebra eqngr = haftmann@36272: fold_map (ensure_const thy algebra eqngr permissive); haftmann@36272: val invoke_generation = if permissive haftmann@36272: then transient_generation else cache_generation 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@32873: fun ensure_value thy algbr eqngr 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@36272: fold_map (translate_tyvar_sort thy algbr eqngr false) vs haftmann@36272: ##>> translate_typ thy algbr eqngr false ty haftmann@36272: ##>> translate_term thy algbr eqngr false NONE (Code.subst_signatures thy t, NONE) haftmann@28663: #>> (fn ((vs, ty), t) => Fun haftmann@37437: (Term.dummy_patternN, (((vs, ty), [(([], t), (NONE, true))]), NONE))); haftmann@31063: fun term_value (dep, (naming, program1)) = haftmann@25969: let haftmann@37437: 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@32873: fun base_evaluator thy evaluator algebra eqngr vs t = haftmann@30942: let haftmann@31063: val (((naming, program), (((vs', ty'), t'), deps)), _) = haftmann@36272: cache_generation thy (algebra, eqngr) 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@32123: fun eval_conv thy = Code_Preproc.eval_conv thy o base_evaluator thy; haftmann@32123: fun eval thy postproc = Code_Preproc.eval thy 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@36272: fun consts_of thy' = Symtab.fold (fn (c, (_, NONE)) => cons c | _ => I) haftmann@36272: ((snd o #constants o Consts.dest o #consts o Sign.rep_sg) thy') []; haftmann@36272: fun belongs_here thy' c = forall haftmann@36272: (fn thy'' => not (Sign.declared_const thy'' c)) (Theory.parents_of thy'); haftmann@36272: fun consts_of_select thy' = filter (belongs_here thy') (consts_of thy'); haftmann@36272: fun read_const_expr "*" = ([], consts_of thy) haftmann@31036: | read_const_expr s = if String.isSuffix ".*" s wenzelm@37216: then ([], consts_of_select (Thy_Info.the_theory (unsuffix ".*" s) thy)) 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@34173: val all_consts = Graph.all_succs eqngr consts; haftmann@34891: in Graph.subgraph (member (op =) all_consts) eqngr 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@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 _ = wenzelm@36960: Outer_Syntax.improper_command "code_thms" "print system of code equations for code" Keyword.diag wenzelm@36960: (Scan.repeat1 Parse.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 _ = wenzelm@36960: Outer_Syntax.improper_command "code_deps" "visualize dependencies of code equations for code" wenzelm@36960: Keyword.diag wenzelm@36960: (Scan.repeat1 Parse.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;