berghofe@11520
|
1 |
(* Title: Pure/codegen.ML
|
berghofe@11520
|
2 |
ID: $Id$
|
wenzelm@11539
|
3 |
Author: Stefan Berghofer, TU Muenchen
|
berghofe@11520
|
4 |
|
wenzelm@11539
|
5 |
Generic code generator.
|
berghofe@11520
|
6 |
*)
|
berghofe@11520
|
7 |
|
berghofe@11520
|
8 |
signature CODEGEN =
|
berghofe@11520
|
9 |
sig
|
berghofe@11520
|
10 |
val quiet_mode : bool ref
|
berghofe@11520
|
11 |
val message : string -> unit
|
berghofe@13753
|
12 |
val mode : string list ref
|
berghofe@13886
|
13 |
val margin : int ref
|
berghofe@11520
|
14 |
|
berghofe@12452
|
15 |
datatype 'a mixfix =
|
berghofe@11520
|
16 |
Arg
|
berghofe@11520
|
17 |
| Ignore
|
berghofe@16769
|
18 |
| Module
|
berghofe@11520
|
19 |
| Pretty of Pretty.T
|
berghofe@12452
|
20 |
| Quote of 'a;
|
berghofe@11520
|
21 |
|
berghofe@16649
|
22 |
type deftab
|
berghofe@17144
|
23 |
type node
|
berghofe@16649
|
24 |
type codegr
|
berghofe@12452
|
25 |
type 'a codegen
|
berghofe@12452
|
26 |
|
berghofe@12452
|
27 |
val add_codegen: string -> term codegen -> theory -> theory
|
berghofe@12452
|
28 |
val add_tycodegen: string -> typ codegen -> theory -> theory
|
berghofe@15261
|
29 |
val add_preprocessor: (theory -> thm list -> thm list) -> theory -> theory
|
berghofe@15261
|
30 |
val preprocess: theory -> thm list -> thm list
|
berghofe@17549
|
31 |
val preprocess_term: theory -> term -> term
|
berghofe@11520
|
32 |
val print_codegens: theory -> unit
|
berghofe@17144
|
33 |
val generate_code: theory -> string list -> string -> (string * string) list ->
|
berghofe@17144
|
34 |
(string * string) list * codegr
|
berghofe@17144
|
35 |
val generate_code_i: theory -> string list -> string -> (string * term) list ->
|
berghofe@17144
|
36 |
(string * string) list * codegr
|
haftmann@22921
|
37 |
val assoc_const: string * (term mixfix list *
|
haftmann@22921
|
38 |
(string * string) list) -> theory -> theory
|
haftmann@22921
|
39 |
val assoc_const_i: (string * typ) * (term mixfix list *
|
haftmann@22921
|
40 |
(string * string) list) -> theory -> theory
|
haftmann@22921
|
41 |
val assoc_type: xstring * (typ mixfix list *
|
haftmann@22921
|
42 |
(string * string) list) -> theory -> theory
|
haftmann@22921
|
43 |
val get_assoc_code: theory -> string * typ ->
|
berghofe@16769
|
44 |
(term mixfix list * (string * string) list) option
|
berghofe@16769
|
45 |
val get_assoc_type: theory -> string ->
|
berghofe@16769
|
46 |
(typ mixfix list * (string * string) list) option
|
berghofe@17144
|
47 |
val codegen_error: codegr -> string -> string -> 'a
|
berghofe@16649
|
48 |
val invoke_codegen: theory -> deftab -> string -> string -> bool ->
|
berghofe@16649
|
49 |
codegr * term -> codegr * Pretty.T
|
berghofe@16649
|
50 |
val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
|
berghofe@16649
|
51 |
codegr * typ -> codegr * Pretty.T
|
berghofe@14858
|
52 |
val mk_id: string -> string
|
berghofe@17144
|
53 |
val mk_qual_id: string -> string * string -> string
|
berghofe@17144
|
54 |
val mk_const_id: string -> string -> codegr -> codegr * (string * string)
|
berghofe@17144
|
55 |
val get_const_id: string -> codegr -> string * string
|
berghofe@17144
|
56 |
val mk_type_id: string -> string -> codegr -> codegr * (string * string)
|
berghofe@17144
|
57 |
val get_type_id: string -> codegr -> string * string
|
berghofe@16649
|
58 |
val thyname_of_type: string -> theory -> string
|
berghofe@16649
|
59 |
val thyname_of_const: string -> theory -> string
|
berghofe@16649
|
60 |
val rename_terms: term list -> term list
|
berghofe@11520
|
61 |
val rename_term: term -> term
|
berghofe@15398
|
62 |
val new_names: term -> string list -> string list
|
berghofe@15398
|
63 |
val new_name: term -> string -> string
|
berghofe@17144
|
64 |
val if_library: 'a -> 'a -> 'a
|
berghofe@16649
|
65 |
val get_defn: theory -> deftab -> string -> typ ->
|
berghofe@16649
|
66 |
((typ * (string * (term list * term))) * int option) option
|
wenzelm@24908
|
67 |
val is_instance: typ -> typ -> bool
|
berghofe@11520
|
68 |
val parens: Pretty.T -> Pretty.T
|
berghofe@11520
|
69 |
val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
|
berghofe@11520
|
70 |
val eta_expand: term -> term list -> int -> term
|
berghofe@14105
|
71 |
val strip_tname: string -> string
|
berghofe@13753
|
72 |
val mk_type: bool -> typ -> Pretty.T
|
berghofe@17144
|
73 |
val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
|
berghofe@17144
|
74 |
val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
|
berghofe@14105
|
75 |
val test_fn: (int -> (string * term) list option) ref
|
berghofe@24456
|
76 |
val test_term: theory -> bool -> int -> int -> term -> (string * term) list option
|
berghofe@24456
|
77 |
val auto_quickcheck: bool ref
|
wenzelm@24805
|
78 |
val auto_quickcheck_time_limit: int ref
|
berghofe@24655
|
79 |
val eval_result: (unit -> term) ref
|
berghofe@17549
|
80 |
val eval_term: theory -> term -> term
|
haftmann@20599
|
81 |
val evaluation_conv: cterm -> thm
|
berghofe@12452
|
82 |
val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
|
haftmann@18102
|
83 |
val quotes_of: 'a mixfix list -> 'a list
|
haftmann@18281
|
84 |
val num_args_of: 'a mixfix list -> int
|
haftmann@18102
|
85 |
val replace_quotes: 'b list -> 'a mixfix list -> 'b mixfix list
|
berghofe@16649
|
86 |
val mk_deftab: theory -> deftab
|
haftmann@19341
|
87 |
val add_unfold: thm -> theory -> theory
|
berghofe@17549
|
88 |
|
berghofe@17144
|
89 |
val get_node: codegr -> string -> node
|
berghofe@17144
|
90 |
val add_edge: string * string -> codegr -> codegr
|
berghofe@17144
|
91 |
val add_edge_acyclic: string * string -> codegr -> codegr
|
berghofe@17144
|
92 |
val del_nodes: string list -> codegr -> codegr
|
berghofe@17144
|
93 |
val map_node: string -> (node -> node) -> codegr -> codegr
|
berghofe@17144
|
94 |
val new_node: string * node -> codegr -> codegr
|
berghofe@11520
|
95 |
end;
|
berghofe@11520
|
96 |
|
berghofe@11520
|
97 |
structure Codegen : CODEGEN =
|
berghofe@11520
|
98 |
struct
|
berghofe@11520
|
99 |
|
berghofe@11520
|
100 |
val quiet_mode = ref true;
|
berghofe@11520
|
101 |
fun message s = if !quiet_mode then () else writeln s;
|
berghofe@11520
|
102 |
|
berghofe@13753
|
103 |
val mode = ref ([] : string list);
|
berghofe@13753
|
104 |
|
berghofe@13886
|
105 |
val margin = ref 80;
|
berghofe@13886
|
106 |
|
berghofe@11520
|
107 |
(**** Mixfix syntax ****)
|
berghofe@11520
|
108 |
|
berghofe@12452
|
109 |
datatype 'a mixfix =
|
berghofe@11520
|
110 |
Arg
|
berghofe@11520
|
111 |
| Ignore
|
berghofe@16769
|
112 |
| Module
|
berghofe@11520
|
113 |
| Pretty of Pretty.T
|
berghofe@12452
|
114 |
| Quote of 'a;
|
berghofe@11520
|
115 |
|
berghofe@11520
|
116 |
fun is_arg Arg = true
|
berghofe@11520
|
117 |
| is_arg Ignore = true
|
berghofe@11520
|
118 |
| is_arg _ = false;
|
berghofe@11520
|
119 |
|
berghofe@12452
|
120 |
fun quotes_of [] = []
|
berghofe@12452
|
121 |
| quotes_of (Quote q :: ms) = q :: quotes_of ms
|
berghofe@12452
|
122 |
| quotes_of (_ :: ms) = quotes_of ms;
|
berghofe@12452
|
123 |
|
berghofe@12452
|
124 |
fun args_of [] xs = ([], xs)
|
berghofe@12452
|
125 |
| args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
|
berghofe@12452
|
126 |
| args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
|
berghofe@12452
|
127 |
| args_of (_ :: ms) xs = args_of ms xs;
|
berghofe@11520
|
128 |
|
haftmann@18281
|
129 |
fun num_args_of x = length (List.filter is_arg x);
|
berghofe@11520
|
130 |
|
berghofe@11520
|
131 |
|
berghofe@11520
|
132 |
(**** theory data ****)
|
berghofe@11520
|
133 |
|
berghofe@16649
|
134 |
(* preprocessed definition table *)
|
berghofe@16649
|
135 |
|
berghofe@16649
|
136 |
type deftab =
|
berghofe@16649
|
137 |
(typ * (* type of constant *)
|
berghofe@16649
|
138 |
(string * (* name of theory containing definition of constant *)
|
berghofe@16649
|
139 |
(term list * (* parameters *)
|
berghofe@16649
|
140 |
term))) (* right-hand side *)
|
berghofe@16649
|
141 |
list Symtab.table;
|
berghofe@16649
|
142 |
|
berghofe@16649
|
143 |
(* code dependency graph *)
|
berghofe@16649
|
144 |
|
berghofe@17144
|
145 |
type nametab = (string * string) Symtab.table * unit Symtab.table;
|
berghofe@17144
|
146 |
|
berghofe@17144
|
147 |
fun merge_nametabs ((tab, used), (tab', used')) =
|
berghofe@17144
|
148 |
(Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
|
berghofe@17144
|
149 |
|
berghofe@17144
|
150 |
type node =
|
berghofe@16649
|
151 |
(exn option * (* slot for arbitrary data *)
|
berghofe@16649
|
152 |
string * (* name of structure containing piece of code *)
|
berghofe@17144
|
153 |
string); (* piece of code *)
|
berghofe@17144
|
154 |
|
berghofe@17144
|
155 |
type codegr =
|
berghofe@17144
|
156 |
node Graph.T *
|
berghofe@17144
|
157 |
(nametab * (* table for assigned constant names *)
|
berghofe@17144
|
158 |
nametab); (* table for assigned type names *)
|
berghofe@17144
|
159 |
|
berghofe@17144
|
160 |
val emptygr : codegr = (Graph.empty,
|
berghofe@17144
|
161 |
((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
|
berghofe@16649
|
162 |
|
berghofe@14105
|
163 |
(* type of code generators *)
|
berghofe@11520
|
164 |
|
berghofe@16649
|
165 |
type 'a codegen =
|
berghofe@16649
|
166 |
theory -> (* theory in which generate_code was called *)
|
berghofe@16649
|
167 |
deftab -> (* definition table (for efficiency) *)
|
berghofe@16649
|
168 |
codegr -> (* code dependency graph *)
|
berghofe@16649
|
169 |
string -> (* node name of caller (for recording dependencies) *)
|
berghofe@17144
|
170 |
string -> (* module name of caller (for modular code generation) *)
|
berghofe@16649
|
171 |
bool -> (* whether to parenthesize generated expression *)
|
berghofe@16649
|
172 |
'a -> (* item to generate code from *)
|
berghofe@16649
|
173 |
(codegr * Pretty.T) option;
|
berghofe@12452
|
174 |
|
berghofe@14105
|
175 |
(* parameters for random testing *)
|
berghofe@14105
|
176 |
|
berghofe@14105
|
177 |
type test_params =
|
berghofe@14105
|
178 |
{size: int, iterations: int, default_type: typ option};
|
berghofe@14105
|
179 |
|
berghofe@14105
|
180 |
fun merge_test_params
|
berghofe@14105
|
181 |
{size = size1, iterations = iterations1, default_type = default_type1}
|
berghofe@14105
|
182 |
{size = size2, iterations = iterations2, default_type = default_type2} =
|
berghofe@14105
|
183 |
{size = Int.max (size1, size2),
|
berghofe@14105
|
184 |
iterations = Int.max (iterations1, iterations2),
|
berghofe@14105
|
185 |
default_type = case default_type1 of
|
skalberg@15531
|
186 |
NONE => default_type2
|
berghofe@14105
|
187 |
| _ => default_type1};
|
berghofe@14105
|
188 |
|
berghofe@14105
|
189 |
val default_test_params : test_params =
|
skalberg@15531
|
190 |
{size = 10, iterations = 100, default_type = NONE};
|
berghofe@14105
|
191 |
|
berghofe@14105
|
192 |
fun set_size size ({iterations, default_type, ...} : test_params) =
|
berghofe@14105
|
193 |
{size = size, iterations = iterations, default_type = default_type};
|
berghofe@14105
|
194 |
|
berghofe@14105
|
195 |
fun set_iterations iterations ({size, default_type, ...} : test_params) =
|
berghofe@14105
|
196 |
{size = size, iterations = iterations, default_type = default_type};
|
berghofe@14105
|
197 |
|
wenzelm@16458
|
198 |
fun set_default_type s thy ({size, iterations, ...} : test_params) =
|
berghofe@14105
|
199 |
{size = size, iterations = iterations,
|
wenzelm@24707
|
200 |
default_type = SOME (Syntax.read_typ_global thy s)};
|
berghofe@14105
|
201 |
|
wenzelm@22846
|
202 |
|
wenzelm@22846
|
203 |
(* theory data *)
|
wenzelm@16458
|
204 |
|
wenzelm@16458
|
205 |
structure CodegenData = TheoryDataFun
|
wenzelm@22846
|
206 |
(
|
berghofe@11520
|
207 |
type T =
|
berghofe@12452
|
208 |
{codegens : (string * term codegen) list,
|
berghofe@12452
|
209 |
tycodegens : (string * typ codegen) list,
|
berghofe@16769
|
210 |
consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
|
berghofe@16769
|
211 |
types : (string * (typ mixfix list * (string * string) list)) list,
|
berghofe@15261
|
212 |
preprocs: (stamp * (theory -> thm list -> thm list)) list,
|
berghofe@17144
|
213 |
modules: codegr Symtab.table,
|
berghofe@14105
|
214 |
test_params: test_params};
|
berghofe@11520
|
215 |
|
berghofe@12555
|
216 |
val empty =
|
haftmann@24219
|
217 |
{codegens = [], tycodegens = [], consts = [], types = [],
|
berghofe@17144
|
218 |
preprocs = [], modules = Symtab.empty, test_params = default_test_params};
|
berghofe@11520
|
219 |
val copy = I;
|
wenzelm@16458
|
220 |
val extend = I;
|
berghofe@11520
|
221 |
|
wenzelm@16458
|
222 |
fun merge _
|
berghofe@12555
|
223 |
({codegens = codegens1, tycodegens = tycodegens1,
|
haftmann@24219
|
224 |
consts = consts1, types = types1,
|
berghofe@17144
|
225 |
preprocs = preprocs1, modules = modules1, test_params = test_params1},
|
berghofe@12555
|
226 |
{codegens = codegens2, tycodegens = tycodegens2,
|
haftmann@24219
|
227 |
consts = consts2, types = types2,
|
berghofe@17144
|
228 |
preprocs = preprocs2, modules = modules2, test_params = test_params2}) =
|
haftmann@19119
|
229 |
{codegens = AList.merge (op =) (K true) (codegens1, codegens2),
|
haftmann@19119
|
230 |
tycodegens = AList.merge (op =) (K true) (tycodegens1, tycodegens2),
|
haftmann@21098
|
231 |
consts = AList.merge (op =) (K true) (consts1, consts2),
|
haftmann@21098
|
232 |
types = AList.merge (op =) (K true) (types1, types2),
|
haftmann@19119
|
233 |
preprocs = AList.merge (op =) (K true) (preprocs1, preprocs2),
|
berghofe@17144
|
234 |
modules = Symtab.merge (K true) (modules1, modules2),
|
berghofe@14105
|
235 |
test_params = merge_test_params test_params1 test_params2};
|
wenzelm@22846
|
236 |
);
|
berghofe@11520
|
237 |
|
wenzelm@22846
|
238 |
fun print_codegens thy =
|
wenzelm@22846
|
239 |
let val {codegens, tycodegens, ...} = CodegenData.get thy in
|
berghofe@12452
|
240 |
Pretty.writeln (Pretty.chunks
|
berghofe@12452
|
241 |
[Pretty.strs ("term code generators:" :: map fst codegens),
|
wenzelm@22846
|
242 |
Pretty.strs ("type code generators:" :: map fst tycodegens)])
|
wenzelm@22846
|
243 |
end;
|
berghofe@11520
|
244 |
|
berghofe@11520
|
245 |
|
berghofe@11520
|
246 |
|
berghofe@14105
|
247 |
(**** access parameters for random testing ****)
|
berghofe@14105
|
248 |
|
berghofe@14105
|
249 |
fun get_test_params thy = #test_params (CodegenData.get thy);
|
berghofe@14105
|
250 |
|
berghofe@14105
|
251 |
fun map_test_params f thy =
|
haftmann@24219
|
252 |
let val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@14105
|
253 |
CodegenData.get thy;
|
berghofe@14105
|
254 |
in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
|
haftmann@24219
|
255 |
consts = consts, types = types, preprocs = preprocs,
|
berghofe@17144
|
256 |
modules = modules, test_params = f test_params} thy
|
berghofe@17144
|
257 |
end;
|
berghofe@17144
|
258 |
|
berghofe@17144
|
259 |
|
berghofe@17144
|
260 |
(**** access modules ****)
|
berghofe@17144
|
261 |
|
berghofe@17144
|
262 |
fun get_modules thy = #modules (CodegenData.get thy);
|
berghofe@17144
|
263 |
|
berghofe@17144
|
264 |
fun map_modules f thy =
|
haftmann@24219
|
265 |
let val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@17144
|
266 |
CodegenData.get thy;
|
berghofe@17144
|
267 |
in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
|
haftmann@24219
|
268 |
consts = consts, types = types, preprocs = preprocs,
|
berghofe@17144
|
269 |
modules = f modules, test_params = test_params} thy
|
berghofe@14105
|
270 |
end;
|
berghofe@14105
|
271 |
|
berghofe@14105
|
272 |
|
berghofe@12452
|
273 |
(**** add new code generators to theory ****)
|
berghofe@11520
|
274 |
|
berghofe@11520
|
275 |
fun add_codegen name f thy =
|
haftmann@24219
|
276 |
let val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@14105
|
277 |
CodegenData.get thy
|
haftmann@17521
|
278 |
in (case AList.lookup (op =) codegens name of
|
skalberg@15531
|
279 |
NONE => CodegenData.put {codegens = (name, f) :: codegens,
|
berghofe@12555
|
280 |
tycodegens = tycodegens, consts = consts, types = types,
|
haftmann@24219
|
281 |
preprocs = preprocs, modules = modules,
|
berghofe@17144
|
282 |
test_params = test_params} thy
|
skalberg@15531
|
283 |
| SOME _ => error ("Code generator " ^ name ^ " already declared"))
|
berghofe@12452
|
284 |
end;
|
berghofe@12452
|
285 |
|
berghofe@12452
|
286 |
fun add_tycodegen name f thy =
|
haftmann@24219
|
287 |
let val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@14105
|
288 |
CodegenData.get thy
|
haftmann@17521
|
289 |
in (case AList.lookup (op =) tycodegens name of
|
skalberg@15531
|
290 |
NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
|
berghofe@12555
|
291 |
codegens = codegens, consts = consts, types = types,
|
haftmann@24219
|
292 |
preprocs = preprocs, modules = modules,
|
berghofe@17144
|
293 |
test_params = test_params} thy
|
skalberg@15531
|
294 |
| SOME _ => error ("Code generator " ^ name ^ " already declared"))
|
berghofe@11520
|
295 |
end;
|
berghofe@11520
|
296 |
|
berghofe@11520
|
297 |
|
berghofe@15261
|
298 |
(**** preprocessors ****)
|
berghofe@15261
|
299 |
|
berghofe@15261
|
300 |
fun add_preprocessor p thy =
|
haftmann@24219
|
301 |
let val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@15261
|
302 |
CodegenData.get thy
|
berghofe@15261
|
303 |
in CodegenData.put {tycodegens = tycodegens,
|
berghofe@15261
|
304 |
codegens = codegens, consts = consts, types = types,
|
haftmann@24219
|
305 |
preprocs = (stamp (), p) :: preprocs,
|
berghofe@17144
|
306 |
modules = modules, test_params = test_params} thy
|
berghofe@15261
|
307 |
end;
|
berghofe@15261
|
308 |
|
haftmann@21836
|
309 |
fun preprocess thy =
|
berghofe@15261
|
310 |
let val {preprocs, ...} = CodegenData.get thy
|
haftmann@21836
|
311 |
in fold (fn (_, f) => f thy) preprocs end;
|
berghofe@15261
|
312 |
|
berghofe@17549
|
313 |
fun preprocess_term thy t =
|
berghofe@17549
|
314 |
let
|
wenzelm@20071
|
315 |
val x = Free (Name.variant (add_term_names (t, [])) "x", fastype_of t);
|
berghofe@17549
|
316 |
(* fake definition *)
|
berghofe@17549
|
317 |
val eq = setmp quick_and_dirty true (SkipProof.make_thm thy)
|
berghofe@17549
|
318 |
(Logic.mk_equals (x, t));
|
berghofe@17549
|
319 |
fun err () = error "preprocess_term: bad preprocessor"
|
berghofe@17549
|
320 |
in case map prop_of (preprocess thy [eq]) of
|
berghofe@17549
|
321 |
[Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
|
berghofe@17549
|
322 |
| _ => err ()
|
berghofe@17549
|
323 |
end;
|
haftmann@18281
|
324 |
|
haftmann@19341
|
325 |
fun add_unfold eqn =
|
berghofe@15261
|
326 |
let
|
haftmann@22749
|
327 |
val thy = Thm.theory_of_thm eqn;
|
haftmann@22749
|
328 |
val ctxt = ProofContext.init thy;
|
haftmann@22749
|
329 |
val eqn' = LocalDefs.meta_rewrite_rule ctxt eqn;
|
haftmann@22749
|
330 |
val names = term_consts (fst (Logic.dest_equals (prop_of eqn')));
|
berghofe@15261
|
331 |
fun prep thy = map (fn th =>
|
berghofe@17666
|
332 |
let val prop = prop_of th
|
berghofe@17666
|
333 |
in
|
berghofe@17666
|
334 |
if forall (fn name => exists_Const (equal name o fst) prop) names
|
haftmann@22749
|
335 |
then rewrite_rule [eqn'] (Thm.transfer thy th)
|
berghofe@17666
|
336 |
else th
|
berghofe@17666
|
337 |
end)
|
haftmann@19341
|
338 |
in add_preprocessor prep end;
|
berghofe@15261
|
339 |
|
berghofe@24456
|
340 |
val _ = Context.add_setup
|
berghofe@24456
|
341 |
(let
|
berghofe@24456
|
342 |
fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I);
|
berghofe@24456
|
343 |
in
|
berghofe@24456
|
344 |
Code.add_attribute ("unfold", Scan.succeed (mk_attribute
|
berghofe@24456
|
345 |
(fn thm => add_unfold thm #> Code.add_inline thm)))
|
berghofe@24456
|
346 |
end);
|
haftmann@22749
|
347 |
|
berghofe@15261
|
348 |
|
berghofe@11520
|
349 |
(**** associate constants with target language code ****)
|
berghofe@11520
|
350 |
|
haftmann@22921
|
351 |
fun gen_assoc_const prep_const (raw_const, syn) thy =
|
berghofe@11520
|
352 |
let
|
haftmann@24219
|
353 |
val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@14105
|
354 |
CodegenData.get thy;
|
haftmann@22921
|
355 |
val (cname, T) = prep_const thy raw_const;
|
berghofe@11520
|
356 |
in
|
haftmann@22921
|
357 |
if num_args_of (fst syn) > length (binder_types T) then
|
haftmann@22921
|
358 |
error ("More arguments than in corresponding type of " ^ cname)
|
haftmann@22921
|
359 |
else case AList.lookup (op =) consts (cname, T) of
|
haftmann@22921
|
360 |
NONE => CodegenData.put {codegens = codegens,
|
haftmann@22921
|
361 |
tycodegens = tycodegens,
|
haftmann@22921
|
362 |
consts = ((cname, T), syn) :: consts,
|
haftmann@24219
|
363 |
types = types, preprocs = preprocs,
|
haftmann@22921
|
364 |
modules = modules, test_params = test_params} thy
|
haftmann@22921
|
365 |
| SOME _ => error ("Constant " ^ cname ^ " already associated with code")
|
haftmann@22921
|
366 |
end;
|
berghofe@11520
|
367 |
|
haftmann@22921
|
368 |
val assoc_const_i = gen_assoc_const (K I);
|
haftmann@24219
|
369 |
val assoc_const = gen_assoc_const CodeUnit.read_bare_const;
|
berghofe@11520
|
370 |
|
wenzelm@15801
|
371 |
|
berghofe@11520
|
372 |
(**** associate types with target language types ****)
|
berghofe@11520
|
373 |
|
haftmann@22921
|
374 |
fun assoc_type (s, syn) thy =
|
berghofe@11520
|
375 |
let
|
haftmann@24219
|
376 |
val {codegens, tycodegens, consts, types, preprocs, modules, test_params} =
|
berghofe@14105
|
377 |
CodegenData.get thy;
|
haftmann@22921
|
378 |
val tc = Sign.intern_type thy s;
|
berghofe@11520
|
379 |
in
|
berghofe@18320
|
380 |
case Symtab.lookup (snd (#types (Type.rep_tsig (Sign.tsig_of thy)))) tc of
|
berghofe@18320
|
381 |
SOME (Type.LogicalType i, _) =>
|
berghofe@18320
|
382 |
if num_args_of (fst syn) > i then
|
berghofe@18320
|
383 |
error ("More arguments than corresponding type constructor " ^ s)
|
berghofe@18320
|
384 |
else (case AList.lookup (op =) types tc of
|
berghofe@18320
|
385 |
NONE => CodegenData.put {codegens = codegens,
|
berghofe@18320
|
386 |
tycodegens = tycodegens, consts = consts,
|
haftmann@24219
|
387 |
types = (tc, syn) :: types,
|
berghofe@18320
|
388 |
preprocs = preprocs, modules = modules, test_params = test_params} thy
|
berghofe@18320
|
389 |
| SOME _ => error ("Type " ^ tc ^ " already associated with code"))
|
berghofe@18320
|
390 |
| _ => error ("Not a type constructor: " ^ s)
|
haftmann@22921
|
391 |
end;
|
berghofe@11520
|
392 |
|
haftmann@21098
|
393 |
fun get_assoc_type thy = AList.lookup (op =) ((#types o CodegenData.get) thy);
|
wenzelm@11546
|
394 |
|
berghofe@11520
|
395 |
|
berghofe@11520
|
396 |
(**** make valid ML identifiers ****)
|
berghofe@11520
|
397 |
|
berghofe@14858
|
398 |
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
|
berghofe@14858
|
399 |
Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
|
berghofe@14858
|
400 |
|
berghofe@14858
|
401 |
fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of
|
berghofe@14858
|
402 |
("<" :: "^" :: xs, ">") => (true, implode xs)
|
berghofe@14858
|
403 |
| ("<" :: xs, ">") => (false, implode xs)
|
berghofe@14858
|
404 |
| _ => sys_error "dest_sym");
|
wenzelm@16458
|
405 |
|
berghofe@14858
|
406 |
fun mk_id s = if s = "" then "" else
|
berghofe@11520
|
407 |
let
|
berghofe@14858
|
408 |
fun check_str [] = []
|
berghofe@14858
|
409 |
| check_str xs = (case take_prefix is_ascii_letdig xs of
|
berghofe@14858
|
410 |
([], " " :: zs) => check_str zs
|
berghofe@14858
|
411 |
| ([], z :: zs) =>
|
berghofe@14858
|
412 |
if size z = 1 then string_of_int (ord z) :: check_str zs
|
berghofe@14858
|
413 |
else (case dest_sym z of
|
berghofe@14858
|
414 |
(true, "isub") => check_str zs
|
berghofe@14858
|
415 |
| (true, "isup") => "" :: check_str zs
|
berghofe@14858
|
416 |
| (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
|
berghofe@14858
|
417 |
| (ys, zs) => implode ys :: check_str zs);
|
wenzelm@21858
|
418 |
val s' = space_implode "_" (maps (check_str o Symbol.explode) (NameSpace.explode s))
|
berghofe@11520
|
419 |
in
|
berghofe@14858
|
420 |
if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
|
berghofe@11520
|
421 |
end;
|
berghofe@11520
|
422 |
|
berghofe@17144
|
423 |
fun mk_long_id (p as (tab, used)) module s =
|
berghofe@16649
|
424 |
let
|
berghofe@17144
|
425 |
fun find_name [] = sys_error "mk_long_id"
|
berghofe@17144
|
426 |
| find_name (ys :: yss) =
|
berghofe@17144
|
427 |
let
|
wenzelm@21858
|
428 |
val s' = NameSpace.implode ys
|
berghofe@17144
|
429 |
val s'' = NameSpace.append module s'
|
wenzelm@17412
|
430 |
in case Symtab.lookup used s'' of
|
wenzelm@17261
|
431 |
NONE => ((module, s'),
|
wenzelm@17412
|
432 |
(Symtab.update_new (s, (module, s')) tab,
|
wenzelm@17412
|
433 |
Symtab.update_new (s'', ()) used))
|
berghofe@17144
|
434 |
| SOME _ => find_name yss
|
berghofe@17144
|
435 |
end
|
wenzelm@17412
|
436 |
in case Symtab.lookup tab s of
|
wenzelm@21858
|
437 |
NONE => find_name (Library.suffixes1 (NameSpace.explode s))
|
berghofe@17144
|
438 |
| SOME name => (name, p)
|
berghofe@16649
|
439 |
end;
|
berghofe@13073
|
440 |
|
berghofe@17144
|
441 |
(* module: module name for caller *)
|
berghofe@17144
|
442 |
(* module': module name for callee *)
|
berghofe@17144
|
443 |
(* if caller and callee reside in different modules, use qualified access *)
|
berghofe@16649
|
444 |
|
berghofe@17144
|
445 |
fun mk_qual_id module (module', s) =
|
berghofe@17144
|
446 |
if module = module' orelse module' = "" then s else module' ^ "." ^ s;
|
berghofe@17144
|
447 |
|
berghofe@17144
|
448 |
fun mk_const_id module cname (gr, (tab1, tab2)) =
|
berghofe@16649
|
449 |
let
|
berghofe@17144
|
450 |
val ((module, s), tab1') = mk_long_id tab1 module cname
|
berghofe@17144
|
451 |
val s' = mk_id s;
|
wenzelm@21478
|
452 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
|
berghofe@17144
|
453 |
in ((gr, (tab1', tab2)), (module, s'')) end;
|
berghofe@16649
|
454 |
|
berghofe@17144
|
455 |
fun get_const_id cname (gr, (tab1, tab2)) =
|
wenzelm@17412
|
456 |
case Symtab.lookup (fst tab1) cname of
|
berghofe@17144
|
457 |
NONE => error ("get_const_id: no such constant: " ^ quote cname)
|
berghofe@17144
|
458 |
| SOME (module, s) =>
|
berghofe@17144
|
459 |
let
|
berghofe@17144
|
460 |
val s' = mk_id s;
|
wenzelm@21478
|
461 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
|
berghofe@17144
|
462 |
in (module, s'') end;
|
berghofe@17144
|
463 |
|
berghofe@17144
|
464 |
fun mk_type_id module tyname (gr, (tab1, tab2)) =
|
berghofe@16649
|
465 |
let
|
berghofe@17144
|
466 |
val ((module, s), tab2') = mk_long_id tab2 module tyname
|
berghofe@17144
|
467 |
val s' = mk_id s;
|
wenzelm@21478
|
468 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
|
berghofe@17144
|
469 |
in ((gr, (tab1, tab2')), (module, s'')) end;
|
berghofe@16649
|
470 |
|
berghofe@17144
|
471 |
fun get_type_id tyname (gr, (tab1, tab2)) =
|
wenzelm@17412
|
472 |
case Symtab.lookup (fst tab2) tyname of
|
berghofe@17144
|
473 |
NONE => error ("get_type_id: no such type: " ^ quote tyname)
|
berghofe@17144
|
474 |
| SOME (module, s) =>
|
berghofe@17144
|
475 |
let
|
berghofe@17144
|
476 |
val s' = mk_id s;
|
wenzelm@21478
|
477 |
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
|
berghofe@17144
|
478 |
in (module, s'') end;
|
berghofe@17144
|
479 |
|
berghofe@17144
|
480 |
fun get_type_id' f tyname tab = apsnd f (get_type_id tyname tab);
|
berghofe@17144
|
481 |
|
berghofe@17144
|
482 |
fun get_node (gr, x) k = Graph.get_node gr k;
|
berghofe@17144
|
483 |
fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
|
berghofe@17144
|
484 |
fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
|
berghofe@17144
|
485 |
fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
|
berghofe@17144
|
486 |
fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
|
berghofe@17144
|
487 |
fun new_node p (gr, x) = (Graph.new_node p gr, x);
|
berghofe@16649
|
488 |
|
haftmann@18281
|
489 |
fun theory_of_type s thy =
|
berghofe@16649
|
490 |
if Sign.declared_tyname thy s
|
wenzelm@19473
|
491 |
then SOME (the_default thy (get_first (theory_of_type s) (Theory.parents_of thy)))
|
berghofe@16649
|
492 |
else NONE;
|
berghofe@16649
|
493 |
|
haftmann@18281
|
494 |
fun theory_of_const s thy =
|
berghofe@16649
|
495 |
if Sign.declared_const thy s
|
wenzelm@19473
|
496 |
then SOME (the_default thy (get_first (theory_of_const s) (Theory.parents_of thy)))
|
berghofe@16649
|
497 |
else NONE;
|
berghofe@16649
|
498 |
|
berghofe@16649
|
499 |
fun thyname_of_type s thy = (case theory_of_type s thy of
|
berghofe@16649
|
500 |
NONE => error ("thyname_of_type: no such type: " ^ quote s)
|
berghofe@16649
|
501 |
| SOME thy' => Context.theory_name thy');
|
berghofe@16649
|
502 |
|
berghofe@16649
|
503 |
fun thyname_of_const s thy = (case theory_of_const s thy of
|
berghofe@16649
|
504 |
NONE => error ("thyname_of_const: no such constant: " ^ quote s)
|
berghofe@16649
|
505 |
| SOME thy' => Context.theory_name thy');
|
berghofe@11520
|
506 |
|
berghofe@13731
|
507 |
fun rename_terms ts =
|
berghofe@11520
|
508 |
let
|
wenzelm@23178
|
509 |
val names = List.foldr add_term_names
|
wenzelm@20286
|
510 |
(map (fst o fst) (rev (fold Term.add_vars ts []))) ts;
|
wenzelm@21478
|
511 |
val reserved = filter ML_Syntax.is_reserved names;
|
wenzelm@19482
|
512 |
val (illegal, alt_names) = split_list (map_filter (fn s =>
|
skalberg@15531
|
513 |
let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
|
berghofe@14858
|
514 |
val ps = (reserved @ illegal) ~~
|
wenzelm@20071
|
515 |
Name.variant_list names (map (suffix "'") reserved @ alt_names);
|
berghofe@11520
|
516 |
|
haftmann@17521
|
517 |
fun rename_id s = AList.lookup (op =) ps s |> the_default s;
|
berghofe@14858
|
518 |
|
berghofe@14858
|
519 |
fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
|
berghofe@14858
|
520 |
| rename (Free (a, T)) = Free (rename_id a, T)
|
berghofe@11520
|
521 |
| rename (Abs (s, T, t)) = Abs (s, T, rename t)
|
berghofe@11520
|
522 |
| rename (t $ u) = rename t $ rename u
|
berghofe@11520
|
523 |
| rename t = t;
|
berghofe@11520
|
524 |
in
|
berghofe@13731
|
525 |
map rename ts
|
berghofe@13731
|
526 |
end;
|
berghofe@13731
|
527 |
|
berghofe@13731
|
528 |
val rename_term = hd o rename_terms o single;
|
berghofe@13731
|
529 |
|
berghofe@13731
|
530 |
|
berghofe@13731
|
531 |
(**** retrieve definition of constant ****)
|
berghofe@13731
|
532 |
|
wenzelm@24908
|
533 |
fun is_instance T1 T2 =
|
wenzelm@24908
|
534 |
Type.raw_instance (T1, Logic.legacy_varifyT T2);
|
berghofe@13731
|
535 |
|
haftmann@22921
|
536 |
fun get_assoc_code thy (s, T) = Option.map snd (find_first (fn ((s', T'), _) =>
|
wenzelm@24908
|
537 |
s = s' andalso is_instance T T') (#consts (CodegenData.get thy)));
|
berghofe@13731
|
538 |
|
wenzelm@19482
|
539 |
fun get_aux_code xs = map_filter (fn (m, code) =>
|
wenzelm@20665
|
540 |
if m = "" orelse member (op =) (!mode) m then SOME code else NONE) xs;
|
berghofe@16769
|
541 |
|
berghofe@16649
|
542 |
fun mk_deftab thy =
|
berghofe@13731
|
543 |
let
|
wenzelm@22680
|
544 |
val axmss = map (fn thy' => (Context.theory_name thy', Theory.axiom_table thy'))
|
berghofe@16649
|
545 |
(thy :: Theory.ancestors_of thy);
|
berghofe@15261
|
546 |
fun prep_def def = (case preprocess thy [def] of
|
berghofe@16649
|
547 |
[def'] => prop_of def' | _ => error "mk_deftab: bad preprocessor");
|
berghofe@15261
|
548 |
fun dest t =
|
berghofe@15261
|
549 |
let
|
berghofe@15261
|
550 |
val (lhs, rhs) = Logic.dest_equals t;
|
berghofe@15261
|
551 |
val (c, args) = strip_comb lhs;
|
berghofe@16649
|
552 |
val (s, T) = dest_Const c
|
berghofe@16649
|
553 |
in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
|
skalberg@15531
|
554 |
end handle TERM _ => NONE;
|
haftmann@21056
|
555 |
fun add_def thyname (name, t) = (case dest t of
|
haftmann@21056
|
556 |
NONE => I
|
wenzelm@24908
|
557 |
| SOME _ => (case dest (prep_def (Thm.get_axiom_i thy name)) of
|
haftmann@21056
|
558 |
NONE => I
|
haftmann@21056
|
559 |
| SOME (s, (T, (args, rhs))) => Symtab.map_default (s, [])
|
haftmann@21056
|
560 |
(cons (T, (thyname, split_last (rename_terms (args @ [rhs])))))))
|
berghofe@13731
|
561 |
in
|
haftmann@21056
|
562 |
fold (fn (thyname, axms) => Symtab.fold (add_def thyname) axms) axmss Symtab.empty
|
berghofe@11520
|
563 |
end;
|
berghofe@11520
|
564 |
|
wenzelm@17412
|
565 |
fun get_defn thy defs s T = (case Symtab.lookup defs s of
|
berghofe@16649
|
566 |
NONE => NONE
|
berghofe@16649
|
567 |
| SOME ds =>
|
wenzelm@24908
|
568 |
let val i = find_index (is_instance T o fst) ds
|
berghofe@16649
|
569 |
in if i >= 0 then
|
berghofe@16649
|
570 |
SOME (List.nth (ds, i), if length ds = 1 then NONE else SOME i)
|
berghofe@16649
|
571 |
else NONE
|
berghofe@16649
|
572 |
end);
|
berghofe@16649
|
573 |
|
berghofe@11520
|
574 |
|
berghofe@12452
|
575 |
(**** invoke suitable code generator for term / type ****)
|
berghofe@11520
|
576 |
|
berghofe@17144
|
577 |
fun codegen_error (gr, _) dep s =
|
berghofe@17144
|
578 |
error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
|
berghofe@17144
|
579 |
|
berghofe@17144
|
580 |
fun invoke_codegen thy defs dep module brack (gr, t) = (case get_first
|
berghofe@17144
|
581 |
(fn (_, f) => f thy defs gr dep module brack t) (#codegens (CodegenData.get thy)) of
|
berghofe@17144
|
582 |
NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
|
berghofe@17144
|
583 |
Sign.string_of_term thy t)
|
skalberg@15531
|
584 |
| SOME x => x);
|
berghofe@12452
|
585 |
|
berghofe@17144
|
586 |
fun invoke_tycodegen thy defs dep module brack (gr, T) = (case get_first
|
berghofe@17144
|
587 |
(fn (_, f) => f thy defs gr dep module brack T) (#tycodegens (CodegenData.get thy)) of
|
berghofe@17144
|
588 |
NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
|
berghofe@17144
|
589 |
Sign.string_of_typ thy T)
|
skalberg@15531
|
590 |
| SOME x => x);
|
berghofe@11520
|
591 |
|
berghofe@11520
|
592 |
|
berghofe@11520
|
593 |
(**** code generator for mixfix expressions ****)
|
berghofe@11520
|
594 |
|
berghofe@11520
|
595 |
fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"];
|
berghofe@11520
|
596 |
|
berghofe@11520
|
597 |
fun pretty_fn [] p = [p]
|
berghofe@11520
|
598 |
| pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") ::
|
berghofe@11520
|
599 |
Pretty.brk 1 :: pretty_fn xs p;
|
berghofe@11520
|
600 |
|
berghofe@16769
|
601 |
fun pretty_mixfix _ _ [] [] _ = []
|
berghofe@16769
|
602 |
| pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
|
berghofe@16769
|
603 |
p :: pretty_mixfix module module' ms ps qs
|
berghofe@16769
|
604 |
| pretty_mixfix module module' (Ignore :: ms) ps qs =
|
berghofe@16769
|
605 |
pretty_mixfix module module' ms ps qs
|
berghofe@16769
|
606 |
| pretty_mixfix module module' (Module :: ms) ps qs =
|
berghofe@17144
|
607 |
(if module <> module'
|
berghofe@16769
|
608 |
then cons (Pretty.str (module' ^ ".")) else I)
|
berghofe@16769
|
609 |
(pretty_mixfix module module' ms ps qs)
|
berghofe@16769
|
610 |
| pretty_mixfix module module' (Pretty p :: ms) ps qs =
|
berghofe@16769
|
611 |
p :: pretty_mixfix module module' ms ps qs
|
berghofe@16769
|
612 |
| pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
|
berghofe@16769
|
613 |
q :: pretty_mixfix module module' ms ps qs;
|
berghofe@11520
|
614 |
|
haftmann@18102
|
615 |
fun replace_quotes [] [] = []
|
haftmann@18102
|
616 |
| replace_quotes xs (Arg :: ms) =
|
haftmann@18102
|
617 |
Arg :: replace_quotes xs ms
|
haftmann@18102
|
618 |
| replace_quotes xs (Ignore :: ms) =
|
haftmann@18102
|
619 |
Ignore :: replace_quotes xs ms
|
haftmann@18102
|
620 |
| replace_quotes xs (Module :: ms) =
|
haftmann@18102
|
621 |
Module :: replace_quotes xs ms
|
haftmann@18102
|
622 |
| replace_quotes xs (Pretty p :: ms) =
|
haftmann@18102
|
623 |
Pretty p :: replace_quotes xs ms
|
haftmann@18102
|
624 |
| replace_quotes (x::xs) (Quote _ :: ms) =
|
haftmann@18102
|
625 |
Quote x :: replace_quotes xs ms;
|
haftmann@18102
|
626 |
|
berghofe@11520
|
627 |
|
berghofe@12452
|
628 |
(**** default code generators ****)
|
berghofe@11520
|
629 |
|
berghofe@11520
|
630 |
fun eta_expand t ts i =
|
berghofe@11520
|
631 |
let
|
berghofe@24456
|
632 |
val k = length ts;
|
berghofe@24456
|
633 |
val Ts = Library.drop (k, binder_types (fastype_of t));
|
berghofe@24456
|
634 |
val j = i - k
|
berghofe@11520
|
635 |
in
|
wenzelm@23178
|
636 |
List.foldr (fn (T, t) => Abs ("x", T, t))
|
skalberg@15574
|
637 |
(list_comb (t, ts @ map Bound (j-1 downto 0))) (Library.take (j, Ts))
|
berghofe@11520
|
638 |
end;
|
berghofe@11520
|
639 |
|
berghofe@11520
|
640 |
fun mk_app _ p [] = p
|
berghofe@11520
|
641 |
| mk_app brack p ps = if brack then
|
berghofe@11520
|
642 |
Pretty.block (Pretty.str "(" ::
|
berghofe@11520
|
643 |
separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"])
|
berghofe@11520
|
644 |
else Pretty.block (separate (Pretty.brk 1) (p :: ps));
|
berghofe@11520
|
645 |
|
wenzelm@20071
|
646 |
fun new_names t xs = Name.variant_list
|
wenzelm@20071
|
647 |
(map (fst o fst o dest_Var) (term_vars t) union
|
wenzelm@21719
|
648 |
add_term_names (t, ML_Syntax.reserved_names)) (map mk_id xs);
|
berghofe@11520
|
649 |
|
berghofe@11520
|
650 |
fun new_name t x = hd (new_names t [x]);
|
berghofe@11520
|
651 |
|
wenzelm@20665
|
652 |
fun if_library x y = if member (op =) (!mode) "library" then x else y;
|
berghofe@17144
|
653 |
|
berghofe@17144
|
654 |
fun default_codegen thy defs gr dep module brack t =
|
berghofe@11520
|
655 |
let
|
berghofe@11520
|
656 |
val (u, ts) = strip_comb t;
|
berghofe@17144
|
657 |
fun codegens brack = foldl_map (invoke_codegen thy defs dep module brack)
|
berghofe@11520
|
658 |
in (case u of
|
berghofe@14105
|
659 |
Var ((s, i), T) =>
|
berghofe@14105
|
660 |
let
|
berghofe@14105
|
661 |
val (gr', ps) = codegens true (gr, ts);
|
berghofe@17144
|
662 |
val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
|
skalberg@15531
|
663 |
in SOME (gr'', mk_app brack (Pretty.str (s ^
|
berghofe@11520
|
664 |
(if i=0 then "" else string_of_int i))) ps)
|
berghofe@11520
|
665 |
end
|
berghofe@11520
|
666 |
|
berghofe@14105
|
667 |
| Free (s, T) =>
|
berghofe@14105
|
668 |
let
|
berghofe@14105
|
669 |
val (gr', ps) = codegens true (gr, ts);
|
berghofe@17144
|
670 |
val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
|
skalberg@15531
|
671 |
in SOME (gr'', mk_app brack (Pretty.str s) ps) end
|
berghofe@11520
|
672 |
|
berghofe@11520
|
673 |
| Const (s, T) =>
|
haftmann@22921
|
674 |
(case get_assoc_code thy (s, T) of
|
berghofe@16769
|
675 |
SOME (ms, aux) =>
|
haftmann@18281
|
676 |
let val i = num_args_of ms
|
berghofe@11520
|
677 |
in if length ts < i then
|
berghofe@17144
|
678 |
default_codegen thy defs gr dep module brack (eta_expand u ts i)
|
berghofe@11520
|
679 |
else
|
berghofe@11520
|
680 |
let
|
berghofe@12452
|
681 |
val (ts1, ts2) = args_of ms ts;
|
berghofe@12452
|
682 |
val (gr1, ps1) = codegens false (gr, ts1);
|
berghofe@12452
|
683 |
val (gr2, ps2) = codegens true (gr1, ts2);
|
berghofe@12452
|
684 |
val (gr3, ps3) = codegens false (gr2, quotes_of ms);
|
berghofe@17549
|
685 |
val (gr4, _) = invoke_tycodegen thy defs dep module false
|
berghofe@17549
|
686 |
(gr3, funpow (length ts) (hd o tl o snd o dest_Type) T);
|
berghofe@17144
|
687 |
val (module', suffix) = (case get_defn thy defs s T of
|
berghofe@17144
|
688 |
NONE => (if_library (thyname_of_const s thy) module, "")
|
berghofe@17144
|
689 |
| SOME ((U, (module', _)), NONE) =>
|
berghofe@17144
|
690 |
(if_library module' module, "")
|
berghofe@17144
|
691 |
| SOME ((U, (module', _)), SOME i) =>
|
berghofe@17144
|
692 |
(if_library module' module, " def" ^ string_of_int i));
|
berghofe@16769
|
693 |
val node_id = s ^ suffix;
|
berghofe@17144
|
694 |
fun p module' = mk_app brack (Pretty.block
|
berghofe@17144
|
695 |
(pretty_mixfix module module' ms ps1 ps3)) ps2
|
berghofe@17549
|
696 |
in SOME (case try (get_node gr4) node_id of
|
berghofe@16769
|
697 |
NONE => (case get_aux_code aux of
|
berghofe@17549
|
698 |
[] => (gr4, p module)
|
berghofe@17144
|
699 |
| xs => (add_edge (node_id, dep) (new_node
|
berghofe@17549
|
700 |
(node_id, (NONE, module', space_implode "\n" xs ^ "\n")) gr4),
|
berghofe@17144
|
701 |
p module'))
|
berghofe@17144
|
702 |
| SOME (_, module'', _) =>
|
berghofe@17549
|
703 |
(add_edge (node_id, dep) gr4, p module''))
|
berghofe@11520
|
704 |
end
|
berghofe@11520
|
705 |
end
|
berghofe@16649
|
706 |
| NONE => (case get_defn thy defs s T of
|
skalberg@15531
|
707 |
NONE => NONE
|
berghofe@17144
|
708 |
| SOME ((U, (thyname, (args, rhs))), k) =>
|
berghofe@11520
|
709 |
let
|
berghofe@17144
|
710 |
val module' = if_library thyname module;
|
berghofe@17144
|
711 |
val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
|
berghofe@16649
|
712 |
val node_id = s ^ suffix;
|
berghofe@17144
|
713 |
val (gr', (ps, def_id)) = codegens true (gr, ts) |>>>
|
berghofe@17144
|
714 |
mk_const_id module' (s ^ suffix);
|
berghofe@17144
|
715 |
val p = mk_app brack (Pretty.str (mk_qual_id module def_id)) ps
|
berghofe@17144
|
716 |
in SOME (case try (get_node gr') node_id of
|
berghofe@17144
|
717 |
NONE =>
|
berghofe@17144
|
718 |
let
|
berghofe@17144
|
719 |
val _ = message ("expanding definition of " ^ s);
|
berghofe@18788
|
720 |
val (Ts, _) = strip_type U;
|
berghofe@17144
|
721 |
val (args', rhs') =
|
berghofe@17144
|
722 |
if not (null args) orelse null Ts then (args, rhs) else
|
berghofe@17144
|
723 |
let val v = Free (new_name rhs "x", hd Ts)
|
berghofe@17144
|
724 |
in ([v], betapply (rhs, v)) end;
|
berghofe@17144
|
725 |
val (gr1, p') = invoke_codegen thy defs node_id module' false
|
berghofe@17144
|
726 |
(add_edge (node_id, dep)
|
berghofe@17144
|
727 |
(new_node (node_id, (NONE, "", "")) gr'), rhs');
|
berghofe@17144
|
728 |
val (gr2, xs) = codegens false (gr1, args');
|
berghofe@17144
|
729 |
val (gr3, _) = invoke_tycodegen thy defs dep module false (gr2, T);
|
berghofe@17144
|
730 |
val (gr4, ty) = invoke_tycodegen thy defs node_id module' false (gr3, U);
|
berghofe@17144
|
731 |
in (map_node node_id (K (NONE, module', Pretty.string_of
|
berghofe@17144
|
732 |
(Pretty.block (separate (Pretty.brk 1)
|
berghofe@17144
|
733 |
(if null args' then
|
berghofe@17144
|
734 |
[Pretty.str ("val " ^ snd def_id ^ " :"), ty]
|
berghofe@17144
|
735 |
else Pretty.str ("fun " ^ snd def_id) :: xs) @
|
berghofe@17144
|
736 |
[Pretty.str " =", Pretty.brk 1, p', Pretty.str ";"])) ^ "\n\n")) gr4,
|
berghofe@17144
|
737 |
p)
|
berghofe@17144
|
738 |
end
|
berghofe@17144
|
739 |
| SOME _ => (add_edge (node_id, dep) gr', p))
|
berghofe@11520
|
740 |
end))
|
berghofe@11520
|
741 |
|
berghofe@11520
|
742 |
| Abs _ =>
|
berghofe@11520
|
743 |
let
|
berghofe@11520
|
744 |
val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
|
berghofe@11520
|
745 |
val t = strip_abs_body u
|
berghofe@11520
|
746 |
val bs' = new_names t bs;
|
berghofe@12452
|
747 |
val (gr1, ps) = codegens true (gr, ts);
|
berghofe@17144
|
748 |
val (gr2, p) = invoke_codegen thy defs dep module false
|
berghofe@12452
|
749 |
(gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t));
|
berghofe@11520
|
750 |
in
|
skalberg@15531
|
751 |
SOME (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @
|
berghofe@11520
|
752 |
[Pretty.str ")"])) ps)
|
berghofe@11520
|
753 |
end
|
berghofe@11520
|
754 |
|
skalberg@15531
|
755 |
| _ => NONE)
|
berghofe@11520
|
756 |
end;
|
berghofe@11520
|
757 |
|
berghofe@17144
|
758 |
fun default_tycodegen thy defs gr dep module brack (TVar ((s, i), _)) =
|
skalberg@15531
|
759 |
SOME (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i)))
|
berghofe@17144
|
760 |
| default_tycodegen thy defs gr dep module brack (TFree (s, _)) =
|
berghofe@16649
|
761 |
SOME (gr, Pretty.str s)
|
berghofe@17144
|
762 |
| default_tycodegen thy defs gr dep module brack (Type (s, Ts)) =
|
haftmann@17521
|
763 |
(case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
|
skalberg@15531
|
764 |
NONE => NONE
|
berghofe@16769
|
765 |
| SOME (ms, aux) =>
|
berghofe@12452
|
766 |
let
|
berghofe@12452
|
767 |
val (gr', ps) = foldl_map
|
berghofe@17144
|
768 |
(invoke_tycodegen thy defs dep module false)
|
berghofe@16649
|
769 |
(gr, fst (args_of ms Ts));
|
berghofe@12452
|
770 |
val (gr'', qs) = foldl_map
|
berghofe@17144
|
771 |
(invoke_tycodegen thy defs dep module false)
|
berghofe@16769
|
772 |
(gr', quotes_of ms);
|
berghofe@17144
|
773 |
val module' = if_library (thyname_of_type s thy) module;
|
berghofe@16769
|
774 |
val node_id = s ^ " (type)";
|
berghofe@17144
|
775 |
fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
|
berghofe@17144
|
776 |
in SOME (case try (get_node gr'') node_id of
|
berghofe@16769
|
777 |
NONE => (case get_aux_code aux of
|
berghofe@17144
|
778 |
[] => (gr'', p module')
|
berghofe@17144
|
779 |
| xs => (fst (mk_type_id module' s
|
berghofe@17144
|
780 |
(add_edge (node_id, dep) (new_node (node_id,
|
berghofe@17144
|
781 |
(NONE, module', space_implode "\n" xs ^ "\n")) gr''))),
|
berghofe@17144
|
782 |
p module'))
|
berghofe@17144
|
783 |
| SOME (_, module'', _) =>
|
berghofe@17144
|
784 |
(add_edge (node_id, dep) gr'', p module''))
|
berghofe@16769
|
785 |
end);
|
berghofe@12452
|
786 |
|
berghofe@24456
|
787 |
val _ = Context.add_setup
|
berghofe@24456
|
788 |
(add_codegen "default" default_codegen #>
|
berghofe@24456
|
789 |
add_tycodegen "default" default_tycodegen);
|
berghofe@24456
|
790 |
|
berghofe@24456
|
791 |
|
berghofe@16649
|
792 |
fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
|
berghofe@16649
|
793 |
|
haftmann@17521
|
794 |
fun add_to_module name s = AList.map_entry (op =) name (suffix s);
|
berghofe@16649
|
795 |
|
berghofe@17144
|
796 |
fun output_code gr module xs =
|
berghofe@16649
|
797 |
let
|
wenzelm@19482
|
798 |
val code = map_filter (fn s =>
|
berghofe@17144
|
799 |
let val c as (_, module', _) = Graph.get_node gr s
|
berghofe@17144
|
800 |
in if module = "" orelse module = module' then SOME (s, c) else NONE end)
|
berghofe@17144
|
801 |
(rev (Graph.all_preds gr xs));
|
berghofe@16649
|
802 |
fun string_of_cycle (a :: b :: cs) =
|
berghofe@16649
|
803 |
let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
|
berghofe@16649
|
804 |
if a = a' then Option.map (pair x)
|
haftmann@21056
|
805 |
(find_first (equal b o #2 o Graph.get_node gr)
|
berghofe@16649
|
806 |
(Graph.imm_succs gr x))
|
berghofe@16649
|
807 |
else NONE) code
|
berghofe@16649
|
808 |
in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
|
berghofe@16649
|
809 |
| string_of_cycle _ = ""
|
berghofe@16649
|
810 |
in
|
berghofe@17144
|
811 |
if module = "" then
|
berghofe@16649
|
812 |
let
|
wenzelm@19046
|
813 |
val modules = distinct (op =) (map (#2 o snd) code);
|
wenzelm@23178
|
814 |
val mod_gr = fold_rev Graph.add_edge_acyclic
|
wenzelm@19482
|
815 |
(maps (fn (s, (_, module, _)) => map (pair module)
|
berghofe@17144
|
816 |
(filter_out (equal module) (map (#2 o Graph.get_node gr)
|
wenzelm@23178
|
817 |
(Graph.imm_succs gr s)))) code)
|
wenzelm@23178
|
818 |
(fold_rev (Graph.new_node o rpair ()) modules Graph.empty);
|
berghofe@16649
|
819 |
val modules' =
|
berghofe@16649
|
820 |
rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
|
berghofe@16649
|
821 |
in
|
wenzelm@23178
|
822 |
List.foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
|
berghofe@16649
|
823 |
(map (rpair "") modules') code
|
berghofe@16649
|
824 |
end handle Graph.CYCLES (cs :: _) =>
|
berghofe@16649
|
825 |
error ("Cyclic dependency of modules:\n" ^ commas cs ^
|
berghofe@16649
|
826 |
"\n" ^ string_of_cycle cs)
|
berghofe@17144
|
827 |
else [(module, implode (map (#3 o snd) code))]
|
berghofe@16649
|
828 |
end;
|
berghofe@11520
|
829 |
|
berghofe@17144
|
830 |
fun gen_generate_code prep_term thy modules module =
|
wenzelm@24634
|
831 |
PrintMode.setmp [] (Pretty.setmp_margin (!margin) (fn xs =>
|
berghofe@11520
|
832 |
let
|
wenzelm@21858
|
833 |
val _ = (module <> "" orelse
|
wenzelm@20665
|
834 |
member (op =) (!mode) "library" andalso forall (equal "" o fst) xs)
|
wenzelm@21858
|
835 |
orelse error "missing module name";
|
berghofe@17144
|
836 |
val graphs = get_modules thy;
|
berghofe@16649
|
837 |
val defs = mk_deftab thy;
|
berghofe@17144
|
838 |
val gr = new_node ("<Top>", (NONE, module, ""))
|
wenzelm@23178
|
839 |
(List.foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
|
berghofe@17144
|
840 |
(Graph.merge (fn ((_, module, _), (_, module', _)) =>
|
berghofe@17144
|
841 |
module = module') (gr, gr'),
|
berghofe@17144
|
842 |
(merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
|
wenzelm@17412
|
843 |
(map (fn s => case Symtab.lookup graphs s of
|
berghofe@17144
|
844 |
NONE => error ("Undefined code module: " ^ s)
|
berghofe@17144
|
845 |
| SOME gr => gr) modules))
|
wenzelm@23655
|
846 |
handle Graph.DUP k => error ("Duplicate code for " ^ k);
|
berghofe@16649
|
847 |
fun expand (t as Abs _) = t
|
berghofe@16649
|
848 |
| expand t = (case fastype_of t of
|
berghofe@16649
|
849 |
Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
|
berghofe@11520
|
850 |
val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s)
|
berghofe@17144
|
851 |
(invoke_codegen thy defs "<Top>" module false (gr, t)))
|
berghofe@17549
|
852 |
(gr, map (apsnd (expand o preprocess_term thy o prep_term thy)) xs);
|
wenzelm@19482
|
853 |
val code = map_filter
|
berghofe@17144
|
854 |
(fn ("", _) => NONE
|
berghofe@17144
|
855 |
| (s', p) => SOME (Pretty.string_of (Pretty.block
|
berghofe@17144
|
856 |
[Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"]))) ps;
|
berghofe@17144
|
857 |
val code' = space_implode "\n\n" code ^ "\n\n";
|
berghofe@17144
|
858 |
val code'' =
|
wenzelm@19482
|
859 |
map_filter (fn (name, s) =>
|
wenzelm@20665
|
860 |
if member (op =) (!mode) "library" andalso name = module andalso null code
|
berghofe@17144
|
861 |
then NONE
|
berghofe@17144
|
862 |
else SOME (name, mk_struct name s))
|
berghofe@17144
|
863 |
((if null code then I
|
berghofe@17144
|
864 |
else add_to_module module code')
|
berghofe@17144
|
865 |
(output_code (fst gr') (if_library "" module) ["<Top>"]))
|
berghofe@16649
|
866 |
in
|
berghofe@17144
|
867 |
(code'', del_nodes ["<Top>"] gr')
|
berghofe@16649
|
868 |
end));
|
berghofe@11520
|
869 |
|
wenzelm@22680
|
870 |
val generate_code_i = gen_generate_code Sign.cert_term;
|
wenzelm@22680
|
871 |
val generate_code = gen_generate_code Sign.read_term;
|
berghofe@11520
|
872 |
|
berghofe@12452
|
873 |
|
berghofe@13753
|
874 |
(**** Reflection ****)
|
berghofe@13753
|
875 |
|
berghofe@13753
|
876 |
val strip_tname = implode o tl o explode;
|
berghofe@13753
|
877 |
|
berghofe@13753
|
878 |
fun pretty_list xs = Pretty.block (Pretty.str "[" ::
|
wenzelm@19482
|
879 |
flat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
|
berghofe@13753
|
880 |
[Pretty.str "]"]);
|
berghofe@13753
|
881 |
|
berghofe@13753
|
882 |
fun mk_type p (TVar ((s, i), _)) = Pretty.str
|
berghofe@13753
|
883 |
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
|
berghofe@13753
|
884 |
| mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T")
|
berghofe@13753
|
885 |
| mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
|
berghofe@13753
|
886 |
[Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","),
|
berghofe@13753
|
887 |
Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]);
|
berghofe@13753
|
888 |
|
berghofe@17144
|
889 |
fun mk_term_of gr module p (TVar ((s, i), _)) = Pretty.str
|
berghofe@13753
|
890 |
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
|
berghofe@17144
|
891 |
| mk_term_of gr module p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F")
|
berghofe@17144
|
892 |
| mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
|
berghofe@16649
|
893 |
(Pretty.block (separate (Pretty.brk 1)
|
berghofe@17144
|
894 |
(Pretty.str (mk_qual_id module
|
berghofe@17144
|
895 |
(get_type_id' (fn s' => "term_of_" ^ s') s gr)) ::
|
wenzelm@19482
|
896 |
maps (fn T =>
|
wenzelm@19482
|
897 |
[mk_term_of gr module true T, mk_type true T]) Ts)));
|
berghofe@13753
|
898 |
|
berghofe@13753
|
899 |
|
berghofe@14105
|
900 |
(**** Test data generators ****)
|
berghofe@14105
|
901 |
|
berghofe@17144
|
902 |
fun mk_gen gr module p xs a (TVar ((s, i), _)) = Pretty.str
|
berghofe@14105
|
903 |
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
|
berghofe@17144
|
904 |
| mk_gen gr module p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G")
|
berghofe@17144
|
905 |
| mk_gen gr module p xs a (Type (s, Ts)) = (if p then parens else I)
|
berghofe@16649
|
906 |
(Pretty.block (separate (Pretty.brk 1)
|
berghofe@17144
|
907 |
(Pretty.str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') s gr) ^
|
wenzelm@20665
|
908 |
(if member (op =) xs s then "'" else "")) ::
|
berghofe@17144
|
909 |
map (mk_gen gr module true xs a) Ts @
|
wenzelm@20665
|
910 |
(if member (op =) xs s then [Pretty.str a] else []))));
|
berghofe@14105
|
911 |
|
skalberg@15531
|
912 |
val test_fn : (int -> (string * term) list option) ref = ref (fn _ => NONE);
|
berghofe@14105
|
913 |
|
berghofe@24456
|
914 |
fun test_term thy quiet sz i t =
|
berghofe@14105
|
915 |
let
|
wenzelm@21858
|
916 |
val _ = (null (term_tvars t) andalso null (term_tfrees t)) orelse
|
wenzelm@21858
|
917 |
error "Term to be tested contains type variables";
|
wenzelm@21858
|
918 |
val _ = null (term_vars t) orelse
|
wenzelm@21858
|
919 |
error "Term to be tested contains schematic variables";
|
berghofe@14105
|
920 |
val frees = map dest_Free (term_frees t);
|
berghofe@17549
|
921 |
val frees' = frees ~~
|
berghofe@17549
|
922 |
map (fn i => "arg" ^ string_of_int i) (1 upto length frees);
|
berghofe@17144
|
923 |
val (code, gr) = setmp mode ["term_of", "test"]
|
berghofe@17144
|
924 |
(generate_code_i thy [] "Generated") [("testf", list_abs_free (frees, t))];
|
wenzelm@24634
|
925 |
val s = PrintMode.setmp [] (fn () => "structure TestTerm =\nstruct\n\n" ^
|
berghofe@17144
|
926 |
space_implode "\n" (map snd code) ^
|
berghofe@16649
|
927 |
"\nopen Generated;\n\n" ^ Pretty.string_of
|
berghofe@14105
|
928 |
(Pretty.block [Pretty.str "val () = Codegen.test_fn :=",
|
berghofe@17549
|
929 |
Pretty.brk 1, Pretty.str ("(fn i =>"), Pretty.brk 1,
|
berghofe@14105
|
930 |
Pretty.blk (0, [Pretty.str "let", Pretty.brk 1,
|
berghofe@17549
|
931 |
Pretty.blk (0, separate Pretty.fbrk (map (fn ((s, T), s') =>
|
berghofe@17549
|
932 |
Pretty.block [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1,
|
berghofe@17144
|
933 |
mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
|
berghofe@17549
|
934 |
Pretty.str "i;"]) frees')),
|
berghofe@14105
|
935 |
Pretty.brk 1, Pretty.str "in", Pretty.brk 1,
|
berghofe@14105
|
936 |
Pretty.block [Pretty.str "if ",
|
berghofe@17549
|
937 |
mk_app false (Pretty.str "testf") (map (Pretty.str o snd) frees'),
|
skalberg@15531
|
938 |
Pretty.brk 1, Pretty.str "then NONE",
|
berghofe@14105
|
939 |
Pretty.brk 1, Pretty.str "else ",
|
skalberg@15531
|
940 |
Pretty.block [Pretty.str "SOME ", Pretty.block (Pretty.str "[" ::
|
wenzelm@19482
|
941 |
flat (separate [Pretty.str ",", Pretty.brk 1]
|
berghofe@17549
|
942 |
(map (fn ((s, T), s') => [Pretty.block
|
haftmann@21056
|
943 |
[Pretty.str ("(" ^ quote (Symbol.escape s) ^ ","), Pretty.brk 1,
|
berghofe@17144
|
944 |
mk_app false (mk_term_of gr "Generated" false T)
|
berghofe@17549
|
945 |
[Pretty.str s'], Pretty.str ")"]]) frees')) @
|
berghofe@14105
|
946 |
[Pretty.str "]"])]],
|
wenzelm@14980
|
947 |
Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^
|
berghofe@17638
|
948 |
"\n\nend;\n") ();
|
berghofe@24655
|
949 |
val _ = ML_Context.use_mltext s false (SOME (Context.Theory thy));
|
skalberg@15531
|
950 |
fun iter f k = if k > i then NONE
|
berghofe@14135
|
951 |
else (case (f () handle Match =>
|
berghofe@24456
|
952 |
(if quiet then ()
|
berghofe@24456
|
953 |
else warning "Exception Match raised in generated code"; NONE)) of
|
skalberg@15531
|
954 |
NONE => iter f (k+1) | SOME x => SOME x);
|
skalberg@15531
|
955 |
fun test k = if k > sz then NONE
|
berghofe@24456
|
956 |
else (if quiet then () else priority ("Test data size: " ^ string_of_int k);
|
berghofe@14105
|
957 |
case iter (fn () => !test_fn k) 1 of
|
skalberg@15531
|
958 |
NONE => test (k+1) | SOME x => SOME x);
|
berghofe@17638
|
959 |
in test 0 end;
|
berghofe@14105
|
960 |
|
berghofe@24565
|
961 |
fun test_goal quiet ({size, iterations, default_type}, tvinsts) i assms state =
|
berghofe@14105
|
962 |
let
|
berghofe@24456
|
963 |
val thy = Proof.theory_of state;
|
berghofe@14105
|
964 |
fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t
|
berghofe@14105
|
965 |
| strip t = t;
|
berghofe@24565
|
966 |
val (_, (_, st)) = Proof.get_goal state;
|
berghofe@24565
|
967 |
val (gi, frees) = Logic.goal_params (prop_of st) i;
|
wenzelm@20548
|
968 |
val gi' = ObjectLogic.atomize_term thy (map_types
|
berghofe@24655
|
969 |
(map_type_tfree (fn p as (s, S) =>
|
berghofe@24655
|
970 |
let val T = the_default (the_default (TFree p) default_type)
|
berghofe@24655
|
971 |
(AList.lookup (op =) tvinsts s)
|
berghofe@24655
|
972 |
in if Sign.of_sort thy (T, S) then T
|
berghofe@24655
|
973 |
else error ("Type " ^ Sign.string_of_typ thy T ^
|
berghofe@24655
|
974 |
" to be substituted for variable " ^
|
berghofe@24655
|
975 |
Sign.string_of_typ thy (TFree p) ^ "\ndoes not have sort " ^
|
berghofe@24655
|
976 |
Sign.string_of_sort thy S)
|
berghofe@24655
|
977 |
end))
|
berghofe@24456
|
978 |
(Logic.list_implies (assms, subst_bounds (frees, strip gi))));
|
berghofe@24565
|
979 |
in test_term thy quiet size iterations gi' end;
|
berghofe@24565
|
980 |
|
berghofe@24565
|
981 |
fun pretty_counterex ctxt NONE = Pretty.str "No counterexamples found."
|
berghofe@24565
|
982 |
| pretty_counterex ctxt (SOME cex) =
|
berghofe@24565
|
983 |
Pretty.chunks (Pretty.str "Counterexample found:\n" ::
|
berghofe@24565
|
984 |
map (fn (s, t) =>
|
wenzelm@24920
|
985 |
Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1, Syntax.pretty_term ctxt t]) cex);
|
berghofe@24456
|
986 |
|
berghofe@24456
|
987 |
val auto_quickcheck = ref true;
|
wenzelm@24805
|
988 |
val auto_quickcheck_time_limit = ref 5000;
|
berghofe@24456
|
989 |
|
berghofe@24456
|
990 |
fun test_goal' int state =
|
berghofe@24565
|
991 |
let
|
berghofe@24565
|
992 |
val ctxt = Proof.context_of state;
|
berghofe@24565
|
993 |
val assms = map term_of (Assumption.assms_of ctxt)
|
berghofe@24655
|
994 |
val params = get_test_params (Proof.theory_of state)
|
berghofe@24456
|
995 |
in
|
berghofe@24565
|
996 |
if int andalso !auto_quickcheck andalso not (!Toplevel.quiet)
|
berghofe@24565
|
997 |
then
|
wenzelm@24805
|
998 |
(case try (fn state =>
|
wenzelm@24805
|
999 |
TimeLimit.timeLimit (Time.fromMilliseconds (!auto_quickcheck_time_limit))
|
berghofe@24655
|
1000 |
(test_goal true (params, []) 1 assms) state) state of
|
berghofe@24565
|
1001 |
SOME (cex as SOME _) =>
|
berghofe@24565
|
1002 |
Proof.goal_message (fn () => Pretty.chunks [Pretty.str "",
|
berghofe@24565
|
1003 |
Pretty.markup Markup.hilite [pretty_counterex ctxt cex]]) state
|
berghofe@24565
|
1004 |
| _ => state)
|
berghofe@24565
|
1005 |
else state
|
wenzelm@24805
|
1006 |
end;
|
berghofe@24456
|
1007 |
|
berghofe@24456
|
1008 |
val _ = Context.add_setup
|
berghofe@24456
|
1009 |
(Context.theory_map (Specification.add_theorem_hook test_goal'));
|
berghofe@24456
|
1010 |
|
berghofe@14105
|
1011 |
|
berghofe@17549
|
1012 |
(**** Evaluator for terms ****)
|
berghofe@17549
|
1013 |
|
berghofe@24655
|
1014 |
val eval_result = ref (fn () => Bound 0);
|
berghofe@17549
|
1015 |
|
wenzelm@25009
|
1016 |
fun eval_term thy t =
|
wenzelm@25009
|
1017 |
let val e = PrintMode.setmp [] (fn () =>
|
wenzelm@25009
|
1018 |
let
|
wenzelm@25009
|
1019 |
val _ = (null (term_tvars t) andalso null (term_tfrees t)) orelse
|
wenzelm@25009
|
1020 |
error "Term to be evaluated contains type variables";
|
wenzelm@25009
|
1021 |
val _ = (null (term_vars t) andalso null (term_frees t)) orelse
|
wenzelm@25009
|
1022 |
error "Term to be evaluated contains variables";
|
wenzelm@25009
|
1023 |
val (code, gr) = setmp mode ["term_of"]
|
wenzelm@25009
|
1024 |
(generate_code_i thy [] "Generated")
|
wenzelm@25009
|
1025 |
[("result", Abs ("x", TFree ("'a", []), t))];
|
wenzelm@25009
|
1026 |
val s = "structure EvalTerm =\nstruct\n\n" ^
|
wenzelm@25009
|
1027 |
space_implode "\n" (map snd code) ^
|
wenzelm@25009
|
1028 |
"\nopen Generated;\n\n" ^ Pretty.string_of
|
wenzelm@25009
|
1029 |
(Pretty.block [Pretty.str "val () = Codegen.eval_result := (fn () =>",
|
wenzelm@25009
|
1030 |
Pretty.brk 1,
|
wenzelm@25009
|
1031 |
mk_app false (mk_term_of gr "Generated" false (fastype_of t))
|
wenzelm@25009
|
1032 |
[Pretty.str "(result ())"],
|
wenzelm@25009
|
1033 |
Pretty.str ");"]) ^
|
wenzelm@25009
|
1034 |
"\n\nend;\n";
|
wenzelm@25009
|
1035 |
val _ = ML_Context.use_mltext s false (SOME (Context.Theory thy))
|
wenzelm@25009
|
1036 |
in !eval_result end) ();
|
wenzelm@25009
|
1037 |
in e () end;
|
berghofe@17549
|
1038 |
|
berghofe@17549
|
1039 |
fun print_evaluated_term s = Toplevel.keep (fn state =>
|
berghofe@17549
|
1040 |
let
|
wenzelm@21506
|
1041 |
val ctxt = Toplevel.context_of state;
|
wenzelm@21002
|
1042 |
val thy = ProofContext.theory_of ctxt;
|
wenzelm@24508
|
1043 |
val t = eval_term thy (Syntax.read_term ctxt s);
|
berghofe@17549
|
1044 |
val T = Term.type_of t;
|
berghofe@17549
|
1045 |
in
|
haftmann@24585
|
1046 |
Pretty.writeln
|
wenzelm@24920
|
1047 |
(Pretty.block [Pretty.quote (Syntax.pretty_term ctxt t), Pretty.fbrk,
|
wenzelm@24920
|
1048 |
Pretty.str "::", Pretty.brk 1, Pretty.quote (Syntax.pretty_typ ctxt T)])
|
berghofe@17549
|
1049 |
end);
|
berghofe@17549
|
1050 |
|
haftmann@20599
|
1051 |
exception Evaluation of term;
|
haftmann@20599
|
1052 |
|
haftmann@20599
|
1053 |
fun evaluation_oracle (thy, Evaluation t) =
|
haftmann@20599
|
1054 |
Logic.mk_equals (t, eval_term thy t);
|
haftmann@20599
|
1055 |
|
haftmann@20599
|
1056 |
fun evaluation_conv ct =
|
wenzelm@22596
|
1057 |
let val {thy, t, ...} = rep_cterm ct
|
berghofe@24456
|
1058 |
in Thm.invoke_oracle_i thy "Pure.evaluation" (thy, Evaluation t) end;
|
berghofe@24456
|
1059 |
|
berghofe@24456
|
1060 |
val _ = Context.add_setup
|
berghofe@24456
|
1061 |
(Theory.add_oracle ("evaluation", evaluation_oracle));
|
haftmann@20599
|
1062 |
|
berghofe@17549
|
1063 |
|
berghofe@12452
|
1064 |
(**** Interface ****)
|
berghofe@12452
|
1065 |
|
wenzelm@24634
|
1066 |
val str = PrintMode.setmp [] Pretty.str;
|
berghofe@13731
|
1067 |
|
berghofe@11520
|
1068 |
fun parse_mixfix rd s =
|
berghofe@11520
|
1069 |
(case Scan.finite Symbol.stopper (Scan.repeat
|
berghofe@11520
|
1070 |
( $$ "_" >> K Arg
|
berghofe@11520
|
1071 |
|| $$ "?" >> K Ignore
|
berghofe@16769
|
1072 |
|| $$ "\\<module>" >> K Module
|
berghofe@11520
|
1073 |
|| $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
|
berghofe@11520
|
1074 |
|| $$ "{" |-- $$ "*" |-- Scan.repeat1
|
wenzelm@23784
|
1075 |
( $$ "'" |-- Scan.one Symbol.is_regular
|
wenzelm@23784
|
1076 |
|| Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.is_regular)) --|
|
berghofe@12452
|
1077 |
$$ "*" --| $$ "}" >> (Quote o rd o implode)
|
berghofe@11520
|
1078 |
|| Scan.repeat1
|
wenzelm@23784
|
1079 |
( $$ "'" |-- Scan.one Symbol.is_regular
|
berghofe@16769
|
1080 |
|| Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
|
wenzelm@23784
|
1081 |
(Scan.one Symbol.is_regular)) >> (Pretty o str o implode)))
|
berghofe@11520
|
1082 |
(Symbol.explode s) of
|
berghofe@11520
|
1083 |
(p, []) => p
|
berghofe@11520
|
1084 |
| _ => error ("Malformed annotation: " ^ quote s));
|
berghofe@11520
|
1085 |
|
berghofe@24456
|
1086 |
val _ = Context.add_setup
|
berghofe@24456
|
1087 |
(fold assoc_type [("fun", (parse_mixfix (K dummyT) "(_ ->/ _)",
|
berghofe@24456
|
1088 |
[("term_of",
|
berghofe@24456
|
1089 |
"fun term_of_fun_type _ T _ U _ = Free (\"<function>\", T --> U);\n"),
|
berghofe@24456
|
1090 |
("test",
|
berghofe@24456
|
1091 |
"fun gen_fun_type _ G i =\n\
|
berghofe@24456
|
1092 |
\ let\n\
|
berghofe@24456
|
1093 |
\ val f = ref (fn x => raise Match);\n\
|
berghofe@24456
|
1094 |
\ val _ = (f := (fn x =>\n\
|
berghofe@24456
|
1095 |
\ let\n\
|
berghofe@24456
|
1096 |
\ val y = G i;\n\
|
berghofe@24456
|
1097 |
\ val f' = !f\n\
|
berghofe@24456
|
1098 |
\ in (f := (fn x' => if x = x' then y else f' x'); y) end))\n\
|
berghofe@24456
|
1099 |
\ in (fn x => !f x) end;\n")]))]);
|
berghofe@24456
|
1100 |
|
wenzelm@15801
|
1101 |
|
wenzelm@17057
|
1102 |
structure P = OuterParse and K = OuterKeyword;
|
berghofe@11520
|
1103 |
|
wenzelm@24867
|
1104 |
val _ = OuterSyntax.keywords ["attach", "file", "contains"];
|
wenzelm@24867
|
1105 |
|
berghofe@17144
|
1106 |
fun strip_whitespace s = implode (fst (take_suffix (equal "\n" orf equal " ")
|
berghofe@17144
|
1107 |
(snd (take_prefix (equal "\n" orf equal " ") (explode s))))) ^ "\n";
|
berghofe@16769
|
1108 |
|
berghofe@16769
|
1109 |
val parse_attach = Scan.repeat (P.$$$ "attach" |--
|
berghofe@16769
|
1110 |
Scan.optional (P.$$$ "(" |-- P.xname --| P.$$$ ")") "" --
|
berghofe@17144
|
1111 |
(P.verbatim >> strip_whitespace));
|
berghofe@16769
|
1112 |
|
wenzelm@24867
|
1113 |
val _ =
|
berghofe@11520
|
1114 |
OuterSyntax.command "types_code"
|
wenzelm@11546
|
1115 |
"associate types with target language types" K.thy_decl
|
berghofe@16769
|
1116 |
(Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
|
haftmann@22921
|
1117 |
(fn xs => Toplevel.theory (fn thy => fold (assoc_type o
|
haftmann@22921
|
1118 |
(fn ((name, mfx), aux) => (name, (parse_mixfix
|
wenzelm@24707
|
1119 |
(Syntax.read_typ_global thy) mfx, aux)))) xs thy)));
|
berghofe@11520
|
1120 |
|
wenzelm@24867
|
1121 |
val _ =
|
berghofe@11520
|
1122 |
OuterSyntax.command "consts_code"
|
wenzelm@11546
|
1123 |
"associate constants with target language code" K.thy_decl
|
berghofe@11520
|
1124 |
(Scan.repeat1
|
haftmann@22921
|
1125 |
(P.term --|
|
berghofe@16769
|
1126 |
P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
|
haftmann@22921
|
1127 |
(fn xs => Toplevel.theory (fn thy => fold (assoc_const o
|
haftmann@22921
|
1128 |
(fn ((const, mfx), aux) =>
|
haftmann@22921
|
1129 |
(const, (parse_mixfix (Sign.read_term thy) mfx, aux)))) xs thy)));
|
berghofe@11520
|
1130 |
|
berghofe@17144
|
1131 |
fun parse_code lib =
|
berghofe@17144
|
1132 |
Scan.optional (P.$$$ "(" |-- P.enum "," P.xname --| P.$$$ ")") (!mode) --
|
berghofe@17144
|
1133 |
(if lib then Scan.optional P.name "" else P.name) --
|
berghofe@17144
|
1134 |
Scan.option (P.$$$ "file" |-- P.name) --
|
berghofe@17144
|
1135 |
(if lib then Scan.succeed []
|
berghofe@17144
|
1136 |
else Scan.optional (P.$$$ "imports" |-- Scan.repeat1 P.name) []) --|
|
berghofe@17144
|
1137 |
P.$$$ "contains" --
|
berghofe@17144
|
1138 |
( Scan.repeat1 (P.name --| P.$$$ "=" -- P.term)
|
berghofe@17144
|
1139 |
|| Scan.repeat1 (P.term >> pair "")) >>
|
berghofe@17144
|
1140 |
(fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
|
berghofe@17144
|
1141 |
let
|
wenzelm@19299
|
1142 |
val mode'' = (if lib then insert (op =) "library" else I) (remove (op =) "library" mode');
|
berghofe@17144
|
1143 |
val (code, gr) = setmp mode mode'' (generate_code thy modules module) xs
|
berghofe@17144
|
1144 |
in ((case opt_fname of
|
berghofe@24655
|
1145 |
NONE => ML_Context.use_mltext (space_implode "\n" (map snd code))
|
berghofe@24655
|
1146 |
false (SOME (Context.Theory thy))
|
berghofe@17144
|
1147 |
| SOME fname =>
|
berghofe@17144
|
1148 |
if lib then
|
berghofe@17144
|
1149 |
app (fn (name, s) => File.write
|
wenzelm@21858
|
1150 |
(Path.append (Path.explode fname) (Path.basic (name ^ ".ML"))) s)
|
berghofe@17144
|
1151 |
(("ROOT", implode (map (fn (name, _) =>
|
berghofe@17144
|
1152 |
"use \"" ^ name ^ ".ML\";\n") code)) :: code)
|
wenzelm@21858
|
1153 |
else File.write (Path.explode fname) (snd (hd code)));
|
berghofe@17144
|
1154 |
if lib then thy
|
wenzelm@17412
|
1155 |
else map_modules (Symtab.update (module, gr)) thy)
|
berghofe@17144
|
1156 |
end));
|
berghofe@17144
|
1157 |
|
wenzelm@24867
|
1158 |
val _ =
|
berghofe@17144
|
1159 |
OuterSyntax.command "code_library"
|
berghofe@17144
|
1160 |
"generates code for terms (one structure for each theory)" K.thy_decl
|
berghofe@17144
|
1161 |
(parse_code true);
|
berghofe@17144
|
1162 |
|
wenzelm@24867
|
1163 |
val _ =
|
berghofe@17144
|
1164 |
OuterSyntax.command "code_module"
|
berghofe@17144
|
1165 |
"generates code for terms (single structure, incremental)" K.thy_decl
|
berghofe@17144
|
1166 |
(parse_code false);
|
berghofe@11520
|
1167 |
|
berghofe@14105
|
1168 |
val params =
|
berghofe@14105
|
1169 |
[("size", P.nat >> (K o set_size)),
|
berghofe@14105
|
1170 |
("iterations", P.nat >> (K o set_iterations)),
|
berghofe@14105
|
1171 |
("default_type", P.typ >> set_default_type)];
|
berghofe@14105
|
1172 |
|
wenzelm@24022
|
1173 |
val parse_test_params = P.short_ident :|-- (fn s =>
|
wenzelm@24022
|
1174 |
P.$$$ "=" |-- (AList.lookup (op =) params s |> the_default Scan.fail));
|
berghofe@14105
|
1175 |
|
berghofe@14105
|
1176 |
fun parse_tyinst xs =
|
wenzelm@16458
|
1177 |
(P.type_ident --| P.$$$ "=" -- P.typ >> (fn (v, s) => fn thy =>
|
wenzelm@24707
|
1178 |
fn (x, ys) => (x, (v, Syntax.read_typ_global thy s) :: ys))) xs;
|
berghofe@14105
|
1179 |
|
wenzelm@24867
|
1180 |
val _ =
|
berghofe@14105
|
1181 |
OuterSyntax.command "quickcheck_params" "set parameters for random testing" K.thy_decl
|
berghofe@14105
|
1182 |
(P.$$$ "[" |-- P.list1 parse_test_params --| P.$$$ "]" >>
|
berghofe@14105
|
1183 |
(fn fs => Toplevel.theory (fn thy =>
|
berghofe@24456
|
1184 |
map_test_params (Library.apply (map (fn f => f thy) fs)) thy)));
|
berghofe@14105
|
1185 |
|
wenzelm@24867
|
1186 |
val _ =
|
berghofe@14105
|
1187 |
OuterSyntax.command "quickcheck" "try to find counterexample for subgoal" K.diag
|
berghofe@14105
|
1188 |
(Scan.option (P.$$$ "[" |-- P.list1
|
wenzelm@16458
|
1189 |
( parse_test_params >> (fn f => fn thy => apfst (f thy))
|
berghofe@14105
|
1190 |
|| parse_tyinst) --| P.$$$ "]") -- Scan.optional P.nat 1 >>
|
berghofe@24565
|
1191 |
(fn (ps, g) => Toplevel.keep (fn st => Toplevel.proof_of st |>
|
berghofe@24565
|
1192 |
test_goal false (Library.apply (the_default []
|
berghofe@24565
|
1193 |
(Option.map (map (fn f => f (Toplevel.theory_of st))) ps))
|
berghofe@24565
|
1194 |
(get_test_params (Toplevel.theory_of st), [])) g [] |>
|
berghofe@24565
|
1195 |
pretty_counterex (Toplevel.context_of st) |> Pretty.writeln)));
|
berghofe@14105
|
1196 |
|
wenzelm@24867
|
1197 |
val _ =
|
berghofe@17549
|
1198 |
OuterSyntax.improper_command "value" "read, evaluate and print term" K.diag
|
berghofe@17549
|
1199 |
(P.term >> (Toplevel.no_timing oo print_evaluated_term));
|
berghofe@17549
|
1200 |
|
berghofe@11520
|
1201 |
end;
|
wenzelm@24805
|
1202 |
|
wenzelm@24805
|
1203 |
val auto_quickcheck = Codegen.auto_quickcheck;
|
wenzelm@24805
|
1204 |
val auto_quickcheck_time_limit = Codegen.auto_quickcheck_time_limit;
|
wenzelm@24805
|
1205 |
|