author  haftmann 
Wed, 01 Jan 2014 01:05:46 +0100  
changeset 54889  4121d64fde90 
parent 52519  598addf65209 
child 55043  acefda71629b 
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 

41247  9 
val dynamic_conv: theory > conv 
41184  10 
val dynamic_value: theory > term > term 
11 
val static_conv: theory > string list > conv 

12 
val static_value: theory > string list > term > term 

25101  13 

25204  14 
datatype Univ = 
26064  15 
Const of int * Univ list (*named (uninterpreted) constants*) 
25924  16 
 DFree of string * int (*free (uninterpreted) dictionary parameters*) 
24155  17 
 BVar of int * Univ list 
28350  18 
 Abs of (int * (Univ list > Univ)) * Univ list 
25924  19 
val apps: Univ > Univ list > Univ (*explicit applications*) 
25944  20 
val abss: int > (Univ list > Univ) > Univ 
28337  21 
(*abstractions as closures*) 
41037
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

22 
val same: Univ * Univ > bool 
24155  23 

39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value  using context data instead of bare metal references
haftmann
parents:
39290
diff
changeset

24 
val put_result: (unit > Univ list > Univ list) > Proof.context > Proof.context 
32740  25 
val trace: bool Unsynchronized.ref 
25924  26 

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

27 
val setup: theory > theory 
32544  28 
val add_const_alias: thm > theory > theory 
24155  29 
end; 
30 

31 
structure Nbe: NBE = 

32 
struct 

33 

34 
(* generic nonsense *) 

35 

32740  36 
val trace = Unsynchronized.ref false; 
32544  37 
fun traced f x = if !trace then (tracing (f x); x) else x; 
24155  38 

39 

32544  40 
(** certificates and oracle for "trivial type classes" **) 
41 

33522  42 
structure Triv_Class_Data = Theory_Data 
32544  43 
( 
44 
type T = (class * thm) list; 

45 
val empty = []; 

46 
val extend = I; 

33522  47 
fun merge data : T = AList.merge (op =) (K true) data; 
32544  48 
); 
49 

50 
fun add_const_alias thm thy = 

51 
let 

52 
val (ofclass, eqn) = case try Logic.dest_equals (Thm.prop_of thm) 

53 
of SOME ofclass_eq => ofclass_eq 

54 
 _ => error ("Bad certificate: " ^ Display.string_of_thm_global thy thm); 

55 
val (T, class) = case try Logic.dest_of_class ofclass 

56 
of SOME T_class => T_class 

57 
 _ => error ("Bad certificate: " ^ Display.string_of_thm_global thy thm); 

58 
val tvar = case try Term.dest_TVar T 

51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
48072
diff
changeset

59 
of SOME (tvar as (_, sort)) => if null (filter (can (Axclass.get_info thy)) sort) 
32544  60 
then tvar 
61 
else error ("Bad sort: " ^ Display.string_of_thm_global thy thm) 

62 
 _ => error ("Bad type: " ^ Display.string_of_thm_global thy thm); 

63 
val _ = if Term.add_tvars eqn [] = [tvar] then () 

64 
else error ("Inconsistent type: " ^ Display.string_of_thm_global thy thm); 

65 
val lhs_rhs = case try Logic.dest_equals eqn 

66 
of SOME lhs_rhs => lhs_rhs 

67 
 _ => error ("Not an equation: " ^ Syntax.string_of_term_global thy eqn); 

51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
48072
diff
changeset

68 
val c_c' = case try (pairself (Axclass.unoverload_const thy o dest_Const)) lhs_rhs 
32544  69 
of SOME c_c' => c_c' 
70 
 _ => error ("Not an equation with two constants: " 

71 
^ Syntax.string_of_term_global thy eqn); 

51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
48072
diff
changeset

