author  blanchet 
Tue, 11 Sep 2012 13:06:14 +0200  
changeset 49275  ce87d6a901eb 
parent 49274  ddd606ec45b9 
child 49276  59fa53ed7507 
permissions  rwrr 
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"; 

49266  27 
val disc_coitersN = "disc_coiters"; 
28 
val disc_corecsN = "disc_corecs"; 

49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

29 
val itersN = "iters"; 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

30 
val recsN = "recs"; 
49266  31 
val sel_coitersN = "sel_coiters"; 
32 
val sel_corecsN = "sel_corecs"; 

49129  33 

49266  34 
fun split_list11 xs = 
35 
(map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs, 

36 
map #9 xs, map #10 xs, map #11 xs); 

49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

37 

49217  38 
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' >> cons T 
39 
 strip_map_type T = ([], T); 

40 

49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

41 
fun typ_subst inst (T as Type (s, Ts)) = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

42 
(case AList.lookup (op =) inst T of 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

43 
NONE => Type (s, map (typ_subst inst) Ts) 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

44 
 SOME T' => T') 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

45 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  46 

49199  47 
fun retype_free (Free (s, _)) T = Free (s, T); 
48 

49212  49 
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

50 

49275  51 
fun mk_predT T = T > HOLogic.boolT; 
52 

49234  53 
fun mk_id T = Const (@{const_name id}, T > T); 
54 

49200  55 
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); 
56 
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

57 
fun mk_uncurried2_fun f xss = 
49200  58 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); 
59 

49233  60 
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v)); 
61 

62 
fun tack z_name (c, v) f = 

49273
f839ce127a2e
reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets etareduced
blanchet
parents:
49268
diff
changeset

63 
let val z = Free (z_name, mk_sumT (fastype_of v, fastype_of c)) in 
f839ce127a2e
reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets etareduced
blanchet
parents:
49268
diff
changeset

64 
Term.lambda z (mk_sum_case (Term.lambda v v, Term.lambda c (f $ c)) $ z) 
f839ce127a2e
reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets etareduced
blanchet
parents:
49268
diff
changeset

65 
end; 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

66 

49124  67 
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters"; 
49119  68 

69 
fun merge_type_arg_constrained ctxt (T, c) (T', c') = 

70 
if T = T' then 

71 
(case (c, c') of 

72 
(_, NONE) => (T, c) 

73 
 (NONE, _) => (T, c') 

74 
 _ => 

75 
if c = c' then 

76 
(T, c) 

77 
else 

78 
error ("Inconsistent sort constraints for type variable " ^ 

79 
quote (Syntax.string_of_typ ctxt T))) 

80 
else 

81 
cannot_merge_types (); 

82 

83 
fun merge_type_args_constrained ctxt (cAs, cAs') = 

84 
if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs' 

85 
else cannot_merge_types (); 

86 

49121  87 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
88 
val type_args_of = map fst o type_args_constrained_of; 

49129  89 
fun type_binder_of (((_, b), _), _) = b; 
49181  90 
fun mixfix_of ((_, mx), _) = mx; 
49121  91 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  92 

49121  93 
fun disc_of (((disc, _), _), _) = disc; 
94 
fun ctr_of (((_, ctr), _), _) = ctr; 

95 
fun args_of ((_, args), _) = args; 

49181  96 
fun ctr_mixfix_of (_, mx) = mx; 
49119  97 

49208  98 
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy = 
49112  99 
let 
49121  100 
val constrained_As = 
101 
map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs 

49204  102 
> Library.foldr1 (merge_type_args_constrained no_defs_lthy); 
49121  103 
val As = map fst constrained_As; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

104 
val As' = map dest_TFree As; 
49119  105 

49121  106 
val _ = (case duplicates (op =) As of [] => () 
49204  107 
 A :: _ => error ("Duplicate type parameter " ^ 
108 
quote (Syntax.string_of_typ no_defs_lthy A))); 

49119  109 

110 
(* TODO: use sort constraints on type args *) 

111 

112 
val N = length specs; 

113 

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

114 
fun mk_fake_T b = 
49121  115 
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))), 
116 
As); 

117 

