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