72 
val _ = if the_list (Axclass.class_of_param thy (snd c_c')) = [class] then () 
32544  73 
else error ("Inconsistent class: " ^ Display.string_of_thm_global thy thm); 
74 
in Triv_Class_Data.map (AList.update (op =) (class, thm)) thy end; 

75 

76 
local 

77 

78 
val get_triv_classes = map fst o Triv_Class_Data.get; 

79 

80 
val (_, triv_of_class) = Context.>>> (Context.map_theory_result 

43619
3803869014aa
proper @{binding} antiquotations (relevant for formal references);
wenzelm
parents:
43329
diff
changeset

81 
(Thm.add_oracle (@{binding triv_of_class}, fn (thy, T, class) => 
32544  82 
Thm.cterm_of thy (Logic.mk_of_class (T, class))))); 
83 

84 
in 

85 

86 
fun lift_triv_classes_conv thy conv ct = 

87 
let 

88 
val algebra = Sign.classes_of thy; 

36982
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

89 
val certT = Thm.ctyp_of thy; 
32544  90 
val triv_classes = get_triv_classes thy; 
36982
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

91 
fun additional_classes sort = filter_out (fn class => Sorts.sort_le algebra (sort, [class])) triv_classes; 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

92 
fun mk_entry (v, sort) = 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

93 
let 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

94 
val T = TFree (v, sort); 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

95 
val cT = certT T; 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

96 
val triv_sort = additional_classes sort; 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

97 
in 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

98 
(v, (Sorts.inter_sort algebra (sort, triv_sort), 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

99 
(cT, AList.make (fn class => Thm.of_class (cT, class)) sort 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

100 
@ AList.make (fn class => triv_of_class (thy, T, class)) triv_sort))) 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

101 
end; 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

102 
val vs_tab = map mk_entry (Term.add_tfrees (Thm.term_of ct) []); 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

103 
fun instantiate thm = 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

104 
let 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

105 
val cert_tvars = map (certT o TVar) (Term.add_tvars 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

106 
((fst o Logic.dest_equals o Logic.strip_imp_concl o Thm.prop_of) thm) []); 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

107 
val instantiation = 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

108 
map2 (fn cert_tvar => fn (_, (_, (cT, _))) => (cert_tvar, cT)) cert_tvars vs_tab; 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

109 
in Thm.instantiate (instantiation, []) thm end; 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

110 
fun of_class (TFree (v, _), class) = 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

111 
the (AList.lookup (op =) ((snd o snd o the o AList.lookup (op =) vs_tab) v) class) 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

112 
 of_class (T, _) = error ("Bad type " ^ Syntax.string_of_typ_global thy T); 
32544  113 
fun strip_of_class thm = 
114 
let 

36982
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

115 
val prems_of_class = Thm.prop_of thm 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

116 
> Logic.strip_imp_prems 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

117 
> map (Logic.dest_of_class #> of_class); 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

118 
in fold Thm.elim_implies prems_of_class thm end; 
36770
c3a04614c710
reactivated Thm.legacy_unconstrainT for Nbe.lift_triv_classes_conv;
wenzelm
parents:
36768
diff
changeset

119 
in 
c3a04614c710
reactivated Thm.legacy_unconstrainT for Nbe.lift_triv_classes_conv;
wenzelm
parents:
36768
diff
changeset

120 
ct 
36982
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

121 
> (Drule.cterm_fun o map_types o map_type_tfree) 
47609  122 
(fn (v, _) => TFree (v, (fst o the o AList.lookup (op =) vs_tab) v)) 
32544  123 
> conv 
36982
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

124 
> Thm.strip_shyps 
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35500
diff
changeset

125 
> Thm.varifyT_global 
36982
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

126 
> Thm.unconstrainT 
1d4478a797c2
new version of triv_of_class machinery without legacy_unconstrain
haftmann
parents:
36960
diff
changeset

127 
> instantiate 
32544  128 
> strip_of_class 
129 
end; 

130 

131 
fun lift_triv_classes_rew thy rew t = 

132 
let 

133 
val algebra = Sign.classes_of thy; 

134 
val triv_classes = get_triv_classes thy; 

135 
val vs = Term.add_tfrees t []; 

52473
a2407f62a29f
do not choke on type variables emerging during rewriting
haftmann
parents:
51685
diff
changeset

136 
in 
a2407f62a29f
do not choke on type variables emerging during rewriting
haftmann
parents:
51685
diff
changeset

137 
t 
32544  138 
> (map_types o map_type_tfree) 
139 
(fn (v, sort) => TFree (v, Sorts.inter_sort algebra (sort, triv_classes))) 

140 
> rew 

141 
> (map_types o map_type_tfree) 

52473
a2407f62a29f
do not choke on type variables emerging during rewriting
haftmann
parents:
51685
diff
changeset

142 
(fn (v, sort) => TFree (v, the_default sort (AList.lookup (op =) vs v))) 
32544  143 
end; 
144 

145 
end; 

146 

147 

148 
(** the semantic universe **) 

24155  149 

150 
(* 

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

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

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

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

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

156 

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

158 

159 
would be in our convention called as 

160 

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

162 

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

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

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

166 
*) 

167 

25204  168 
datatype Univ = 
26064  169 
Const of int * Univ list (*named (uninterpreted) constants*) 
25924  170 
 DFree of string * int (*free (uninterpreted) dictionary parameters*) 
27499  171 
 BVar of int * Univ list (*bound variables, named*) 
24155  172 
 Abs of (int * (Univ list > Univ)) * Univ list 
27499  173 
(*abstractions as closures*); 
24155  174 

35371  175 

24155  176 
(* constructor functions *) 
177 

25944  178 
fun abss n f = Abs ((n, f), []); 
25924  179 
fun apps (Abs ((n, f), xs)) ys = let val k = n  length ys in 
27499  180 
case int_ord (k, 0) 
181 
of EQUAL => f (ys @ xs) 

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

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

184 
end 

25924  185 
 apps (Const (name, xs)) ys = Const (name, ys @ xs) 
27499  186 
 apps (BVar (n, xs)) ys = BVar (n, ys @ xs); 
24155  187 

41037
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

188 
fun same (Const (k, xs), Const (l, ys)) = k = l andalso eq_list same (xs, ys) 
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

189 
 same (DFree (s, k), DFree (t, l)) = s = t andalso k = l 
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

190 
 same (BVar (k, xs), BVar (l, ys)) = k = l andalso eq_list same (xs, ys) 
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

191 
 same _ = false; 
40730
2aa0390a2da7
nbe decides equality of abstractions by extensionality
haftmann
parents:
40564
diff
changeset

192 

24155  193 

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

195 

196 
(* abstract ML syntax *) 

197 

198 
infix 9 `$` `$$`; 

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

25101  200 
fun e `$$` [] = e 
201 
 e `$$` es = "(" ^ e ^ " " ^ space_implode " " es ^ ")"; 

24590  202 
fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")"; 
24155  203 

204 
fun ml_cases t cs = 

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

25944  206 
fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end"; 
28337  207 
fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")"; 
24155  208 

28350  209 
fun ml_and [] = "true" 
210 
 ml_and [x] = x 

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

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

213 

24155  214 
fun ml_list es = "[" ^ commas es ^ "]"; 
215 

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

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

218 
 ml_fundefs (eqs :: eqss) = 

219 
let 

220 
fun fundef (name, eqs) = 

221 
let 

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

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

224 
in 

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

26931  226 
> cat_lines 
24155  227 
> suffix "\n" 
228 
end; 

229 

35371  230 

25944  231 
(* nbe specific syntax and sandbox communication *) 
232 

41472
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
41346
diff
changeset

233 
structure Univs = Proof_Data 
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
41346
diff
changeset

234 
( 
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value  using context data instead of bare metal references
haftmann
parents:
39290
diff
changeset

235 
type T = unit > Univ list > Univ list 
41472
f6ab14e61604
misc tuning and comments based on review of Theory_Data, Proof_Data, Generic_Data usage;
wenzelm
parents:
41346
diff
changeset

236 
(* FIXME avoid user error with nonuser text *) 
39399  237 
fun init _ () = error "Univs" 
39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value  using context data instead of bare metal references
haftmann
parents:
39290
diff
changeset

238 
); 
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value  using context data instead of bare metal references
haftmann
parents:
39290
diff
changeset

239 
val put_result = Univs.put; 
24155  240 

241 
local 

41068  242 
val prefix = "Nbe."; 
243 
val name_put = prefix ^ "put_result"; 

244 
val name_const = prefix ^ "Const"; 

245 
val name_abss = prefix ^ "abss"; 

246 
val name_apps = prefix ^ "apps"; 

247 
val name_same = prefix ^ "same"; 

24155  248 
in 
249 

39388
fdbb2c55ffc2
replaced ML_Context.evaluate by ML_Context.value  using context data instead of bare metal references
haftmann
parents:
39290
diff
changeset

250 
val univs_cookie = (Univs.get, put_result, name_put); 
25944  251 

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

25101  254 
fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n; 
24155  255 
fun nbe_bound v = "v_" ^ v; 
31888  256 
fun nbe_bound_optional NONE = "_" 
35500  257 
 nbe_bound_optional (SOME v) = nbe_bound v; 
28337  258 
fun nbe_default v = "w_" ^ v; 
24155  259 

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

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

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

265 
let 

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

267 
else string_of_int (idx_of c); 

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

25924  269 

24155  270 
fun nbe_abss 0 f = f `$` ml_list [] 
25944  271 
 nbe_abss n f = name_abss `$$` [string_of_int n, f]; 
24155  272 

41037
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

273 
fun nbe_same (v1, v2) = "(" ^ name_same ^ " (" ^ nbe_bound v1 ^ ", " ^ nbe_bound v2 ^ "))"; 
28350  274 

24155  275 
end; 
276 

28054  277 
open Basic_Code_Thingol; 
24155  278 

35371  279 

25865  280 
(* code generation *) 
24155  281 

26064  282 
fun assemble_eqnss idx_of deps eqnss = 
25944  283 
let 
284 
fun prep_eqns (c, (vs, eqns)) = 

25924  285 
let 
25944  286 
val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs; 
28337  287 
val num_args = length dicts + ((length o fst o hd) eqns); 
25944  288 
in (c, (num_args, (dicts, eqns))) end; 
289 
val eqnss' = map prep_eqns eqnss; 

290 

291 
fun assemble_constapp c dss ts = 

292 
let 

41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

293 
val ts' = (maps o map) assemble_dict dss @ ts; 
25944  294 
in case AList.lookup (op =) eqnss' c 
28337  295 
of SOME (num_args, _) => if num_args <= length ts' 
296 
then let val (ts1, ts2) = chop num_args ts' 

297 
in nbe_apps (nbe_apps_local 0 c ts1) ts2 

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

25944  299 
 NONE => if member (op =) deps c 
28337  300 
then nbe_apps (nbe_fun 0 c) ts' 
301 
else nbe_apps_constr idx_of c ts' 

25924  302 
end 
41100
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
41068
diff
changeset

303 
and assemble_classrels classrels = 
6c0940392fb4
dictionary constants must permit explicit weakening of classes;
haftmann
parents:
41068
diff
changeset

304 
fold_rev (fn classrel => assemble_constapp classrel [] o single) classrels 
41118
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

305 
and assemble_dict (Dict (classrels, x)) = 
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

306 
assemble_classrels classrels (assemble_plain_dict x) 
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

307 
and assemble_plain_dict (Dict_Const (inst, dss)) = 
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

308 
assemble_constapp inst dss [] 
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

309 
 assemble_plain_dict (Dict_Var (v, (n, _))) = 
b290841cd3b0
separated dictionary weakning into separate type
haftmann
parents:
41100
diff
changeset

310 
nbe_dict v n 
25924  311 

28350  312 
fun assemble_iterm constapp = 
24155  313 
let 
28350  314 
fun of_iterm match_cont t = 
25944  315 
let 
28054  316 
val (t', ts) = Code_Thingol.unfold_app t 
28350  317 
in of_iapp match_cont t' (fold_rev (cons o of_iterm NONE) ts []) end 
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

318 
and of_iapp match_cont (IConst { name = c, dicts = dss, ... }) ts = constapp c dss ts 
31889  319 
 of_iapp match_cont (IVar v) ts = nbe_apps (nbe_bound_optional v) ts 
31724  320 
 of_iapp match_cont ((v, _) `=> t) ts = 
31888  321 
nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound_optional v]) (of_iterm NONE t))) ts 
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

322 
 of_iapp match_cont (ICase { term = t, clauses = clauses, primitive = t0, ... }) ts = 
28350  323 
nbe_apps (ml_cases (of_iterm NONE t) 
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

324 
(map (fn (p, t) => (of_iterm NONE p, of_iterm match_cont t)) clauses 
28350  325 
@ [("_", case match_cont of SOME s => s  NONE => of_iterm NONE t0)])) ts 
25944  326 
in of_iterm end; 
24155  327 

28350  328 
fun subst_nonlin_vars args = 
329 
let 

330 
val vs = (fold o Code_Thingol.fold_varnames) 

33002  331 
(fn v => AList.map_default (op =) (v, 0) (Integer.add 1)) args []; 
28350  332 
val names = Name.make_context (map fst vs); 
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43323
diff
changeset

333 
fun declare v k ctxt = 
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43323
diff
changeset

334 
let val vs = Name.invent ctxt v k 
28350  335 
in (vs, fold Name.declare vs ctxt) end; 
336 
val (vs_renames, _) = fold_map (fn (v, k) => if k > 1 

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

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

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

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

31889  341 
 subst_vars (t as IVar NONE) samepairs = (t, samepairs) 
342 
 subst_vars (t as IVar (SOME v)) samepairs = (case AList.lookup (op =) samepairs v 

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

28350  344 
 NONE => (t, samepairs)) 
345 
 subst_vars (t1 `$ t2) samepairs = samepairs 

346 
> subst_vars t1 

347 
>> subst_vars t2 

348 
>> (op `$) 

48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

349 
 subst_vars (ICase { primitive = t, ... }) samepairs = subst_vars t samepairs; 
28350  350 
val (args', _) = fold_map subst_vars args samepairs; 
351 
in (samepairs, args') end; 

352 

28337  353 
fun assemble_eqn c dicts default_args (i, (args, rhs)) = 
354 
let 

355 
val is_eval = (c = ""); 

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

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

28350  358 
val assemble_arg = assemble_iterm 
52474
9c7f760d06c2
formally accept dictionary parameters for constants on left hand sides in equations
haftmann
parents:
52473
diff
changeset

359 
(fn c => fn dss => fn ts => nbe_apps_constr idx_of c ((maps o map) (K "_") dss @ ts)) NONE; 
35371  360 
val assemble_rhs = assemble_iterm assemble_constapp match_cont; 
28350  361 
val (samepairs, args') = subst_nonlin_vars args; 
362 
val s_args = map assemble_arg args'; 

363 
val s_rhs = if null samepairs then assemble_rhs rhs 

41037
6d6f23b3a879
removed experimental equality checking of closures; acknowledge underapproximation of equality in function name
haftmann
parents:
40730
diff
changeset

364 
else ml_if (ml_and (map nbe_same samepairs)) 
28350  365 
(assemble_rhs rhs) default_rhs; 
28337  366 
val eqns = if is_eval then 
28350  367 
[([ml_list (rev (dicts @ s_args))], s_rhs)] 
28337  368 
else 
28350  369 
[([ml_list (rev (dicts @ map2 ml_as default_args s_args))], s_rhs), 
28337  370 
([ml_list (rev (dicts @ default_args))], default_rhs)] 
371 
in (nbe_fun i c, eqns) end; 

372 

25944  373 
fun assemble_eqns (c, (num_args, (dicts, eqns))) = 
374 
let 

28337  375 
val default_args = map nbe_default 
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43323
diff
changeset

376 
(Name.invent Name.context "a" (num_args  length dicts)); 
28337  377 
val eqns' = map_index (assemble_eqn c dicts default_args) eqns 
378 
@ (if c = "" then [] else [(nbe_fun (length eqns) c, 

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

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

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

24155  382 

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

25944  386 

35371  387 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

388 
(* compile equations *) 
25944  389 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

390 
fun compile_eqnss thy nbe_program raw_deps [] = [] 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

391 
 compile_eqnss thy nbe_program raw_deps eqnss = 
24155  392 
let 
42361  393 
val ctxt = Proof_Context.init_global thy; 
26064  394 
val (deps, deps_vals) = split_list (map_filter 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

395 
(fn dep => Option.map (fn univ => (dep, univ)) (fst ((Graph.get_node nbe_program dep)))) raw_deps); 
26064  396 
val idx_of = raw_deps 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

397 
> map (fn dep => (dep, snd (Graph.get_node nbe_program dep))) 
26064  398 
> AList.lookup (op =) 
399 
> (fn f => the o f); 

400 
val s = assemble_eqnss idx_of deps eqnss; 

24155  401 
val cs = map fst eqnss; 
25944  402 
in 
403 
s 

32544  404 
> traced (fn s => "\n code to be evaluated:\n" ^ s) 
38931
5e84c11c4b8a
evaluate takes ml context and ml expression parameter
haftmann
parents:
38676
diff
changeset

405 
> pair "" 
39911  406 
> Code_Runtime.value ctxt univs_cookie 
25944  407 
> (fn f => f deps_vals) 
408 
> (fn univs => cs ~~ univs) 

409 
end; 

25190  410 

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

411 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

412 
(* extract equations from statements *) 
24155  413 

48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

414 
fun dummy_const c dss = 
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

415 
IConst { name = c, typargs = [], dicts = dss, 
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

416 
dom = [], range = ITyVar "", annotate = false }; 
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

417 

54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52519
diff
changeset

418 
fun eqns_of_stmt (_, Code_Thingol.NoStmt _) = 
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52519
diff
changeset

419 
[] 
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52519
diff
changeset

420 
 eqns_of_stmt (_, Code_Thingol.Fun (_, ((_, []), _))) = 
25101  421 
[] 
37437  422 
 eqns_of_stmt (const, Code_Thingol.Fun (_, (((vs, _), eqns), _))) = 
25101  423 
[(const, (vs, map fst eqns))] 
28054  424 
 eqns_of_stmt (_, Code_Thingol.Datatypecons _) = 
25101  425 
[] 
28054  426 
 eqns_of_stmt (_, Code_Thingol.Datatype _) = 
25101  427 
[] 
37447
ad3e04f289b6
transitive superclasses were also only a misunderstanding
haftmann
parents:
37446
diff
changeset

428 
 eqns_of_stmt (class, Code_Thingol.Class (_, (v, (super_classes, classparams)))) = 
25101  429 
let 
37384
5aba26803073
more consistent naming aroud type classes and instances
haftmann
parents:
37146
diff
changeset

430 
val names = map snd super_classes @ map fst classparams; 
43329
84472e198515
tuned signature: Name.invent and Name.invent_names;
wenzelm
parents:
43323
diff
changeset

431 
val params = Name.invent Name.context "d" (length names); 
25101  432 
fun mk (k, name) = 
433 
(name, ([(v, [])], 

48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

434 
[([dummy_const class [] `$$ map (IVar o SOME) params], 
31889  435 
IVar (SOME (nth params k)))])); 
25101  436 
in map_index mk names end 
28054  437 
 eqns_of_stmt (_, Code_Thingol.Classrel _) = 
