author  blanchet 
Sat, 08 Sep 2012 21:04:26 +0200  
changeset 49214  2a3cb4c71b87 
parent 49213  975ccb0130cb 
child 49215  1c5d6e2eb0c6 
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"; 

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 

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

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

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

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

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

37 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  38 

49199  39 
fun retype_free (Free (s, _)) T = Free (s, T); 
40 

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

42 

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

45 
fun mk_uncurried2_fun f xss = 
49200  46 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); 
47 

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

48 
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v)) 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

49 

49212  50 
fun popescu_zip [] [fs] = fs 
51 
 popescu_zip (p :: ps) (fs :: fss) = p :: fs @ popescu_zip ps fss; 

52 

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

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

56 
if T = T' then 

57 
(case (c, c') of 

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

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

60 
 _ => 

61 
if c = c' then 

62 
(T, c) 

63 
else 

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

65 
quote (Syntax.string_of_typ ctxt T))) 

66 
else 

67 
cannot_merge_types (); 

68 

69 
fun merge_type_args_constrained ctxt (cAs, cAs') = 

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

71 
else cannot_merge_types (); 

72 

49121  73 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
74 
val type_args_of = map fst o type_args_constrained_of; 

49129  75 
fun type_binder_of (((_, b), _), _) = b; 
49181  76 
fun mixfix_of ((_, mx), _) = mx; 
49121  77 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  78 

49121  79 
fun disc_of (((disc, _), _), _) = disc; 
80 
fun ctr_of (((_, ctr), _), _) = ctr; 

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

49181  82 
fun ctr_mixfix_of (_, mx) = mx; 
49119  83 

49208  84 
fun prepare_datatype prepare_typ lfp specs fake_lthy no_defs_lthy = 
49112  85 
let 
49121  86 
val constrained_As = 
87 
map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs 

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

90 
val As' = map dest_TFree As; 
49119  91 

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

49119  95 

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

97 

98 
val N = length specs; 

99 

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

100 
fun mk_fake_T b = 
49121  101 
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))), 
102 
As); 

103 

49129  104 
val bs = map type_binder_of specs; 
49204  105 
val fakeTs = map mk_fake_T bs; 
49121  106 

49181  107 
val mixfixes = map mixfix_of specs; 
49119  108 

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

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

111 

49121  112 
val ctr_specss = map ctr_specs_of specs; 
49119  113 

49129  114 
val disc_binderss = map (map disc_of) ctr_specss; 
115 
val ctr_binderss = map (map ctr_of) ctr_specss; 

49121  116 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  117 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  118 

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

120 
val fake_ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49121  121 

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

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

49204  126 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  127 

49176  128 
val ((Cs, Xs), _) = 
49204  129 
no_defs_lthy 
49121  130 
> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs 
131 
> mk_TFrees N 

49176  132 
>> mk_TFrees N; 
49119  133 

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

49204  137 
 eq_fpT _ _ = false; 
49146  138 

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

141 
 freeze_fp T = T; 

49121  142 

49204  143 
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss; 
49176  144 
val sum_prod_TsXs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssXs; 
49119  145 

49176  146 
val eqs = map dest_TFree Xs ~~ sum_prod_TsXs; 
49121  147 

49207  148 
val (pre_map_defs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects, 
149 
fp_iter_thms, fp_rec_thms), lthy)) = 

49208  150 
fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes As' eqs no_defs_lthy; 
49121  151 

49167  152 
val timer = time (Timer.startRealTimer ()); 
153 

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

49124  156 
Term.subst_atomic_types (Ts0 ~~ Ts) t 
49121  157 
end; 
49119  158 

49126  159 
val mk_unf = mk_unf_or_fld domain_type; 
160 
val mk_fld = mk_unf_or_fld range_type; 

49121  161 

49203  162 
val unfs = map (mk_unf As) unfs0; 
163 
val flds = map (mk_fld As) flds0; 

49124  164 

49201  165 
val fpTs = map (domain_type o fastype_of) unfs; 
49204  166 

49201  167 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  168 
val ns = map length ctr_Tsss; 
49212  169 
val kss = map (fn n => 1 upto n) ns; 
49203  170 
val mss = map (map length) ctr_Tsss; 
171 
val Css = map2 replicate ns Cs; 

