author  haftmann 
Thu, 07 May 2009 16:22:35 +0200  
changeset 31064  ce37d8f48a9f 
parent 31049  396d4d6a1594 
child 31156  90fed3d4430f 
permissions  rwrr 
24590  1 
(* Title: Tools/nbe.ML 
24155  2 
Authors: Klaus Aehlig, LMU Muenchen; Tobias Nipkow, Florian Haftmann, TU Muenchen 
3 

24839  4 
Normalization by evaluation, based on generic code generator. 
24155  5 
*) 
6 

7 
signature NBE = 

8 
sig 

25101  9 
val norm_conv: cterm > thm 
30970
3fe2e418a071
generic postprocessing scheme for term evaluations
haftmann
parents:
30947
diff
changeset

10 
val norm: theory > term > term 
25101  11 

25204  12 
datatype Univ = 
26064  13 
Const of int * Univ list (*named (uninterpreted) constants*) 
25924  14 
 DFree of string * int (*free (uninterpreted) dictionary parameters*) 
24155  15 
 BVar of int * Univ list 
28350  16 
 Abs of (int * (Univ list > Univ)) * Univ list 
25924  17 
val apps: Univ > Univ list > Univ (*explicit applications*) 
25944  18 
val abss: int > (Univ list > Univ) > Univ 
28337  19 
(*abstractions as closures*) 
28350  20 
val same: Univ > Univ > bool 
24155  21 

25204  22 
val univs_ref: (unit > Univ list > Univ list) option ref 
24155  23 
val trace: bool ref 
25924  24 

26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset

25 
val setup: theory > theory 
24155  26 
end; 
27 

28 
structure Nbe: NBE = 

29 
struct 

30 

31 
(* generic nonsense *) 

32 

33 
val trace = ref false; 

34 
fun tracing f x = if !trace then (Output.tracing (f x); x) else x; 

35 

36 

37 
(** the semantical universe **) 

38 

39 
(* 

40 
Functions are given by their semantical function value. To avoid 

41 
trouble with the MLtype system, these functions have the most 

42 
generic type, that is "Univ list > Univ". The calling convention is 

43 
that the arguments come as a list, the last argument first. In 

44 
other words, a function call that usually would look like 

45 

46 
f x_1 x_2 ... x_n or f(x_1,x_2, ..., x_n) 

47 

48 
would be in our convention called as 

49 

50 
f [x_n,..,x_2,x_1] 

51 

52 
Moreover, to handle functions that are still waiting for some 

53 
arguments we have additionally a list of arguments collected to far 

54 
and the number of arguments we're still waiting for. 

55 
*) 

56 

25204  57 
datatype Univ = 
26064  58 
Const of int * Univ list (*named (uninterpreted) constants*) 
25924  59 
 DFree of string * int (*free (uninterpreted) dictionary parameters*) 
27499  60 
 BVar of int * Univ list (*bound variables, named*) 
24155  61 
 Abs of (int * (Univ list > Univ)) * Univ list 
27499  62 
(*abstractions as closures*); 
24155  63 

28350  64 
fun same (Const (k, xs)) (Const (l, ys)) = k = l andalso sames xs ys 
65 
 same (DFree (s, k)) (DFree (t, l)) = s = t andalso k = l 

66 
 same (BVar (k, xs)) (BVar (l, ys)) = k = l andalso sames xs ys 

67 
 same _ _ = false 

68 
and sames xs ys = length xs = length ys andalso forall (uncurry same) (xs ~~ ys); 

69 

24155  70 
(* constructor functions *) 
71 

25944  72 
fun abss n f = Abs ((n, f), []); 
25924  73 
fun apps (Abs ((n, f), xs)) ys = let val k = n  length ys in 
27499  74 
case int_ord (k, 0) 
75 
of EQUAL => f (ys @ xs) 

76 
 LESS => let val (zs, ws) = chop (~ k) ys in apps (f (ws @ xs)) zs end 

77 
 GREATER => Abs ((k, f), ys @ xs) (*note: reverse convention also for apps!*) 

78 
end 

25924  79 
 apps (Const (name, xs)) ys = Const (name, ys @ xs) 
27499  80 
 apps (BVar (n, xs)) ys = BVar (n, ys @ xs); 