25101  438 
[] 
28054  439 
 eqns_of_stmt (_, Code_Thingol.Classparam _) = 
25101  440 
[] 
48072
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

441 
 eqns_of_stmt (inst, Code_Thingol.Classinst { class, vs, superinsts, inst_params, ... }) = 
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

442 
[(inst, (vs, [([], dummy_const class [] `$$ 
ace701efe203
prefer records with speaking labels over deeply nested tuples
haftmann
parents:
47609
diff
changeset

443 
map (fn (_, (_, (inst, dss))) => dummy_const inst dss) superinsts 
52519
598addf65209
explicit hint for domain of class parameters in instance statements
haftmann
parents:
52474
diff
changeset

444 
@ map (IConst o fst o snd o fst) inst_params)]))]; 
24155  445 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

446 

7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

447 
(* compile whole programs *) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

448 

39399  449 
fun ensure_const_idx name (nbe_program, (maxidx, idx_tab)) = 
450 
if can (Graph.get_node nbe_program) name 

451 
then (nbe_program, (maxidx, idx_tab)) 

452 
else (Graph.new_node (name, (NONE, maxidx)) nbe_program, 

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

454 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

455 
fun compile_stmts thy stmts_deps = 
25101  456 
let 
457 
val names = map (fst o fst) stmts_deps; 

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

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

26064  460 
val refl_deps = names_deps 
25190  461 
> maps snd 
462 
> distinct (op =) 

26064  463 
> fold (insert (op =)) names; 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

464 
fun compile nbe_program = eqnss 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

465 
> compile_eqnss thy nbe_program refl_deps 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

466 
> rpair nbe_program; 
25101  467 
in 
39399  468 
fold ensure_const_idx refl_deps 
26064  469 
#> apfst (fold (fn (name, deps) => fold (curry Graph.add_edge name) deps) names_deps 
470 
#> compile 

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

25101  472 
end; 
24155  473 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

474 
fun compile_program thy program = 
25101  475 
let 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

476 
fun add_stmts names (nbe_program, (maxidx, idx_tab)) = if exists ((can o Graph.get_node) nbe_program) names 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

477 
then (nbe_program, (maxidx, idx_tab)) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

478 
else (nbe_program, (maxidx, idx_tab)) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

479 
> compile_stmts thy (map (fn name => ((name, Graph.get_node program name), 
44338
700008399ee5
refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists  order of adjacency is now standardized wrt. Key.ord;
wenzelm
parents:
43619
diff
changeset

480 
Graph.immediate_succs program name)) names); 
28706  481 
in 
482 
fold_rev add_stmts (Graph.strong_conn program) 

483 
end; 

24155  484 

25944  485 

486 
(** evaluation **) 

487 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

488 
(* term evaluation by compilation *) 
25944  489 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

490 
fun compile_term thy nbe_program deps (vs : (string * sort) list, t) = 
25924  491 
let 
492 
val dict_frees = maps (fn (v, sort) => map_index (curry DFree v o fst) sort) vs; 

493 
in 

31064  494 
("", (vs, [([], t)])) 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

495 
> singleton (compile_eqnss thy nbe_program deps) 
25924  496 
> snd 
31064  497 
> (fn t => apps t (rev dict_frees)) 
25924  498 
end; 
24155  499 

35371  500 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

501 
(* reconstruction *) 
24155  502 

30947  503 
fun typ_of_itype program vs (ityco `%% itys) = 
504 
let 

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

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

507 
 typ_of_itype program vs (ITyVar v) = 

508 
let 

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

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

511 

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

512 
fun term_of_univ thy program idx_tab t = 
24155  513 
let 
25101  514 
fun take_until f [] = [] 
515 
 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

516 
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

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

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

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

520 
 _ => false) 
25101  521 
 is_dict (DFree _) = true 
522 
 is_dict _ = false; 

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

523 
fun const_of_idx idx = (case (Graph.get_node program o the o Inttab.lookup idx_tab) idx 
54889
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52519
diff
changeset

524 
of Code_Thingol.NoStmt c => c 
4121d64fde90
explicit distinction between empty code equations and no code equations, including convenient declaration attributes
haftmann
parents:
52519
diff
changeset

525 
 Code_Thingol.Fun (c, _) => c 
35371  526 
 Code_Thingol.Datatypecons (c, _) => c 
527 
 Code_Thingol.Classparam (c, _) => c); 

24155  528 
fun of_apps bounds (t, ts) = 
529 
fold_map (of_univ bounds) ts 

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

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

534 
val c = const_of_idx idx; 
31957  535 
val T = map_type_tvar (fn ((v, i), _) => 
37145
01aa36932739
renamed structure TypeInfer to Type_Infer, keeping the old name as legacy alias for some time;
wenzelm
parents:
36982
diff
changeset

536 
Type_Infer.param typidx (v ^ string_of_int i, [])) 
31957  537 
(Sign.the_const_type thy c); 
30022
1d8b8fa19074
maintain order of constructors in datatypes; clarified conventions for type schemes
haftmann
parents:
29272
diff
changeset

538 
val typidx' = typidx + 1; 
31957  539 
in of_apps bounds (Term.Const (c, T), ts') typidx' end 
27499  540 
 of_univ bounds (BVar (n, ts)) typidx = 
541 
of_apps bounds (Bound (bounds  n  1), ts) typidx 

24155  542 
 of_univ bounds (t as Abs _) typidx = 
543 
typidx 

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

547 

35371  548 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

549 
(* evaluation with type reconstruction *) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

550 

7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

551 
fun eval_term thy program (nbe_program, idx_tab) ((vs0, (vs, ty)), t) deps = 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

552 
let 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

553 
val ctxt = Syntax.init_pretty_global thy; 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

554 
val string_of_term = Syntax.string_of_term (Config.put show_types true ctxt); 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

555 
val ty' = typ_of_itype program vs0 ty; 
42405
13ecdb3057d8
split Type_Infer into early and late part, after Proof_Context;
wenzelm
parents:
42361
diff
changeset

556 
fun type_infer t = 
13ecdb3057d8
split Type_Infer into early and late part, after Proof_Context;
wenzelm
parents:
42361
diff
changeset

557 
Syntax.check_term (Config.put Type_Infer_Context.const_sorts false ctxt) 
13ecdb3057d8
split Type_Infer into early and late part, after Proof_Context;
wenzelm
parents:
42361
diff
changeset

558 
(Type.constraint ty' t); 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

559 
fun check_tvars t = 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

560 
if null (Term.add_tvars t []) then t 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

561 
else error ("Illegal schematic type variables in normalized term: " ^ string_of_term t); 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

562 
in 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

563 
compile_term thy nbe_program deps (vs, t) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

564 
> term_of_univ thy program idx_tab 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

565 
> traced (fn t => "Normalized:\n" ^ string_of_term t) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

566 
> type_infer 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

567 
> traced (fn t => "Types inferred:\n" ^ string_of_term t) 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

568 
> check_tvars 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

569 
> traced (fn _ => "\n") 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

570 
end; 
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

571 

39436  572 

25101  573 
(* function store *) 
574 

34173
458ced35abb8
reduced code generator cache to the baremost minimum
haftmann
parents:
33522
diff
changeset

575 
structure Nbe_Functions = Code_Data 
25101  576 
( 
35500  577 
type T = (Univ option * int) Graph.T * (int * string Inttab.table); 
578 
val empty = (Graph.empty, (0, Inttab.empty)); 

25101  579 
); 
580 

39399  581 
fun compile ignore_cache thy program = 
24155  582 
let 
39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

583 
val (nbe_program, (_, idx_tab)) = 
39399  584 
Nbe_Functions.change (if ignore_cache then NONE else SOME thy) 
585 
(compile_program thy program); 

39392
7a0fcee7a2a3
more clear separation of static compilation and dynamic evaluation
haftmann
parents:
39388
diff
changeset

586 
in (nbe_program, idx_tab) end; 
24155  587 

32544  588 

47572  589 
(* evaluation oracle *) 
24155  590 

30947  591 
fun mk_equals thy lhs raw_rhs = 
26747
f32fa5f5bdd1
moved 'trivial classes' to foundation of code generator
haftmann
parents:
26739
diff
changeset

592 
let 
30947  593 
val ty = Thm.typ_of (Thm.ctyp_of_term lhs); 
594 
val eq = Thm.cterm_of thy (Term.Const ("==", ty > ty > propT)); 

595 
val rhs = Thm.cterm_of thy raw_rhs; 

596 
in Thm.mk_binop eq lhs rhs end; 

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

597 

38669
9ff76d0f0610
refined and unified naming convention for dynamic code evaluation techniques
haftmann
parents:
37449
diff
changeset

598 
val (_, raw_oracle) = Context.>>> (Context.map_theory_result 
43619
3803869014aa
proper @{binding} antiquotations (relevant for formal references);
wenzelm
parents:
43329
diff
changeset

599 
(Thm.add_oracle (@{binding normalization_by_evaluation}, 
39399  600 
fn (thy, program, nbe_program_idx_tab, vsp_ty_t, deps, ct) => 
601 
mk_equals thy ct (eval_term thy program nbe_program_idx_tab vsp_ty_t deps)))); 

31064  602 

39399  603 
fun oracle thy program nbe_program_idx_tab vsp_ty_t deps ct = 
604 
raw_oracle (thy, program, nbe_program_idx_tab, vsp_ty_t, deps, ct); 

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

605 

41247  606 
fun dynamic_conv thy = lift_triv_classes_conv thy (Code_Thingol.dynamic_conv thy 
607 
(K (fn program => oracle thy program (compile false thy program)))); 

24155  608 

41184  609 
fun dynamic_value thy = lift_triv_classes_rew thy 
610 
(Code_Thingol.dynamic_value thy I 

39606
7af0441a3a47
no_frees_* is subsumed by new framework mechanisms in Code_Preproc
haftmann
parents:
39475
diff
changeset

611 
(K (fn program => eval_term thy program (compile false thy program)))); 
39399  612 

41184  613 
fun static_conv thy consts = 
614 
lift_triv_classes_conv thy (Code_Thingol.static_conv thy consts 

47573
6244475356ba
corrected Nbe.static_value: ignore cached compilations;
haftmann
parents:
47572
diff
changeset

615 
(K (fn program => fn _ => oracle thy program (compile true thy program)))); 
24839  616 

41184  617 
fun static_value thy consts = lift_triv_classes_rew thy 
618 
(Code_Thingol.static_value thy I consts 

47573
6244475356ba
corrected Nbe.static_value: ignore cached compilations;
haftmann
parents:
47572
diff
changeset

619 
(K (fn program => fn _ => eval_term thy program (compile true thy program)))); 
41184  620 

35371  621 

39396  622 
(** setup **) 
24155  623 

42361  624 
val setup = Value.add_evaluator ("nbe", dynamic_value o Proof_Context.theory_of); 
24155  625 

626 
end; 

28337  627 