172 

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

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

175 
val (binders, body) = strip_type (fastype_of t); 
49210  176 
val (f_Us, prebody) = split_last binders; 
177 
val Type (_, Ts0) = if lfp then prebody else body; 

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

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

180 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 
49176  181 
end; 
182 

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

185 

49212  186 
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); 
187 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); 

49204  188 

189 
fun dest_rec_pair (T as Type (@{type_name prod}, Us as [_, U])) = 

190 
if member (op =) Cs U then Us else [T] 

191 
 dest_rec_pair T = [T]; 

192 

49212  193 
val (((gss, g_Tss, ysss), (hss, h_Tss, zssss)), 
194 
(cs, cpss, p_Tss, coiter_extra as ((pgss, cgsss), g_sum_prod_Ts, g_prod_Tss, g_Tsss), 

195 
corec_extra as ((phss, chsss), h_sum_prod_Ts, h_prod_Tss, h_Tsss))) = 

49208  196 
if lfp then 
197 
let 

198 
val y_Tsss = 

49210  199 
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN n o domain_type) 
49212  200 
ns mss fp_iter_fun_Ts; 
49208  201 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
202 

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

204 
lthy 

205 
> mk_Freess "f" g_Tss 

206 
>> mk_Freesss "x" y_Tsss; 

49204  207 

49208  208 
val z_Tssss = 
49210  209 
map3 (fn n => fn ms => map2 (map dest_rec_pair oo dest_tupleT) ms o dest_sumTN n 
49212  210 
o domain_type) ns mss fp_rec_fun_Ts; 
49208  211 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  212 

49208  213 
val hss = map2 (map2 retype_free) gss h_Tss; 
214 
val (zssss, _) = 

215 
lthy 

216 
> mk_Freessss "x" z_Tssss; 

49210  217 
in 
49212  218 
(((gss, g_Tss, ysss), (hss, h_Tss, zssss)), 
219 
([], [], [], (([], []), [], [], []), (([], []), [], [], []))) 

49210  220 
end 
49208  221 
else 
49210  222 
let 
49211  223 
val p_Tss = 
49210  224 
map2 (fn C => fn n => replicate (Int.max (0, n  1)) (C > HOLogic.boolT)) Cs ns; 
49211  225 

49212  226 
fun mk_types fun_Ts = 
227 
let 

228 
val f_sum_prod_Ts = map range_type fun_Ts; 

229 
val f_prod_Tss = map2 dest_sumTN ns f_sum_prod_Ts; 

230 
val f_Tsss = 

231 
map3 (fn C => map2 (map (curry (op >) C) oo dest_tupleT)) Cs mss f_prod_Tss; 

232 
val pf_Tss = map2 popescu_zip p_Tss f_Tsss 

233 
in (f_sum_prod_Ts, f_prod_Tss, f_Tsss, pf_Tss) end; 

49176  234 

49212  235 
val (g_sum_prod_Ts, g_prod_Tss, g_Tsss, pg_Tss) = mk_types fp_iter_fun_Ts; 
236 
val (h_sum_prod_Ts, h_prod_Tss, h_Tsss, ph_Tss) = mk_types fp_rec_fun_Ts; 

49211  237 

238 
val (((c, pss), gsss), _) = 

49210  239 
lthy 
240 
> yield_singleton (mk_Frees "c") dummyT 

49211  241 
>> mk_Freess "p" p_Tss 
49210  242 
>> mk_Freesss "g" g_Tsss; 
243 

49211  244 
val hsss = map2 (map2 (map2 retype_free)) gsss h_Tsss; 
245 

49210  246 
val cs = map (retype_free c) Cs; 
49212  247 
val cpss = map2 (fn c => map (fn p => p $ c)) cs pss; 
248 

249 
fun mk_terms fsss = 

250 
let 

251 
val pfss = map2 popescu_zip pss fsss; 

252 
val cfsss = map2 (fn c => map (map (fn f => f $ c))) cs fsss 

253 
in (pfss, cfsss) end; 

49210  254 
in 
49212  255 
((([], [], []), ([], [], [])), 
256 
(cs, cpss, p_Tss, (mk_terms gsss, g_sum_prod_Ts, g_prod_Tss, pg_Tss), 

257 
(mk_terms hsss, h_sum_prod_Ts, h_prod_Tss, ph_Tss))) 

