author | haftmann |
Thu, 06 Apr 2006 16:09:54 +0200 | |
changeset 19344 | b4e00947c8a1 |
parent 19202 | 0b9eb4b0ad98 |
child 19575 | 2d9940cd52d3 |
permissions | -rw-r--r-- |
12447 | 1 |
(* Title: HOL/recfun_codegen.ML |
2 |
ID: $Id$ |
|
3 |
Author: Stefan Berghofer, TU Muenchen |
|
4 |
||
5 |
Code generator for recursive functions. |
|
6 |
*) |
|
7 |
||
8 |
signature RECFUN_CODEGEN = |
|
9 |
sig |
|
18728 | 10 |
val add: string option -> attribute |
11 |
val del: attribute |
|
18702 | 12 |
val get_thm_equations: theory -> string * typ -> (thm list * typ) option |
18708 | 13 |
val setup: theory -> theory |
12447 | 14 |
end; |
15 |
||
16 |
structure RecfunCodegen : RECFUN_CODEGEN = |
|
17 |
struct |
|
18 |
||
19 |
open Codegen; |
|
20 |
||
16424 | 21 |
structure CodegenData = TheoryDataFun |
22 |
(struct |
|
12447 | 23 |
val name = "HOL/recfun_codegen"; |
16645 | 24 |
type T = (thm * string option) list Symtab.table; |
12447 | 25 |
val empty = Symtab.empty; |
26 |
val copy = I; |
|
16424 | 27 |
val extend = I; |
18931 | 28 |
fun merge _ = Symtab.merge_list (Drule.eq_thm_prop o pairself fst); |
12447 | 29 |
fun print _ _ = (); |
16424 | 30 |
end); |
12447 | 31 |
|
32 |
||
33 |
val dest_eqn = HOLogic.dest_eq o HOLogic.dest_Trueprop; |
|
15321
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
34 |
val lhs_of = fst o dest_eqn o prop_of; |
12447 | 35 |
val const_of = dest_Const o head_of o fst o dest_eqn; |
36 |
||
37 |
fun warn thm = warning ("RecfunCodegen: Not a proper equation:\n" ^ |
|
38 |
string_of_thm thm); |
|
39 |
||
19344 | 40 |
fun add optmod = Thm.declaration_attribute (fn thm => Context.map_theory |
12447 | 41 |
let |
19344 | 42 |
fun add thm = |
43 |
if Pattern.pattern (lhs_of thm) then |
|
44 |
CodegenData.map |
|
45 |
(Symtab.update_list ((fst o const_of o prop_of) thm, (thm, optmod))) |
|
46 |
else tap (fn _ => warn thm) |
|
47 |
handle TERM _ => tap (fn _ => warn thm); |
|
15321
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
48 |
in |
19344 | 49 |
add thm |
50 |
#> CodegenTheorems.add_fun thm |
|
51 |
end); |
|
12447 | 52 |
|
19344 | 53 |
fun del_thm thm thy = |
14196 | 54 |
let |
55 |
val tab = CodegenData.get thy; |
|
56 |
val (s, _) = const_of (prop_of thm); |
|
17412 | 57 |
in case Symtab.lookup tab s of |
18728 | 58 |
NONE => thy |
59 |
| SOME thms => |
|
60 |
CodegenData.put (Symtab.update (s, gen_rem (eq_thm o apfst fst) (thms, thm)) tab) thy |
|
19344 | 61 |
end handle TERM _ => (warn thm; thy); |
62 |
||
63 |
val del = Thm.declaration_attribute |
|
64 |
(fn thm => Context.map_theory (del_thm thm #> CodegenTheorems.del_def thm)) |
|
14196 | 65 |
|
15321
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
66 |
fun del_redundant thy eqs [] = eqs |
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
67 |
| del_redundant thy eqs (eq :: eqs') = |
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
68 |
let |
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
69 |
val matches = curry |
17203 | 70 |
(Pattern.matches thy o pairself (lhs_of o fst)) |
15321
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
71 |
in del_redundant thy (eq :: eqs) (filter_out (matches eq) eqs') end; |
694f9d3ce90d
Reimplemented some operations on "code lemma" table to avoid that code
berghofe
parents:
15257
diff
changeset
|
72 |
|
16645 | 73 |
fun get_equations thy defs (s, T) = |
17412 | 74 |
(case Symtab.lookup (CodegenData.get thy) s of |
16645 | 75 |
NONE => ([], "") |
76 |
| SOME thms => |
|
77 |
let val thms' = del_redundant thy [] |
|
78 |
(List.filter (fn (thm, _) => is_instance thy T |
|
79 |
(snd (const_of (prop_of thm)))) thms) |
|
80 |
in if null thms' then ([], "") |
|
81 |
else (preprocess thy (map fst thms'), |
|
82 |
case snd (snd (split_last thms')) of |
|
83 |
NONE => (case get_defn thy defs s T of |
|
84 |
NONE => thyname_of_const s thy |
|
85 |
| SOME ((_, (thyname, _)), _) => thyname) |
|
86 |
| SOME thyname => thyname) |
|
87 |
end); |
|
12447 | 88 |
|
18702 | 89 |
fun get_thm_equations thy (c, ty) = |
90 |
Symtab.lookup (CodegenData.get thy) c |
|
91 |
|> Option.map (fn thms => |
|
92 |
List.filter (fn (thm, _) => is_instance thy ty ((snd o const_of o prop_of) thm)) thms |
|
93 |
|> del_redundant thy []) |
|
94 |
|> Option.mapPartial (fn thms => if null thms then NONE else SOME thms) |
|
95 |
|> Option.map (fn thms => |
|
96 |
(preprocess thy (map fst thms), |
|
97 |
(snd o const_of o prop_of o fst o hd) thms)) |
|
98 |
|> (Option.map o apfst o map) (fn thm => thm RS HOL.eq_reflection); |
|
99 |
||
16645 | 100 |
fun mk_suffix thy defs (s, T) = (case get_defn thy defs s T of |
17144 | 101 |
SOME (_, SOME i) => " def" ^ string_of_int i | _ => ""); |
12447 | 102 |
|
103 |
exception EQN of string * typ * string; |
|
104 |
||
105 |
fun cycle g (xs, x) = |
|
106 |
if x mem xs then xs |
|
17144 | 107 |
else Library.foldl (cycle g) (x :: xs, List.concat (Graph.find_paths (fst g) (x, x))); |
12447 | 108 |
|
17144 | 109 |
fun add_rec_funs thy defs gr dep eqs module = |
12447 | 110 |
let |
16645 | 111 |
fun dest_eq t = (fst (const_of t) ^ mk_suffix thy defs (const_of t), |
112 |
dest_eqn (rename_term t)); |
|
12447 | 113 |
val eqs' = map dest_eq eqs; |
114 |
val (dname, _) :: _ = eqs'; |
|
115 |
val (s, T) = const_of (hd eqs); |
|
116 |
||
17144 | 117 |
fun mk_fundef module fname prfx gr [] = (gr, []) |
118 |
| mk_fundef module fname prfx gr ((fname', (lhs, rhs)) :: xs) = |
|
12447 | 119 |
let |
17144 | 120 |
val (gr1, pl) = invoke_codegen thy defs dname module false (gr, lhs); |
121 |
val (gr2, pr) = invoke_codegen thy defs dname module false (gr1, rhs); |
|
122 |
val (gr3, rest) = mk_fundef module fname' "and " gr2 xs |
|
12447 | 123 |
in |
124 |
(gr3, Pretty.blk (4, [Pretty.str (if fname = fname' then " | " else prfx), |
|
125 |
pl, Pretty.str " =", Pretty.brk 1, pr]) :: rest) |
|
126 |
end; |
|
127 |
||
17144 | 128 |
fun put_code module fundef = map_node dname |
129 |
(K (SOME (EQN ("", dummyT, dname)), module, Pretty.string_of (Pretty.blk (0, |
|
12447 | 130 |
separate Pretty.fbrk fundef @ [Pretty.str ";"])) ^ "\n\n")); |
131 |
||
132 |
in |
|
17144 | 133 |
(case try (get_node gr) dname of |
15531 | 134 |
NONE => |
12447 | 135 |
let |
17144 | 136 |
val gr1 = add_edge (dname, dep) |
137 |
(new_node (dname, (SOME (EQN (s, T, "")), module, "")) gr); |
|
138 |
val (gr2, fundef) = mk_fundef module "" "fun " gr1 eqs'; |
|
12447 | 139 |
val xs = cycle gr2 ([], dname); |
17144 | 140 |
val cs = map (fn x => case get_node gr2 x of |
16645 | 141 |
(SOME (EQN (s, T, _)), _, _) => (s, T) |
12447 | 142 |
| _ => error ("RecfunCodegen: illegal cyclic dependencies:\n" ^ |
143 |
implode (separate ", " xs))) xs |
|
144 |
in (case xs of |
|
17144 | 145 |
[_] => (put_code module fundef gr2, module) |
12447 | 146 |
| _ => |
147 |
if not (dep mem xs) then |
|
148 |
let |
|
16645 | 149 |
val thmss as (_, thyname) :: _ = map (get_equations thy defs) cs; |
17144 | 150 |
val module' = if_library thyname module; |
16645 | 151 |
val eqs'' = map (dest_eq o prop_of) (List.concat (map fst thmss)); |
17144 | 152 |
val (gr3, fundef') = mk_fundef module' "" "fun " |
153 |
(add_edge (dname, dep) |
|
154 |
(foldr (uncurry new_node) (del_nodes xs gr2) |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
155 |
(map (fn k => |
17144 | 156 |
(k, (SOME (EQN ("", dummyT, dname)), module', ""))) xs))) eqs'' |
157 |
in (put_code module' fundef' gr3, module') end |
|
158 |
else (gr2, module)) |
|
12447 | 159 |
end |
17144 | 160 |
| SOME (SOME (EQN (_, _, s)), module', _) => |
161 |
(if s = "" then |
|
162 |
if dname = dep then gr else add_edge (dname, dep) gr |
|
163 |
else if s = dep then gr else add_edge (s, dep) gr, |
|
164 |
module')) |
|
12447 | 165 |
end; |
166 |
||
17144 | 167 |
fun recfun_codegen thy defs gr dep module brack t = (case strip_comb t of |
16645 | 168 |
(Const (p as (s, T)), ts) => (case (get_equations thy defs p, get_assoc_code thy s T) of |
169 |
(([], _), _) => NONE |
|
15531 | 170 |
| (_, SOME _) => NONE |
17144 | 171 |
| ((eqns, thyname), NONE) => |
16645 | 172 |
let |
17144 | 173 |
val module' = if_library thyname module; |
16645 | 174 |
val (gr', ps) = foldl_map |
17144 | 175 |
(invoke_codegen thy defs dep module true) (gr, ts); |
176 |
val suffix = mk_suffix thy defs p; |
|
177 |
val (gr'', module'') = |
|
178 |
add_rec_funs thy defs gr' dep (map prop_of eqns) module'; |
|
179 |
val (gr''', fname) = mk_const_id module'' (s ^ suffix) gr'' |
|
12447 | 180 |
in |
17144 | 181 |
SOME (gr''', mk_app brack (Pretty.str (mk_qual_id module fname)) ps) |
12447 | 182 |
end) |
15531 | 183 |
| _ => NONE); |
12447 | 184 |
|
185 |
||
18708 | 186 |
val setup = |
187 |
CodegenData.init #> |
|
188 |
add_codegen "recfun" recfun_codegen #> |
|
18220 | 189 |
add_attribute "" |
19344 | 190 |
(Args.del |-- Scan.succeed del |
191 |
|| Scan.option (Args.$$$ "target" |-- Args.colon |-- Args.name) >> add); |
|
12447 | 192 |
|
193 |
end; |