49129  118 
val bs = map type_binder_of specs; 
49204  119 
val fakeTs = map mk_fake_T bs; 
49121  120 

49181  121 
val mixfixes = map mixfix_of specs; 
49119  122 

123 
val _ = (case duplicates Binding.eq_name bs of [] => () 

124 
 b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); 

125 

49121  126 
val ctr_specss = map ctr_specs_of specs; 
49119  127 

49129  128 
val disc_binderss = map (map disc_of) ctr_specss; 
129 
val ctr_binderss = map (map ctr_of) ctr_specss; 

49121  130 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  131 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  132 

49129  133 
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

134 
val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49121  135 

49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset

136 
val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss []; 
49167  137 
val _ = (case subtract (op =) As' rhs_As' of 
49165  138 
[] => () 
139 
 A' :: _ => error ("Extra type variables on rhs: " ^ 

49204  140 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  141 

49176  142 
val ((Cs, Xs), _) = 
49204  143 
no_defs_lthy 
49121  144 
> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs 
145 
> mk_TFrees N 

49176  146 
>> mk_TFrees N; 
49119  147 

49204  148 
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) = 
49146  149 
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ 
150 
quote (Syntax.string_of_typ fake_lthy T))) 

49204  151 
 eq_fpT _ _ = false; 
49146  152 

49204  153 
fun freeze_fp (T as Type (s, Us)) = 
154 
(case find_index (eq_fpT T) fakeTs of ~1 => Type (s, map freeze_fp Us)  j => nth Xs j) 

155 
 freeze_fp T = T; 

49121  156 

49204  157 
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

158 
val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs; 
49119  159 

49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

160 
val eqs = map dest_TFree Xs ~~ ctr_sum_prod_TsXs; 
49121  161 

49226  162 
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects, 
49207  163 
fp_iter_thms, fp_rec_thms), lthy)) = 
49208  164 
fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy; 
49121  165 

49226  166 
val add_nested_bnf_names = 
167 
let 

168 
fun add (Type (s, Ts)) ss = 

169 
let val (needs, ss') = fold_map add Ts ss in 

170 
if exists I needs then (true, insert (op =) s ss') else (false, ss') 

171 
end 

172 
 add T ss = (member (op =) As T, ss); 

173 
in snd oo add end; 

174 

175 
val nested_bnfs = 

49236  176 
map_filter (bnf_of lthy) (fold (fold (fold add_nested_bnf_names)) ctr_TsssXs []); 
49226  177 

49167  178 
val timer = time (Timer.startRealTimer ()); 
179 

49176  180 
fun mk_unf_or_fld get_T Ts t = 
181 
let val Type (_, Ts0) = get_T (fastype_of t) in 

49124  182 
Term.subst_atomic_types (Ts0 ~~ Ts) t 
49121  183 
end; 
49119  184 

49126  185 
val mk_unf = mk_unf_or_fld domain_type; 
186 
val mk_fld = mk_unf_or_fld range_type; 

49121  187 

49203  188 
val unfs = map (mk_unf As) unfs0; 
189 
val flds = map (mk_fld As) flds0; 

49124  190 

49201  191 
val fpTs = map (domain_type o fastype_of) unfs; 
49204  192 

49201  193 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  194 
val ns = map length ctr_Tsss; 
49212  195 
val kss = map (fn n => 1 upto n) ns; 
49203  196 
val mss = map (map length) ctr_Tsss; 
197 
val Css = map2 replicate ns Cs; 

198 

49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

199 
fun mk_iter_like Ts Us t = 
49121  200 
let 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

201 
val (binders, body) = strip_type (fastype_of t); 
49210  202 
val (f_Us, prebody) = split_last binders; 
203 
val Type (_, Ts0) = if lfp then prebody else body; 

204 
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); 

49176  205 
in 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

206 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 
49176  207 
end; 
208 

49210  209 
val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0; 
210 
val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0; 

211 

49212  212 
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); 
213 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); 

49204  214 

49256  215 
val ((iter_only as (gss, _, _), rec_only as (hss, _, _)), 
49275  216 
(zs, cs, cpss, coiter_only as ((pgss, _, cgssss), _), 
217 
corec_only as ((phss, _, chssss), _))) = 

