author  blanchet 
Tue, 11 Sep 2012 22:31:43 +0200  
changeset 49298  36e551d3af3b 
parent 49297  47fbf2e3e89c 
child 49300  c707df2e2083 
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 

49297  10 
val datatyp: bool > 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

11 
bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) * 
49297  12 
(binding * typ) list) * (binding * term) list) * mixfix) list) list > 
13 
local_theory > local_theory 

49112  14 
end; 
15 

16 
structure BNF_FP_Sugar : BNF_FP_SUGAR = 

17 
struct 

18 

49119  19 
open BNF_Util 
20 
open BNF_Wrap 

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

21 
open BNF_Def 
49119  22 
open BNF_FP_Util 
23 
open BNF_LFP 

24 
open BNF_GFP 

49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

25 
open BNF_FP_Sugar_Tactics 
49119  26 

49129  27 
val caseN = "case"; 
49213  28 
val coitersN = "coiters"; 
29 
val corecsN = "corecs"; 

49266  30 
val disc_coitersN = "disc_coiters"; 
31 
val disc_corecsN = "disc_corecs"; 

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

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

33 
val recsN = "recs"; 
49266  34 
val sel_coitersN = "sel_coiters"; 
35 
val sel_corecsN = "sel_corecs"; 

49129  36 

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

39 
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

40 

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

43 

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

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

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

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

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

48 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  49 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

50 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

51 

36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

52 
fun retype_free T (Free (s, _)) = Free (s, T); 
49199  53 

49297  54 
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

55 

49275  56 
fun mk_predT T = T > HOLogic.boolT; 
57 

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

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

62 
fun mk_uncurried2_fun f xss = 
49200  63 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); 
64 

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

67 
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

68 
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

69 
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

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

71 

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

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

74 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  75 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

76 
fun merge_type_args (As, As') = 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

77 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  78 

49121  79 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
80 
val type_args_of = map fst o type_args_constrained_of; 

49129  81 
fun type_binder_of (((_, b), _), _) = b; 
49181  82 
fun mixfix_of ((_, mx), _) = mx; 
49121  83 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  84 

49286  85 
fun disc_of ((((disc, _), _), _), _) = disc; 
86 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

88 
fun defaults_of ((_, ds), _) = ds; 

49181  89 
fun ctr_mixfix_of (_, mx) = mx; 
49119  90 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

91 
fun define_datatype prepare_constraint prepare_typ prepare_term lfp (no_dests, specs) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

92 
no_defs_lthy0 = 
49112  93 
let 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

94 
(* TODO: sanity checks on arguments *) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

95 

49286  96 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  97 
else (); 
98 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

99 
val N = length specs; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

100 

36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

101 
fun prepare_type_arg (ty, c) = 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

102 
let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

103 
TFree (s, prepare_constraint no_defs_lthy0 c) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

104 
end; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

105 

36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

106 
val Ass0 = map (map prepare_type_arg o type_args_constrained_of) specs; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

107 
val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

108 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
49119  109 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

110 
val ((Bs, Cs), no_defs_lthy) = 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

111 
no_defs_lthy0 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

112 
> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

113 
> mk_TFrees N 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

114 
>> mk_TFrees N; 
49119  115 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

116 
(* TODO: cleaner handling of fake contexts, without "background_theory" *) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

117 
(*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

118 
locale and shadows an existing global type*) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

119 
val fake_thy = 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

120 
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

121 
(type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

122 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  123 

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

124 
fun mk_fake_T b = 
49121  125 
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))), 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

126 
unsorted_As); 
49121  127 

49129  128 
val bs = map type_binder_of specs; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

129 
val fake_Ts = map mk_fake_T bs; 
49121  130 

49181  131 
val mixfixes = map mixfix_of specs; 
49119  132 

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

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

135 

49121  136 
val ctr_specss = map ctr_specs_of specs; 
49119  137 

49129  138 
val disc_binderss = map (map disc_of) ctr_specss; 
139 
val ctr_binderss = map (map ctr_of) ctr_specss; 

49121  140 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  141 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  142 

49129  143 
val sel_bindersss = map (map (map fst)) ctr_argsss; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

144 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  145 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
146 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

147 
val (Ass as As :: _) :: fake_ctr_Tsss = 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

148 
burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0); 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

149 

36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