49210  258 
end; 
259 

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

262 
disc_binders), sel_binderss) no_defs_lthy = 

49176  263 
let 
49201  264 
val unfT = domain_type (fastype_of fld); 
49210  265 
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

266 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  267 

49176  268 
val ((((u, v), fs), xss), _) = 
49204  269 
no_defs_lthy 
49201  270 
> yield_singleton (mk_Frees "u") unfT 
271 
>> yield_singleton (mk_Frees "v") fpT 

49176  272 
>> mk_Frees "f" case_Ts 
49124  273 
>> mk_Freess "x" ctr_Tss; 
49121  274 

49129  275 
val ctr_rhss = 
49121  276 
map2 (fn k => fn xs => 
49210  277 
fold_rev Term.lambda xs (fld $ mk_InN ctr_prod_Ts (HOLogic.mk_tuple xs) k)) ks xss; 
49121  278 

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

279 
val case_binder = Binding.suffix_name ("_" ^ caseN) b; 
49129  280 

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

281 
val case_rhs = 
49176  282 
fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (map2 mk_uncurried_fun fs xss) $ (unf $ v)); 
49129  283 

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

49201  287 
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  288 
> `Local_Theory.restore; 
289 

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

291 
val phi = Proof_Context.export_morphism lthy lthy'; 

292 

293 
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

294 
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

295 

49203  296 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
297 
val casex0 = Morphism.term phi raw_case; 

298 

299 
val ctrs = map (mk_ctr As) ctrs0; 

49121  300 

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

302 
let 
49135  303 
val fld_iff_unf_thm = 
304 
let 

305 
val goal = 

306 
fold_rev Logic.all [u, v] 

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

308 
in 

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

49201  310 
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT]) 
49176  311 
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) 
49135  312 
> Thm.close_derivation 
313 
> Morphism.thm phi 

314 
end; 

315 

316 
val sumEN_thm' = 

317 
Local_Defs.unfold lthy @{thms all_unit_eq} 

49210  318 
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] (mk_sumEN n)) 
49135  319 
> Morphism.thm phi; 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

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

321 
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

322 
end; 
49121  323 

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

49126  327 

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

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

331 

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

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

333 
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

334 
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; 
49121  335 

336 
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

337 

49210  338 
fun some_lfp_sugar no_defs_lthy = 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

339 
let 
49208  340 
val fpT_to_C = fpT > C; 
341 
val iter_T = fold_rev (curry (op >)) g_Tss fpT_to_C; 

342 
val rec_T = fold_rev (curry (op >)) h_Tss fpT_to_C; 

49199  343 

344 
val iter_binder = Binding.suffix_name ("_" ^ iterN) b; 

345 
val rec_binder = Binding.suffix_name ("_" ^ recN) b; 

346 

347 
val iter_spec = 

49212  348 
mk_Trueprop_eq (lists_bmoc gss (Free (Binding.name_of iter_binder, iter_T)), 
49199  349 
Term.list_comb (fp_iter, map2 (mk_sum_caseN oo map2 mk_uncurried_fun) gss ysss)); 
350 
val rec_spec = 

49212  351 
mk_Trueprop_eq (lists_bmoc hss (Free (Binding.name_of rec_binder, rec_T)), 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

352 
Term.list_comb (fp_rec, map2 (mk_sum_caseN oo map2 mk_uncurried2_fun) hss zssss)); 
49199  353 

354 
val (([raw_iter, raw_rec], [raw_iter_def, raw_rec_def]), (lthy', lthy)) = no_defs_lthy 

49201  355 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  356 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49201  357 
#>> apsnd snd) [iter_binder, rec_binder] [iter_spec, rec_spec] 
49199  358 
> `Local_Theory.restore; 
49201  359 

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

361 
val phi = Proof_Context.export_morphism lthy lthy'; 

362 

363 
val iter_def = Morphism.thm phi raw_iter_def; 

364 
val rec_def = Morphism.thm phi raw_rec_def; 

365 

49203  366 
val iter0 = Morphism.term phi raw_iter; 
367 
val rec0 = Morphism.term phi raw_rec; 

368 

