author  blanchet 
Fri, 14 Sep 2012 12:09:27 +0200  
changeset 49368  df359ce891ac 
parent 49367  a1e811aa0fb8 
child 49370  be6e749fd003 
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 > 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

11 
(mixfix list > (string * sort) list option > binding list > typ list * typ list list > 
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

12 
BNF_Def.BNF list > local_theory > 
49337  13 
(term list * term list * term list * term list * thm * thm list * thm list * thm list * 
14 
thm list * thm list) * local_theory) > 

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

15 
bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) * 
49297  16 
(binding * typ) list) * (binding * term) list) * mixfix) list) list > 
17 
local_theory > local_theory 

49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

18 
val parse_datatype_cmd: bool > 
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

19 
(mixfix list > (string * sort) list option > binding list > typ list * typ list list > 
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

20 
BNF_Def.BNF list > local_theory > 
49337  21 
(term list * term list * term list * term list * thm * thm list * thm list * thm list * 
22 
thm list * thm list) * local_theory) > 

49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

23 
(local_theory > local_theory) parser 
49112  24 
end; 
25 

26 
structure BNF_FP_Sugar : BNF_FP_SUGAR = 

27 
struct 

28 

49119  29 
open BNF_Util 
30 
open BNF_Wrap 

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

31 
open BNF_Def 
49119  32 
open BNF_FP_Util 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

33 
open BNF_FP_Sugar_Tactics 
49119  34 

49300  35 
val simp_attrs = @{attributes [simp]}; 
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 

49342  44 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
45 

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

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

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

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

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

50 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  51 

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

53 

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

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

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

61 
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

62 
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

63 
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

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

65 

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

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

68 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  69 

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

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

71 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  72 

49121  73 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
49336  74 
fun type_binding_of (((_, b), _), _) = b; 
49181  75 
fun mixfix_of ((_, mx), _) = mx; 
49121  76 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  77 

49286  78 
fun disc_of ((((disc, _), _), _), _) = disc; 
79 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

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

49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

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

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

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

88 

49286  89 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  90 
else (); 
91 

49367  92 
val nn = length specs; 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

93 
val fp_bs = map type_binding_of specs; 
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

94 
val fp_common_name = mk_common_name fp_bs; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

95 

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

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

97 
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

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

99 
end; 
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 
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

102 
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

103 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
49119  104 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

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

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

107 
> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As 
49367  108 
> mk_TFrees nn 
109 
>> mk_TFrees nn 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

110 
>> Variable.variant_fixes (map Binding.name_of fp_bs); 
49119  111 

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

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

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

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

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

116 
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy 
49336  117 
(type_binding_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

118 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  119 

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

120 
fun mk_fake_T b = 
49121  121 
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

122 
unsorted_As); 
49121  123 

49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

124 
val fake_Ts = map mk_fake_T fp_bs; 
49121  125 

49181  126 
val mixfixes = map mixfix_of specs; 
49119  127 

49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

128 
val _ = (case duplicates Binding.eq_name fp_bs of [] => () 
49119  129 
 b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); 
130 

49121  131 
val ctr_specss = map ctr_specs_of specs; 
49119  132 

49336  133 
val disc_bindingss = map (map disc_of) ctr_specss; 
134 
val ctr_bindingss = 

49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

135 
map2 (fn fp_b => map (Binding.qualify false (Binding.name_of fp_b) o ctr_of)) 
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

136 
fp_bs ctr_specss; 
49121  137 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  138 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  139 

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

141 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  142 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
143 

49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

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

145 
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

146 

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

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

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

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

150 

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

151 
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

152 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  153 
[] => () 
49342  154 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  155 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  156 

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

49204  160 
 eq_fpT _ _ = false; 
49146  161 

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

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

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

49119  168 

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

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

170 
map dest_TFree Bs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsBs; 
49121  171 

49337  172 
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, fp_induct, unf_flds, fld_unfs, fld_injects, 
49207  173 
fp_iter_thms, fp_rec_thms), lthy)) = 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