150 
val _ = (case duplicates (op =) unsorted_As of [] => () 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

151 
 A :: _ => error ("Duplicate type parameter " ^ 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

152 
quote (Syntax.string_of_typ no_defs_lthy A))); 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

153 

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

154 
val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss []; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

155 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  156 
[] => () 
157 
 A' :: _ => error ("Extra type variables on rhs: " ^ 

49204  158 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  159 

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

49204  163 
 eq_fpT _ _ = false; 
49146  164 

49204  165 
fun freeze_fp (T as Type (s, Us)) = 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

166 
(case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us)  j => nth Bs j) 
49204  167 
 freeze_fp T = T; 
49121  168 

49297  169 
val ctr_TsssBs = map (map (map freeze_fp)) fake_ctr_Tsss; 
170 
val ctr_sum_prod_TsBs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssBs; 

49119  171 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

172 
val fp_eqs = 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

173 
map dest_TFree Bs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsBs; 
49121  174 

49226  175 
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects, 
49207  176 
fp_iter_thms, fp_rec_thms), lthy)) = 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

177 
fp_bnf (if lfp then bnf_lfp else bnf_gfp) bs mixfixes (map dest_TFree unsorted_As) fp_eqs 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

178 
no_defs_lthy0; 
49121  179 

49226  180 
val add_nested_bnf_names = 
181 
let 

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

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

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

185 
end 

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

187 
in snd oo add end; 

188 

189 
val nested_bnfs = 

49297  190 
map_filter (bnf_of lthy) (fold (fold (fold add_nested_bnf_names)) ctr_TsssBs []); 
49226  191 

49167  192 
val timer = time (Timer.startRealTimer ()); 
193 

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

49124  196 
Term.subst_atomic_types (Ts0 ~~ Ts) t 
49121  197 
end; 
49119  198 

49126  199 
val mk_unf = mk_unf_or_fld domain_type; 
200 
val mk_fld = mk_unf_or_fld range_type; 

49121  201 

49203  202 
val unfs = map (mk_unf As) unfs0; 
203 
val flds = map (mk_fld As) flds0; 

49124  204 

49201  205 
val fpTs = map (domain_type o fastype_of) unfs; 
49204  206 

49297  207 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Bs ~~ fpTs)))) ctr_TsssBs; 
49203  208 
val ns = map length ctr_Tsss; 
49212  209 
val kss = map (fn n => 1 upto n) ns; 
49203  210 
val mss = map (map length) ctr_Tsss; 
211 
val Css = map2 replicate ns Cs; 

212 

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

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

215 
val (binders, body) = strip_type (fastype_of t); 
49210  216 
val (f_Us, prebody) = split_last binders; 
217 
val Type (_, Ts0) = if lfp then prebody else body; 

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

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

220 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 
49176  221 
end; 
222 

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

225 

49212  226 
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); 
227 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); 

49204  228 

49256  229 
val ((iter_only as (gss, _, _), rec_only as (hss, _, _)), 
49276  230 
(zs, cs, cpss, coiter_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))) = 
49208  231 
if lfp then 
232 
let 

233 
val y_Tsss = 

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

234 
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) 
49212  235 
ns mss fp_iter_fun_Ts; 
49208  236 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
237 

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

239 
lthy 

240 
> mk_Freess "f" g_Tss 

241 
>> mk_Freesss "x" y_Tsss; 

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

242 
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

243 

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

244 
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

245 
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

246 
 dest_rec_prodT T = [T]; 
49204  247 

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

249 
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

250 
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; 
49208  251 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  252 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

253 
val hss = map2 (map2 retype_free) h_Tss gss; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

254 
val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss; 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

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

257 
> 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

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

260 
(((gss, g_Tss, yssss), (hss, h_Tss, zssss)), 
49276  261 
([], [], [], (([], []), ([], [])), (([], []), ([], [])))) 
49210  262 
end 
49208  263 
else 
49210  264 
let 
49221
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

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

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

267 

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

49276  270 
fun zip_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
49211  271 

49276  272 
fun zip_preds_predsss_gettersss [] [qss] [fss] = zip_predss_getterss qss fss 
273 
 zip_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = 

274 
p :: zip_predss_getterss qss fss @ zip_preds_predsss_gettersss ps qsss fsss; 

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

275 

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

276 
fun mk_types maybe_dest_sumT fun_Ts = 
49212  277 
let 
278 
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