49210  369 
val iter = mk_iter_like As Cs iter0; 
370 
val recx = mk_iter_like As Cs rec0; 

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

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

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

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

374 

49210  375 
fun some_gfp_sugar no_defs_lthy = 
376 
let 

377 
val B_to_fpT = C > fpT; 

49211  378 

49212  379 
fun generate_coiter_like (suf, fp_iter_like, ((pfss, cfsss), f_sum_prod_Ts, f_prod_Tss, 
380 
pf_Tss)) = 

49211  381 
let 
382 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

49210  383 

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

49211  386 
fun mk_join c n cps sum_prod_T prod_Ts cfss = 
387 
Term.lambda c (mk_IfN sum_prod_T cps 

388 
(map2 (mk_InN prod_Ts) (map HOLogic.mk_tuple cfss) (1 upto n))); 

49210  389 

49211  390 
val spec = 
49212  391 
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)), 
49211  392 
Term.list_comb (fp_iter_like, 
393 
map6 mk_join cs ns cpss f_sum_prod_Ts f_prod_Tss cfsss)); 

394 
in (binder, spec) end; 

49210  395 

49212  396 
val coiter_likes = 
397 
[(coiterN, fp_iter, coiter_extra), 

398 
(corecN, fp_rec, corec_extra)]; 

399 

49211  400 
val (binders, specs) = map generate_coiter_like coiter_likes > split_list; 
401 

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

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

