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