author | wenzelm |
Tue, 29 Sep 2009 16:24:36 +0200 | |
changeset 32740 | 9dd0a2f83429 |
parent 32544 | e129333b9df0 |
child 32966 | 5b21661fe618 |
permissions | -rw-r--r-- |
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 |
|
32740 | 22 |
val univs_ref: (unit -> Univ list -> Univ list) option Unsynchronized.ref |
23 |
val trace: bool Unsynchronized.ref |
|
25924 | 24 |
|
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset
|
25 |
val setup: theory -> theory |
32544 | 26 |
val add_const_alias: thm -> theory -> theory |
24155 | 27 |
end; |
28 |
||
29 |
structure Nbe: NBE = |
|
30 |
struct |
|
31 |
||
32 |
(* generic non-sense *) |
|
33 |
||
32740 | 34 |
val trace = Unsynchronized.ref false; |
32544 | 35 |
fun traced f x = if !trace then (tracing (f x); x) else x; |
24155 | 36 |
|
37 |
||
32544 | 38 |
(** certificates and oracle for "trivial type classes" **) |
39 |
||
40 |
structure Triv_Class_Data = TheoryDataFun |
|
41 |
( |
|
42 |
type T = (class * thm) list; |
|
43 |
val empty = []; |
|
44 |
val copy = I; |
|
45 |
val extend = I; |
|
46 |
fun merge pp = AList.merge (op =) (K true); |
|
47 |
); |
|
48 |
||
49 |
fun add_const_alias thm thy = |
|
50 |
let |
|
51 |
val (ofclass, eqn) = case try Logic.dest_equals (Thm.prop_of thm) |
|
52 |
of SOME ofclass_eq => ofclass_eq |
|
53 |
| _ => error ("Bad certificate: " ^ Display.string_of_thm_global thy thm); |
|
54 |
val (T, class) = case try Logic.dest_of_class ofclass |
|
55 |
of SOME T_class => T_class |
|
56 |
| _ => error ("Bad certificate: " ^ Display.string_of_thm_global thy thm); |
|
57 |
val tvar = case try Term.dest_TVar T |
|
58 |
of SOME (tvar as (_, sort)) => if null (filter (can (AxClass.get_info thy)) sort) |
|
59 |
then tvar |
|
60 |
else error ("Bad sort: " ^ Display.string_of_thm_global thy thm) |
|
61 |
| _ => error ("Bad type: " ^ Display.string_of_thm_global thy thm); |
|
62 |
val _ = if Term.add_tvars eqn [] = [tvar] then () |
|
63 |
else error ("Inconsistent type: " ^ Display.string_of_thm_global thy thm); |
|
64 |
val lhs_rhs = case try Logic.dest_equals eqn |
|
65 |
of SOME lhs_rhs => lhs_rhs |
|
66 |
| _ => error ("Not an equation: " ^ Syntax.string_of_term_global thy eqn); |
|
67 |
val c_c' = case try (pairself (Code.check_const thy)) lhs_rhs |
|
68 |
of SOME c_c' => c_c' |
|
69 |
| _ => error ("Not an equation with two constants: " |
|
70 |
^ Syntax.string_of_term_global thy eqn); |
|
71 |
val _ = if the_list (AxClass.class_of_param thy (snd c_c')) = [class] then () |
|
72 |
else error ("Inconsistent class: " ^ Display.string_of_thm_global thy thm); |
|
73 |
in Triv_Class_Data.map (AList.update (op =) (class, thm)) thy end; |
|
74 |
||
75 |
local |
|
76 |
||
77 |
val get_triv_classes = map fst o Triv_Class_Data.get; |
|
78 |
||
79 |
val (_, triv_of_class) = Context.>>> (Context.map_theory_result |
|
80 |
(Thm.add_oracle (Binding.name "triv_of_class", fn (thy, (v, T), class) => |
|
81 |
Thm.cterm_of thy (Logic.mk_of_class (T, class))))); |
|
82 |
||
83 |
in |
|
84 |
||
85 |
fun lift_triv_classes_conv thy conv ct = |
|
86 |
let |
|
87 |
val algebra = Sign.classes_of thy; |
|
88 |
val triv_classes = get_triv_classes thy; |
|
89 |
val certT = Thm.ctyp_of thy; |
|
90 |
fun critical_classes sort = filter_out (fn class => Sign.subsort thy (sort, [class])) triv_classes; |
|
91 |
val vs = Term.add_tfrees (Thm.term_of ct) [] |
|
92 |
|> map_filter (fn (v, sort) => case critical_classes sort |
|
93 |
of [] => NONE |
|
94 |
| classes => SOME (v, ((sort, classes), Sorts.inter_sort algebra (triv_classes, sort)))); |
|
95 |
val of_classes = maps (fn (v, ((sort, classes), _)) => map (fn class => |
|
96 |
((v, class), triv_of_class (thy, (v, TVar ((v, 0), sort)), class))) classes |
|
97 |
@ map (fn class => ((v, class), Thm.of_class (certT (TVar ((v, 0), sort)), class))) |
|
98 |
sort) vs; |
|
99 |
fun strip_of_class thm = |
|
100 |
let |
|
101 |
val prem_props = (Logic.strip_imp_prems o Thm.prop_of) thm; |
|
102 |
val prem_thms = map (the o AList.lookup (op =) of_classes |
|
103 |
o apfst (fst o fst o dest_TVar) o Logic.dest_of_class) prem_props; |
|
104 |
in Drule.implies_elim_list thm prem_thms end; |
|
105 |
in ct |
|
106 |
|> Drule.cterm_rule Thm.varifyT |
|
107 |
|> Thm.instantiate_cterm (Thm.certify_inst thy (map (fn (v, ((sort, _), sort')) => |
|
108 |
(((v, 0), sort), TFree (v, sort'))) vs, [])) |
|
109 |
|> Drule.cterm_rule Thm.freezeT |
|
110 |
|> conv |
|
111 |
|> Thm.varifyT |
|
112 |
|> fold (fn (v, (_, sort')) => Thm.unconstrainT (certT (TVar ((v, 0), sort')))) vs |
|
113 |
|> Thm.certify_instantiate (map (fn (v, ((sort, _), _)) => |
|
114 |
(((v, 0), []), TVar ((v, 0), sort))) vs, []) |
|
115 |
|> strip_of_class |
|
116 |
|> Thm.freezeT |
|
117 |
end; |
|
118 |
||
119 |
fun lift_triv_classes_rew thy rew t = |
|
120 |
let |
|
121 |
val algebra = Sign.classes_of thy; |
|
122 |
val triv_classes = get_triv_classes thy; |
|
123 |
val vs = Term.add_tfrees t []; |
|
124 |
in t |
|
125 |
|> (map_types o map_type_tfree) |
|
126 |
(fn (v, sort) => TFree (v, Sorts.inter_sort algebra (sort, triv_classes))) |
|
127 |
|> rew |
|
128 |
|> (map_types o map_type_tfree) |
|
129 |
(fn (v, _) => TFree (v, the (AList.lookup (op =) vs v))) |
|
130 |
end; |
|
131 |
||
132 |
end; |
|
133 |
||
134 |
||
135 |
(** the semantic universe **) |
|
24155 | 136 |
|
137 |
(* |
|
138 |
Functions are given by their semantical function value. To avoid |
|
139 |
trouble with the ML-type system, these functions have the most |
|
140 |
generic type, that is "Univ list -> Univ". The calling convention is |
|
141 |
that the arguments come as a list, the last argument first. In |
|
142 |
other words, a function call that usually would look like |
|
143 |
||
144 |
f x_1 x_2 ... x_n or f(x_1,x_2, ..., x_n) |
|
145 |
||
146 |
would be in our convention called as |
|
147 |
||
148 |
f [x_n,..,x_2,x_1] |
|
149 |
||
150 |
Moreover, to handle functions that are still waiting for some |
|
151 |
arguments we have additionally a list of arguments collected to far |
|
152 |
and the number of arguments we're still waiting for. |
|
153 |
*) |
|
154 |
||
25204 | 155 |
datatype Univ = |
26064 | 156 |
Const of int * Univ list (*named (uninterpreted) constants*) |
25924 | 157 |
| DFree of string * int (*free (uninterpreted) dictionary parameters*) |
27499 | 158 |
| BVar of int * Univ list (*bound variables, named*) |
24155 | 159 |
| Abs of (int * (Univ list -> Univ)) * Univ list |
27499 | 160 |
(*abstractions as closures*); |
24155 | 161 |
|
28350 | 162 |
fun same (Const (k, xs)) (Const (l, ys)) = k = l andalso sames xs ys |
163 |
| same (DFree (s, k)) (DFree (t, l)) = s = t andalso k = l |
|
164 |
| same (BVar (k, xs)) (BVar (l, ys)) = k = l andalso sames xs ys |
|
165 |
| same _ _ = false |
|
166 |
and sames xs ys = length xs = length ys andalso forall (uncurry same) (xs ~~ ys); |
|
167 |
||
24155 | 168 |
(* constructor functions *) |
169 |
||
25944 | 170 |
fun abss n f = Abs ((n, f), []); |
25924 | 171 |
fun apps (Abs ((n, f), xs)) ys = let val k = n - length ys in |
27499 | 172 |
case int_ord (k, 0) |
173 |
of EQUAL => f (ys @ xs) |
|
174 |
| LESS => let val (zs, ws) = chop (~ k) ys in apps (f (ws @ xs)) zs end |
|
175 |
| GREATER => Abs ((k, f), ys @ xs) (*note: reverse convention also for apps!*) |
|
176 |
end |
|
25924 | 177 |
| apps (Const (name, xs)) ys = Const (name, ys @ xs) |
27499 | 178 |
| apps (BVar (n, xs)) ys = BVar (n, ys @ xs); |
24155 | 179 |
|
180 |
||
181 |
(** assembling and compiling ML code from terms **) |
|
182 |
||
183 |
(* abstract ML syntax *) |
|
184 |
||
185 |
infix 9 `$` `$$`; |
|
186 |
fun e1 `$` e2 = "(" ^ e1 ^ " " ^ e2 ^ ")"; |
|
25101 | 187 |
fun e `$$` [] = e |
188 |
| e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")"; |
|
24590 | 189 |
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")"; |
24155 | 190 |
|
191 |
fun ml_cases t cs = |
|
192 |
"(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")"; |
|
25944 | 193 |
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end"; |
28337 | 194 |
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")"; |
24155 | 195 |
|
28350 | 196 |
fun ml_and [] = "true" |
197 |
| ml_and [x] = x |
|
198 |
| ml_and xs = "(" ^ space_implode " andalso " xs ^ ")"; |
|
199 |
fun ml_if b x y = "(if " ^ b ^ " then " ^ x ^ " else " ^ y ^ ")"; |
|
200 |
||
24155 | 201 |
fun ml_list es = "[" ^ commas es ^ "]"; |
202 |
||
203 |
fun ml_fundefs ([(name, [([], e)])]) = |
|
204 |
"val " ^ name ^ " = " ^ e ^ "\n" |
|
205 |
| ml_fundefs (eqs :: eqss) = |
|
206 |
let |
|
207 |
fun fundef (name, eqs) = |
|
208 |
let |
|
209 |
fun eqn (es, e) = name ^ " " ^ space_implode " " es ^ " = " ^ e |
|
210 |
in space_implode "\n | " (map eqn eqs) end; |
|
211 |
in |
|
212 |
(prefix "fun " o fundef) eqs :: map (prefix "and " o fundef) eqss |
|
26931 | 213 |
|> cat_lines |
24155 | 214 |
|> suffix "\n" |
215 |
end; |
|
216 |
||
25944 | 217 |
(* nbe specific syntax and sandbox communication *) |
218 |
||
32740 | 219 |
val univs_ref = Unsynchronized.ref (NONE : (unit -> Univ list -> Univ list) option); |
24155 | 220 |
|
221 |
local |
|
28350 | 222 |
val prefix = "Nbe."; |
223 |
val name_ref = prefix ^ "univs_ref"; |
|
224 |
val name_const = prefix ^ "Const"; |
|
225 |
val name_abss = prefix ^ "abss"; |
|
226 |
val name_apps = prefix ^ "apps"; |
|
227 |
val name_same = prefix ^ "same"; |
|
24155 | 228 |
in |
229 |
||
25944 | 230 |
val univs_cookie = (name_ref, univs_ref); |
231 |
||
28337 | 232 |
fun nbe_fun 0 "" = "nbe_value" |
233 |
| nbe_fun i c = "c_" ^ translate_string (fn "." => "_" | c => c) c ^ "_" ^ string_of_int i; |
|
25101 | 234 |
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n; |
24155 | 235 |
fun nbe_bound v = "v_" ^ v; |
31888 | 236 |
fun nbe_bound_optional NONE = "_" |
237 |
| nbe_bound_optional (SOME v) = nbe_bound v; |
|
28337 | 238 |
fun nbe_default v = "w_" ^ v; |
24155 | 239 |
|
25924 | 240 |
(*note: these three are the "turning spots" where proper argument order is established!*) |
241 |
fun nbe_apps t [] = t |
|
242 |
| nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)]; |
|
28337 | 243 |
fun nbe_apps_local i c ts = nbe_fun i c `$` ml_list (rev ts); |
244 |
fun nbe_apps_constr idx_of c ts = |
|
245 |
let |
|
246 |
val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)" |
|
247 |
else string_of_int (idx_of c); |
|
248 |
in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end; |
|
25924 | 249 |
|
24155 | 250 |
fun nbe_abss 0 f = f `$` ml_list [] |
25944 | 251 |
| nbe_abss n f = name_abss `$$` [string_of_int n, f]; |
24155 | 252 |
|
28350 | 253 |
fun nbe_same v1 v2 = "(" ^ name_same ^ " " ^ nbe_bound v1 ^ " " ^ nbe_bound v2 ^ ")"; |
254 |
||
24155 | 255 |
end; |
256 |
||
28054 | 257 |
open Basic_Code_Thingol; |
24155 | 258 |
|
25865 | 259 |
(* code generation *) |
24155 | 260 |
|
26064 | 261 |
fun assemble_eqnss idx_of deps eqnss = |
25944 | 262 |
let |
263 |
fun prep_eqns (c, (vs, eqns)) = |
|
25924 | 264 |
let |
25944 | 265 |
val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs; |
28337 | 266 |
val num_args = length dicts + ((length o fst o hd) eqns); |
25944 | 267 |
in (c, (num_args, (dicts, eqns))) end; |
268 |
val eqnss' = map prep_eqns eqnss; |
|
269 |
||
270 |
fun assemble_constapp c dss ts = |
|
271 |
let |
|
272 |
val ts' = (maps o map) assemble_idict dss @ ts; |
|
273 |
in case AList.lookup (op =) eqnss' c |
|
28337 | 274 |
of SOME (num_args, _) => if num_args <= length ts' |
275 |
then let val (ts1, ts2) = chop num_args ts' |
|
276 |
in nbe_apps (nbe_apps_local 0 c ts1) ts2 |
|
277 |
end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts' |
|
25944 | 278 |
| NONE => if member (op =) deps c |
28337 | 279 |
then nbe_apps (nbe_fun 0 c) ts' |
280 |
else nbe_apps_constr idx_of c ts' |
|
25924 | 281 |
end |
25944 | 282 |
and assemble_idict (DictConst (inst, dss)) = |
283 |
assemble_constapp inst dss [] |
|
284 |
| assemble_idict (DictVar (supers, (v, (n, _)))) = |
|
285 |
fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n); |
|
25924 | 286 |
|
28350 | 287 |
fun assemble_iterm constapp = |
24155 | 288 |
let |
28350 | 289 |
fun of_iterm match_cont t = |
25944 | 290 |
let |
28054 | 291 |
val (t', ts) = Code_Thingol.unfold_app t |
28350 | 292 |
in of_iapp match_cont t' (fold_rev (cons o of_iterm NONE) ts []) end |
31049 | 293 |
and of_iapp match_cont (IConst (c, ((_, dss), _))) ts = constapp c dss ts |
31889 | 294 |
| of_iapp match_cont (IVar v) ts = nbe_apps (nbe_bound_optional v) ts |
31724 | 295 |
| of_iapp match_cont ((v, _) `|=> t) ts = |
31888 | 296 |
nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound_optional v]) (of_iterm NONE t))) ts |
28350 | 297 |
| of_iapp match_cont (ICase (((t, _), cs), t0)) ts = |
298 |
nbe_apps (ml_cases (of_iterm NONE t) |
|
299 |
(map (fn (p, t) => (of_iterm NONE p, of_iterm match_cont t)) cs |
|
300 |
@ [("_", case match_cont of SOME s => s | NONE => of_iterm NONE t0)])) ts |
|
25944 | 301 |
in of_iterm end; |
24155 | 302 |
|
28350 | 303 |
fun subst_nonlin_vars args = |
304 |
let |
|
305 |
val vs = (fold o Code_Thingol.fold_varnames) |
|
306 |
(fn v => AList.map_default (op =) (v, 0) (curry (op +) 1)) args []; |
|
307 |
val names = Name.make_context (map fst vs); |
|
308 |
fun declare v k ctxt = let val vs = Name.invents ctxt v k |
|
309 |
in (vs, fold Name.declare vs ctxt) end; |
|
310 |
val (vs_renames, _) = fold_map (fn (v, k) => if k > 1 |
|
311 |
then declare v (k - 1) #>> (fn vs => (v, vs)) |
|
312 |
else pair (v, [])) vs names; |
|
313 |
val samepairs = maps (fn (v, vs) => map (pair v) vs) vs_renames; |
|
314 |
fun subst_vars (t as IConst _) samepairs = (t, samepairs) |
|
31889 | 315 |
| subst_vars (t as IVar NONE) samepairs = (t, samepairs) |
316 |
| subst_vars (t as IVar (SOME v)) samepairs = (case AList.lookup (op =) samepairs v |
|
317 |
of SOME v' => (IVar (SOME v'), AList.delete (op =) v samepairs) |
|
28350 | 318 |
| NONE => (t, samepairs)) |
319 |
| subst_vars (t1 `$ t2) samepairs = samepairs |
|
320 |
|> subst_vars t1 |
|
321 |
||>> subst_vars t2 |
|
322 |
|>> (op `$) |
|
323 |
| subst_vars (ICase (_, t)) samepairs = subst_vars t samepairs; |
|
324 |
val (args', _) = fold_map subst_vars args samepairs; |
|
325 |
in (samepairs, args') end; |
|
326 |
||
28337 | 327 |
fun assemble_eqn c dicts default_args (i, (args, rhs)) = |
328 |
let |
|
329 |
val is_eval = (c = ""); |
|
330 |
val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args); |
|
331 |
val match_cont = if is_eval then NONE else SOME default_rhs; |
|
28350 | 332 |
val assemble_arg = assemble_iterm |
333 |
(fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts) NONE; |
|
334 |
val assemble_rhs = assemble_iterm assemble_constapp match_cont ; |
|
335 |
val (samepairs, args') = subst_nonlin_vars args; |
|
336 |
val s_args = map assemble_arg args'; |
|
337 |
val s_rhs = if null samepairs then assemble_rhs rhs |
|
338 |
else ml_if (ml_and (map (uncurry nbe_same) samepairs)) |
|
339 |
(assemble_rhs rhs) default_rhs; |
|
28337 | 340 |
val eqns = if is_eval then |
28350 | 341 |
[([ml_list (rev (dicts @ s_args))], s_rhs)] |
28337 | 342 |
else |
28350 | 343 |
[([ml_list (rev (dicts @ map2 ml_as default_args s_args))], s_rhs), |
28337 | 344 |
([ml_list (rev (dicts @ default_args))], default_rhs)] |
345 |
in (nbe_fun i c, eqns) end; |
|
346 |
||
25944 | 347 |
fun assemble_eqns (c, (num_args, (dicts, eqns))) = |
348 |
let |
|
28337 | 349 |
val default_args = map nbe_default |
350 |
(Name.invent_list [] "a" (num_args - length dicts)); |
|
351 |
val eqns' = map_index (assemble_eqn c dicts default_args) eqns |
|
352 |
@ (if c = "" then [] else [(nbe_fun (length eqns) c, |
|
353 |
[([ml_list (rev (dicts @ default_args))], |
|
354 |
nbe_apps_constr idx_of c (dicts @ default_args))])]); |
|
355 |
in (eqns', nbe_abss num_args (nbe_fun 0 c)) end; |
|
24155 | 356 |
|
25944 | 357 |
val (fun_vars, fun_vals) = map_split assemble_eqns eqnss'; |
28337 | 358 |
val deps_vars = ml_list (map (nbe_fun 0) deps); |
359 |
in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end; |
|
25944 | 360 |
|
361 |
(* code compilation *) |
|
362 |
||
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
363 |
fun compile_eqnss _ gr raw_deps [] = [] |
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
364 |
| compile_eqnss ctxt gr raw_deps eqnss = |
24155 | 365 |
let |
26064 | 366 |
val (deps, deps_vals) = split_list (map_filter |
367 |
(fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node gr dep)))) raw_deps); |
|
368 |
val idx_of = raw_deps |
|
369 |
|> map (fn dep => (dep, snd (Graph.get_node gr dep))) |
|
370 |
|> AList.lookup (op =) |
|
371 |
|> (fn f => the o f); |
|
372 |
val s = assemble_eqnss idx_of deps eqnss; |
|
24155 | 373 |
val cs = map fst eqnss; |
25944 | 374 |
in |
375 |
s |
|
32544 | 376 |
|> traced (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
|
377 |
|> ML_Context.evaluate ctxt (!trace) univs_cookie |
25944 | 378 |
|> (fn f => f deps_vals) |
379 |
|> (fn univs => cs ~~ univs) |
|
380 |
end; |
|
25190 | 381 |
|
30672
beaadd5af500
more systematic type use_context, with particular values ML_Parse.global_context and ML_Context.local_context;
wenzelm
parents:
30288
diff
changeset
|
382 |
|
25944 | 383 |
(* preparing function equations *) |
24155 | 384 |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
385 |
fun eqns_of_stmt (_, Code_Thingol.Fun (_, (_, []))) = |
25101 | 386 |
[] |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
387 |
| eqns_of_stmt (const, Code_Thingol.Fun (_, ((vs, _), eqns))) = |
25101 | 388 |
[(const, (vs, map fst eqns))] |
28054 | 389 |
| eqns_of_stmt (_, Code_Thingol.Datatypecons _) = |
25101 | 390 |
[] |
28054 | 391 |
| eqns_of_stmt (_, Code_Thingol.Datatype _) = |
25101 | 392 |
[] |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
393 |
| eqns_of_stmt (class, Code_Thingol.Class (_, (v, (superclasses, classops)))) = |
25101 | 394 |
let |
395 |
val names = map snd superclasses @ map fst classops; |
|
396 |
val params = Name.invent_list [] "d" (length names); |
|
397 |
fun mk (k, name) = |
|
398 |
(name, ([(v, [])], |
|
31889 | 399 |
[([IConst (class, (([], []), [])) `$$ map (IVar o SOME) params], |
400 |
IVar (SOME (nth params k)))])); |
|
25101 | 401 |
in map_index mk names end |
28054 | 402 |
| eqns_of_stmt (_, Code_Thingol.Classrel _) = |
25101 | 403 |
[] |
28054 | 404 |
| eqns_of_stmt (_, Code_Thingol.Classparam _) = |
25101 | 405 |
[] |
28054 | 406 |
| eqns_of_stmt (inst, Code_Thingol.Classinst ((class, (_, arities)), (superinsts, instops))) = |
31049 | 407 |
[(inst, (arities, [([], IConst (class, (([], []), [])) `$$ |
408 |
map (fn (_, (_, (inst, dicts))) => IConst (inst, (([], dicts), []))) superinsts |
|
25101 | 409 |
@ map (IConst o snd o fst) instops)]))]; |
24155 | 410 |
|
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
411 |
fun compile_stmts ctxt stmts_deps = |
25101 | 412 |
let |
413 |
val names = map (fst o fst) stmts_deps; |
|
414 |
val names_deps = map (fn ((name, _), deps) => (name, deps)) stmts_deps; |
|
415 |
val eqnss = maps (eqns_of_stmt o fst) stmts_deps; |
|
26064 | 416 |
val refl_deps = names_deps |
25190 | 417 |
|> maps snd |
418 |
|> distinct (op =) |
|
26064 | 419 |
|> fold (insert (op =)) names; |
420 |
fun new_node name (gr, (maxidx, idx_tab)) = if can (Graph.get_node gr) name |
|
421 |
then (gr, (maxidx, idx_tab)) |
|
422 |
else (Graph.new_node (name, (NONE, maxidx)) gr, |
|
423 |
(maxidx + 1, Inttab.update_new (maxidx, name) idx_tab)); |
|
25190 | 424 |
fun compile gr = eqnss |
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
425 |
|> compile_eqnss ctxt gr refl_deps |
25190 | 426 |
|> rpair gr; |
25101 | 427 |
in |
26064 | 428 |
fold new_node refl_deps |
429 |
#> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps |
|
430 |
#> compile |
|
431 |
#-> fold (fn (name, univ) => (Graph.map_node name o apfst) (K (SOME univ)))) |
|
25101 | 432 |
end; |
24155 | 433 |
|
28706 | 434 |
fun ensure_stmts ctxt naming program = |
25101 | 435 |
let |
26064 | 436 |
fun add_stmts names (gr, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) gr) names |
437 |
then (gr, (maxidx, idx_tab)) |
|
438 |
else (gr, (maxidx, idx_tab)) |
|
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
439 |
|> compile_stmts ctxt (map (fn name => ((name, Graph.get_node program name), |
27103 | 440 |
Graph.imm_succs program name)) names); |
28706 | 441 |
in |
442 |
fold_rev add_stmts (Graph.strong_conn program) |
|
443 |
#> pair naming |
|
444 |
end; |
|
24155 | 445 |
|
25944 | 446 |
|
447 |
(** evaluation **) |
|
448 |
||
449 |
(* term evaluation *) |
|
450 |
||
30947 | 451 |
fun eval_term ctxt gr deps (vs : (string * sort) list, t) = |
25924 | 452 |
let |
453 |
val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs; |
|
454 |
in |
|
31064 | 455 |
("", (vs, [([], t)])) |
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
456 |
|> singleton (compile_eqnss ctxt gr deps) |
25924 | 457 |
|> snd |
31064 | 458 |
|> (fn t => apps t (rev dict_frees)) |
25924 | 459 |
end; |
24155 | 460 |
|
24839 | 461 |
(* reification *) |
24155 | 462 |
|
30947 | 463 |
fun typ_of_itype program vs (ityco `%% itys) = |
464 |
let |
|
465 |
val Code_Thingol.Datatype (tyco, _) = Graph.get_node program ityco; |
|
466 |
in Type (tyco, map (typ_of_itype program vs) itys) end |
|
467 |
| typ_of_itype program vs (ITyVar v) = |
|
468 |
let |
|
469 |
val sort = (the o AList.lookup (op =) vs) v; |
|
470 |
in TFree ("'" ^ v, sort) end; |
|
471 |
||
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
472 |
fun term_of_univ thy program idx_tab t = |
24155 | 473 |
let |
25101 | 474 |
fun take_until f [] = [] |
475 |
| 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
|
476 |
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
|
477 |
of Code_Thingol.Class _ => true |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
478 |
| Code_Thingol.Classrel _ => true |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
479 |
| Code_Thingol.Classinst _ => true |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
480 |
| _ => false) |
25101 | 481 |
| is_dict (DFree _) = true |
482 |
| is_dict _ = false; |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
483 |
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
|
484 |
of Code_Thingol.Fun (c, _) => c |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
485 |
| Code_Thingol.Datatypecons (c, _) => c |
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
486 |
| Code_Thingol.Classparam (c, _) => c); |
24155 | 487 |
fun of_apps bounds (t, ts) = |
488 |
fold_map (of_univ bounds) ts |
|
489 |
#>> (fn ts' => list_comb (t, rev ts')) |
|
26064 | 490 |
and of_univ bounds (Const (idx, ts)) typidx = |
24155 | 491 |
let |
25101 | 492 |
val ts' = take_until is_dict ts; |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
493 |
val c = const_of_idx idx; |
31957 | 494 |
val T = map_type_tvar (fn ((v, i), _) => |
495 |
TypeInfer.param typidx (v ^ string_of_int i, [])) |
|
496 |
(Sign.the_const_type thy c); |
|
30022
1d8b8fa19074
maintain order of constructors in datatypes; clarified conventions for type schemes
haftmann
parents:
29272
diff
changeset
|
497 |
val typidx' = typidx + 1; |
31957 | 498 |
in of_apps bounds (Term.Const (c, T), ts') typidx' end |
27499 | 499 |
| of_univ bounds (BVar (n, ts)) typidx = |
500 |
of_apps bounds (Bound (bounds - n - 1), ts) typidx |
|
24155 | 501 |
| of_univ bounds (t as Abs _) typidx = |
502 |
typidx |
|
25924 | 503 |
|> of_univ (bounds + 1) (apps t [BVar (bounds, [])]) |
24155 | 504 |
|-> (fn t' => pair (Term.Abs ("u", dummyT, t'))) |
505 |
in of_univ 0 t 0 |> fst end; |
|
506 |
||
25101 | 507 |
(* function store *) |
508 |
||
31962 | 509 |
structure Nbe_Functions = Code_Data_Fun |
25101 | 510 |
( |
28706 | 511 |
type T = Code_Thingol.naming * ((Univ option * int) Graph.T * (int * string Inttab.table)); |
512 |
val empty = (Code_Thingol.empty_naming, (Graph.empty, (0, Inttab.empty))); |
|
513 |
fun purge thy cs (naming, (gr, (maxidx, idx_tab))) = |
|
27609 | 514 |
let |
28706 | 515 |
val names_delete = cs |
516 |
|> map_filter (Code_Thingol.lookup_const naming) |
|
517 |
|> filter (can (Graph.get_node gr)) |
|
518 |
|> Graph.all_preds gr; |
|
519 |
val gr' = Graph.del_nodes names_delete gr; |
|
520 |
in (naming, (gr', (maxidx, idx_tab))) end; |
|
25101 | 521 |
); |
522 |
||
523 |
(* compilation, evaluation and reification *) |
|
524 |
||
30947 | 525 |
fun compile_eval thy naming program vs_t deps = |
26064 | 526 |
let |
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
527 |
val ctxt = ProofContext.init thy; |
28706 | 528 |
val (_, (gr, (_, idx_tab))) = |
529 |
Nbe_Functions.change thy (ensure_stmts ctxt naming program o snd); |
|
26064 | 530 |
in |
30947 | 531 |
vs_t |
28274
9873697fa411
ML_Context.evaluate: proper context (for ML environment);
wenzelm
parents:
28227
diff
changeset
|
532 |
|> eval_term ctxt gr deps |
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28423
diff
changeset
|
533 |
|> term_of_univ thy program idx_tab |
26064 | 534 |
end; |
25101 | 535 |
|
24155 | 536 |
(* evaluation with type reconstruction *) |
537 |
||
31064 | 538 |
fun normalize thy naming program ((vs0, (vs, ty)), t) deps = |
24155 | 539 |
let |
30947 | 540 |
val ty' = typ_of_itype program vs0 ty; |
27264 | 541 |
fun type_infer t = |
542 |
singleton (TypeInfer.infer_types (Syntax.pp_global thy) (Sign.tsig_of thy) I |
|
543 |
(try (Type.strip_sorts o Sign.the_const_type thy)) (K NONE) Name.context 0) |
|
30947 | 544 |
(TypeInfer.constrain ty' t); |
29272 | 545 |
fun check_tvars t = if null (Term.add_tvars t []) then t else |
24155 | 546 |
error ("Illegal schematic type variables in normalized term: " |
26952
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset
|
547 |
^ 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
|
548 |
val string_of_term = setmp show_types true (Syntax.string_of_term_global thy); |
24155 | 549 |
in |
30947 | 550 |
compile_eval thy naming program (vs, t) deps |
32544 | 551 |
|> traced (fn t => "Normalized:\n" ^ string_of_term t) |
26739 | 552 |
|> type_infer |
32544 | 553 |
|> traced (fn t => "Types inferred:\n" ^ string_of_term t) |
26739 | 554 |
|> check_tvars |
32544 | 555 |
|> traced (fn t => "---\n") |
24155 | 556 |
end; |
557 |
||
32544 | 558 |
|
24155 | 559 |
(* evaluation oracle *) |
560 |
||
30947 | 561 |
fun mk_equals thy lhs raw_rhs = |
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset
|
562 |
let |
30947 | 563 |
val ty = Thm.typ_of (Thm.ctyp_of_term lhs); |
564 |
val eq = Thm.cterm_of thy (Term.Const ("==", ty --> ty --> propT)); |
|
565 |
val rhs = Thm.cterm_of thy raw_rhs; |
|
566 |
in Thm.mk_binop eq lhs rhs end; |
|
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset
|
567 |
|
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30672
diff
changeset
|
568 |
val (_, raw_norm_oracle) = Context.>>> (Context.map_theory_result |
31064 | 569 |
(Thm.add_oracle (Binding.name "norm", fn (thy, naming, program, vsp_ty_t, deps, ct) => |
570 |
mk_equals thy ct (normalize thy naming program vsp_ty_t deps)))); |
|
571 |
||
572 |
fun norm_oracle thy naming program vsp_ty_t deps ct = |
|
573 |
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
|
574 |
|
31064 | 575 |
fun no_frees_conv conv ct = |
576 |
let |
|
577 |
val frees = Thm.add_cterm_frees ct []; |
|
578 |
fun apply_beta free thm = Thm.combination thm (Thm.reflexive free) |
|
579 |
|> Conv.fconv_rule (Conv.arg_conv (Conv.try_conv (Thm.beta_conversion false))) |
|
580 |
|> Conv.fconv_rule (Conv.arg1_conv (Thm.beta_conversion false)); |
|
581 |
in |
|
582 |
ct |
|
583 |
|> fold_rev Thm.cabs frees |
|
584 |
|> conv |
|
585 |
|> fold apply_beta frees |
|
586 |
end; |
|
30942
1e246776f876
diagnostic commands now in code_thingol; tuned code of funny continuations
haftmann
parents:
30672
diff
changeset
|
587 |
|
31064 | 588 |
fun no_frees_rew rew t = |
589 |
let |
|
590 |
val frees = map Free (Term.add_frees t []); |
|
591 |
in |
|
592 |
t |
|
593 |
|> fold_rev lambda frees |
|
594 |
|> rew |
|
595 |
|> (fn t' => Term.betapplys (t', frees)) |
|
596 |
end; |
|
597 |
||
598 |
val norm_conv = no_frees_conv (fn ct => |
|
24155 | 599 |
let |
600 |
val thy = Thm.theory_of_cterm ct; |
|
32544 | 601 |
in lift_triv_classes_conv thy (Code_Thingol.eval_conv thy (norm_oracle thy)) ct end); |
24155 | 602 |
|
32544 | 603 |
fun norm thy = lift_triv_classes_rew thy (no_frees_rew (Code_Thingol.eval thy I (normalize thy))); |
24839 | 604 |
|
24155 | 605 |
(* evaluation command *) |
606 |
||
607 |
fun norm_print_term ctxt modes t = |
|
608 |
let |
|
609 |
val thy = ProofContext.theory_of ctxt; |
|
30970
3fe2e418a071
generic postprocessing scheme for term evaluations
haftmann
parents:
30947
diff
changeset
|
610 |
val t' = norm thy t; |
24839 | 611 |
val ty' = Term.type_of t'; |
26952
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset
|
612 |
val ctxt' = Variable.auto_fixes t ctxt; |
24634 | 613 |
val p = PrintMode.with_modes modes (fn () => |
26952
df36f4c52ee8
command 'normal_form': proper context via Variable.auto_fixes;
wenzelm
parents:
26931
diff
changeset
|
614 |
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
|
615 |
Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt' ty')]) (); |
24155 | 616 |
in Pretty.writeln p end; |
617 |
||
618 |
||
619 |
(** Isar setup **) |
|
620 |
||
24508
c8b82fec6447
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24493
diff
changeset
|
621 |
fun norm_print_term_cmd (modes, s) state = |
24155 | 622 |
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
|
623 |
in norm_print_term ctxt modes (Syntax.read_term ctxt s) end; |
24155 | 624 |
|
30970
3fe2e418a071
generic postprocessing scheme for term evaluations
haftmann
parents:
30947
diff
changeset
|
625 |
val setup = Value.add_evaluator ("nbe", norm o ProofContext.theory_of); |
24155 | 626 |
|
627 |
local structure P = OuterParse and K = OuterKeyword in |
|
628 |
||
629 |
val opt_modes = Scan.optional (P.$$$ "(" |-- P.!!! (Scan.repeat1 P.xname --| P.$$$ ")")) []; |
|
630 |
||
24867 | 631 |
val _ = |
24155 | 632 |
OuterSyntax.improper_command "normal_form" "normalize term by evaluation" K.diag |
28227 | 633 |
(opt_modes -- P.term >> (Toplevel.keep o norm_print_term_cmd)); |
24155 | 634 |
|
635 |
end; |
|
636 |
||
637 |
end; |
|
28337 | 638 |