174 
fp_bnf construct fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0; 
49121  175 

49363  176 
fun add_nesty_bnf_names Us = 
49226  177 
let 
178 
fun add (Type (s, Ts)) ss = 

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

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

181 
end 

49363  182 
 add T ss = (member (op =) Us T, ss); 
49226  183 
in snd oo add end; 
184 

49363  185 
fun nesty_bnfs Us = 
186 
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssBs []); 

187 

188 
val nesting_bnfs = nesty_bnfs As; 

189 
val nested_bnfs = nesty_bnfs Bs; 

49226  190 

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

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

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

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

49121  200 

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

49124  203 

49201  204 
val fpTs = map (domain_type o fastype_of) unfs; 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

205 

1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

206 
val exists_fp_subtype = exists_subtype (member (op =) fpTs); 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

207 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

208 
val vs = map2 (curry Free) vs' fpTs; 
49204  209 

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

215 

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

216 
fun mk_iter_like Ts Us t = 
49121  217 
let 
49336  218 
val (bindings, body) = strip_type (fastype_of t); 
219 
val (f_Us, prebody) = split_last bindings; 

49210  220 
val Type (_, Ts0) = if lfp then prebody else body; 
221 
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); 

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

223 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 
49176  224 
end; 
225 

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

228 

49212  229 
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); 
230 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); 

49204  231 

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

236 
val y_Tsss = 

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

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

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

242 
lthy 

243 
> mk_Freess "f" g_Tss 

244 
>> mk_Freesss "x" y_Tsss; 

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

245 
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

246 

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

247 
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

248 
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

249 
 dest_rec_prodT T = [T]; 
49204  250 

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

252 
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

253 
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; 
49208  254 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  255 

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

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

257 
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

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

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

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

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

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

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

270 

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

49276  273 
fun zip_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
49211  274 

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

277 
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

278 

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

279 
fun mk_types maybe_dest_sumT fun_Ts = 
49212  280 
let 
281 
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

282 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49275  283 
val f_Tssss = 
284 
map3 (fn C => map2 (map (map (curry (op >) C) o maybe_dest_sumT) oo dest_tupleT)) 

285 
Cs mss' f_prod_Tss; 

286 
val q_Tssss = 

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

49276  288 
val pf_Tss = map3 zip_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
49275  289 
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; 
49176  290 

49275  291 
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts; 
49211  292 

49275  293 
val ((((Free (z, _), cs), pss), gssss), _) = 
49210  294 
lthy 
49233  295 
> yield_singleton (mk_Frees "z") dummyT 
296 
>> mk_Frees "a" Cs 

49211  297 
>> mk_Freess "p" p_Tss 
49275  298 
>> mk_Freessss "g" g_Tssss; 
299 
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

300 

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

301 
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

302 
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

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

304 

49275  305 
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; 
49210  306 

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

307 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 
49275  308 
val ((sssss, hssss_tl), _) = 
309 
lthy 

310 
> mk_Freessss "q" s_Tssss 

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

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

49211  313 

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

49276  316 
fun mk_preds_getters_join [] [cf] = cf 
317 
 mk_preds_getters_join [cq] [cf, cf'] = 

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

319 

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

324 
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; 
49276  325 
val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss; 
326 
in (pfss, cqfsss) end; 

49210  327 
in 
49212  328 
((([], [], []), ([], [], [])), 
49275  329 
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), 
330 
(mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss)))) 

49210  331 
end; 
332 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

