--- a/src/HOL/Tools/recfun_codegen.ML Fri Jul 01 14:11:06 2005 +0200
+++ b/src/HOL/Tools/recfun_codegen.ML Fri Jul 01 14:13:40 2005 +0200
@@ -7,7 +7,8 @@
signature RECFUN_CODEGEN =
sig
- val add: theory attribute
+ val add: string option -> theory attribute
+ val del: theory attribute
val setup: (theory -> theory) list
end;
@@ -19,11 +20,11 @@
structure CodegenData = TheoryDataFun
(struct
val name = "HOL/recfun_codegen";
- type T = thm list Symtab.table;
+ type T = (thm * string option) list Symtab.table;
val empty = Symtab.empty;
val copy = I;
val extend = I;
- fun merge _ = Symtab.merge_multi' Drule.eq_thm_prop;
+ fun merge _ = Symtab.merge_multi' (Drule.eq_thm_prop o pairself fst);
fun print _ _ = ();
end);
@@ -35,14 +36,14 @@
fun warn thm = warning ("RecfunCodegen: Not a proper equation:\n" ^
string_of_thm thm);
-fun add (p as (thy, thm)) =
+fun add optmod (p as (thy, thm)) =
let
val tab = CodegenData.get thy;
val (s, _) = const_of (prop_of thm);
in
if Pattern.pattern (lhs_of thm) then
(CodegenData.put (Symtab.update ((s,
- thm :: getOpt (Symtab.lookup (tab, s), [])), tab)) thy, thm)
+ (thm, optmod) :: getOpt (Symtab.lookup (tab, s), [])), tab)) thy, thm)
else (warn thm; p)
end handle TERM _ => (warn thm; p);
@@ -53,7 +54,7 @@
in case Symtab.lookup (tab, s) of
NONE => p
| SOME thms => (CodegenData.put (Symtab.update ((s,
- gen_rem eq_thm (thms, thm)), tab)) thy, thm)
+ gen_rem (eq_thm o apfst fst) (thms, thm)), tab)) thy, thm)
end handle TERM _ => (warn thm; p);
fun del_redundant thy eqs [] = eqs
@@ -61,20 +62,27 @@
let
val tsig = Sign.tsig_of (sign_of thy);
val matches = curry
- (Pattern.matches tsig o pairself lhs_of)
+ (Pattern.matches tsig o pairself (lhs_of o fst))
in del_redundant thy (eq :: eqs) (filter_out (matches eq) eqs') end;
-fun get_equations thy (s, T) =
+fun get_equations thy defs (s, T) =
(case Symtab.lookup (CodegenData.get thy, s) of
- NONE => []
- | SOME thms => preprocess thy (del_redundant thy []
- (List.filter (fn thm => is_instance thy T
- (snd (const_of (prop_of thm)))) thms)));
+ NONE => ([], "")
+ | SOME thms =>
+ let val thms' = del_redundant thy []
+ (List.filter (fn (thm, _) => is_instance thy T
+ (snd (const_of (prop_of thm)))) thms)
+ in if null thms' then ([], "")
+ else (preprocess thy (map fst thms'),
+ case snd (snd (split_last thms')) of
+ NONE => (case get_defn thy defs s T of
+ NONE => thyname_of_const s thy
+ | SOME ((_, (thyname, _)), _) => thyname)
+ | SOME thyname => thyname)
+ end);
-fun mk_poly_id thy (s, T) = mk_const_id (sign_of thy) s ^
- (case get_defn thy s T of
- SOME (_, SOME i) => "_def" ^ string_of_int i
- | _ => "");
+fun mk_suffix thy defs (s, T) = (case get_defn thy defs s T of
+ SOME (_, SOME i) => "_def" ^ string_of_int i | _ => "");
exception EQN of string * typ * string;
@@ -82,27 +90,27 @@
if x mem xs then xs
else Library.foldl (cycle g) (x :: xs, List.concat (Graph.find_paths g (x, x)));
-fun add_rec_funs thy gr dep eqs =
+fun add_rec_funs thy defs gr dep eqs thyname =
let
- fun dest_eq t =
- (mk_poly_id thy (const_of t), dest_eqn (rename_term t));
+ fun dest_eq t = (fst (const_of t) ^ mk_suffix thy defs (const_of t),
+ dest_eqn (rename_term t));
val eqs' = map dest_eq eqs;
val (dname, _) :: _ = eqs';
val (s, T) = const_of (hd eqs);
- fun mk_fundef fname prfx gr [] = (gr, [])
- | mk_fundef fname prfx gr ((fname', (lhs, rhs)) :: xs) =
+ fun mk_fundef thyname fname prfx gr [] = (gr, [])
+ | mk_fundef thyname fname prfx gr ((fname', (lhs, rhs)) :: xs) =
let
- val (gr1, pl) = invoke_codegen thy dname false (gr, lhs);
- val (gr2, pr) = invoke_codegen thy dname false (gr1, rhs);
- val (gr3, rest) = mk_fundef fname' "and " gr2 xs
+ val (gr1, pl) = invoke_codegen thy defs dname thyname false (gr, lhs);
+ val (gr2, pr) = invoke_codegen thy defs dname thyname false (gr1, rhs);
+ val (gr3, rest) = mk_fundef thyname fname' "and " gr2 xs
in
(gr3, Pretty.blk (4, [Pretty.str (if fname = fname' then " | " else prfx),
pl, Pretty.str " =", Pretty.brk 1, pr]) :: rest)
end;
- fun put_code fundef = Graph.map_node dname
- (K (SOME (EQN ("", dummyT, dname)), Pretty.string_of (Pretty.blk (0,
+ fun put_code thyname fundef = Graph.map_node dname
+ (K (SOME (EQN ("", dummyT, dname)), thyname, Pretty.string_of (Pretty.blk (0,
separate Pretty.fbrk fundef @ [Pretty.str ";"])) ^ "\n\n"));
in
@@ -110,43 +118,47 @@
NONE =>
let
val gr1 = Graph.add_edge (dname, dep)
- (Graph.new_node (dname, (SOME (EQN (s, T, "")), "")) gr);
- val (gr2, fundef) = mk_fundef "" "fun " gr1 eqs';
+ (Graph.new_node (dname, (SOME (EQN (s, T, "")), "", "")) gr);
+ val (gr2, fundef) = mk_fundef thyname "" "fun " gr1 eqs';
val xs = cycle gr2 ([], dname);
val cs = map (fn x => case Graph.get_node gr2 x of
- (SOME (EQN (s, T, _)), _) => (s, T)
+ (SOME (EQN (s, T, _)), _, _) => (s, T)
| _ => error ("RecfunCodegen: illegal cyclic dependencies:\n" ^
implode (separate ", " xs))) xs
in (case xs of
- [_] => put_code fundef gr2
+ [_] => put_code thyname fundef gr2
| _ =>
if not (dep mem xs) then
let
- val eqs'' = map (dest_eq o prop_of)
- (List.concat (map (get_equations thy) cs));
- val (gr3, fundef') = mk_fundef "" "fun "
+ val thmss as (_, thyname) :: _ = map (get_equations thy defs) cs;
+ val eqs'' = map (dest_eq o prop_of) (List.concat (map fst thmss));
+ val (gr3, fundef') = mk_fundef thyname "" "fun "
(Graph.add_edge (dname, dep)
(foldr (uncurry Graph.new_node) (Graph.del_nodes xs gr2)
(map (fn k =>
- (k, (SOME (EQN ("", dummyT, dname)), ""))) xs))) eqs''
- in put_code fundef' gr3 end
+ (k, (SOME (EQN ("", dummyT, dname)), thyname, ""))) xs))) eqs''
+ in put_code thyname fundef' gr3 end
else gr2)
end
- | SOME (SOME (EQN (_, _, s)), _) =>
+ | SOME (SOME (EQN (_, _, s)), _, _) =>
if s = "" then
if dname = dep then gr else Graph.add_edge (dname, dep) gr
else if s = dep then gr else Graph.add_edge (s, dep) gr)
end;
-fun recfun_codegen thy gr dep brack t = (case strip_comb t of
- (Const (p as (s, T)), ts) => (case (get_equations thy p, get_assoc_code thy s T) of
- ([], _) => NONE
+fun recfun_codegen thy defs gr dep thyname brack t = (case strip_comb t of
+ (Const (p as (s, T)), ts) => (case (get_equations thy defs p, get_assoc_code thy s T) of
+ (([], _), _) => NONE
| (_, SOME _) => NONE
- | (eqns, NONE) =>
- let val (gr', ps) = foldl_map (invoke_codegen thy dep true) (gr, ts)
+ | ((eqns, thyname'), NONE) =>
+ let
+ val (gr', ps) = foldl_map
+ (invoke_codegen thy defs dep thyname true) (gr, ts);
+ val suffix = mk_suffix thy defs p
in
- SOME (add_rec_funs thy gr' dep (map prop_of eqns),
- mk_app brack (Pretty.str (mk_poly_id thy p)) ps)
+ SOME (add_rec_funs thy defs gr' dep (map prop_of eqns) thyname',
+ mk_app brack (Pretty.str
+ (mk_const_id (sign_of thy) thyname thyname' s ^ suffix)) ps)
end)
| _ => NONE);
@@ -154,6 +166,8 @@
val setup =
[CodegenData.init,
add_codegen "recfun" recfun_codegen,
- add_attribute "" (Args.del |-- Scan.succeed del || Scan.succeed add)];
+ add_attribute ""
+ ( Args.del |-- Scan.succeed del
+ || Scan.option (Args.$$$ "target" |-- Args.colon |-- Args.name) >> add)];
end;