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