49208  218 
if lfp then 
219 
let 

220 
val y_Tsss = 

49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

221 
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) 
49212  222 
ns mss fp_iter_fun_Ts; 
49208  223 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
224 

225 
val ((gss, ysss), _) = 

226 
lthy 

227 
> mk_Freess "f" g_Tss 

228 
>> mk_Freesss "x" y_Tsss; 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

229 
val yssss = map (map (map single)) ysss; 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

230 

ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

231 
fun dest_rec_prodT (T as Type (@{type_name prod}, Us as [_, U])) = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

232 
if member (op =) Cs U then Us else [T] 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

233 
 dest_rec_prodT T = [T]; 
49204  234 

49208  235 
val z_Tssss = 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

236 
map3 (fn n => fn ms => map2 (map dest_rec_prodT oo dest_tupleT) ms o 
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

237 
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; 
49208  238 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  239 

49208  240 
val hss = map2 (map2 retype_free) gss h_Tss; 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

241 
val zssss_hd = map2 (map2 (map2 (fn y => fn T :: _ => retype_free y T))) ysss z_Tssss; 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

242 
val (zssss_tl, _) = 
49208  243 
lthy 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

244 
> mk_Freessss "y" (map (map (map tl)) z_Tssss); 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

245 
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; 
49210  246 
in 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

247 
(((gss, g_Tss, yssss), (hss, h_Tss, zssss)), 
49275  248 
([], [], [], (([], [], []), ([], [])), (([], [], []), ([], [])))) 
49210  249 
end 
49208  250 
else 
49210  251 
let 
49221
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

252 
(*avoid "'a itself" arguments in coiterators and corecursors*) 
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

253 
val mss' = map (fn [0] => [1]  ms => ms) mss; 
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

254 

49275  255 
val p_Tss = map2 (fn n => replicate (Int.max (0, n  1)) o mk_predT) ns Cs; 
256 

257 
fun zip_getterss qss fss = maps (op @) (qss ~~ fss); 

49211  258 

49275  259 
fun zip_preds_gettersss [] [qss] [fss] = zip_getterss qss fss 
260 
 zip_preds_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = 

261 
p :: zip_getterss qss fss @ zip_preds_gettersss ps qsss fsss; 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

262 

ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

263 
fun mk_types maybe_dest_sumT fun_Ts = 
49212  264 
let 
265 
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

266 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49275  267 
val f_Tssss = 
268 
map3 (fn C => map2 (map (map (curry (op >) C) o maybe_dest_sumT) oo dest_tupleT)) 

269 
Cs mss' f_prod_Tss; 

270 
val q_Tssss = 

271 
map (map (map (fn [_] => []  [_, C] => [mk_predT (domain_type C)]))) f_Tssss; 

272 
val pf_Tss = map3 zip_preds_gettersss p_Tss q_Tssss f_Tssss; 

273 
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; 

49176  274 

49275  275 
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts; 
49211  276 

49275  277 
val ((((Free (z, _), cs), pss), gssss), _) = 
49210  278 
lthy 
49233  279 
> yield_singleton (mk_Frees "z") dummyT 
280 
>> mk_Frees "a" Cs 

49211  281 
>> mk_Freess "p" p_Tss 
49275  282 
>> mk_Freessss "g" g_Tssss; 
283 
val rssss = map (map (map (fn [] => []))) r_Tssss; 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

284 

ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

285 
fun dest_corec_sumT (T as Type (@{type_name sum}, Us as [_, U])) = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

286 
if member (op =) Cs U then Us else [T] 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

287 
 dest_corec_sumT T = [T]; 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

288 

49275  289 
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; 
49210  290 

49275  291 
val hssss_hd = map2 (map2 (map2 (fn [g] => fn T :: _ => retype_free g T))) gssss h_Tssss; 
292 
val ((sssss, hssss_tl), _) = 

293 
lthy 

294 
> mk_Freessss "q" s_Tssss 

295 
>> mk_Freessss "h" (map (map (map tl)) h_Tssss); 

296 
val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl; 

49211  297 

49212  298 
val cpss = map2 (fn c => map (fn p => p $ c)) cs pss; 
299 

49275  300 
fun mk_terms qssss fssss = 
49212  301 
let 
49275  302 
val pfss = map3 zip_preds_gettersss pss qssss fssss; 
303 
val cqssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs qssss; 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

304 
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; 
49275  305 
in (pfss, cqssss, cfssss) end; 
49210  306 
in 
49212  307 
((([], [], []), ([], [], [])), 
49275  308 
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), 
309 
(mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss)))) 

