haftmann@24219: (* Title: Pure/Isar/code.ML haftmann@24219: ID: $Id$ haftmann@24219: Author: Florian Haftmann, TU Muenchen haftmann@24219: haftmann@24219: Abstract executable content of theory. Management of data dependent on haftmann@25485: executable content. Cache assumes non-concurrent processing of a single theory. haftmann@24219: *) haftmann@24219: haftmann@24219: signature CODE = haftmann@24219: sig haftmann@24624: val add_func: thm -> theory -> theory haftmann@24624: val add_liberal_func: thm -> theory -> theory haftmann@24624: val add_default_func: thm -> theory -> theory haftmann@24624: val add_default_func_attr: Attrib.src haftmann@24219: val del_func: thm -> theory -> theory haftmann@26021: val del_funcs: string -> theory -> theory haftmann@24423: val add_funcl: string * thm list Susp.T -> theory -> theory haftmann@24219: val add_inline: thm -> theory -> theory haftmann@24219: val del_inline: thm -> theory -> theory haftmann@24219: val add_inline_proc: string * (theory -> cterm list -> thm list) -> theory -> theory haftmann@24219: val del_inline_proc: string -> theory -> theory haftmann@24219: val add_preproc: string * (theory -> thm list -> thm list) -> theory -> theory haftmann@24219: val del_preproc: string -> theory -> theory haftmann@24219: val add_post: thm -> theory -> theory haftmann@24219: val del_post: thm -> theory -> theory haftmann@24423: val add_datatype: (string * typ) list -> theory -> theory haftmann@24423: val add_datatype_cmd: string list -> theory -> theory haftmann@25485: val type_interpretation: haftmann@25485: (string * ((string * sort) list * (string * typ list) list) haftmann@25485: -> theory -> theory) -> theory -> theory haftmann@24844: val add_case: thm -> theory -> theory haftmann@24844: val add_undefined: string -> theory -> theory haftmann@24219: haftmann@24219: val coregular_algebra: theory -> Sorts.algebra haftmann@24219: val operational_algebra: theory -> (sort -> sort) * Sorts.algebra haftmann@24423: val these_funcs: theory -> string -> thm list haftmann@24219: val get_datatype: theory -> string -> ((string * sort) list * (string * typ list) list) haftmann@24423: val get_datatype_of_constr: theory -> string -> string option haftmann@24844: val get_case_data: theory -> string -> (int * string list) option haftmann@24844: val is_undefined: theory -> string -> bool haftmann@24423: val default_typ: theory -> string -> typ haftmann@24219: haftmann@24219: val preprocess_conv: cterm -> thm haftmann@24837: val preprocess_term: theory -> term -> term haftmann@24219: val postprocess_conv: cterm -> thm haftmann@24837: val postprocess_term: theory -> term -> term haftmann@24219: haftmann@24219: val add_attribute: string * (Args.T list -> attribute * Args.T list) -> theory -> theory haftmann@24219: haftmann@24219: val print_codesetup: theory -> unit haftmann@24219: end; haftmann@24219: haftmann@24219: signature CODE_DATA_ARGS = haftmann@24219: sig haftmann@24219: type T haftmann@24219: val empty: T haftmann@24219: val merge: Pretty.pp -> T * T -> T haftmann@24423: val purge: theory option -> string list option -> T -> T haftmann@24219: end; haftmann@24219: haftmann@24219: signature CODE_DATA = haftmann@24219: sig haftmann@24219: type T haftmann@24219: val get: theory -> T haftmann@24219: val change: theory -> (T -> T) -> T haftmann@24219: val change_yield: theory -> (T -> 'a * T) -> 'a * T haftmann@24219: end; haftmann@24219: haftmann@24219: signature PRIVATE_CODE = haftmann@24219: sig haftmann@24219: include CODE haftmann@24219: val declare_data: Object.T -> (Pretty.pp -> Object.T * Object.T -> Object.T) haftmann@24423: -> (theory option -> string list option -> Object.T -> Object.T) -> serial haftmann@24219: val get_data: serial * ('a -> Object.T) * (Object.T -> 'a) haftmann@24219: -> theory -> 'a haftmann@24219: val change_data: serial * ('a -> Object.T) * (Object.T -> 'a) haftmann@24219: -> theory -> ('a -> 'a) -> 'a haftmann@24219: val change_yield_data: serial * ('a -> Object.T) * (Object.T -> 'a) haftmann@24219: -> theory -> ('a -> 'b * 'a) -> 'b * 'a haftmann@24219: end; haftmann@24219: haftmann@24219: structure Code : PRIVATE_CODE = haftmann@24219: struct haftmann@24219: haftmann@25312: (** code attributes **) haftmann@25312: haftmann@25312: structure CodeAttr = TheoryDataFun ( haftmann@25312: type T = (string * (Args.T list -> attribute * Args.T list)) list; haftmann@25312: val empty = []; haftmann@25312: val copy = I; haftmann@25312: val extend = I; haftmann@25312: fun merge _ = AList.merge (op =) (K true); haftmann@25312: ); haftmann@24219: haftmann@25312: fun add_attribute (attr as (name, _)) = haftmann@25312: let haftmann@25312: fun add_parser ("", parser) attrs = attrs @ [("", parser)] haftmann@25312: | add_parser (name, parser) attrs = (name, Args.$$$ name |-- parser) :: attrs; haftmann@25312: fun error "" = error ("Code attribute already declared") haftmann@25312: | error name = error ("Code attribute " ^ name ^ " already declared") haftmann@25312: in CodeAttr.map (fn attrs => if AList.defined (op =) attrs name haftmann@25312: then error name else add_parser attr attrs) haftmann@25312: end; haftmann@25312: haftmann@25312: val _ = haftmann@25312: let haftmann@25312: val code_attr = Attrib.syntax (Scan.peek (fn context => haftmann@25312: List.foldr op || Scan.fail (map snd (CodeAttr.get (Context.theory_of context))))); haftmann@25312: in wenzelm@26463: Context.>> (Context.map_theory wenzelm@26463: (Attrib.add_attributes wenzelm@26463: [("code", code_attr, "declare theorems for code generation")])) haftmann@25312: end; haftmann@25312: haftmann@25312: haftmann@25312: (** certificate theorems **) haftmann@24219: haftmann@24219: fun string_of_lthms r = case Susp.peek r wenzelm@26928: of SOME thms => (map Display.string_of_thm o rev) thms haftmann@24219: | NONE => ["[...]"]; haftmann@24219: haftmann@24219: fun pretty_lthms ctxt r = case Susp.peek r haftmann@24219: of SOME thms => map (ProofContext.pretty_thm ctxt) thms haftmann@24219: | NONE => [Pretty.str "[...]"]; haftmann@24219: haftmann@24219: fun certificate thy f r = haftmann@24219: case Susp.peek r haftmann@24219: of SOME thms => (Susp.value o f thy) thms haftmann@24844: | NONE => let haftmann@24844: val thy_ref = Theory.check_thy thy; haftmann@24844: in Susp.delay (fn () => (f (Theory.deref thy_ref) o Susp.force) r) end; haftmann@24219: haftmann@24219: haftmann@25312: (** logical and syntactical specification of executable code **) haftmann@24219: haftmann@24219: (* pairs of (selected, deleted) defining equations *) haftmann@24219: haftmann@24219: type sdthms = thm list Susp.T * thm list; haftmann@24219: haftmann@24219: fun add_drop_redundant thm (sels, dels) = haftmann@24219: let haftmann@24219: val thy = Thm.theory_of_thm thm; haftmann@24219: val args_of = snd o strip_comb o fst o Logic.dest_equals o Thm.plain_prop_of; haftmann@24219: val args = args_of thm; haftmann@24219: fun matches [] _ = true haftmann@24219: | matches (Var _ :: xs) [] = matches xs [] haftmann@24219: | matches (_ :: _) [] = false haftmann@24219: | matches (x :: xs) (y :: ys) = Pattern.matches thy (x, y) andalso matches xs ys; haftmann@24219: fun drop thm' = not (matches args (args_of thm')) wenzelm@26928: orelse (warning ("code generator: dropping redundant defining equation\n" ^ Display.string_of_thm thm'); false); haftmann@24219: val (keeps, drops) = List.partition drop sels; haftmann@24219: in (thm :: keeps, dels |> remove Thm.eq_thm_prop thm |> fold (insert Thm.eq_thm_prop) drops) end; haftmann@24219: haftmann@24219: fun add_thm thm (sels, dels) = haftmann@24219: apfst Susp.value (add_drop_redundant thm (Susp.force sels, dels)); haftmann@24219: haftmann@24219: fun add_lthms lthms (sels, []) = haftmann@24219: (Susp.delay (fn () => fold add_drop_redundant haftmann@24219: (Susp.force lthms) (Susp.force sels, []) |> fst), []) haftmann@24219: (*FIXME*) haftmann@24219: | add_lthms lthms (sels, dels) = haftmann@24219: fold add_thm (Susp.force lthms) (sels, dels); haftmann@24219: haftmann@24219: fun del_thm thm (sels, dels) = haftmann@24219: (Susp.value (remove Thm.eq_thm_prop thm (Susp.force sels)), thm :: dels); haftmann@24219: haftmann@26021: fun del_thms (sels, dels) = haftmann@26021: let haftmann@26021: val all_sels = Susp.force sels; haftmann@26021: in (Susp.value [], rev all_sels @ dels) end; haftmann@26021: haftmann@24219: fun pretty_sdthms ctxt (sels, _) = pretty_lthms ctxt sels; haftmann@24219: haftmann@25312: haftmann@25312: (* fundamental melting operations *) haftmann@25312: haftmann@25312: fun melt _ ([], []) = (false, []) haftmann@25312: | melt _ ([], ys) = (true, ys) haftmann@25312: | melt eq (xs, ys) = fold_rev haftmann@25312: (fn y => fn (t, xs) => (t orelse not (member eq xs y), insert eq y xs)) ys (false, xs); haftmann@25312: haftmann@25312: fun melt_alist eq_key eq (xys as (xs, ys)) = haftmann@25312: if eq_list (eq_pair eq_key eq) (xs, ys) haftmann@25312: then (false, xs) haftmann@25312: else (true, AList.merge eq_key eq xys); haftmann@25312: haftmann@25312: val melt_thms = melt Thm.eq_thm_prop; haftmann@25312: haftmann@25312: fun melt_lthms (r1, r2) = haftmann@25312: if Susp.same (r1, r2) haftmann@25312: then (false, r1) haftmann@25312: else case Susp.peek r1 haftmann@25312: of SOME [] => (true, r2) haftmann@25312: | _ => case Susp.peek r2 haftmann@25312: of SOME [] => (true, r1) haftmann@25312: | _ => (apsnd (Susp.delay o K)) (melt_thms (Susp.force r1, Susp.force r2)); haftmann@25312: haftmann@25312: fun melt_sdthms ((sels1, dels1), (sels2, dels2)) = haftmann@24219: let haftmann@25312: val (dels_t, dels) = melt_thms (dels1, dels2); haftmann@24219: in if dels_t haftmann@24219: then let haftmann@25312: val (_, sels) = melt_thms haftmann@24219: (subtract Thm.eq_thm_prop dels2 (Susp.force sels1), Susp.force sels2); haftmann@25312: val (_, dels) = melt_thms haftmann@24219: (subtract Thm.eq_thm_prop (Susp.force sels2) dels1, dels2); haftmann@24219: in (true, ((Susp.delay o K) sels, dels)) end haftmann@24219: else let haftmann@25312: val (sels_t, sels) = melt_lthms (sels1, sels2); haftmann@24219: in (sels_t, (sels, dels)) end haftmann@24219: end; haftmann@24219: haftmann@24219: haftmann@25312: (* specification data *) haftmann@24219: haftmann@25312: fun melt_funcs tabs = haftmann@24219: let haftmann@25312: val tab' = Symtab.join (fn _ => fn ((_, a), (_, b)) => melt_sdthms (a, b)) tabs; haftmann@25312: val touched = Symtab.fold (fn (c, (true, _)) => insert (op =) c | _ => I) tab' []; haftmann@25312: in (touched, tab') end; haftmann@24219: haftmann@24219: val eq_string = op = : string * string -> bool; haftmann@24219: fun eq_dtyp ((vs1, cs1), (vs2, cs2)) = haftmann@24219: gen_eq_set (eq_pair eq_string (gen_eq_set eq_string)) (vs1, vs2) haftmann@24423: andalso gen_eq_set (eq_fst eq_string) (cs1, cs2); haftmann@25312: fun melt_dtyps (tabs as (tab1, tab2)) = haftmann@24219: let haftmann@24219: val tycos1 = Symtab.keys tab1; haftmann@24219: val tycos2 = Symtab.keys tab2; haftmann@24219: val tycos' = filter (member eq_string tycos2) tycos1; haftmann@25312: val touched = not (gen_eq_set (op =) (tycos1, tycos2) haftmann@25312: andalso gen_eq_set (eq_pair (op =) eq_dtyp) haftmann@24219: (AList.make (the o Symtab.lookup tab1) tycos', haftmann@24219: AList.make (the o Symtab.lookup tab2) tycos')); haftmann@24219: fun join _ (cos as (_, cos2)) = if eq_dtyp cos haftmann@24219: then raise Symtab.SAME else cos2; haftmann@25312: in (touched, Symtab.join join tabs) end; haftmann@24219: haftmann@25312: fun melt_cases ((cases1, undefs1), (cases2, undefs2)) = haftmann@24844: let haftmann@24844: val touched1 = subtract (op =) (Symtab.keys cases1) (Symtab.keys cases2) haftmann@24844: @ subtract (op =) (Symtab.keys cases2) (Symtab.keys cases1); haftmann@24844: val touched2 = subtract (op =) (Symtab.keys undefs1) (Symtab.keys undefs2) haftmann@24844: @ subtract (op =) (Symtab.keys undefs2) (Symtab.keys undefs1); haftmann@24844: val touched = fold (insert (op =)) touched1 touched2; haftmann@24844: in haftmann@24844: (touched, (Symtab.merge (K true) (cases1, cases2), haftmann@24844: Symtab.merge (K true) (undefs1, undefs2))) haftmann@24844: end; haftmann@24844: haftmann@24219: datatype spec = Spec of { haftmann@25312: funcs: (bool * sdthms) Symtab.table, haftmann@24844: dtyps: ((string * sort) list * (string * typ list) list) Symtab.table, haftmann@24844: cases: (int * string list) Symtab.table * unit Symtab.table haftmann@24219: }; haftmann@24219: haftmann@24844: fun mk_spec (funcs, (dtyps, cases)) = haftmann@24844: Spec { funcs = funcs, dtyps = dtyps, cases = cases }; haftmann@24844: fun map_spec f (Spec { funcs = funcs, dtyps = dtyps, cases = cases }) = haftmann@24844: mk_spec (f (funcs, (dtyps, cases))); haftmann@25312: fun melt_spec (Spec { funcs = funcs1, dtyps = dtyps1, cases = cases1 }, haftmann@24844: Spec { funcs = funcs2, dtyps = dtyps2, cases = cases2 }) = haftmann@24219: let haftmann@25312: val (touched_funcs, funcs) = melt_funcs (funcs1, funcs2); haftmann@25312: val (touched_dtyps, dtyps) = melt_dtyps (dtyps1, dtyps2); haftmann@25312: val (touched_cases, cases) = melt_cases (cases1, cases2); haftmann@25312: val touched = if touched_dtyps then NONE else haftmann@25312: SOME (fold (insert (op =)) touched_cases touched_funcs); haftmann@24844: in (touched, mk_spec (funcs, (dtyps, cases))) end; haftmann@24219: haftmann@25312: haftmann@25312: (* pre- and postprocessor *) haftmann@25312: haftmann@25312: datatype thmproc = Thmproc of { haftmann@25312: inlines: thm list, haftmann@25312: inline_procs: (string * (serial * (theory -> cterm list -> thm list))) list, haftmann@25312: preprocs: (string * (serial * (theory -> thm list -> thm list))) list, haftmann@25312: posts: thm list haftmann@25312: }; haftmann@25312: haftmann@25312: fun mk_thmproc (((inlines, inline_procs), preprocs), posts) = haftmann@25312: Thmproc { inlines = inlines, inline_procs = inline_procs, preprocs = preprocs, haftmann@25312: posts = posts }; haftmann@25312: fun map_thmproc f (Thmproc { inlines, inline_procs, preprocs, posts }) = haftmann@25312: mk_thmproc (f (((inlines, inline_procs), preprocs), posts)); haftmann@25312: fun melt_thmproc (Thmproc { inlines = inlines1, inline_procs = inline_procs1, haftmann@25312: preprocs = preprocs1, posts = posts1 }, haftmann@25312: Thmproc { inlines = inlines2, inline_procs = inline_procs2, haftmann@25312: preprocs = preprocs2, posts= posts2 }) = haftmann@25312: let haftmann@25312: val (touched1, inlines) = melt_thms (inlines1, inlines2); haftmann@25312: val (touched2, inline_procs) = melt_alist (op =) (eq_fst (op =)) (inline_procs1, inline_procs2); haftmann@25312: val (touched3, preprocs) = melt_alist (op =) (eq_fst (op =)) (preprocs1, preprocs2); haftmann@25312: val (_, posts) = melt_thms (posts1, posts2); haftmann@25312: in (touched1 orelse touched2 orelse touched3, haftmann@25312: mk_thmproc (((inlines, inline_procs), preprocs), posts)) end; haftmann@25312: haftmann@24219: datatype exec = Exec of { haftmann@24219: thmproc: thmproc, haftmann@24219: spec: spec haftmann@24219: }; haftmann@24219: haftmann@24219: fun mk_exec (thmproc, spec) = haftmann@24219: Exec { thmproc = thmproc, spec = spec }; haftmann@24219: fun map_exec f (Exec { thmproc = thmproc, spec = spec }) = haftmann@24219: mk_exec (f (thmproc, spec)); haftmann@25312: fun melt_exec (Exec { thmproc = thmproc1, spec = spec1 }, haftmann@24219: Exec { thmproc = thmproc2, spec = spec2 }) = haftmann@24219: let haftmann@25312: val (touched', thmproc) = melt_thmproc (thmproc1, thmproc2); haftmann@25312: val (touched_cs, spec) = melt_spec (spec1, spec2); haftmann@24219: val touched = if touched' then NONE else touched_cs; haftmann@24219: in (touched, mk_exec (thmproc, spec)) end; haftmann@24219: val empty_exec = mk_exec (mk_thmproc ((([], []), []), []), haftmann@24844: mk_spec (Symtab.empty, (Symtab.empty, (Symtab.empty, Symtab.empty)))); haftmann@24219: haftmann@25312: fun the_thmproc (Exec { thmproc = Thmproc x, ...}) = x; haftmann@24219: fun the_spec (Exec { spec = Spec x, ...}) = x; haftmann@24219: val the_funcs = #funcs o the_spec; haftmann@24219: val the_dtyps = #dtyps o the_spec; haftmann@24844: val the_cases = #cases o the_spec; haftmann@24219: val map_thmproc = map_exec o apfst o map_thmproc; haftmann@24219: val map_funcs = map_exec o apsnd o map_spec o apfst; haftmann@24844: val map_dtyps = map_exec o apsnd o map_spec o apsnd o apfst; haftmann@24844: val map_cases = map_exec o apsnd o map_spec o apsnd o apsnd; haftmann@24219: haftmann@24219: haftmann@24219: (* data slots dependent on executable content *) haftmann@24219: haftmann@24219: (*private copy avoids potential conflict of table exceptions*) haftmann@24219: structure Datatab = TableFun(type key = int val ord = int_ord); haftmann@24219: haftmann@24219: local haftmann@24219: haftmann@24219: type kind = { haftmann@24219: empty: Object.T, haftmann@24219: merge: Pretty.pp -> Object.T * Object.T -> Object.T, haftmann@24423: purge: theory option -> string list option -> Object.T -> Object.T haftmann@24219: }; haftmann@24219: haftmann@24219: val kinds = ref (Datatab.empty: kind Datatab.table); haftmann@24219: val kind_keys = ref ([]: serial list); haftmann@24219: haftmann@24219: fun invoke f k = case Datatab.lookup (! kinds) k haftmann@24219: of SOME kind => f kind haftmann@24219: | NONE => sys_error "Invalid code data identifier"; haftmann@24219: haftmann@24219: in haftmann@24219: haftmann@24219: fun declare_data empty merge purge = haftmann@24219: let haftmann@24219: val k = serial (); haftmann@24219: val kind = {empty = empty, merge = merge, purge = purge}; haftmann@24219: val _ = change kinds (Datatab.update (k, kind)); haftmann@24219: val _ = change kind_keys (cons k); haftmann@24219: in k end; haftmann@24219: haftmann@24219: fun invoke_empty k = invoke (fn kind => #empty kind) k; haftmann@24219: haftmann@24219: fun invoke_merge_all pp = Datatab.join haftmann@24219: (invoke (fn kind => #merge kind pp)); haftmann@24219: haftmann@24219: fun invoke_purge_all thy_opt cs = haftmann@24219: fold (fn k => Datatab.map_entry k haftmann@24219: (invoke (fn kind => #purge kind thy_opt cs) k)) (! kind_keys); haftmann@24219: haftmann@24219: end; (*local*) haftmann@24219: haftmann@24219: haftmann@25312: (** theory store **) haftmann@24219: haftmann@24219: local haftmann@24219: haftmann@24219: type data = Object.T Datatab.table; haftmann@24219: haftmann@24219: structure CodeData = TheoryDataFun haftmann@24219: ( haftmann@24219: type T = exec * data ref; haftmann@24219: val empty = (empty_exec, ref Datatab.empty : data ref); haftmann@24219: fun copy (exec, data) = (exec, ref (! data)); haftmann@24219: val extend = copy; haftmann@24219: fun merge pp ((exec1, data1), (exec2, data2)) = haftmann@24219: let haftmann@25312: val (touched, exec) = melt_exec (exec1, exec2); haftmann@24219: val data1' = invoke_purge_all NONE touched (! data1); haftmann@24219: val data2' = invoke_purge_all NONE touched (! data2); haftmann@24219: val data = invoke_merge_all pp (data1', data2'); haftmann@24219: in (exec, ref data) end; haftmann@24219: ); haftmann@24219: wenzelm@26463: val _ = Context.>> (Context.map_theory CodeData.init); haftmann@24219: haftmann@24219: fun thy_data f thy = f ((snd o CodeData.get) thy); haftmann@24219: haftmann@24219: fun get_ensure_init kind data_ref = haftmann@24219: case Datatab.lookup (! data_ref) kind haftmann@24219: of SOME x => x haftmann@24219: | NONE => let val y = invoke_empty kind haftmann@24219: in (change data_ref (Datatab.update (kind, y)); y) end; haftmann@24219: haftmann@24219: in haftmann@24219: haftmann@24219: (* access to executable content *) haftmann@24219: haftmann@24844: val the_exec = fst o CodeData.get; haftmann@24219: haftmann@24219: fun map_exec_purge touched f thy = haftmann@24219: CodeData.map (fn (exec, data) => haftmann@24219: (f exec, ref (invoke_purge_all (SOME thy) touched (! data)))) thy; haftmann@24219: haftmann@24219: haftmann@24219: (* access to data dependent on abstract executable content *) haftmann@24219: haftmann@24219: fun get_data (kind, _, dest) = thy_data (get_ensure_init kind #> dest); haftmann@24219: haftmann@24219: fun change_data (kind, mk, dest) = haftmann@24219: let haftmann@24219: fun chnge data_ref f = haftmann@24219: let haftmann@24219: val data = get_ensure_init kind data_ref; haftmann@24219: val data' = f (dest data); haftmann@24219: in (change data_ref (Datatab.update (kind, mk data')); data') end; haftmann@24219: in thy_data chnge end; haftmann@24219: haftmann@24219: fun change_yield_data (kind, mk, dest) = haftmann@24219: let haftmann@24219: fun chnge data_ref f = haftmann@24219: let haftmann@24219: val data = get_ensure_init kind data_ref; haftmann@24219: val (x, data') = f (dest data); haftmann@24219: in (x, (change data_ref (Datatab.update (kind, mk data')); data')) end; haftmann@24219: in thy_data chnge end; haftmann@24219: haftmann@24219: end; (*local*) haftmann@24219: haftmann@24219: haftmann@24219: (* print executable content *) haftmann@24219: haftmann@24219: fun print_codesetup thy = haftmann@24219: let haftmann@24219: val ctxt = ProofContext.init thy; haftmann@24844: val exec = the_exec thy; haftmann@24219: fun pretty_func (s, lthms) = haftmann@24219: (Pretty.block o Pretty.fbreaks) ( haftmann@24219: Pretty.str s :: pretty_sdthms ctxt lthms haftmann@24219: ); haftmann@24219: fun pretty_dtyp (s, []) = haftmann@24219: Pretty.str s haftmann@24219: | pretty_dtyp (s, cos) = haftmann@24219: (Pretty.block o Pretty.breaks) ( haftmann@24219: Pretty.str s haftmann@24219: :: Pretty.str "=" haftmann@24219: :: separate (Pretty.str "|") (map (fn (c, []) => Pretty.str c haftmann@24219: | (c, tys) => haftmann@24219: (Pretty.block o Pretty.breaks) haftmann@24423: (Pretty.str (CodeUnit.string_of_const thy c) haftmann@24423: :: Pretty.str "of" :: map (Pretty.quote o Sign.pretty_typ thy) tys)) cos) haftmann@24219: ); haftmann@24219: val inlines = (#inlines o the_thmproc) exec; haftmann@25968: val posts = (#posts o the_thmproc) exec; haftmann@24219: val inline_procs = (map fst o #inline_procs o the_thmproc) exec; haftmann@24219: val preprocs = (map fst o #preprocs o the_thmproc) exec; haftmann@24219: val funs = the_funcs exec haftmann@24423: |> Symtab.dest haftmann@25312: |> (map o apsnd) snd haftmann@24219: |> (map o apfst) (CodeUnit.string_of_const thy) haftmann@24219: |> sort (string_ord o pairself fst); haftmann@24219: val dtyps = the_dtyps exec haftmann@24219: |> Symtab.dest haftmann@24219: |> map (fn (dtco, (vs, cos)) => (Sign.string_of_typ thy (Type (dtco, map TFree vs)), cos)) haftmann@24219: |> sort (string_ord o pairself fst) haftmann@24219: in haftmann@24219: (Pretty.writeln o Pretty.chunks) [ haftmann@24219: Pretty.block ( haftmann@24219: Pretty.str "defining equations:" haftmann@24219: :: Pretty.fbrk haftmann@24219: :: (Pretty.fbreaks o map pretty_func) funs haftmann@24219: ), haftmann@24219: Pretty.block ( haftmann@24219: Pretty.str "inlining theorems:" haftmann@24219: :: Pretty.fbrk haftmann@24219: :: (Pretty.fbreaks o map (ProofContext.pretty_thm ctxt)) inlines haftmann@24219: ), haftmann@24219: Pretty.block ( haftmann@24219: Pretty.str "inlining procedures:" haftmann@24219: :: Pretty.fbrk haftmann@24219: :: (Pretty.fbreaks o map Pretty.str) inline_procs haftmann@24219: ), haftmann@24219: Pretty.block ( haftmann@24219: Pretty.str "preprocessors:" haftmann@24219: :: Pretty.fbrk haftmann@24219: :: (Pretty.fbreaks o map Pretty.str) preprocs haftmann@24219: ), haftmann@24219: Pretty.block ( haftmann@25968: Pretty.str "postprocessor theorems:" haftmann@25968: :: Pretty.fbrk haftmann@25968: :: (Pretty.fbreaks o map (ProofContext.pretty_thm ctxt)) posts haftmann@25968: ), haftmann@25968: Pretty.block ( haftmann@24219: Pretty.str "datatypes:" haftmann@24219: :: Pretty.fbrk haftmann@24219: :: (Pretty.fbreaks o map pretty_dtyp) dtyps haftmann@24219: ) haftmann@24219: ] haftmann@24219: end; haftmann@24219: haftmann@24219: haftmann@24219: haftmann@24219: (** theorem transformation and certification **) haftmann@24219: haftmann@24219: fun common_typ_funcs [] = [] haftmann@24219: | common_typ_funcs [thm] = [thm] haftmann@24219: | common_typ_funcs (thms as thm :: _) = haftmann@24219: let haftmann@24219: val thy = Thm.theory_of_thm thm; haftmann@24219: fun incr_thm thm max = haftmann@24219: let haftmann@24219: val thm' = incr_indexes max thm; haftmann@24219: val max' = Thm.maxidx_of thm' + 1; haftmann@24219: in (thm', max') end; haftmann@24219: val (thms', maxidx) = fold_map incr_thm thms 0; haftmann@24219: val ty1 :: tys = map (snd o CodeUnit.head_func) thms'; haftmann@24219: fun unify ty env = Sign.typ_unify thy (ty1, ty) env haftmann@24219: handle Type.TUNIFY => haftmann@24219: error ("Type unificaton failed, while unifying defining equations\n" haftmann@24219: ^ (cat_lines o map Display.string_of_thm) thms haftmann@24219: ^ "\nwith types\n" haftmann@24219: ^ (cat_lines o map (CodeUnit.string_of_typ thy)) (ty1 :: tys)); haftmann@24219: val (env, _) = fold unify tys (Vartab.empty, maxidx) haftmann@24219: val instT = Vartab.fold (fn (x_i, (sort, ty)) => haftmann@24219: cons (Thm.ctyp_of thy (TVar (x_i, sort)), Thm.ctyp_of thy ty)) env []; haftmann@24219: in map (Thm.instantiate (instT, [])) thms' end; haftmann@24219: haftmann@25597: fun const_of_func thy = AxClass.unoverload_const thy o CodeUnit.head_func; haftmann@24423: haftmann@24219: fun certify_const thy const thms = haftmann@24219: let haftmann@24423: fun cert thm = if const = const_of_func thy thm haftmann@24219: then thm else error ("Wrong head of defining equation,\nexpected constant " wenzelm@26928: ^ CodeUnit.string_of_const thy const ^ "\n" ^ Display.string_of_thm thm) haftmann@24219: in map cert thms end; haftmann@24219: haftmann@24219: haftmann@24219: haftmann@24219: (** operational sort algebra and class discipline **) haftmann@24219: haftmann@24219: local haftmann@24219: haftmann@24219: fun aggr_neutr f y [] = y haftmann@24219: | aggr_neutr f y (x::xs) = aggr_neutr f (f y x) xs; haftmann@24219: haftmann@24219: fun aggregate f [] = NONE haftmann@24219: | aggregate f (x::xs) = SOME (aggr_neutr f x xs); haftmann@24219: haftmann@25462: fun inter_sorts algebra = haftmann@25462: aggregate (map2 (curry (Sorts.inter_sort algebra))); haftmann@24219: haftmann@24219: fun specific_constraints thy (class, tyco) = haftmann@24219: let haftmann@24219: val vs = Name.invents Name.context "" (Sign.arity_number thy tyco); wenzelm@24969: val classparams = (map fst o these o try (#params o AxClass.get_info thy)) class; haftmann@24837: val funcs = classparams haftmann@25597: |> map_filter (fn c => try (AxClass.param_of_inst thy) (c, tyco)) haftmann@24844: |> map (Symtab.lookup ((the_funcs o the_exec) thy)) haftmann@25312: |> (map o Option.map) (Susp.force o fst o snd) haftmann@24219: |> maps these haftmann@24423: |> map (Thm.transfer thy) haftmann@24423: fun sorts_of [Type (_, tys)] = map (snd o dest_TVar) tys haftmann@24423: | sorts_of tys = map (snd o dest_TVar) tys; haftmann@24423: val sorts = map (sorts_of o Sign.const_typargs thy o CodeUnit.head_func) funcs; haftmann@24219: in sorts end; haftmann@24219: haftmann@25462: fun weakest_constraints thy algebra (class, tyco) = haftmann@24219: let haftmann@25462: val all_superclasses = Sorts.complete_sort algebra [class]; haftmann@25462: in case inter_sorts algebra (maps (fn class => specific_constraints thy (class, tyco)) all_superclasses) haftmann@24219: of SOME sorts => sorts haftmann@25462: | NONE => Sorts.mg_domain algebra tyco [class] haftmann@24219: end; haftmann@24219: haftmann@25462: fun strongest_constraints thy algebra (class, tyco) = haftmann@24219: let haftmann@24219: val all_subclasses = class :: Graph.all_preds ((#classes o Sorts.rep_algebra) algebra) [class]; haftmann@24219: val inst_subclasses = filter (can (Sorts.mg_domain algebra tyco) o single) all_subclasses; haftmann@25462: in case inter_sorts algebra (maps (fn class => specific_constraints thy (class, tyco)) inst_subclasses) haftmann@24219: of SOME sorts => sorts haftmann@24219: | NONE => replicate haftmann@25462: (Sign.arity_number thy tyco) (Sorts.minimize_sort algebra (Sorts.all_classes algebra)) haftmann@25462: end; haftmann@25462: haftmann@25462: fun get_algebra thy (class, tyco) = haftmann@25462: let haftmann@25462: val base_algebra = Sign.classes_of thy; haftmann@25462: in if can (Sorts.mg_domain base_algebra tyco) [class] haftmann@25462: then base_algebra haftmann@25462: else let haftmann@25462: val superclasses = Sorts.super_classes base_algebra class; haftmann@25462: val sorts = inter_sorts base_algebra haftmann@25462: (map_filter (fn class => try (Sorts.mg_domain base_algebra tyco) [class]) superclasses) haftmann@25462: |> the_default (replicate (Sign.arity_number thy tyco) []) haftmann@25462: in haftmann@25462: base_algebra haftmann@25462: |> Sorts.add_arities (Sign.pp thy) (tyco, [(class, sorts)]) haftmann@25462: end haftmann@24219: end; haftmann@24219: haftmann@24837: fun gen_classparam_typ constr thy class (c, tyco) = haftmann@24219: let haftmann@25462: val algebra = get_algebra thy (class, tyco); wenzelm@24969: val cs = these (try (#params o AxClass.get_info thy) class); haftmann@25462: val SOME ty = AList.lookup (op =) cs c; wenzelm@24969: val sort_args = Name.names (Name.declare Name.aT Name.context) Name.aT haftmann@25462: (constr thy algebra (class, tyco)); haftmann@24219: val ty_inst = Type (tyco, map TFree sort_args); haftmann@24219: in Logic.varifyT (map_type_tfree (K ty_inst) ty) end; haftmann@24219: haftmann@24219: fun retrieve_algebra thy operational = haftmann@24219: Sorts.subalgebra (Sign.pp thy) operational haftmann@25462: (weakest_constraints thy (Sign.classes_of thy)) haftmann@24219: (Sign.classes_of thy); haftmann@24219: haftmann@24219: in haftmann@24219: haftmann@24219: fun coregular_algebra thy = retrieve_algebra thy (K true) |> snd; haftmann@24219: fun operational_algebra thy = haftmann@24219: let haftmann@24219: fun add_iff_operational class = wenzelm@24928: can (AxClass.get_info thy) class ? cons class; haftmann@24219: val operational_classes = fold add_iff_operational (Sign.all_classes thy) [] haftmann@24219: in retrieve_algebra thy (member (op =) operational_classes) end; haftmann@24219: haftmann@24837: val classparam_weakest_typ = gen_classparam_typ weakest_constraints; haftmann@24837: val classparam_strongest_typ = gen_classparam_typ strongest_constraints; haftmann@24219: haftmann@24219: fun assert_func_typ thm = haftmann@24219: let haftmann@24219: val thy = Thm.theory_of_thm thm; haftmann@24837: fun check_typ_classparam tyco (c, thm) = haftmann@24219: let haftmann@24423: val SOME class = AxClass.class_of_param thy c; haftmann@24219: val (_, ty) = CodeUnit.head_func thm; haftmann@24837: val ty_decl = classparam_weakest_typ thy class (c, tyco); haftmann@24837: val ty_strongest = classparam_strongest_typ thy class (c, tyco); haftmann@24219: fun constrain thm = haftmann@24219: let haftmann@24219: val max = Thm.maxidx_of thm + 1; haftmann@24219: val ty_decl' = Logic.incr_tvar max ty_decl; haftmann@24219: val (_, ty') = CodeUnit.head_func thm; haftmann@24219: val (env, _) = Sign.typ_unify thy (ty_decl', ty') (Vartab.empty, max); haftmann@24219: val instT = Vartab.fold (fn (x_i, (sort, ty)) => haftmann@24219: cons (Thm.ctyp_of thy (TVar (x_i, sort)), Thm.ctyp_of thy ty)) env []; haftmann@24219: in Thm.instantiate (instT, []) thm end; haftmann@24219: in if Sign.typ_instance thy (ty_strongest, ty) haftmann@24219: then if Sign.typ_instance thy (ty, ty_decl) haftmann@24219: then thm haftmann@24219: else (warning ("Constraining type\n" ^ CodeUnit.string_of_typ thy ty haftmann@24219: ^ "\nof defining equation\n" wenzelm@26928: ^ Display.string_of_thm thm haftmann@24219: ^ "\nto permitted most general type\n" haftmann@24219: ^ CodeUnit.string_of_typ thy ty_decl); haftmann@24219: constrain thm) haftmann@24219: else CodeUnit.bad_thm ("Type\n" ^ CodeUnit.string_of_typ thy ty haftmann@24219: ^ "\nof defining equation\n" wenzelm@26928: ^ Display.string_of_thm thm haftmann@24219: ^ "\nis incompatible with permitted least general type\n" haftmann@24219: ^ CodeUnit.string_of_typ thy ty_strongest) haftmann@24423: end; haftmann@24423: fun check_typ_fun (c, thm) = haftmann@24219: let haftmann@24219: val (_, ty) = CodeUnit.head_func thm; haftmann@24219: val ty_decl = Sign.the_const_type thy c; haftmann@24219: in if Sign.typ_equiv thy (Type.strip_sorts ty_decl, Type.strip_sorts ty) haftmann@24219: then thm haftmann@24219: else CodeUnit.bad_thm ("Type\n" ^ CodeUnit.string_of_typ thy ty haftmann@24219: ^ "\nof defining equation\n" wenzelm@26928: ^ Display.string_of_thm thm haftmann@24219: ^ "\nis incompatible with declared function type\n" haftmann@24219: ^ CodeUnit.string_of_typ thy ty_decl) haftmann@24219: end; haftmann@24423: fun check_typ (c, thm) = haftmann@25597: case AxClass.inst_of_param thy c haftmann@24837: of SOME (c, tyco) => check_typ_classparam tyco (c, thm) haftmann@24423: | NONE => check_typ_fun (c, thm); haftmann@24423: in check_typ (const_of_func thy thm, thm) end; haftmann@24219: haftmann@24283: val mk_func = CodeUnit.error_thm (assert_func_typ o CodeUnit.mk_func); haftmann@24624: val mk_liberal_func = CodeUnit.warning_thm (assert_func_typ o CodeUnit.mk_func); haftmann@24624: val mk_default_func = CodeUnit.try_thm (assert_func_typ o CodeUnit.mk_func); haftmann@24219: haftmann@24219: end; haftmann@24219: haftmann@24219: haftmann@24219: haftmann@24219: (** interfaces and attributes **) haftmann@24219: haftmann@24624: fun delete_force msg key xs = haftmann@24624: if AList.defined (op =) xs key then AList.delete (op =) key xs haftmann@24624: else error ("No such " ^ msg ^ ": " ^ quote key); haftmann@24624: haftmann@24423: fun get_datatype thy tyco = haftmann@24844: case Symtab.lookup ((the_dtyps o the_exec) thy) tyco haftmann@24423: of SOME spec => spec haftmann@24423: | NONE => Sign.arity_number thy tyco wenzelm@24848: |> Name.invents Name.context Name.aT haftmann@24423: |> map (rpair []) haftmann@24423: |> rpair []; haftmann@24423: haftmann@24423: fun get_datatype_of_constr thy c = haftmann@24423: case (snd o strip_type o Sign.the_const_type thy) c haftmann@24423: of Type (tyco, _) => if member (op =) haftmann@24844: ((the_default [] o Option.map (map fst o snd) o Symtab.lookup ((the_dtyps o the_exec) thy)) tyco) c haftmann@24423: then SOME tyco else NONE haftmann@24423: | _ => NONE; haftmann@24423: haftmann@24423: fun get_constr_typ thy c = haftmann@24423: case get_datatype_of_constr thy c haftmann@24423: of SOME tyco => let haftmann@24423: val (vs, cos) = get_datatype thy tyco; haftmann@24423: val SOME tys = AList.lookup (op =) cos c; haftmann@24423: val ty = tys ---> Type (tyco, map TFree vs); haftmann@24423: in SOME (Logic.varifyT ty) end haftmann@24423: | NONE => NONE; haftmann@24423: haftmann@24844: val get_case_data = Symtab.lookup o fst o the_cases o the_exec; haftmann@24844: haftmann@24844: val is_undefined = Symtab.defined o snd o the_cases o the_exec; haftmann@24844: haftmann@24624: fun add_func thm thy = haftmann@24624: let haftmann@24624: val func = mk_func thm; haftmann@24624: val c = const_of_func thy func; haftmann@24624: val _ = if (is_some o AxClass.class_of_param thy) c haftmann@24624: then error ("Rejected polymorphic equation for overloaded constant:\n" wenzelm@26928: ^ Display.string_of_thm thm) haftmann@24624: else (); haftmann@24624: val _ = if (is_some o get_datatype_of_constr thy) c haftmann@24624: then error ("Rejected equation for datatype constructor:\n" wenzelm@26928: ^ Display.string_of_thm func) haftmann@24624: else (); haftmann@24624: in haftmann@24624: (map_exec_purge (SOME [c]) o map_funcs) (Symtab.map_default haftmann@25312: (c, (false, (Susp.value [], []))) (apsnd (add_thm func))) thy haftmann@24624: end; haftmann@24219: haftmann@24624: fun add_liberal_func thm thy = haftmann@24624: case mk_liberal_func thm haftmann@24624: of SOME func => let haftmann@24624: val c = const_of_func thy func haftmann@24624: in if (is_some o AxClass.class_of_param thy) c haftmann@24624: orelse (is_some o get_datatype_of_constr thy) c haftmann@24624: then thy haftmann@24624: else map_exec_purge (SOME [c]) (map_funcs haftmann@24624: (Symtab.map_default haftmann@25312: (c, (false, (Susp.value [], []))) (apsnd (add_thm func)))) thy haftmann@24624: end haftmann@24624: | NONE => thy; haftmann@24624: haftmann@24624: fun add_default_func thm thy = haftmann@24624: case mk_default_func thm haftmann@24624: of SOME func => let haftmann@24624: val c = const_of_func thy func haftmann@24624: in if (is_some o AxClass.class_of_param thy) c haftmann@24624: orelse (is_some o get_datatype_of_constr thy) c haftmann@24624: then thy haftmann@24624: else map_exec_purge (SOME [c]) (map_funcs haftmann@24624: (Symtab.map_default haftmann@25312: (c, (false, (Susp.value [], []))) (apsnd (add_thm func)))) thy haftmann@24624: end haftmann@24624: | NONE => thy; haftmann@24219: haftmann@24219: fun del_func thm thy = haftmann@24659: case mk_liberal_func thm haftmann@24659: of SOME func => let haftmann@24659: val c = const_of_func thy func; haftmann@24659: in map_exec_purge (SOME [c]) (map_funcs haftmann@25312: (Symtab.map_entry c (apsnd (del_thm func)))) thy haftmann@24659: end haftmann@24659: | NONE => thy; haftmann@24219: haftmann@26021: fun del_funcs const = map_exec_purge (SOME [const]) haftmann@26021: (map_funcs (Symtab.map_entry const (apsnd del_thms))); haftmann@26021: haftmann@24219: fun add_funcl (const, lthms) thy = haftmann@24219: let haftmann@24219: val lthms' = certificate thy (fn thy => certify_const thy const) lthms; haftmann@24219: (*FIXME must check compatibility with sort algebra; haftmann@24219: alas, naive checking results in non-termination!*) haftmann@24219: in haftmann@25312: map_exec_purge (SOME [const]) haftmann@25312: (map_funcs (Symtab.map_default (const, (false, (Susp.value [], []))) haftmann@25312: (apsnd (add_lthms lthms')))) thy haftmann@24219: end; haftmann@24219: haftmann@24624: val add_default_func_attr = Attrib.internal (fn _ => Thm.declaration_attribute haftmann@24624: (fn thm => Context.mapping (add_default_func thm) I)); haftmann@24219: haftmann@25485: structure TypeInterpretation = InterpretationFun(type T = string * serial val eq = eq_snd (op =) : T * T -> bool); haftmann@25462: haftmann@24423: fun add_datatype raw_cs thy = haftmann@24219: let haftmann@25597: val cs = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) raw_cs; haftmann@24423: val (tyco, vs_cos) = CodeUnit.constrset_of_consts thy cs; haftmann@25462: val cs' = map fst (snd vs_cos); haftmann@25462: val purge_cs = case Symtab.lookup ((the_dtyps o the_exec) thy) tyco haftmann@25462: of SOME (vs, cos) => if null cos then NONE else SOME (cs' @ map fst cos) haftmann@24423: | NONE => NONE; haftmann@24219: in haftmann@24219: thy haftmann@25462: |> map_exec_purge purge_cs (map_dtyps (Symtab.update (tyco, vs_cos)) haftmann@24423: #> map_funcs (fold (Symtab.delete_safe o fst) cs)) haftmann@25485: |> TypeInterpretation.data (tyco, serial ()) haftmann@24219: end; haftmann@24219: haftmann@25485: fun type_interpretation f = TypeInterpretation.interpretation haftmann@25485: (fn (tyco, _) => fn thy => f (tyco, get_datatype thy tyco) thy); haftmann@25485: haftmann@24423: fun add_datatype_cmd raw_cs thy = haftmann@24423: let haftmann@24423: val cs = map (CodeUnit.read_bare_const thy) raw_cs; haftmann@24423: in add_datatype cs thy end; haftmann@24219: haftmann@24844: fun add_case thm thy = haftmann@24844: let haftmann@24844: val entry as (c, _) = CodeUnit.case_cert thm; haftmann@24844: in haftmann@24844: (map_exec_purge (SOME [c]) o map_cases o apfst) (Symtab.update entry) thy haftmann@24844: end; haftmann@24844: haftmann@24844: fun add_undefined c thy = haftmann@24844: (map_exec_purge (SOME [c]) o map_cases o apsnd) (Symtab.update (c, ())) thy; haftmann@24844: haftmann@24219: fun add_inline thm thy = haftmann@24219: (map_exec_purge NONE o map_thmproc o apfst o apfst o apfst) haftmann@24219: (insert Thm.eq_thm_prop (CodeUnit.error_thm CodeUnit.mk_rew thm)) thy; haftmann@24219: (*fully applied in order to get right context for mk_rew!*) haftmann@24219: haftmann@24219: fun del_inline thm thy = haftmann@24219: (map_exec_purge NONE o map_thmproc o apfst o apfst o apfst) haftmann@24219: (remove Thm.eq_thm_prop (CodeUnit.error_thm CodeUnit.mk_rew thm)) thy; haftmann@24219: (*fully applied in order to get right context for mk_rew!*) haftmann@24219: haftmann@24219: fun add_inline_proc (name, f) = haftmann@24219: (map_exec_purge NONE o map_thmproc o apfst o apfst o apsnd) haftmann@24219: (AList.update (op =) (name, (serial (), f))); haftmann@24219: haftmann@24219: fun del_inline_proc name = haftmann@24219: (map_exec_purge NONE o map_thmproc o apfst o apfst o apsnd) haftmann@24219: (delete_force "inline procedure" name); haftmann@24219: haftmann@24219: fun add_preproc (name, f) = haftmann@24219: (map_exec_purge NONE o map_thmproc o apfst o apsnd) haftmann@24219: (AList.update (op =) (name, (serial (), f))); haftmann@24219: haftmann@24219: fun del_preproc name = haftmann@24219: (map_exec_purge NONE o map_thmproc o apfst o apsnd) haftmann@24219: (delete_force "preprocessor" name); haftmann@24219: haftmann@24219: fun add_post thm thy = haftmann@24219: (map_exec_purge NONE o map_thmproc o apsnd) haftmann@24219: (insert Thm.eq_thm_prop (CodeUnit.error_thm CodeUnit.mk_rew thm)) thy; haftmann@24219: (*fully applied in order to get right context for mk_rew!*) haftmann@24219: haftmann@24219: fun del_post thm thy = haftmann@24219: (map_exec_purge NONE o map_thmproc o apsnd) haftmann@24219: (remove Thm.eq_thm_prop (CodeUnit.error_thm CodeUnit.mk_rew thm)) thy; haftmann@24219: (*fully applied in order to get right context for mk_rew!*) haftmann@24219: wenzelm@26463: val _ = Context.>> (Context.map_theory haftmann@24219: (let haftmann@24219: fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I); haftmann@24219: fun add_simple_attribute (name, f) = haftmann@24219: add_attribute (name, Scan.succeed (mk_attribute f)); haftmann@24219: fun add_del_attribute (name, (add, del)) = haftmann@24219: add_attribute (name, Args.del |-- Scan.succeed (mk_attribute del) haftmann@24219: || Scan.succeed (mk_attribute add)) haftmann@24219: in haftmann@25462: TypeInterpretation.init haftmann@25462: #> add_del_attribute ("func", (add_func, del_func)) haftmann@24219: #> add_del_attribute ("inline", (add_inline, del_inline)) haftmann@24219: #> add_del_attribute ("post", (add_post, del_post)) wenzelm@26463: end)); haftmann@24219: haftmann@24219: haftmann@24219: (** post- and preprocessing **) haftmann@24219: haftmann@24219: local haftmann@24219: haftmann@24219: fun gen_apply_inline_proc prep post thy f x = haftmann@24219: let haftmann@24219: val cts = prep x; haftmann@24219: val rews = map CodeUnit.assert_rew (f thy cts); haftmann@24219: in post rews x end; haftmann@24219: haftmann@24219: val apply_inline_proc = gen_apply_inline_proc (maps haftmann@24219: ((fn [args, rhs] => rhs :: (snd o Drule.strip_comb) args) o snd o Drule.strip_comb o Thm.cprop_of)) haftmann@24219: (fn rews => map (CodeUnit.rewrite_func rews)); haftmann@24219: val apply_inline_proc_cterm = gen_apply_inline_proc single haftmann@24219: (MetaSimplifier.rewrite false); haftmann@24219: haftmann@24219: fun apply_preproc thy f [] = [] haftmann@24219: | apply_preproc thy f (thms as (thm :: _)) = haftmann@24219: let haftmann@24423: val const = const_of_func thy thm; haftmann@24219: val thms' = f thy thms; haftmann@24219: in certify_const thy const thms' end; haftmann@24219: haftmann@24219: fun rhs_conv conv thm = haftmann@24219: let haftmann@24219: val thm' = (conv o Thm.rhs_of) thm; haftmann@24219: in Thm.transitive thm thm' end haftmann@24219: haftmann@24837: fun term_of_conv thy f = haftmann@24837: Thm.cterm_of thy haftmann@24837: #> f haftmann@24837: #> Thm.prop_of haftmann@24837: #> Logic.dest_equals haftmann@24837: #> snd; haftmann@24837: haftmann@24219: in haftmann@24219: haftmann@24219: fun preprocess thy thms = haftmann@24219: thms haftmann@24844: |> fold (fn (_, (_, f)) => apply_preproc thy f) ((#preprocs o the_thmproc o the_exec) thy) haftmann@24844: |> map (CodeUnit.rewrite_func ((#inlines o the_thmproc o the_exec) thy)) haftmann@24844: |> fold (fn (_, (_, f)) => apply_inline_proc thy f) ((#inline_procs o the_thmproc o the_exec) thy) haftmann@24219: (*FIXME - must check: rewrite rule, defining equation, proper constant |> map (snd o check_func false thy) *) haftmann@24423: |> common_typ_funcs haftmann@25597: |> map (AxClass.unoverload thy); haftmann@24219: haftmann@24219: fun preprocess_conv ct = haftmann@24219: let haftmann@24219: val thy = Thm.theory_of_cterm ct; haftmann@24219: in haftmann@24219: ct haftmann@24844: |> MetaSimplifier.rewrite false ((#inlines o the_thmproc o the_exec) thy) haftmann@24219: |> fold (fn (_, (_, f)) => rhs_conv (apply_inline_proc_cterm thy f)) haftmann@24844: ((#inline_procs o the_thmproc o the_exec) thy) haftmann@25597: |> rhs_conv (AxClass.unoverload_conv thy) haftmann@24219: end; haftmann@24219: haftmann@24837: fun preprocess_term thy = term_of_conv thy preprocess_conv; haftmann@24837: haftmann@24219: fun postprocess_conv ct = haftmann@24219: let haftmann@24219: val thy = Thm.theory_of_cterm ct; haftmann@24219: in haftmann@24219: ct haftmann@25597: |> AxClass.overload_conv thy haftmann@24844: |> rhs_conv (MetaSimplifier.rewrite false ((#posts o the_thmproc o the_exec) thy)) haftmann@24219: end; haftmann@24219: haftmann@24837: fun postprocess_term thy = term_of_conv thy postprocess_conv; haftmann@24837: haftmann@24219: end; (*local*) haftmann@24219: haftmann@25597: fun default_typ_proto thy c = case AxClass.inst_of_param thy c haftmann@24837: of SOME (c, tyco) => classparam_weakest_typ thy ((the o AxClass.class_of_param thy) c) haftmann@24423: (c, tyco) |> SOME haftmann@24423: | NONE => (case AxClass.class_of_param thy c haftmann@24423: of SOME class => SOME (Term.map_type_tvar wenzelm@24848: (K (TVar ((Name.aT, 0), [class]))) (Sign.the_const_type thy c)) haftmann@24423: | NONE => get_constr_typ thy c); haftmann@24219: haftmann@24219: local haftmann@24219: haftmann@24219: fun get_funcs thy const = haftmann@24844: Symtab.lookup ((the_funcs o the_exec) thy) const haftmann@25312: |> Option.map (Susp.force o fst o snd) haftmann@24219: |> these haftmann@24219: |> map (Thm.transfer thy); haftmann@24219: haftmann@24219: in haftmann@24219: haftmann@24219: fun these_funcs thy const = haftmann@24219: let haftmann@24219: fun drop_refl thy = filter_out (is_equal o Term.fast_term_ord o Logic.dest_equals haftmann@24219: o ObjectLogic.drop_judgment thy o Thm.plain_prop_of); haftmann@24219: in haftmann@24219: get_funcs thy const haftmann@24219: |> preprocess thy haftmann@24219: |> drop_refl thy haftmann@24219: end; haftmann@24219: haftmann@24423: fun default_typ thy c = case default_typ_proto thy c haftmann@24219: of SOME ty => ty haftmann@24423: | NONE => (case get_funcs thy c haftmann@25597: of thm :: _ => snd (CodeUnit.head_func (AxClass.unoverload thy thm)) haftmann@24219: | [] => Sign.the_const_type thy c); haftmann@24219: haftmann@24219: end; (*local*) haftmann@24219: haftmann@24219: end; (*struct*) haftmann@24219: haftmann@24219: haftmann@24219: (** type-safe interfaces for data depedent on executable content **) haftmann@24219: haftmann@24219: functor CodeDataFun(Data: CODE_DATA_ARGS): CODE_DATA = haftmann@24219: struct haftmann@24219: haftmann@24219: type T = Data.T; haftmann@24219: exception Data of T; haftmann@24219: fun dest (Data x) = x haftmann@24219: haftmann@24219: val kind = Code.declare_data (Data Data.empty) haftmann@24219: (fn pp => fn (Data x1, Data x2) => Data (Data.merge pp (x1, x2))) haftmann@24219: (fn thy_opt => fn cs => fn Data x => Data (Data.purge thy_opt cs x)); haftmann@24219: haftmann@24219: val data_op = (kind, Data, dest); haftmann@24219: haftmann@24219: val get = Code.get_data data_op; haftmann@24219: val change = Code.change_data data_op; haftmann@24219: fun change_yield thy = Code.change_yield_data data_op thy; haftmann@24219: haftmann@24219: end; haftmann@24219: haftmann@24219: structure Code : CODE = haftmann@24219: struct haftmann@24219: haftmann@24219: open Code; haftmann@24219: haftmann@24219: end;