blanchet@50127
|
1 |
(* Title: HOL/Codatatype/Tools/bnf_fp_sugar.ML
|
blanchet@50127
|
2 |
Author: Jasmin Blanchette, TU Muenchen
|
blanchet@50127
|
3 |
Copyright 2012
|
blanchet@50127
|
4 |
|
blanchet@50127
|
5 |
Sugar for constructing LFPs and GFPs.
|
blanchet@50127
|
6 |
*)
|
blanchet@50127
|
7 |
|
blanchet@50127
|
8 |
signature BNF_FP_SUGAR =
|
blanchet@50127
|
9 |
sig
|
blanchet@50220
|
10 |
(* TODO: programmatic interface *)
|
blanchet@50127
|
11 |
end;
|
blanchet@50127
|
12 |
|
blanchet@50127
|
13 |
structure BNF_FP_Sugar : BNF_FP_SUGAR =
|
blanchet@50127
|
14 |
struct
|
blanchet@50127
|
15 |
|
blanchet@50134
|
16 |
open BNF_Util
|
blanchet@50134
|
17 |
open BNF_Wrap
|
blanchet@50229
|
18 |
open BNF_Def
|
blanchet@50134
|
19 |
open BNF_FP_Util
|
blanchet@50134
|
20 |
open BNF_LFP
|
blanchet@50134
|
21 |
open BNF_GFP
|
blanchet@50138
|
22 |
open BNF_FP_Sugar_Tactics
|
blanchet@50134
|
23 |
|
blanchet@50144
|
24 |
val caseN = "case";
|
blanchet@50228
|
25 |
val coitersN = "coiters";
|
blanchet@50228
|
26 |
val corecsN = "corecs";
|
blanchet@50217
|
27 |
val itersN = "iters";
|
blanchet@50217
|
28 |
val recsN = "recs";
|
blanchet@50144
|
29 |
|
blanchet@50229
|
30 |
fun split_list8 xs =
|
blanchet@50229
|
31 |
(map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs);
|
blanchet@50229
|
32 |
|
blanchet@50232
|
33 |
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T
|
blanchet@50232
|
34 |
| strip_map_type T = ([], T);
|
blanchet@50232
|
35 |
|
blanchet@50229
|
36 |
fun typ_subst inst (T as Type (s, Ts)) =
|
blanchet@50229
|
37 |
(case AList.lookup (op =) inst T of
|
blanchet@50229
|
38 |
NONE => Type (s, map (typ_subst inst) Ts)
|
blanchet@50229
|
39 |
| SOME T' => T')
|
blanchet@50229
|
40 |
| typ_subst inst T = the_default T (AList.lookup (op =) inst T);
|
blanchet@50220
|
41 |
|
blanchet@50214
|
42 |
fun retype_free (Free (s, _)) T = Free (s, T);
|
blanchet@50214
|
43 |
|
blanchet@50227
|
44 |
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs))
|
blanchet@50217
|
45 |
|
blanchet@50215
|
46 |
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs));
|
blanchet@50215
|
47 |
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs;
|
blanchet@50217
|
48 |
fun mk_uncurried2_fun f xss =
|
blanchet@50215
|
49 |
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss);
|
blanchet@50215
|
50 |
|
blanchet@50229
|
51 |
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v))
|
blanchet@50229
|
52 |
|
blanchet@50139
|
53 |
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters";
|
blanchet@50134
|
54 |
|
blanchet@50134
|
55 |
fun merge_type_arg_constrained ctxt (T, c) (T', c') =
|
blanchet@50134
|
56 |
if T = T' then
|
blanchet@50134
|
57 |
(case (c, c') of
|
blanchet@50134
|
58 |
(_, NONE) => (T, c)
|
blanchet@50134
|
59 |
| (NONE, _) => (T, c')
|
blanchet@50134
|
60 |
| _ =>
|
blanchet@50134
|
61 |
if c = c' then
|
blanchet@50134
|
62 |
(T, c)
|
blanchet@50134
|
63 |
else
|
blanchet@50134
|
64 |
error ("Inconsistent sort constraints for type variable " ^
|
blanchet@50134
|
65 |
quote (Syntax.string_of_typ ctxt T)))
|
blanchet@50134
|
66 |
else
|
blanchet@50134
|
67 |
cannot_merge_types ();
|
blanchet@50134
|
68 |
|
blanchet@50134
|
69 |
fun merge_type_args_constrained ctxt (cAs, cAs') =
|
blanchet@50134
|
70 |
if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs'
|
blanchet@50134
|
71 |
else cannot_merge_types ();
|
blanchet@50134
|
72 |
|
blanchet@50136
|
73 |
fun type_args_constrained_of (((cAs, _), _), _) = cAs;
|
blanchet@50136
|
74 |
val type_args_of = map fst o type_args_constrained_of;
|
blanchet@50144
|
75 |
fun type_binder_of (((_, b), _), _) = b;
|
blanchet@50196
|
76 |
fun mixfix_of ((_, mx), _) = mx;
|
blanchet@50136
|
77 |
fun ctr_specs_of (_, ctr_specs) = ctr_specs;
|
blanchet@50134
|
78 |
|
blanchet@50136
|
79 |
fun disc_of (((disc, _), _), _) = disc;
|
blanchet@50136
|
80 |
fun ctr_of (((_, ctr), _), _) = ctr;
|
blanchet@50136
|
81 |
fun args_of ((_, args), _) = args;
|
blanchet@50196
|
82 |
fun ctr_mixfix_of (_, mx) = mx;
|
blanchet@50134
|
83 |
|
blanchet@50223
|
84 |
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy =
|
blanchet@50127
|
85 |
let
|
blanchet@50136
|
86 |
val constrained_As =
|
blanchet@50136
|
87 |
map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs
|
blanchet@50219
|
88 |
|> Library.foldr1 (merge_type_args_constrained no_defs_lthy);
|
blanchet@50136
|
89 |
val As = map fst constrained_As;
|
blanchet@50149
|
90 |
val As' = map dest_TFree As;
|
blanchet@50134
|
91 |
|
blanchet@50136
|
92 |
val _ = (case duplicates (op =) As of [] => ()
|
blanchet@50219
|
93 |
| A :: _ => error ("Duplicate type parameter " ^
|
blanchet@50219
|
94 |
quote (Syntax.string_of_typ no_defs_lthy A)));
|
blanchet@50134
|
95 |
|
blanchet@50134
|
96 |
(* TODO: use sort constraints on type args *)
|
blanchet@50134
|
97 |
|
blanchet@50134
|
98 |
val N = length specs;
|
blanchet@50134
|
99 |
|
blanchet@50197
|
100 |
fun mk_fake_T b =
|
blanchet@50136
|
101 |
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))),
|
blanchet@50136
|
102 |
As);
|
blanchet@50136
|
103 |
|
blanchet@50144
|
104 |
val bs = map type_binder_of specs;
|
blanchet@50219
|
105 |
val fakeTs = map mk_fake_T bs;
|
blanchet@50136
|
106 |
|
blanchet@50196
|
107 |
val mixfixes = map mixfix_of specs;
|
blanchet@50134
|
108 |
|
blanchet@50134
|
109 |
val _ = (case duplicates Binding.eq_name bs of [] => ()
|
blanchet@50134
|
110 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b)));
|
blanchet@50134
|
111 |
|
blanchet@50136
|
112 |
val ctr_specss = map ctr_specs_of specs;
|
blanchet@50134
|
113 |
|
blanchet@50144
|
114 |
val disc_binderss = map (map disc_of) ctr_specss;
|
blanchet@50144
|
115 |
val ctr_binderss = map (map ctr_of) ctr_specss;
|
blanchet@50136
|
116 |
val ctr_argsss = map (map args_of) ctr_specss;
|
blanchet@50196
|
117 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss;
|
blanchet@50134
|
118 |
|
blanchet@50144
|
119 |
val sel_bindersss = map (map (map fst)) ctr_argsss;
|
blanchet@50198
|
120 |
val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss;
|
blanchet@50134
|
121 |
|
blanchet@50198
|
122 |
val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss [];
|
blanchet@50182
|
123 |
val _ = (case subtract (op =) As' rhs_As' of
|
blanchet@50180
|
124 |
[] => ()
|
blanchet@50180
|
125 |
| A' :: _ => error ("Extra type variables on rhs: " ^
|
blanchet@50219
|
126 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A'))));
|
blanchet@50180
|
127 |
|
blanchet@50191
|
128 |
val ((Cs, Xs), _) =
|
blanchet@50219
|
129 |
no_defs_lthy
|
blanchet@50136
|
130 |
|> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs
|
blanchet@50136
|
131 |
|> mk_TFrees N
|
blanchet@50191
|
132 |
||>> mk_TFrees N;
|
blanchet@50134
|
133 |
|
blanchet@50219
|
134 |
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) =
|
blanchet@50161
|
135 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^
|
blanchet@50161
|
136 |
quote (Syntax.string_of_typ fake_lthy T)))
|
blanchet@50219
|
137 |
| eq_fpT _ _ = false;
|
blanchet@50161
|
138 |
|
blanchet@50219
|
139 |
fun freeze_fp (T as Type (s, Us)) =
|
blanchet@50219
|
140 |
(case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us) | j => nth Xs j)
|
blanchet@50219
|
141 |
| freeze_fp T = T;
|
blanchet@50134
|
142 |
|
blanchet@50219
|
143 |
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss;
|
blanchet@50191
|
144 |
val sum_prod_TsXs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssXs;
|
blanchet@50134
|
145 |
|
blanchet@50191
|
146 |
val eqs = map dest_TFree Xs ~~ sum_prod_TsXs;
|
blanchet@50136
|
147 |
|
blanchet@50241
|
148 |
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects,
|
blanchet@50222
|
149 |
fp_iter_thms, fp_rec_thms), lthy)) =
|
blanchet@50223
|
150 |
fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy;
|
blanchet@50136
|
151 |
|
blanchet@50241
|
152 |
val add_nested_bnf_names =
|
blanchet@50241
|
153 |
let
|
blanchet@50241
|
154 |
fun add (Type (s, Ts)) ss =
|
blanchet@50241
|
155 |
let val (needs, ss') = fold_map add Ts ss in
|
blanchet@50241
|
156 |
if exists I needs then (true, insert (op =) s ss') else (false, ss')
|
blanchet@50241
|
157 |
end
|
blanchet@50241
|
158 |
| add T ss = (member (op =) As T, ss);
|
blanchet@50241
|
159 |
in snd oo add end;
|
blanchet@50241
|
160 |
|
blanchet@50241
|
161 |
val nested_bnfs =
|
blanchet@50241
|
162 |
map_filter (bnf_of lthy o Long_Name.base_name)
|
blanchet@50241
|
163 |
(fold (fold (fold add_nested_bnf_names)) ctr_TsssXs []);
|
blanchet@50241
|
164 |
|
blanchet@50182
|
165 |
val timer = time (Timer.startRealTimer ());
|
blanchet@50182
|
166 |
|
blanchet@50191
|
167 |
fun mk_unf_or_fld get_T Ts t =
|
blanchet@50191
|
168 |
let val Type (_, Ts0) = get_T (fastype_of t) in
|
blanchet@50139
|
169 |
Term.subst_atomic_types (Ts0 ~~ Ts) t
|
blanchet@50136
|
170 |
end;
|
blanchet@50136
|
171 |
|
blanchet@50141
|
172 |
val mk_unf = mk_unf_or_fld domain_type;
|
blanchet@50141
|
173 |
val mk_fld = mk_unf_or_fld range_type;
|
blanchet@50139
|
174 |
|
blanchet@50218
|
175 |
val unfs = map (mk_unf As) unfs0;
|
blanchet@50218
|
176 |
val flds = map (mk_fld As) flds0;
|
blanchet@50136
|
177 |
|
blanchet@50216
|
178 |
val fpTs = map (domain_type o fastype_of) unfs;
|
blanchet@50219
|
179 |
|
blanchet@50216
|
180 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs;
|
blanchet@50218
|
181 |
val ns = map length ctr_Tsss;
|
blanchet@50227
|
182 |
val kss = map (fn n => 1 upto n) ns;
|
blanchet@50218
|
183 |
val mss = map (map length) ctr_Tsss;
|
blanchet@50218
|
184 |
val Css = map2 replicate ns Cs;
|
blanchet@50218
|
185 |
|
blanchet@50229
|
186 |
fun mk_iter_like Ts Us t =
|
blanchet@50134
|
187 |
let
|
blanchet@50229
|
188 |
val (binders, body) = strip_type (fastype_of t);
|
blanchet@50225
|
189 |
val (f_Us, prebody) = split_last binders;
|
blanchet@50225
|
190 |
val Type (_, Ts0) = if lfp then prebody else body;
|
blanchet@50225
|
191 |
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us);
|
blanchet@50191
|
192 |
in
|
blanchet@50229
|
193 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
|
blanchet@50191
|
194 |
end;
|
blanchet@50191
|
195 |
|
blanchet@50225
|
196 |
val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0;
|
blanchet@50225
|
197 |
val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0;
|
blanchet@50225
|
198 |
|
blanchet@50227
|
199 |
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1)));
|
blanchet@50227
|
200 |
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1)));
|
blanchet@50219
|
201 |
|
blanchet@50219
|
202 |
fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) =
|
blanchet@50219
|
203 |
if member (op =) Cs U then Us else [T]
|
blanchet@50219
|
204 |
| dest_rec_pair T = [T];
|
blanchet@50219
|
205 |
|
blanchet@50230
|
206 |
val ((iter_only as (gss, g_Tss, yssss), rec_only as (hss, h_Tss, zssss)),
|
blanchet@50230
|
207 |
(cs, cpss, p_Tss, coiter_only as ((pgss, cgsss), g_sum_prod_Ts, g_prod_Tss, g_Tsss),
|
blanchet@50230
|
208 |
corec_only as ((phss, chsss), h_sum_prod_Ts, h_prod_Tss, h_Tsss))) =
|
blanchet@50223
|
209 |
if lfp then
|
blanchet@50223
|
210 |
let
|
blanchet@50223
|
211 |
val y_Tsss =
|
blanchet@50225
|
212 |
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN n o domain_type)
|
blanchet@50227
|
213 |
ns mss fp_iter_fun_Ts;
|
blanchet@50223
|
214 |
val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css;
|
blanchet@50219
|
215 |
|
blanchet@50223
|
216 |
val ((gss, ysss), _) =
|
blanchet@50223
|
217 |
lthy
|
blanchet@50223
|
218 |
|> mk_Freess "f" g_Tss
|
blanchet@50223
|
219 |
||>> mk_Freesss "x" y_Tsss;
|
blanchet@50219
|
220 |
|
blanchet@50223
|
221 |
val z_Tssss =
|
blanchet@50225
|
222 |
map3 (fn n => fn ms => map2 (map dest_rec_pair oo dest_tupleT) ms o dest_sumTN n
|
blanchet@50227
|
223 |
o domain_type) ns mss fp_rec_fun_Ts;
|
blanchet@50223
|
224 |
val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css;
|
blanchet@50223
|
225 |
|
blanchet@50223
|
226 |
val hss = map2 (map2 retype_free) gss h_Tss;
|
blanchet@50223
|
227 |
val (zssss, _) =
|
blanchet@50223
|
228 |
lthy
|
blanchet@50223
|
229 |
|> mk_Freessss "x" z_Tssss;
|
blanchet@50225
|
230 |
in
|
blanchet@50230
|
231 |
(((gss, g_Tss, map (map (map single)) ysss), (hss, h_Tss, zssss)),
|
blanchet@50227
|
232 |
([], [], [], (([], []), [], [], []), (([], []), [], [], [])))
|
blanchet@50225
|
233 |
end
|
blanchet@50223
|
234 |
else
|
blanchet@50225
|
235 |
let
|
blanchet@50236
|
236 |
(*avoid "'a itself" arguments in coiterators and corecursors*)
|
blanchet@50236
|
237 |
val mss' = map (fn [0] => [1] | ms => ms) mss;
|
blanchet@50236
|
238 |
|
blanchet@50226
|
239 |
val p_Tss =
|
blanchet@50225
|
240 |
map2 (fn C => fn n => replicate (Int.max (0, n - 1)) (C --> HOLogic.boolT)) Cs ns;
|
blanchet@50191
|
241 |
|
blanchet@50230
|
242 |
fun popescu_zip [] [fs] = fs
|
blanchet@50230
|
243 |
| popescu_zip (p :: ps) (fs :: fss) = p :: fs @ popescu_zip ps fss;
|
blanchet@50230
|
244 |
|
blanchet@50227
|
245 |
fun mk_types fun_Ts =
|
blanchet@50227
|
246 |
let
|
blanchet@50227
|
247 |
val f_sum_prod_Ts = map range_type fun_Ts;
|
blanchet@50227
|
248 |
val f_prod_Tss = map2 dest_sumTN ns f_sum_prod_Ts;
|
blanchet@50227
|
249 |
val f_Tsss =
|
blanchet@50236
|
250 |
map3 (fn C => map2 (map (curry (op -->) C) oo dest_tupleT)) Cs mss' f_prod_Tss;
|
blanchet@50227
|
251 |
val pf_Tss = map2 popescu_zip p_Tss f_Tsss
|
blanchet@50227
|
252 |
in (f_sum_prod_Ts, f_prod_Tss, f_Tsss, pf_Tss) end;
|
blanchet@50226
|
253 |
|
blanchet@50227
|
254 |
val (g_sum_prod_Ts, g_prod_Tss, g_Tsss, pg_Tss) = mk_types fp_iter_fun_Ts;
|
blanchet@50227
|
255 |
val (h_sum_prod_Ts, h_prod_Tss, h_Tsss, ph_Tss) = mk_types fp_rec_fun_Ts;
|
blanchet@50226
|
256 |
|
blanchet@50226
|
257 |
val (((c, pss), gsss), _) =
|
blanchet@50225
|
258 |
lthy
|
blanchet@50225
|
259 |
|> yield_singleton (mk_Frees "c") dummyT
|
blanchet@50226
|
260 |
||>> mk_Freess "p" p_Tss
|
blanchet@50225
|
261 |
||>> mk_Freesss "g" g_Tsss;
|
blanchet@50225
|
262 |
|
blanchet@50226
|
263 |
val hsss = map2 (map2 (map2 retype_free)) gsss h_Tsss;
|
blanchet@50226
|
264 |
|
blanchet@50225
|
265 |
val cs = map (retype_free c) Cs;
|
blanchet@50227
|
266 |
val cpss = map2 (fn c => map (fn p => p $ c)) cs pss;
|
blanchet@50227
|
267 |
|
blanchet@50227
|
268 |
fun mk_terms fsss =
|
blanchet@50227
|
269 |
let
|
blanchet@50227
|
270 |
val pfss = map2 popescu_zip pss fsss;
|
blanchet@50227
|
271 |
val cfsss = map2 (fn c => map (map (fn f => f $ c))) cs fsss
|
blanchet@50227
|
272 |
in (pfss, cfsss) end;
|
blanchet@50225
|
273 |
in
|
blanchet@50227
|
274 |
((([], [], []), ([], [], [])),
|
blanchet@50227
|
275 |
(cs, cpss, p_Tss, (mk_terms gsss, g_sum_prod_Ts, g_prod_Tss, pg_Tss),
|
blanchet@50227
|
276 |
(mk_terms hsss, h_sum_prod_Ts, h_prod_Tss, ph_Tss)))
|
blanchet@50225
|
277 |
end;
|
blanchet@50225
|
278 |
|
blanchet@50227
|
279 |
fun pour_some_sugar_on_type (((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec),
|
blanchet@50227
|
280 |
fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss),
|
blanchet@50227
|
281 |
disc_binders), sel_binderss) no_defs_lthy =
|
blanchet@50191
|
282 |
let
|
blanchet@50216
|
283 |
val unfT = domain_type (fastype_of fld);
|
blanchet@50225
|
284 |
val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss;
|
blanchet@50149
|
285 |
val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss;
|
blanchet@50139
|
286 |
|
blanchet@50191
|
287 |
val ((((u, v), fs), xss), _) =
|
blanchet@50219
|
288 |
no_defs_lthy
|
blanchet@50216
|
289 |
|> yield_singleton (mk_Frees "u") unfT
|
blanchet@50216
|
290 |
||>> yield_singleton (mk_Frees "v") fpT
|
blanchet@50191
|
291 |
||>> mk_Frees "f" case_Ts
|
blanchet@50139
|
292 |
||>> mk_Freess "x" ctr_Tss;
|
blanchet@50136
|
293 |
|
blanchet@50144
|
294 |
val ctr_rhss =
|
blanchet@50136
|
295 |
map2 (fn k => fn xs =>
|
blanchet@50225
|
296 |
fold_rev Term.lambda xs (fld $ mk_InN ctr_prod_Ts (HOLogic.mk_tuple xs) k)) ks xss;
|
blanchet@50136
|
297 |
|
blanchet@50145
|
298 |
val case_binder = Binding.suffix_name ("_" ^ caseN) b;
|
blanchet@50144
|
299 |
|
blanchet@50149
|
300 |
val case_rhs =
|
blanchet@50191
|
301 |
fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (map2 mk_uncurried_fun fs xss) $ (unf $ v));
|
blanchet@50144
|
302 |
|
blanchet@50216
|
303 |
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy
|
blanchet@50184
|
304 |
|> apfst split_list o fold_map3 (fn b => fn mx => fn rhs =>
|
blanchet@50184
|
305 |
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd)
|
blanchet@50216
|
306 |
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss)
|
blanchet@50136
|
307 |
||> `Local_Theory.restore;
|
blanchet@50136
|
308 |
|
blanchet@50136
|
309 |
(*transforms defined frees into consts (and more)*)
|
blanchet@50136
|
310 |
val phi = Proof_Context.export_morphism lthy lthy';
|
blanchet@50136
|
311 |
|
blanchet@50136
|
312 |
val ctr_defs = map (Morphism.thm phi) raw_ctr_defs;
|
blanchet@50145
|
313 |
val case_def = Morphism.thm phi raw_case_def;
|
blanchet@50145
|
314 |
|
blanchet@50218
|
315 |
val ctrs0 = map (Morphism.term phi) raw_ctrs;
|
blanchet@50218
|
316 |
val casex0 = Morphism.term phi raw_case;
|
blanchet@50218
|
317 |
|
blanchet@50218
|
318 |
val ctrs = map (mk_ctr As) ctrs0;
|
blanchet@50136
|
319 |
|
blanchet@50150
|
320 |
fun exhaust_tac {context = ctxt, ...} =
|
blanchet@50138
|
321 |
let
|
blanchet@50150
|
322 |
val fld_iff_unf_thm =
|
blanchet@50150
|
323 |
let
|
blanchet@50150
|
324 |
val goal =
|
blanchet@50150
|
325 |
fold_rev Logic.all [u, v]
|
blanchet@50150
|
326 |
(mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u)));
|
blanchet@50150
|
327 |
in
|
blanchet@50150
|
328 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} =>
|
blanchet@50216
|
329 |
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT])
|
blanchet@50191
|
330 |
(certify lthy fld) (certify lthy unf) fld_unf unf_fld)
|
blanchet@50150
|
331 |
|> Thm.close_derivation
|
blanchet@50150
|
332 |
|> Morphism.thm phi
|
blanchet@50150
|
333 |
end;
|
blanchet@50150
|
334 |
|
blanchet@50150
|
335 |
val sumEN_thm' =
|
blanchet@50150
|
336 |
Local_Defs.unfold lthy @{thms all_unit_eq}
|
blanchet@50225
|
337 |
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] (mk_sumEN n))
|
blanchet@50150
|
338 |
|> Morphism.thm phi;
|
blanchet@50138
|
339 |
in
|
blanchet@50176
|
340 |
mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm'
|
blanchet@50138
|
341 |
end;
|
blanchet@50136
|
342 |
|
blanchet@50141
|
343 |
val inject_tacss =
|
blanchet@50220
|
344 |
map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} =>
|
blanchet@50220
|
345 |
mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs;
|
blanchet@50141
|
346 |
|
blanchet@50142
|
347 |
val half_distinct_tacss =
|
blanchet@50142
|
348 |
map (map (fn (def, def') => fn {context = ctxt, ...} =>
|
blanchet@50142
|
349 |
mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs);
|
blanchet@50142
|
350 |
|
blanchet@50145
|
351 |
val case_tacs =
|
blanchet@50145
|
352 |
map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} =>
|
blanchet@50145
|
353 |
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs;
|
blanchet@50136
|
354 |
|
blanchet@50136
|
355 |
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs];
|
blanchet@50149
|
356 |
|
blanchet@50225
|
357 |
fun some_lfp_sugar no_defs_lthy =
|
blanchet@50149
|
358 |
let
|
blanchet@50223
|
359 |
val fpT_to_C = fpT --> C;
|
blanchet@50214
|
360 |
|
blanchet@50230
|
361 |
fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) =
|
blanchet@50230
|
362 |
let
|
blanchet@50230
|
363 |
val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C;
|
blanchet@50214
|
364 |
|
blanchet@50230
|
365 |
val binder = Binding.suffix_name ("_" ^ suf) b;
|
blanchet@50214
|
366 |
|
blanchet@50230
|
367 |
val spec =
|
blanchet@50230
|
368 |
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)),
|
blanchet@50230
|
369 |
Term.list_comb (fp_iter_like,
|
blanchet@50230
|
370 |
map2 (mk_sum_caseN oo map2 mk_uncurried2_fun) fss xssss));
|
blanchet@50230
|
371 |
in (binder, spec) end;
|
blanchet@50230
|
372 |
|
blanchet@50230
|
373 |
val iter_likes =
|
blanchet@50230
|
374 |
[(iterN, fp_iter, iter_only),
|
blanchet@50230
|
375 |
(recN, fp_rec, rec_only)];
|
blanchet@50230
|
376 |
|
blanchet@50230
|
377 |
val (binders, specs) = map generate_iter_like iter_likes |> split_list;
|
blanchet@50230
|
378 |
|
blanchet@50230
|
379 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy
|
blanchet@50216
|
380 |
|> apfst split_list o fold_map2 (fn b => fn spec =>
|
blanchet@50214
|
381 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
|
blanchet@50230
|
382 |
#>> apsnd snd) binders specs
|
blanchet@50214
|
383 |
||> `Local_Theory.restore;
|
blanchet@50216
|
384 |
|
blanchet@50216
|
385 |
(*transforms defined frees into consts (and more)*)
|
blanchet@50216
|
386 |
val phi = Proof_Context.export_morphism lthy lthy';
|
blanchet@50216
|
387 |
|
blanchet@50230
|
388 |
val [iter_def, rec_def] = map (Morphism.thm phi) defs;
|
blanchet@50216
|
389 |
|
blanchet@50230
|
390 |
val [iter, recx] = map (mk_iter_like As Cs o Morphism.term phi) csts;
|
blanchet@50149
|
391 |
in
|
blanchet@50229
|
392 |
((ctrs, iter, recx, v, xss, ctr_defs, iter_def, rec_def), lthy)
|
blanchet@50149
|
393 |
end;
|
blanchet@50149
|
394 |
|
blanchet@50225
|
395 |
fun some_gfp_sugar no_defs_lthy =
|
blanchet@50225
|
396 |
let
|
blanchet@50225
|
397 |
val B_to_fpT = C --> fpT;
|
blanchet@50225
|
398 |
|
blanchet@50227
|
399 |
fun generate_coiter_like (suf, fp_iter_like, ((pfss, cfsss), f_sum_prod_Ts, f_prod_Tss,
|
blanchet@50227
|
400 |
pf_Tss)) =
|
blanchet@50226
|
401 |
let
|
blanchet@50226
|
402 |
val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT;
|
blanchet@50225
|
403 |
|
blanchet@50226
|
404 |
val binder = Binding.suffix_name ("_" ^ suf) b;
|
blanchet@50225
|
405 |
|
blanchet@50230
|
406 |
fun mk_popescu_join c n cps sum_prod_T prod_Ts cfss =
|
blanchet@50226
|
407 |
Term.lambda c (mk_IfN sum_prod_T cps
|
blanchet@50226
|
408 |
(map2 (mk_InN prod_Ts) (map HOLogic.mk_tuple cfss) (1 upto n)));
|
blanchet@50225
|
409 |
|
blanchet@50226
|
410 |
val spec =
|
blanchet@50227
|
411 |
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)),
|
blanchet@50226
|
412 |
Term.list_comb (fp_iter_like,
|
blanchet@50230
|
413 |
map6 mk_popescu_join cs ns cpss f_sum_prod_Ts f_prod_Tss cfsss));
|
blanchet@50226
|
414 |
in (binder, spec) end;
|
blanchet@50225
|
415 |
|
blanchet@50227
|
416 |
val coiter_likes =
|
blanchet@50230
|
417 |
[(coiterN, fp_iter, coiter_only),
|
blanchet@50230
|
418 |
(corecN, fp_rec, corec_only)];
|
blanchet@50227
|
419 |
|
blanchet@50226
|
420 |
val (binders, specs) = map generate_coiter_like coiter_likes |> split_list;
|
blanchet@50226
|
421 |
|
blanchet@50226
|
422 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy
|
blanchet@50225
|
423 |
|> apfst split_list o fold_map2 (fn b => fn spec =>
|
blanchet@50225
|
424 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec))
|
blanchet@50226
|
425 |
#>> apsnd snd) binders specs
|
blanchet@50225
|
426 |
||> `Local_Theory.restore;
|
blanchet@50225
|
427 |
|
blanchet@50225
|
428 |
(*transforms defined frees into consts (and more)*)
|
blanchet@50225
|
429 |
val phi = Proof_Context.export_morphism lthy lthy';
|
blanchet@50225
|
430 |
|
blanchet@50226
|
431 |
val [coiter_def, corec_def] = map (Morphism.thm phi) defs;
|
blanchet@50225
|
432 |
|
blanchet@50226
|
433 |
val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts;
|
blanchet@50225
|
434 |
in
|
blanchet@50229
|
435 |
((ctrs, coiter, corec, v, xss, ctr_defs, coiter_def, corec_def), lthy)
|
blanchet@50225
|
436 |
end;
|
blanchet@50134
|
437 |
in
|
blanchet@50218
|
438 |
wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy'
|
blanchet@50225
|
439 |
|> (if lfp then some_lfp_sugar else some_gfp_sugar)
|
blanchet@50134
|
440 |
end;
|
blanchet@50182
|
441 |
|
blanchet@50241
|
442 |
val pre_map_defs = map map_def_of_bnf pre_bnfs;
|
blanchet@50244
|
443 |
val map_ids = map map_id_of_bnf nested_bnfs;
|
blanchet@50241
|
444 |
|
blanchet@50229
|
445 |
fun mk_map Ts Us t =
|
blanchet@50232
|
446 |
let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type (fastype_of t) |>> List.last in
|
blanchet@50229
|
447 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t
|
blanchet@50229
|
448 |
end;
|
blanchet@50229
|
449 |
|
blanchet@50229
|
450 |
fun pour_more_sugar_on_lfps ((ctrss, iters, recs, vs, xsss, ctr_defss, iter_defs, rec_defs),
|
blanchet@50220
|
451 |
lthy) =
|
blanchet@50217
|
452 |
let
|
blanchet@50217
|
453 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss;
|
blanchet@50227
|
454 |
val giters = map (lists_bmoc gss) iters;
|
blanchet@50227
|
455 |
val hrecs = map (lists_bmoc hss) recs;
|
blanchet@50216
|
456 |
|
blanchet@50217
|
457 |
val (iter_thmss, rec_thmss) =
|
blanchet@50222
|
458 |
let
|
blanchet@50227
|
459 |
fun mk_goal_iter_like fss fiter_like xctr f xs fxs =
|
blanchet@50222
|
460 |
fold_rev (fold_rev Logic.all) (xs :: fss)
|
blanchet@50227
|
461 |
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs)));
|
blanchet@50216
|
462 |
|
blanchet@50230
|
463 |
fun build_call fiter_likes maybe_tick =
|
blanchet@50229
|
464 |
let
|
blanchet@50229
|
465 |
fun build (T, U) =
|
blanchet@50229
|
466 |
if T = U then
|
blanchet@50229
|
467 |
Const (@{const_name id}, T --> T)
|
blanchet@50229
|
468 |
else
|
blanchet@50229
|
469 |
(case (find_index (curry (op =) T) fpTs, (T, U)) of
|
blanchet@50229
|
470 |
(~1, (Type (s, Ts), Type (_, Us))) =>
|
blanchet@50229
|
471 |
let
|
blanchet@50229
|
472 |
val map0 = map_of_bnf (the (bnf_of lthy (Long_Name.base_name s)));
|
blanchet@50229
|
473 |
val mapx = mk_map Ts Us map0;
|
blanchet@50232
|
474 |
val TUs =
|
blanchet@50232
|
475 |
map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx)))));
|
blanchet@50229
|
476 |
val args = map build TUs;
|
blanchet@50229
|
477 |
in Term.list_comb (mapx, args) end
|
blanchet@50229
|
478 |
| (j, _) => maybe_tick (nth vs j) (nth fiter_likes j))
|
blanchet@50229
|
479 |
in build end;
|
blanchet@50229
|
480 |
|
blanchet@50229
|
481 |
fun mk_U maybe_prodT =
|
blanchet@50229
|
482 |
typ_subst (map2 (fn fpT => fn C => (fpT, maybe_prodT fpT C)) fpTs Cs);
|
blanchet@50229
|
483 |
|
blanchet@50229
|
484 |
fun repair_calls fiter_likes maybe_cons maybe_tick maybe_prodT (x as Free (_, T)) =
|
blanchet@50229
|
485 |
if member (op =) fpTs T then
|
blanchet@50230
|
486 |
maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x]
|
blanchet@50229
|
487 |
else if exists_subtype (member (op =) fpTs) T then
|
blanchet@50230
|
488 |
[build_call fiter_likes maybe_tick (T, mk_U maybe_prodT T) $ x]
|
blanchet@50229
|
489 |
else
|
blanchet@50229
|
490 |
[x];
|
blanchet@50229
|
491 |
|
blanchet@50227
|
492 |
fun repair_rec_call (x as Free (_, T)) =
|
blanchet@50227
|
493 |
(case find_index (curry (op =) T) fpTs of ~1 => [x] | j => [x, nth hrecs j $ x]);
|
blanchet@50219
|
494 |
|
blanchet@50229
|
495 |
val gxsss = map (map (maps (repair_calls giters (K I) (K I) (K I)))) xsss;
|
blanchet@50229
|
496 |
val hxsss =
|
blanchet@50229
|
497 |
map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss;
|
blanchet@50219
|
498 |
|
blanchet@50227
|
499 |
val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss;
|
blanchet@50227
|
500 |
val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss;
|
blanchet@50219
|
501 |
|
blanchet@50218
|
502 |
val iter_tacss =
|
blanchet@50244
|
503 |
map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss;
|
blanchet@50218
|
504 |
val rec_tacss =
|
blanchet@50244
|
505 |
map2 (map o mk_iter_like_tac pre_map_defs map_ids rec_defs) fp_rec_thms ctr_defss;
|
blanchet@50217
|
506 |
in
|
blanchet@50220
|
507 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
|
blanchet@50220
|
508 |
goal_iterss iter_tacss,
|
blanchet@50220
|
509 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
|
blanchet@50220
|
510 |
goal_recss rec_tacss)
|
blanchet@50217
|
511 |
end;
|
blanchet@50216
|
512 |
|
blanchet@50241
|
513 |
val notes =
|
blanchet@50217
|
514 |
[(itersN, iter_thmss),
|
blanchet@50217
|
515 |
(recsN, rec_thmss)]
|
blanchet@50217
|
516 |
|> maps (fn (thmN, thmss) =>
|
blanchet@50217
|
517 |
map2 (fn b => fn thms =>
|
blanchet@50217
|
518 |
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
|
blanchet@50217
|
519 |
bs thmss);
|
blanchet@50217
|
520 |
in
|
blanchet@50217
|
521 |
lthy |> Local_Theory.notes notes |> snd
|
blanchet@50217
|
522 |
end;
|
blanchet@50217
|
523 |
|
blanchet@50229
|
524 |
fun pour_more_sugar_on_gfps ((ctrss, coiters, corecs, vs, xsss, ctr_defss, coiter_defs,
|
blanchet@50229
|
525 |
corec_defs), lthy) =
|
blanchet@50227
|
526 |
let
|
blanchet@50231
|
527 |
(* NOTYET
|
blanchet@50227
|
528 |
val gcoiters = map (lists_bmoc pgss) coiters;
|
blanchet@50227
|
529 |
val hcorecs = map (lists_bmoc phss) corecs;
|
blanchet@50227
|
530 |
|
blanchet@50227
|
531 |
val (coiter_thmss, corec_thmss) =
|
blanchet@50227
|
532 |
let
|
blanchet@50227
|
533 |
fun mk_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not);
|
blanchet@50227
|
534 |
|
blanchet@50227
|
535 |
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr cfs' =
|
blanchet@50227
|
536 |
fold_rev (fold_rev Logic.all) ([c] :: pfss)
|
blanchet@50227
|
537 |
(Logic.list_implies (seq_conds mk_cond n k cps,
|
blanchet@50227
|
538 |
mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, cfs'))));
|
blanchet@50227
|
539 |
|
blanchet@50230
|
540 |
fun repair_call fcoiter_likes (cf as Free (_, Type (_, [_, T])) $ _) =
|
blanchet@50227
|
541 |
(case find_index (curry (op =) T) Cs of ~1 => cf | j => nth fcoiter_likes j $ cf);
|
blanchet@50227
|
542 |
|
blanchet@50230
|
543 |
val cgsss = map (map (map (repair_call gcoiters))) cgsss;
|
blanchet@50230
|
544 |
val chsss = map (map (map (repair_call hcorecs))) chsss;
|
blanchet@50227
|
545 |
|
blanchet@50227
|
546 |
val goal_coiterss =
|
blanchet@50227
|
547 |
map7 (map3 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss cgsss;
|
blanchet@50227
|
548 |
val goal_corecss =
|
blanchet@50227
|
549 |
map7 (map3 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss chsss;
|
blanchet@50228
|
550 |
|
blanchet@50228
|
551 |
val coiter_tacss =
|
blanchet@50244
|
552 |
map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs
|
blanchet@50241
|
553 |
ctr_defss;
|
blanchet@50227
|
554 |
in
|
blanchet@50228
|
555 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
|
blanchet@50228
|
556 |
goal_coiterss coiter_tacss,
|
blanchet@50228
|
557 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context)))
|
blanchet@50228
|
558 |
goal_coiterss coiter_tacss (* TODO: should be corecs *))
|
blanchet@50227
|
559 |
end;
|
blanchet@50227
|
560 |
|
blanchet@50227
|
561 |
val notes =
|
blanchet@50227
|
562 |
[(coitersN, coiter_thmss),
|
blanchet@50227
|
563 |
(corecsN, corec_thmss)]
|
blanchet@50227
|
564 |
|> maps (fn (thmN, thmss) =>
|
blanchet@50227
|
565 |
map2 (fn b => fn thms =>
|
blanchet@50227
|
566 |
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])]))
|
blanchet@50227
|
567 |
bs thmss);
|
blanchet@50231
|
568 |
*)
|
blanchet@50227
|
569 |
in
|
blanchet@50231
|
570 |
lthy (* NOTYET |> Local_Theory.notes notes |> snd *)
|
blanchet@50227
|
571 |
end;
|
blanchet@50227
|
572 |
|
blanchet@50219
|
573 |
val lthy' = lthy
|
blanchet@50225
|
574 |
|> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~
|
blanchet@50227
|
575 |
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~
|
blanchet@50227
|
576 |
ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss)
|
blanchet@50229
|
577 |
|>> split_list8
|
blanchet@50227
|
578 |
|> (if lfp then pour_more_sugar_on_lfps else pour_more_sugar_on_gfps);
|
blanchet@50182
|
579 |
|
blanchet@50182
|
580 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^
|
blanchet@50223
|
581 |
(if lfp then "" else "co") ^ "datatype"));
|
blanchet@50127
|
582 |
in
|
blanchet@50219
|
583 |
(timer; lthy')
|
blanchet@50127
|
584 |
end;
|
blanchet@50127
|
585 |
|
blanchet@50214
|
586 |
fun datatype_cmd info specs lthy =
|
blanchet@50136
|
587 |
let
|
blanchet@50224
|
588 |
(* TODO: cleaner handling of fake contexts, without "background_theory" *)
|
blanchet@50199
|
589 |
(*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a
|
blanchet@50199
|
590 |
locale and shadows an existing global type*)
|
blanchet@50194
|
591 |
val fake_thy = Theory.copy
|
blanchet@50199
|
592 |
#> fold (fn spec => perhaps (try (Sign.add_type lthy
|
blanchet@50199
|
593 |
(type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs;
|
blanchet@50194
|
594 |
val fake_lthy = Proof_Context.background_theory fake_thy lthy;
|
blanchet@50136
|
595 |
in
|
blanchet@50214
|
596 |
prepare_datatype Syntax.read_typ info specs fake_lthy lthy
|
blanchet@50136
|
597 |
end;
|
blanchet@50134
|
598 |
|
blanchet@50144
|
599 |
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder
|
blanchet@50134
|
600 |
|
blanchet@50127
|
601 |
val parse_ctr_arg =
|
blanchet@50134
|
602 |
Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" ||
|
blanchet@50144
|
603 |
(Parse.typ >> pair no_binder);
|
blanchet@50127
|
604 |
|
blanchet@50127
|
605 |
val parse_single_spec =
|
blanchet@50127
|
606 |
Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix --
|
blanchet@50134
|
607 |
(@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding --
|
blanchet@50134
|
608 |
Scan.repeat parse_ctr_arg -- Parse.opt_mixfix));
|
blanchet@50127
|
609 |
|
blanchet@50127
|
610 |
val _ =
|
blanchet@50127
|
611 |
Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes"
|
blanchet@50223
|
612 |
(Parse.and_list1 parse_single_spec >> datatype_cmd true);
|
blanchet@50127
|
613 |
|
blanchet@50127
|
614 |
val _ =
|
blanchet@50127
|
615 |
Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes"
|
blanchet@50223
|
616 |
(Parse.and_list1 parse_single_spec >> datatype_cmd false);
|
blanchet@50127
|
617 |
|
blanchet@50127
|
618 |
end;
|