49210  310 
end; 
311 

49212  312 
fun pour_some_sugar_on_type (((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec), 
313 
fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss), 

314 
disc_binders), sel_binderss) no_defs_lthy = 

49176  315 
let 
49201  316 
val unfT = domain_type (fastype_of fld); 
49210  317 
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

318 
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

319 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  320 

49176  321 
val ((((u, v), fs), xss), _) = 
49204  322 
no_defs_lthy 
49201  323 
> yield_singleton (mk_Frees "u") unfT 
324 
>> yield_singleton (mk_Frees "v") fpT 

49176  325 
>> mk_Frees "f" case_Ts 
49124  326 
>> mk_Freess "x" ctr_Tss; 
49121  327 

49129  328 
val ctr_rhss = 
49256  329 
map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $ 
330 
mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss; 

49121  331 

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

332 
val case_binder = Binding.suffix_name ("_" ^ caseN) b; 
49129  333 

49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

334 
val case_rhs = 
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

335 
fold_rev Term.lambda (fs @ [v]) 
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

336 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v)); 
49129  337 

49201  338 
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy 
49169  339 
> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => 
340 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 

49201  341 
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  342 
> `Local_Theory.restore; 
343 

344 
(*transforms defined frees into consts (and more)*) 

345 
val phi = Proof_Context.export_morphism lthy lthy'; 

346 

347 
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

348 
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

349 

49203  350 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
351 
val casex0 = Morphism.term phi raw_case; 

352 

353 
val ctrs = map (mk_ctr As) ctrs0; 

49121  354 

49135  355 
fun exhaust_tac {context = ctxt, ...} = 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

356 
let 
49135  357 
val fld_iff_unf_thm = 
358 
let 

359 
val goal = 

360 
fold_rev Logic.all [u, v] 

361 
(mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u))); 

362 
in 

363 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 

49201  364 
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT]) 
49176  365 
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) 
49135  366 
> Thm.close_derivation 
367 
> Morphism.thm phi 

368 
end; 

369 

370 
val sumEN_thm' = 

371 
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

372 
(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

373 
(mk_sumEN_balanced n)) 
49135  374 
> Morphism.thm phi; 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

375 
in 
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac"  arose with uncurried constructors
blanchet
parents:
49157
diff
changeset

376 
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

377 
end; 
49121  378 

49126  379 
val inject_tacss = 
49205  380 
map2 (fn 0 => K []  _ => fn ctr_def => [fn {context = ctxt, ...} => 
381 
mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs; 

49126  382 

49127  383 
val half_distinct_tacss = 
384 
map (map (fn (def, def') => fn {context = ctxt, ...} => 

385 
mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs); 

386 

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

387 
val case_tacs = 
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

388 
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

389 
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; 
49121  390 

391 
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

392 

49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

393 
fun some_lfp_sugar ((selss0, discIs, sel_thmss), no_defs_lthy) = 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

394 
let 
49208  395 
val fpT_to_C = fpT > C; 
49199  396 

49215  397 
fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) = 
398 
let 

399 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 

400 

401 
val binder = Binding.suffix_name ("_" ^ suf) b; 

49199  402 

49215  403 
val spec = 
404 
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)), 

405 
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

406 
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); 
49215  407 
in (binder, spec) end; 
49199  408 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

409 
val iter_like_bundles = 
49215  410 
[(iterN, fp_iter, iter_only), 
411 
(recN, fp_rec, rec_only)]; 

412 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

413 
val (binders, specs) = map generate_iter_like iter_like_bundles > split_list; 
49215  414 

415 
val ((csts, defs), (lthy', lthy)) = no_defs_lthy 

49201  416 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  417 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49215  418 
#>> apsnd snd) binders specs 
49199  419 
> `Local_Theory.restore; 
49201  420 

