author | blanchet |
Mon, 10 Sep 2012 18:29:55 +0200 | |
changeset 49264 | 9059e0dbdbc1 |
parent 49263 | 669a820ef213 |
child 49266 | 70ffce5b65a4 |
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 |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
18 |
open BNF_Def |
49119 | 19 |
open BNF_FP_Util |
20 |
open BNF_LFP |
|
21 |
open BNF_GFP |
|
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
22 |
open BNF_FP_Sugar_Tactics |
49119 | 23 |
|
49129 | 24 |
val caseN = "case"; |
49213 | 25 |
val coitersN = "coiters"; |
26 |
val corecsN = "corecs"; |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
27 |
val itersN = "iters"; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
28 |
val recsN = "recs"; |
49129 | 29 |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
30 |
fun split_list8 xs = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
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); |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
32 |
|
49217 | 33 |
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T |
34 |
| strip_map_type T = ([], T); |
|
35 |
||
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
36 |
fun typ_subst inst (T as Type (s, Ts)) = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
37 |
(case AList.lookup (op =) inst T of |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
38 |
NONE => Type (s, map (typ_subst inst) Ts) |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
39 |
| SOME T' => T') |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
40 |
| typ_subst inst T = the_default T (AList.lookup (op =) inst T); |
49205 | 41 |
|
49199 | 42 |
fun retype_free (Free (s, _)) T = Free (s, T); |
43 |
||
49212 | 44 |
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs)) |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
45 |
|
49234 | 46 |
fun mk_id T = Const (@{const_name id}, T --> T); |
47 |
||
49200 | 48 |
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); |
49 |
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
|
50 |
fun mk_uncurried2_fun f xss = |
49200 | 51 |
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); |
52 |
||
49233 | 53 |
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v)); |
54 |
||
55 |
fun tack z_name (c, v) f = |
|
56 |
let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
57 |
Term.lambda z (mk_sum_case (Term.lambda v v, Term.lambda c (f $ c)) $ z) |
49233 | 58 |
end; |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
59 |
|
49124 | 60 |
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters"; |
49119 | 61 |
|
62 |
fun merge_type_arg_constrained ctxt (T, c) (T', c') = |
|
63 |
if T = T' then |
|
64 |
(case (c, c') of |
|
65 |
(_, NONE) => (T, c) |
|
66 |
| (NONE, _) => (T, c') |
|
67 |
| _ => |
|
68 |
if c = c' then |
|
69 |
(T, c) |
|
70 |
else |
|
71 |
error ("Inconsistent sort constraints for type variable " ^ |
|
72 |
quote (Syntax.string_of_typ ctxt T))) |
|
73 |
else |
|
74 |
cannot_merge_types (); |
|
75 |
||
76 |
fun merge_type_args_constrained ctxt (cAs, cAs') = |
|
77 |
if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs' |
|
78 |
else cannot_merge_types (); |
|
79 |
||
49121 | 80 |
fun type_args_constrained_of (((cAs, _), _), _) = cAs; |
81 |
val type_args_of = map fst o type_args_constrained_of; |
|
49129 | 82 |
fun type_binder_of (((_, b), _), _) = b; |
49181 | 83 |
fun mixfix_of ((_, mx), _) = mx; |
49121 | 84 |
fun ctr_specs_of (_, ctr_specs) = ctr_specs; |
49119 | 85 |
|
49121 | 86 |
fun disc_of (((disc, _), _), _) = disc; |
87 |
fun ctr_of (((_, ctr), _), _) = ctr; |
|
88 |
fun args_of ((_, args), _) = args; |
|
49181 | 89 |
fun ctr_mixfix_of (_, mx) = mx; |
49119 | 90 |
|
49208 | 91 |
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy = |
49112 | 92 |
let |
49121 | 93 |
val constrained_As = |
94 |
map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs |
|
49204 | 95 |
|> Library.foldr1 (merge_type_args_constrained no_defs_lthy); |
49121 | 96 |
val As = map fst constrained_As; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
97 |
val As' = map dest_TFree As; |
49119 | 98 |
|
49121 | 99 |
val _ = (case duplicates (op =) As of [] => () |
49204 | 100 |
| A :: _ => error ("Duplicate type parameter " ^ |
101 |
quote (Syntax.string_of_typ no_defs_lthy A))); |
|
49119 | 102 |
|
103 |
(* TODO: use sort constraints on type args *) |
|
104 |
||
105 |
val N = length specs; |
|
106 |
||
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
|
107 |
fun mk_fake_T b = |
49121 | 108 |
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))), |
109 |
As); |
|
110 |
||
49129 | 111 |
val bs = map type_binder_of specs; |
49204 | 112 |
val fakeTs = map mk_fake_T bs; |
49121 | 113 |
|
49181 | 114 |
val mixfixes = map mixfix_of specs; |
49119 | 115 |
|
116 |
val _ = (case duplicates Binding.eq_name bs of [] => () |
|
117 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
|
118 |
||
49121 | 119 |
val ctr_specss = map ctr_specs_of specs; |
49119 | 120 |
|
49129 | 121 |
val disc_binderss = map (map disc_of) ctr_specss; |
122 |
val ctr_binderss = map (map ctr_of) ctr_specss; |
|
49121 | 123 |
val ctr_argsss = map (map args_of) ctr_specss; |
49181 | 124 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; |
49119 | 125 |
|
49129 | 126 |
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
|
127 |
val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
49121 | 128 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
129 |
val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss []; |
49167 | 130 |
val _ = (case subtract (op =) As' rhs_As' of |
49165 | 131 |
[] => () |
132 |
| A' :: _ => error ("Extra type variables on rhs: " ^ |
|
49204 | 133 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); |
49165 | 134 |
|
49176 | 135 |
val ((Cs, Xs), _) = |
49204 | 136 |
no_defs_lthy |
49121 | 137 |
|> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs |
138 |
|> mk_TFrees N |
|
49176 | 139 |
||>> mk_TFrees N; |
49119 | 140 |
|
49204 | 141 |
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) = |
49146 | 142 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ |
143 |
quote (Syntax.string_of_typ fake_lthy T))) |
|
49204 | 144 |
| eq_fpT _ _ = false; |
49146 | 145 |
|
49204 | 146 |
fun freeze_fp (T as Type (s, Us)) = |
147 |
(case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us) | j => nth Xs j) |
|
148 |
| freeze_fp T = T; |
|
49121 | 149 |
|
49204 | 150 |
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss; |
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
151 |
val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs; |
49119 | 152 |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
153 |
val eqs = map dest_TFree Xs ~~ ctr_sum_prod_TsXs; |
49121 | 154 |
|
49226 | 155 |
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects, |
49207 | 156 |
fp_iter_thms, fp_rec_thms), lthy)) = |
49208 | 157 |
fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy; |
49121 | 158 |
|
49226 | 159 |
val add_nested_bnf_names = |
160 |
let |
|
161 |
fun add (Type (s, Ts)) ss = |
|
162 |
let val (needs, ss') = fold_map add Ts ss in |
|
163 |
if exists I needs then (true, insert (op =) s ss') else (false, ss') |
|
164 |
end |
|
165 |
| add T ss = (member (op =) As T, ss); |
|
166 |
in snd oo add end; |
|
167 |
||
168 |
val nested_bnfs = |
|
49236 | 169 |
map_filter (bnf_of lthy) (fold (fold (fold add_nested_bnf_names)) ctr_TsssXs []); |
49226 | 170 |
|
49167 | 171 |
val timer = time (Timer.startRealTimer ()); |
172 |
||
49176 | 173 |
fun mk_unf_or_fld get_T Ts t = |
174 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
49124 | 175 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
49121 | 176 |
end; |
49119 | 177 |
|
49126 | 178 |
val mk_unf = mk_unf_or_fld domain_type; |
179 |
val mk_fld = mk_unf_or_fld range_type; |
|
49121 | 180 |
|
49203 | 181 |
val unfs = map (mk_unf As) unfs0; |
182 |
val flds = map (mk_fld As) flds0; |
|
49124 | 183 |
|
49201 | 184 |
val fpTs = map (domain_type o fastype_of) unfs; |
49204 | 185 |
|
49201 | 186 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; |
49203 | 187 |
val ns = map length ctr_Tsss; |
49212 | 188 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 189 |
val mss = map (map length) ctr_Tsss; |
190 |
val Css = map2 replicate ns Cs; |
|
191 |
||
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
192 |
fun mk_iter_like Ts Us t = |
49121 | 193 |
let |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
194 |
val (binders, body) = strip_type (fastype_of t); |
49210 | 195 |
val (f_Us, prebody) = split_last binders; |
196 |
val Type (_, Ts0) = if lfp then prebody else body; |
|
197 |
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); |
|
49176 | 198 |
in |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
199 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
49176 | 200 |
end; |
201 |
||
49210 | 202 |
val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0; |
203 |
val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0; |
|
204 |
||
49212 | 205 |
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); |
206 |
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); |
|
49204 | 207 |
|
208 |
fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) = |
|
209 |
if member (op =) Cs U then Us else [T] |
|
210 |
| dest_rec_pair T = [T]; |
|
211 |
||
49256 | 212 |
val ((iter_only as (gss, _, _), rec_only as (hss, _, _)), |
213 |
(zs, cs, cpss, coiter_only as ((pgss, cgsss), _), corec_only as ((phss, chsss), _))) = |
|
49208 | 214 |
if lfp then |
215 |
let |
|
216 |
val y_Tsss = |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
217 |
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) |
49212 | 218 |
ns mss fp_iter_fun_Ts; |
49208 | 219 |
val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css; |
220 |
||
221 |
val ((gss, ysss), _) = |
|
222 |
lthy |
|
223 |
|> mk_Freess "f" g_Tss |
|
224 |
||>> mk_Freesss "x" y_Tsss; |
|
49204 | 225 |
|
49208 | 226 |
val z_Tssss = |
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
227 |
map3 (fn n => fn ms => map2 (map dest_rec_pair oo dest_tupleT) ms o |
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
228 |
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; |
49208 | 229 |
val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css; |
49204 | 230 |
|
49208 | 231 |
val hss = map2 (map2 retype_free) gss h_Tss; |
232 |
val (zssss, _) = |
|
233 |
lthy |
|
234 |
|> mk_Freessss "x" z_Tssss; |
|
49210 | 235 |
in |
49215 | 236 |
(((gss, g_Tss, map (map (map single)) ysss), (hss, h_Tss, zssss)), |
49256 | 237 |
([], [], [], (([], []), ([], [])), (([], []), ([], [])))) |
49210 | 238 |
end |
49208 | 239 |
else |
49210 | 240 |
let |
49221
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
241 |
(*avoid "'a itself" arguments in coiterators and corecursors*) |
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
242 |
val mss' = map (fn [0] => [1] | ms => ms) mss; |
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
243 |
|
49211 | 244 |
val p_Tss = |
49210 | 245 |
map2 (fn C => fn n => replicate (Int.max (0, n - 1)) (C --> HOLogic.boolT)) Cs ns; |
49211 | 246 |
|
49254 | 247 |
fun zip_preds_getters [] [fs] = fs |
248 |
| zip_preds_getters (p :: ps) (fs :: fss) = p :: fs @ zip_preds_getters ps fss; |
|
49215 | 249 |
|
49212 | 250 |
fun mk_types fun_Ts = |
251 |
let |
|
252 |
val f_sum_prod_Ts = map range_type fun_Ts; |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
253 |
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; |
49212 | 254 |
val f_Tsss = |
49221
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
255 |
map3 (fn C => map2 (map (curry (op -->) C) oo dest_tupleT)) Cs mss' f_prod_Tss; |
49254 | 256 |
val pf_Tss = map2 zip_preds_getters p_Tss f_Tsss |
49256 | 257 |
in (f_sum_prod_Ts, f_Tsss, pf_Tss) end; |
49176 | 258 |
|
49256 | 259 |
val (g_sum_prod_Ts, g_Tsss, pg_Tss) = mk_types fp_iter_fun_Ts; |
260 |
val (h_sum_prod_Ts, h_Tsss, ph_Tss) = mk_types fp_rec_fun_Ts; |
|
49211 | 261 |
|
49233 | 262 |
val ((((Free (z, _), cs), pss), gsss), _) = |
49210 | 263 |
lthy |
49233 | 264 |
|> yield_singleton (mk_Frees "z") dummyT |
265 |
||>> mk_Frees "a" Cs |
|
49211 | 266 |
||>> mk_Freess "p" p_Tss |
49210 | 267 |
||>> mk_Freesss "g" g_Tsss; |
268 |
||
49211 | 269 |
val hsss = map2 (map2 (map2 retype_free)) gsss h_Tsss; |
270 |
||
49212 | 271 |
val cpss = map2 (fn c => map (fn p => p $ c)) cs pss; |
272 |
||
273 |
fun mk_terms fsss = |
|
274 |
let |
|
49254 | 275 |
val pfss = map2 zip_preds_getters pss fsss; |
49212 | 276 |
val cfsss = map2 (fn c => map (map (fn f => f $ c))) cs fsss |
277 |
in (pfss, cfsss) end; |
|
49210 | 278 |
in |
49212 | 279 |
((([], [], []), ([], [], [])), |
49256 | 280 |
([z], cs, cpss, (mk_terms gsss, (g_sum_prod_Ts, pg_Tss)), |
281 |
(mk_terms hsss, (h_sum_prod_Ts, ph_Tss)))) |
|
49210 | 282 |
end; |
283 |
||
49212 | 284 |
fun pour_some_sugar_on_type (((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec), |
285 |
fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss), |
|
286 |
disc_binders), sel_binderss) no_defs_lthy = |
|
49176 | 287 |
let |
49201 | 288 |
val unfT = domain_type (fastype_of fld); |
49210 | 289 |
val ctr_prod_Ts = map HOLogic.mk_tupleT ctr_Tss; |
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
290 |
val ctr_sum_prod_T = mk_sumTN_balanced ctr_prod_Ts; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
291 |
val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss; |
49119 | 292 |
|
49176 | 293 |
val ((((u, v), fs), xss), _) = |
49204 | 294 |
no_defs_lthy |
49201 | 295 |
|> yield_singleton (mk_Frees "u") unfT |
296 |
||>> yield_singleton (mk_Frees "v") fpT |
|
49176 | 297 |
||>> mk_Frees "f" case_Ts |
49124 | 298 |
||>> mk_Freess "x" ctr_Tss; |
49121 | 299 |
|
49129 | 300 |
val ctr_rhss = |
49256 | 301 |
map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $ |
302 |
mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss; |
|
49121 | 303 |
|
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
304 |
val case_binder = Binding.suffix_name ("_" ^ caseN) b; |
49129 | 305 |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
306 |
val case_rhs = |
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
307 |
fold_rev Term.lambda (fs @ [v]) |
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
308 |
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v)); |
49129 | 309 |
|
49201 | 310 |
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 311 |
|> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => |
312 |
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) |
|
49201 | 313 |
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) |
49121 | 314 |
||> `Local_Theory.restore; |
315 |
||
316 |
(*transforms defined frees into consts (and more)*) |
|
317 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
318 |
||
319 |
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
|
320 |
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
|
321 |
|
49203 | 322 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
323 |
val casex0 = Morphism.term phi raw_case; |
|
324 |
||
325 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 326 |
|
49135 | 327 |
fun exhaust_tac {context = ctxt, ...} = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
328 |
let |
49135 | 329 |
val fld_iff_unf_thm = |
330 |
let |
|
331 |
val goal = |
|
332 |
fold_rev Logic.all [u, v] |
|
333 |
(mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u))); |
|
334 |
in |
|
335 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
49201 | 336 |
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT]) |
49176 | 337 |
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) |
49135 | 338 |
|> Thm.close_derivation |
339 |
|> Morphism.thm phi |
|
340 |
end; |
|
341 |
||
342 |
val sumEN_thm' = |
|
343 |
Local_Defs.unfold lthy @{thms all_unit_eq} |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
344 |
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] |
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
345 |
(mk_sumEN_balanced n)) |
49135 | 346 |
|> Morphism.thm phi; |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
347 |
in |
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents:
49157
diff
changeset
|
348 |
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
|
349 |
end; |
49121 | 350 |
|
49126 | 351 |
val inject_tacss = |
49205 | 352 |
map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} => |
353 |
mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs; |
|
49126 | 354 |
|
49127 | 355 |
val half_distinct_tacss = |
356 |
map (map (fn (def, def') => fn {context = ctxt, ...} => |
|
357 |
mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs); |
|
358 |
||
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
359 |
val case_tacs = |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
360 |
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
|
361 |
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; |
49121 | 362 |
|
363 |
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
|
364 |
|
49210 | 365 |
fun some_lfp_sugar no_defs_lthy = |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
366 |
let |
49208 | 367 |
val fpT_to_C = fpT --> C; |
49199 | 368 |
|
49215 | 369 |
fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) = |
370 |
let |
|
371 |
val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C; |
|
372 |
||
373 |
val binder = Binding.suffix_name ("_" ^ suf) b; |
|
49199 | 374 |
|
49215 | 375 |
val spec = |
376 |
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)), |
|
377 |
Term.list_comb (fp_iter_like, |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
378 |
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); |
49215 | 379 |
in (binder, spec) end; |
49199 | 380 |
|
49215 | 381 |
val iter_likes = |
382 |
[(iterN, fp_iter, iter_only), |
|
383 |
(recN, fp_rec, rec_only)]; |
|
384 |
||
385 |
val (binders, specs) = map generate_iter_like iter_likes |> split_list; |
|
386 |
||
387 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49201 | 388 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
49199 | 389 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
49215 | 390 |
#>> apsnd snd) binders specs |
49199 | 391 |
||> `Local_Theory.restore; |
49201 | 392 |
|
393 |
(*transforms defined frees into consts (and more)*) |
|
394 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
395 |
||
49215 | 396 |
val [iter_def, rec_def] = map (Morphism.thm phi) defs; |
49201 | 397 |
|
49215 | 398 |
val [iter, recx] = map (mk_iter_like As Cs o Morphism.term phi) csts; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
399 |
in |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
400 |
((ctrs, iter, recx, v, xss, ctr_defs, iter_def, rec_def), lthy) |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
401 |
end; |
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
402 |
|
49210 | 403 |
fun some_gfp_sugar no_defs_lthy = |
404 |
let |
|
405 |
val B_to_fpT = C --> fpT; |
|
49211 | 406 |
|
49256 | 407 |
fun generate_coiter_like (suf, fp_iter_like, ((pfss, cfsss), (f_sum_prod_Ts, pf_Tss))) = |
49211 | 408 |
let |
409 |
val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT; |
|
49210 | 410 |
|
49211 | 411 |
val binder = Binding.suffix_name ("_" ^ suf) b; |
49210 | 412 |
|
49256 | 413 |
fun mk_preds_getters_join c n cps sum_prod_T cfss = |
49211 | 414 |
Term.lambda c (mk_IfN sum_prod_T cps |
49256 | 415 |
(map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cfss) (1 upto n))); |
49210 | 416 |
|
49211 | 417 |
val spec = |
49212 | 418 |
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)), |
49211 | 419 |
Term.list_comb (fp_iter_like, |
49256 | 420 |
map5 mk_preds_getters_join cs ns cpss f_sum_prod_Ts cfsss)); |
49211 | 421 |
in (binder, spec) end; |
49210 | 422 |
|
49212 | 423 |
val coiter_likes = |
49215 | 424 |
[(coiterN, fp_iter, coiter_only), |
425 |
(corecN, fp_rec, corec_only)]; |
|
49212 | 426 |
|
49211 | 427 |
val (binders, specs) = map generate_coiter_like coiter_likes |> split_list; |
428 |
||
429 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49210 | 430 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
431 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
|
49211 | 432 |
#>> apsnd snd) binders specs |
49210 | 433 |
||> `Local_Theory.restore; |
434 |
||
435 |
(*transforms defined frees into consts (and more)*) |
|
436 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
437 |
||
49211 | 438 |
val [coiter_def, corec_def] = map (Morphism.thm phi) defs; |
49210 | 439 |
|
49211 | 440 |
val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts; |
49210 | 441 |
in |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
442 |
((ctrs, coiter, corec, v, xss, ctr_defs, coiter_def, corec_def), lthy) |
49210 | 443 |
end; |
49119 | 444 |
in |
49203 | 445 |
wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy' |
49210 | 446 |
|> (if lfp then some_lfp_sugar else some_gfp_sugar) |
49119 | 447 |
end; |
49167 | 448 |
|
49226 | 449 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
450 |
val map_ids = map map_id_of_bnf nested_bnfs; |
49226 | 451 |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
452 |
fun mk_map Ts Us t = |
49217 | 453 |
let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type (fastype_of t) |>> List.last in |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
454 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
455 |
end; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
456 |
|
49234 | 457 |
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = |
458 |
let |
|
49236 | 459 |
val map0 = map_of_bnf (the (bnf_of lthy s)); |
49234 | 460 |
val mapx = mk_map Ts Us map0; |
461 |
val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx))))); |
|
462 |
val args = map build_arg TUs; |
|
463 |
in Term.list_comb (mapx, args) end; |
|
464 |
||
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
465 |
fun pour_more_sugar_on_lfps ((ctrss, iters, recs, vs, xsss, ctr_defss, iter_defs, rec_defs), |
49205 | 466 |
lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
467 |
let |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
468 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
49212 | 469 |
val giters = map (lists_bmoc gss) iters; |
470 |
val hrecs = map (lists_bmoc hss) recs; |
|
49201 | 471 |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
472 |
val (iter_thmss, rec_thmss) = |
49207 | 473 |
let |
49212 | 474 |
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = |
49207 | 475 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
49212 | 476 |
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); |
49204 | 477 |
|
49234 | 478 |
fun build_call fiter_likes maybe_tick (T, U) = |
479 |
if T = U then |
|
480 |
mk_id T |
|
481 |
else |
|
482 |
(case find_index (curry (op =) T) fpTs of |
|
483 |
~1 => build_map (build_call fiter_likes maybe_tick) T U |
|
484 |
| j => maybe_tick (nth vs j) (nth fiter_likes j)); |
|
49233 | 485 |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
486 |
fun mk_U maybe_prodT = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
487 |
typ_subst (map2 (fn fpT => fn C => (fpT, maybe_prodT fpT C)) fpTs Cs); |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
488 |
|
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
489 |
fun repair_calls fiter_likes maybe_cons maybe_tick maybe_prodT (x as Free (_, T)) = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
490 |
if member (op =) fpTs T then |
49233 | 491 |
maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x] |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
492 |
else if exists_subtype (member (op =) fpTs) T then |
49233 | 493 |
[build_call fiter_likes maybe_tick (T, mk_U maybe_prodT T) $ x] |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
494 |
else |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
495 |
[x]; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
496 |
|
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
497 |
val gxsss = map (map (maps (repair_calls giters (K I) (K I) (K I)))) xsss; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
498 |
val hxsss = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
499 |
map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; |
49204 | 500 |
|
49212 | 501 |
val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss; |
502 |
val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss; |
|
49204 | 503 |
|
49203 | 504 |
val iter_tacss = |
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
505 |
map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss; |
49203 | 506 |
val rec_tacss = |
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
507 |
map2 (map o mk_iter_like_tac pre_map_defs map_ids rec_defs) fp_rec_thms ctr_defss; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
508 |
in |
49205 | 509 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
510 |
goal_iterss iter_tacss, |
|
511 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
|
512 |
goal_recss rec_tacss) |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
513 |
end; |
49201 | 514 |
|
49226 | 515 |
val notes = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
516 |
[(itersN, iter_thmss), |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
517 |
(recsN, rec_thmss)] |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
518 |
|> maps (fn (thmN, thmss) => |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
519 |
map2 (fn b => fn thms => |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
520 |
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])])) |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
521 |
bs thmss); |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
522 |
in |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
523 |
lthy |> Local_Theory.notes notes |> snd |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
524 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
525 |
|
49256 | 526 |
fun pour_more_sugar_on_gfps ((ctrss, coiters, corecs, vs, _, ctr_defss, coiter_defs, |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
527 |
corec_defs), lthy) = |
49212 | 528 |
let |
49233 | 529 |
val z = the_single zs; |
530 |
||
49212 | 531 |
val gcoiters = map (lists_bmoc pgss) coiters; |
532 |
val hcorecs = map (lists_bmoc phss) corecs; |
|
533 |
||
534 |
val (coiter_thmss, corec_thmss) = |
|
535 |
let |
|
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
536 |
fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); |
49212 | 537 |
|
49235
f9fc2b64c599
fixed bug with one-value codatatype "codata 'a dead_foo = A"
blanchet
parents:
49234
diff
changeset
|
538 |
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' = |
49212 | 539 |
fold_rev (fold_rev Logic.all) ([c] :: pfss) |
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
540 |
(Logic.list_implies (seq_conds mk_goal_cond n k cps, |
49235
f9fc2b64c599
fixed bug with one-value codatatype "codata 'a dead_foo = A"
blanchet
parents:
49234
diff
changeset
|
541 |
mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs')))); |
49212 | 542 |
|
49234 | 543 |
fun build_call fiter_likes maybe_tack (T, U) = |
544 |
if T = U then |
|
545 |
mk_id T |
|
546 |
else |
|
547 |
(case find_index (curry (op =) U) fpTs of |
|
548 |
~1 => build_map (build_call fiter_likes maybe_tack) T U |
|
549 |
| j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j)); |
|
49233 | 550 |
|
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
551 |
fun mk_U maybe_sumT = |
49233 | 552 |
typ_subst (map2 (fn C => fn fpT => (maybe_sumT fpT C, fpT)) Cs fpTs); |
49212 | 553 |
|
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
554 |
fun repair_calls fiter_likes maybe_sumT maybe_tack |
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
555 |
(cf as Free (_, Type (_, [_, T])) $ _) = |
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
556 |
if exists_subtype (member (op =) Cs) T then |
49233 | 557 |
build_call fiter_likes maybe_tack (T, mk_U maybe_sumT T) $ cf |
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
558 |
else |
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
559 |
cf; |
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
560 |
|
49235
f9fc2b64c599
fixed bug with one-value codatatype "codata 'a dead_foo = A"
blanchet
parents:
49234
diff
changeset
|
561 |
val cgsss' = map (map (map (repair_calls gcoiters (K I) (K I)))) cgsss; |
f9fc2b64c599
fixed bug with one-value codatatype "codata 'a dead_foo = A"
blanchet
parents:
49234
diff
changeset
|
562 |
val chsss' = map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z)))) chsss; |
49212 | 563 |
|
564 |
val goal_coiterss = |
|
49235
f9fc2b64c599
fixed bug with one-value codatatype "codata 'a dead_foo = A"
blanchet
parents:
49234
diff
changeset
|
565 |
map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss cgsss'; |
49233 | 566 |
val goal_corecss = |
49235
f9fc2b64c599
fixed bug with one-value codatatype "codata 'a dead_foo = A"
blanchet
parents:
49234
diff
changeset
|
567 |
map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss chsss'; |
49213 | 568 |
|
569 |
val coiter_tacss = |
|
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
570 |
map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs |
49226 | 571 |
ctr_defss; |
49233 | 572 |
val corec_tacss = |
573 |
map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs |
|
574 |
ctr_defss; |
|
49212 | 575 |
in |
49213 | 576 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
577 |
goal_coiterss coiter_tacss, |
|
49233 | 578 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
579 |
goal_corecss corec_tacss) |
|
49212 | 580 |
end; |
581 |
||
582 |
val notes = |
|
49233 | 583 |
[(coitersN, coiter_thmss), |
584 |
(corecsN, corec_thmss)] |
|
49212 | 585 |
|> maps (fn (thmN, thmss) => |
586 |
map2 (fn b => fn thms => |
|
587 |
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])])) |
|
588 |
bs thmss); |
|
589 |
in |
|
49230 | 590 |
lthy |> Local_Theory.notes notes |> snd |
49212 | 591 |
end; |
592 |
||
49204 | 593 |
val lthy' = lthy |
49210 | 594 |
|> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ |
49212 | 595 |
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~ |
596 |
ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss) |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
597 |
|>> split_list8 |
49212 | 598 |
|> (if lfp then pour_more_sugar_on_lfps else pour_more_sugar_on_gfps); |
49167 | 599 |
|
600 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
49208 | 601 |
(if lfp then "" else "co") ^ "datatype")); |
49112 | 602 |
in |
49204 | 603 |
(timer; lthy') |
49112 | 604 |
end; |
605 |
||
49199 | 606 |
fun datatype_cmd info specs lthy = |
49121 | 607 |
let |
49209 | 608 |
(* 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
|
609 |
(*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
|
610 |
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
|
611 |
val fake_thy = Theory.copy |
49184
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset
|
612 |
#> fold (fn spec => perhaps (try (Sign.add_type lthy |
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset
|
613 |
(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
|
614 |
val fake_lthy = Proof_Context.background_theory fake_thy lthy; |
49121 | 615 |
in |
49199 | 616 |
prepare_datatype Syntax.read_typ info specs fake_lthy lthy |
49121 | 617 |
end; |
49119 | 618 |
|
49129 | 619 |
val parse_opt_binding_colon = Scan.optional (Parse.binding --| Parse.$$$ ":") no_binder |
49119 | 620 |
|
49112 | 621 |
val parse_ctr_arg = |
49119 | 622 |
Parse.$$$ "(" |-- parse_opt_binding_colon -- Parse.typ --| Parse.$$$ ")" || |
49129 | 623 |
(Parse.typ >> pair no_binder); |
49112 | 624 |
|
625 |
val parse_single_spec = |
|
626 |
Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix -- |
|
49119 | 627 |
(@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding -- |
628 |
Scan.repeat parse_ctr_arg -- Parse.opt_mixfix)); |
|
49112 | 629 |
|
630 |
val _ = |
|
631 |
Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes" |
|
49208 | 632 |
(Parse.and_list1 parse_single_spec >> datatype_cmd true); |
49112 | 633 |
|
634 |
val _ = |
|
635 |
Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes" |
|
49208 | 636 |
(Parse.and_list1 parse_single_spec >> datatype_cmd false); |
49112 | 637 |
|
638 |
end; |