24155  81 

82 

83 
(** assembling and compiling ML code from terms **) 

84 

85 
(* abstract ML syntax *) 

86 

87 
infix 9 `$` `$$`; 

88 
fun e1 `$` e2 = "(" ^ e1 ^ " " ^ e2 ^ ")"; 

25101  89 
fun e `$$` [] = e 
90 
 e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")"; 

24590  91 
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")"; 
24155  92 

93 
fun ml_cases t cs = 

94 
"(case " ^ t ^ " of " ^ space_implode "  " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")"; 

25944  95 
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end"; 
28337  96 
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")"; 
24155  97 

28350  98 
fun ml_and [] = "true" 
99 
 ml_and [x] = x 

100 
 ml_and xs = "(" ^ space_implode " andalso " xs ^ ")"; 

101 
fun ml_if b x y = "(if " ^ b ^ " then " ^ x ^ " else " ^ y ^ ")"; 

102 

24155  103 
fun ml_list es = "[" ^ commas es ^ "]"; 
104 

105 
fun ml_fundefs ([(name, [([], e)])]) = 

106 
"val " ^ name ^ " = " ^ e ^ "\n" 

107 
 ml_fundefs (eqs :: eqss) = 

108 
let 

109 
fun fundef (name, eqs) = 

110 
let 

111 
fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e 

112 
in space_implode "\n  " (map eqn eqs) end; 

113 
in 

114 
(prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss 

26931  115 
> cat_lines 
24155  116 
> suffix "\n" 
117 
end; 

118 

25944  119 
(* nbe specific syntax and sandbox communication *) 
120 

121 
val univs_ref = ref (NONE : (unit > Univ list > Univ list) option); 

24155  122 

123 
local 

28350  124 
val prefix = "Nbe."; 
125 
val name_ref = prefix ^ "univs_ref"; 

126 
val name_const = prefix ^ "Const"; 

127 
val name_abss = prefix ^ "abss"; 

128 
val name_apps = prefix ^ "apps"; 

129 
val name_same = prefix ^ "same"; 

24155  130 
in 
131 

25944  132 
val univs_cookie = (name_ref, univs_ref); 
133 

28337  134 
fun nbe_fun 0 "" = "nbe_value" 
135 
 nbe_fun i c = "c_" ^ translate_string (fn "." => "_"  c => c) c ^ "_" ^ string_of_int i; 

25101  136 
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n; 
24155  137 
fun nbe_bound v = "v_" ^ v; 
28337  138 
fun nbe_default v = "w_" ^ v; 
24155  139 

25924  140 
(*note: these three are the "turning spots" where proper argument order is established!*) 
141 
fun nbe_apps t [] = t 

142 
 nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)]; 

28337  143 
fun nbe_apps_local i c ts = nbe_fun i c `$` ml_list (rev ts); 
144 
fun nbe_apps_constr idx_of c ts = 

145 
let 

146 
val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)" 

147 
else string_of_int (idx_of c); 

148 
in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end; 

25924  149 

24155  150 
fun nbe_abss 0 f = f `$` ml_list [] 
25944  151 
 nbe_abss n f = name_abss `$$` [string_of_int n, f]; 
24155  152 

28350  153 
fun nbe_same v1 v2 = "(" ^ name_same ^ " " ^ nbe_bound v1 ^ " " ^ nbe_bound v2 ^ ")"; 
154 

24155  155 
end; 
156 

28054  157 
open Basic_Code_Thingol; 
24155  158 

25865  159 
(* code generation *) 
24155  160 

26064  161 
fun assemble_eqnss idx_of deps eqnss = 
25944  162 
let 
163 
fun prep_eqns (c, (vs, eqns)) = 

25924  164 
let 
25944  165 
val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs; 
28337  166 
val num_args = length dicts + ((length o fst o hd) eqns); 
25944  167 
in (c, (num_args, (dicts, eqns))) end; 
168 
val eqnss' = map prep_eqns eqnss; 

169 

170 
fun assemble_constapp c dss ts = 

171 
let 

172 
val ts' = (maps o map) assemble_idict dss @ ts; 

173 
in case AList.lookup (op =) eqnss' c 

