author | blanchet |
Fri, 14 Sep 2012 22:23:11 +0200 | |
changeset 49381 | be09db8426cb |
parent 49378 | 19237e465055 |
child 49389 | da621dc65146 |
permissions | -rw-r--r-- |
49112 | 1 |
(* Title: HOL/Codatatype/Tools/bnf_fp_sugar.ML |
2 |
Author: Jasmin Blanchette, TU Muenchen |
|
3 |
Copyright 2012 |
|
4 |
||
5 |
Sugar for constructing LFPs and GFPs. |
|
6 |
*) |
|
7 |
||
8 |
signature BNF_FP_SUGAR = |
|
9 |
sig |
|
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 |
||
49370 | 37 |
fun split_list10 xs = |
49266 | 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, |
49370 | 39 |
map #9 xs, map #10 xs); |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
40 |
|
49381 | 41 |
fun strip_map_type @{type_name fun} (Type (_, [T, Type (_, [T', T''])])) = ([T, T'], T'') |
42 |
| strip_map_type _ T = strip_type T; |
|
49217 | 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 eta-reduced
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 eta-reduced
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 eta-reduced
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 destructor-less 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 |
|
49370 | 105 |
val ((Bs, Cs), 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 |
49370 | 109 |
||>> mk_TFrees nn; |
49119 | 110 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
111 |
(* TODO: cleaner handling of fake contexts, without "background_theory" *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
112 |
(*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
|
113 |
locale and shadows an existing global type*) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
114 |
val fake_thy = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
115 |
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy |
49336 | 116 |
(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
|
117 |
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; |
49119 | 118 |
|
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
|
119 |
fun mk_fake_T b = |
49121 | 120 |
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
|
121 |
unsorted_As); |
49121 | 122 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
123 |
val fake_Ts = map mk_fake_T fp_bs; |
49121 | 124 |
|
49181 | 125 |
val mixfixes = map mixfix_of specs; |
49119 | 126 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
127 |
val _ = (case duplicates Binding.eq_name fp_bs of [] => () |
49119 | 128 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
129 |
||
49121 | 130 |
val ctr_specss = map ctr_specs_of specs; |
49119 | 131 |
|
49336 | 132 |
val disc_bindingss = map (map disc_of) ctr_specss; |
133 |
val ctr_bindingss = |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
134 |
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
|
135 |
fp_bs ctr_specss; |
49121 | 136 |
val ctr_argsss = map (map args_of) ctr_specss; |
49181 | 137 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; |
49119 | 138 |
|
49336 | 139 |
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
|
140 |
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
49286 | 141 |
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; |
142 |
||
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
143 |
val (As :: _) :: fake_ctr_Tsss = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
144 |
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
|
145 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
146 |
val _ = (case duplicates (op =) unsorted_As of [] => () |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
147 |
| A :: _ => error ("Duplicate type parameter " ^ |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
148 |
quote (Syntax.string_of_typ no_defs_lthy A))); |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
149 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
150 |
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
|
151 |
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of |
49165 | 152 |
[] => () |
49342 | 153 |
| A' :: _ => error ("Extra type variable on right-hand side: " ^ |
49204 | 154 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); |
49165 | 155 |
|
49204 | 156 |
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) = |
49146 | 157 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ |
158 |
quote (Syntax.string_of_typ fake_lthy T))) |
|
49204 | 159 |
| eq_fpT _ _ = false; |
49146 | 160 |
|
49204 | 161 |
fun freeze_fp (T as Type (s, Us)) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
162 |
(case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us) | j => nth Bs j) |
49204 | 163 |
| freeze_fp T = T; |
49121 | 164 |
|
49297 | 165 |
val ctr_TsssBs = map (map (map freeze_fp)) fake_ctr_Tsss; |
166 |
val ctr_sum_prod_TsBs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssBs; |
|
49119 | 167 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
168 |
val fp_eqs = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
169 |
map dest_TFree Bs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsBs; |
49121 | 170 |
|
49337 | 171 |
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, fp_induct, unf_flds, fld_unfs, fld_injects, |
49207 | 172 |
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
|
173 |
fp_bnf construct fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0; |
49121 | 174 |
|
49363 | 175 |
fun add_nesty_bnf_names Us = |
49226 | 176 |
let |
177 |
fun add (Type (s, Ts)) ss = |
|
178 |
let val (needs, ss') = fold_map add Ts ss in |
|
179 |
if exists I needs then (true, insert (op =) s ss') else (false, ss') |
|
180 |
end |
|
49363 | 181 |
| add T ss = (member (op =) Us T, ss); |
49226 | 182 |
in snd oo add end; |
183 |
||
49363 | 184 |
fun nesty_bnfs Us = |
185 |
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssBs []); |
|
186 |
||
187 |
val nesting_bnfs = nesty_bnfs As; |
|
188 |
val nested_bnfs = nesty_bnfs Bs; |
|
49226 | 189 |
|
49167 | 190 |
val timer = time (Timer.startRealTimer ()); |
191 |
||
49176 | 192 |
fun mk_unf_or_fld get_T Ts t = |
193 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
49124 | 194 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
49121 | 195 |
end; |
49119 | 196 |
|
49126 | 197 |
val mk_unf = mk_unf_or_fld domain_type; |
198 |
val mk_fld = mk_unf_or_fld range_type; |
|
49121 | 199 |
|
49203 | 200 |
val unfs = map (mk_unf As) unfs0; |
201 |
val flds = map (mk_fld As) flds0; |
|
49124 | 202 |
|
49201 | 203 |
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
|
204 |
|
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
205 |
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
|
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 |
49336 | 215 |
val (bindings, body) = strip_type (fastype_of t); |
216 |
val (f_Us, prebody) = split_last bindings; |
|
49210 | 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 one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
265 |
(*avoid "'a itself" arguments in coiterators and corecursors*) |
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
266 |
val mss' = map (fn [0] => [1] | ms => ms) mss; |
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
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 |
||
49370 | 330 |
fun define_ctrs_case_for_type ((((((((((((((((((fp_b, fpT), C), fld), unf), fp_iter), fp_rec), |
331 |
fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_bindings), ctr_mixfixes), ctr_Tss), |
|
332 |
disc_bindings), sel_bindingss), 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 |
|
49370 | 339 |
val ((((u, fs), xss), v'), _) = |
49204 | 340 |
no_defs_lthy |
49201 | 341 |
|> yield_singleton (mk_Frees "u") unfT |
49176 | 342 |
||>> mk_Frees "f" case_Ts |
49370 | 343 |
||>> mk_Freess "x" ctr_Tss |
344 |
||>> yield_singleton (Variable.variant_fixes) (Binding.name_of fp_b); |
|
345 |
||
346 |
val v = Free (v', fpT); |
|
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 |
49370 | 444 |
((ctrs, selss0, iter, recx, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def), lthy) |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
445 |
end; |
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
446 |
|
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
447 |
fun define_coiter_corec ((selss0, discIs, sel_thmss), no_defs_lthy) = |
49210 | 448 |
let |
449 |
val B_to_fpT = C --> fpT; |
|
49211 | 450 |
|
49276 | 451 |
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = |
452 |
Term.lambda c (mk_IfN sum_prod_T cps |
|
453 |
(map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n))); |
|
49275 | 454 |
|
49276 | 455 |
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
|
456 |
pf_Tss))) = |
49211 | 457 |
let |
458 |
val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT; |
|
49336 | 459 |
val binding = Binding.suffix_name ("_" ^ suf) fp_b; |
49211 | 460 |
val spec = |
49336 | 461 |
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)), |
49211 | 462 |
Term.list_comb (fp_iter_like, |
49276 | 463 |
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); |
49336 | 464 |
in (binding, spec) end; |
49210 | 465 |
|
49300 | 466 |
val coiter_like_infos = |
49215 | 467 |
[(coiterN, fp_iter, coiter_only), |
468 |
(corecN, fp_rec, corec_only)]; |
|
49212 | 469 |
|
49336 | 470 |
val (bindings, specs) = map generate_coiter_like coiter_like_infos |> split_list; |
49211 | 471 |
|
472 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49210 | 473 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
474 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
|
49336 | 475 |
#>> apsnd snd) bindings specs |
49210 | 476 |
||> `Local_Theory.restore; |
477 |
||
478 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
479 |
||
49211 | 480 |
val [coiter_def, corec_def] = map (Morphism.thm phi) defs; |
49210 | 481 |
|
49211 | 482 |
val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts; |
49210 | 483 |
in |
49370 | 484 |
((ctrs, selss0, coiter, corec, xss, ctr_defs, discIs, sel_thmss, coiter_def, corec_def), |
485 |
lthy) |
|
49210 | 486 |
end; |
49286 | 487 |
|
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
488 |
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
|
489 |
let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in |
49336 | 490 |
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
|
491 |
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
|
492 |
end; |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
493 |
|
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
494 |
val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec; |
49119 | 495 |
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
|
496 |
((wrap, define_iter_likes), lthy') |
49119 | 497 |
end; |
49167 | 498 |
|
49226 | 499 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
49342 | 500 |
val pre_set_defss = map set_defs_of_bnf pre_bnfs; |
49368 | 501 |
val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs; |
49363 | 502 |
val nesting_map_ids = map map_id_of_bnf nesting_bnfs; |
49226 | 503 |
|
49381 | 504 |
fun mk_map s Ts Us t = |
505 |
let val (Type (_, Ts0), Type (_, Us0)) = strip_map_type s (fastype_of t) |>> List.last in |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
506 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
507 |
end; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
508 |
|
49381 | 509 |
fun build_map build_arg (T as Type (s, Ts)) (U as Type (_, Us)) = |
49234 | 510 |
let |
49236 | 511 |
val map0 = map_of_bnf (the (bnf_of lthy s)); |
49381 | 512 |
val mapx = mk_map s Ts Us map0; |
513 |
val TUs = map dest_funT (fst (split_last (fst (strip_map_type s (fastype_of mapx))))); |
|
49234 | 514 |
val args = map build_arg TUs; |
515 |
in Term.list_comb (mapx, args) end; |
|
516 |
||
49370 | 517 |
fun derive_induct_iter_rec_thms_for_types ((ctrss, _, iters, recs, xsss, ctr_defss, _, _, |
49337 | 518 |
iter_defs, rec_defs), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
519 |
let |
49370 | 520 |
val (((phis, phis'), vs'), names_lthy) = |
521 |
lthy |
|
522 |
|> mk_Frees' "P" (map mk_predT fpTs) |
|
523 |
||>> Variable.variant_fixes (map Binding.name_of fp_bs); |
|
524 |
||
525 |
val vs = map2 (curry Free) vs' fpTs; |
|
526 |
||
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
527 |
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
|
528 |
let |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
529 |
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
|
530 |
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
|
531 |
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
|
532 |
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
|
533 |
(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
|
534 |
~1 => Term.dummy |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
535 |
| 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
|
536 |
in |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
537 |
(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
|
538 |
end; |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
539 |
|
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
540 |
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
|
541 |
|
49337 | 542 |
val (induct_thms, induct_thm) = |
543 |
let |
|
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
544 |
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
|
545 |
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
|
546 |
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
|
547 |
end; |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
548 |
|
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
549 |
fun mk_raw_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
|
550 |
(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
|
551 |
~1 => |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
552 |
(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
|
553 |
NONE => [] |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
554 |
| SOME raw_sets0 => |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
555 |
let |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
556 |
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
|
557 |
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
|
558 |
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
|
559 |
val (ys, names_lthy') = names_lthy |> mk_Frees s Ts; |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
560 |
val xysets = map (pair x) (ys ~~ sets); |
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
561 |
val ppremss = map (mk_raw_prem_prems names_lthy') ys; |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
562 |
in |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
563 |
flat (map2 (map o apfst o cons) xysets ppremss) |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
564 |
end) |
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
565 |
| i => [([], (i + 1, x))]) |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
566 |
| mk_raw_prem_prems _ _ = []; |
49342 | 567 |
|
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
568 |
fun close_prem_prem xs t = |
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
569 |
fold_rev Logic.all (map Free (drop (nn + length xs) |
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
570 |
(rev (Term.add_frees t (map dest_Free xs @ phis'))))) t; |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
571 |
|
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
572 |
fun mk_prem_prem xs (xysets, (j, x)) = |
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
573 |
close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) => |
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
574 |
HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets, |
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
575 |
HOLogic.mk_Trueprop (nth phis (j - 1) $ x))); |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
576 |
|
49372 | 577 |
fun mk_raw_prem 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
|
578 |
let |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
579 |
val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts; |
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
580 |
val pprems = maps (mk_raw_prem_prems names_lthy') xs; |
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
581 |
in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end; |
49342 | 582 |
|
49372 | 583 |
val raw_premss = map3 (map2 o mk_raw_prem) phis ctrss ctr_Tsss; |
49368 | 584 |
|
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
585 |
fun mk_prem (xs, raw_pprems, concl) = |
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
586 |
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); |
49368 | 587 |
|
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
|
588 |
val goal = |
49372 | 589 |
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss, |
49368 | 590 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
591 |
(map2 (curry (op $)) phis vs))); |
|
592 |
||
49377 | 593 |
fun mk_raw_prem_prems_indices pprems = |
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
594 |
let |
49377 | 595 |
fun has_index kk (_, (kk', _)) = kk' = kk; |
596 |
val buckets = Library.partition_list has_index 1 nn pprems; |
|
597 |
val pps = map length buckets; |
|
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
598 |
in |
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
599 |
map (fn pprem as (xysets, (kk, _)) => |
49377 | 600 |
((nth pps (kk - 1), find_index (curry (op =) pprem) (nth buckets (kk - 1)) + 1), |
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
601 |
(length xysets, kk))) pprems |
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
602 |
end; |
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
603 |
|
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
604 |
val ixsss = map (map (mk_raw_prem_prems_indices o #2)) raw_premss; |
49368 | 605 |
|
606 |
val fld_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); |
|
49342 | 607 |
|
608 |
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
|
609 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
610 |
mk_induct_tac ctxt ns mss ixsss (flat ctr_defss) fld_induct' nested_set_natural's |
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
611 |
pre_set_defss) |
49368 | 612 |
|> singleton (Proof_Context.export names_lthy lthy) |
49337 | 613 |
in |
49367 | 614 |
`(conj_dests nn) induct_thm |
49337 | 615 |
end; |
49201 | 616 |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
617 |
val (iter_thmss, rec_thmss) = |
49207 | 618 |
let |
49337 | 619 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
620 |
val giters = map (lists_bmoc gss) iters; |
|
621 |
val hrecs = map (lists_bmoc hss) recs; |
|
622 |
||
49212 | 623 |
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = |
49207 | 624 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
49212 | 625 |
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); |
49204 | 626 |
|
49234 | 627 |
fun build_call fiter_likes maybe_tick (T, U) = |
628 |
if T = U then |
|
49368 | 629 |
id_const T |
49234 | 630 |
else |
631 |
(case find_index (curry (op =) T) fpTs of |
|
632 |
~1 => build_map (build_call fiter_likes maybe_tick) T U |
|
633 |
| j => maybe_tick (nth vs j) (nth fiter_likes j)); |
|
49233 | 634 |
|
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
635 |
fun mk_U maybe_mk_prodT = |
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
636 |
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
|
637 |
|
49342 | 638 |
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
|
639 |
if member (op =) fpTs T then |
49233 | 640 |
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
|
641 |
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
|
642 |
[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
|
643 |
else |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
644 |
[x]; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
645 |
|
49342 | 646 |
val gxsss = map (map (maps (intr_calls giters (K I) (K I) (K I)))) xsss; |
647 |
val hxsss = map (map (maps (intr_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; |
|
49204 | 648 |
|
49212 | 649 |
val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss; |
650 |
val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss; |
|
49204 | 651 |
|
49203 | 652 |
val iter_tacss = |
49363 | 653 |
map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids iter_defs) fp_iter_thms |
654 |
ctr_defss; |
|
49203 | 655 |
val rec_tacss = |
49363 | 656 |
map2 (map o mk_iter_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms |
657 |
ctr_defss; |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
658 |
in |
49276 | 659 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
49205 | 660 |
goal_iterss iter_tacss, |
49276 | 661 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
49205 | 662 |
goal_recss rec_tacss) |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
663 |
end; |
49201 | 664 |
|
49337 | 665 |
val common_notes = |
49367 | 666 |
(if nn > 1 then [(inductN, [induct_thm], [])] (* FIXME: attribs *) else []) |
49337 | 667 |
|> map (fn (thmN, thms, attrs) => |
668 |
((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); |
|
669 |
||
49226 | 670 |
val notes = |
49342 | 671 |
[(inductN, map single induct_thms, []), (* FIXME: attribs *) |
672 |
(itersN, iter_thmss, simp_attrs), |
|
49300 | 673 |
(recsN, rec_thmss, Code.add_default_eqn_attrib :: simp_attrs)] |
674 |
|> maps (fn (thmN, thmss, attrs) => |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
675 |
map2 (fn b => fn thms => |
49300 | 676 |
((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
|
677 |
[(thms, [])])) fp_bs thmss); |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
678 |
in |
49337 | 679 |
lthy |> Local_Theory.notes (common_notes @ notes) |> snd |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
680 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
681 |
|
49370 | 682 |
fun derive_coinduct_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, _, ctr_defss, |
683 |
discIss, sel_thmsss, coiter_defs, corec_defs), lthy) = |
|
49212 | 684 |
let |
49372 | 685 |
val (vs', _) = |
49370 | 686 |
lthy |
687 |
|> Variable.variant_fixes (map Binding.name_of fp_bs); |
|
688 |
||
689 |
val vs = map2 (curry Free) vs' fpTs; |
|
690 |
||
49337 | 691 |
val (coinduct_thms, coinduct_thm) = |
692 |
let |
|
693 |
val coinduct_thm = fp_induct; |
|
694 |
in |
|
49367 | 695 |
`(conj_dests nn) coinduct_thm |
49337 | 696 |
end; |
49212 | 697 |
|
698 |
val (coiter_thmss, corec_thmss) = |
|
699 |
let |
|
49337 | 700 |
val z = the_single zs; |
701 |
val gcoiters = map (lists_bmoc pgss) coiters; |
|
702 |
val hcorecs = map (lists_bmoc phss) corecs; |
|
703 |
||
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
704 |
fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); |
49212 | 705 |
|
49276 | 706 |
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' = |
49212 | 707 |
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
|
708 |
(Logic.list_implies (seq_conds mk_goal_cond n k cps, |
49276 | 709 |
mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs')))); |
49212 | 710 |
|
49234 | 711 |
fun build_call fiter_likes maybe_tack (T, U) = |
712 |
if T = U then |
|
49368 | 713 |
id_const T |
49234 | 714 |
else |
715 |
(case find_index (curry (op =) U) fpTs of |
|
716 |
~1 => build_map (build_call fiter_likes maybe_tack) T U |
|
717 |
| j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j)); |
|
49233 | 718 |
|
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
719 |
fun mk_U maybe_mk_sumT = |
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
720 |
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); |
49212 | 721 |
|
49342 | 722 |
fun intr_calls fiter_likes maybe_mk_sumT maybe_tack cqf = |
49276 | 723 |
let val T = fastype_of cqf in |
724 |
if exists_subtype (member (op =) Cs) T then |
|
725 |
build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf |
|
726 |
else |
|
727 |
cqf |
|
728 |
end; |
|
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
729 |
|
49342 | 730 |
val crgsss' = map (map (map (intr_calls gcoiters (K I) (K I)))) crgsss; |
731 |
val cshsss' = map (map (map (intr_calls hcorecs (curry mk_sumT) (tack z)))) cshsss; |
|
49212 | 732 |
|
733 |
val goal_coiterss = |
|
49276 | 734 |
map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss'; |
49233 | 735 |
val goal_corecss = |
49276 | 736 |
map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss'; |
49213 | 737 |
|
738 |
val coiter_tacss = |
|
49363 | 739 |
map3 (map oo mk_coiter_like_tac coiter_defs nesting_map_ids) fp_iter_thms pre_map_defs |
49226 | 740 |
ctr_defss; |
49233 | 741 |
val corec_tacss = |
49363 | 742 |
map3 (map oo mk_coiter_like_tac corec_defs nesting_map_ids) fp_rec_thms pre_map_defs |
49233 | 743 |
ctr_defss; |
49212 | 744 |
in |
49276 | 745 |
(map2 (map2 (fn goal => fn tac => |
746 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation)) |
|
49213 | 747 |
goal_coiterss coiter_tacss, |
49276 | 748 |
map2 (map2 (fn goal => fn tac => |
749 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |
|
750 |
|> Local_Defs.unfold lthy @{thms sum_case_if} |> Thm.close_derivation)) |
|
49233 | 751 |
goal_corecss corec_tacss) |
49212 | 752 |
end; |
753 |
||
49266 | 754 |
fun mk_disc_coiter_like_thms [_] = K [] |
755 |
| mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms; |
|
756 |
||
757 |
val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss; |
|
758 |
val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss; |
|
759 |
||
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
760 |
fun mk_sel_coiter_like_thm coiter_like_thm sel0 sel_thm = |
49266 | 761 |
let |
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
762 |
val (domT, ranT) = dest_funT (fastype_of sel0); |
49266 | 763 |
val arg_cong' = |
764 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
|
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
765 |
[NONE, NONE, SOME (certify lthy sel0)] arg_cong |
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
766 |
|> Thm.varifyT_global; |
49266 | 767 |
val sel_thm' = sel_thm RSN (2, trans); |
768 |
in |
|
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
769 |
coiter_like_thm RS arg_cong' RS sel_thm' |
49266 | 770 |
end; |
771 |
||
772 |
val sel_coiter_thmsss = |
|
773 |
map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss; |
|
774 |
val sel_corec_thmsss = |
|
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
775 |
map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss; |
49266 | 776 |
|
49342 | 777 |
val common_notes = |
49367 | 778 |
(if nn > 1 then [(coinductN, [coinduct_thm], [])] (* FIXME: attribs *) else []) |
49342 | 779 |
|> map (fn (thmN, thms, attrs) => |
780 |
((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); |
|
781 |
||
49212 | 782 |
val notes = |
49342 | 783 |
[(coinductN, map single coinduct_thms, []), (* FIXME: attribs *) |
784 |
(coitersN, coiter_thmss, []), |
|
49300 | 785 |
(disc_coitersN, disc_coiter_thmss, []), |
786 |
(sel_coitersN, map flat sel_coiter_thmsss, []), |
|
787 |
(corecsN, corec_thmss, []), |
|
788 |
(disc_corecsN, disc_corec_thmss, []), |
|
789 |
(sel_corecsN, map flat sel_corec_thmsss, [])] |
|
790 |
|> maps (fn (thmN, thmss, attrs) => |
|
49266 | 791 |
map_filter (fn (_, []) => NONE | (b, thms) => |
49300 | 792 |
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
|
793 |
[(thms, [])])) (fp_bs ~~ thmss)); |
49212 | 794 |
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
|
795 |
lthy |> Local_Theory.notes (common_notes @ notes) |> snd |
49212 | 796 |
end; |
797 |
||
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
798 |
fun wrap_types_and_define_iter_likes ((wraps, define_iter_likess), lthy) = |
49370 | 799 |
fold_map2 (curry (op o)) define_iter_likess wraps lthy |>> split_list10 |
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
800 |
|
49204 | 801 |
val lthy' = lthy |
49370 | 802 |
|> fold_map define_ctrs_case_for_type (fp_bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ |
803 |
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_bindingss ~~ |
|
804 |
ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ 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
|
805 |
|>> split_list |> wrap_types_and_define_iter_likes |
49337 | 806 |
|> (if lfp then derive_induct_iter_rec_thms_for_types |
807 |
else derive_coinduct_coiter_corec_thms_for_types); |
|
49167 | 808 |
|
809 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
49208 | 810 |
(if lfp then "" else "co") ^ "datatype")); |
49112 | 811 |
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
|
812 |
timer; lthy' |
49112 | 813 |
end; |
814 |
||
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
815 |
val datatyp = define_datatype (K I) (K I) (K I); |
49297 | 816 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
817 |
val datatype_cmd = define_datatype Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; |
49119 | 818 |
|
49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset
|
819 |
val parse_binding_colon = Parse.binding --| @{keyword ":"}; |
49336 | 820 |
val parse_opt_binding_colon = Scan.optional parse_binding_colon no_binding; |
49119 | 821 |
|
49112 | 822 |
val parse_ctr_arg = |
49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset
|
823 |
@{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} || |
49336 | 824 |
(Parse.typ >> pair no_binding); |
49112 | 825 |
|
49286 | 826 |
val parse_defaults = |
827 |
@{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"}; |
|
828 |
||
49112 | 829 |
val parse_single_spec = |
830 |
Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix -- |
|
49119 | 831 |
(@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding -- |
49286 | 832 |
Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix)); |
49112 | 833 |
|
49278 | 834 |
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec; |
835 |
||
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
836 |
fun parse_datatype_cmd lfp construct = parse_datatype >> datatype_cmd lfp construct; |
49112 | 837 |
|
838 |
end; |