author | haftmann |
Fri, 03 Mar 2006 08:52:39 +0100 | |
changeset 19177 | 68c6824d8bb6 |
parent 19167 | f237c0cb3882 |
child 19178 | 9b295c37854f |
permissions | -rwxr-xr-x |
19116 | 1 |
(* ID: $Id$ |
19177 | 2 |
Author: Klaus Aehlig, LMU Muenchen; Tobias Nipkow, TU Muenchen |
3 |
||
4 |
Code generator for "normalization by evaluation". |
|
19116 | 5 |
*) |
6 |
||
7 |
(* Global asssumptions: |
|
8 |
For each function: there is at least one defining eqns and |
|
9 |
all defining equations have same number of arguments. |
|
10 |
||
11 |
FIXME |
|
19147 | 12 |
fun MLname |
19116 | 13 |
val quote = quote; |
14 |
||
15 |
*) |
|
16 |
||
19118 | 17 |
signature NBE_CODEGEN = |
18 |
sig |
|
19177 | 19 |
val generate: (string -> bool) -> string * CodegenThingol.def -> string; |
20 |
val nterm_to_term: theory -> NBE_Eval.nterm -> term; |
|
19118 | 21 |
end |
22 |
||
23 |
||
24 |
structure NBE_Codegen: NBE_CODEGEN = |
|
25 |
struct |
|
26 |
||
19116 | 27 |
val Eval = "NBE_Eval"; |
19147 | 28 |
val Eval_mk_Fun = Eval ^ ".mk_Fun"; |
19116 | 29 |
val Eval_apply = Eval ^ ".apply"; |
30 |
val Eval_Constr = Eval ^ ".Constr"; |
|
31 |
val Eval_C = Eval ^ ".C"; |
|
32 |
val Eval_AbsN = Eval ^ ".AbsN"; |
|
33 |
val Eval_Fun = Eval ^ ".Fun"; |
|
34 |
val Eval_BVar = Eval ^ ".BVar"; |
|
35 |
val Eval_new_name = Eval ^ ".new_name"; |
|
36 |
val Eval_to_term = Eval ^ ".to_term"; |
|
37 |
||
19147 | 38 |
fun MLname s = "nbe_" ^ translate_string (fn "." => "_" | c => c) s; |
19116 | 39 |
fun MLvname s = "v_" ^ MLname s; |
40 |
fun MLparam n = "p_" ^ string_of_int n; |
|
41 |
fun MLintern s = "i_" ^ MLname s; |
|
42 |
||
43 |
fun MLparams n = map MLparam (1 upto n); |
|
44 |
||
45 |
structure S = |
|
46 |
struct |
|
47 |
||
48 |
val quote = quote; (* FIXME *) |
|
49 |
||
50 |
fun app e1 e2 = "(" ^ e1 ^ " " ^ e2 ^ ")"; |
|
51 |
fun abs v e = "(fn" ^ v ^ " => " ^ e ^ ")"; |
|
52 |
fun tup es = "(" ^ commas es ^ ")"; |
|
53 |
fun list es = "[" ^ commas es ^ "]"; |
|
54 |
||
55 |
fun apps s ss = Library.foldl (uncurry app) (s, ss); |
|
56 |
fun nbe_apps s ss = |
|
57 |
Library.foldr (fn (s,e) => app (app Eval_apply e) s) (ss,s); |
|
58 |
||
59 |
fun eqns name ees = |
|
60 |
let fun eqn (es,e) = name ^ " " ^ space_implode " " es ^ " = " ^ e |
|
61 |
in "fun " ^ space_implode "\n | " (map eqn ees) ^ ";\n" end; |
|
62 |
||
63 |
||
64 |
fun Val v s = "val " ^ v ^ " = " ^ s; |
|
65 |
fun Let ds e = "let\n" ^ (space_implode "\n" ds) ^ " in " ^ e ^ " end" |
|
66 |
||
67 |
end |
|
68 |
||
19177 | 69 |
val tab_lookup = S.app "NBE.lookup"; |
70 |
val tab_update = S.app "NBE.update"; |
|
19147 | 71 |
|
19116 | 72 |
fun mk_nbeFUN(nm,e) = |
73 |
S.app Eval_Fun (S.tup [S.abs(S.list [MLvname nm])e,S.list [],"1", |
|
74 |
S.abs(S.tup [])(S.Let |
|
75 |
[S.Val (MLintern "var") (S.app Eval_new_name (S.tup [])), |
|
76 |
S.Val (MLvname nm) (S.app Eval_BVar (S.tup [(MLintern "var"), S.list []]))] |
|
77 |
(S.app Eval_AbsN(S.tup[MLintern "var",(S.app Eval_to_term e)])))]); |
|
78 |
||
79 |
fun take_last n xs = rev (Library.take(n, rev xs)); |
|
80 |
fun drop_last n xs = rev (Library.drop(n, rev xs)); |
|
81 |
||
82 |
fun selfcall nm ar args = |
|
83 |
if (ar <= length args) then |
|
84 |
S.nbe_apps (S.app (MLname nm) (S.list (take_last ar args))) |
|
85 |
(drop_last ar args) |
|
86 |
else S.app Eval_Fun (S.tup [MLname nm,S.list args, |
|
87 |
string_of_int(ar - (length args)), |
|
88 |
S.abs (S.tup []) (S.app Eval_C |
|
89 |
(S.quote nm))]); |
|
90 |
||
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
91 |
open BasicCodegenThingol; |
19116 | 92 |
|
19147 | 93 |
fun mk_rexpr defined nm ar = |
19116 | 94 |
let fun mk args t = case t of |
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
95 |
IConst((s,_),_) => |
19116 | 96 |
if s=nm then selfcall nm ar args |
19147 | 97 |
else if defined s then S.nbe_apps (MLname s) args |
98 |
else S.app Eval_Constr (S.tup [S.quote s,S.list args ]) |
|
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
99 |
| IVar s => S.nbe_apps (MLvname s) args |
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
100 |
| e1 `$ e2 => mk (args @ [mk [] e2]) e1 |
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
101 |
| (nm, _) `|-> e => |
19116 | 102 |
S.nbe_apps (mk_nbeFUN(nm, mk [] e)) args |
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
103 |
| IAbs (_, e) => mk args e |
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
104 |
| ICase (_, e) => mk args e |
19116 | 105 |
| _ => sys_error "NBE mkexpr" |
106 |
in mk [] end; |
|
107 |
||
108 |
val mk_lexpr = |
|
109 |
let fun mk args t = case t of |
|
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
110 |
IConst((s,_),_) => |
19116 | 111 |
S.app Eval_Constr (S.tup [S.quote s, S.list args]) |
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
112 |
| IVar s => if args = [] then MLvname s else |
19116 | 113 |
sys_error "NBE mk_lexpr illegal higher order pattern" |
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
114 |
| e1 `$ e2 => mk (args @ [mk [] e2]) e1 |
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
115 |
| IAbs (_, e) => mk args e |
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
116 |
| ICase (_, e) => mk args e |
19116 | 117 |
| _ => sys_error "NBE mk_lexpr illegal pattern" |
118 |
in mk [] end; |
|
119 |
||
19147 | 120 |
fun mk_eqn defined nm ar (lhs,e) = |
121 |
([S.list(map mk_lexpr (rev lhs))], mk_rexpr defined nm ar e); |
|
19116 | 122 |
|
19177 | 123 |
fun consts_of (IConst ((s, _), _)) = insert (op =) s |
124 |
| consts_of (e1 `$ e2) = |
|
125 |
consts_of e1 #> consts_of e2 |
|
126 |
| consts_of (_ `|-> e) = consts_of e |
|
127 |
| consts_of (IAbs (_, e)) = consts_of e |
|
128 |
| consts_of (ICase (_, e)) = consts_of e |
|
129 |
| consts_of _ = I; |
|
19116 | 130 |
|
19147 | 131 |
fun lookup nm = S.Val (MLname nm) (tab_lookup (S.quote nm)); |
19116 | 132 |
|
19167
f237c0cb3882
refined representation of codegen intermediate language
haftmann
parents:
19147
diff
changeset
|
133 |
fun generate defined (nm, CodegenThingol.Fun (eqns, _)) = |
19177 | 134 |
let |
135 |
val ar = length(fst(hd eqns)); |
|
136 |
val params = S.list (rev (MLparams ar)); |
|
137 |
val funs = Library.flat(map (fn (_,e) => consts_of e []) eqns) \ nm; |
|
138 |
val globals = map lookup (filter defined funs); |
|
139 |
val default_eqn = ([params], S.app Eval_Constr (S.tup[S.quote nm,params])); |
|
140 |
val code = S.eqns (MLname nm) |
|
141 |
(map (mk_eqn defined nm ar) eqns @ [default_eqn]) |
|
142 |
val register = tab_update |
|
143 |
(S.app Eval_mk_Fun (S.tup[S.quote nm, MLname nm, string_of_int ar])) |
|
144 |
in |
|
145 |
S.Let (globals @ [code]) register |
|
146 |
end |
|
147 |
| generate _ _ = ""; |
|
148 |
||
149 |
open NBE_Eval; |
|
150 |
||
151 |
fun nterm_to_term thy t = |
|
19116 | 152 |
let |
19177 | 153 |
fun consts_of (C s) = insert (op =) s |
154 |
| consts_of (V _) = I |
|
155 |
| consts_of (B _) = I |
|
156 |
| consts_of (A (t1, t2)) = consts_of t1 #> consts_of t2 |
|
157 |
| consts_of (AbsN (_, t)) = consts_of t; |
|
158 |
val consts = consts_of t []; |
|
159 |
val the_const = AList.lookup (op =) |
|
160 |
(consts ~~ CodegenPackage.consts_of_idfs thy consts) |
|
161 |
#> the_default ("", dummyT); |
|
162 |
fun to_term bounds (C s) = Const (the_const s) |
|
163 |
| to_term bounds (V s) = Free (s, dummyT) |
|
164 |
| to_term bounds (B i) = Bound (find_index (fn j => i = j) bounds) |
|
165 |
| to_term bounds (A (t1, t2)) = to_term bounds t1 $ to_term bounds t2 |
|
166 |
| to_term bounds (AbsN (i, t)) = |
|
167 |
Abs("u", dummyT, to_term (i::bounds) t); |
|
168 |
in to_term [] t end; |
|
19116 | 169 |
|
19118 | 170 |
end; |
171 |
||
172 |
(* |
|
173 |
||
19116 | 174 |
val use_show = fn s => (writeln ("\n---generated code:\n"^ s); |
175 |
use_text(writeln o enclose "\n---compiler echo:\n" "\n---\n", |
|
176 |
writeln o enclose "\n--- compiler echo (with error!):\n" |
|
177 |
"\n---\n") |
|
178 |
true s); |
|
179 |
||
180 |
val dummyIT = CodegenThingol.IType("DUMMY",[]); |
|
181 |
||
19147 | 182 |
use_show(NBE_Codegen.generate (the_context()) ("append",CodegenThingol.Fun( |
19116 | 183 |
[([CodegenThingol.IConst(("Nil",dummyIT),[]), |
184 |
CodegenThingol.IVarE("ys",dummyIT)], |
|
185 |
CodegenThingol.IVarE("ys",dummyIT)), |
|
186 |
([CodegenThingol.IApp( |
|
187 |
CodegenThingol.IApp( |
|
188 |
CodegenThingol.IConst(("Cons",dummyIT),[]), |
|
189 |
CodegenThingol.IVarE("x",dummyIT)), |
|
190 |
CodegenThingol.IVarE("xs",dummyIT)), |
|
191 |
CodegenThingol.IVarE("ys",dummyIT)], |
|
192 |
CodegenThingol.IApp( |
|
193 |
CodegenThingol.IApp( |
|
194 |
CodegenThingol.IConst(("Cons",dummyIT),[]), |
|
195 |
CodegenThingol.IVarE("x",dummyIT)), |
|
196 |
CodegenThingol.IApp( |
|
197 |
CodegenThingol.IApp( |
|
198 |
CodegenThingol.IConst(("append",dummyIT),[]), |
|
199 |
CodegenThingol.IVarE("xs",dummyIT)), |
|
200 |
CodegenThingol.IVarE("ys",dummyIT))))] |
|
201 |
,([],dummyIT)))); |
|
202 |
||
203 |
||
204 |
let |
|
205 |
fun test a b = if a=b then () else error "oops!"; |
|
206 |
||
207 |
val CNil = Const("Nil",dummyT); |
|
208 |
val CCons = Const("Cons",dummyT); |
|
209 |
val Cappend = Const("append",dummyT); |
|
210 |
val Fx = Free("x",dummyT); |
|
211 |
val Fy = Free("y",dummyT); |
|
212 |
val Fxs = Free("xs",dummyT); |
|
213 |
val Fys = Free("ys",dummyT); |
|
214 |
open NBE_Eval |
|
215 |
in |
|
216 |
test (nbe(CNil)) (C "Nil"); |
|
217 |
test (nbe(CCons)) (C "Cons"); |
|
218 |
test (nbe(Cappend)) (C "append"); |
|
219 |
test (nbe(Cappend $ CNil $ CNil)) (C "Nil"); |
|
220 |
test (nbe(Cappend $ Fxs)) (A (C "append", V "xs")); |
|
221 |
test (nbe(Cappend $ Fxs $ Fys)) (A (A (C "append", V "xs"), V "ys")); |
|
222 |
test (nbe(Cappend $ CNil $ Fxs)) (V "xs"); |
|
223 |
test (nbe(Cappend $ (CCons $ Fx $ Fxs) $ Fys)) |
|
224 |
(A (A (C "Cons", V "x"), A (A (C "append", V "xs"), V "ys"))); |
|
225 |
test (nbe(Cappend $ (CCons $ Fx $ Fxs) $ (CCons $ Fy $ Fys))) |
|
226 |
(A (A (C "Cons", V "x"), A (A (C "append", V "xs"), A (A (C "Cons", V "y"), V "ys")))); |
|
227 |
test (nbe(Cappend $ (CCons $ Fx $ (CCons $ Fy $ Fxs)) $ (CCons$Fy$Fys))) |
|
228 |
(A |
|
229 |
(A (C "Cons", V "x"), |
|
230 |
A |
|
231 |
(A (C "Cons", V "y"), |
|
232 |
A (A (C "append", V "xs"), A (A (C "Cons", V "y"), V "ys"))))) |
|
233 |
||
234 |
end; |
|
235 |
||
236 |
||
19147 | 237 |
use_show(NBE_Codegen.generate (the_context()) ("app",CodegenThingol.Fun( |
19116 | 238 |
[ |
239 |
([CodegenThingol.IConst(("Nil",dummyIT),[])], |
|
240 |
CodegenThingol.IAbs(CodegenThingol.IVarE("ys",dummyIT), |
|
241 |
CodegenThingol.IVarE("ys",dummyIT))), |
|
242 |
||
243 |
([CodegenThingol.IApp( |
|
244 |
CodegenThingol.IApp( |
|
245 |
CodegenThingol.IConst(("Cons",dummyIT),[]), |
|
246 |
CodegenThingol.IVarE("x",dummyIT)), |
|
247 |
CodegenThingol.IVarE("xs",dummyIT))], |
|
248 |
CodegenThingol.IAbs(CodegenThingol.IVarE("ys",dummyIT), |
|
249 |
CodegenThingol.IApp( |
|
250 |
CodegenThingol.IApp( |
|
251 |
CodegenThingol.IConst(("Cons",dummyIT),[]), |
|
252 |
CodegenThingol.IVarE("x",dummyIT)), |
|
253 |
CodegenThingol.IApp( |
|
254 |
CodegenThingol.IApp( |
|
255 |
CodegenThingol.IConst(("app",dummyIT),[]), |
|
256 |
CodegenThingol.IVarE("xs",dummyIT)), |
|
257 |
CodegenThingol.IVarE("ys",dummyIT)))))] |
|
258 |
,([],dummyIT)))); |
|
259 |
||
260 |
||
261 |
let |
|
262 |
fun test a b = if a=b then () else error "oops!"; |
|
263 |
||
264 |
val CNil = Const("Nil",dummyT); |
|
265 |
val CCons = Const("Cons",dummyT); |
|
266 |
val Cappend = Const("app",dummyT); |
|
267 |
val Fx = Free("x",dummyT); |
|
268 |
val Fy = Free("y",dummyT); |
|
269 |
val Fxs = Free("xs",dummyT); |
|
270 |
val Fys = Free("ys",dummyT); |
|
271 |
open NBE_Eval |
|
272 |
in |
|
273 |
test (nbe(CNil)) (C "Nil"); |
|
274 |
test (nbe(CCons)) (C "Cons"); |
|
275 |
test (nbe(Cappend)) (C "app"); |
|
276 |
test (nbe(Cappend $ CNil)) (AbsN (1, B 1)); |
|
277 |
test (nbe(Cappend $ CNil $ CNil)) (C "Nil"); |
|
278 |
test (nbe(Cappend $ Fxs)) (A (C "app", V "xs")); |
|
279 |
test (nbe(Cappend $ Fxs $ Fys)) (A (A (C "app", V "xs"), V "ys")); |
|
280 |
test (nbe(Cappend $ CNil $ Fxs)) (V "xs"); |
|
281 |
test (nbe(Cappend $ (CCons $ Fx $ Fxs) $ Fys)) |
|
282 |
(A (A (C "Cons", V "x"), A (A (C "app", V "xs"), V "ys"))); |
|
283 |
test (nbe(Cappend $ (CCons $ Fx $ Fxs))) |
|
284 |
(AbsN (1, A (A (C "Cons", V "x"), A (A (C "app", V "xs"), B 1)))); |
|
285 |
test (nbe(Cappend $ (CCons $ Fx $ Fxs) $ (CCons $ Fy $ Fys))) |
|
286 |
(A (A (C "Cons", V "x"), A (A (C "app", V "xs"), A (A (C "Cons", V "y"), V "ys")))); |
|
287 |
test (nbe(Cappend $ (CCons $ Fx $ (CCons $ Fy $ Fxs)) $ (CCons$Fy$Fys))) |
|
288 |
(A |
|
289 |
(A (C "Cons", V "x"), |
|
290 |
A |
|
291 |
(A (C "Cons", V "y"), |
|
292 |
A (A (C "app", V "xs"), A (A (C "Cons", V "y"), V "ys"))))); |
|
293 |
() |
|
294 |
end; |
|
295 |
||
296 |
||
19147 | 297 |
use_show(NBE_Codegen.generate (the_context()) ("add",CodegenThingol.Fun( |
19116 | 298 |
[ |
299 |
([CodegenThingol.IConst(("0",dummyIT),[])], |
|
300 |
CodegenThingol.IAbs(CodegenThingol.IVarE("n",dummyIT), |
|
301 |
CodegenThingol.IVarE("n",dummyIT))), |
|
302 |
([CodegenThingol.IApp( |
|
303 |
CodegenThingol.IConst(("S",dummyIT),[]), |
|
304 |
CodegenThingol.IVarE("n",dummyIT))], |
|
305 |
CodegenThingol.IAbs(CodegenThingol.IVarE("m",dummyIT), |
|
306 |
CodegenThingol.IApp( |
|
307 |
CodegenThingol.IConst(("S",dummyIT),[]), |
|
308 |
CodegenThingol.IApp( |
|
309 |
CodegenThingol.IApp( |
|
310 |
CodegenThingol.IConst(("add",dummyIT),[]), |
|
311 |
CodegenThingol.IVarE("n",dummyIT)), |
|
312 |
CodegenThingol.IVarE("m",dummyIT)))))] |
|
313 |
,([],dummyIT)))); |
|
314 |
||
315 |
||
316 |
let |
|
317 |
fun test a b = if a=b then () else error "oops!"; |
|
318 |
||
319 |
val C0 = Const("0",dummyT); |
|
320 |
val CS = Const("S",dummyT); |
|
321 |
val Cadd = Const("add",dummyT); |
|
322 |
val Fx = Free("x",dummyT); |
|
323 |
val Fy = Free("y",dummyT); |
|
324 |
open NBE_Eval |
|
325 |
in |
|
326 |
test (nbe(Cadd $ C0)) (AbsN (1, B 1)); |
|
327 |
test (nbe(Cadd $ C0 $ C0)) (C "0"); |
|
328 |
test (nbe(Cadd $ (CS $ (CS $ (CS $ Fx))) $ (CS $ (CS $ (CS $ Fy))))) |
|
329 |
(A (C "S", A (C "S", A (C "S", A (A (C "add", V "x"), A (C "S", A (C "S", A (C "S", V "y"))))))) |
|
330 |
) |
|
331 |
end; |
|
332 |
||
333 |
||
334 |
||
19147 | 335 |
use_show(NBE_Codegen.generate (the_context()) ("mul",CodegenThingol.Fun( |
19116 | 336 |
[ |
337 |
([CodegenThingol.IConst(("0",dummyIT),[])], |
|
338 |
CodegenThingol.IAbs(CodegenThingol.IVarE("n",dummyIT), |
|
339 |
CodegenThingol.IConst(("0",dummyIT),[]))), |
|
340 |
([CodegenThingol.IApp( |
|
341 |
CodegenThingol.IConst(("S",dummyIT),[]), |
|
342 |
CodegenThingol.IVarE("n",dummyIT))], |
|
343 |
CodegenThingol.IAbs(CodegenThingol.IVarE("m",dummyIT), |
|
344 |
CodegenThingol.IApp( |
|
345 |
CodegenThingol.IApp( |
|
346 |
CodegenThingol.IConst(("add",dummyIT),[]), |
|
347 |
CodegenThingol.IVarE("m",dummyIT)), |
|
348 |
CodegenThingol.IApp( |
|
349 |
CodegenThingol.IApp( |
|
350 |
CodegenThingol.IConst(("mul",dummyIT),[]), |
|
351 |
CodegenThingol.IVarE("n",dummyIT)), |
|
352 |
CodegenThingol.IVarE("m",dummyIT)))))] |
|
353 |
,([],dummyIT)))); |
|
354 |
||
355 |
||
356 |
let |
|
357 |
fun test a b = if a=b then () else error "oops!"; |
|
358 |
||
359 |
val C0 = Const("0",dummyT); |
|
360 |
val CS = Const("S",dummyT); |
|
361 |
val Cmul = Const("mul",dummyT); |
|
362 |
val Fx = Free("x",dummyT); |
|
363 |
val Fy = Free("y",dummyT); |
|
364 |
open NBE_Eval |
|
365 |
in |
|
366 |
test (nbe(Cmul $ C0)) (AbsN (1, C "0")); |
|
367 |
test (nbe(Cmul $ C0 $ Fx)) (C "0"); |
|
368 |
test (nbe(Cmul $ (CS $ (CS $ (CS $ C0))))) |
|
369 |
(AbsN (1, A (A (C "add", B 1), A (A (C "add", B 1), A (A (C "add", B 1), C "0"))))); |
|
370 |
test (nbe(Cmul $ (CS $ (CS $ (CS $ Fx))))) |
|
371 |
(AbsN (1, A (A (C "add", B 1), A (A (C "add", B 1), |
|
372 |
A (A (C "add", B 1), A (A (C "mul", V "x"), B 1)))))); |
|
373 |
test (nbe(Cmul $ (CS $ (CS $ Fx)) $ (CS $ (CS $ (CS $ Fy))))) |
|
374 |
(A (C "S", A(C "S",A(C "S",A(A (C "add", V "y"),A(C "S",A(C "S",A(C "S",A |
|
375 |
(A (C "add", V "y"),A(A (C "mul", V "x"),A(C "S",A(C "S",A(C "S", V"y"))))))))))))); |
|
376 |
() |
|
377 |
end; |
|
19118 | 378 |
*) |