421 
(*transforms defined frees into consts (and more)*) 

422 
val phi = Proof_Context.export_morphism lthy lthy'; 

423 

49215  424 
val [iter_def, rec_def] = map (Morphism.thm phi) defs; 
49201  425 

49215  426 
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

427 
in 
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

428 
((ctrs, selss0, iter, recx, v, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def), 
49266  429 
lthy) 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

430 
end; 
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

431 

49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

432 
fun some_gfp_sugar ((selss0, discIs, sel_thmss), no_defs_lthy) = 
49210  433 
let 
434 
val B_to_fpT = C > fpT; 

49211  435 

49275  436 
fun mk_getters_join [] [cf] = cf 
437 
 mk_getters_join [cq] [cf, cf'] = 

438 
mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf'); 

439 

440 
fun mk_preds_gettersss_join c n cps sum_prod_T cqsss cfsss = 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

441 
Term.lambda c (mk_IfN sum_prod_T cps 
49275  442 
(map2 (mk_InN_balanced sum_prod_T n) 
443 
(map2 (HOLogic.mk_tuple oo map2 mk_getters_join) cqsss cfsss) (1 upto n))); 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

444 

49275  445 
fun generate_coiter_like (suf, fp_iter_like, ((pfss, cqssss, cfssss), (f_sum_prod_Ts, 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

446 
pf_Tss))) = 
49211  447 
let 
448 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

49210  449 

49211  450 
val binder = Binding.suffix_name ("_" ^ suf) b; 
49210  451 

49211  452 
val spec = 
49212  453 
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)), 
49211  454 
Term.list_comb (fp_iter_like, 
49275  455 
map6 mk_preds_gettersss_join cs ns cpss f_sum_prod_Ts cqssss cfssss)); 
49211  456 
in (binder, spec) end; 
49210  457 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

458 
val coiter_like_bundles = 
49215  459 
[(coiterN, fp_iter, coiter_only), 
460 
(corecN, fp_rec, corec_only)]; 

49212  461 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

462 
val (binders, specs) = map generate_coiter_like coiter_like_bundles > split_list; 
49211  463 

