author | haftmann |
Fri, 02 Dec 2005 16:05:12 +0100 | |
changeset 18334 | a41ce9c10b73 |
parent 18247 | b17724cae935 |
child 18379 | 87cb7e641ba5 |
permissions | -rw-r--r-- |
12446 | 1 |
(* Title: HOL/datatype_codegen.ML |
12445 | 2 |
ID: $Id$ |
3 |
Author: Stefan Berghofer, TU Muenchen |
|
4 |
||
5 |
Code generator for inductive datatypes. |
|
6 |
*) |
|
7 |
||
8 |
signature DATATYPE_CODEGEN = |
|
9 |
sig |
|
18220 | 10 |
val is_datatype: theory -> string -> bool |
11 |
val get_datatype: theory -> string -> (string list * string list) option |
|
12 |
val get_datacons: theory -> string * string -> typ list option |
|
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
13 |
val get_case_const_data: theory -> string -> (string * int) list option; |
12445 | 14 |
val setup: (theory -> theory) list |
15 |
end; |
|
16 |
||
17 |
structure DatatypeCodegen : DATATYPE_CODEGEN = |
|
18 |
struct |
|
19 |
||
20 |
open Codegen; |
|
21 |
||
22 |
fun mk_tuple [p] = p |
|
23 |
| mk_tuple ps = Pretty.block (Pretty.str "(" :: |
|
15570 | 24 |
List.concat (separate [Pretty.str ",", Pretty.brk 1] (map single ps)) @ |
12445 | 25 |
[Pretty.str ")"]); |
26 |
||
27 |
(**** datatype definition ****) |
|
28 |
||
14104 | 29 |
(* find shortest path to constructor with no recursive arguments *) |
30 |
||
31 |
fun find_nonempty (descr: DatatypeAux.descr) is i = |
|
32 |
let |
|
17521 | 33 |
val (_, _, constrs) = valOf (AList.lookup (op =) descr i); |
15531 | 34 |
fun arg_nonempty (_, DatatypeAux.DtRec i) = if i mem is then NONE |
15570 | 35 |
else Option.map (curry op + 1 o snd) (find_nonempty descr (i::is) i) |
15531 | 36 |
| arg_nonempty _ = SOME 0; |
15570 | 37 |
fun max xs = Library.foldl |
15531 | 38 |
(fn (NONE, _) => NONE |
39 |
| (SOME i, SOME j) => SOME (Int.max (i, j)) |
|
40 |
| (_, NONE) => NONE) (SOME 0, xs); |
|
14104 | 41 |
val xs = sort (int_ord o pairself snd) |
15570 | 42 |
(List.mapPartial (fn (s, dts) => Option.map (pair s) |
14104 | 43 |
(max (map (arg_nonempty o DatatypeAux.strip_dtyp) dts))) constrs) |
15531 | 44 |
in case xs of [] => NONE | x :: _ => SOME x end; |
14104 | 45 |
|
17144 | 46 |
fun add_dt_defs thy defs dep module gr (descr: DatatypeAux.descr) = |
12445 | 47 |
let |
48 |
val sg = sign_of thy; |
|
49 |
val tab = DatatypePackage.get_datatypes thy; |
|
50 |
||
15570 | 51 |
val descr' = List.filter (can (map DatatypeAux.dest_DtTFree o #2 o snd)) descr; |
52 |
val rtnames = map (#1 o snd) (List.filter (fn (_, (_, _, cs)) => |
|
14104 | 53 |
exists (exists DatatypeAux.is_rec_type o snd) cs) descr'); |
12445 | 54 |
|
17144 | 55 |
val (_, (tname, _, _)) :: _ = descr'; |
56 |
val node_id = tname ^ " (type)"; |
|
57 |
val module' = if_library (thyname_of_type tname thy) module; |
|
12445 | 58 |
|
59 |
fun mk_dtdef gr prfx [] = (gr, []) |
|
60 |
| mk_dtdef gr prfx ((_, (tname, dts, cs))::xs) = |
|
61 |
let |
|
62 |
val tvs = map DatatypeAux.dest_DtTFree dts; |
|
63 |
val sorts = map (rpair []) tvs; |
|
64 |
val cs' = map (apsnd (map (DatatypeAux.typ_of_dtyp descr sorts))) cs; |
|
17144 | 65 |
val (gr', (_, type_id)) = mk_type_id module' tname gr; |
66 |
val (gr'', ps) = |
|
67 |
foldl_map (fn (gr, (cname, cargs)) => |
|
68 |
foldl_map (invoke_tycodegen thy defs node_id module' false) |
|
69 |
(gr, cargs) |>>> |
|
70 |
mk_const_id module' cname) (gr', cs'); |
|
71 |
val (gr''', rest) = mk_dtdef gr'' "and " xs |
|
12445 | 72 |
in |
17144 | 73 |
(gr''', |
12445 | 74 |
Pretty.block (Pretty.str prfx :: |
75 |
(if null tvs then [] else |
|
76 |
[mk_tuple (map Pretty.str tvs), Pretty.str " "]) @ |
|
17144 | 77 |
[Pretty.str (type_id ^ " ="), Pretty.brk 1] @ |
15570 | 78 |
List.concat (separate [Pretty.brk 1, Pretty.str "| "] |
17144 | 79 |
(map (fn (ps', (_, cname)) => [Pretty.block |
80 |
(Pretty.str cname :: |
|
12445 | 81 |
(if null ps' then [] else |
15570 | 82 |
List.concat ([Pretty.str " of", Pretty.brk 1] :: |
12445 | 83 |
separate [Pretty.str " *", Pretty.brk 1] |
84 |
(map single ps'))))]) ps))) :: rest) |
|
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
85 |
end; |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
86 |
|
17144 | 87 |
fun mk_term_of_def gr prfx [] = [] |
88 |
| 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
|
89 |
let |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
90 |
val tvs = map DatatypeAux.dest_DtTFree dts; |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
91 |
val sorts = map (rpair []) tvs; |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
92 |
val cs' = map (apsnd (map (DatatypeAux.typ_of_dtyp descr sorts))) cs; |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
93 |
val dts' = map (DatatypeAux.typ_of_dtyp descr sorts) dts; |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
94 |
val T = Type (tname, dts'); |
17144 | 95 |
val rest = mk_term_of_def gr "and " xs; |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
96 |
val (_, eqs) = foldl_map (fn (prfx, (cname, Ts)) => |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
97 |
let val args = map (fn i => |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
98 |
Pretty.str ("x" ^ string_of_int i)) (1 upto length Ts) |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
99 |
in (" | ", Pretty.blk (4, |
17144 | 100 |
[Pretty.str prfx, mk_term_of gr module' false T, Pretty.brk 1, |
101 |
if null Ts then Pretty.str (snd (get_const_id cname gr)) |
|
16645 | 102 |
else parens (Pretty.block |
17144 | 103 |
[Pretty.str (snd (get_const_id cname gr)), |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
104 |
Pretty.brk 1, mk_tuple args]), |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
105 |
Pretty.str " =", Pretty.brk 1] @ |
15570 | 106 |
List.concat (separate [Pretty.str " $", Pretty.brk 1] |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
107 |
([Pretty.str ("Const (\"" ^ cname ^ "\","), Pretty.brk 1, |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
108 |
mk_type false (Ts ---> T), Pretty.str ")"] :: |
17144 | 109 |
map (fn (x, U) => [Pretty.block [mk_term_of gr module' false U, |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
110 |
Pretty.brk 1, x]]) (args ~~ Ts))))) |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
111 |
end) (prfx, cs') |
14104 | 112 |
in eqs @ rest end; |
113 |
||
17144 | 114 |
fun mk_gen_of_def gr prfx [] = [] |
115 |
| mk_gen_of_def gr prfx ((i, (tname, dts, cs)) :: xs) = |
|
14104 | 116 |
let |
117 |
val tvs = map DatatypeAux.dest_DtTFree dts; |
|
118 |
val sorts = map (rpair []) tvs; |
|
119 |
val (cs1, cs2) = |
|
15570 | 120 |
List.partition (exists DatatypeAux.is_rec_type o snd) cs; |
15531 | 121 |
val SOME (cname, _) = find_nonempty descr [i] i; |
14104 | 122 |
|
123 |
fun mk_delay p = Pretty.block |
|
124 |
[Pretty.str "fn () =>", Pretty.brk 1, p]; |
|
125 |
||
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
126 |
fun mk_constr s b (cname, dts) = |
14104 | 127 |
let |
17144 | 128 |
val gs = map (fn dt => mk_app false (mk_gen gr module' false rtnames s |
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
129 |
(DatatypeAux.typ_of_dtyp descr sorts dt)) |
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
130 |
[Pretty.str (if b andalso DatatypeAux.is_rec_type dt then "0" |
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
131 |
else "j")]) dts; |
17144 | 132 |
val (_, id) = get_const_id cname gr |
14104 | 133 |
in case gs of |
134 |
_ :: _ :: _ => Pretty.block |
|
135 |
[Pretty.str id, Pretty.brk 1, mk_tuple gs] |
|
136 |
| _ => mk_app false (Pretty.str id) (map parens gs) |
|
137 |
end; |
|
138 |
||
15397
5260ac75e07c
Fixed bug in mk_gen_of_def that could cause non-termination of the generator
berghofe
parents:
14981
diff
changeset
|
139 |
fun mk_choice [c] = mk_constr "(i-1)" false c |
14104 | 140 |
| mk_choice cs = Pretty.block [Pretty.str "one_of", |
141 |
Pretty.brk 1, Pretty.blk (1, Pretty.str "[" :: |
|
15570 | 142 |
List.concat (separate [Pretty.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
|
143 |
(map (single o mk_delay o mk_constr "(i-1)" false) cs)) @ |
14104 | 144 |
[Pretty.str "]"]), Pretty.brk 1, Pretty.str "()"]; |
145 |
||
146 |
val gs = map (Pretty.str o suffix "G" o strip_tname) tvs; |
|
17144 | 147 |
val gen_name = "gen_" ^ snd (get_type_id tname gr) |
14104 | 148 |
|
149 |
in |
|
150 |
Pretty.blk (4, separate (Pretty.brk 1) |
|
151 |
(Pretty.str (prfx ^ gen_name ^ |
|
152 |
(if null cs1 then "" else "'")) :: gs @ |
|
153 |
(if null cs1 then [] else [Pretty.str "i"]) @ |
|
154 |
[Pretty.str "j"]) @ |
|
155 |
[Pretty.str " =", Pretty.brk 1] @ |
|
156 |
(if not (null cs1) andalso not (null cs2) |
|
157 |
then [Pretty.str "frequency", Pretty.brk 1, |
|
158 |
Pretty.blk (1, [Pretty.str "[", |
|
159 |
mk_tuple [Pretty.str "i", mk_delay (mk_choice cs1)], |
|
160 |
Pretty.str ",", Pretty.fbrk, |
|
161 |
mk_tuple [Pretty.str "1", mk_delay (mk_choice cs2)], |
|
162 |
Pretty.str "]"]), Pretty.brk 1, Pretty.str "()"] |
|
163 |
else if null cs2 then |
|
164 |
[Pretty.block [Pretty.str "(case", Pretty.brk 1, |
|
165 |
Pretty.str "i", Pretty.brk 1, Pretty.str "of", |
|
166 |
Pretty.brk 1, Pretty.str "0 =>", Pretty.brk 1, |
|
17521 | 167 |
mk_constr "0" true (cname, valOf (AList.lookup (op =) cs cname)), |
14104 | 168 |
Pretty.brk 1, Pretty.str "| _ =>", Pretty.brk 1, |
169 |
mk_choice cs1, Pretty.str ")"]] |
|
170 |
else [mk_choice cs2])) :: |
|
171 |
(if null cs1 then [] |
|
172 |
else [Pretty.blk (4, separate (Pretty.brk 1) |
|
173 |
(Pretty.str ("and " ^ gen_name) :: gs @ [Pretty.str "i"]) @ |
|
174 |
[Pretty.str " =", Pretty.brk 1] @ |
|
175 |
separate (Pretty.brk 1) (Pretty.str (gen_name ^ "'") :: gs @ |
|
176 |
[Pretty.str "i", Pretty.str "i"]))]) @ |
|
17144 | 177 |
mk_gen_of_def gr "and " xs |
14104 | 178 |
end |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
179 |
|
12445 | 180 |
in |
17144 | 181 |
(add_edge_acyclic (node_id, dep) gr |
12445 | 182 |
handle Graph.CYCLES _ => gr) handle Graph.UNDEF _ => |
183 |
let |
|
17144 | 184 |
val gr1 = add_edge (node_id, dep) |
185 |
(new_node (node_id, (NONE, "", "")) gr); |
|
12445 | 186 |
val (gr2, dtdef) = mk_dtdef gr1 "datatype " descr'; |
187 |
in |
|
17144 | 188 |
map_node node_id (K (NONE, module', |
12445 | 189 |
Pretty.string_of (Pretty.blk (0, separate Pretty.fbrk dtdef @ |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
190 |
[Pretty.str ";"])) ^ "\n\n" ^ |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
191 |
(if "term_of" mem !mode then |
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
192 |
Pretty.string_of (Pretty.blk (0, separate Pretty.fbrk |
17144 | 193 |
(mk_term_of_def gr2 "fun " descr') @ [Pretty.str ";"])) ^ "\n\n" |
14104 | 194 |
else "") ^ |
195 |
(if "test" mem !mode then |
|
196 |
Pretty.string_of (Pretty.blk (0, separate Pretty.fbrk |
|
17144 | 197 |
(mk_gen_of_def gr2 "fun " descr') @ [Pretty.str ";"])) ^ "\n\n" |
13754
021cf00435a9
Code generator for datatypes now also generates suitable term_of functions (when
berghofe
parents:
12890
diff
changeset
|
198 |
else ""))) gr2 |
17144 | 199 |
end |
12445 | 200 |
end; |
201 |
||
202 |
||
203 |
(**** case expressions ****) |
|
204 |
||
17144 | 205 |
fun pretty_case thy defs gr dep module brack constrs (c as Const (_, T)) ts = |
12445 | 206 |
let val i = length constrs |
207 |
in if length ts <= i then |
|
17144 | 208 |
invoke_codegen thy defs dep module brack (gr, eta_expand c ts (i+1)) |
12445 | 209 |
else |
210 |
let |
|
15570 | 211 |
val ts1 = Library.take (i, ts); |
212 |
val t :: ts2 = Library.drop (i, ts); |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
213 |
val names = foldr add_term_names |
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
214 |
(map (fst o fst o dest_Var) (foldr add_term_vars [] ts1)) ts1; |
15570 | 215 |
val (Ts, dT) = split_last (Library.take (i+1, fst (strip_type T))); |
12445 | 216 |
|
217 |
fun pcase gr [] [] [] = ([], gr) |
|
218 |
| pcase gr ((cname, cargs)::cs) (t::ts) (U::Us) = |
|
219 |
let |
|
220 |
val j = length cargs; |
|
221 |
val xs = variantlist (replicate j "x", names); |
|
15570 | 222 |
val Us' = Library.take (j, fst (strip_type U)); |
12445 | 223 |
val frees = map Free (xs ~~ Us'); |
17144 | 224 |
val (gr0, cp) = invoke_codegen thy defs dep module false |
12445 | 225 |
(gr, list_comb (Const (cname, Us' ---> dT), frees)); |
226 |
val t' = Envir.beta_norm (list_comb (t, frees)); |
|
17144 | 227 |
val (gr1, p) = invoke_codegen thy defs dep module false (gr0, t'); |
12445 | 228 |
val (ps, gr2) = pcase gr1 cs ts Us; |
229 |
in |
|
230 |
([Pretty.block [cp, Pretty.str " =>", Pretty.brk 1, p]] :: ps, gr2) |
|
231 |
end; |
|
232 |
||
233 |
val (ps1, gr1) = pcase gr constrs ts1 Ts; |
|
15570 | 234 |
val ps = List.concat (separate [Pretty.brk 1, Pretty.str "| "] ps1); |
17144 | 235 |
val (gr2, p) = invoke_codegen thy defs dep module false (gr1, t); |
236 |
val (gr3, ps2) = foldl_map (invoke_codegen thy defs dep module true) (gr2, ts2) |
|
12445 | 237 |
in (gr3, (if not (null ts2) andalso brack then parens else I) |
238 |
(Pretty.block (separate (Pretty.brk 1) |
|
239 |
(Pretty.block ([Pretty.str "(case ", p, Pretty.str " of", |
|
240 |
Pretty.brk 1] @ ps @ [Pretty.str ")"]) :: ps2)))) |
|
241 |
end |
|
242 |
end; |
|
243 |
||
244 |
||
245 |
(**** constructors ****) |
|
246 |
||
17144 | 247 |
fun pretty_constr thy defs gr dep module brack args (c as Const (s, T)) ts = |
12445 | 248 |
let val i = length args |
249 |
in if i > 1 andalso length ts < i then |
|
17144 | 250 |
invoke_codegen thy defs dep module brack (gr, eta_expand c ts i) |
12445 | 251 |
else |
252 |
let |
|
17144 | 253 |
val id = mk_qual_id module (get_const_id s gr); |
16645 | 254 |
val (gr', ps) = foldl_map |
17144 | 255 |
(invoke_codegen thy defs dep module (i = 1)) (gr, ts); |
12445 | 256 |
in (case args of |
257 |
_ :: _ :: _ => (gr', (if brack then parens else I) |
|
258 |
(Pretty.block [Pretty.str id, Pretty.brk 1, mk_tuple ps])) |
|
259 |
| _ => (gr', mk_app brack (Pretty.str id) ps)) |
|
260 |
end |
|
261 |
end; |
|
262 |
||
263 |
||
264 |
(**** code generators for terms and types ****) |
|
265 |
||
17144 | 266 |
fun datatype_codegen thy defs gr dep module brack t = (case strip_comb t of |
12445 | 267 |
(c as Const (s, T), ts) => |
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
268 |
(case Library.find_first (fn (_, {index, descr, case_name, ...}) => |
12445 | 269 |
s = case_name orelse |
17521 | 270 |
AList.defined (op =) ((#3 o the o AList.lookup (op =) descr) index) s) |
12445 | 271 |
(Symtab.dest (DatatypePackage.get_datatypes thy)) of |
15531 | 272 |
NONE => NONE |
273 |
| SOME (tname, {index, descr, ...}) => |
|
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
274 |
if is_some (get_assoc_code thy s T) then NONE else |
17521 | 275 |
let val SOME (_, _, constrs) = AList.lookup (op =) descr index |
276 |
in (case (AList.lookup (op =) constrs s, strip_type T) of |
|
17144 | 277 |
(NONE, _) => SOME (pretty_case thy defs gr dep module brack |
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
278 |
((#3 o the o AList.lookup (op =) descr) index) c ts) |
16645 | 279 |
| (SOME args, (_, Type _)) => SOME (pretty_constr thy defs |
17144 | 280 |
(fst (invoke_tycodegen thy defs dep module false |
16645 | 281 |
(gr, snd (strip_type T)))) |
17144 | 282 |
dep module brack args c ts) |
15531 | 283 |
| _ => NONE) |
12445 | 284 |
end) |
15531 | 285 |
| _ => NONE); |
12445 | 286 |
|
17144 | 287 |
fun datatype_tycodegen thy defs gr dep module brack (Type (s, Ts)) = |
17412 | 288 |
(case Symtab.lookup (DatatypePackage.get_datatypes thy) s of |
15531 | 289 |
NONE => NONE |
290 |
| SOME {descr, ...} => |
|
15570 | 291 |
if isSome (get_assoc_type thy s) then NONE else |
16645 | 292 |
let |
293 |
val (gr', ps) = foldl_map |
|
17144 | 294 |
(invoke_tycodegen thy defs dep module false) (gr, Ts); |
295 |
val gr'' = add_dt_defs thy defs dep module gr' descr |
|
16645 | 296 |
in SOME (gr'', |
12445 | 297 |
Pretty.block ((if null Ts then [] else |
298 |
[mk_tuple ps, Pretty.str " "]) @ |
|
17144 | 299 |
[Pretty.str (mk_qual_id module (get_type_id s gr''))])) |
12445 | 300 |
end) |
16645 | 301 |
| datatype_tycodegen _ _ _ _ _ _ _ = NONE; |
12445 | 302 |
|
18220 | 303 |
fun is_datatype thy dtyco = |
304 |
Symtab.lookup (DatatypePackage.get_datatypes thy) dtyco |
|
305 |
|> is_some; |
|
12445 | 306 |
|
18220 | 307 |
fun get_datatype thy dtname = |
18334 | 308 |
dtname |
309 |
|> Symtab.lookup (DatatypePackage.get_datatypes thy) |
|
310 |
|> Option.map #descr |
|
311 |
|> these |
|
312 |
|> get_first (fn (_, (dtname', vs, cs)) => |
|
313 |
if dtname = dtname' |
|
314 |
then SOME (vs, map fst cs) |
|
315 |
else NONE) |
|
316 |
|> Option.mapPartial (try (apfst (map DatatypeAux.dest_DtTFree))); |
|
317 |
||
18220 | 318 |
fun get_datacons thy (c, dtname) = |
319 |
let |
|
320 |
val descr = |
|
321 |
dtname |
|
322 |
|> Symtab.lookup (DatatypePackage.get_datatypes thy) |
|
323 |
|> Option.map #descr |
|
324 |
|> these |
|
325 |
val one_descr = |
|
326 |
descr |
|
327 |
|> get_first (fn (_, (dtname', vs, cs)) => |
|
328 |
if dtname = dtname' |
|
329 |
then SOME (vs, cs) |
|
330 |
else NONE); |
|
331 |
in |
|
332 |
if is_some one_descr |
|
333 |
then |
|
334 |
the one_descr |
|
335 |
|> (fn (vs, cs) => |
|
336 |
c |
|
337 |
|> AList.lookup (op =) cs |
|
338 |
|> Option.map (map (DatatypeAux.typ_of_dtyp descr (map (rpair []) |
|
339 |
(map DatatypeAux.dest_DtTFree vs))))) |
|
340 |
else NONE |
|
341 |
end; |
|
342 |
||
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
343 |
fun get_case_const_data thy f = |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
344 |
case Library.find_first (fn (_, {index, descr, case_name, ...}) => |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
345 |
case_name = f |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
346 |
) ((Symtab.dest o DatatypePackage.get_datatypes) thy) |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
347 |
of NONE => NONE |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
348 |
| SOME (_, {index, descr, ...}) => |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
349 |
(SOME o map (apsnd length) o #3 o the o AList.lookup (op =) descr) index; |
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
350 |
|
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
351 |
|
18220 | 352 |
val setup = [ |
353 |
add_codegen "datatype" datatype_codegen, |
|
354 |
add_tycodegen "datatype" datatype_tycodegen, |
|
355 |
CodegenPackage.set_is_datatype |
|
356 |
is_datatype, |
|
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
357 |
CodegenPackage.add_defgen |
18334 | 358 |
("datatype", CodegenPackage.defgen_datatype get_datatype get_datacons), |
18220 | 359 |
CodegenPackage.add_defgen |
18247
b17724cae935
code generator: case expressions, improved name resolving
haftmann
parents:
18220
diff
changeset
|
360 |
("datacons", CodegenPackage.defgen_datacons get_datacons), |
18334 | 361 |
CodegenPackage.add_defgen |
362 |
("dataeq", CodegenPackage.defgen_datatype_eqinst get_datatype), |
|
363 |
CodegenPackage.add_appgen |
|
364 |
("case", CodegenPackage.appgen_case get_case_const_data) |
|
18220 | 365 |
]; |
12445 | 366 |
|
367 |
end; |