author | blanchet |
Sat, 08 Sep 2012 21:04:26 +0200 | |
changeset 49210 | 656fb50d33f0 |
parent 49209 | 3c0deda51b32 |
child 49211 | 239a4fa29ddf |
permissions | -rw-r--r-- |
49112 | 1 |
(* Title: HOL/Codatatype/Tools/bnf_fp_sugar.ML |
2 |
Author: Jasmin Blanchette, TU Muenchen |
|
3 |
Copyright 2012 |
|
4 |
||
5 |
Sugar for constructing LFPs and GFPs. |
|
6 |
*) |
|
7 |
||
8 |
signature BNF_FP_SUGAR = |
|
9 |
sig |
|
49205 | 10 |
(* TODO: programmatic interface *) |
49112 | 11 |
end; |
12 |
||
13 |
structure BNF_FP_Sugar : BNF_FP_SUGAR = |
|
14 |
struct |
|
15 |
||
49119 | 16 |
open BNF_Util |
17 |
open BNF_Wrap |
|
18 |
open BNF_FP_Util |
|
19 |
open BNF_LFP |
|
20 |
open BNF_GFP |
|
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
21 |
open BNF_FP_Sugar_Tactics |
49119 | 22 |
|
49129 | 23 |
val caseN = "case"; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
24 |
val itersN = "iters"; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
25 |
val recsN = "recs"; |
49129 | 26 |
|
49205 | 27 |
fun split_list7 xs = (map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs); |
28 |
||
49199 | 29 |
fun retype_free (Free (s, _)) T = Free (s, T); |
30 |
||
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
31 |
fun flat_list_comb (f, xss) = fold (fn xs => fn t => Term.list_comb (t, xs)) xss f |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
32 |
|
49200 | 33 |
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); |
34 |
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs; |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
35 |
fun mk_uncurried2_fun f xss = |
49200 | 36 |
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); |
37 |
||
49124 | 38 |
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters"; |
49119 | 39 |
|
40 |
fun merge_type_arg_constrained ctxt (T, c) (T', c') = |
|
41 |
if T = T' then |
|
42 |
(case (c, c') of |
|
43 |
(_, NONE) => (T, c) |
|
44 |
| (NONE, _) => (T, c') |
|
45 |
| _ => |
|
46 |
if c = c' then |
|
47 |
(T, c) |
|
48 |
else |
|
49 |
error ("Inconsistent sort constraints for type variable " ^ |
|
50 |
quote (Syntax.string_of_typ ctxt T))) |
|
51 |
else |
|
52 |
cannot_merge_types (); |
|
53 |
||
54 |
fun merge_type_args_constrained ctxt (cAs, cAs') = |
|
55 |
if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs' |
|
56 |
else cannot_merge_types (); |
|
57 |
||
49121 | 58 |
fun type_args_constrained_of (((cAs, _), _), _) = cAs; |
59 |
val type_args_of = map fst o type_args_constrained_of; |
|
49129 | 60 |
fun type_binder_of (((_, b), _), _) = b; |
49181 | 61 |
fun mixfix_of ((_, mx), _) = mx; |
49121 | 62 |
fun ctr_specs_of (_, ctr_specs) = ctr_specs; |
49119 | 63 |
|
49121 | 64 |
fun disc_of (((disc, _), _), _) = disc; |
65 |
fun ctr_of (((_, ctr), _), _) = ctr; |
|
66 |
fun args_of ((_, args), _) = args; |
|
49181 | 67 |
fun ctr_mixfix_of (_, mx) = mx; |
49119 | 68 |
|
49208 | 69 |
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy = |
49112 | 70 |
let |
49121 | 71 |
val constrained_As = |
72 |
map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs |
|
49204 | 73 |
|> Library.foldr1 (merge_type_args_constrained no_defs_lthy); |
49121 | 74 |
val As = map fst constrained_As; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
75 |
val As' = map dest_TFree As; |
49119 | 76 |
|
49121 | 77 |
val _ = (case duplicates (op =) As of [] => () |
49204 | 78 |
| A :: _ => error ("Duplicate type parameter " ^ |
79 |
quote (Syntax.string_of_typ no_defs_lthy A))); |
|
49119 | 80 |
|
81 |
(* TODO: use sort constraints on type args *) |
|
82 |
||
83 |
val N = length specs; |
|
84 |
||
49182
b8517107ffc5
read the real types off the constant types, rather than using the fake parser types (second step of sugar localization)
blanchet
parents:
49181
diff
changeset
|
85 |
fun mk_fake_T b = |
49121 | 86 |
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))), |
87 |
As); |
|
88 |
||
49129 | 89 |
val bs = map type_binder_of specs; |
49204 | 90 |
val fakeTs = map mk_fake_T bs; |
49121 | 91 |
|
49181 | 92 |
val mixfixes = map mixfix_of specs; |
49119 | 93 |
|
94 |
val _ = (case duplicates Binding.eq_name bs of [] => () |
|
95 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
|
96 |
||
49121 | 97 |
val ctr_specss = map ctr_specs_of specs; |
49119 | 98 |
|
49129 | 99 |
val disc_binderss = map (map disc_of) ctr_specss; |
100 |
val ctr_binderss = map (map ctr_of) ctr_specss; |
|
49121 | 101 |
val ctr_argsss = map (map args_of) ctr_specss; |
49181 | 102 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; |
49119 | 103 |
|
49129 | 104 |
val sel_bindersss = map (map (map fst)) ctr_argsss; |
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
105 |
val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
49121 | 106 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
107 |
val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss []; |
49167 | 108 |
val _ = (case subtract (op =) As' rhs_As' of |
49165 | 109 |
[] => () |
110 |
| A' :: _ => error ("Extra type variables on rhs: " ^ |
|
49204 | 111 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); |
49165 | 112 |
|
49176 | 113 |
val ((Cs, Xs), _) = |
49204 | 114 |
no_defs_lthy |
49121 | 115 |
|> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs |
116 |
|> mk_TFrees N |
|
49176 | 117 |
||>> mk_TFrees N; |
49119 | 118 |
|
49204 | 119 |
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) = |
49146 | 120 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ |
121 |
quote (Syntax.string_of_typ fake_lthy T))) |
|
49204 | 122 |
| eq_fpT _ _ = false; |
49146 | 123 |
|
49204 | 124 |
fun freeze_fp (T as Type (s, Us)) = |
125 |
(case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us) | j => nth Xs j) |
|
126 |
| freeze_fp T = T; |
|
49121 | 127 |
|
49204 | 128 |
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss; |
49176 | 129 |
val sum_prod_TsXs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssXs; |
49119 | 130 |
|
49176 | 131 |
val eqs = map dest_TFree Xs ~~ sum_prod_TsXs; |
49121 | 132 |
|
49207 | 133 |
val (pre_map_defs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects, |
134 |
fp_iter_thms, fp_rec_thms), lthy)) = |
|
49208 | 135 |
fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy; |
49121 | 136 |
|
49167 | 137 |
val timer = time (Timer.startRealTimer ()); |
138 |
||
49176 | 139 |
fun mk_unf_or_fld get_T Ts t = |
140 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
49124 | 141 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
49121 | 142 |
end; |
49119 | 143 |
|
49126 | 144 |
val mk_unf = mk_unf_or_fld domain_type; |
145 |
val mk_fld = mk_unf_or_fld range_type; |
|
49121 | 146 |
|
49203 | 147 |
val unfs = map (mk_unf As) unfs0; |
148 |
val flds = map (mk_fld As) flds0; |
|
49124 | 149 |
|
49201 | 150 |
val fpTs = map (domain_type o fastype_of) unfs; |
49204 | 151 |
val is_fpT = member (op =) fpTs; |
152 |
||
49201 | 153 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; |
49203 | 154 |
val ns = map length ctr_Tsss; |
155 |
val mss = map (map length) ctr_Tsss; |
|
156 |
val Css = map2 replicate ns Cs; |
|
157 |
||
49210 | 158 |
fun mk_iter_like Ts Us c = |
49121 | 159 |
let |
49201 | 160 |
val (binders, body) = strip_type (fastype_of c); |
49210 | 161 |
val (f_Us, prebody) = split_last binders; |
162 |
val Type (_, Ts0) = if lfp then prebody else body; |
|
163 |
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); |
|
49176 | 164 |
in |
49201 | 165 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) c |
49176 | 166 |
end; |
167 |
||
49210 | 168 |
val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0; |
169 |
val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0; |
|
170 |
||
171 |
val fp_iter_f_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); |
|
172 |
val fp_rec_f_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); |
|
49204 | 173 |
|
174 |
fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) = |
|
175 |
if member (op =) Cs U then Us else [T] |
|
176 |
| dest_rec_pair T = [T]; |
|
177 |
||
49210 | 178 |
val (((gss, g_Tss, ysss, y_Tsss), (hss, h_Tss, zssss, z_Tssss)), |
179 |
(cs, (qss, q_Tss, gsss, g_Tsss), ())) = |
|
49208 | 180 |
if lfp then |
181 |
let |
|
182 |
val y_Tsss = |
|
49210 | 183 |
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN n o domain_type) |
184 |
ns mss fp_iter_f_Ts; |
|
49208 | 185 |
val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css; |
186 |
||
187 |
val ((gss, ysss), _) = |
|
188 |
lthy |
|
189 |
|> mk_Freess "f" g_Tss |
|
190 |
||>> mk_Freesss "x" y_Tsss; |
|
49204 | 191 |
|
49208 | 192 |
val z_Tssss = |
49210 | 193 |
map3 (fn n => fn ms => map2 (map dest_rec_pair oo dest_tupleT) ms o dest_sumTN n |
194 |
o domain_type) ns mss fp_rec_f_Ts; |
|
49208 | 195 |
val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css; |
49204 | 196 |
|
49208 | 197 |
val hss = map2 (map2 retype_free) gss h_Tss; |
198 |
val (zssss, _) = |
|
199 |
lthy |
|
200 |
|> mk_Freessss "x" z_Tssss; |
|
49210 | 201 |
in |
202 |
(((gss, g_Tss, ysss, y_Tsss), (hss, h_Tss, zssss, z_Tssss)), |
|
203 |
([], ([], [], [], []), ())) |
|
204 |
end |
|
49208 | 205 |
else |
49210 | 206 |
let |
207 |
val q_Tss = |
|
208 |
map2 (fn C => fn n => replicate (Int.max (0, n - 1)) (C --> HOLogic.boolT)) Cs ns; |
|
209 |
val g_Tsss = |
|
210 |
map4 (fn C => fn n => fn ms => map2 (map (curry (op -->) C) oo dest_tupleT) ms o |
|
211 |
dest_sumTN n o range_type) Cs ns mss fp_iter_f_Ts; |
|
49176 | 212 |
|
49210 | 213 |
val (((c, qss), gsss), _) = |
214 |
lthy |
|
215 |
|> yield_singleton (mk_Frees "c") dummyT |
|
216 |
||>> mk_Freess "p" q_Tss |
|
217 |
||>> mk_Freesss "g" g_Tsss; |
|
218 |
||
219 |
val cs = map (retype_free c) Cs; |
|
220 |
in |
|
221 |
((([], [], [], []), ([], [], [], [])), |
|
222 |
(cs, (qss, q_Tss, gsss, g_Tsss), ())) |
|
223 |
end; |
|
224 |
||
225 |
fun pour_some_sugar_on_type ((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec), fld_unf), |
|
226 |
unf_fld), fld_inject), ctr_binders), ctr_mixfixes), ctr_Tss), disc_binders), |
|
227 |
sel_binderss) no_defs_lthy = |
|
49176 | 228 |
let |
229 |
val n = length ctr_Tss; |
|
49121 | 230 |
val ks = 1 upto n; |
231 |
val ms = map length ctr_Tss; |
|
232 |
||
49201 | 233 |
val unfT = domain_type (fastype_of fld); |
49210 | 234 |
val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
235 |
val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss; |
49119 | 236 |
|
49176 | 237 |
val ((((u, v), fs), xss), _) = |
49204 | 238 |
no_defs_lthy |
49201 | 239 |
|> yield_singleton (mk_Frees "u") unfT |
240 |
||>> yield_singleton (mk_Frees "v") fpT |
|
49176 | 241 |
||>> mk_Frees "f" case_Ts |
49124 | 242 |
||>> mk_Freess "x" ctr_Tss; |
49121 | 243 |
|
49129 | 244 |
val ctr_rhss = |
49121 | 245 |
map2 (fn k => fn xs => |
49210 | 246 |
fold_rev Term.lambda xs (fld $ mk_InN ctr_prod_Ts (HOLogic.mk_tuple xs) k)) ks xss; |
49121 | 247 |
|
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
248 |
val case_binder = Binding.suffix_name ("_" ^ caseN) b; |
49129 | 249 |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
250 |
val case_rhs = |
49176 | 251 |
fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (map2 mk_uncurried_fun fs xss) $ (unf $ v)); |
49129 | 252 |
|
49201 | 253 |
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 254 |
|> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => |
255 |
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) |
|
49201 | 256 |
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) |
49121 | 257 |
||> `Local_Theory.restore; |
258 |
||
259 |
(*transforms defined frees into consts (and more)*) |
|
260 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
261 |
||
262 |
val ctr_defs = map (Morphism.thm phi) raw_ctr_defs; |
|
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
263 |
val case_def = Morphism.thm phi raw_case_def; |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
264 |
|
49203 | 265 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
266 |
val casex0 = Morphism.term phi raw_case; |
|
267 |
||
268 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 269 |
|
49135 | 270 |
fun exhaust_tac {context = ctxt, ...} = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
271 |
let |
49135 | 272 |
val fld_iff_unf_thm = |
273 |
let |
|
274 |
val goal = |
|
275 |
fold_rev Logic.all [u, v] |
|
276 |
(mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u))); |
|
277 |
in |
|
278 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
49201 | 279 |
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT]) |
49176 | 280 |
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) |
49135 | 281 |
|> Thm.close_derivation |
282 |
|> Morphism.thm phi |
|
283 |
end; |
|
284 |
||
285 |
val sumEN_thm' = |
|
286 |
Local_Defs.unfold lthy @{thms all_unit_eq} |
|
49210 | 287 |
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] (mk_sumEN n)) |
49135 | 288 |
|> Morphism.thm phi; |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
289 |
in |
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents:
49157
diff
changeset
|
290 |
mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm' |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
291 |
end; |
49121 | 292 |
|
49126 | 293 |
val inject_tacss = |
49205 | 294 |
map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} => |
295 |
mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs; |
|
49126 | 296 |
|
49127 | 297 |
val half_distinct_tacss = |
298 |
map (map (fn (def, def') => fn {context = ctxt, ...} => |
|
299 |
mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs); |
|
300 |
||
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
301 |
val case_tacs = |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
302 |
map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} => |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
303 |
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; |
49121 | 304 |
|
305 |
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs]; |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
306 |
|
49210 | 307 |
fun some_lfp_sugar no_defs_lthy = |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
308 |
let |
49208 | 309 |
val fpT_to_C = fpT --> C; |
310 |
val iter_T = fold_rev (curry (op --->)) g_Tss fpT_to_C; |
|
311 |
val rec_T = fold_rev (curry (op --->)) h_Tss fpT_to_C; |
|
49199 | 312 |
|
313 |
val iter_binder = Binding.suffix_name ("_" ^ iterN) b; |
|
314 |
val rec_binder = Binding.suffix_name ("_" ^ recN) b; |
|
315 |
||
316 |
val iter_free = Free (Binding.name_of iter_binder, iter_T); |
|
317 |
val rec_free = Free (Binding.name_of rec_binder, rec_T); |
|
318 |
||
319 |
val iter_spec = |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
320 |
mk_Trueprop_eq (flat_list_comb (iter_free, gss), |
49199 | 321 |
Term.list_comb (fp_iter, map2 (mk_sum_caseN oo map2 mk_uncurried_fun) gss ysss)); |
322 |
val rec_spec = |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
323 |
mk_Trueprop_eq (flat_list_comb (rec_free, hss), |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
324 |
Term.list_comb (fp_rec, map2 (mk_sum_caseN oo map2 mk_uncurried2_fun) hss zssss)); |
49199 | 325 |
|
326 |
val (([raw_iter, raw_rec], [raw_iter_def, raw_rec_def]), (lthy', lthy)) = no_defs_lthy |
|
49201 | 327 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
49199 | 328 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
49201 | 329 |
#>> apsnd snd) [iter_binder, rec_binder] [iter_spec, rec_spec] |
49199 | 330 |
||> `Local_Theory.restore; |
49201 | 331 |
|
332 |
(*transforms defined frees into consts (and more)*) |
|
333 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
334 |
||
335 |
val iter_def = Morphism.thm phi raw_iter_def; |
|
336 |
val rec_def = Morphism.thm phi raw_rec_def; |
|
337 |
||
49203 | 338 |
val iter0 = Morphism.term phi raw_iter; |
339 |
val rec0 = Morphism.term phi raw_rec; |
|
340 |
||
49210 | 341 |
val iter = mk_iter_like As Cs iter0; |
342 |
val recx = mk_iter_like As Cs rec0; |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
343 |
in |
49205 | 344 |
((ctrs, iter, recx, xss, ctr_defs, iter_def, rec_def), lthy) |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
345 |
end; |
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
346 |
|
49210 | 347 |
fun some_gfp_sugar no_defs_lthy = |
348 |
let |
|
349 |
(* qss, q_Tss, gsss, g_Tsss *) |
|
350 |
fun zip_preds_and_getters p_Ts f_Tss = p_Ts @ flat f_Tss; |
|
351 |
||
352 |
val qg_Tss = map2 zip_preds_and_getters q_Tss g_Tsss; |
|
353 |
||
354 |
val B_to_fpT = C --> fpT; |
|
355 |
val coiter_T = fold_rev (curry (op --->)) qg_Tss B_to_fpT; |
|
356 |
(* |
|
357 |
val corec_T = fold_rev (curry (op --->)) h_Tss fpT_to_C; |
|
358 |
*) |
|
359 |
||
360 |
val qgss = map2 zip_preds_and_getters qss gsss; |
|
361 |
val cqss = map2 (fn c => map (fn q => q $ c)) cs qss; |
|
362 |
val cgsss = map2 (fn c => map (map (fn g => g $ c))) cs gsss; |
|
363 |
||
364 |
val coiter_binder = Binding.suffix_name ("_" ^ coiterN) b; |
|
365 |
val corec_binder = Binding.suffix_name ("_" ^ corecN) b; |
|
366 |
||
367 |
val coiter_free = Free (Binding.name_of coiter_binder, coiter_T); |
|
368 |
(* |
|
369 |
val corec_free = Free (Binding.name_of corec_binder, corec_T); |
|
370 |
*) |
|
371 |
||
372 |
val coiter_sum_prod_Ts = map range_type fp_iter_f_Ts; |
|
373 |
val coiter_prod_Tss = map2 dest_sumTN ns coiter_sum_prod_Ts; |
|
374 |
||
375 |
fun mk_join c n cqs sum_prod_T prod_Ts cgss = |
|
376 |
Term.lambda c (mk_IfN sum_prod_T cqs |
|
377 |
(map2 (mk_InN prod_Ts) (map HOLogic.mk_tuple cgss) (1 upto n))); |
|
378 |
||
379 |
val coiter_spec = |
|
380 |
mk_Trueprop_eq (flat_list_comb (coiter_free, qgss), |
|
381 |
Term.list_comb (fp_iter, |
|
382 |
map6 mk_join cs ns cqss coiter_sum_prod_Ts coiter_prod_Tss cgsss)); |
|
383 |
(* |
|
384 |
val corec_spec = |
|
385 |
mk_Trueprop_eq (flat_list_comb (corec_free, hss), |
|
386 |
Term.list_comb (fp_rec, map2 (mk_sum_caseN oo map2 mk_uncurried2_fun) hss zssss)); |
|
387 |
*) |
|
388 |
||
389 |
val (([raw_coiter (*, raw_corec*)], [raw_coiter_def (*, raw_corec_def*)]), (lthy', lthy)) = no_defs_lthy |
|
390 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
|
391 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
|
392 |
#>> apsnd snd) [coiter_binder (*, corec_binder*)] [coiter_spec (*, corec_spec*)] |
|
393 |
||> `Local_Theory.restore; |
|
394 |
||
395 |
(*transforms defined frees into consts (and more)*) |
|
396 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
397 |
||
398 |
val coiter_def = Morphism.thm phi raw_coiter_def; |
|
399 |
(* |
|
400 |
val corec_def = Morphism.thm phi raw_corec_def; |
|
401 |
*) |
|
402 |
||
403 |
val coiter0 = Morphism.term phi raw_coiter; |
|
404 |
(* |
|
405 |
val corec0 = Morphism.term phi raw_corec; |
|
406 |
*) |
|
407 |
||
408 |
val coiter = mk_iter_like As Cs coiter0; |
|
409 |
(* |
|
410 |
val corec = mk_iter_like As Cs corec0; |
|
411 |
*) |
|
412 |
||
413 |
(*###*) |
|
414 |
val corec = @{term True}; |
|
415 |
val corec_def = TrueI; |
|
416 |
in |
|
417 |
((ctrs, coiter, corec, xss, ctr_defs, coiter_def, corec_def), lthy) |
|
418 |
end; |
|
49119 | 419 |
in |
49203 | 420 |
wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy' |
49210 | 421 |
|> (if lfp then some_lfp_sugar else some_gfp_sugar) |
49119 | 422 |
end; |
49167 | 423 |
|
49205 | 424 |
fun pour_more_sugar_on_datatypes ((ctrss, iters, recs, xsss, ctr_defss, iter_defs, rec_defs), |
425 |
lthy) = |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
426 |
let |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
427 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
49204 | 428 |
val giters = map (fn iter => flat_list_comb (iter, gss)) iters; |
429 |
val hrecs = map (fn recx => flat_list_comb (recx, hss)) recs; |
|
49201 | 430 |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
431 |
val (iter_thmss, rec_thmss) = |
49207 | 432 |
let |
49204 | 433 |
fun mk_goal_iter_or_rec fss fc xctr f xs xs' = |
49207 | 434 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
435 |
(mk_Trueprop_eq (fc $ xctr, Term.list_comb (f, xs'))); |
|
49204 | 436 |
|
437 |
fun fix_iter_free (x as Free (_, T)) = |
|
438 |
(case find_index (eq_fpT T) fpTs of ~1 => x | j => nth giters j $ x); |
|
439 |
fun fix_rec_free (x as Free (_, T)) = |
|
440 |
(case find_index (eq_fpT T) fpTs of ~1 => [x] | j => [x, nth hrecs j $ x]); |
|
49201 | 441 |
|
49204 | 442 |
val iter_xsss = map (map (map fix_iter_free)) xsss; |
443 |
val rec_xsss = map (map (maps fix_rec_free)) xsss; |
|
444 |
||
445 |
val goal_iterss = |
|
446 |
map5 (map4 o mk_goal_iter_or_rec gss) giters xctrss gss xsss iter_xsss; |
|
447 |
val goal_recss = |
|
448 |
map5 (map4 o mk_goal_iter_or_rec hss) hrecs xctrss hss xsss rec_xsss; |
|
449 |
||
49203 | 450 |
val iter_tacss = |
49207 | 451 |
map2 (map o mk_iter_or_rec_tac pre_map_defs iter_defs) fp_iter_thms ctr_defss; |
49203 | 452 |
val rec_tacss = |
49207 | 453 |
map2 (map o mk_iter_or_rec_tac pre_map_defs rec_defs) fp_rec_thms ctr_defss; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
454 |
in |
49205 | 455 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
456 |
goal_iterss iter_tacss, |
|
457 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
|
458 |
goal_recss rec_tacss) |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
459 |
end; |
49201 | 460 |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
461 |
val notes = |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
462 |
[(itersN, iter_thmss), |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
463 |
(recsN, rec_thmss)] |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
464 |
|> maps (fn (thmN, thmss) => |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
465 |
map2 (fn b => fn thms => |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
466 |
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])])) |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
467 |
bs thmss); |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
468 |
in |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
469 |
lthy |> Local_Theory.notes notes |> snd |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
470 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
471 |
|
49204 | 472 |
val lthy' = lthy |
49210 | 473 |
|> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ |
474 |
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ctr_binderss ~~ ctr_mixfixess ~~ |
|
475 |
ctr_Tsss ~~ disc_binderss ~~ sel_bindersss) |
|
49205 | 476 |
|>> split_list7 |
49208 | 477 |
|> (if lfp then pour_more_sugar_on_datatypes else snd); |
49167 | 478 |
|
479 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
49208 | 480 |
(if lfp then "" else "co") ^ "datatype")); |
49112 | 481 |
in |
49204 | 482 |
(timer; lthy') |
49112 | 483 |
end; |
484 |
||
49199 | 485 |
fun datatype_cmd info specs lthy = |
49121 | 486 |
let |
49209 | 487 |
(* TODO: cleaner handling of fake contexts, without "background_theory" *) |
49184
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset
|
488 |
(*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a |
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset
|
489 |
locale and shadows an existing global type*) |
49179
f9d48d479c84
don't throw away the context when hacking the theory (first step to localize the sugar code)
blanchet
parents:
49177
diff
changeset
|
490 |
val fake_thy = Theory.copy |
49184
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset
|
491 |
#> fold (fn spec => perhaps (try (Sign.add_type lthy |
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset
|
492 |
(type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs; |
49179
f9d48d479c84
don't throw away the context when hacking the theory (first step to localize the sugar code)
blanchet
parents:
49177
diff
changeset
|
493 |
val fake_lthy = Proof_Context.background_theory fake_thy lthy; |
49121 | 494 |
in |
49199 | 495 |
prepare_datatype Syntax.read_typ info specs fake_lthy lthy |
49121 | 496 |
end; |
49119 | 497 |
|
49129 | 498 |
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder |
49119 | 499 |
|
49112 | 500 |
val parse_ctr_arg = |
49119 | 501 |
Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" || |
49129 | 502 |
(Parse.typ >> pair no_binder); |
49112 | 503 |
|
504 |
val parse_single_spec = |
|
505 |
Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix -- |
|
49119 | 506 |
(@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding -- |
507 |
Scan.repeat parse_ctr_arg -- Parse.opt_mixfix)); |
|
49112 | 508 |
|
509 |
val _ = |
|
510 |
Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes" |
|
49208 | 511 |
(Parse.and_list1 parse_single_spec >> datatype_cmd true); |
49112 | 512 |
|
513 |
val _ = |
|
514 |
Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes" |
|
49208 | 515 |
(Parse.and_list1 parse_single_spec >> datatype_cmd false); |
49112 | 516 |
|
517 |
end; |