28337  174 
of SOME (num_args, _) => if num_args <= length ts' 
175 
then let val (ts1, ts2) = chop num_args ts' 

176 
in nbe_apps (nbe_apps_local 0 c ts1) ts2 

177 
end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts' 

25944  178 
 NONE => if member (op =) deps c 
28337  179 
then nbe_apps (nbe_fun 0 c) ts' 
180 
else nbe_apps_constr idx_of c ts' 

25924  181 
end 
25944  182 
and assemble_idict (DictConst (inst, dss)) = 
183 
assemble_constapp inst dss [] 

184 
 assemble_idict (DictVar (supers, (v, (n, _)))) = 

185 
fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n); 

25924  186 

28350  187 
fun assemble_iterm constapp = 
24155  188 
let 
28350  189 
fun of_iterm match_cont t = 
25944  190 
let 
28054  191 
val (t', ts) = Code_Thingol.unfold_app t 
28350  192 
in of_iapp match_cont t' (fold_rev (cons o of_iterm NONE) ts []) end 
31049  193 
and of_iapp match_cont (IConst (c, ((_, dss), _))) ts = constapp c dss ts 
28350  194 
 of_iapp match_cont (IVar v) ts = nbe_apps (nbe_bound v) ts 
195 
 of_iapp match_cont ((v, _) `> t) ts = 

196 
nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm NONE t))) ts 

197 
 of_iapp match_cont (ICase (((t, _), cs), t0)) ts = 

198 
nbe_apps (ml_cases (of_iterm NONE t) 

199 
(map (fn (p, t) => (of_iterm NONE p, of_iterm match_cont t)) cs 

200 
@ [("_", case match_cont of SOME s => s  NONE => of_iterm NONE t0)])) ts 

25944  201 
in of_iterm end; 
24155  202 

28350  203 
fun subst_nonlin_vars args = 
204 
let 

205 
val vs = (fold o Code_Thingol.fold_varnames) 

206 
(fn v => AList.map_default (op =) (v, 0) (curry (op +) 1)) args []; 

207 
val names = Name.make_context (map fst vs); 

208 
fun declare v k ctxt = let val vs = Name.invents ctxt v k 

209 
in (vs, fold Name.declare vs ctxt) end; 

210 
val (vs_renames, _) = fold_map (fn (v, k) => if k > 1 

211 
then declare v (k  1) #>> (fn vs => (v, vs)) 

212 
else pair (v, [])) vs names; 

213 
val samepairs = maps (fn (v, vs) => map (pair v) vs) vs_renames; 

214 
fun subst_vars (t as IConst _) samepairs = (t, samepairs) 

215 
 subst_vars (t as IVar v) samepairs = (case AList.lookup (op =) samepairs v 

216 
of SOME v' => (IVar v', AList.delete (op =) v samepairs) 

217 
 NONE => (t, samepairs)) 

218 
 subst_vars (t1 `$ t2) samepairs = samepairs 

219 
> subst_vars t1 

220 
>> subst_vars t2 

221 
>> (op `$) 

222 
 subst_vars (ICase (_, t)) samepairs = subst_vars t samepairs; 

223 
val (args', _) = fold_map subst_vars args samepairs; 

224 
in (samepairs, args') end; 

225 

28337  226 
fun assemble_eqn c dicts default_args (i, (args, rhs)) = 
227 
let 

228 
val is_eval = (c = ""); 

229 
val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args); 

230 
val match_cont = if is_eval then NONE else SOME default_rhs; 

28350  231 
val assemble_arg = assemble_iterm 
232 
(fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts) NONE; 

233 
val assemble_rhs = assemble_iterm assemble_constapp match_cont ; 

234 
val (samepairs, args') = subst_nonlin_vars args; 

235 
val s_args = map assemble_arg args'; 

236 
val s_rhs = if null samepairs then assemble_rhs rhs 

237 
else ml_if (ml_and (map (uncurry nbe_same) samepairs)) 

238 
(assemble_rhs rhs) default_rhs; 

28337  239 
val eqns = if is_eval then 
28350  240 
[([ml_list (rev (dicts @ s_args))], s_rhs)] 
28337  241 
else 
28350  242 
[([ml_list (rev (dicts @ map2 ml_as default_args s_args))], s_rhs), 
28337  243 
([ml_list (rev (dicts @ default_args))], default_rhs)] 
244 
in (nbe_fun i c, eqns) end; 

245 

25944  246 
fun assemble_eqns (c, (num_args, (dicts, eqns))) = 
247 
let 

28337  248 
val default_args = map nbe_default 
249 
(Name.invent_list [] "a" (num_args  length dicts)); 

250 
val eqns' = map_index (assemble_eqn c dicts default_args) eqns 

251 
@ (if c = "" then [] else [(nbe_fun (length eqns) c, 

252 
[([ml_list (rev (dicts @ default_args))], 

253 
nbe_apps_constr idx_of c (dicts @ default_args))])]); 

254 
in (eqns', nbe_abss num_args (nbe_fun 0 c)) end; 

24155  255 

25944  256 
val (fun_vars, fun_vals) = map_split assemble_eqns eqnss'; 
28337  257 
val deps_vars = ml_list (map (nbe_fun 0) deps); 
258 
in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end; 

25944  259 

260 
(* code compilation *) 

261 

28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

262 
fun compile_eqnss _ gr raw_deps [] = [] 
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

263 
 compile_eqnss ctxt gr raw_deps eqnss = 
24155  264 
let 
26064  265 
val (deps, deps_vals) = split_list (map_filter 
266 
(fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node gr dep)))) raw_deps); 

267 
val idx_of = raw_deps 

268 
> map (fn dep => (dep, snd (Graph.get_node gr dep))) 

269 
> AList.lookup (op =) 

270 
> (fn f => the o f); 

271 
val s = assemble_eqnss idx_of deps eqnss; 

24155  272 
val cs = map fst eqnss; 
25944  273 
in 
274 
s 

275 
> tracing (fn s => "\n code to be evaluated:\n" ^ s) 

30672
beaadd5af500
more systematic type use_context, with particular values ML_Parse.global_context and ML_Context.local_context;
wenzelm
parents:
30288
diff
changeset

276 
> ML_Context.evaluate ctxt (!trace) univs_cookie 
25944  277 
> (fn f => f deps_vals) 
278 
> (fn univs => cs ~~ univs) 

279 
end; 

25190  280 

30672
beaadd5af500
more systematic type use_context, with particular values ML_Parse.global_context and ML_Context.local_context;
wenzelm
parents:
30288
diff
changeset

281 

25944  282 
(* preparing function equations *) 
24155  283 

28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

284 
fun eqns_of_stmt (_, Code_Thingol.Fun (_, (_, []))) = 
25101  285 
[] 
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

286 
 eqns_of_stmt (const, Code_Thingol.Fun (_, ((vs, _), eqns))) = 
25101  287 
[(const, (vs, map fst eqns))] 
28054  288 
 eqns_of_stmt (_, Code_Thingol.Datatypecons _) = 
25101  289 
[] 
28054  290 
 eqns_of_stmt (_, Code_Thingol.Datatype _) = 
25101  291 
[] 
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

292 
 eqns_of_stmt (class, Code_Thingol.Class (_, (v, (superclasses, classops)))) = 
25101  293 
let 
294 
val names = map snd superclasses @ map fst classops; 

295 
val params = Name.invent_list [] "d" (length names); 

296 
fun mk (k, name) = 

297 
(name, ([(v, [])], 

31049  298 
[([IConst (class, (([], []), [])) `$$ map IVar params], IVar (nth params k))])); 
25101  299 
in map_index mk names end 
28054  300 
 eqns_of_stmt (_, Code_Thingol.Classrel _) = 