464 
val ((csts, defs), (lthy', lthy)) = no_defs_lthy 

49210  465 
> apfst split_list o fold_map2 (fn b => fn spec => 
466 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 

49211  467 
#>> apsnd snd) binders specs 
49210  468 
> `Local_Theory.restore; 
469 

470 
(*transforms defined frees into consts (and more)*) 

471 
val phi = Proof_Context.export_morphism lthy lthy'; 

472 

49211  473 
val [coiter_def, corec_def] = map (Morphism.thm phi) defs; 
49210  474 

49211  475 
val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts; 
49210  476 
in 
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

477 
((ctrs, selss0, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def, 
49266  478 
corec_def), lthy) 
49210  479 
end; 
49119  480 
in 
49203  481 
wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy' 
49210  482 
> (if lfp then some_lfp_sugar else some_gfp_sugar) 
49119  483 
end; 
49167  484 

49226  485 
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

486 
val map_ids = map map_id_of_bnf nested_bnfs; 
49226  487 

49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

488 
fun mk_map Ts Us t = 
49217  489 
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

490 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

491 
end; 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

492 

49234  493 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
494 
let 

49236  495 
val map0 = map_of_bnf (the (bnf_of lthy s)); 
49234  496 
val mapx = mk_map Ts Us map0; 
497 
val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx))))); 

498 
val args = map build_arg TUs; 

499 
in Term.list_comb (mapx, args) end; 

500 

49266  501 
fun pour_more_sugar_on_lfps ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _, iter_defs, 
502 
rec_defs), lthy) = 

49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

503 
let 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

504 
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; 
49212  505 
val giters = map (lists_bmoc gss) iters; 
506 
val hrecs = map (lists_bmoc hss) recs; 

49201  507 

49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

508 
val (iter_thmss, rec_thmss) = 
49207  509 
let 
49212  510 
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = 
49207  511 
fold_rev (fold_rev Logic.all) (xs :: fss) 
49212  512 
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); 
49204  513 

49234  514 
fun build_call fiter_likes maybe_tick (T, U) = 
515 
if T = U then 

516 
mk_id T 

517 
else 

518 
(case find_index (curry (op =) T) fpTs of 

519 
~1 => build_map (build_call fiter_likes maybe_tick) T U 

520 
 j => maybe_tick (nth vs j) (nth fiter_likes j)); 

49233  521 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

522 
fun mk_U maybe_mk_prodT = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

523 
typ_subst (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs); 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

524 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

525 
fun repair_calls fiter_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) = 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

526 
if member (op =) fpTs T then 
49233  527 
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

528 
else if exists_subtype (member (op =) fpTs) T then 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

529 
[build_call fiter_likes maybe_tick (T, mk_U maybe_mk_prodT T) $ x] 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

530 
else 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

531 
[x]; 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

532 

2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

533 
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

534 
val hxsss = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

535 
map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 
49204  536 

49212  537 
val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss; 
538 
val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss; 

49204  539 

49203  540 
val iter_tacss = 
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset

541 
map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss; 
49203  542 
val rec_tacss = 
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset

543 
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

544 
in 
49266  545 
(map2 (map2 (fn goal => fn tac => 
546 
Skip_Proof.prove lthy [] [] goal (tac o #context) > Thm.close_derivation)) 

49205  547 
goal_iterss iter_tacss, 
49266  548 
map2 (map2 (fn goal => fn tac => 
549 
Skip_Proof.prove lthy [] [] goal (tac o #context) > Thm.close_derivation)) 

49205  550 
goal_recss rec_tacss) 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

551 
end; 
49201  552 

49226  553 
val notes = 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

554 
[(itersN, iter_thmss), 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

555 
(recsN, rec_thmss)] 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

556 
> maps (fn (thmN, thmss) => 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

557 
map2 (fn b => fn thms => 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

558 
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])])) 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

559 
bs thmss); 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

560 
in 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

561 
lthy > Local_Theory.notes notes > snd 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

562 
end; 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

563 

49266  564 
fun pour_more_sugar_on_gfps ((ctrss, selsss, coiters, corecs, vs, _, ctr_defss, discIss, 
565 
sel_thmsss, coiter_defs, corec_defs), lthy) = 

49212  566 
let 
49233  567 
val z = the_single zs; 
568 

49212  569 
val gcoiters = map (lists_bmoc pgss) coiters; 
570 
val hcorecs = map (lists_bmoc phss) corecs; 

571 

572 
val (coiter_thmss, corec_thmss) = 

573 
let 

49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

574 
fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); 
49212  575 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

576 
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfss' = 
49212  577 
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

578 
(Logic.list_implies (seq_conds mk_goal_cond n k cps, 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

579 
mk_Trueprop_eq (fcoiter_like $ c, lists_bmoc (take m cfss') ctr))); 
49212  580 

49234  581 
fun build_call fiter_likes maybe_tack (T, U) = 
582 
if T = U then 

583 
mk_id T 

584 
else 

585 
(case find_index (curry (op =) U) fpTs of 

586 
~1 => build_map (build_call fiter_likes maybe_tack) T U 

587 
 j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j)); 

49233  588 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

589 
fun mk_U maybe_mk_sumT = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

590 
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); 
49212  591 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

592 
fun repair_calls fiter_likes maybe_mk_sumT maybe_tack 
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

593 
(cf as Free (_, Type (_, [_, T])) $ _) = 
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

594 
if exists_subtype (member (op =) Cs) T then 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

595 
build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cf 
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

596 
else 
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

597 
cf; 
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

598 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

599 
val cgssss' = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

600 
map (map (map (map (repair_calls gcoiters (K I) (K I))))) cgssss; 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

601 
val chssss' = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

602 
map (map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z))))) chssss; 
49212  603 

604 
val goal_coiterss = 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

605 
map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss cgssss'; 
49233  606 
val goal_corecss = 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

607 
map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss chssss'; 
49213  608 

609 
val coiter_tacss = 

49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset

610 
map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs 
49226  611 
ctr_defss; 
49233  612 
val corec_tacss = 
613 
map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs 

614 
ctr_defss; 

49212  615 
in 
49213  616 
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 
617 
goal_coiterss coiter_tacss, 

49233  618 
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 
619 
goal_corecss corec_tacss) 

49212  620 
end; 
621 

49266  622 
fun mk_disc_coiter_like_thms [_] = K [] 
623 
 mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms; 

624 

625 
val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss; 

626 
val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss; 

627 

49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

628 
fun mk_sel_coiter_like_thm coiter_like_thm sel0 sel_thm = 
49266  629 
let 
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

630 
val (domT, ranT) = dest_funT (fastype_of sel0); 
49266  631 
val arg_cong' = 
632 
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) 

49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

633 
[NONE, NONE, SOME (certify lthy sel0)] arg_cong 
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

634 
> Thm.varifyT_global; 
49266  635 
val sel_thm' = sel_thm RSN (2, trans); 
636 
in 

49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

637 
coiter_like_thm RS arg_cong' RS sel_thm' 
49266  638 
end; 
639 

640 
val sel_coiter_thmsss = 

641 
map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss; 

642 
val sel_corec_thmsss = 

49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

643 
map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss; 
49266  644 

49212  645 
val notes = 
49233  646 
[(coitersN, coiter_thmss), 
49266  647 
(disc_coitersN, disc_coiter_thmss), 
648 
(sel_coitersN, map flat sel_coiter_thmsss), 

649 
(corecsN, corec_thmss), 

650 
(disc_corecsN, disc_corec_thmss), 

651 
(sel_corecsN, map flat sel_corec_thmsss)] 

49212  652 
> maps (fn (thmN, thmss) => 
49266  653 
map_filter (fn (_, []) => NONE  (b, thms) => 
654 
SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), 

655 
[(thms, [])])) (bs ~~ thmss)); 

49212  656 
in 
49230  657 
lthy > Local_Theory.notes notes > snd 
49212  658 
end; 
659 

49204  660 
val lthy' = lthy 
49210  661 
> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ 
49212  662 
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~ 
663 
ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss) 

49266  664 
>> split_list11 
49212  665 
> (if lfp then pour_more_sugar_on_lfps else pour_more_sugar_on_gfps); 
49167  666 

667 
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ 

49208  668 
(if lfp then "" else "co") ^ "datatype")); 
49112  669 
in 
49204  670 
(timer; lthy') 
49112  671 
end; 
672 

49199  673 
fun datatype_cmd info specs lthy = 
49121  674 
let 
49209  675 
(* 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

676 
(*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

677 
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

678 
val fake_thy = Theory.copy 
49184
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset

679 
#> fold (fn spec => perhaps (try (Sign.add_type lthy 
83fdea0c4779
gracefully handle shadowing case (fourth step of sugar localization)
blanchet
parents:
49183
diff
changeset

680 
(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

681 
val fake_lthy = Proof_Context.background_theory fake_thy lthy; 
49121  682 
in 
49199  683 
prepare_datatype Syntax.read_typ info specs fake_lthy lthy 
49121  684 
end; 
49119  685 

49129  686 
val parse_opt_binding_colon = Scan.optional (Parse.binding  Parse.$$$ ":") no_binder 
49119  687 

49112  688 
val parse_ctr_arg = 
49119  689 
Parse.$$$ "("  parse_opt_binding_colon  Parse.typ  Parse.$$$ ")"  
49129  690 
(Parse.typ >> pair no_binder); 
49112  691 

692 
val parse_single_spec = 

693 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

49119  694 
(@{keyword "="}  Parse.enum1 "" (parse_opt_binding_colon  Parse.binding  
695 
Scan.repeat parse_ctr_arg  Parse.opt_mixfix)); 

49112  696 

697 
val _ = 

698 
Outer_Syntax.local_theory @{command_spec "data"} "define BNFbased inductive datatypes" 

49208  699 
(Parse.and_list1 parse_single_spec >> datatype_cmd true); 
49112  700 

701 
val _ = 

702 
Outer_Syntax.local_theory @{command_spec "codata"} "define BNFbased coinductive datatypes" 

49208  703 
(Parse.and_list1 parse_single_spec >> datatype_cmd false); 
49112  704 

705 
end; 