279 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49275  280 
val f_Tssss = 
281 
map3 (fn C => map2 (map (map (curry (op >) C) o maybe_dest_sumT) oo dest_tupleT)) 

282 
Cs mss' f_prod_Tss; 

283 
val q_Tssss = 

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

49276  285 
val pf_Tss = map3 zip_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
49275  286 
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; 
49176  287 

49275  288 
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts; 
49211  289 

49275  290 
val ((((Free (z, _), cs), pss), gssss), _) = 
49210  291 
lthy 
49233  292 
> yield_singleton (mk_Frees "z") dummyT 
293 
>> mk_Frees "a" Cs 

49211  294 
>> mk_Freess "p" p_Tss 
49275  295 
>> mk_Freessss "g" g_Tssss; 
296 
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

297 

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

298 
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

299 
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

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

301 

49275  302 
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; 
49210  303 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

304 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 
49275  305 
val ((sssss, hssss_tl), _) = 
306 
lthy 

307 
> mk_Freessss "q" s_Tssss 

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

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

49211  310 

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

49276  313 
fun mk_preds_getters_join [] [cf] = cf 
314 
 mk_preds_getters_join [cq] [cf, cf'] = 

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

316 

49275  317 
fun mk_terms qssss fssss = 
49212  318 
let 
49276  319 
val pfss = map3 zip_preds_predsss_gettersss pss qssss fssss; 
49275  320 
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

321 
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; 
49276  322 
val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss; 
323 
in (pfss, cqfsss) end; 

49210  324 
in 
49212  325 
((([], [], []), ([], [], [])), 
49275  326 
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), 
327 
(mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss)))) 

49210  328 
end; 
329 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

330 
fun define_ctrs_case_for_type ((((((((((((((((((b, fpT), C), fld), unf), fp_iter), fp_rec), 
49212  331 
fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss), 
49286  332 
disc_binders), sel_binderss), raw_sel_defaultss) no_defs_lthy = 
49176  333 
let 
49201  334 
val unfT = domain_type (fastype_of fld); 
49210  335 
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

336 
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

337 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  338 

49176  339 
val ((((u, v), fs), xss), _) = 
49204  340 
no_defs_lthy 
49201  341 
> yield_singleton (mk_Frees "u") unfT 
342 
>> yield_singleton (mk_Frees "v") fpT 

49176  343 
>> mk_Frees "f" case_Ts 
49124  344 
>> mk_Freess "x" ctr_Tss; 
49121  345 

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

49121  349 

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

350 
val case_binder = Binding.suffix_name ("_" ^ caseN) b; 
49129  351 

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

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

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

354 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v)); 
49129  355 

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

49201  359 
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  360 
> `Local_Theory.restore; 
361 

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

363 
val phi = Proof_Context.export_morphism lthy lthy'; 

364 

365 
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

366 
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

367 

49203  368 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
369 
val casex0 = Morphism.term phi raw_case; 

370 

371 
val ctrs = map (mk_ctr As) ctrs0; 

49121  372 

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

374 
let 
49135  375 
val fld_iff_unf_thm = 
376 
let 

377 
val goal = 

378 
fold_rev Logic.all [u, v] 

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

380 
in 

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

49201  382 
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT]) 
49176  383 
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) 
49135  384 
> Thm.close_derivation 
385 
> Morphism.thm phi 

386 
end; 

387 

388 
val sumEN_thm' = 

389 
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

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

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

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

394 
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

395 
end; 
49121  396 

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

49126  400 

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

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

404 

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

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

406 
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

407 
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; 
49121  408 

409 
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

410 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

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

412 
let 
49208  413 
val fpT_to_C = fpT > C; 
49199  414 

49215  415 
fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) = 
416 
let 

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

418 

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

49199  420 

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

423 
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

424 
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); 
49215  425 
in (binder, spec) end; 
49199  426 

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

427 
val iter_like_bundles = 
49215  428 
[(iterN, fp_iter, iter_only), 
429 
(recN, fp_rec, rec_only)]; 

430 

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

431 
val (binders, specs) = map generate_iter_like iter_like_bundles > split_list; 
49215  432 

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

49201  434 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  435 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49215  436 
#>> apsnd snd) binders specs 
49199  437 
> `Local_Theory.restore; 
49201  438 

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

440 
val phi = Proof_Context.export_morphism lthy lthy'; 

441 

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

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

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

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

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

449 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

450 
fun define_coiter_corec ((selss0, discIs, sel_thmss), no_defs_lthy) = 
49210  451 
let 
452 
val B_to_fpT = C > fpT; 

49211  453 

49276  454 
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = 
455 
Term.lambda c (mk_IfN sum_prod_T cps 

456 
(map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n))); 

49275  457 

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

459 
pf_Tss))) = 
49211  460 
let 
461 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

49210  462 

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

49211  465 
val spec = 
49212  466 
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)), 
49211  467 
Term.list_comb (fp_iter_like, 
49276  468 
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); 
49211  469 
in (binder, spec) end; 
49210  470 

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

