author | haftmann |
Mon, 16 Jul 2007 09:29:05 +0200 | |
changeset 23812 | f935b85fbb4c |
parent 23691 | cedf9610b71d |
child 23955 | f1ba12c117ec |
permissions | -rw-r--r-- |
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
1 |
(* Title: Pure/Tools/codegen_package.ML |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
2 |
ID: $Id$ |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
3 |
Author: Florian Haftmann, TU Muenchen |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
4 |
|
23516 | 5 |
Code generator translation kernel. Code generator Isar setup. |
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
6 |
*) |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
7 |
|
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
8 |
signature CODEGEN_PACKAGE = |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
9 |
sig |
20600 | 10 |
val eval_term: theory -> (string (*reference name!*) * 'a option ref) * term -> 'a; |
22464 | 11 |
val satisfies_ref: bool option ref; |
12 |
val satisfies: theory -> term -> string list -> bool; |
|
21881 | 13 |
val codegen_command: theory -> string -> unit; |
18217 | 14 |
|
23516 | 15 |
(*axiomatic interfaces*) |
19884 | 16 |
type appgen; |
20439 | 17 |
val add_appconst: string * appgen -> theory -> theory; |
23516 | 18 |
val appgen_let: appgen; |
20105 | 19 |
val appgen_case: (theory -> term |
20 |
-> ((string * typ) list * ((term * typ) * (term * term) list)) option) |
|
21 |
-> appgen; |
|
21012 | 22 |
|
23 |
val timing: bool ref; |
|
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
24 |
end; |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
25 |
|
18217 | 26 |
structure CodegenPackage : CODEGEN_PACKAGE = |
18169
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
27 |
struct |
45def66f86cb
added modules for code generator generation two, not operational yet
haftmann
parents:
diff
changeset
|
28 |
|
20896 | 29 |
open BasicCodegenThingol; |
30 |
val tracing = CodegenThingol.tracing; |
|
31 |
val succeed = CodegenThingol.succeed; |
|
32 |
val fail = CodegenThingol.fail; |
|
20699 | 33 |
|
23516 | 34 |
(** code translation **) |
20699 | 35 |
|
36 |
(* theory data *) |
|
18217 | 37 |
|
20600 | 38 |
type appgen = theory -> ((sort -> sort) * Sorts.algebra) * Consts.T |
39 |
-> CodegenFuncgr.T |
|
20896 | 40 |
-> (string * typ) * term list -> CodegenThingol.transact -> iterm * CodegenThingol.transact; |
20439 | 41 |
|
42 |
type appgens = (int * (appgen * stamp)) Symtab.table; |
|
20931 | 43 |
val merge_appgens : appgens * appgens -> appgens = |
20105 | 44 |
Symtab.merge (fn ((bounds1, (_, stamp1)), (bounds2, (_, stamp2))) => |
20931 | 45 |
bounds1 = bounds2 andalso stamp1 = stamp2); |
18217 | 46 |
|
20931 | 47 |
structure Consttab = CodegenConsts.Consttab; |
48 |
type abstypes = typ Symtab.table * CodegenConsts.const Consttab.table; |
|
49 |
fun merge_abstypes ((typs1, consts1) : abstypes, (typs2, consts2) : abstypes) = |
|
50 |
(Symtab.merge (Type.eq_type Vartab.empty) (typs1, typs2), |
|
51 |
Consttab.merge CodegenConsts.eq_const (consts1, consts2)); |
|
20456 | 52 |
|
23812 | 53 |
structure Translation = TheoryDataFun |
22846 | 54 |
( |
20931 | 55 |
type T = appgens * abstypes; |
56 |
val empty = (Symtab.empty, (Symtab.empty, Consttab.empty)); |
|
18217 | 57 |
val copy = I; |
58 |
val extend = I; |
|
20931 | 59 |
fun merge _ ((appgens1, abstypes1), (appgens2, abstypes2)) = |
60 |
(merge_appgens (appgens1, appgens2), merge_abstypes (abstypes1, abstypes2)); |
|
22846 | 61 |
); |
18217 | 62 |
|
23136 | 63 |
structure Funcgr = CodegenFuncgrRetrieval (fun rewrites thy = []); |
22213 | 64 |
|
22737 | 65 |
fun code_depgr thy [] = Funcgr.make thy [] |
66 |
| code_depgr thy consts = |
|
67 |
let |
|
68 |
val gr = Funcgr.make thy consts; |
|
69 |
val select = CodegenFuncgr.Constgraph.all_succs gr consts; |
|
70 |
in |
|
71 |
CodegenFuncgr.Constgraph.subgraph |
|
72 |
(member CodegenConsts.eq_const select) gr |
|
73 |
end; |
|
74 |
||
75 |
fun code_thms thy = |
|
76 |
Pretty.writeln o CodegenFuncgr.pretty thy o code_depgr thy; |
|
22213 | 77 |
|
22507 | 78 |
fun code_deps thy consts = |
79 |
let |
|
22737 | 80 |
val gr = code_depgr thy consts; |
22507 | 81 |
fun mk_entry (const, (_, (_, parents))) = |
82 |
let |
|
83 |
val name = CodegenConsts.string_of_const thy const; |
|
84 |
val nameparents = map (CodegenConsts.string_of_const thy) parents; |
|
85 |
in { name = name, ID = name, dir = "", unfold = true, |
|
86 |
path = "", parents = nameparents } |
|
87 |
end; |
|
88 |
val prgr = CodegenFuncgr.Constgraph.fold ((fn x => fn xs => xs @ [x]) o mk_entry) gr []; |
|
89 |
in Present.display_graph prgr end; |
|
90 |
||
22213 | 91 |
structure Code = CodeDataFun |
22846 | 92 |
( |
22213 | 93 |
type T = CodegenThingol.code; |
94 |
val empty = CodegenThingol.empty_code; |
|
95 |
fun merge _ = CodegenThingol.merge_code; |
|
96 |
fun purge _ NONE _ = CodegenThingol.empty_code |
|
97 |
| purge NONE _ _ = CodegenThingol.empty_code |
|
98 |
| purge (SOME thy) (SOME cs) code = |
|
99 |
let |
|
100 |
val cs_exisiting = |
|
101 |
map_filter (CodegenNames.const_rev thy) (Graph.keys code); |
|
102 |
val dels = (Graph.all_preds code |
|
103 |
o map (CodegenNames.const thy) |
|
104 |
o filter (member CodegenConsts.eq_const cs_exisiting) |
|
105 |
) cs; |
|
106 |
in Graph.del_nodes dels code end; |
|
22846 | 107 |
); |
22213 | 108 |
|
18708 | 109 |
|
23516 | 110 |
(* translation kernel *) |
18865 | 111 |
|
23812 | 112 |
fun get_abstype thy (tyco, tys) = case Symtab.lookup ((fst o snd o Translation.get) thy) tyco |
20931 | 113 |
of SOME ty => SOME ((map_atyps (fn TFree (n, _) => nth tys (the (Int.fromString n)))) ty) |
114 |
| NONE => NONE; |
|
115 |
||
22035 | 116 |
fun ensure_def thy = CodegenThingol.ensure_def (CodegenNames.labelled_name thy); |
117 |
||
23691 | 118 |
fun ensure_def_class thy (algbr as ((_, algebra), _)) funcgr class = |
20386 | 119 |
let |
22185 | 120 |
val superclasses = (Sorts.certify_sort algebra o Sorts.super_classes algebra) class; |
21895 | 121 |
val (v, cs) = AxClass.params_of_class thy class; |
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
122 |
val class' = CodegenNames.class thy class; |
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
123 |
val classrels' = map (curry (CodegenNames.classrel thy) class) superclasses; |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
124 |
val classops' = map (CodegenNames.const thy o CodegenConsts.const_of_cexpr thy) cs; |
22197 | 125 |
val defgen_class = |
23691 | 126 |
fold_map (ensure_def_class thy algbr funcgr) superclasses |
127 |
##>> (fold_map (exprgen_type thy algbr funcgr) o map snd) cs |
|
22197 | 128 |
#-> (fn (superclasses, classoptyps) => succeed |
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
129 |
(CodegenThingol.Class (superclasses ~~ classrels', (unprefix "'" v, classops' ~~ classoptyps)))) |
18454 | 130 |
in |
22197 | 131 |
tracing (fn _ => "generating class " ^ quote class) |
23691 | 132 |
#> ensure_def thy defgen_class ("generating class " ^ quote class) class' |
22197 | 133 |
#> pair class' |
18865 | 134 |
end |
23691 | 135 |
and ensure_def_classrel thy algbr funcgr (subclass, superclass) = |
136 |
ensure_def_class thy algbr funcgr subclass |
|
22197 | 137 |
#>> (fn _ => CodegenNames.classrel thy (subclass, superclass)) |
23691 | 138 |
and ensure_def_tyco thy algbr funcgr "fun" trns = |
22354 | 139 |
trns |
140 |
|> pair "fun" |
|
23691 | 141 |
| ensure_def_tyco thy algbr funcgr tyco trns = |
22354 | 142 |
let |
143 |
fun defgen_datatype trns = |
|
22396 | 144 |
let |
22423 | 145 |
val (vs, cos) = CodegenData.get_datatype thy tyco; |
22396 | 146 |
in |
147 |
trns |
|
23691 | 148 |
|> fold_map (exprgen_tyvar_sort thy algbr funcgr) vs |
22396 | 149 |
||>> fold_map (fn (c, tys) => |
23691 | 150 |
fold_map (exprgen_type thy algbr funcgr) tys |
22396 | 151 |
#-> (fn tys' => |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
152 |
pair ((CodegenNames.const thy o CodegenConsts.const_of_cexpr thy) |
22396 | 153 |
(c, tys ---> Type (tyco, map TFree vs)), tys'))) cos |
154 |
|-> (fn (vs, cos) => succeed (CodegenThingol.Datatype (vs, cos))) |
|
155 |
end; |
|
22354 | 156 |
val tyco' = CodegenNames.tyco thy tyco; |
157 |
in |
|
158 |
trns |
|
159 |
|> tracing (fn _ => "generating type constructor " ^ quote tyco) |
|
23691 | 160 |
|> ensure_def thy defgen_datatype ("generating type constructor " ^ quote tyco) tyco' |
22354 | 161 |
|> pair tyco' |
162 |
end |
|
23691 | 163 |
and exprgen_tyvar_sort thy (algbr as ((proj_sort, _), _)) funcgr (v, sort) trns = |
18516 | 164 |
trns |
23691 | 165 |
|> fold_map (ensure_def_class thy algbr funcgr) (proj_sort sort) |
22185 | 166 |
|>> (fn sort => (unprefix "'" v, sort)) |
23691 | 167 |
and exprgen_type thy algbr funcgr (TFree vs) trns = |
18516 | 168 |
trns |
23691 | 169 |
|> exprgen_tyvar_sort thy algbr funcgr vs |
22185 | 170 |
|>> (fn (v, sort) => ITyVar v) |
23691 | 171 |
| exprgen_type thy algbr funcgr (Type (tyco, tys)) trns = |
20931 | 172 |
case get_abstype thy (tyco, tys) |
173 |
of SOME ty => |
|
174 |
trns |
|
23691 | 175 |
|> exprgen_type thy algbr funcgr ty |
20931 | 176 |
| NONE => |
177 |
trns |
|
23691 | 178 |
|> ensure_def_tyco thy algbr funcgr tyco |
179 |
||>> fold_map (exprgen_type thy algbr funcgr) tys |
|
22185 | 180 |
|>> (fn (tyco, tys) => tyco `%% tys); |
18516 | 181 |
|
20835 | 182 |
exception CONSTRAIN of (string * typ) * typ; |
21012 | 183 |
val timing = ref false; |
20600 | 184 |
|
23691 | 185 |
fun exprgen_dicts thy (algbr as ((proj_sort, algebra), consts)) funcgr (ty_ctxt, sort_decl) = |
20456 | 186 |
let |
187 |
val pp = Sign.pp thy; |
|
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
188 |
datatype typarg = |
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
189 |
Global of (class * string) * typarg list list |
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
190 |
| Local of (class * class) list * (string * (int * sort)); |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22554
diff
changeset
|
191 |
fun class_relation (Global ((_, tyco), yss), _) class = |
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
192 |
Global ((class, tyco), yss) |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22554
diff
changeset
|
193 |
| class_relation (Local (classrels, v), subclass) superclass = |
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
194 |
Local ((subclass, superclass) :: classrels, v); |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22554
diff
changeset
|
195 |
fun type_constructor tyco yss class = |
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
196 |
Global ((class, tyco), (map o map) fst yss); |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22554
diff
changeset
|
197 |
fun type_variable (TFree (v, sort)) = |
20456 | 198 |
let |
199 |
val sort' = proj_sort sort; |
|
22076
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
200 |
in map_index (fn (n, class) => (Local ([], (v, (n, sort'))), class)) sort' end; |
42ae57200d96
changed dictionary representation to explicit classrel witnesses
haftmann
parents:
22035
diff
changeset
|
201 |
val typargs = Sorts.of_sort_derivation pp algebra |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22554
diff
changeset
|
202 |
{class_relation = class_relation, type_constructor = type_constructor, |
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22554
diff
changeset
|
203 |
type_variable = type_variable} |
20456 | 204 |
(ty_ctxt, proj_sort sort_decl); |
22197 | 205 |
fun mk_dict (Global (inst, yss)) = |
23691 | 206 |
ensure_def_inst thy algbr funcgr inst |
22197 | 207 |
##>> (fold_map o fold_map) mk_dict yss |
208 |
#>> (fn (inst, dss) => DictConst (inst, dss)) |
|
209 |
| mk_dict (Local (classrels, (v, (k, sort)))) = |
|
23691 | 210 |
fold_map (ensure_def_classrel thy algbr funcgr) classrels |
22197 | 211 |
#>> (fn classrels => DictVar (classrels, (unprefix "'" v, (k, length sort)))) |
20456 | 212 |
in |
22197 | 213 |
fold_map mk_dict typargs |
20456 | 214 |
end |
23691 | 215 |
and exprgen_dict_parms thy (algbr as (_, consts)) funcgr (c, ty_ctxt) = |
20600 | 216 |
let |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
217 |
val c' = CodegenConsts.const_of_cexpr thy (c, ty_ctxt) |
20699 | 218 |
val idf = CodegenNames.const thy c'; |
21722 | 219 |
val ty_decl = Consts.the_declaration consts idf; |
22197 | 220 |
val (tys, tys_decl) = pairself (curry (Consts.typargs consts) idf) (ty_ctxt, ty_decl); |
221 |
val sorts = map (snd o dest_TVar) tys_decl; |
|
20456 | 222 |
in |
23691 | 223 |
fold_map (exprgen_dicts thy algbr funcgr) (tys ~~ sorts) |
20456 | 224 |
end |
23691 | 225 |
and ensure_def_inst thy (algbr as ((_, algebra), _)) funcgr (class, tyco) trns = |
20456 | 226 |
let |
22185 | 227 |
val superclasses = (Sorts.certify_sort algebra o Sorts.super_classes algebra) class; |
228 |
val (var, classops) = try (AxClass.params_of_class thy) class |> the_default ("'a", []) |
|
229 |
val vs = Name.names (Name.declare var Name.context) "'a" (Sorts.mg_domain algebra tyco [class]); |
|
230 |
val arity_typ = Type (tyco, map TFree vs); |
|
20896 | 231 |
fun gen_superarity superclass trns = |
232 |
trns |
|
23691 | 233 |
|> ensure_def_class thy algbr funcgr superclass |
234 |
||>> ensure_def_classrel thy algbr funcgr (class, superclass) |
|
235 |
||>> exprgen_dicts thy algbr funcgr (arity_typ, [superclass]) |
|
22185 | 236 |
|>> (fn ((superclass, classrel), [DictConst (inst, dss)]) => |
237 |
(superclass, (classrel, (inst, dss)))); |
|
238 |
fun gen_classop_def (classop as (c, ty)) trns = |
|
20896 | 239 |
trns |
23691 | 240 |
|> ensure_def_const thy algbr funcgr (CodegenConsts.const_of_cexpr thy classop) |
241 |
||>> exprgen_term thy algbr funcgr (Const (c, map_type_tfree (K arity_typ) ty)); |
|
20896 | 242 |
fun defgen_inst trns = |
243 |
trns |
|
23691 | 244 |
|> ensure_def_class thy algbr funcgr class |
245 |
||>> ensure_def_tyco thy algbr funcgr tyco |
|
246 |
||>> fold_map (exprgen_tyvar_sort thy algbr funcgr) vs |
|
20896 | 247 |
||>> fold_map gen_superarity superclasses |
22185 | 248 |
||>> fold_map gen_classop_def classops |
20896 | 249 |
|-> (fn ((((class, tyco), arity), superarities), classops) => |
250 |
succeed (CodegenThingol.Classinst ((class, (tyco, arity)), (superarities, classops)))); |
|
251 |
val inst = CodegenNames.instance thy (class, tyco); |
|
18865 | 252 |
in |
253 |
trns |
|
20896 | 254 |
|> tracing (fn _ => "generating instance " ^ quote class ^ " / " ^ quote tyco) |
23691 | 255 |
|> ensure_def thy defgen_inst ("generating instance " ^ quote class ^ " / " ^ quote tyco) inst |
18865 | 256 |
|> pair inst |
257 |
end |
|
23691 | 258 |
and ensure_def_const thy (algbr as (_, consts)) funcgr (const as (c, opt_tyco)) trns = |
18865 | 259 |
let |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
260 |
val c' = CodegenNames.const thy const; |
20896 | 261 |
fun defgen_datatypecons trns = |
262 |
trns |
|
23691 | 263 |
|> ensure_def_tyco thy algbr funcgr |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
264 |
((the o CodegenData.get_datatype_of_constr thy) const) |
20896 | 265 |
|-> (fn _ => succeed CodegenThingol.Bot); |
266 |
fun defgen_classop trns = |
|
267 |
trns |
|
23691 | 268 |
|> ensure_def_class thy algbr funcgr ((the o AxClass.class_of_param thy) c) |
20896 | 269 |
|-> (fn _ => succeed CodegenThingol.Bot); |
270 |
fun defgen_fun trns = |
|
23691 | 271 |
let |
23812 | 272 |
val const' = perhaps (Consttab.lookup ((snd o snd o Translation.get) thy)) const; |
23691 | 273 |
val raw_thms = CodegenFuncgr.funcs funcgr const'; |
274 |
val ty = (Logic.unvarifyT o CodegenFuncgr.typ funcgr) const'; |
|
275 |
val thms = if (null o Term.typ_tfrees) ty orelse (null o fst o strip_type) ty |
|
276 |
then raw_thms |
|
277 |
else map (CodegenFunc.expand_eta 1) raw_thms; |
|
278 |
val timeap = if !timing then Output.timeap_msg ("time for " ^ c') |
|
279 |
else I; |
|
280 |
val msg = cat_lines ("generating code for theorems " :: map string_of_thm thms); |
|
281 |
val vs = (map dest_TFree o Consts.typargs consts) (c', ty); |
|
282 |
val dest_eqthm = |
|
283 |
apfst (snd o strip_comb) o Logic.dest_equals o Logic.unvarify o prop_of; |
|
284 |
fun exprgen_eq (args, rhs) trns = |
|
285 |
trns |
|
286 |
|> fold_map (exprgen_term thy algbr funcgr) args |
|
287 |
||>> exprgen_term thy algbr funcgr rhs; |
|
288 |
in |
|
289 |
trns |
|
290 |
|> CodegenThingol.message msg (fn trns => trns |
|
291 |
|> timeap (fold_map (exprgen_eq o dest_eqthm) thms) |
|
292 |
||>> fold_map (exprgen_tyvar_sort thy algbr funcgr) vs |
|
293 |
||>> exprgen_type thy algbr funcgr ty |
|
294 |
|-> (fn ((eqs, vs), ty) => succeed (CodegenThingol.Fun (eqs, (vs, ty))))) |
|
295 |
end; |
|
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
296 |
val defgen = if (is_some o CodegenData.get_datatype_of_constr thy) const |
21081 | 297 |
then defgen_datatypecons |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
298 |
else if is_some opt_tyco |
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
299 |
orelse (not o is_some o AxClass.class_of_param thy) c |
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
300 |
then defgen_fun |
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
301 |
else defgen_classop |
18865 | 302 |
in |
303 |
trns |
|
20835 | 304 |
|> tracing (fn _ => "generating constant " |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
305 |
^ (quote o CodegenConsts.string_of_const thy) const) |
23691 | 306 |
|> ensure_def thy defgen ("generating constant " ^ CodegenConsts.string_of_const thy const) c' |
20896 | 307 |
|> pair c' |
18865 | 308 |
end |
23691 | 309 |
and exprgen_term thy algbr funcgr (Const (c, ty)) trns = |
18517 | 310 |
trns |
23691 | 311 |
|> select_appgen thy algbr funcgr ((c, ty), []) |
312 |
| exprgen_term thy algbr funcgr (Free (v, ty)) trns = |
|
18516 | 313 |
trns |
23691 | 314 |
|> exprgen_type thy algbr funcgr ty |
22185 | 315 |
|>> (fn _ => IVar v) |
23691 | 316 |
| exprgen_term thy algbr funcgr (Abs (raw_v, ty, raw_t)) trns = |
19136 | 317 |
let |
22035 | 318 |
val (v, t) = Syntax.variant_abs (raw_v, ty, raw_t); |
19136 | 319 |
in |
320 |
trns |
|
23691 | 321 |
|> exprgen_type thy algbr funcgr ty |
322 |
||>> exprgen_term thy algbr funcgr t |
|
22185 | 323 |
|>> (fn (ty, t) => (v, ty) `|-> t) |
19136 | 324 |
end |
23691 | 325 |
| exprgen_term thy algbr funcgr (t as _ $ _) trns = |
20896 | 326 |
case strip_comb t |
327 |
of (Const (c, ty), ts) => |
|
18516 | 328 |
trns |
23691 | 329 |
|> select_appgen thy algbr funcgr ((c, ty), ts) |
20896 | 330 |
| (t', ts) => |
18516 | 331 |
trns |
23691 | 332 |
|> exprgen_term thy algbr funcgr t' |
333 |
||>> fold_map (exprgen_term thy algbr funcgr) ts |
|
22185 | 334 |
|>> (fn (t, ts) => t `$$ ts) |
23691 | 335 |
and appgen_default thy algbr funcgr ((c, ty), ts) trns = |
18865 | 336 |
trns |
23691 | 337 |
|> ensure_def_const thy algbr funcgr (CodegenConsts.const_of_cexpr thy (c, ty)) |
338 |
||>> fold_map (exprgen_type thy algbr funcgr) ((fst o Term.strip_type) ty) |
|
339 |
||>> exprgen_type thy algbr funcgr ((snd o Term.strip_type) ty) |
|
340 |
||>> exprgen_dict_parms thy algbr funcgr (c, ty) |
|
341 |
||>> fold_map (exprgen_term thy algbr funcgr) ts |
|
22305 | 342 |
|>> (fn ((((c, tys), ty), iss), ts) => IConst (c, (iss, tys)) `$$ ts) |
23691 | 343 |
and select_appgen thy algbr funcgr ((c, ty), ts) trns = |
23812 | 344 |
case Symtab.lookup (fst (Translation.get thy)) c |
20896 | 345 |
of SOME (i, (appgen, _)) => |
20105 | 346 |
if length ts < i then |
18865 | 347 |
let |
21161 | 348 |
val k = length ts; |
349 |
val tys = (curry Library.take (i - k) o curry Library.drop k o fst o strip_type) ty; |
|
350 |
val ctxt = (fold o fold_aterms) |
|
351 |
(fn Free (v, _) => Name.declare v | _ => I) ts Name.context; |
|
352 |
val vs = Name.names ctxt "a" tys; |
|
18865 | 353 |
in |
354 |
trns |
|
23691 | 355 |
|> fold_map (exprgen_type thy algbr funcgr) tys |
356 |
||>> appgen thy algbr funcgr ((c, ty), ts @ map Free vs) |
|
22185 | 357 |
|>> (fn (tys, t) => map2 (fn (v, _) => pair v) vs tys `|--> t) |
18865 | 358 |
end |
20105 | 359 |
else if length ts > i then |
18865 | 360 |
trns |
23691 | 361 |
|> appgen thy algbr funcgr ((c, ty), Library.take (i, ts)) |
362 |
||>> fold_map (exprgen_term thy algbr funcgr) (Library.drop (i, ts)) |
|
22185 | 363 |
|>> (fn (t, ts) => t `$$ ts) |
18865 | 364 |
else |
365 |
trns |
|
23691 | 366 |
|> appgen thy algbr funcgr ((c, ty), ts) |
18865 | 367 |
| NONE => |
368 |
trns |
|
23691 | 369 |
|> appgen_default thy algbr funcgr ((c, ty), ts); |
20600 | 370 |
|
371 |
||
23516 | 372 |
(* entrance points into translation kernel *) |
20600 | 373 |
|
23691 | 374 |
fun ensure_def_const' thy algbr funcgr c trns = |
375 |
ensure_def_const thy algbr funcgr c trns |
|
20835 | 376 |
handle CONSTRAIN ((c, ty), ty_decl) => error ( |
20600 | 377 |
"Constant " ^ c ^ " with most general type\n" |
22197 | 378 |
^ CodegenConsts.string_of_typ thy ty |
20600 | 379 |
^ "\noccurs with type\n" |
22197 | 380 |
^ CodegenConsts.string_of_typ thy ty_decl); |
22185 | 381 |
|
23691 | 382 |
fun perhaps_def_const thy algbr funcgr c trns = |
383 |
case try (ensure_def_const thy algbr funcgr c) trns |
|
22185 | 384 |
of SOME (c, trns) => (SOME c, trns) |
385 |
| NONE => (NONE, trns); |
|
386 |
||
23691 | 387 |
fun exprgen_term' thy algbr funcgr t trns = |
388 |
exprgen_term thy algbr funcgr t trns |
|
20835 | 389 |
handle CONSTRAIN ((c, ty), ty_decl) => error ("In term " ^ (quote o Sign.string_of_term thy) t |
20600 | 390 |
^ ",\nconstant " ^ c ^ " with most general type\n" |
22197 | 391 |
^ CodegenConsts.string_of_typ thy ty |
20600 | 392 |
^ "\noccurs with type\n" |
22197 | 393 |
^ CodegenConsts.string_of_typ thy ty_decl); |
18516 | 394 |
|
18702 | 395 |
|
20439 | 396 |
(* parametrized application generators, for instantiation in object logic *) |
23516 | 397 |
(* (axiomatic extensions of translation kernel) *) |
18217 | 398 |
|
23691 | 399 |
fun appgen_case dest_case_expr thy algbr funcgr (app as (c_ty, ts)) trns = |
20105 | 400 |
let |
401 |
val SOME ([], ((st, sty), ds)) = dest_case_expr thy (list_comb (Const c_ty, ts)); |
|
22035 | 402 |
fun clausegen (dt, bt) trns = |
403 |
trns |
|
23691 | 404 |
|> exprgen_term thy algbr funcgr dt |
405 |
||>> exprgen_term thy algbr funcgr bt; |
|
20105 | 406 |
in |
407 |
trns |
|
23691 | 408 |
|> exprgen_term thy algbr funcgr st |
409 |
||>> exprgen_type thy algbr funcgr sty |
|
20105 | 410 |
||>> fold_map clausegen ds |
22185 | 411 |
|>> (fn ((se, sty), ds) => ICase ((se, sty), ds)) |
20105 | 412 |
end; |
413 |
||
23691 | 414 |
fun appgen_let thy algbr funcgr (app as (_, [st, ct])) trns = |
20105 | 415 |
trns |
23691 | 416 |
|> exprgen_term thy algbr funcgr ct |
417 |
||>> exprgen_term thy algbr funcgr st |
|
23516 | 418 |
|-> (fn ((v, ty) `|-> be, se) => pair (CodegenThingol.collapse_let (((v, ty), se), be)) |
23691 | 419 |
| _ => appgen_default thy algbr funcgr app); |
20105 | 420 |
|
20439 | 421 |
fun add_appconst (c, appgen) thy = |
422 |
let |
|
20931 | 423 |
val i = (length o fst o strip_type o Sign.the_const_type thy) c; |
424 |
val _ = Code.change thy (K CodegenThingol.empty_code); |
|
425 |
in |
|
23812 | 426 |
(Translation.map o apfst) |
20931 | 427 |
(Symtab.update (c, (i, (appgen, stamp ())))) thy |
428 |
end; |
|
429 |
||
430 |
||
431 |
||
432 |
(** abstype and constsubst interface **) |
|
433 |
||
21916 | 434 |
local |
435 |
||
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
436 |
fun add_consts thy f (c1, c2 as (c, opt_tyco)) = |
21916 | 437 |
let |
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
438 |
val _ = if |
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
439 |
is_some (AxClass.class_of_param thy c) andalso is_none opt_tyco |
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
440 |
orelse is_some (CodegenData.get_datatype_of_constr thy c2) |
22197 | 441 |
then error ("Not a function: " ^ CodegenConsts.string_of_const thy c2) |
21916 | 442 |
else (); |
22213 | 443 |
val funcgr = Funcgr.make thy [c1, c2]; |
21916 | 444 |
val ty1 = (f o CodegenFuncgr.typ funcgr) c1; |
445 |
val ty2 = CodegenFuncgr.typ funcgr c2; |
|
446 |
val _ = if Sign.typ_equiv thy (ty1, ty2) then () else |
|
447 |
error ("Incompatiable type signatures of " ^ CodegenConsts.string_of_const thy c1 |
|
448 |
^ " and " ^ CodegenConsts.string_of_const thy c2 ^ ":\n" |
|
22197 | 449 |
^ CodegenConsts.string_of_typ thy ty1 ^ "\n" ^ CodegenConsts.string_of_typ thy ty2); |
21916 | 450 |
in Consttab.update (c1, c2) end; |
451 |
||
20931 | 452 |
fun gen_abstyp prep_const prep_typ (raw_abstyp, raw_substtyp) raw_absconsts thy = |
453 |
let |
|
454 |
val abstyp = Type.no_tvars (prep_typ thy raw_abstyp); |
|
455 |
val substtyp = Type.no_tvars (prep_typ thy raw_substtyp); |
|
456 |
val absconsts = (map o pairself) (prep_const thy) raw_absconsts; |
|
22197 | 457 |
val Type (abstyco, tys) = abstyp handle BIND => error ("Bad type: " ^ Sign.string_of_typ thy abstyp); |
458 |
val typarms = map (fst o dest_TFree) tys handle MATCH => error ("Bad type: " ^ Sign.string_of_typ thy abstyp); |
|
20931 | 459 |
fun mk_index v = |
460 |
let |
|
461 |
val k = find_index (fn w => v = w) typarms; |
|
462 |
in if k = ~1 |
|
22197 | 463 |
then error ("Free type variable: " ^ quote v) |
20931 | 464 |
else TFree (string_of_int k, []) |
465 |
end; |
|
466 |
val typpat = map_atyps (fn TFree (v, _) => mk_index v) substtyp; |
|
467 |
fun apply_typpat (Type (tyco, tys)) = |
|
468 |
let |
|
469 |
val tys' = map apply_typpat tys; |
|
470 |
in if tyco = abstyco then |
|
471 |
(map_atyps (fn TFree (n, _) => nth tys' (the (Int.fromString n)))) typpat |
|
472 |
else |
|
473 |
Type (tyco, tys') |
|
474 |
end |
|
475 |
| apply_typpat ty = ty; |
|
476 |
val _ = Code.change thy (K CodegenThingol.empty_code); |
|
477 |
in |
|
478 |
thy |
|
23812 | 479 |
|> (Translation.map o apsnd) (fn (abstypes, abscs) => |
20931 | 480 |
(abstypes |
481 |
|> Symtab.update (abstyco, typpat), |
|
482 |
abscs |
|
21916 | 483 |
|> fold (add_consts thy apply_typpat) absconsts) |
20931 | 484 |
) |
485 |
end; |
|
486 |
||
487 |
fun gen_constsubst prep_const raw_constsubsts thy = |
|
488 |
let |
|
489 |
val constsubsts = (map o pairself) (prep_const thy) raw_constsubsts; |
|
490 |
val _ = Code.change thy (K CodegenThingol.empty_code); |
|
491 |
in |
|
492 |
thy |
|
23812 | 493 |
|> (Translation.map o apsnd o apsnd) (fold (add_consts thy I) constsubsts) |
20931 | 494 |
end; |
495 |
||
21916 | 496 |
in |
497 |
||
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
498 |
val abstyp = gen_abstyp (K I) Sign.certify_typ; |
22687
53943f4dab21
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22570
diff
changeset
|
499 |
val abstyp_e = gen_abstyp CodegenConsts.read_const Sign.read_typ; |
20931 | 500 |
|
22554
d1499fff65d8
simplified constant representation in code generator
haftmann
parents:
22507
diff
changeset
|
501 |
val constsubst = gen_constsubst (K I); |
20931 | 502 |
val constsubst_e = gen_constsubst CodegenConsts.read_const; |
20439 | 503 |
|
21916 | 504 |
end; (*local*) |
18217 | 505 |
|
18516 | 506 |
|
20439 | 507 |
(** code generation interfaces **) |
18516 | 508 |
|
21881 | 509 |
(* generic generation combinators *) |
510 |
||
23691 | 511 |
fun generate thy funcgr gen it = |
20466 | 512 |
let |
23812 | 513 |
val cs = map_filter (Consttab.lookup ((snd o snd o Translation.get) thy)) |
21121 | 514 |
(CodegenFuncgr.all funcgr); |
22213 | 515 |
val funcgr' = Funcgr.make thy cs; |
23089 | 516 |
val naming = NameSpace.qualified_names NameSpace.default_naming; |
20466 | 517 |
val consttab = Consts.empty |
23089 | 518 |
|> fold (fn c => Consts.declare naming |
21121 | 519 |
((CodegenNames.const thy c, CodegenFuncgr.typ funcgr' c), true)) |
520 |
(CodegenFuncgr.all funcgr'); |
|
22185 | 521 |
val algbr = (CodegenData.operational_algebra thy, consttab); |
20466 | 522 |
in |
23691 | 523 |
Code.change_yield thy |
524 |
(CodegenThingol.start_transact (gen thy algbr funcgr' it)) |
|
21121 | 525 |
|> fst |
20466 | 526 |
end; |
18516 | 527 |
|
20600 | 528 |
fun codegen_term thy t = |
20353 | 529 |
let |
20600 | 530 |
val ct = Thm.cterm_of thy t; |
22213 | 531 |
val (ct', funcgr) = Funcgr.make_term thy (K (K K)) ct; |
20835 | 532 |
val t' = Thm.term_of ct'; |
23691 | 533 |
in generate thy funcgr exprgen_term' t' end; |
19136 | 534 |
|
22464 | 535 |
fun raw_eval_term thy (ref_spec, t) args = |
20213 | 536 |
let |
22507 | 537 |
val _ = (Term.map_types o Term.map_atyps) (fn _ => |
538 |
error ("Term " ^ Sign.string_of_term thy t ^ " contains polymorphic type")) |
|
21388 | 539 |
t; |
21121 | 540 |
val t' = codegen_term thy t; |
22464 | 541 |
in |
542 |
CodegenSerializer.eval_term thy CodegenNames.labelled_name |
|
543 |
(Code.get thy) (ref_spec, t') args |
|
544 |
end; |
|
545 |
||
546 |
val satisfies_ref : bool option ref = ref NONE; |
|
547 |
||
548 |
fun eval_term thy t = raw_eval_term thy t []; |
|
549 |
fun satisfies thy t witnesses = raw_eval_term thy |
|
550 |
(("CodegenPackage.satisfies_ref", satisfies_ref), t) witnesses; |
|
18217 | 551 |
|
23691 | 552 |
fun filter_generatable thy consts = |
21881 | 553 |
let |
22213 | 554 |
val (consts', funcgr) = Funcgr.make_consts thy consts; |
23691 | 555 |
val consts'' = generate thy funcgr (fold_map ooo perhaps_def_const) consts'; |
22185 | 556 |
val consts''' = map_filter (fn (const, SOME _) => SOME const | (_, NONE) => NONE) |
557 |
(consts' ~~ consts''); |
|
558 |
in consts''' end; |
|
21881 | 559 |
|
18516 | 560 |
|
20439 | 561 |
(** toplevel interface and setup **) |
18756 | 562 |
|
563 |
local |
|
19150 | 564 |
|
20699 | 565 |
structure P = OuterParse |
566 |
and K = OuterKeyword |
|
567 |
||
20439 | 568 |
fun code raw_cs seris thy = |
18217 | 569 |
let |
23691 | 570 |
val (perm1, cs) = CodegenConsts.read_const_exprs thy |
571 |
(filter_generatable thy) raw_cs; |
|
572 |
val (perm2, cs') = case generate thy (Funcgr.make thy cs) (fold_map ooo ensure_def_const') cs |
|
573 |
of [] => (true, NONE) |
|
574 |
| cs => (false, SOME cs); |
|
20699 | 575 |
val code = Code.get thy; |
23691 | 576 |
val seris' = map (fn (((target, module), file), args) => |
577 |
CodegenSerializer.get_serializer thy target (perm1 orelse perm2) module file args |
|
578 |
CodegenNames.labelled_name cs') seris; |
|
18217 | 579 |
in |
23691 | 580 |
(map (fn f => f code) seris' : unit list; ()) |
18217 | 581 |
end; |
582 |
||
22737 | 583 |
fun code_thms_cmd thy = |
23691 | 584 |
code_thms thy o snd o CodegenConsts.read_const_exprs thy (fst o Funcgr.make_consts thy); |
20699 | 585 |
|
22507 | 586 |
fun code_deps_cmd thy = |
23691 | 587 |
code_deps thy o snd o CodegenConsts.read_const_exprs thy (fst o Funcgr.make_consts thy); |
588 |
||
589 |
val (inK, toK, fileK) = ("in", "to", "file"); |
|
18217 | 590 |
|
22845 | 591 |
val code_exprP = |
592 |
(Scan.repeat P.term |
|
23691 | 593 |
-- Scan.repeat (P.$$$ inK |-- P.name |
594 |
-- Scan.option (P.$$$ toK |-- P.name) |
|
595 |
-- Scan.option (P.$$$ fileK |-- P.name) |
|
22845 | 596 |
-- Scan.optional (P.$$$ "(" |-- P.arguments --| P.$$$ ")") [] |
597 |
) >> (fn (raw_cs, seris) => code raw_cs seris)); |
|
20439 | 598 |
|
23691 | 599 |
val _ = OuterSyntax.add_keywords [inK, toK, fileK]; |
600 |
||
22507 | 601 |
val (codeK, code_abstypeK, code_axiomsK, code_thmsK, code_depsK) = |
602 |
("code_gen", "code_abstype", "code_axioms", "code_thms", "code_deps"); |
|
22213 | 603 |
|
604 |
in |
|
605 |
||
21881 | 606 |
val codeP = |
22845 | 607 |
OuterSyntax.improper_command codeK "generate executable code for constants" |
22213 | 608 |
K.diag (P.!!! code_exprP >> (fn f => Toplevel.keep (f o Toplevel.theory_of))); |
21881 | 609 |
|
610 |
fun codegen_command thy cmd = |
|
22213 | 611 |
case Scan.read OuterLex.stopper (P.!!! code_exprP) ((filter OuterLex.is_proper o OuterSyntax.scan) cmd) |
21916 | 612 |
of SOME f => (writeln "Now generating code..."; f thy) |
22197 | 613 |
| NONE => error ("Bad directive " ^ quote cmd); |
21881 | 614 |
|
20931 | 615 |
val code_abstypeP = |
616 |
OuterSyntax.command code_abstypeK "axiomatic abstypes for code generation" K.thy_decl ( |
|
617 |
(P.typ -- P.typ -- Scan.optional (P.$$$ "where" |-- Scan.repeat1 |
|
618 |
(P.term --| (P.$$$ "\\<equiv>" || P.$$$ "==") -- P.term)) []) |
|
619 |
>> (Toplevel.theory o uncurry abstyp_e) |
|
20428 | 620 |
); |
621 |
||
21062 | 622 |
val code_axiomsP = |
623 |
OuterSyntax.command code_axiomsK "axiomatic constant equalities for code generation" K.thy_decl ( |
|
20931 | 624 |
Scan.repeat1 (P.term --| (P.$$$ "\\<equiv>" || P.$$$ "==") -- P.term) |
625 |
>> (Toplevel.theory o constsubst_e) |
|
18217 | 626 |
); |
627 |
||
22305 | 628 |
val code_thmsP = |
22737 | 629 |
OuterSyntax.improper_command code_thmsK "print system of defining equations for code" OuterKeyword.diag |
22305 | 630 |
(Scan.repeat P.term |
631 |
>> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory |
|
22737 | 632 |
o Toplevel.keep ((fn thy => code_thms_cmd thy cs) o Toplevel.theory_of))); |
22213 | 633 |
|
22507 | 634 |
val code_depsP = |
22737 | 635 |
OuterSyntax.improper_command code_depsK "visualize dependencies of defining equations for code" OuterKeyword.diag |
22507 | 636 |
(Scan.repeat P.term |
637 |
>> (fn cs => Toplevel.no_timing o Toplevel.unknown_theory |
|
638 |
o Toplevel.keep ((fn thy => code_deps_cmd thy cs) o Toplevel.theory_of))); |
|
639 |
||
640 |
val _ = OuterSyntax.add_parsers [codeP, code_abstypeP, code_axiomsP, code_thmsP, code_depsP]; |
|
18217 | 641 |
|
642 |
end; (* local *) |
|
643 |
||
644 |
end; (* struct *) |