16 | DFree of string * int (*free (uninterpreted) dictionary parameters*) |
16 | DFree of string * int (*free (uninterpreted) dictionary parameters*) |
17 | BVar of int * Univ list |
17 | BVar of int * Univ list |
18 | Abs of (int * (Univ list -> Univ)) * Univ list; |
18 | Abs of (int * (Univ list -> Univ)) * Univ list; |
19 val apps: Univ -> Univ list -> Univ (*explicit applications*) |
19 val apps: Univ -> Univ list -> Univ (*explicit applications*) |
20 val abss: int -> (Univ list -> Univ) -> Univ |
20 val abss: int -> (Univ list -> Univ) -> Univ |
21 (*abstractions as closures*) |
21 (*abstractions as closures*) |
22 |
22 |
23 val univs_ref: (unit -> Univ list -> Univ list) option ref |
23 val univs_ref: (unit -> Univ list -> Univ list) option ref |
24 val trace: bool ref |
24 val trace: bool ref |
25 |
25 |
26 val setup: theory -> theory |
26 val setup: theory -> theory |
88 fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")"; |
88 fun ml_abs v e = "(fn " ^ v ^ " => " ^ e ^ ")"; |
89 |
89 |
90 fun ml_cases t cs = |
90 fun ml_cases t cs = |
91 "(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")"; |
91 "(case " ^ t ^ " of " ^ space_implode " | " (map (fn (p, t) => p ^ " => " ^ t) cs) ^ ")"; |
92 fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end"; |
92 fun ml_Let d e = "let\n" ^ d ^ " in " ^ e ^ " end"; |
|
93 fun ml_as v t = "(" ^ v ^ " as " ^ t ^ ")"; |
93 |
94 |
94 fun ml_list es = "[" ^ commas es ^ "]"; |
95 fun ml_list es = "[" ^ commas es ^ "]"; |
95 |
96 |
96 fun ml_fundefs ([(name, [([], e)])]) = |
97 fun ml_fundefs ([(name, [([], e)])]) = |
97 "val " ^ name ^ " = " ^ e ^ "\n" |
98 "val " ^ name ^ " = " ^ e ^ "\n" |
119 val name_apps = prefix ^ "apps"; |
120 val name_apps = prefix ^ "apps"; |
120 in |
121 in |
121 |
122 |
122 val univs_cookie = (name_ref, univs_ref); |
123 val univs_cookie = (name_ref, univs_ref); |
123 |
124 |
124 fun nbe_fun "" = "nbe_value" |
125 fun nbe_fun 0 "" = "nbe_value" |
125 | nbe_fun c = "c_" ^ translate_string (fn "." => "_" | c => c) c; |
126 | nbe_fun i c = "c_" ^ translate_string (fn "." => "_" | c => c) c ^ "_" ^ string_of_int i; |
126 fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n; |
127 fun nbe_dict v n = "d_" ^ v ^ "_" ^ string_of_int n; |
127 fun nbe_bound v = "v_" ^ v; |
128 fun nbe_bound v = "v_" ^ v; |
|
129 fun nbe_default v = "w_" ^ v; |
128 |
130 |
129 (*note: these three are the "turning spots" where proper argument order is established!*) |
131 (*note: these three are the "turning spots" where proper argument order is established!*) |
130 fun nbe_apps t [] = t |
132 fun nbe_apps t [] = t |
131 | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)]; |
133 | nbe_apps t ts = name_apps `$$` [t, ml_list (rev ts)]; |
132 fun nbe_apps_local c ts = nbe_fun c `$` ml_list (rev ts); |
134 fun nbe_apps_local i c ts = nbe_fun i c `$` ml_list (rev ts); |
133 fun nbe_apps_constr idx ts = |
135 fun nbe_apps_constr idx_of c ts = |
134 name_const `$` ("(" ^ string_of_int idx ^ ", " ^ ml_list (rev ts) ^ ")"); |
136 let |
|
137 val c' = if !trace then string_of_int (idx_of c) ^ " (*" ^ c ^ "*)" |
|
138 else string_of_int (idx_of c); |
|
139 in name_const `$` ("(" ^ c' ^ ", " ^ ml_list (rev ts) ^ ")") end; |
135 |
140 |
136 fun nbe_abss 0 f = f `$` ml_list [] |
141 fun nbe_abss 0 f = f `$` ml_list [] |
137 | nbe_abss n f = name_abss `$$` [string_of_int n, f]; |
142 | nbe_abss n f = name_abss `$$` [string_of_int n, f]; |
138 |
143 |
139 end; |
144 end; |
145 fun assemble_eqnss idx_of deps eqnss = |
150 fun assemble_eqnss idx_of deps eqnss = |
146 let |
151 let |
147 fun prep_eqns (c, (vs, eqns)) = |
152 fun prep_eqns (c, (vs, eqns)) = |
148 let |
153 let |
149 val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs; |
154 val dicts = maps (fn (v, sort) => map_index (nbe_dict v o fst) sort) vs; |
150 val num_args = length dicts + (length o fst o hd) eqns; |
155 val num_args = length dicts + ((length o fst o hd) eqns); |
151 in (c, (num_args, (dicts, eqns))) end; |
156 in (c, (num_args, (dicts, eqns))) end; |
152 val eqnss' = map prep_eqns eqnss; |
157 val eqnss' = map prep_eqns eqnss; |
153 |
158 |
154 fun assemble_constapp c dss ts = |
159 fun assemble_constapp c dss ts = |
155 let |
160 let |
156 val ts' = (maps o map) assemble_idict dss @ ts; |
161 val ts' = (maps o map) assemble_idict dss @ ts; |
157 in case AList.lookup (op =) eqnss' c |
162 in case AList.lookup (op =) eqnss' c |
158 of SOME (n, _) => if n <= length ts' |
163 of SOME (num_args, _) => if num_args <= length ts' |
159 then let val (ts1, ts2) = chop n ts' |
164 then let val (ts1, ts2) = chop num_args ts' |
160 in nbe_apps (nbe_apps_local c ts1) ts2 |
165 in nbe_apps (nbe_apps_local 0 c ts1) ts2 |
161 end else nbe_apps (nbe_abss n (nbe_fun c)) ts' |
166 end else nbe_apps (nbe_abss num_args (nbe_fun 0 c)) ts' |
162 | NONE => if member (op =) deps c |
167 | NONE => if member (op =) deps c |
163 then nbe_apps (nbe_fun c) ts' |
168 then nbe_apps (nbe_fun 0 c) ts' |
164 else nbe_apps_constr (idx_of c) ts' |
169 else nbe_apps_constr idx_of c ts' |
165 end |
170 end |
166 and assemble_idict (DictConst (inst, dss)) = |
171 and assemble_idict (DictConst (inst, dss)) = |
167 assemble_constapp inst dss [] |
172 assemble_constapp inst dss [] |
168 | assemble_idict (DictVar (supers, (v, (n, _)))) = |
173 | assemble_idict (DictVar (supers, (v, (n, _)))) = |
169 fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n); |
174 fold_rev (fn super => assemble_constapp super [] o single) supers (nbe_dict v n); |
170 |
175 |
171 fun assemble_iterm constapp = |
176 fun assemble_iterm match_cont constapp = |
172 let |
177 let |
173 fun of_iterm t = |
178 fun of_iterm t = |
174 let |
179 let |
175 val (t', ts) = Code_Thingol.unfold_app t |
180 val (t', ts) = Code_Thingol.unfold_app t |
176 in of_iapp t' (fold_rev (cons o of_iterm) ts []) end |
181 in of_iapp t' (fold_rev (cons o of_iterm) ts []) end |
178 | of_iapp (IVar v) ts = nbe_apps (nbe_bound v) ts |
183 | of_iapp (IVar v) ts = nbe_apps (nbe_bound v) ts |
179 | of_iapp ((v, _) `|-> t) ts = |
184 | of_iapp ((v, _) `|-> t) ts = |
180 nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm t))) ts |
185 nbe_apps (nbe_abss 1 (ml_abs (ml_list [nbe_bound v]) (of_iterm t))) ts |
181 | of_iapp (ICase (((t, _), cs), t0)) ts = |
186 | of_iapp (ICase (((t, _), cs), t0)) ts = |
182 nbe_apps (ml_cases (of_iterm t) (map (pairself of_iterm) cs |
187 nbe_apps (ml_cases (of_iterm t) (map (pairself of_iterm) cs |
183 @ [("_", of_iterm t0)])) ts |
188 @ [("_", case match_cont of SOME s => s | NONE => of_iterm t0)])) ts |
184 in of_iterm end; |
189 in of_iterm end; |
185 |
190 |
|
191 fun assemble_eqn c dicts default_args (i, (args, rhs)) = |
|
192 let |
|
193 val is_eval = (c = ""); |
|
194 val default_rhs = nbe_apps_local (i+1) c (dicts @ default_args); |
|
195 val match_cont = if is_eval then NONE else SOME default_rhs; |
|
196 val assemble_arg = assemble_iterm NONE |
|
197 (fn c => fn _ => fn ts => nbe_apps_constr idx_of c ts); |
|
198 val assemble_rhs = assemble_iterm match_cont assemble_constapp; |
|
199 val eqns = if is_eval then |
|
200 [([ml_list (rev (dicts @ map assemble_arg args))], assemble_rhs rhs)] |
|
201 else |
|
202 [([ml_list (rev (dicts @ map2 ml_as default_args |
|
203 (map assemble_arg args)))], assemble_rhs rhs), |
|
204 ([ml_list (rev (dicts @ default_args))], default_rhs)] |
|
205 in (nbe_fun i c, eqns) end; |
|
206 |
186 fun assemble_eqns (c, (num_args, (dicts, eqns))) = |
207 fun assemble_eqns (c, (num_args, (dicts, eqns))) = |
187 let |
208 let |
188 val assemble_arg = assemble_iterm |
209 val default_args = map nbe_default |
189 (fn c => fn _ => fn ts => nbe_apps_constr (idx_of c) ts); |
210 (Name.invent_list [] "a" (num_args - length dicts)); |
190 val assemble_rhs = assemble_iterm assemble_constapp; |
211 val eqns' = map_index (assemble_eqn c dicts default_args) eqns |
191 fun assemble_eqn (args, rhs) = |
212 @ (if c = "" then [] else [(nbe_fun (length eqns) c, |
192 ([ml_list (rev (dicts @ map assemble_arg args))], assemble_rhs rhs); |
213 [([ml_list (rev (dicts @ default_args))], |
193 val default_args = map nbe_bound (Name.invent_list [] "a" num_args); |
214 nbe_apps_constr idx_of c (dicts @ default_args))])]); |
194 val default_eqn = if c = "" then NONE |
215 in (eqns', nbe_abss num_args (nbe_fun 0 c)) end; |
195 else SOME ([ml_list (rev default_args)], |
|
196 nbe_apps_constr (idx_of c) default_args); |
|
197 in |
|
198 ((nbe_fun c, map assemble_eqn eqns @ the_list default_eqn), |
|
199 nbe_abss num_args (nbe_fun c)) |
|
200 end; |
|
201 |
216 |
202 val (fun_vars, fun_vals) = map_split assemble_eqns eqnss'; |
217 val (fun_vars, fun_vals) = map_split assemble_eqns eqnss'; |
203 val deps_vars = ml_list (map nbe_fun deps); |
218 val deps_vars = ml_list (map (nbe_fun 0) deps); |
204 in ml_abs deps_vars (ml_Let (ml_fundefs fun_vars) (ml_list fun_vals)) end; |
219 in ml_abs deps_vars (ml_Let (ml_fundefs (flat fun_vars)) (ml_list fun_vals)) end; |
205 |
220 |
206 (* code compilation *) |
221 (* code compilation *) |
207 |
222 |
208 fun compile_eqnss _ gr raw_deps [] = [] |
223 fun compile_eqnss _ gr raw_deps [] = [] |
209 | compile_eqnss ctxt gr raw_deps eqnss = |
224 | compile_eqnss ctxt gr raw_deps eqnss = |