author | wenzelm |
Thu, 09 Jun 2011 16:34:49 +0200 | |
changeset 43324 | 2b47822868e4 |
parent 42411 | ff997038e8eb |
child 44121 | 44adaa6db327 |
permissions | -rw-r--r-- |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
1 |
(* Title: HOL/Tools/Datatype/datatype_codegen.ML |
29265
5b4247055bd7
moved old add_term_vars, add_term_frees etc. to structure OldTerm;
wenzelm
parents:
28965
diff
changeset
|
2 |
Author: Stefan Berghofer and Florian Haftmann, TU Muenchen |
12445 | 3 |
|
25534
d0b74fdd6067
simplified infrastructure for code generator operational equality
haftmann
parents:
25505
diff
changeset
|
4 |
Code generator facilities for inductive datatypes. |
12445 | 5 |
*) |
6 |
||
7 |
signature DATATYPE_CODEGEN = |
|
8 |
sig |
|
18708 | 9 |
val setup: theory -> theory |
12445 | 10 |
end; |
11 |
||
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
12 |
structure Datatype_Codegen : DATATYPE_CODEGEN = |
12445 | 13 |
struct |
14 |
||
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
15 |
(** generic code generator **) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
16 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
17 |
(* liberal addition of code data for datatypes *) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
18 |
|
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
19 |
fun mk_constr_consts thy vs tyco cos = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
20 |
let |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
21 |
val cs = map (fn (c, tys) => (c, tys ---> Type (tyco, map TFree vs))) cos; |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
22 |
val cs' = map (fn c_ty as (_, ty) => (AxClass.unoverload_const thy c_ty, ty)) cs; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
23 |
in if is_some (try (Code.constrset_of_consts thy) cs') |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
24 |
then SOME cs |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
25 |
else NONE |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
26 |
end; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
27 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
28 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
29 |
(* case certificates *) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
30 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
31 |
fun mk_case_cert thy tyco = |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
32 |
let |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
33 |
val raw_thms = |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
34 |
(#case_rewrites o Datatype_Data.the_info thy) tyco; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
35 |
val thms as hd_thm :: _ = raw_thms |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
36 |
|> Conjunction.intr_balanced |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
37 |
|> Thm.unvarify_global |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
38 |
|> Conjunction.elim_balanced (length raw_thms) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
39 |
|> map Simpdata.mk_meta_eq |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
40 |
|> map Drule.zero_var_indexes |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
41 |
val params = fold_aterms (fn (Free (v, _)) => insert (op =) v |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
42 |
| _ => I) (Thm.prop_of hd_thm) []; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
43 |
val rhs = hd_thm |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
44 |
|> Thm.prop_of |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
45 |
|> Logic.dest_equals |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
46 |
|> fst |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
47 |
|> Term.strip_comb |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
48 |
|> apsnd (fst o split_last) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
49 |
|> list_comb; |
43324
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
42411
diff
changeset
|
50 |
val lhs = Free (singleton (Name.variant_list params) "case", Term.fastype_of rhs); |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
51 |
val asm = (Thm.cterm_of thy o Logic.mk_equals) (lhs, rhs); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
52 |
in |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
53 |
thms |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
54 |
|> Conjunction.intr_balanced |
41228
e1fce873b814
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm
parents:
40844
diff
changeset
|
55 |
|> Raw_Simplifier.rewrite_rule [(Thm.symmetric o Thm.assume) asm] |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
56 |
|> Thm.implies_intr asm |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
57 |
|> Thm.generalize ([], params) 0 |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
58 |
|> AxClass.unoverload thy |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
59 |
|> Thm.varifyT_global |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
60 |
end; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
61 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
62 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
63 |
(* equality *) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
64 |
|
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
65 |
fun mk_eq_eqns thy tyco = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
66 |
let |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
67 |
val (vs, cos) = Datatype_Data.the_spec thy tyco; |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
68 |
val { descr, index, inject = inject_thms, distinct = distinct_thms, ... } = |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
69 |
Datatype_Data.the_info thy tyco; |
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
70 |
val ty = Type (tyco, map TFree vs); |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38538
diff
changeset
|
71 |
fun mk_eq (t1, t2) = Const (@{const_name HOL.equal}, ty --> ty --> HOLogic.boolT) |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
72 |
$ t1 $ t2; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
73 |
fun true_eq t12 = HOLogic.mk_eq (mk_eq t12, HOLogic.true_const); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
74 |
fun false_eq t12 = HOLogic.mk_eq (mk_eq t12, HOLogic.false_const); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
75 |
val triv_injects = map_filter |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
76 |
(fn (c, []) => SOME (HOLogic.mk_Trueprop (true_eq (Const (c, ty), Const (c, ty)))) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
77 |
| _ => NONE) cos; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
78 |
fun prep_inject (trueprop $ (equiv $ (_ $ t1 $ t2) $ rhs)) = |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
79 |
trueprop $ (equiv $ mk_eq (t1, t2) $ rhs); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
80 |
val injects = map prep_inject (nth (Datatype_Prop.make_injs [descr] vs) index); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
81 |
fun prep_distinct (trueprop $ (not $ (_ $ t1 $ t2))) = |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
82 |
[trueprop $ false_eq (t1, t2), trueprop $ false_eq (t2, t1)]; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
83 |
val distincts = maps prep_distinct (snd (nth (Datatype_Prop.make_distincts [descr] vs) index)); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
84 |
val refl = HOLogic.mk_Trueprop (true_eq (Free ("x", ty), Free ("x", ty))); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
85 |
val simpset = Simplifier.global_context thy (HOL_basic_ss addsimps |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38538
diff
changeset
|
86 |
(map Simpdata.mk_eq (@{thm equal} :: @{thm eq_True} :: inject_thms @ distinct_thms))); |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
87 |
fun prove prop = Skip_Proof.prove_global thy [] [] prop (K (ALLGOALS (simp_tac simpset))) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
88 |
|> Simpdata.mk_eq; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
89 |
in (map prove (triv_injects @ injects @ distincts), prove refl) end; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
90 |
|
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
91 |
fun add_equality vs tycos thy = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
92 |
let |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
93 |
fun add_def tyco lthy = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
94 |
let |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
95 |
val ty = Type (tyco, map TFree vs); |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
96 |
fun mk_side const_name = Const (const_name, ty --> ty --> HOLogic.boolT) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
97 |
$ Free ("x", ty) $ Free ("y", ty); |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
98 |
val def = HOLogic.mk_Trueprop (HOLogic.mk_eq |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38857
diff
changeset
|
99 |
(mk_side @{const_name HOL.equal}, mk_side @{const_name HOL.eq})); |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
100 |
val def' = Syntax.check_term lthy def; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
101 |
val ((_, (_, thm)), lthy') = Specification.definition |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
102 |
(NONE, (Attrib.empty_binding, def')) lthy; |
42361 | 103 |
val ctxt_thy = Proof_Context.init_global (Proof_Context.theory_of lthy); |
104 |
val thm' = singleton (Proof_Context.export lthy' ctxt_thy) thm; |
|
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
105 |
in (thm', lthy') end; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
106 |
fun tac thms = Class.intro_classes_tac [] |
42361 | 107 |
THEN ALLGOALS (Proof_Context.fact_tac thms); |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
108 |
fun prefix tyco = Binding.qualify true (Long_Name.base_name tyco) o Binding.qualify true "eq" o Binding.name; |
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
109 |
fun add_eq_thms tyco = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
110 |
Theory.checkpoint |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
111 |
#> `(fn thy => mk_eq_eqns thy tyco) |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
38864
diff
changeset
|
112 |
#-> (fn (thms, thm) => Global_Theory.note_thmss Thm.lemmaK |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
113 |
[((prefix tyco "refl", [Code.add_nbe_default_eqn_attribute]), [([thm], [])]), |
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
114 |
((prefix tyco "simps", [Code.add_default_eqn_attribute]), [(rev thms, [])])]) |
37425 | 115 |
#> snd |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
116 |
in |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
117 |
thy |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38538
diff
changeset
|
118 |
|> Class.instantiation (tycos, vs, [HOLogic.class_equal]) |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
119 |
|> fold_map add_def tycos |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
120 |
|-> (fn def_thms => Class.prove_instantiation_exit_result (map o Morphism.thm) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
121 |
(fn _ => fn def_thms => tac def_thms) def_thms) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
122 |
|-> (fn def_thms => fold Code.del_eqn def_thms) |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
123 |
|> fold add_eq_thms tycos |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
124 |
end; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
125 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
126 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
127 |
(* register a datatype etc. *) |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
128 |
|
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
129 |
fun add_all_code config tycos thy = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
130 |
let |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
131 |
val (vs :: _, coss) = (split_list o map (Datatype_Data.the_spec thy)) tycos; |
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
132 |
val any_css = map2 (mk_constr_consts thy vs) tycos coss; |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
133 |
val css = if exists is_none any_css then [] |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
134 |
else map_filter I any_css; |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
135 |
val case_rewrites = maps (#case_rewrites o Datatype_Data.the_info thy) tycos; |
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
136 |
val certs = map (mk_case_cert thy) tycos; |
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
137 |
val tycos_eq = filter_out |
38857
97775f3e8722
renamed class/constant eq to equal; tuned some instantiations
haftmann
parents:
38538
diff
changeset
|
138 |
(fn tyco => can (Sorts.mg_domain (Sign.classes_of thy) tyco) [HOLogic.class_equal]) tycos; |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
139 |
in |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
140 |
if null css then thy |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
141 |
else thy |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
142 |
|> tap (fn _ => Datatype_Aux.message config "Registering datatype for code generator ...") |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
143 |
|> fold Code.add_datatype css |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
144 |
|> fold_rev Code.add_default_eqn case_rewrites |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
145 |
|> fold Code.add_case certs |
38538
c87b69396a37
liberal instantiation of class eq; tuned naming scheme
haftmann
parents:
38348
diff
changeset
|
146 |
|> not (null tycos_eq) ? add_equality vs tycos_eq |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
147 |
end; |
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
148 |
|
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
149 |
|
31625 | 150 |
(** SML code generator **) |
151 |
||
152 |
(* datatype definition *) |
|
153 |
||
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
154 |
fun add_dt_defs thy mode defs dep module descr sorts gr = |
12445 | 155 |
let |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
156 |
val descr' = filter (can (map Datatype_Aux.dest_DtTFree o #2 o snd)) descr; |
33317 | 157 |
val rtnames = map (#1 o snd) (filter (fn (_, (_, _, cs)) => |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
158 |
exists (exists Datatype_Aux.is_rec_type o snd) cs) descr'); |
12445 | 159 |
|
17144 | 160 |
val (_, (tname, _, _)) :: _ = descr'; |
161 |
val node_id = tname ^ " (type)"; |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
162 |
val module' = Codegen.if_library mode (Codegen.thyname_of_type thy tname) module; |
12445 | 163 |
|
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
164 |
fun mk_dtdef prfx [] gr = ([], gr) |
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
165 |
| mk_dtdef prfx ((_, (tname, dts, cs))::xs) gr = |
12445 | 166 |
let |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
167 |
val tvs = map Datatype_Aux.dest_DtTFree dts; |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
168 |
val cs' = map (apsnd (map (Datatype_Aux.typ_of_dtyp descr sorts))) cs; |
41424 | 169 |
val ((_, type_id), gr') = Codegen.mk_type_id module' tname gr; |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
170 |
val (ps, gr'') = gr' |> |
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
171 |
fold_map (fn (cname, cargs) => |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
172 |
fold_map (Codegen.invoke_tycodegen thy mode defs node_id module' false) |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
173 |
cargs ##>> |
41424 | 174 |
Codegen.mk_const_id module' cname) cs'; |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
175 |
val (rest, gr''') = mk_dtdef "and " xs gr'' |
12445 | 176 |
in |
41424 | 177 |
(Pretty.block (Codegen.str prfx :: |
12445 | 178 |
(if null tvs then [] else |
41424 | 179 |
[Codegen.mk_tuple (map Codegen.str tvs), Codegen.str " "]) @ |
180 |
[Codegen.str (type_id ^ " ="), Pretty.brk 1] @ |
|
181 |
flat (separate [Pretty.brk 1, Codegen.str "| "] |
|
17144 | 182 |
(map (fn (ps', (_, cname)) => [Pretty.block |
41424 | 183 |
(Codegen.str cname :: |
12445 | 184 |
(if null ps' then [] else |
41424 | 185 |
flat ([Codegen.str " of", Pretty.brk 1] :: |
186 |
separate [Codegen.str " *", Pretty.brk 1] |
|
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
187 |
(map single ps'))))]) ps))) :: rest, gr''') |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
188 |
end; |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
189 |
|
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
190 |
fun mk_constr_term cname Ts T ps = |
41424 | 191 |
flat (separate [Codegen.str " $", Pretty.brk 1] |
192 |
([Codegen.str ("Const (\"" ^ cname ^ "\","), Pretty.brk 1, |
|
193 |
Codegen.mk_type false (Ts ---> T), Codegen.str ")"] :: ps)); |
|
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
194 |
|
17144 | 195 |
fun mk_term_of_def gr prfx [] = [] |
196 |
| mk_term_of_def gr prfx ((_, (tname, dts, cs)) :: xs) = |
|
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
197 |
let |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
198 |
val cs' = map (apsnd (map (Datatype_Aux.typ_of_dtyp descr sorts))) cs; |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
199 |
val dts' = map (Datatype_Aux.typ_of_dtyp descr sorts) dts; |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
200 |
val T = Type (tname, dts'); |
17144 | 201 |
val rest = mk_term_of_def gr "and " xs; |
31458 | 202 |
val (eqs, _) = fold_map (fn (cname, Ts) => fn prfx => |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
203 |
let val args = map (fn i => |
41424 | 204 |
Codegen.str ("x" ^ string_of_int i)) (1 upto length Ts) |
31458 | 205 |
in (Pretty.blk (4, |
41424 | 206 |
[Codegen.str prfx, Codegen.mk_term_of gr module' false T, Pretty.brk 1, |
207 |
if null Ts then Codegen.str (snd (Codegen.get_const_id gr cname)) |
|
208 |
else Codegen.parens (Pretty.block |
|
209 |
[Codegen.str (snd (Codegen.get_const_id gr cname)), |
|
210 |
Pretty.brk 1, Codegen.mk_tuple args]), |
|
211 |
Codegen.str " =", Pretty.brk 1] @ |
|
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
212 |
mk_constr_term cname Ts T |
41424 | 213 |
(map2 (fn x => fn U => [Pretty.block [Codegen.mk_term_of gr module' false U, |
31458 | 214 |
Pretty.brk 1, x]]) args Ts)), " | ") |
215 |
end) cs' prfx |
|
14104 | 216 |
in eqs @ rest end; |
217 |
||
17144 | 218 |
fun mk_gen_of_def gr prfx [] = [] |
219 |
| mk_gen_of_def gr prfx ((i, (tname, dts, cs)) :: xs) = |
|
14104 | 220 |
let |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
221 |
val tvs = map Datatype_Aux.dest_DtTFree dts; |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
222 |
val Us = map (Datatype_Aux.typ_of_dtyp descr sorts) dts; |
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
223 |
val T = Type (tname, Us); |
14104 | 224 |
val (cs1, cs2) = |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
225 |
List.partition (exists Datatype_Aux.is_rec_type o snd) cs; |
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
226 |
val SOME (cname, _) = Datatype_Aux.find_shortest_path descr i; |
14104 | 227 |
|
228 |
fun mk_delay p = Pretty.block |
|
41424 | 229 |
[Codegen.str "fn () =>", Pretty.brk 1, p]; |
14104 | 230 |
|
41424 | 231 |
fun mk_force p = Pretty.block [p, Pretty.brk 1, Codegen.str "()"]; |
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
232 |
|
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
233 |
fun mk_constr s b (cname, dts) = |
14104 | 234 |
let |
41424 | 235 |
val gs = map (fn dt => Codegen.mk_app false |
236 |
(Codegen.mk_gen gr module' false rtnames s |
|
237 |
(Datatype_Aux.typ_of_dtyp descr sorts dt)) |
|
238 |
[Codegen.str (if b andalso Datatype_Aux.is_rec_type dt then "0" |
|
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
239 |
else "j")]) dts; |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
240 |
val Ts = map (Datatype_Aux.typ_of_dtyp descr sorts) dts; |
41424 | 241 |
val xs = map Codegen.str |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
242 |
(Datatype_Prop.indexify_names (replicate (length dts) "x")); |
41424 | 243 |
val ts = map Codegen.str |
33968
f94fb13ecbb3
modernized structures and tuned headers of datatype package modules; joined former datatype.ML and datatype_rep_proofs.ML
haftmann
parents:
33964
diff
changeset
|
244 |
(Datatype_Prop.indexify_names (replicate (length dts) "t")); |
41424 | 245 |
val (_, id) = Codegen.get_const_id gr cname; |
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
246 |
in |
41424 | 247 |
Codegen.mk_let |
248 |
(map2 (fn p => fn q => Codegen.mk_tuple [p, q]) xs ts ~~ gs) |
|
249 |
(Codegen.mk_tuple |
|
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
250 |
[case xs of |
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
251 |
_ :: _ :: _ => Pretty.block |
41424 | 252 |
[Codegen.str id, Pretty.brk 1, Codegen.mk_tuple xs] |
253 |
| _ => Codegen.mk_app false (Codegen.str id) xs, |
|
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
254 |
mk_delay (Pretty.block (mk_constr_term cname Ts T |
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
255 |
(map (single o mk_force) ts)))]) |
14104 | 256 |
end; |
257 |
||
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
258 |
fun mk_choice [c] = mk_constr "(i-1)" false c |
41424 | 259 |
| mk_choice cs = Pretty.block [Codegen.str "one_of", |
260 |
Pretty.brk 1, Pretty.blk (1, Codegen.str "[" :: |
|
261 |
flat (separate [Codegen.str ",", Pretty.fbrk] |
|
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
262 |
(map (single o mk_delay o mk_constr "(i-1)" false) cs)) @ |
41424 | 263 |
[Codegen.str "]"]), Pretty.brk 1, Codegen.str "()"]; |
14104 | 264 |
|
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
265 |
val gs = maps (fn s => |
41424 | 266 |
let val s' = Codegen.strip_tname s |
267 |
in [Codegen.str (s' ^ "G"), Codegen.str (s' ^ "T")] end) tvs; |
|
268 |
val gen_name = "gen_" ^ snd (Codegen.get_type_id gr tname) |
|
14104 | 269 |
|
270 |
in |
|
271 |
Pretty.blk (4, separate (Pretty.brk 1) |
|
41424 | 272 |
(Codegen.str (prfx ^ gen_name ^ |
14104 | 273 |
(if null cs1 then "" else "'")) :: gs @ |
41424 | 274 |
(if null cs1 then [] else [Codegen.str "i"]) @ |
275 |
[Codegen.str "j"]) @ |
|
276 |
[Codegen.str " =", Pretty.brk 1] @ |
|
14104 | 277 |
(if not (null cs1) andalso not (null cs2) |
41424 | 278 |
then [Codegen.str "frequency", Pretty.brk 1, |
279 |
Pretty.blk (1, [Codegen.str "[", |
|
280 |
Codegen.mk_tuple [Codegen.str "i", mk_delay (mk_choice cs1)], |
|
281 |
Codegen.str ",", Pretty.fbrk, |
|
282 |
Codegen.mk_tuple [Codegen.str "1", mk_delay (mk_choice cs2)], |
|
283 |
Codegen.str "]"]), Pretty.brk 1, Codegen.str "()"] |
|
14104 | 284 |
else if null cs2 then |
41424 | 285 |
[Pretty.block [Codegen.str "(case", Pretty.brk 1, |
286 |
Codegen.str "i", Pretty.brk 1, Codegen.str "of", |
|
287 |
Pretty.brk 1, Codegen.str "0 =>", Pretty.brk 1, |
|
33035 | 288 |
mk_constr "0" true (cname, the (AList.lookup (op =) cs cname)), |
41424 | 289 |
Pretty.brk 1, Codegen.str "| _ =>", Pretty.brk 1, |
290 |
mk_choice cs1, Codegen.str ")"]] |
|
14104 | 291 |
else [mk_choice cs2])) :: |
292 |
(if null cs1 then [] |
|
293 |
else [Pretty.blk (4, separate (Pretty.brk 1) |
|
41424 | 294 |
(Codegen.str ("and " ^ gen_name) :: gs @ [Codegen.str "i"]) @ |
295 |
[Codegen.str " =", Pretty.brk 1] @ |
|
296 |
separate (Pretty.brk 1) (Codegen.str (gen_name ^ "'") :: gs @ |
|
297 |
[Codegen.str "i", Codegen.str "i"]))]) @ |
|
17144 | 298 |
mk_gen_of_def gr "and " xs |
14104 | 299 |
end |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
300 |
|
12445 | 301 |
in |
41424 | 302 |
(module', (Codegen.add_edge_acyclic (node_id, dep) gr |
12445 | 303 |
handle Graph.CYCLES _ => gr) handle Graph.UNDEF _ => |
304 |
let |
|
41424 | 305 |
val gr1 = Codegen.add_edge (node_id, dep) |
306 |
(Codegen.new_node (node_id, (NONE, "", "")) gr); |
|
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
307 |
val (dtdef, gr2) = mk_dtdef "datatype " descr' gr1 ; |
12445 | 308 |
in |
41424 | 309 |
Codegen.map_node node_id (K (NONE, module', |
310 |
Codegen.string_of (Pretty.blk (0, separate Pretty.fbrk dtdef @ |
|
311 |
[Codegen.str ";"])) ^ "\n\n" ^ |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
312 |
(if member (op =) mode "term_of" then |
41424 | 313 |
Codegen.string_of (Pretty.blk (0, separate Pretty.fbrk |
314 |
(mk_term_of_def gr2 "fun " descr') @ [Codegen.str ";"])) ^ "\n\n" |
|
14104 | 315 |
else "") ^ |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
316 |
(if member (op =) mode "test" then |
41424 | 317 |
Codegen.string_of (Pretty.blk (0, separate Pretty.fbrk |
318 |
(mk_gen_of_def gr2 "fun " descr') @ [Codegen.str ";"])) ^ "\n\n" |
|
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
319 |
else ""))) gr2 |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
320 |
end) |
12445 | 321 |
end; |
322 |
||
323 |
||
31625 | 324 |
(* case expressions *) |
12445 | 325 |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
326 |
fun pretty_case thy mode defs dep module brack constrs (c as Const (_, T)) ts gr = |
12445 | 327 |
let val i = length constrs |
328 |
in if length ts <= i then |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
329 |
Codegen.invoke_codegen thy mode defs dep module brack (Codegen.eta_expand c ts (i+1)) gr |
12445 | 330 |
else |
331 |
let |
|
33957 | 332 |
val ts1 = take i ts; |
333 |
val t :: ts2 = drop i ts; |
|
30190 | 334 |
val names = List.foldr OldTerm.add_term_names |
335 |
(map (fst o fst o dest_Var) (List.foldr OldTerm.add_term_vars [] ts1)) ts1; |
|
40844 | 336 |
val (Ts, dT) = split_last (take (i+1) (binder_types T)); |
12445 | 337 |
|
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
338 |
fun pcase [] [] [] gr = ([], gr) |
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
339 |
| pcase ((cname, cargs)::cs) (t::ts) (U::Us) gr = |
12445 | 340 |
let |
341 |
val j = length cargs; |
|
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19886
diff
changeset
|
342 |
val xs = Name.variant_list names (replicate j "x"); |
40844 | 343 |
val Us' = take j (binder_types U); |
33957 | 344 |
val frees = map2 (curry Free) xs Us'; |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
345 |
val (cp, gr0) = Codegen.invoke_codegen thy mode defs dep module false |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
346 |
(list_comb (Const (cname, Us' ---> dT), frees)) gr; |
12445 | 347 |
val t' = Envir.beta_norm (list_comb (t, frees)); |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
348 |
val (p, gr1) = Codegen.invoke_codegen thy mode defs dep module false t' gr0; |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
349 |
val (ps, gr2) = pcase cs ts Us gr1; |
12445 | 350 |
in |
41424 | 351 |
([Pretty.block [cp, Codegen.str " =>", Pretty.brk 1, p]] :: ps, gr2) |
12445 | 352 |
end; |
353 |
||
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
354 |
val (ps1, gr1) = pcase constrs ts1 Ts gr ; |
41424 | 355 |
val ps = flat (separate [Pretty.brk 1, Codegen.str "| "] ps1); |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
356 |
val (p, gr2) = Codegen.invoke_codegen thy mode defs dep module false t gr1; |
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
357 |
val (ps2, gr3) = fold_map (Codegen.invoke_codegen thy mode defs dep module true) ts2 gr2; |
41424 | 358 |
in ((if not (null ts2) andalso brack then Codegen.parens else I) |
12445 | 359 |
(Pretty.block (separate (Pretty.brk 1) |
41424 | 360 |
(Pretty.block ([Codegen.str "(case ", p, Codegen.str " of", |
361 |
Pretty.brk 1] @ ps @ [Codegen.str ")"]) :: ps2))), gr3) |
|
12445 | 362 |
end |
363 |
end; |
|
364 |
||
365 |
||
31625 | 366 |
(* constructors *) |
12445 | 367 |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
368 |
fun pretty_constr thy mode defs dep module brack args (c as Const (s, T)) ts gr = |
12445 | 369 |
let val i = length args |
370 |
in if i > 1 andalso length ts < i then |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
371 |
Codegen.invoke_codegen thy mode defs dep module brack (Codegen.eta_expand c ts i) gr |
12445 | 372 |
else |
373 |
let |
|
41424 | 374 |
val id = Codegen.mk_qual_id module (Codegen.get_const_id gr s); |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
375 |
val (ps, gr') = fold_map |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
376 |
(Codegen.invoke_codegen thy mode defs dep module (i = 1)) ts gr; |
41424 | 377 |
in |
378 |
(case args of |
|
379 |
_ :: _ :: _ => (if brack then Codegen.parens else I) |
|
380 |
(Pretty.block [Codegen.str id, Pretty.brk 1, Codegen.mk_tuple ps]) |
|
381 |
| _ => (Codegen.mk_app brack (Codegen.str id) ps), gr') |
|
12445 | 382 |
end |
383 |
end; |
|
384 |
||
385 |
||
31625 | 386 |
(* code generators for terms and types *) |
12445 | 387 |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
388 |
fun datatype_codegen thy mode defs dep module brack t gr = |
40844 | 389 |
(case strip_comb t of |
390 |
(c as Const (s, T), ts) => |
|
391 |
(case Datatype_Data.info_of_case thy s of |
|
22778
a5b87573f427
Streamlined datatype_codegen function using new datatype_of_case
berghofe
parents:
22746
diff
changeset
|
392 |
SOME {index, descr, ...} => |
41424 | 393 |
if is_some (Codegen.get_assoc_code thy (s, T)) then NONE |
40844 | 394 |
else |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
395 |
SOME (pretty_case thy mode defs dep module brack |
40844 | 396 |
(#3 (the (AList.lookup op = descr index))) c ts gr) |
397 |
| NONE => |
|
398 |
(case (Datatype_Data.info_of_constr thy (s, T), body_type T) of |
|
399 |
(SOME {index, descr, ...}, U as Type (tyname, _)) => |
|
41424 | 400 |
if is_some (Codegen.get_assoc_code thy (s, T)) then NONE |
40844 | 401 |
else |
402 |
let |
|
403 |
val SOME (tyname', _, constrs) = AList.lookup op = descr index; |
|
404 |
val SOME args = AList.lookup op = constrs s; |
|
405 |
in |
|
406 |
if tyname <> tyname' then NONE |
|
407 |
else |
|
408 |
SOME |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
409 |
(pretty_constr thy mode defs |
40844 | 410 |
dep module brack args c ts |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
411 |
(snd (Codegen.invoke_tycodegen thy mode defs dep module false U gr))) |
40844 | 412 |
end |
413 |
| _ => NONE)) |
|
414 |
| _ => NONE); |
|
12445 | 415 |
|
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
416 |
fun datatype_tycodegen thy mode defs dep module brack (Type (s, Ts)) gr = |
33964 | 417 |
(case Datatype_Data.get_info thy s of |
15531 | 418 |
NONE => NONE |
25889
c93803252748
Test data generation and conversion to terms is now more closely
berghofe
parents:
25864
diff
changeset
|
419 |
| SOME {descr, sorts, ...} => |
41424 | 420 |
if is_some (Codegen.get_assoc_type thy s) then NONE else |
16645 | 421 |
let |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
422 |
val (ps, gr') = fold_map |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
423 |
(Codegen.invoke_tycodegen thy mode defs dep module false) Ts gr; |
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
424 |
val (module', gr'') = add_dt_defs thy mode defs dep module descr sorts gr' ; |
41424 | 425 |
val (tyid, gr''') = Codegen.mk_type_id module' s gr'' |
28537
1e84256d1a8a
established canonical argument order in SML code generators
haftmann
parents:
28423
diff
changeset
|
426 |
in SOME (Pretty.block ((if null Ts then [] else |
41424 | 427 |
[Codegen.mk_tuple ps, Codegen.str " "]) @ |
428 |
[Codegen.str (Codegen.mk_qual_id module tyid)]), gr''') |
|
12445 | 429 |
end) |
42411
ff997038e8eb
eliminated Codegen.mode in favour of explicit argument;
wenzelm
parents:
42361
diff
changeset
|
430 |
| datatype_tycodegen _ _ _ _ _ _ _ _ = NONE; |
12445 | 431 |
|
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
432 |
|
20426 | 433 |
(** theory setup **) |
434 |
||
19008 | 435 |
val setup = |
36298
2d55c4aba1dc
swapped generic code generator and SML code generator
haftmann
parents:
35899
diff
changeset
|
436 |
Datatype_Data.interpretation add_all_code |
41424 | 437 |
#> Codegen.add_codegen "datatype" datatype_codegen |
438 |
#> Codegen.add_tycodegen "datatype" datatype_tycodegen; |
|
20597 | 439 |
|
12445 | 440 |
end; |