author  wenzelm 
Thu, 31 May 2007 23:47:36 +0200  
changeset 23178  07ba6b58b3d2 
parent 22921  475ff421a6a3 
child 23655  d2d1138e0ddc 
permissions  rwrr 
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 prettyprinting is now a mutable reference.
berghofe
parents:
13753
diff
changeset

13 
val margin : int ref 
11520  14 

12452  15 
datatype 'a mixfix = 
11520  16 
Arg 
17 
 Ignore 

16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

18 
 Module 
11520  19 
 Pretty of Pretty.T 
12452  20 
 Quote of 'a; 
11520  21 

16649  22 
type deftab 
17144  23 
type node 
16649  24 
type codegr 
12452  25 
type 'a codegen 
26 

27 
val add_codegen: string > term codegen > theory > theory 

28 
val add_tycodegen: string > typ codegen > theory > theory 

18728  29 
val add_attribute: string > (Args.T list > attribute * Args.T list) > theory > theory 
15261  30 
val add_preprocessor: (theory > thm list > thm list) > theory > theory 
31 
val preprocess: theory > thm list > thm list 

17549  32 
val preprocess_term: theory > term > term 
11520  33 
val print_codegens: theory > unit 
17144  34 
val generate_code: theory > string list > string > (string * string) list > 
35 
(string * string) list * codegr 

36 
val generate_code_i: theory > string list > string > (string * term) list > 

37 
(string * string) list * codegr 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

38 
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