333 
fun define_ctrs_case_for_type (((((((((((((((((((fp_b, fpT), C), v), fld), unf), fp_iter), 
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

334 
fp_rec), fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_bindings), ctr_mixfixes), 
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

335 
ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  336 
let 
49201  337 
val unfT = domain_type (fastype_of fld); 
49210  338 
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

339 
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

340 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  341 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

342 
val (((u, fs), xss), _) = 
49204  343 
no_defs_lthy 
49201  344 
> yield_singleton (mk_Frees "u") unfT 
49176  345 
>> mk_Frees "f" case_Ts 
49124  346 
>> mk_Freess "x" ctr_Tss; 
49121  347 

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

49121  351 

49336  352 
val case_binding = Binding.suffix_name ("_" ^ caseN) fp_b; 
49129  353 

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

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

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

356 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v)); 
49129  357 

49201  358 
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy 
49169  359 
> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => 
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

360 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  361 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  362 
> `Local_Theory.restore; 
363 

364 
val phi = Proof_Context.export_morphism lthy lthy'; 

365 

366 
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

367 
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

368 

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

371 

372 
val ctrs = map (mk_ctr As) ctrs0; 

49121  373 

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

375 
let 
49135  376 
val fld_iff_unf_thm = 
377 
let 

378 
val goal = 

379 
fold_rev Logic.all [u, v] 

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

381 
in 

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

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

387 
end; 

388 

389 
val sumEN_thm' = 

390 
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

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

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

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

395 
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

396 
end; 
49121  397 

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

49126  401 

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

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

405 

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

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

407 
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

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

410 
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

411 

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

412 
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

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

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

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

49336  419 
val binding = Binding.suffix_name ("_" ^ suf) fp_b; 
49215  420 
val spec = 
49336  421 
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)), 
49215  422 
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

423 
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); 
49336  424 
in (binding, spec) end; 
49199  425 

49300  426 
val iter_like_infos = 
49215  427 
[(iterN, fp_iter, iter_only), 
428 
(recN, fp_rec, rec_only)]; 

429 

49336  430 
val (bindings, specs) = map generate_iter_like iter_like_infos > split_list; 
49215  431 

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

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

438 
val phi = Proof_Context.export_morphism lthy lthy'; 

439 

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

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

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

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

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

447 

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

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

49211  451 

49276  452 
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = 
453 
Term.lambda c (mk_IfN sum_prod_T cps 

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

49275  455 

49276  456 
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

457 
pf_Tss))) = 
49211  458 
let 
459 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

49336  460 
val binding = Binding.suffix_name ("_" ^ suf) fp_b; 
49211  461 
val spec = 
49336  462 
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)), 
49211  463 
Term.list_comb (fp_iter_like, 
49276  464 
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); 
49336  465 
in (binding, spec) end; 
49210  466 

49300  467 
val coiter_like_infos = 
49215  468 
[(coiterN, fp_iter, coiter_only), 
469 
(corecN, fp_rec, corec_only)]; 

49212  470 

49336  471 
val (bindings, specs) = map generate_coiter_like coiter_like_infos > split_list; 
49211  472 

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

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

49336  476 
#>> apsnd snd) bindings specs 
49210  477 
> `Local_Theory.restore; 
478 

479 
val phi = Proof_Context.export_morphism lthy lthy'; 

480 

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

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

485 
((ctrs, selss0, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def, 
49266  486 
corec_def), lthy) 
49210  487 
end; 
49286  488 

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

489 
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

490 
let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in 
49336  491 
wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_bindings, (sel_bindingss, 
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

492 
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

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

494 

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

495 
val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec; 
49119  496 
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

497 
((wrap, define_iter_likes), lthy') 
49119  498 
end; 
49167  499 

49368  500 
(* TODO: remove all "nested" and "nesting" BNFs from pre_bnfs, if they're there ### *) 
49226  501 
val pre_map_defs = map map_def_of_bnf pre_bnfs; 
49342  502 
val pre_set_defss = map set_defs_of_bnf pre_bnfs; 
49368  503 
val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs; 
49363  504 
val nesting_map_ids = map map_id_of_bnf nesting_bnfs; 
49226  505 

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

506 
fun mk_map Ts Us t = 
49217  507 
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

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

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

510 

49234  511 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
512 
let 

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

516 
val args = map build_arg TUs; 

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

518 

49337  519 
fun derive_induct_iter_rec_thms_for_types ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _, 
520 
iter_defs, rec_defs), lthy) = 

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

521 
let 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

522 
fun mk_sets_nested bnf = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

523 
let 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

524 
val Type (T_name, Us) = T_of_bnf bnf; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

525 
val lives = lives_of_bnf bnf; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

526 
val sets = sets_of_bnf bnf; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

527 
fun mk_set U = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

528 
(case find_index (curry (op =) U) lives of 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

529 
~1 => Term.dummy 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

530 
 i => nth sets i); 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

531 
in 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

532 
(T_name, map mk_set Us) 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

533 
end; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

534 

1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

535 
val setss_nested = map mk_sets_nested nested_bnfs; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

536 

49337  537 
val (induct_thms, induct_thm) = 
538 
let 

49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

539 
val ((phis, phis'), names_lthy) = 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

540 
lthy 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

541 
> mk_Frees' "P" (map mk_predT fpTs); 
49342  542 

49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

543 
fun mk_set Ts t = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

544 
let val Type (_, Ts0) = domain_type (fastype_of t) in 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

545 
Term.subst_atomic_types (Ts0 ~~ Ts) t 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

546 
end; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

547 

1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

548 
fun mk_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) = 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

549 
(case find_index (curry (op =) T) fpTs of 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

550 
~1 => 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

551 
(case AList.lookup (op =) setss_nested T_name of 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

552 
NONE => [] 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

553 
 SOME raw_sets0 => 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

554 
let 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

555 
val (Ts, raw_sets) = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

556 
split_list (filter (exists_fp_subtype o fst) (Ts0 ~~ raw_sets0)); 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

557 
val sets = map (mk_set Ts0) raw_sets; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

558 
val (ys, names_lthy') = names_lthy > mk_Frees s Ts; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

559 
val heads = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

560 
map2 (fn y => fn set => HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x))) 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

561 
ys sets; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

562 
val bodies = flat (map (mk_prem_prems names_lthy') ys); 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

563 
in 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

564 
map2 (curry Logic.mk_implies) heads bodies 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

565 
end) 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

566 
 i => [HOLogic.mk_Trueprop (nth phis i $ x)]) 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

567 
 mk_prem_prems _ _ = []; 
49342  568 

49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

569 
fun close_prem_prem (Free x') t = 
49367  570 
fold_rev Logic.all 
571 
(map Free (drop (nn + 1) (rev (Term.add_frees t (x' :: phis'))))) t; 

49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

572 

49368  573 
fun mk_prem_triple phi ctr ctr_Ts = 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

574 
let 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

575 
val (xs, names_lthy') = names_lthy > mk_Frees "x" ctr_Ts; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

576 
val prem_prems = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

577 
maps (fn x => map (close_prem_prem x) (mk_prem_prems names_lthy' x)) xs; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

578 
in 
49368  579 
(xs, prem_prems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

580 
end; 
49342  581 

49368  582 
val prem_tripless = map3 (map2 o mk_prem_triple) phis ctrss ctr_Tsss; 
583 

584 
fun mk_prem (xs, prem_prems, concl) = 

585 
fold_rev Logic.all xs (Logic.list_implies (prem_prems, concl)); 

586 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

587 
val goal = 
49368  588 
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (prem_tripless, 
589 
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj 

590 
(map2 (curry (op $)) phis vs))); 

591 

592 
val rss = map (map (length o #2)) prem_tripless; 

593 

594 
val fld_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); 

49342  595 

596 
val induct_thm = 

49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

597 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 
49368  598 
mk_induct_tac ctxt ns mss rss (flat ctr_defss) fld_induct' pre_set_defss 
599 
nested_set_natural's) 

600 
(* TODO: thread name context properly ### *) 

601 
> singleton (Proof_Context.export names_lthy lthy) 

602 
> singleton (Proof_Context.export no_defs_lthy no_defs_lthy0) 

49337  603 
in 
49367  604 
`(conj_dests nn) induct_thm 
49337  605 
end; 
49201  606 

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

607 
val (iter_thmss, rec_thmss) = 
49207  608 
let 
49337  609 
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; 
610 
val giters = map (lists_bmoc gss) iters; 

611 
val hrecs = map (lists_bmoc hss) recs; 

612 

49212  613 
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = 
49207  614 
fold_rev (fold_rev Logic.all) (xs :: fss) 
49212  615 
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); 
49204  616 

49234  617 
fun build_call fiter_likes maybe_tick (T, U) = 
618 
if T = U then 

49368  619 
id_const T 
49234  620 
else 
621 
(case find_index (curry (op =) T) fpTs of 

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

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

49233  624 

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

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

626 
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

627 

49342  628 
fun intr_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

629 
if member (op =) fpTs T then 
49233  630 
maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x] 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

631 
else if exists_fp_subtype T then 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

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

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

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

635 

49342  636 
val gxsss = map (map (maps (intr_calls giters (K I) (K I) (K I)))) xsss; 
637 
val hxsss = map (map (maps (intr_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 

49204  638 

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

49204  641 

49203  642 
val iter_tacss = 
49363  643 
map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids iter_defs) fp_iter_thms 
644 
ctr_defss; 

49203  645 
val rec_tacss = 
49363  646 
map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms 
647 
ctr_defss; 

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

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

653 
end; 
49201  654 

49337  655 
val common_notes = 
49367  656 
(if nn > 1 then [(inductN, [induct_thm], [])] (* FIXME: attribs *) else []) 
49337  657 
> map (fn (thmN, thms, attrs) => 
658 
((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 

659 

49226  660 
val notes = 
49342  661 
[(inductN, map single induct_thms, []), (* FIXME: attribs *) 
662 
(itersN, iter_thmss, simp_attrs), 

49300  663 
(recsN, rec_thmss, Code.add_default_eqn_attrib :: simp_attrs)] 
664 
> maps (fn (thmN, thmss, attrs) => 

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

665 
map2 (fn b => fn thms => 
49300  666 
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs), 
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

667 
[(thms, [])])) fp_bs thmss); 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

668 
in 
49337  669 
lthy > Local_Theory.notes (common_notes @ notes) > snd 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

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

671 

49337  672 
fun derive_coinduct_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, vs, _, 
673 
ctr_defss, discIss, sel_thmsss, coiter_defs, corec_defs), lthy) = 

49212  674 
let 
49337  675 
val (coinduct_thms, coinduct_thm) = 
676 
let 

677 
val coinduct_thm = fp_induct; 

678 
in 

49367  679 
`(conj_dests nn) coinduct_thm 
49337  680 
end; 
49212  681 

682 
val (coiter_thmss, corec_thmss) = 

683 
let 

49337  684 
val z = the_single zs; 
685 
val gcoiters = map (lists_bmoc pgss) coiters; 

686 
val hcorecs = map (lists_bmoc phss) corecs; 

687 

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

688 
fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); 
49212  689 

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

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

49234  695 
fun build_call fiter_likes maybe_tack (T, U) = 
696 
if T = U then 

49368  697 
id_const T 
49234  698 
else 
699 
(case find_index (curry (op =) U) fpTs of 

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

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

49233  702 

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

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

704 
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); 
49212  705 

49342  706 
fun intr_calls fiter_likes maybe_mk_sumT maybe_tack cqf = 
49276  707 
let val T = fastype_of cqf in 
708 
if exists_subtype (member (op =) Cs) T then 

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

710 
else 

711 
cqf 

712 
end; 

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

713 

49342  714 
val crgsss' = map (map (map (intr_calls gcoiters (K I) (K I)))) crgsss; 
715 
val cshsss' = map (map (map (intr_calls hcorecs (curry mk_sumT) (tack z)))) cshsss; 

49212  716 

717 
val goal_coiterss = 

49276  718 
map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss'; 
49233  719 
val goal_corecss = 
49276  720 
map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss'; 
49213  721 

722 
val coiter_tacss = 

49363  723 
map3 (map oo mk_coiter_like_tac coiter_defs nesting_map_ids) fp_iter_thms pre_map_defs 
49226  724 
ctr_defss; 
49233  725 
val corec_tacss = 
49363  726 
map3 (map oo mk_coiter_like_tac corec_defs nesting_map_ids) fp_rec_thms pre_map_defs 
49233  727 
ctr_defss; 
49212  728 
in 
49276  729 
(map2 (map2 (fn goal => fn tac => 
730 
Skip_Proof.prove lthy [] [] goal (tac o #context) > Thm.close_derivation)) 

49213  731 
goal_coiterss coiter_tacss, 
49276  732 
map2 (map2 (fn goal => fn tac => 
733 
Skip_Proof.prove lthy [] [] goal (tac o #context) 

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

49233  735 
goal_corecss corec_tacss) 
49212  736 
end; 
737 

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

740 

741 
val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss; 

742 
val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss; 

743 

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

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

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

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

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

750 
> Thm.varifyT_global; 
49266  751 
val sel_thm' = sel_thm RSN (2, trans); 
752 
in 

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

753 
coiter_like_thm RS arg_cong' RS sel_thm' 
49266  754 
end; 
755 

756 
val sel_coiter_thmsss = 

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

758 
val sel_corec_thmsss = 

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

759 
map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss; 
49266  760 

49342  761 
val common_notes = 
49367  762 
(if nn > 1 then [(coinductN, [coinduct_thm], [])] (* FIXME: attribs *) else []) 
49342  763 
> map (fn (thmN, thms, attrs) => 
764 
((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 

765 

49212  766 
val notes = 
49342  767 
[(coinductN, map single coinduct_thms, []), (* FIXME: attribs *) 
768 
(coitersN, coiter_thmss, []), 

49300  769 
(disc_coitersN, disc_coiter_thmss, []), 
770 
(sel_coitersN, map flat sel_coiter_thmsss, []), 

771 
(corecsN, corec_thmss, []), 

772 
(disc_corecsN, disc_corec_thmss, []), 

773 
(sel_corecsN, map flat sel_corec_thmsss, [])] 

774 
> maps (fn (thmN, thmss, attrs) => 

49266  775 
map_filter (fn (_, []) => NONE  (b, thms) => 
49300  776 
SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs), 
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

777 
[(thms, [])])) (fp_bs ~~ thmss)); 
49212  778 
in 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

779 
lthy > Local_Theory.notes (common_notes @ notes) > snd 
49212  780 
end; 
781 

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

782 
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

783 
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

784 

49204  785 
val lthy' = lthy 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

786 
> fold_map define_ctrs_case_for_type (fp_bs ~~ fpTs ~~ Cs ~~ vs ~~ flds ~~ unfs ~~ 
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

787 
fp_iters ~~ fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ 
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

788 
ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ 
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

789 
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

790 
>> split_list > wrap_types_and_define_iter_likes 
49337  791 
> (if lfp then derive_induct_iter_rec_thms_for_types 
792 
else derive_coinduct_coiter_corec_thms_for_types); 

49167  793 

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

49208  795 
(if lfp then "" else "co") ^ "datatype")); 
49112  796 
in 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

797 
timer; lthy' 
49112  798 
end; 
799 

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

800 
val datatyp = define_datatype (K I) (K I) (K I); 
49297  801 

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

802 
val datatype_cmd = define_datatype Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; 
49119  803 

49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset

804 
val parse_binding_colon = Parse.binding  @{keyword ":"}; 
49336  805 
val parse_opt_binding_colon = Scan.optional parse_binding_colon no_binding; 
49119  806 

49112  807 
val parse_ctr_arg = 
49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset

808 
@{keyword "("}  parse_binding_colon  Parse.typ  @{keyword ")"}  
49336  809 
(Parse.typ >> pair no_binding); 
49112  810 

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

813 

49112  814 
val parse_single_spec = 
815 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

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

49278  819 
val parse_datatype = parse_wrap_options  Parse.and_list1 parse_single_spec; 
820 

49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

821 
fun parse_datatype_cmd lfp construct = parse_datatype >> datatype_cmd lfp construct; 
49112  822 

823 
end; 