25101  301 
[] 
28054  302 
 eqns_of_stmt (_, Code_Thingol.Classparam _) = 
25101  303 
[] 
28054  304 
 eqns_of_stmt (inst, Code_Thingol.Classinst ((class, (_, arities)), (superinsts, instops))) = 
31049  305 
[(inst, (arities, [([], IConst (class, (([], []), [])) `$$ 
306 
map (fn (_, (_, (inst, dicts))) => IConst (inst, (([], dicts), []))) superinsts 

25101  307 
@ map (IConst o snd o fst) instops)]))]; 
24155  308 

28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

309 
fun compile_stmts ctxt stmts_deps = 
25101  310 
let 
311 
val names = map (fst o fst) stmts_deps; 

312 
val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps; 

313 
val eqnss = maps (eqns_of_stmt o fst) stmts_deps; 

26064  314 
val refl_deps = names_deps 
25190  315 
> maps snd 
316 
> distinct (op =) 

26064  317 
> fold (insert (op =)) names; 
318 
fun new_node name (gr, (maxidx, idx_tab)) = if can (Graph.get_node gr) name 

319 
then (gr, (maxidx, idx_tab)) 

320 
else (Graph.new_node (name, (NONE, maxidx)) gr, 

321 
(maxidx + 1, Inttab.update_new (maxidx, name) idx_tab)); 

25190  322 
fun compile gr = eqnss 
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

323 
> compile_eqnss ctxt gr refl_deps 
25190  324 
> rpair gr; 
25101  325 
in 
26064  326 
fold new_node refl_deps 
327 
#> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps 

328 
#> compile 

329 
#> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ)))) 

25101  330 
end; 
24155  331 

28706  332 
fun ensure_stmts ctxt naming program = 
25101  333 
let 
26064  334 
fun add_stmts names (gr, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) gr) names 
335 
then (gr, (maxidx, idx_tab)) 

336 
else (gr, (maxidx, idx_tab)) 

28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

337 
> compile_stmts ctxt (map (fn name => ((name, Graph.get_node program name), 
27103  338 
Graph.imm_succs program name)) names); 
28706  339 
in 
340 
fold_rev add_stmts (Graph.strong_conn program) 

341 
#> pair naming 

342 
end; 

24155  343 

25944  344 

345 
(** evaluation **) 

346 

347 
(* term evaluation *) 

348 

30947  349 
fun eval_term ctxt gr deps (vs : (string * sort) list, t) = 
25924  350 
let 
351 
val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs; 

352 
in 

31064  353 
("", (vs, [([], t)])) 
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

354 
> singleton (compile_eqnss ctxt gr deps) 
25924  355 
> snd 
31064  356 
> (fn t => apps t (rev dict_frees)) 
25924  357 
end; 
24155  358 

24839  359 
(* reification *) 
24155  360 

30947  361 
fun typ_of_itype program vs (ityco `%% itys) = 
362 
let 

363 
val Code_Thingol.Datatype (tyco, _) = Graph.get_node program ityco; 

364 
in Type (tyco, map (typ_of_itype program vs) itys) end 

365 
 typ_of_itype program vs (ITyVar v) = 

366 
let 

367 
val sort = (the o AList.lookup (op =) vs) v; 

368 
in TFree ("'" ^ v, sort) end; 

369 

28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

370 
fun term_of_univ thy program idx_tab t = 
24155  371 
let 
25101  372 
fun take_until f [] = [] 
373 
 take_until f (x::xs) = if f x then [] else x :: take_until f xs; 

28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

374 
fun is_dict (Const (idx, _)) = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

375 
of Code_Thingol.Class _ => true 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

376 
 Code_Thingol.Classrel _ => true 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

377 
 Code_Thingol.Classinst _ => true 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

378 
 _ => false) 
25101  379 
 is_dict (DFree _) = true 
380 
 is_dict _ = false; 

28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

381 
fun const_of_idx idx = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

382 
of Code_Thingol.Fun (c, _) => c 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

383 
 Code_Thingol.Datatypecons (c, _) => c 
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

384 
 Code_Thingol.Classparam (c, _) => c); 
24155  385 
fun of_apps bounds (t, ts) = 
386 
fold_map (of_univ bounds) ts 

387 
#>> (fn ts' => list_comb (t, rev ts')) 

26064  388 
and of_univ bounds (Const (idx, ts)) typidx = 
24155  389 
let 
25101  390 
val ts' = take_until is_dict ts; 
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

391 
val c = const_of_idx idx; 
28423  392 
val (_, T) = Code.default_typscheme thy c; 
30022
1d8b8fa19074
maintain order of constructors in datatypes; clarified conventions for type schemes
haftmann
parents:
29272
diff
changeset

393 
val T' = map_type_tfree (fn (v, _) => TypeInfer.param typidx (v, [])) T; 
1d8b8fa19074
maintain order of constructors in datatypes; clarified conventions for type schemes
haftmann
parents:
29272
diff
changeset

394 
val typidx' = typidx + 1; 
25101  395 
in of_apps bounds (Term.Const (c, T'), ts') typidx' end 
27499  396 
 of_univ bounds (BVar (n, ts)) typidx = 
397 
of_apps bounds (Bound (bounds  n  1), ts) typidx 

24155  398 
 of_univ bounds (t as Abs _) typidx = 
399 
typidx 

25924  400 
> of_univ (bounds + 1) (apps t [BVar (bounds, [])]) 
24155  401 
> (fn t' => pair (Term.Abs ("u", dummyT, t'))) 
402 
in of_univ 0 t 0 > fst end; 

403 

25101  404 
(* function store *) 
405 

406 
structure Nbe_Functions = CodeDataFun 

407 
( 

28706  408 
type T = Code_Thingol.naming * ((Univ option * int) Graph.T * (int * string Inttab.table)); 
409 
val empty = (Code_Thingol.empty_naming, (Graph.empty, (0, Inttab.empty))); 

410 
fun purge thy cs (naming, (gr, (maxidx, idx_tab))) = 

27609  411 
let 
28706  412 
val names_delete = cs 
413 
> map_filter (Code_Thingol.lookup_const naming) 

414 
> filter (can (Graph.get_node gr)) 

415 
> Graph.all_preds gr; 

416 
val gr' = Graph.del_nodes names_delete gr; 

417 
in (naming, (gr', (maxidx, idx_tab))) end; 

25101  418 
); 
419 

420 
(* compilation, evaluation and reification *) 

421 

30947  422 
fun compile_eval thy naming program vs_t deps = 
26064  423 
let 
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

424 
val ctxt = ProofContext.init thy; 
28706  425 
val (_, (gr, (_, idx_tab))) = 
426 
Nbe_Functions.change thy (ensure_stmts ctxt naming program o snd); 

26064  427 
in 
30947  428 
vs_t 
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset

429 
> eval_term ctxt gr deps 
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset

430 
> term_of_univ thy program idx_tab 
26064  431 
end; 
25101  432 

24155  433 
(* evaluation with type reconstruction *) 
434 

31064  435 
fun normalize thy naming program ((vs0, (vs, ty)), t) deps = 
24155  436 
let 
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset

437 
fun subst_const f = map_aterms (fn t as Term.Const (c, ty) => Term.Const (f c, ty) 
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset

438 
 t => t); 
30947  439 
val resubst_triv_consts = subst_const (Code_Unit.resubst_alias thy); 
440 
val ty' = typ_of_itype program vs0 ty; 

27264  441 
fun type_infer t = 
442 
singleton (TypeInfer.infer_types (Syntax.pp_global thy) (Sign.tsig_of thy) I 

443 
(try (Type.strip_sorts o Sign.the_const_type thy)) (K NONE) Name.context 0) 

30947  444 
(TypeInfer.constrain ty' t); 
29272  445 
fun check_tvars t = if null (Term.add_tvars t []) then t else 
24155  446 
error ("Illegal schematic type variables in normalized term: " 
26952
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset

447 
^ setmp show_types true (Syntax.string_of_term_global thy) t); 
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset

448 
val string_of_term = setmp show_types true (Syntax.string_of_term_global thy); 
24155  449 
in 
30947  450 
compile_eval thy naming program (vs, t) deps 
25167  451 
> tracing (fn t => "Normalized:\n" ^ string_of_term t) 
30947  452 
> resubst_triv_consts 
26739  453 
> type_infer 
25167  454 
> tracing (fn t => "Types inferred:\n" ^ string_of_term t) 
26739  455 
> check_tvars 
25101  456 
> tracing (fn t => "\n") 
24155  457 
end; 
458 

459 
(* evaluation oracle *) 

460 

30947  461 
fun add_triv_classes thy = curry (Sorts.inter_sort (Sign.classes_of thy)) 
462 
(Code_Unit.triv_classes thy); 

463 

464 
fun mk_equals thy lhs raw_rhs = 

26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset

465 
let 
30947  466 
val ty = Thm.typ_of (Thm.ctyp_of_term lhs); 
467 
val eq = Thm.cterm_of thy (Term.Const ("==", ty > ty > propT)); 

468 
val rhs = Thm.cterm_of thy raw_rhs; 

469 
in Thm.mk_binop eq lhs rhs end; 

26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset

470 

30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30672
diff
changeset

471 
val (_, raw_norm_oracle) = Context.>>> (Context.map_theory_result 
31064  472 
(Thm.add_oracle (Binding.name "norm", fn (thy, naming, program, vsp_ty_t, deps, ct) => 
473 
mk_equals thy ct (normalize thy naming program vsp_ty_t deps)))); 

474 

475 
fun norm_oracle thy naming program vsp_ty_t deps ct = 

476 
raw_norm_oracle (thy, naming, program, vsp_ty_t, deps, ct); 

30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30672
diff
changeset

477 

31064  478 
fun no_frees_conv conv ct = 
479 
let 

480 
val frees = Thm.add_cterm_frees ct []; 

481 
fun apply_beta free thm = Thm.combination thm (Thm.reflexive free) 

482 
> Conv.fconv_rule (Conv.arg_conv (Conv.try_conv (Thm.beta_conversion false))) 

483 
> Conv.fconv_rule (Conv.arg1_conv (Thm.beta_conversion false)); 

484 
in 

485 
ct 

486 
> fold_rev Thm.cabs frees 

487 
> conv 

488 
> fold apply_beta frees 

489 
end; 

30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30672
diff
changeset

490 

31064  491 
fun no_frees_rew rew t = 
492 
let 

493 
val frees = map Free (Term.add_frees t []); 

494 
in 

495 
t 

496 
> fold_rev lambda frees 

497 
> rew 

498 
> (fn t' => Term.betapplys (t', frees)) 

499 
end; 

500 

501 
val norm_conv = no_frees_conv (fn ct => 

24155  502 
let 
503 
val thy = Thm.theory_of_cterm ct; 

31064  504 
in Code_Thingol.eval_conv thy (add_triv_classes thy) (norm_oracle thy) ct end); 
24155  505 

31064  506 
fun norm thy = no_frees_rew (Code_Thingol.eval thy (add_triv_classes thy) I (normalize thy)); 
24839  507 

24155  508 
(* evaluation command *) 
509 

510 
fun norm_print_term ctxt modes t = 

511 
let 

512 
val thy = ProofContext.theory_of ctxt; 

30970
3fe2e418a071
generic postprocessing scheme for term evaluations
haftmann
parents:
30947
diff
changeset

513 
val t' = norm thy t; 
24839  514 
val ty' = Term.type_of t'; 
26952
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset

515 
val ctxt' = Variable.auto_fixes t ctxt; 
24634  516 
val p = PrintMode.with_modes modes (fn () => 
26952
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset

517 
Pretty.block [Pretty.quote (Syntax.pretty_term ctxt' t'), Pretty.fbrk, 
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset

518 
Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) (); 
24155  519 
in Pretty.writeln p end; 
520 

521 

522 
(** Isar setup **) 

523 

24508
c8b82fec6447
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24493
diff
changeset

524 
fun norm_print_term_cmd (modes, s) state = 
24155  525 
let val ctxt = Toplevel.context_of state 
24508
c8b82fec6447
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24493
diff
changeset

526 
in norm_print_term ctxt modes (Syntax.read_term ctxt s) end; 
24155  527 

30970
3fe2e418a071
generic postprocessing scheme for term evaluations
haftmann
parents:
30947
diff
changeset

528 
val setup = Value.add_evaluator ("nbe", norm o ProofContext.theory_of); 
24155  529 

530 
local structure P = OuterParse and K = OuterKeyword in 

531 

532 
val opt_modes = Scan.optional (P.$$$ "("  P.!!! (Scan.repeat1 P.xname  P.$$$ ")")) []; 

533 

24867  534 
val _ = 
24155  535 
OuterSyntax.improper_command "normal_form" "normalize term by evaluation" K.diag 
28227  536 
(opt_modes  P.term >> (Toplevel.keep o norm_print_term_cmd)); 
24155  537 

538 
end; 

539 

540 
end; 

28337  541 