471 
val coiter_like_bundles = 
49215  472 
[(coiterN, fp_iter, coiter_only), 
473 
(corecN, fp_rec, corec_only)]; 

49212  474 

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

475 
val (binders, specs) = map generate_coiter_like coiter_like_bundles > split_list; 
49211  476 

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

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

49211  480 
#>> apsnd snd) binders specs 
49210  481 
> `Local_Theory.restore; 
482 

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

484 
val phi = Proof_Context.export_morphism lthy lthy'; 

485 

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

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

490 
((ctrs, selss0, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def, 
49266  491 
corec_def), lthy) 
49210  492 
end; 
49286  493 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

494 
fun wrap lthy = 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

495 
let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

496 
wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_binders, (sel_binderss, 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

497 
sel_defaultss))) lthy 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

498 
end; 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

499 

ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

500 
val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec; 
49119  501 
in 
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

502 
((wrap, define_iter_likes), lthy') 
49119  503 
end; 
49167  504 

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

506 
val map_ids = map map_id_of_bnf nested_bnfs; 
49226  507 

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

508 
fun mk_map Ts Us t = 
49217  509 
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

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

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

512 

49234  513 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
514 
let 

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

518 
val args = map build_arg TUs; 

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

520 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

521 
fun derive_iter_rec_thms_for_types ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _, iter_defs, 
49266  522 
rec_defs), lthy) = 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

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

524 
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; 
49212  525 
val giters = map (lists_bmoc gss) iters; 
526 
val hrecs = map (lists_bmoc hss) recs; 

49201  527 

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

528 
val (iter_thmss, rec_thmss) = 
49207  529 
let 
49212  530 
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = 
49207  531 
fold_rev (fold_rev Logic.all) (xs :: fss) 
49212  532 
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); 
49204  533 

49234  534 
fun build_call fiter_likes maybe_tick (T, U) = 
535 
if T = U then 

536 
mk_id T 

537 
else 

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

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

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

49233  541 

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

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

543 
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

544 

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

545 
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

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

548 
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

549 
[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

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

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

552 

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

553 
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

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

555 
map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 
49204  556 

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

49204  559 

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

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

563 
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

564 
in 
49276  565 
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 
49205  566 
goal_iterss iter_tacss, 
49276  567 
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) 
49205  568 
goal_recss rec_tacss) 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

569 
end; 
49201  570 

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

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

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

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

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

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

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

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

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

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

581 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

582 
fun derive_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, vs, _, ctr_defss, 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

583 
discIss, sel_thmsss, coiter_defs, corec_defs), lthy) = 
49212  584 
let 
49233  585 
val z = the_single zs; 
586 

49212  587 
val gcoiters = map (lists_bmoc pgss) coiters; 
588 
val hcorecs = map (lists_bmoc phss) corecs; 

589 

590 
val (coiter_thmss, corec_thmss) = 

591 
let 

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

592 
fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); 
49212  593 

49276  594 
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' = 
49212  595 
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

596 
(Logic.list_implies (seq_conds mk_goal_cond n k cps, 
49276  597 
mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs')))); 
49212  598 

49234  599 
fun build_call fiter_likes maybe_tack (T, U) = 
600 
if T = U then 

601 
mk_id T 

602 
else 

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

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

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

49233  606 

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

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

608 
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); 
49212  609 

49276  610 
fun repair_calls fiter_likes maybe_mk_sumT maybe_tack cqf = 
611 
let val T = fastype_of cqf in 

612 
if exists_subtype (member (op =) Cs) T then 

613 
build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf 

614 
else 

615 
cqf 

616 
end; 

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

617 

49276  618 
val crgsss' = map (map (map (repair_calls gcoiters (K I) (K I)))) crgsss; 
619 
val cshsss' = map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z)))) cshsss; 

49212  620 

621 
val goal_coiterss = 

49276  622 
map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss'; 
49233  623 
val goal_corecss = 
49276  624 
map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss'; 
49213  625 

626 
val coiter_tacss = 

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

627 
map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs 
49226  628 
ctr_defss; 
49233  629 
val corec_tacss = 
630 
map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs 

631 
ctr_defss; 

49212  632 
in 
49276  633 
(map2 (map2 (fn goal => fn tac => 
634 
Skip_Proof.prove lthy [] [] goal (tac o #context) > Thm.close_derivation)) 

49213  635 
goal_coiterss coiter_tacss, 
49276  636 
map2 (map2 (fn goal => fn tac => 
637 
Skip_Proof.prove lthy [] [] goal (tac o #context) 

638 
> Local_Defs.unfold lthy @{thms sum_case_if} > Thm.close_derivation)) 

49233  639 
goal_corecss corec_tacss) 
49212  640 
end; 
641 

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

644 

645 
val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss; 

646 
val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss; 

647 

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

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

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

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

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

654 
> Thm.varifyT_global; 
49266  655 
val sel_thm' = sel_thm RSN (2, trans); 
656 
in 

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

657 
coiter_like_thm RS arg_cong' RS sel_thm' 
49266  658 
end; 
659 

660 
val sel_coiter_thmsss = 

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

662 
val sel_corec_thmsss = 

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

663 
map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss; 
49266  664 

49212  665 
val notes = 
49233  666 
[(coitersN, coiter_thmss), 
49266  667 
(disc_coitersN, disc_coiter_thmss), 
668 
(sel_coitersN, map flat sel_coiter_thmsss), 

669 
(corecsN, corec_thmss), 

670 
(disc_corecsN, disc_corec_thmss), 

671 
(sel_corecsN, map flat sel_corec_thmsss)] 

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

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

49212  676 
in 
49230  677 
lthy > Local_Theory.notes notes > snd 
49212  678 
end; 
679 

49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

680 
fun wrap_types_and_define_iter_likes ((wraps, define_iter_likess), lthy) = 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

681 
fold_map2 (curry (op o)) define_iter_likess wraps lthy >> split_list11 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

682 

49204  683 
val lthy' = lthy 
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

684 
> fold_map define_ctrs_case_for_type (bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ 
49212  685 
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~ 
49286  686 
ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss ~~ raw_sel_defaultsss) 
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

687 
>> split_list > wrap_types_and_define_iter_likes 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

688 
> (if lfp then derive_iter_rec_thms_for_types else derive_coiter_corec_thms_for_types); 
49167  689 

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

49208  691 
(if lfp then "" else "co") ^ "datatype")); 
49112  692 
in 
49204  693 
(timer; lthy') 
49112  694 
end; 
695 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

696 
val datatyp = define_datatype (K I) (K I) (K I); 
49297  697 

49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

698 
val datatype_cmd = define_datatype Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; 
49119  699 

49277  700 
val parse_opt_binding_colon = Scan.optional (Parse.binding  @{keyword ":"}) no_binder 
49119  701 

49112  702 
val parse_ctr_arg = 
49277  703 
@{keyword "("}  parse_opt_binding_colon  Parse.typ  @{keyword ")"}  
49129  704 
(Parse.typ >> pair no_binder); 
49112  705 

49286  706 
val parse_defaults = 
707 
@{keyword "("}  @{keyword "defaults"}  Scan.repeat parse_bound_term  @{keyword ")"}; 

708 

49112  709 
val parse_single_spec = 
710 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

49119  711 
(@{keyword "="}  Parse.enum1 "" (parse_opt_binding_colon  Parse.binding  
49286  712 
Scan.repeat parse_ctr_arg  Scan.optional parse_defaults []  Parse.opt_mixfix)); 
49112  713 

49278  714 
val parse_datatype = parse_wrap_options  Parse.and_list1 parse_single_spec; 
715 

49112  716 
val _ = 
717 
Outer_Syntax.local_theory @{command_spec "data"} "define BNFbased inductive datatypes" 

49278  718 
(parse_datatype >> datatype_cmd true); 
49112  719 

720 
val _ = 

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

49278  722 
(parse_datatype >> datatype_cmd false); 
49112  723 

724 
end; 