39 
(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

40 
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

41 
(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

42 
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

43 
(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

44 
val get_assoc_code: theory > string * typ > 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

45 
(term mixfix list * (string * string) list) option 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

46 
val get_assoc_type: theory > string > 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

47 
(typ mixfix list * (string * string) list) option 
17144  48 
val codegen_error: codegr > string > string > 'a 
16649  49 
val invoke_codegen: theory > deftab > string > string > bool > 
50 
codegr * term > codegr * Pretty.T 

51 
val invoke_tycodegen: theory > deftab > string > string > bool > 

52 
codegr * typ > codegr * Pretty.T 

14858  53 
val mk_id: string > string 
17144  54 
val mk_qual_id: string > string * string > string 
55 
val mk_const_id: string > string > codegr > codegr * (string * string) 

56 
val get_const_id: string > codegr > string * string 

57 
val mk_type_id: string > string > codegr > codegr * (string * string) 

58 
val get_type_id: string > codegr > string * string 

16649  59 
val thyname_of_type: string > theory > string 
60 
val thyname_of_const: string > theory > string 

61 
val rename_terms: term list > term list 

11520  62 
val rename_term: term > term 
15398  63 
val new_names: term > string list > string list 
64 
val new_name: term > string > string 

17144  65 
val if_library: 'a > 'a > 'a 
16649  66 
val get_defn: theory > deftab > string > typ > 
67 
((typ * (string * (term list * term))) * int option) option 

11520  68 
val is_instance: theory > typ > typ > bool 
69 
val parens: Pretty.T > Pretty.T 

70 
val mk_app: bool > Pretty.T > Pretty.T list > Pretty.T 

71 
val eta_expand: term > term list > int > term 

14105  72 
val strip_tname: string > string 
13753
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

73 
val mk_type: bool > typ > Pretty.T 
17144  74 
val mk_term_of: codegr > string > bool > typ > Pretty.T 
75 
val mk_gen: codegr > string > bool > string list > string > typ > Pretty.T 

14105  76 
val test_fn: (int > (string * term) list option) ref 
77 
val test_term: theory > int > int > term > (string * term) list option 

17549  78 
val eval_result: term ref 
79 
val eval_term: theory > term > term 

20599  80 
val evaluation_conv: cterm > thm 
12452  81 
val parse_mixfix: (string > 'a) > string > 'a mixfix list 
18102  82 
val quotes_of: 'a mixfix list > 'a list 
18281  83 
val num_args_of: 'a mixfix list > int 
18102  84 
val replace_quotes: 'b list > 'a mixfix list > 'b mixfix list 
18702  85 
val fillin_mixfix: ('a > Pretty.T) > 'a mixfix list > 'a list > Pretty.T 
16649  86 
val mk_deftab: theory > deftab 
19341
3414c04fbc39
added definitional code generator module: codegen_theorems.ML
haftmann
parents:
19299
diff
changeset

87 
val add_unfold: thm > theory > theory 
17549  88 

17144  89 
val get_node: codegr > string > node 
90 
val add_edge: string * string > codegr > codegr 

91 
val add_edge_acyclic: string * string > codegr > codegr 

92 
val del_nodes: string list > codegr > codegr 

93 
val map_node: string > (node > node) > codegr > codegr 

94 
val new_node: string * node > codegr > codegr 

11520  95 
end; 
96 

97 
structure Codegen : CODEGEN = 

98 
struct 

99 

100 
val quiet_mode = ref true; 

101 
fun message s = if !quiet_mode then () else writeln s; 

102 

13753
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

103 
val mode = ref ([] : string list); 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

104 

13886
0b243f6e257e
Margin for prettyprinting is now a mutable reference.
berghofe
parents:
13753
diff
changeset

105 
val margin = ref 80; 
0b243f6e257e
Margin for prettyprinting is now a mutable reference.
berghofe
parents:
13753
diff
changeset

106 

11520  107 
(**** Mixfix syntax ****) 
108 

12452  109 
datatype 'a mixfix = 
11520  110 
Arg 
111 
 Ignore 

16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

112 
 Module 
11520  113 
 Pretty of Pretty.T 
12452  114 
 Quote of 'a; 
11520  115 

116 
fun is_arg Arg = true 

117 
 is_arg Ignore = true 

118 
 is_arg _ = false; 

119 

12452  120 
fun quotes_of [] = [] 
121 
 quotes_of (Quote q :: ms) = q :: quotes_of ms 

122 
 quotes_of (_ :: ms) = quotes_of ms; 

123 

124 
fun args_of [] xs = ([], xs) 

125 
 args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs) 

126 
 args_of (Ignore :: ms) (_ :: xs) = args_of ms xs 

127 
 args_of (_ :: ms) xs = args_of ms xs; 

11520  128 

18281  129 
fun num_args_of x = length (List.filter is_arg x); 
11520  130 

131 

132 
(**** theory data ****) 

133 

16649  134 
(* preprocessed definition table *) 
135 

136 
type deftab = 

137 
(typ * (* type of constant *) 

138 
(string * (* name of theory containing definition of constant *) 

139 
(term list * (* parameters *) 

140 
term))) (* righthand side *) 

141 
list Symtab.table; 

142 

143 
(* code dependency graph *) 

144 

17144  145 
type nametab = (string * string) Symtab.table * unit Symtab.table; 
146 

147 
fun merge_nametabs ((tab, used), (tab', used')) = 

148 
(Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used')); 

149 

150 
type node = 

16649  151 
(exn option * (* slot for arbitrary data *) 
152 
string * (* name of structure containing piece of code *) 

17144  153 
string); (* piece of code *) 
154 

155 
type codegr = 

156 
node Graph.T * 

157 
(nametab * (* table for assigned constant names *) 

158 
nametab); (* table for assigned type names *) 

159 

160 
val emptygr : codegr = (Graph.empty, 

161 
((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty))); 

16649  162 

14105  163 
(* type of code generators *) 
11520  164 

16649  165 
type 'a codegen = 
166 
theory > (* theory in which generate_code was called *) 

167 
deftab > (* definition table (for efficiency) *) 

168 
codegr > (* code dependency graph *) 

169 
string > (* node name of caller (for recording dependencies) *) 

17144  170 
string > (* module name of caller (for modular code generation) *) 
16649  171 
bool > (* whether to parenthesize generated expression *) 
172 
'a > (* item to generate code from *) 

173 
(codegr * Pretty.T) option; 

12452  174 

14105  175 
(* parameters for random testing *) 
176 

177 
type test_params = 

178 
{size: int, iterations: int, default_type: typ option}; 

179 

180 
fun merge_test_params 

181 
{size = size1, iterations = iterations1, default_type = default_type1} 

182 
{size = size2, iterations = iterations2, default_type = default_type2} = 

183 
{size = Int.max (size1, size2), 

184 
iterations = Int.max (iterations1, iterations2), 

185 
default_type = case default_type1 of 

15531  186 
NONE => default_type2 
14105  187 
 _ => default_type1}; 
188 

189 
val default_test_params : test_params = 

15531  190 
{size = 10, iterations = 100, default_type = NONE}; 
14105  191 

192 
fun set_size size ({iterations, default_type, ...} : test_params) = 

193 
{size = size, iterations = iterations, default_type = default_type}; 

194 

195 
fun set_iterations iterations ({size, default_type, ...} : test_params) = 

196 
{size = size, iterations = iterations, default_type = default_type}; 

197 

16458  198 
fun set_default_type s thy ({size, iterations, ...} : test_params) = 
14105  199 
{size = size, iterations = iterations, 
22680
31a2303f4283
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22596
diff
changeset

200 
default_type = SOME (Sign.read_typ thy s)}; 
14105  201 

22846  202 

203 
(* theory data *) 

16458  204 

22749  205 
structure CodeData = CodegenData; 
206 

16458  207 
structure CodegenData = TheoryDataFun 
22846  208 
( 
11520  209 
type T = 
12452  210 
{codegens : (string * term codegen) list, 
211 
tycodegens : (string * typ codegen) list, 

16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

212 
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

213 
types : (string * (typ mixfix list * (string * string) list)) list, 
18728  214 
attrs: (string * (Args.T list > attribute * Args.T list)) list, 
15261  215 
preprocs: (stamp * (theory > thm list > thm list)) list, 
17144  216 
modules: codegr Symtab.table, 
14105  217 
test_params: test_params}; 
11520  218 

12555
e6d7f040fdc7
"code" attribute is now managed by basic code generator module.
berghofe
parents:
12490
diff
changeset

219 
val empty = 
14105  220 
{codegens = [], tycodegens = [], consts = [], types = [], attrs = [], 
17144  221 
preprocs = [], modules = Symtab.empty, test_params = default_test_params}; 
11520  222 
val copy = I; 
16458  223 
val extend = I; 
11520  224 

16458  225 
fun merge _ 
12555
e6d7f040fdc7
"code" attribute is now managed by basic code generator module.
berghofe
parents:
12490
diff
changeset

226 
({codegens = codegens1, tycodegens = tycodegens1, 
14105  227 
consts = consts1, types = types1, attrs = attrs1, 
17144  228 
preprocs = preprocs1, modules = modules1, test_params = test_params1}, 
12555
e6d7f040fdc7
"code" attribute is now managed by basic code generator module.
berghofe
parents:
12490
diff
changeset

229 
{codegens = codegens2, tycodegens = tycodegens2, 
14105  230 
consts = consts2, types = types2, attrs = attrs2, 
17144  231 
preprocs = preprocs2, modules = modules2, test_params = test_params2}) = 
19119
dea8d858d37f
abandoned merge_alists' in favour of generic AList.merge
haftmann
parents:
19046
diff
changeset

232 
{codegens = AList.merge (op =) (K true) (codegens1, codegens2), 
dea8d858d37f
abandoned merge_alists' in favour of generic AList.merge
haftmann
parents:
19046
diff
changeset

233 
tycodegens = AList.merge (op =) (K true) (tycodegens1, tycodegens2), 
21098
d0d8a48ae4e6
switched merge_alists'' to AList.merge'' whenever appropriate
haftmann
parents:
21056
diff
changeset

234 
consts = AList.merge (op =) (K true) (consts1, consts2), 
d0d8a48ae4e6
switched merge_alists'' to AList.merge'' whenever appropriate
haftmann
parents:
21056
diff
changeset

235 
types = AList.merge (op =) (K true) (types1, types2), 
d0d8a48ae4e6
switched merge_alists'' to AList.merge'' whenever appropriate
haftmann
parents:
21056
diff
changeset

236 
attrs = AList.merge (op =) (K true) (attrs1, attrs2), 
19119
dea8d858d37f
abandoned merge_alists' in favour of generic AList.merge
haftmann
parents:
19046
diff
changeset

237 
preprocs = AList.merge (op =) (K true) (preprocs1, preprocs2), 
17144  238 
modules = Symtab.merge (K true) (modules1, modules2), 
14105  239 
test_params = merge_test_params test_params1 test_params2}; 
22846  240 
); 
11520  241 

22846  242 
fun print_codegens thy = 
243 
let val {codegens, tycodegens, ...} = CodegenData.get thy in 

12452  244 
Pretty.writeln (Pretty.chunks 
245 
[Pretty.strs ("term code generators:" :: map fst codegens), 

22846  246 
Pretty.strs ("type code generators:" :: map fst tycodegens)]) 
247 
end; 

11520  248 

249 

250 

14105  251 
(**** access parameters for random testing ****) 
252 

253 
fun get_test_params thy = #test_params (CodegenData.get thy); 

254 

255 
fun map_test_params f thy = 

17144  256 
let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 
14105  257 
CodegenData.get thy; 
258 
in CodegenData.put {codegens = codegens, tycodegens = tycodegens, 

15261  259 
consts = consts, types = types, attrs = attrs, preprocs = preprocs, 
17144  260 
modules = modules, test_params = f test_params} thy 
261 
end; 

262 

263 

264 
(**** access modules ****) 

265 

266 
fun get_modules thy = #modules (CodegenData.get thy); 

267 

268 
fun map_modules f thy = 

269 
let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 

270 
CodegenData.get thy; 

271 
in CodegenData.put {codegens = codegens, tycodegens = tycodegens, 

272 
consts = consts, types = types, attrs = attrs, preprocs = preprocs, 

273 
modules = f modules, test_params = test_params} thy 

14105  274 
end; 
275 

276 

12452  277 
(**** add new code generators to theory ****) 
11520  278 

279 
fun add_codegen name f thy = 

17144  280 
let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 
14105  281 
CodegenData.get thy 
17521  282 
in (case AList.lookup (op =) codegens name of 
15531  283 
NONE => CodegenData.put {codegens = (name, f) :: codegens, 
12555
e6d7f040fdc7
"code" attribute is now managed by basic code generator module.
berghofe
parents:
12490
diff
changeset

284 
tycodegens = tycodegens, consts = consts, types = types, 
17144  285 
attrs = attrs, preprocs = preprocs, modules = modules, 
286 
test_params = test_params} thy 

15531  287 
 SOME _ => error ("Code generator " ^ name ^ " already declared")) 
12452  288 
end; 
289 

290 
fun add_tycodegen name f thy = 

17144  291 
let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 
14105  292 
CodegenData.get thy 
17521  293 
in (case AList.lookup (op =) tycodegens name of 
15531  294 
NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens, 
12555
e6d7f040fdc7
"code" attribute is now managed by basic code generator module.
berghofe
parents:
12490
diff
changeset

295 
codegens = codegens, consts = consts, types = types, 
17144  296 
attrs = attrs, preprocs = preprocs, modules = modules, 
297 
test_params = test_params} thy 

15531  298 
 SOME _ => error ("Code generator " ^ name ^ " already declared")) 
11520  299 
end; 
300 

301 

15261  302 
(**** preprocessors ****) 
303 

304 
fun add_preprocessor p thy = 

17144  305 
let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 
15261  306 
CodegenData.get thy 
307 
in CodegenData.put {tycodegens = tycodegens, 

308 
codegens = codegens, consts = consts, types = types, 

309 
attrs = attrs, preprocs = (stamp (), p) :: preprocs, 

17144  310 
modules = modules, test_params = test_params} thy 
15261  311 
end; 
312 

21836  313 
fun preprocess thy = 
15261  314 
let val {preprocs, ...} = CodegenData.get thy 
21836  315 
in fold (fn (_, f) => f thy) preprocs end; 
15261  316 

17549  317 
fun preprocess_term thy t = 
318 
let 

20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset

319 
val x = Free (Name.variant (add_term_names (t, [])) "x", fastype_of t); 
17549  320 
(* fake definition *) 
321 
val eq = setmp quick_and_dirty true (SkipProof.make_thm thy) 

322 
(Logic.mk_equals (x, t)); 

323 
fun err () = error "preprocess_term: bad preprocessor" 

324 
in case map prop_of (preprocess thy [eq]) of 

325 
[Const ("==", _) $ x' $ t'] => if x = x' then t' else err () 

326 
 _ => err () 

327 
end; 

18281  328 

19341
3414c04fbc39
added definitional code generator module: codegen_theorems.ML
haftmann
parents:
19299
diff
changeset

329 
fun add_unfold eqn = 
15261  330 
let 
22749  331 
val thy = Thm.theory_of_thm eqn; 
332 
val ctxt = ProofContext.init thy; 

333 
val eqn' = LocalDefs.meta_rewrite_rule ctxt eqn; 

334 
val names = term_consts (fst (Logic.dest_equals (prop_of eqn'))); 

15261  335 
fun prep thy = map (fn th => 
17666  336 
let val prop = prop_of th 
337 
in 

338 
if forall (fn name => exists_Const (equal name o fst) prop) names 

22749  339 
then rewrite_rule [eqn'] (Thm.transfer thy th) 
17666  340 
else th 
341 
end) 

19341
3414c04fbc39
added definitional code generator module: codegen_theorems.ML
haftmann
parents:
19299
diff
changeset

342 
in add_preprocessor prep end; 
15261  343 

15801  344 

22749  345 
(**** code attribute ****) 
346 

347 
fun add_attribute name att thy = 

348 
let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 

349 
CodegenData.get thy 

350 
in (case AList.lookup (op =) attrs name of 

351 
NONE => CodegenData.put {tycodegens = tycodegens, 

352 
codegens = codegens, consts = consts, types = types, 

353 
attrs = if name = "" then attrs @ [(name, att)] else (name, att) :: attrs, 

354 
preprocs = preprocs, modules = modules, 

355 
test_params = test_params} thy 

356 
 SOME _ => error ("Code attribute " ^ name ^ " already declared")) 

357 
end; 

358 

359 
fun mk_parser (a, p) = (if a = "" then Scan.succeed "" else Args.$$$ a)  p; 

360 

361 
val code_attr = 

23178  362 
Attrib.syntax (Scan.peek (fn context => List.foldr op  Scan.fail (map mk_parser 
22749  363 
(#attrs (CodegenData.get (Context.theory_of context)))))); 
364 

365 
val _ = Context.add_setup 

366 
(Attrib.add_attributes [("code", code_attr, "declare theorems for code generation")]); 

367 

368 
local 

22845  369 
fun mk_attribute f = Thm.declaration_attribute (fn thm => Context.mapping (f thm) I); 
22749  370 
fun add_simple_attribute (name, f) = 
22845  371 
add_attribute name (Scan.succeed (mk_attribute f)); 
372 
fun add_del_attribute (name, (add, del)) = 

373 
add_attribute name (Args.del  Scan.succeed (mk_attribute del) 

374 
 Scan.succeed (mk_attribute add)) 

22749  375 
in 
22845  376 
val _ = Context.add_setup (add_simple_attribute ("unfold", 
377 
fn thm => add_unfold thm #> CodeData.add_inline thm)); 

378 
val _ = map (Context.add_setup o add_del_attribute) [ 

379 
("func", (CodeData.add_func true, CodeData.del_func)), 

380 
("inline", (CodeData.add_inline, CodeData.del_inline)) 

381 
]; 

22749  382 
end; (*local*) 
383 

15261  384 

11520  385 
(**** associate constants with target language code ****) 
386 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

387 
fun gen_assoc_const prep_const (raw_const, syn) thy = 
11520  388 
let 
17144  389 
val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 
14105  390 
CodegenData.get thy; 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

391 
val (cname, T) = prep_const thy raw_const; 
11520  392 
in 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

393 
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

394 
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

395 
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

396 
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

397 
tycodegens = tycodegens, 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

398 
consts = ((cname, T), syn) :: consts, 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

399 
types = types, attrs = attrs, preprocs = preprocs, 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

400 
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

401 
 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

402 
end; 
11520  403 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

404 
val assoc_const_i = gen_assoc_const (K I); 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

405 
val assoc_const = gen_assoc_const CodegenConsts.read_bare_const; 
11520  406 

15801  407 

11520  408 
(**** associate types with target language types ****) 
409 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

410 
fun assoc_type (s, syn) thy = 
11520  411 
let 
17144  412 
val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} = 
14105  413 
CodegenData.get thy; 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

414 
val tc = Sign.intern_type thy s; 
11520  415 
in 
18320
ce523820ff75
assoc_consts and assoc_types now check number of arguments in template.
berghofe
parents:
18281
diff
changeset

416 
case Symtab.lookup (snd (#types (Type.rep_tsig (Sign.tsig_of thy)))) tc of 
ce523820ff75
assoc_consts and assoc_types now check number of arguments in template.
berghofe
parents:
18281
diff
changeset

417 
SOME (Type.LogicalType i, _) => 
ce523820ff75
assoc_consts and assoc_types now check number of arguments in template.
berghofe
parents:
18281
diff
changeset

418 
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

419 
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

420 
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

421 
NONE => CodegenData.put {codegens = codegens, 
ce523820ff75
assoc_consts and assoc_types now check number of arguments in template.
berghofe
parents:
18281
diff
changeset

422 
tycodegens = tycodegens, consts = consts, 
ce523820ff75
assoc_consts and assoc_types now check number of arguments in template.
berghofe
parents:
18281
diff
changeset

423 
types = (tc, syn) :: types, attrs = attrs, 
ce523820ff75
assoc_consts and assoc_types now check number of arguments in template.
berghofe
parents:
18281
diff
changeset

424 
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

425 
 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

426 
 _ => 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

427 
end; 
11520  428 

21098
d0d8a48ae4e6
switched merge_alists'' to AList.merge'' whenever appropriate
haftmann
parents:
21056
diff
changeset

429 
fun get_assoc_type thy = AList.lookup (op =) ((#types o CodegenData.get) thy); 
11546  430 

11520  431 

432 
(**** make valid ML identifiers ****) 

433 

14858  434 
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse 
435 
Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x; 

436 

437 
fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of 

438 
("<" :: "^" :: xs, ">") => (true, implode xs) 

439 
 ("<" :: xs, ">") => (false, implode xs) 

440 
 _ => sys_error "dest_sym"); 

16458  441 

14858  442 
fun mk_id s = if s = "" then "" else 
11520  443 
let 
14858  444 
fun check_str [] = [] 
445 
 check_str xs = (case take_prefix is_ascii_letdig xs of 

446 
([], " " :: zs) => check_str zs 

447 
 ([], z :: zs) => 

448 
if size z = 1 then string_of_int (ord z) :: check_str zs 

449 
else (case dest_sym z of 

450 
(true, "isub") => check_str zs 

451 
 (true, "isup") => "" :: check_str zs 

452 
 (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs) 

453 
 (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

454 
val s' = space_implode "_" (maps (check_str o Symbol.explode) (NameSpace.explode s)) 
11520  455 
in 
14858  456 
if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s' 
11520  457 
end; 
458 

17144  459 
fun mk_long_id (p as (tab, used)) module s = 
16649  460 
let 
17144  461 
fun find_name [] = sys_error "mk_long_id" 
462 
 find_name (ys :: yss) = 

463 
let 

21858
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

464 
val s' = NameSpace.implode ys 
17144  465 
val s'' = NameSpace.append module s' 
17412  466 
in case Symtab.lookup used s'' of 
17261  467 
NONE => ((module, s'), 
17412  468 
(Symtab.update_new (s, (module, s')) tab, 
469 
Symtab.update_new (s'', ()) used)) 

17144  470 
 SOME _ => find_name yss 
471 
end 

17412  472 
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

473 
NONE => find_name (Library.suffixes1 (NameSpace.explode s)) 
17144  474 
 SOME name => (name, p) 
16649  475 
end; 
476 

17144  477 
(* module: module name for caller *) 
478 
(* module': module name for callee *) 

479 
(* if caller and callee reside in different modules, use qualified access *) 

16649  480 

17144  481 
fun mk_qual_id module (module', s) = 
482 
if module = module' orelse module' = "" then s else module' ^ "." ^ s; 

483 

484 
fun mk_const_id module cname (gr, (tab1, tab2)) = 

16649  485 
let 
17144  486 
val ((module, s), tab1') = mk_long_id tab1 module cname 
487 
val s' = mk_id s; 

21478
a90250b1cf42
moved ML syntax operations to structure ML_Syntax;
wenzelm
parents:
21098
diff
changeset

488 
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s' 
17144  489 
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

490 

17144  491 
fun get_const_id cname (gr, (tab1, tab2)) = 
17412  492 
case Symtab.lookup (fst tab1) cname of 
17144  493 
NONE => error ("get_const_id: no such constant: " ^ quote cname) 
494 
 SOME (module, s) => 

495 
let 

496 
val s' = mk_id s; 

21478
a90250b1cf42
moved ML syntax operations to structure ML_Syntax;
wenzelm
parents:
21098
diff
changeset

497 
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s' 
17144  498 
in (module, s'') end; 
499 

500 
fun mk_type_id module tyname (gr, (tab1, tab2)) = 

16649  501 
let 
17144  502 
val ((module, s), tab2') = mk_long_id tab2 module tyname 
503 
val s' = mk_id s; 

21478
a90250b1cf42
moved ML syntax operations to structure ML_Syntax;
wenzelm
parents:
21098
diff
changeset

504 
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s' 
17144  505 
in ((gr, (tab1, tab2')), (module, s'')) end; 
16649  506 

17144  507 
fun get_type_id tyname (gr, (tab1, tab2)) = 
17412  508 
case Symtab.lookup (fst tab2) tyname of 
17144  509 
NONE => error ("get_type_id: no such type: " ^ quote tyname) 
510 
 SOME (module, s) => 

511 
let 

512 
val s' = mk_id s; 

21478
a90250b1cf42
moved ML syntax operations to structure ML_Syntax;
wenzelm
parents:
21098
diff
changeset

513 
val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s' 
17144  514 
in (module, s'') end; 
515 

516 
fun get_type_id' f tyname tab = apsnd f (get_type_id tyname tab); 

517 

518 
fun get_node (gr, x) k = Graph.get_node gr k; 

519 
fun add_edge e (gr, x) = (Graph.add_edge e gr, x); 

520 
fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x); 

521 
fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x); 

522 
fun map_node k f (gr, x) = (Graph.map_node k f gr, x); 

523 
fun new_node p (gr, x) = (Graph.new_node p gr, x); 

16649  524 

18281  525 
fun theory_of_type s thy = 
16649  526 
if Sign.declared_tyname thy s 
19473  527 
then SOME (the_default thy (get_first (theory_of_type s) (Theory.parents_of thy))) 
16649  528 
else NONE; 
529 

18281  530 
fun theory_of_const s thy = 
16649  531 
if Sign.declared_const thy s 
19473  532 
then SOME (the_default thy (get_first (theory_of_const s) (Theory.parents_of thy))) 
16649  533 
else NONE; 
534 

535 
fun thyname_of_type s thy = (case theory_of_type s thy of 

536 
NONE => error ("thyname_of_type: no such type: " ^ quote s) 

537 
 SOME thy' => Context.theory_name thy'); 

538 

539 
fun thyname_of_const s thy = (case theory_of_const s thy of 

540 
NONE => error ("thyname_of_const: no such constant: " ^ quote s) 

541 
 SOME thy' => Context.theory_name thy'); 

11520  542 

13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

543 
fun rename_terms ts = 
11520  544 
let 
23178  545 
val names = List.foldr add_term_names 
20286  546 
(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

547 
val reserved = filter ML_Syntax.is_reserved names; 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

548 
val (illegal, alt_names) = split_list (map_filter (fn s => 
15531  549 
let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names) 
14858  550 
val ps = (reserved @ illegal) ~~ 
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset

551 
Name.variant_list names (map (suffix "'") reserved @ alt_names); 
11520  552 

17521  553 
fun rename_id s = AList.lookup (op =) ps s > the_default s; 
14858  554 

555 
fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T) 

556 
 rename (Free (a, T)) = Free (rename_id a, T) 

11520  557 
 rename (Abs (s, T, t)) = Abs (s, T, rename t) 
558 
 rename (t $ u) = rename t $ rename u 

559 
 rename t = t; 

560 
in 

13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

561 
map rename ts 
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

562 
end; 
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

563 

e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

564 
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

565 

e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

566 

e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

567 
(**** retrieve definition of constant ****) 
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

568 

e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

569 
fun is_instance thy T1 T2 = 
19806  570 
Sign.typ_instance thy (T1, Logic.legacy_varifyT T2); 
13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

571 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

572 
fun get_assoc_code thy (s, T) = Option.map snd (find_first (fn ((s', T'), _) => 
13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

573 
s = s' andalso is_instance thy T T') (#consts (CodegenData.get thy))); 
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

574 

19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

575 
fun get_aux_code xs = map_filter (fn (m, code) => 
20665  576 
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

577 

16649  578 
fun mk_deftab thy = 
13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

579 
let 
22680
31a2303f4283
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22596
diff
changeset

580 
val axmss = map (fn thy' => (Context.theory_name thy', Theory.axiom_table thy')) 
16649  581 
(thy :: Theory.ancestors_of thy); 
15261  582 
fun prep_def def = (case preprocess thy [def] of 
16649  583 
[def'] => prop_of def'  _ => error "mk_deftab: bad preprocessor"); 
15261  584 
fun dest t = 
585 
let 

586 
val (lhs, rhs) = Logic.dest_equals t; 

587 
val (c, args) = strip_comb lhs; 

16649  588 
val (s, T) = dest_Const c 
589 
in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE 

15531  590 
end handle TERM _ => NONE; 
21056  591 
fun add_def thyname (name, t) = (case dest t of 
592 
NONE => I 

16649  593 
 SOME _ => (case dest (prep_def (Thm.get_axiom thy name)) of 
21056  594 
NONE => I 
595 
 SOME (s, (T, (args, rhs))) => Symtab.map_default (s, []) 

596 
(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

597 
in 
21056  598 
fold (fn (thyname, axms) => Symtab.fold (add_def thyname) axms) axmss Symtab.empty 
11520  599 
end; 
600 

17412  601 
fun get_defn thy defs s T = (case Symtab.lookup defs s of 
16649  602 
NONE => NONE 
603 
 SOME ds => 

604 
let val i = find_index (is_instance thy T o fst) ds 

605 
in if i >= 0 then 

606 
SOME (List.nth (ds, i), if length ds = 1 then NONE else SOME i) 

607 
else NONE 

608 
end); 

609 

11520  610 

12452  611 
(**** invoke suitable code generator for term / type ****) 
11520  612 

17144  613 
fun codegen_error (gr, _) dep s = 
614 
error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep])); 

615 

616 
fun invoke_codegen thy defs dep module brack (gr, t) = (case get_first 

617 
(fn (_, f) => f thy defs gr dep module brack t) (#codegens (CodegenData.get thy)) of 

618 
NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^ 

619 
Sign.string_of_term thy t) 

15531  620 
 SOME x => x); 
12452  621 

17144  622 
fun invoke_tycodegen thy defs dep module brack (gr, T) = (case get_first 
623 
(fn (_, f) => f thy defs gr dep module brack T) (#tycodegens (CodegenData.get thy)) of 

624 
NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^ 

625 
Sign.string_of_typ thy T) 

15531  626 
 SOME x => x); 
11520  627 

628 

629 
(**** code generator for mixfix expressions ****) 

630 

631 
fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"]; 

632 

633 
fun pretty_fn [] p = [p] 

634 
 pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") :: 

635 
Pretty.brk 1 :: pretty_fn xs p; 

636 

16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

637 
fun pretty_mixfix _ _ [] [] _ = [] 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

638 
 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

639 
p :: pretty_mixfix module module' ms ps qs 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

640 
 pretty_mixfix module module' (Ignore :: ms) ps qs = 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

641 
pretty_mixfix module module' ms ps qs 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

642 
 pretty_mixfix module module' (Module :: ms) ps qs = 
17144  643 
(if module <> module' 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

644 
then cons (Pretty.str (module' ^ ".")) else I) 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

645 
(pretty_mixfix module module' ms ps qs) 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

646 
 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

647 
p :: pretty_mixfix module module' ms ps qs 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

648 
 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

649 
q :: pretty_mixfix module module' ms ps qs; 
11520  650 

18102  651 
fun replace_quotes [] [] = [] 
652 
 replace_quotes xs (Arg :: ms) = 

653 
Arg :: replace_quotes xs ms 

654 
 replace_quotes xs (Ignore :: ms) = 

655 
Ignore :: replace_quotes xs ms 

656 
 replace_quotes xs (Module :: ms) = 

657 
Module :: replace_quotes xs ms 

658 
 replace_quotes xs (Pretty p :: ms) = 

659 
Pretty p :: replace_quotes xs ms 

660 
 replace_quotes (x::xs) (Quote _ :: ms) = 

661 
Quote x :: replace_quotes xs ms; 

662 

18702  663 
fun fillin_mixfix f ms args = 
18098  664 
let 
18281  665 
fun fillin [] [] = 
666 
[] 

667 
 fillin (Arg :: ms) (a :: args) = 

18702  668 
f a :: fillin ms args 
18281  669 
 fillin (Ignore :: ms) args = 
670 
fillin ms args 

671 
 fillin (Module :: ms) args = 

672 
fillin ms args 

673 
 fillin (Pretty p :: ms) args = 

674 
p :: fillin ms args 

675 
 fillin (Quote q :: ms) args = 

18702  676 
f q :: fillin ms args 
18281  677 
in Pretty.block (fillin ms args) end; 
18098  678 

11520  679 

12452  680 
(**** default code generators ****) 
11520  681 

682 
fun eta_expand t ts i = 

683 
let 

684 
val (Ts, _) = strip_type (fastype_of t); 

685 
val j = i  length ts 

686 
in 

23178  687 
List.foldr (fn (T, t) => Abs ("x", T, t)) 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

688 
(list_comb (t, ts @ map Bound (j1 downto 0))) (Library.take (j, Ts)) 
11520  689 
end; 
690 

691 
fun mk_app _ p [] = p 

692 
 mk_app brack p ps = if brack then 

693 
Pretty.block (Pretty.str "(" :: 

694 
separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"]) 

695 
else Pretty.block (separate (Pretty.brk 1) (p :: ps)); 

696 

20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset

697 
fun new_names t xs = Name.variant_list 
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19806
diff
changeset

698 
(map (fst o fst o dest_Var) (term_vars t) union 
21719  699 
add_term_names (t, ML_Syntax.reserved_names)) (map mk_id xs); 
11520  700 

701 
fun new_name t x = hd (new_names t [x]); 

702 

20665  703 
fun if_library x y = if member (op =) (!mode) "library" then x else y; 
17144  704 

705 
fun default_codegen thy defs gr dep module brack t = 

11520  706 
let 
707 
val (u, ts) = strip_comb t; 

17144  708 
fun codegens brack = foldl_map (invoke_codegen thy defs dep module brack) 
11520  709 
in (case u of 
14105  710 
Var ((s, i), T) => 
711 
let 

712 
val (gr', ps) = codegens true (gr, ts); 

17144  713 
val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T) 
15531  714 
in SOME (gr'', mk_app brack (Pretty.str (s ^ 
11520  715 
(if i=0 then "" else string_of_int i))) ps) 
716 
end 

717 

14105  718 
 Free (s, T) => 
719 
let 

720 
val (gr', ps) = codegens true (gr, ts); 

17144  721 
val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T) 
15531  722 
in SOME (gr'', mk_app brack (Pretty.str s) ps) end 
11520  723 

724 
 Const (s, T) => 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

725 
(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

726 
SOME (ms, aux) => 
18281  727 
let val i = num_args_of ms 
11520  728 
in if length ts < i then 
17144  729 
default_codegen thy defs gr dep module brack (eta_expand u ts i) 
11520  730 
else 
731 
let 

12452  732 
val (ts1, ts2) = args_of ms ts; 
733 
val (gr1, ps1) = codegens false (gr, ts1); 

734 
val (gr2, ps2) = codegens true (gr1, ts2); 

735 
val (gr3, ps3) = codegens false (gr2, quotes_of ms); 

17549  736 
val (gr4, _) = invoke_tycodegen thy defs dep module false 
737 
(gr3, funpow (length ts) (hd o tl o snd o dest_Type) T); 

17144  738 
val (module', suffix) = (case get_defn thy defs s T of 
739 
NONE => (if_library (thyname_of_const s thy) module, "") 

740 
 SOME ((U, (module', _)), NONE) => 

741 
(if_library module' module, "") 

742 
 SOME ((U, (module', _)), SOME i) => 

743 
(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

744 
val node_id = s ^ suffix; 
17144  745 
fun p module' = mk_app brack (Pretty.block 
746 
(pretty_mixfix module module' ms ps1 ps3)) ps2 

17549  747 
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

748 
NONE => (case get_aux_code aux of 
17549  749 
[] => (gr4, p module) 
17144  750 
 xs => (add_edge (node_id, dep) (new_node 
17549  751 
(node_id, (NONE, module', space_implode "\n" xs ^ "\n")) gr4), 
17144  752 
p module')) 
753 
 SOME (_, module'', _) => 

17549  754 
(add_edge (node_id, dep) gr4, p module'')) 
11520  755 
end 
756 
end 

16649  757 
 NONE => (case get_defn thy defs s T of 
15531  758 
NONE => NONE 
17144  759 
 SOME ((U, (thyname, (args, rhs))), k) => 
11520  760 
let 
17144  761 
val module' = if_library thyname module; 
762 
val suffix = (case k of NONE => ""  SOME i => " def" ^ string_of_int i); 

16649  763 
val node_id = s ^ suffix; 
17144  764 
val (gr', (ps, def_id)) = codegens true (gr, ts) >>> 
765 
mk_const_id module' (s ^ suffix); 

766 
val p = mk_app brack (Pretty.str (mk_qual_id module def_id)) ps 

767 
in SOME (case try (get_node gr') node_id of 

768 
NONE => 

769 
let 

770 
val _ = message ("expanding definition of " ^ s); 

18788
4f4ed2a01152
Fixed bug in code generator for primitive definitions that
berghofe
parents:
18728
diff
changeset

771 
val (Ts, _) = strip_type U; 
17144  772 
val (args', rhs') = 
773 
if not (null args) orelse null Ts then (args, rhs) else 

774 
let val v = Free (new_name rhs "x", hd Ts) 

775 
in ([v], betapply (rhs, v)) end; 

776 
val (gr1, p') = invoke_codegen thy defs node_id module' false 

777 
(add_edge (node_id, dep) 

778 
(new_node (node_id, (NONE, "", "")) gr'), rhs'); 

779 
val (gr2, xs) = codegens false (gr1, args'); 

780 
val (gr3, _) = invoke_tycodegen thy defs dep module false (gr2, T); 

781 
val (gr4, ty) = invoke_tycodegen thy defs node_id module' false (gr3, U); 

782 
in (map_node node_id (K (NONE, module', Pretty.string_of 

783 
(Pretty.block (separate (Pretty.brk 1) 

784 
(if null args' then 

785 
[Pretty.str ("val " ^ snd def_id ^ " :"), ty] 

786 
else Pretty.str ("fun " ^ snd def_id) :: xs) @ 

787 
[Pretty.str " =", Pretty.brk 1, p', Pretty.str ";"])) ^ "\n\n")) gr4, 

788 
p) 

789 
end 

790 
 SOME _ => (add_edge (node_id, dep) gr', p)) 

11520  791 
end)) 
792 

793 
 Abs _ => 

794 
let 

795 
val (bs, Ts) = ListPair.unzip (strip_abs_vars u); 

796 
val t = strip_abs_body u 

797 
val bs' = new_names t bs; 

12452  798 
val (gr1, ps) = codegens true (gr, ts); 
17144  799 
val (gr2, p) = invoke_codegen thy defs dep module false 
12452  800 
(gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t)); 
11520  801 
in 
15531  802 
SOME (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @ 
11520  803 
[Pretty.str ")"])) ps) 
804 
end 

805 

15531  806 
 _ => NONE) 
11520  807 
end; 
808 

17144  809 
fun default_tycodegen thy defs gr dep module brack (TVar ((s, i), _)) = 
15531  810 
SOME (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i))) 
17144  811 
 default_tycodegen thy defs gr dep module brack (TFree (s, _)) = 
16649  812 
SOME (gr, Pretty.str s) 
17144  813 
 default_tycodegen thy defs gr dep module brack (Type (s, Ts)) = 
17521  814 
(case AList.lookup (op =) ((#types o CodegenData.get) thy) s of 
15531  815 
NONE => NONE 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

816 
 SOME (ms, aux) => 
12452  817 
let 
818 
val (gr', ps) = foldl_map 

17144  819 
(invoke_tycodegen thy defs dep module false) 
16649  820 
(gr, fst (args_of ms Ts)); 
12452  821 
val (gr'', qs) = foldl_map 
17144  822 
(invoke_tycodegen thy defs dep module false) 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

823 
(gr', quotes_of ms); 
17144  824 
val module' = if_library (thyname_of_type s thy) module; 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

825 
val node_id = s ^ " (type)"; 
17144  826 
fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs) 
827 
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

828 
NONE => (case get_aux_code aux of 
17144  829 
[] => (gr'', p module') 
830 
 xs => (fst (mk_type_id module' s 

831 
(add_edge (node_id, dep) (new_node (node_id, 

832 
(NONE, module', space_implode "\n" xs ^ "\n")) gr''))), 

833 
p module')) 

834 
 SOME (_, module'', _) => 

835 
(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

836 
end); 
12452  837 

15801  838 
val _ = Context.add_setup 
18708  839 
(add_codegen "default" default_codegen #> 
840 
add_tycodegen "default" default_tycodegen); 

15801  841 

11520  842 

16649  843 
fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n"; 
844 

17521  845 
fun add_to_module name s = AList.map_entry (op =) name (suffix s); 
16649  846 

17144  847 
fun output_code gr module xs = 
16649  848 
let 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

849 
val code = map_filter (fn s => 
17144  850 
let val c as (_, module', _) = Graph.get_node gr s 
851 
in if module = "" orelse module = module' then SOME (s, c) else NONE end) 

852 
(rev (Graph.all_preds gr xs)); 

16649  853 
fun string_of_cycle (a :: b :: cs) = 
854 
let val SOME (x, y) = get_first (fn (x, (_, a', _)) => 

855 
if a = a' then Option.map (pair x) 

21056  856 
(find_first (equal b o #2 o Graph.get_node gr) 
16649  857 
(Graph.imm_succs gr x)) 
858 
else NONE) code 

859 
in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end 

860 
 string_of_cycle _ = "" 

861 
in 

17144  862 
if module = "" then 
16649  863 
let 
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
18977
diff
changeset

864 
val modules = distinct (op =) (map (#2 o snd) code); 
23178  865 
val mod_gr = fold_rev Graph.add_edge_acyclic 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

866 
(maps (fn (s, (_, module, _)) => map (pair module) 
17144  867 
(filter_out (equal module) (map (#2 o Graph.get_node gr) 
23178  868 
(Graph.imm_succs gr s)))) code) 
869 
(fold_rev (Graph.new_node o rpair ()) modules Graph.empty); 

16649  870 
val modules' = 
871 
rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs)) 

872 
in 

23178  873 
List.foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms) 
16649  874 
(map (rpair "") modules') code 
875 
end handle Graph.CYCLES (cs :: _) => 

876 
error ("Cyclic dependency of modules:\n" ^ commas cs ^ 

877 
"\n" ^ string_of_cycle cs) 

17144  878 
else [(module, implode (map (#3 o snd) code))] 
16649  879 
end; 
11520  880 

17144  881 
fun gen_generate_code prep_term thy modules module = 
14598
7009f59711e3
Replaced quote by Library.quote, since quote now refers to Symbol.quote
berghofe
parents:
14197
diff
changeset

882 
setmp print_mode [] (Pretty.setmp_margin (!margin) (fn xs => 
11520  883 
let 
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

884 
val _ = (module <> "" orelse 
20665  885 
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

886 
orelse error "missing module name"; 
17144  887 
val graphs = get_modules thy; 
16649  888 
val defs = mk_deftab thy; 
17144  889 
val gr = new_node ("<Top>", (NONE, module, "")) 
23178  890 
(List.foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) => 
17144  891 
(Graph.merge (fn ((_, module, _), (_, module', _)) => 
892 
module = module') (gr, gr'), 

893 
(merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr 

17412  894 
(map (fn s => case Symtab.lookup graphs s of 
17144  895 
NONE => error ("Undefined code module: " ^ s) 
896 
 SOME gr => gr) modules)) 

897 
handle Graph.DUPS ks => error ("Duplicate code for " ^ commas ks); 

16649  898 
fun expand (t as Abs _) = t 
899 
 expand t = (case fastype_of t of 

900 
Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0)  _ => t); 

11520  901 
val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s) 
17144  902 
(invoke_codegen thy defs "<Top>" module false (gr, t))) 
17549  903 
(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

904 
val code = map_filter 
17144  905 
(fn ("", _) => NONE 
906 
 (s', p) => SOME (Pretty.string_of (Pretty.block 

907 
[Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"]))) ps; 

908 
val code' = space_implode "\n\n" code ^ "\n\n"; 

909 
val code'' = 

19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

910 
map_filter (fn (name, s) => 
20665  911 
if member (op =) (!mode) "library" andalso name = module andalso null code 
17144  912 
then NONE 
913 
else SOME (name, mk_struct name s)) 

914 
((if null code then I 

915 
else add_to_module module code') 

916 
(output_code (fst gr') (if_library "" module) ["<Top>"])) 

16649  917 
in 
17144  918 
(code'', del_nodes ["<Top>"] gr') 
16649  919 
end)); 
11520  920 

22680
31a2303f4283
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22596
diff
changeset

921 
val generate_code_i = gen_generate_code Sign.cert_term; 
31a2303f4283
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22596
diff
changeset

922 
val generate_code = gen_generate_code Sign.read_term; 
11520  923 

12452  924 

13753
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

925 
(**** Reflection ****) 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

926 

38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

927 
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

928 

38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

929 
fun pretty_list xs = Pretty.block (Pretty.str "[" :: 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

930 
flat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @ 
13753
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

931 
[Pretty.str "]"]); 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

932 

38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

933 
fun mk_type p (TVar ((s, i), _)) = Pretty.str 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

934 
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T") 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

935 
 mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T") 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

936 
 mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

937 
[Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","), 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

938 
Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]); 
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

939 

17144  940 
fun mk_term_of gr module p (TVar ((s, i), _)) = Pretty.str 
13753
38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

941 
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F") 
17144  942 
 mk_term_of gr module p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F") 
943 
 mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I) 

16649  944 
(Pretty.block (separate (Pretty.brk 1) 
17144  945 
(Pretty.str (mk_qual_id module 
946 
(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

947 
maps (fn T => 
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

948 
[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

949 

38b76f457b9c
 Added mode reference variable (may be used to switch on and off specific
berghofe
parents:
13731
diff
changeset

950 

14105  951 
(**** Test data generators ****) 
952 

17144  953 
fun mk_gen gr module p xs a (TVar ((s, i), _)) = Pretty.str 
14105  954 
(strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G") 
17144  955 
 mk_gen gr module p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G") 
956 
 mk_gen gr module p xs a (Type (s, Ts)) = (if p then parens else I) 

16649  957 
(Pretty.block (separate (Pretty.brk 1) 
17144  958 
(Pretty.str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') s gr) ^ 
20665  959 
(if member (op =) xs s then "'" else "")) :: 
17144  960 
map (mk_gen gr module true xs a) Ts @ 
20665  961 
(if member (op =) xs s then [Pretty.str a] else [])))); 
14105  962 

15531  963 
val test_fn : (int > (string * term) list option) ref = ref (fn _ => NONE); 
14105  964 

17638  965 
fun test_term thy sz i t = 
14105  966 
let 
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

967 
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

968 
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

969 
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

970 
error "Term to be tested contains schematic variables"; 
14105  971 
val frees = map dest_Free (term_frees t); 
17549  972 
val frees' = frees ~~ 
973 
map (fn i => "arg" ^ string_of_int i) (1 upto length frees); 

17144  974 
val (code, gr) = setmp mode ["term_of", "test"] 
975 
(generate_code_i thy [] "Generated") [("testf", list_abs_free (frees, t))]; 

17638  976 
val s = setmp print_mode [] (fn () => "structure TestTerm =\nstruct\n\n" ^ 
17144  977 
space_implode "\n" (map snd code) ^ 
16649  978 
"\nopen Generated;\n\n" ^ Pretty.string_of 
14105  979 
(Pretty.block [Pretty.str "val () = Codegen.test_fn :=", 
17549  980 
Pretty.brk 1, Pretty.str ("(fn i =>"), Pretty.brk 1, 
14105  981 
Pretty.blk (0, [Pretty.str "let", Pretty.brk 1, 
17549  982 
Pretty.blk (0, separate Pretty.fbrk (map (fn ((s, T), s') => 
983 
Pretty.block [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, 

17144  984 
mk_gen gr "Generated" false [] "" T, Pretty.brk 1, 
17549  985 
Pretty.str "i;"]) frees')), 
14105  986 
Pretty.brk 1, Pretty.str "in", Pretty.brk 1, 
987 
Pretty.block [Pretty.str "if ", 

17549  988 
mk_app false (Pretty.str "testf") (map (Pretty.str o snd) frees'), 
15531  989 
Pretty.brk 1, Pretty.str "then NONE", 
14105  990 
Pretty.brk 1, Pretty.str "else ", 
15531  991 
Pretty.block [Pretty.str "SOME ", Pretty.block (Pretty.str "[" :: 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19473
diff
changeset

992 
flat (separate [Pretty.str ",", Pretty.brk 1] 
17549  993 
(map (fn ((s, T), s') => [Pretty.block 
21056  994 
[Pretty.str ("(" ^ quote (Symbol.escape s) ^ ","), Pretty.brk 1, 
17144  995 
mk_app false (mk_term_of gr "Generated" false T) 
17549  996 
[Pretty.str s'], Pretty.str ")"]]) frees')) @ 
14105  997 
[Pretty.str "]"])]], 
14980  998 
Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^ 
17638  999 
"\n\nend;\n") (); 
22144  1000 
val _ = use_text "" Output.ml_output false s; 
15531  1001 
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

1002 
else (case (f () handle Match => 
15531  1003 
(warning "Exception Match raised in generated code"; NONE)) of 
1004 
NONE => iter f (k+1)  SOME x => SOME x); 

1005 
fun test k = if k > sz then NONE 

14105  1006 
else (priority ("Test data size: " ^ string_of_int k); 
1007 
case iter (fn () => !test_fn k) 1 of 

15531  1008 
NONE => test (k+1)  SOME x => SOME x); 
17638  1009 
in test 0 end; 
14105  1010 

1011 
fun test_goal ({size, iterations, default_type}, tvinsts) i st = 

1012 
let 

16458  1013 
val thy = Toplevel.theory_of st; 
14105  1014 
fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t 
1015 
 strip t = t; 

1016 
val (gi, frees) = Logic.goal_params 

1017 
(prop_of (snd (snd (Proof.get_goal (Toplevel.proof_of st))))) i; 

20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20286
diff
changeset

1018 
val gi' = ObjectLogic.atomize_term thy (map_types 
19502  1019 
(map_type_tfree (fn p as (s, _) => 
1020 
the_default (the_default (TFree p) default_type) 

1021 
(AList.lookup (op =) tvinsts s))) (subst_bounds (frees, strip gi))); 

14105  1022 
in case test_term (Toplevel.theory_of st) size iterations gi' of 
15531  1023 
NONE => writeln "No counterexamples found." 
1024 
 SOME cex => writeln ("Counterexample found:\n" ^ 

14105  1025 
Pretty.string_of (Pretty.chunks (map (fn (s, t) => 
1026 
Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1, 

16458  1027 
Sign.pretty_term thy t]) cex))) 
14105  1028 
end; 
1029 

1030 

17549  1031 
(**** Evaluator for terms ****) 
1032 

1033 
val eval_result = ref (Bound 0); 

1034 

1035 
fun eval_term thy = setmp print_mode [] (fn t => 

1036 
let 

21858
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

1037 
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

1038 
error "Term to be evaluated contains type variables"; 
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

1039 
val _ = (null (term_vars t) andalso null (term_frees t)) orelse 
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

1040 
error "Term to be evaluated contains variables"; 
17549  1041 
val (code, gr) = setmp mode ["term_of"] 
1042 
(generate_code_i thy [] "Generated") [("result", t)]; 

1043 
val s = "structure EvalTerm =\nstruct\n\n" ^ 

1044 
space_implode "\n" (map snd code) ^ 

1045 
"\nopen Generated;\n\n" ^ Pretty.string_of 

1046 
(Pretty.block [Pretty.str "val () = Codegen.eval_result :=", 

1047 
Pretty.brk 1, 

1048 
mk_app false (mk_term_of gr "Generated" false (fastype_of t)) 

1049 
[Pretty.str "result"], 

1050 
Pretty.str ";"]) ^ 

1051 
"\n\nend;\n"; 

22144  1052 
val _ = use_text "" Output.ml_output false s 
17549  1053 
in !eval_result end); 
1054 

1055 
fun print_evaluated_term s = Toplevel.keep (fn state => 

1056 
let 

21506  1057 
val ctxt = Toplevel.context_of state; 
21002  1058 
val thy = ProofContext.theory_of ctxt; 
1059 
val t = eval_term thy (ProofContext.read_term ctxt s); 

17549  1060 
val T = Term.type_of t; 
1061 
in 

1062 
writeln (Pretty.string_of 

1063 
(Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk, 

1064 
Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)])) 

1065 
end); 

1066 

20599  1067 
exception Evaluation of term; 
1068 

1069 
fun evaluation_oracle (thy, Evaluation t) = 

1070 
Logic.mk_equals (t, eval_term thy t); 

1071 

1072 
fun evaluation_conv ct = 

22596  1073 
let val {thy, t, ...} = rep_cterm ct 
1074 
in Thm.invoke_oracle_i thy "Pure.evaluation" (thy, Evaluation t) end; 

20599  1075 

1076 
val _ = Context.add_setup 

20665  1077 
(Theory.add_oracle ("evaluation", evaluation_oracle)); 
17549  1078 

12452  1079 
(**** Interface ****) 
1080 

13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

1081 
val str = setmp print_mode [] Pretty.str; 
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

1082 

11520  1083 
fun parse_mixfix rd s = 
1084 
(case Scan.finite Symbol.stopper (Scan.repeat 

1085 
( $$ "_" >> K Arg 

1086 
 $$ "?" >> K Ignore 

16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1087 
 $$ "\\<module>" >> K Module 
11520  1088 
 $$ "/"  Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length) 
1089 
 $$ "{"  $$ "*"  Scan.repeat1 

1090 
( $$ "'"  Scan.one Symbol.not_eof 

1091 
 Scan.unless ($$ "*"  $$ "}") (Scan.one Symbol.not_eof))  

12452  1092 
$$ "*"  $$ "}" >> (Quote o rd o implode) 
11520  1093 
 Scan.repeat1 
1094 
( $$ "'"  Scan.one Symbol.not_eof 

16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1095 
 Scan.unless ($$ "_"  $$ "?"  $$ "\\<module>"  $$ "/"  $$ "{"  $$ "*") 
13731
e2d17090052b
Parameters in definitions are now renamed to avoid clashes with
berghofe
parents:
13073
diff
changeset

1096 
(Scan.one Symbol.not_eof)) >> (Pretty o str o implode))) 
11520  1097 
(Symbol.explode s) of 
1098 
(p, []) => p 

1099 
 _ => error ("Malformed annotation: " ^ quote s)); 

1100 

15801  1101 
val _ = Context.add_setup 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

1102 
(fold assoc_type [("fun", (parse_mixfix (K dummyT) "(_ >/ _)", 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1103 
[("term_of", 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1104 
"fun term_of_fun_type _ T _ U _ = Free (\"<function>\", T > U);\n"), 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1105 
("test", 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1106 
"fun gen_fun_type _ G i =\n\ 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1107 
\ let\n\ 
18679  1108 
\ val f = ref (fn x => raise Match);\n\ 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1109 
\ val _ = (f := (fn x =>\n\ 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1110 
\ let\n\ 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1111 
\ val y = G i;\n\ 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1112 
\ val f' = !f\n\ 
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1113 
\ in (f := (fn x' => if x = x' then y else f' x'); y) end))\n\ 
18708  1114 
\ in (fn x => !f x) end;\n")]))]); 
15801  1115 

1116 

17057  1117 
structure P = OuterParse and K = OuterKeyword; 
11520  1118 

17144  1119 
fun strip_whitespace s = implode (fst (take_suffix (equal "\n" orf equal " ") 
1120 
(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

1121 

7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1122 
val parse_attach = Scan.repeat (P.$$$ "attach"  
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1123 
Scan.optional (P.$$$ "("  P.xname  P.$$$ ")") ""  
17144  1124 
(P.verbatim >> strip_whitespace)); 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1125 

11520  1126 
val assoc_typeP = 
1127 
OuterSyntax.command "types_code" 

11546  1128 
"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

1129 
(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

1130 
(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

1131 
(fn ((name, mfx), aux) => (name, (parse_mixfix 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

1132 
(Sign.read_typ thy) mfx, aux)))) xs thy))); 
11520  1133 

1134 
val assoc_constP = 

1135 
OuterSyntax.command "consts_code" 

11546  1136 
"associate constants with target language code" K.thy_decl 
11520  1137 
(Scan.repeat1 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

1138 
(P.term  
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1139 
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

1140 
(fn xs => Toplevel.theory (fn thy => fold (assoc_const o 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

1141 
(fn ((const, mfx), aux) => 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22846
diff
changeset

1142 
(const, (parse_mixfix (Sign.read_term thy) mfx, aux)))) xs thy))); 
11520  1143 

17144  1144 
fun parse_code lib = 
1145 
Scan.optional (P.$$$ "("  P.enum "," P.xname  P.$$$ ")") (!mode)  

1146 
(if lib then Scan.optional P.name "" else P.name)  

1147 
Scan.option (P.$$$ "file"  P.name)  

1148 
(if lib then Scan.succeed [] 

1149 
else Scan.optional (P.$$$ "imports"  Scan.repeat1 P.name) [])  

1150 
P.$$$ "contains"  

1151 
( Scan.repeat1 (P.name  P.$$$ "="  P.term) 

1152 
 Scan.repeat1 (P.term >> pair "")) >> 

1153 
(fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy => 

1154 
let 

19299  1155 
val mode'' = (if lib then insert (op =) "library" else I) (remove (op =) "library" mode'); 
17144  1156 
val (code, gr) = setmp mode mode'' (generate_code thy modules module) xs 
1157 
in ((case opt_fname of 

22144  1158 
NONE => use_text "" Output.ml_output false 
17144  1159 
(space_implode "\n" (map snd code)) 
1160 
 SOME fname => 

1161 
if lib then 

1162 
app (fn (name, s) => File.write 

21858
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

1163 
(Path.append (Path.explode fname) (Path.basic (name ^ ".ML"))) s) 
17144  1164 
(("ROOT", implode (map (fn (name, _) => 
1165 
"use \"" ^ name ^ ".ML\";\n") code)) :: code) 

21858
05f57309170c
avoid conflict with Alice keywords: renamed pack > implode, unpack > explode, any > many, avoided assert;
wenzelm
parents:
21836
diff
changeset

1166 
else File.write (Path.explode fname) (snd (hd code))); 
17144  1167 
if lib then thy 
17412  1168 
else map_modules (Symtab.update (module, gr)) thy) 
17144  1169 
end)); 
1170 

1171 
val code_libraryP = 

1172 
OuterSyntax.command "code_library" 

1173 
"generates code for terms (one structure for each theory)" K.thy_decl 

1174 
(parse_code true); 

1175 

1176 
val code_moduleP = 

1177 
OuterSyntax.command "code_module" 

1178 
"generates code for terms (single structure, incremental)" K.thy_decl 

1179 
(parse_code false); 

11520  1180 

14105  1181 
val params = 
1182 
[("size", P.nat >> (K o set_size)), 

1183 
("iterations", P.nat >> (K o set_iterations)), 

1184 
("default_type", P.typ >> set_default_type)]; 

1185 

1186 
val parse_test_params = P.short_ident : (fn s => 

17521  1187 
P.$$$ "="  (AList.lookup (op =) params s > the_default Scan.fail)) >> snd; 
14105  1188 

1189 
fun parse_tyinst xs = 

16458  1190 
(P.type_ident  P.$$$ "="  P.typ >> (fn (v, s) => fn thy => 
22680
31a2303f4283
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22596
diff
changeset

1191 
fn (x, ys) => (x, (v, Sign.read_typ thy s) :: ys))) xs; 
14105  1192 

1193 
fun app [] x = x 

1194 
 app (f :: fs) x = app fs (f x); 

1195 

1196 
val test_paramsP = 

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 => 

16649  1200 
map_test_params (app (map (fn f => f thy) fs)) thy))); 
14105  1201 

1202 
val testP = 

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 >> 
1207 
(fn (ps, g) => Toplevel.keep (fn st => 

19502  1208 
test_goal (app (the_default [] (Option.map (map (fn f => f (Toplevel.theory_of st))) ps)) 
14105  1209 
(get_test_params (Toplevel.theory_of st), [])) g st))); 
1210 

17549  1211 
val valueP = 
1212 
OuterSyntax.improper_command "value" "read, evaluate and print term" K.diag 

1213 
(P.term >> (Toplevel.no_timing oo print_evaluated_term)); 

1214 

17144  1215 
val _ = OuterSyntax.add_keywords ["attach", "file", "contains"]; 
16769
7f188f2127f7
Implemented mechanism for attaching auxiliary code to consts_code and
berghofe
parents:
16649
diff
changeset

1216 

15801  1217 
val _ = OuterSyntax.add_parsers 
17549  1218 
[assoc_typeP, assoc_constP, code_libraryP, code_moduleP, test_paramsP, testP, valueP]; 
11520  1219 

1220 
end; 