49211  405 
#>> apsnd snd) binders specs 
49210  406 
> `Local_Theory.restore; 
407 

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

409 
val phi = Proof_Context.export_morphism lthy lthy'; 

410 

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

49211  413 
val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts; 
49210  414 
in 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

415 
((ctrs, coiter, corec, v, xss, ctr_defs, coiter_def, corec_def), lthy) 
49210  416 
end; 
49119  417 
in 
49203  418 
wrap_datatype tacss ((ctrs0, casex0), (disc_binders, sel_binderss)) lthy' 
49210  419 
> (if lfp then some_lfp_sugar else some_gfp_sugar) 
49119  420 
end; 
49167  421 

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

422 
fun mk_map Ts Us t = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

423 
let val (Type (_, Ts0), Type (_, Us0)) = strip_type (fastype_of t) >> List.last in 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

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

426 

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

427 
fun pour_more_sugar_on_lfps ((ctrss, iters, recs, vs, xsss, ctr_defss, iter_defs, rec_defs), 
49205  428 
lthy) = 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

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

430 
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; 
49212  431 
val giters = map (lists_bmoc gss) iters; 
432 
val hrecs = map (lists_bmoc hss) recs; 

49201  433 

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

434 
val (iter_thmss, rec_thmss) = 
49207  435 
let 
49212  436 
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = 
49207  437 
fold_rev (fold_rev Logic.all) (xs :: fss) 
49212  438 
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); 
49204  439 

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

440 
fun build_iter_like fiter_likes maybe_tick = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

442 
fun build (T, U) = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

443 
if T = U then 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

444 
Const (@{const_name id}, T > T) 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

446 
(case (find_index (curry (op =) T) fpTs, (T, U)) of 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

447 
(~1, (Type (s, Ts), Type (_, Us))) => 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

449 
val map0 = map_of_bnf (the (bnf_of lthy (Long_Name.base_name s))); 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

450 
val mapx = mk_map Ts Us map0; 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

451 
val TUs = map dest_funT (fst (split_last (binder_types (fastype_of mapx)))); 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

452 
val args = map build TUs; 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

453 
in Term.list_comb (mapx, args) end 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

454 
 (j, _) => maybe_tick (nth vs j) (nth fiter_likes j)) 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

456 

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

457 
fun mk_U maybe_prodT = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

458 
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

459 

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

460 
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

461 
if member (op =) fpTs T then 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

462 
maybe_cons x [build_iter_like fiter_likes (K I) (T, mk_U (K I) T) $ x] 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

463 
else if exists_subtype (member (op =) fpTs) T then 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

464 
[build_iter_like fiter_likes maybe_tick (T, mk_U maybe_prodT T) $ x] 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

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

467 

49212  468 
fun repair_rec_call (x as Free (_, T)) = 
469 
(case find_index (curry (op =) T) fpTs of ~1 => [x]  j => [x, nth hrecs j $ x]); 

49201  470 

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

471 
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

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

473 
map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 
49204  474 

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

49204  477 

49203  478 
val iter_tacss = 
49211  479 
map2 (map o mk_iter_like_tac pre_map_defs iter_defs) fp_iter_thms ctr_defss; 
49203  480 
val rec_tacss = 
49211  481 
map2 (map o mk_iter_like_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

482 
in 
49205  483 
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 
484 
goal_iterss iter_tacss, 

485 
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 

486 
goal_recss rec_tacss) 

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

487 
end; 
49201  488 

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

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

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

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

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

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

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

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

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

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

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

499 

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

500 
fun pour_more_sugar_on_gfps ((ctrss, coiters, corecs, vs, xsss, ctr_defss, coiter_defs, 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

501 
corec_defs), lthy) = 
49212  502 
let 
503 
val gcoiters = map (lists_bmoc pgss) coiters; 

504 
val hcorecs = map (lists_bmoc phss) corecs; 

505 

506 
val (coiter_thmss, corec_thmss) = 

507 
let 

508 
fun mk_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); 

509 

510 
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr cfs' = 

511 
fold_rev (fold_rev Logic.all) ([c] :: pfss) 

512 
(Logic.list_implies (seq_conds mk_cond n k cps, 

513 
mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, cfs')))); 

514 

515 
fun repair_coiter_like_call fcoiter_likes (cf as Free (_, Type (_, [_, T])) $ _) = 

516 
(case find_index (curry (op =) T) Cs of ~1 => cf  j => nth fcoiter_likes j $ cf); 

517 

518 
val cgsss = map (map (map (repair_coiter_like_call gcoiters))) cgsss; 

519 
val chsss = map (map (map (repair_coiter_like_call hcorecs))) chsss; 

520 

521 
val goal_coiterss = 

522 
map7 (map3 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss cgsss; 

523 
val goal_corecss = 

524 
map7 (map3 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss chsss; 

49213  525 

526 
val coiter_tacss = 

527 
map3 (map oo mk_coiter_like_tac coiter_defs) fp_iter_thms pre_map_defs ctr_defss; 

49212  528 
in 
49213  529 
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 
530 
goal_coiterss coiter_tacss, 

531 
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 

532 
goal_coiterss coiter_tacss (* TODO: should be corecs *)) 

49212  533 
end; 
534 

535 
val notes = 

536 
[(coitersN, coiter_thmss), 

537 
(corecsN, corec_thmss)] 

538 
> maps (fn (thmN, thmss) => 

539 
map2 (fn b => fn thms => 

540 
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), []), [(thms, [])])) 

541 
bs thmss); 

542 
in 

543 
lthy > Local_Theory.notes notes > snd 

544 
end; 

545 

49204  546 
val lthy' = lthy 
49210  547 
> fold_map pour_some_sugar_on_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ 
49212  548 
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~ 
549 
ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss) 

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

550 
>> split_list8 
49212  551 
> (if lfp then pour_more_sugar_on_lfps else pour_more_sugar_on_gfps); 
49167  552 

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

49208  554 
(if lfp then "" else "co") ^ "datatype")); 
49112  555 
in 
49204  556 
(timer; lthy') 
49112  557 
end; 
558 

49199  559 
fun datatype_cmd info specs lthy = 
49121  560 
let 
49209  561 
(* 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

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

563 
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

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

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

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

567 
val fake_lthy = Proof_Context.background_theory fake_thy lthy; 
49121  568 
in 
49199  569 
prepare_datatype Syntax.read_typ info specs fake_lthy lthy 
49121  570 
end; 
49119  571 

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

49112  574 
val parse_ctr_arg = 
49119  575 
Parse.$$$ "("  parse_opt_binding_colon  Parse.typ  Parse.$$$ ")"  
49129  576 
(Parse.typ >> pair no_binder); 
49112  577 

578 
val parse_single_spec = 

579 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

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

49112  582 

583 
val _ = 

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

49208  585 
(Parse.and_list1 parse_single_spec >> datatype_cmd true); 
49112  586 

587 
val _ = 

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

49208  589 
(Parse.and_list1 parse_single_spec >> datatype_cmd false); 
49112  590 

591 
end; 