author | blanchet |
Wed, 12 Sep 2012 00:55:11 +0200 | |
changeset 49302 | f5bd87aac224 |
parent 49300 | c707df2e2083 |
child 49308 | 6190b701e4f4 |
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 -> |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
11 |
bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) * |
49297 | 12 |
(binding * typ) list) * (binding * term) list) * mixfix) list) list -> |
13 |
local_theory -> local_theory |
|
49112 | 14 |
end; |
15 |
||
16 |
structure BNF_FP_Sugar : BNF_FP_SUGAR = |
|
17 |
struct |
|
18 |
||
49119 | 19 |
open BNF_Util |
20 |
open BNF_Wrap |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
21 |
open BNF_Def |
49119 | 22 |
open BNF_FP_Util |
23 |
open BNF_LFP |
|
24 |
open BNF_GFP |
|
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
25 |
open BNF_FP_Sugar_Tactics |
49119 | 26 |
|
49129 | 27 |
val caseN = "case"; |
49213 | 28 |
val coitersN = "coiters"; |
29 |
val corecsN = "corecs"; |
|
49266 | 30 |
val disc_coitersN = "disc_coiters"; |
31 |
val disc_corecsN = "disc_corecs"; |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
32 |
val itersN = "iters"; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
33 |
val recsN = "recs"; |
49266 | 34 |
val sel_coitersN = "sel_coiters"; |
35 |
val sel_corecsN = "sel_corecs"; |
|
49129 | 36 |
|
49300 | 37 |
val simp_attrs = @{attributes [simp]}; |
38 |
||
49266 | 39 |
fun split_list11 xs = |
40 |
(map #1 xs, map #2 xs, map #3 xs, map #4 xs, map #5 xs, map #6 xs, map #7 xs, map #8 xs, |
|
41 |
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
|
42 |
|
49217 | 43 |
fun strip_map_type (Type (@{type_name fun}, [T as Type _, T'])) = strip_map_type T' |>> cons T |
44 |
| strip_map_type T = ([], T); |
|
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 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
52 |
fun resort_tfree S (TFree (s, _)) = TFree (s, S); |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
53 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
54 |
fun retype_free T (Free (s, _)) = Free (s, T); |
49199 | 55 |
|
49297 | 56 |
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
|
57 |
|
49275 | 58 |
fun mk_predT T = T --> HOLogic.boolT; |
59 |
||
49234 | 60 |
fun mk_id T = Const (@{const_name id}, T --> T); |
61 |
||
49200 | 62 |
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); |
63 |
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
|
64 |
fun mk_uncurried2_fun f xss = |
49200 | 65 |
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); |
66 |
||
49233 | 67 |
fun tick v f = Term.lambda v (HOLogic.mk_prod (v, f $ v)); |
68 |
||
69 |
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
|
70 |
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
|
71 |
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
|
72 |
end; |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
73 |
|
49124 | 74 |
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters"; |
49119 | 75 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
76 |
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); |
49119 | 77 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
78 |
fun merge_type_args (As, As') = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
79 |
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); |
49119 | 80 |
|
49121 | 81 |
fun type_args_constrained_of (((cAs, _), _), _) = cAs; |
82 |
val type_args_of = map fst o type_args_constrained_of; |
|
49129 | 83 |
fun type_binder_of (((_, b), _), _) = b; |
49181 | 84 |
fun mixfix_of ((_, mx), _) = mx; |
49121 | 85 |
fun ctr_specs_of (_, ctr_specs) = ctr_specs; |
49119 | 86 |
|
49286 | 87 |
fun disc_of ((((disc, _), _), _), _) = disc; |
88 |
fun ctr_of ((((_, ctr), _), _), _) = ctr; |
|
89 |
fun args_of (((_, args), _), _) = args; |
|
90 |
fun defaults_of ((_, ds), _) = ds; |
|
49181 | 91 |
fun ctr_mixfix_of (_, mx) = mx; |
49119 | 92 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
93 |
fun define_datatype prepare_constraint prepare_typ prepare_term lfp (no_dests, specs) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
94 |
no_defs_lthy0 = |
49112 | 95 |
let |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
96 |
(* TODO: sanity checks on arguments *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
97 |
|
49286 | 98 |
val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes" |
49278 | 99 |
else (); |
100 |
||
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
101 |
val N = length specs; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
102 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
103 |
fun prepare_type_arg (ty, c) = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
104 |
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
|
105 |
TFree (s, prepare_constraint no_defs_lthy0 c) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
106 |
end; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
107 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
108 |
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
|
109 |
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
|
110 |
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; |
49119 | 111 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
112 |
val ((Bs, Cs), no_defs_lthy) = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
113 |
no_defs_lthy0 |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
114 |
|> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
115 |
|> mk_TFrees N |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
116 |
||>> mk_TFrees N; |
49119 | 117 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
118 |
(* TODO: cleaner handling of fake contexts, without "background_theory" *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
119 |
(*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
|
120 |
locale and shadows an existing global type*) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
121 |
val fake_thy = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
122 |
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
123 |
(type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
124 |
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; |
49119 | 125 |
|
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
|
126 |
fun mk_fake_T b = |
49121 | 127 |
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
|
128 |
unsorted_As); |
49121 | 129 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
130 |
val fp_bs = map type_binder_of specs; |
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
131 |
val fake_Ts = map mk_fake_T fp_bs; |
49121 | 132 |
|
49181 | 133 |
val mixfixes = map mixfix_of specs; |
49119 | 134 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
135 |
val _ = (case duplicates Binding.eq_name fp_bs of [] => () |
49119 | 136 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
137 |
||
49121 | 138 |
val ctr_specss = map ctr_specs_of specs; |
49119 | 139 |
|
49129 | 140 |
val disc_binderss = map (map disc_of) ctr_specss; |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
141 |
val ctr_binderss = |
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
142 |
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
|
143 |
fp_bs ctr_specss; |
49121 | 144 |
val ctr_argsss = map (map args_of) ctr_specss; |
49181 | 145 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; |
49119 | 146 |
|
49129 | 147 |
val sel_bindersss = map (map (map fst)) ctr_argsss; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
148 |
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
49286 | 149 |
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; |
150 |
||
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
151 |
val (Ass as As :: _) :: fake_ctr_Tsss = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
152 |
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
|
153 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
154 |
val _ = (case duplicates (op =) unsorted_As of [] => () |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
155 |
| A :: _ => error ("Duplicate type parameter " ^ |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
156 |
quote (Syntax.string_of_typ no_defs_lthy A))); |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
157 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
158 |
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
|
159 |
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of |
49165 | 160 |
[] => () |
161 |
| A' :: _ => error ("Extra type variables on rhs: " ^ |
|
49204 | 162 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); |
49165 | 163 |
|
49204 | 164 |
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) = |
49146 | 165 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ |
166 |
quote (Syntax.string_of_typ fake_lthy T))) |
|
49204 | 167 |
| eq_fpT _ _ = false; |
49146 | 168 |
|
49204 | 169 |
fun freeze_fp (T as Type (s, Us)) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
170 |
(case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us) | j => nth Bs j) |
49204 | 171 |
| freeze_fp T = T; |
49121 | 172 |
|
49297 | 173 |
val ctr_TsssBs = map (map (map freeze_fp)) fake_ctr_Tsss; |
174 |
val ctr_sum_prod_TsBs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssBs; |
|
49119 | 175 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
176 |
val fp_eqs = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
177 |
map dest_TFree Bs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsBs; |
49121 | 178 |
|
49226 | 179 |
val (pre_bnfs, ((unfs0, flds0, fp_iters0, fp_recs0, unf_flds, fld_unfs, fld_injects, |
49207 | 180 |
fp_iter_thms, fp_rec_thms), lthy)) = |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
181 |
fp_bnf (if lfp then bnf_lfp else bnf_gfp) fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
182 |
no_defs_lthy0; |
49121 | 183 |
|
49226 | 184 |
val add_nested_bnf_names = |
185 |
let |
|
186 |
fun add (Type (s, Ts)) ss = |
|
187 |
let val (needs, ss') = fold_map add Ts ss in |
|
188 |
if exists I needs then (true, insert (op =) s ss') else (false, ss') |
|
189 |
end |
|
190 |
| add T ss = (member (op =) As T, ss); |
|
191 |
in snd oo add end; |
|
192 |
||
193 |
val nested_bnfs = |
|
49297 | 194 |
map_filter (bnf_of lthy) (fold (fold (fold add_nested_bnf_names)) ctr_TsssBs []); |
49226 | 195 |
|
49167 | 196 |
val timer = time (Timer.startRealTimer ()); |
197 |
||
49176 | 198 |
fun mk_unf_or_fld get_T Ts t = |
199 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
49124 | 200 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
49121 | 201 |
end; |
49119 | 202 |
|
49126 | 203 |
val mk_unf = mk_unf_or_fld domain_type; |
204 |
val mk_fld = mk_unf_or_fld range_type; |
|
49121 | 205 |
|
49203 | 206 |
val unfs = map (mk_unf As) unfs0; |
207 |
val flds = map (mk_fld As) flds0; |
|
49124 | 208 |
|
49201 | 209 |
val fpTs = map (domain_type o fastype_of) unfs; |
49204 | 210 |
|
49297 | 211 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Bs ~~ fpTs)))) ctr_TsssBs; |
49203 | 212 |
val ns = map length ctr_Tsss; |
49212 | 213 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 214 |
val mss = map (map length) ctr_Tsss; |
215 |
val Css = map2 replicate ns Cs; |
|
216 |
||
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
217 |
fun mk_iter_like Ts Us t = |
49121 | 218 |
let |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
219 |
val (binders, body) = strip_type (fastype_of t); |
49210 | 220 |
val (f_Us, prebody) = split_last binders; |
221 |
val Type (_, Ts0) = if lfp then prebody else body; |
|
222 |
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); |
|
49176 | 223 |
in |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
224 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
49176 | 225 |
end; |
226 |
||
49210 | 227 |
val fp_iters as fp_iter1 :: _ = map (mk_iter_like As Cs) fp_iters0; |
228 |
val fp_recs as fp_rec1 :: _ = map (mk_iter_like As Cs) fp_recs0; |
|
229 |
||
49212 | 230 |
val fp_iter_fun_Ts = fst (split_last (binder_types (fastype_of fp_iter1))); |
231 |
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of fp_rec1))); |
|
49204 | 232 |
|
49256 | 233 |
val ((iter_only as (gss, _, _), rec_only as (hss, _, _)), |
49276 | 234 |
(zs, cs, cpss, coiter_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))) = |
49208 | 235 |
if lfp then |
236 |
let |
|
237 |
val y_Tsss = |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
238 |
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) |
49212 | 239 |
ns mss fp_iter_fun_Ts; |
49208 | 240 |
val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css; |
241 |
||
242 |
val ((gss, ysss), _) = |
|
243 |
lthy |
|
244 |
|> mk_Freess "f" g_Tss |
|
245 |
||>> mk_Freesss "x" y_Tsss; |
|
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
246 |
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
|
247 |
|
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
248 |
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
|
249 |
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
|
250 |
| dest_rec_prodT T = [T]; |
49204 | 251 |
|
49208 | 252 |
val z_Tssss = |
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
253 |
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
|
254 |
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; |
49208 | 255 |
val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css; |
49204 | 256 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
257 |
val hss = map2 (map2 retype_free) h_Tss gss; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
258 |
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
|
259 |
val (zssss_tl, _) = |
49208 | 260 |
lthy |
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
261 |
|> 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
|
262 |
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; |
49210 | 263 |
in |
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
264 |
(((gss, g_Tss, yssss), (hss, h_Tss, zssss)), |
49276 | 265 |
([], [], [], (([], []), ([], [])), (([], []), ([], [])))) |
49210 | 266 |
end |
49208 | 267 |
else |
49210 | 268 |
let |
49221
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
269 |
(*avoid "'a itself" arguments in coiterators and corecursors*) |
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
270 |
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
|
271 |
|
49275 | 272 |
val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_predT) ns Cs; |
273 |
||
49276 | 274 |
fun zip_predss_getterss qss fss = maps (op @) (qss ~~ fss); |
49211 | 275 |
|
49276 | 276 |
fun zip_preds_predsss_gettersss [] [qss] [fss] = zip_predss_getterss qss fss |
277 |
| zip_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = |
|
278 |
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
|
279 |
|
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
280 |
fun mk_types maybe_dest_sumT fun_Ts = |
49212 | 281 |
let |
282 |
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
|
283 |
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; |
49275 | 284 |
val f_Tssss = |
285 |
map3 (fn C => map2 (map (map (curry (op -->) C) o maybe_dest_sumT) oo dest_tupleT)) |
|
286 |
Cs mss' f_prod_Tss; |
|
287 |
val q_Tssss = |
|
288 |
map (map (map (fn [_] => [] | [_, C] => [mk_predT (domain_type C)]))) f_Tssss; |
|
49276 | 289 |
val pf_Tss = map3 zip_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; |
49275 | 290 |
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; |
49176 | 291 |
|
49275 | 292 |
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_iter_fun_Ts; |
49211 | 293 |
|
49275 | 294 |
val ((((Free (z, _), cs), pss), gssss), _) = |
49210 | 295 |
lthy |
49233 | 296 |
|> yield_singleton (mk_Frees "z") dummyT |
297 |
||>> mk_Frees "a" Cs |
|
49211 | 298 |
||>> mk_Freess "p" p_Tss |
49275 | 299 |
||>> mk_Freessss "g" g_Tssss; |
300 |
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
|
301 |
|
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
302 |
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
|
303 |
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
|
304 |
| dest_corec_sumT T = [T]; |
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
305 |
|
49275 | 306 |
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; |
49210 | 307 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
308 |
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; |
49275 | 309 |
val ((sssss, hssss_tl), _) = |
310 |
lthy |
|
311 |
|> mk_Freessss "q" s_Tssss |
|
312 |
||>> mk_Freessss "h" (map (map (map tl)) h_Tssss); |
|
313 |
val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl; |
|
49211 | 314 |
|
49212 | 315 |
val cpss = map2 (fn c => map (fn p => p $ c)) cs pss; |
316 |
||
49276 | 317 |
fun mk_preds_getters_join [] [cf] = cf |
318 |
| mk_preds_getters_join [cq] [cf, cf'] = |
|
319 |
mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf'); |
|
320 |
||
49275 | 321 |
fun mk_terms qssss fssss = |
49212 | 322 |
let |
49276 | 323 |
val pfss = map3 zip_preds_predsss_gettersss pss qssss fssss; |
49275 | 324 |
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
|
325 |
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; |
49276 | 326 |
val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss; |
327 |
in (pfss, cqfsss) end; |
|
49210 | 328 |
in |
49212 | 329 |
((([], [], []), ([], [], [])), |
49275 | 330 |
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), |
331 |
(mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss)))) |
|
49210 | 332 |
end; |
333 |
||
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
334 |
fun define_ctrs_case_for_type ((((((((((((((((((fp_b, fpT), C), fld), unf), fp_iter), fp_rec), |
49212 | 335 |
fld_unf), unf_fld), fld_inject), n), ks), ms), ctr_binders), ctr_mixfixes), ctr_Tss), |
49286 | 336 |
disc_binders), sel_binderss), raw_sel_defaultss) no_defs_lthy = |
49176 | 337 |
let |
49201 | 338 |
val unfT = domain_type (fastype_of fld); |
49210 | 339 |
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
|
340 |
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
|
341 |
val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss; |
49119 | 342 |
|
49176 | 343 |
val ((((u, v), fs), xss), _) = |
49204 | 344 |
no_defs_lthy |
49201 | 345 |
|> yield_singleton (mk_Frees "u") unfT |
346 |
||>> yield_singleton (mk_Frees "v") fpT |
|
49176 | 347 |
||>> mk_Frees "f" case_Ts |
49124 | 348 |
||>> mk_Freess "x" ctr_Tss; |
49121 | 349 |
|
49129 | 350 |
val ctr_rhss = |
49256 | 351 |
map2 (fn k => fn xs => fold_rev Term.lambda xs (fld $ |
352 |
mk_InN_balanced ctr_sum_prod_T n (HOLogic.mk_tuple xs) k)) ks xss; |
|
49121 | 353 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
354 |
val case_binder = Binding.suffix_name ("_" ^ caseN) fp_b; |
49129 | 355 |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
356 |
val case_rhs = |
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
357 |
fold_rev Term.lambda (fs @ [v]) |
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
358 |
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (unf $ v)); |
49129 | 359 |
|
49201 | 360 |
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 361 |
|> 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
|
362 |
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) |
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
363 |
(case_binder :: ctr_binders) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) |
49121 | 364 |
||> `Local_Theory.restore; |
365 |
||
366 |
(*transforms defined frees into consts (and more)*) |
|
367 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
368 |
||
369 |
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
|
370 |
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
|
371 |
|
49203 | 372 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
373 |
val casex0 = Morphism.term phi raw_case; |
|
374 |
||
375 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 376 |
|
49135 | 377 |
fun exhaust_tac {context = ctxt, ...} = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
378 |
let |
49135 | 379 |
val fld_iff_unf_thm = |
380 |
let |
|
381 |
val goal = |
|
382 |
fold_rev Logic.all [u, v] |
|
383 |
(mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u))); |
|
384 |
in |
|
385 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
49201 | 386 |
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unfT, fpT]) |
49176 | 387 |
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) |
49135 | 388 |
|> Thm.close_derivation |
389 |
|> Morphism.thm phi |
|
390 |
end; |
|
391 |
||
392 |
val sumEN_thm' = |
|
393 |
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
|
394 |
(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
|
395 |
(mk_sumEN_balanced n)) |
49135 | 396 |
|> Morphism.thm phi; |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
397 |
in |
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents:
49157
diff
changeset
|
398 |
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
|
399 |
end; |
49121 | 400 |
|
49126 | 401 |
val inject_tacss = |
49205 | 402 |
map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} => |
403 |
mk_inject_tac ctxt ctr_def fld_inject]) ms ctr_defs; |
|
49126 | 404 |
|
49127 | 405 |
val half_distinct_tacss = |
406 |
map (map (fn (def, def') => fn {context = ctxt, ...} => |
|
407 |
mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs); |
|
408 |
||
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
409 |
val case_tacs = |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
410 |
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
|
411 |
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; |
49121 | 412 |
|
413 |
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
|
414 |
|
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
415 |
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
|
416 |
let |
49208 | 417 |
val fpT_to_C = fpT --> C; |
49199 | 418 |
|
49215 | 419 |
fun generate_iter_like (suf, fp_iter_like, (fss, f_Tss, xssss)) = |
420 |
let |
|
421 |
val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C; |
|
422 |
||
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
423 |
val binder = Binding.suffix_name ("_" ^ suf) fp_b; |
49199 | 424 |
|
49215 | 425 |
val spec = |
426 |
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binder, res_T)), |
|
427 |
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
|
428 |
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); |
49215 | 429 |
in (binder, spec) end; |
49199 | 430 |
|
49300 | 431 |
val iter_like_infos = |
49215 | 432 |
[(iterN, fp_iter, iter_only), |
433 |
(recN, fp_rec, rec_only)]; |
|
434 |
||
49300 | 435 |
val (binders, specs) = map generate_iter_like iter_like_infos |> split_list; |
49215 | 436 |
|
437 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49201 | 438 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
49199 | 439 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
49215 | 440 |
#>> apsnd snd) binders specs |
49199 | 441 |
||> `Local_Theory.restore; |
49201 | 442 |
|
443 |
(*transforms defined frees into consts (and more)*) |
|
444 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
445 |
||
49215 | 446 |
val [iter_def, rec_def] = map (Morphism.thm phi) defs; |
49201 | 447 |
|
49215 | 448 |
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
|
449 |
in |
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
450 |
((ctrs, selss0, iter, recx, v, xss, ctr_defs, discIs, sel_thmss, iter_def, rec_def), |
49266 | 451 |
lthy) |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
452 |
end; |
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
453 |
|
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
454 |
fun define_coiter_corec ((selss0, discIs, sel_thmss), no_defs_lthy) = |
49210 | 455 |
let |
456 |
val B_to_fpT = C --> fpT; |
|
49211 | 457 |
|
49276 | 458 |
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = |
459 |
Term.lambda c (mk_IfN sum_prod_T cps |
|
460 |
(map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n))); |
|
49275 | 461 |
|
49276 | 462 |
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
|
463 |
pf_Tss))) = |
49211 | 464 |
let |
465 |
val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT; |
|
49210 | 466 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
467 |
val binder = Binding.suffix_name ("_" ^ suf) fp_b; |
49210 | 468 |
|
49211 | 469 |
val spec = |
49212 | 470 |
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binder, res_T)), |
49211 | 471 |
Term.list_comb (fp_iter_like, |
49276 | 472 |
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); |
49211 | 473 |
in (binder, spec) end; |
49210 | 474 |
|
49300 | 475 |
val coiter_like_infos = |
49215 | 476 |
[(coiterN, fp_iter, coiter_only), |
477 |
(corecN, fp_rec, corec_only)]; |
|
49212 | 478 |
|
49300 | 479 |
val (binders, specs) = map generate_coiter_like coiter_like_infos |> split_list; |
49211 | 480 |
|
481 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49210 | 482 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
483 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
|
49211 | 484 |
#>> apsnd snd) binders specs |
49210 | 485 |
||> `Local_Theory.restore; |
486 |
||
487 |
(*transforms defined frees into consts (and more)*) |
|
488 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
489 |
||
49211 | 490 |
val [coiter_def, corec_def] = map (Morphism.thm phi) defs; |
49210 | 491 |
|
49211 | 492 |
val [coiter, corec] = map (mk_iter_like As Cs o Morphism.term phi) csts; |
49210 | 493 |
in |
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
494 |
((ctrs, selss0, coiter, corec, v, xss, ctr_defs, discIs, sel_thmss, coiter_def, |
49266 | 495 |
corec_def), lthy) |
49210 | 496 |
end; |
49286 | 497 |
|
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
498 |
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
|
499 |
let val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss in |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
500 |
wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_binders, (sel_binderss, |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
501 |
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
|
502 |
end; |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
503 |
|
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
504 |
val define_iter_likes = if lfp then define_iter_rec else define_coiter_corec; |
49119 | 505 |
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
|
506 |
((wrap, define_iter_likes), lthy') |
49119 | 507 |
end; |
49167 | 508 |
|
49226 | 509 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
510 |
val map_ids = map map_id_of_bnf nested_bnfs; |
49226 | 511 |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
512 |
fun mk_map Ts Us t = |
49217 | 513 |
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
|
514 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
515 |
end; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
516 |
|
49234 | 517 |
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = |
518 |
let |
|
49236 | 519 |
val map0 = map_of_bnf (the (bnf_of lthy s)); |
49234 | 520 |
val mapx = mk_map Ts Us map0; |
521 |
val TUs = map dest_funT (fst (split_last (fst (strip_map_type (fastype_of mapx))))); |
|
522 |
val args = map build_arg TUs; |
|
523 |
in Term.list_comb (mapx, args) end; |
|
524 |
||
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
525 |
fun derive_iter_rec_thms_for_types ((ctrss, _, iters, recs, vs, xsss, ctr_defss, _, _, iter_defs, |
49266 | 526 |
rec_defs), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
527 |
let |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
528 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
49212 | 529 |
val giters = map (lists_bmoc gss) iters; |
530 |
val hrecs = map (lists_bmoc hss) recs; |
|
49201 | 531 |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
532 |
val (iter_thmss, rec_thmss) = |
49207 | 533 |
let |
49212 | 534 |
fun mk_goal_iter_like fss fiter_like xctr f xs fxs = |
49207 | 535 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
49212 | 536 |
(mk_Trueprop_eq (fiter_like $ xctr, Term.list_comb (f, fxs))); |
49204 | 537 |
|
49234 | 538 |
fun build_call fiter_likes maybe_tick (T, U) = |
539 |
if T = U then |
|
540 |
mk_id T |
|
541 |
else |
|
542 |
(case find_index (curry (op =) T) fpTs of |
|
543 |
~1 => build_map (build_call fiter_likes maybe_tick) T U |
|
544 |
| j => maybe_tick (nth vs j) (nth fiter_likes j)); |
|
49233 | 545 |
|
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
546 |
fun mk_U maybe_mk_prodT = |
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
547 |
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
|
548 |
|
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
549 |
fun repair_calls fiter_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) = |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
550 |
if member (op =) fpTs T then |
49233 | 551 |
maybe_cons x [build_call fiter_likes (K I) (T, mk_U (K I) T) $ x] |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
552 |
else if exists_subtype (member (op =) fpTs) T then |
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
553 |
[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
|
554 |
else |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
555 |
[x]; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
556 |
|
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
557 |
val gxsss = map (map (maps (repair_calls giters (K I) (K I) (K I)))) xsss; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
558 |
val hxsss = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
559 |
map (map (maps (repair_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; |
49204 | 560 |
|
49212 | 561 |
val goal_iterss = map5 (map4 o mk_goal_iter_like gss) giters xctrss gss xsss gxsss; |
562 |
val goal_recss = map5 (map4 o mk_goal_iter_like hss) hrecs xctrss hss xsss hxsss; |
|
49204 | 563 |
|
49203 | 564 |
val iter_tacss = |
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
565 |
map2 (map o mk_iter_like_tac pre_map_defs map_ids iter_defs) fp_iter_thms ctr_defss; |
49203 | 566 |
val rec_tacss = |
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
567 |
map2 (map o mk_iter_like_tac pre_map_defs map_ids rec_defs) fp_rec_thms ctr_defss; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
568 |
in |
49276 | 569 |
(map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
49205 | 570 |
goal_iterss iter_tacss, |
49276 | 571 |
map2 (map2 (fn goal => fn tac => Skip_Proof.prove lthy [] [] goal (tac o #context))) |
49205 | 572 |
goal_recss rec_tacss) |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
573 |
end; |
49201 | 574 |
|
49226 | 575 |
val notes = |
49300 | 576 |
[(itersN, iter_thmss, simp_attrs), |
577 |
(recsN, rec_thmss, Code.add_default_eqn_attrib :: simp_attrs)] |
|
578 |
|> maps (fn (thmN, thmss, attrs) => |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
579 |
map2 (fn b => fn thms => |
49300 | 580 |
((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
|
581 |
[(thms, [])])) fp_bs thmss); |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
582 |
in |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
583 |
lthy |> Local_Theory.notes notes |> snd |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
584 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
585 |
|
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
586 |
fun derive_coiter_corec_thms_for_types ((ctrss, selsss, coiters, corecs, vs, _, ctr_defss, |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
587 |
discIss, sel_thmsss, coiter_defs, corec_defs), lthy) = |
49212 | 588 |
let |
49233 | 589 |
val z = the_single zs; |
590 |
||
49212 | 591 |
val gcoiters = map (lists_bmoc pgss) coiters; |
592 |
val hcorecs = map (lists_bmoc phss) corecs; |
|
593 |
||
594 |
val (coiter_thmss, corec_thmss) = |
|
595 |
let |
|
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
596 |
fun mk_goal_cond pos = HOLogic.mk_Trueprop o (not pos ? HOLogic.mk_not); |
49212 | 597 |
|
49276 | 598 |
fun mk_goal_coiter_like pfss c cps fcoiter_like n k ctr m cfs' = |
49212 | 599 |
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
|
600 |
(Logic.list_implies (seq_conds mk_goal_cond n k cps, |
49276 | 601 |
mk_Trueprop_eq (fcoiter_like $ c, Term.list_comb (ctr, take m cfs')))); |
49212 | 602 |
|
49234 | 603 |
fun build_call fiter_likes maybe_tack (T, U) = |
604 |
if T = U then |
|
605 |
mk_id T |
|
606 |
else |
|
607 |
(case find_index (curry (op =) U) fpTs of |
|
608 |
~1 => build_map (build_call fiter_likes maybe_tack) T U |
|
609 |
| j => maybe_tack (nth cs j, nth vs j) (nth fiter_likes j)); |
|
49233 | 610 |
|
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
611 |
fun mk_U maybe_mk_sumT = |
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
612 |
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); |
49212 | 613 |
|
49276 | 614 |
fun repair_calls fiter_likes maybe_mk_sumT maybe_tack cqf = |
615 |
let val T = fastype_of cqf in |
|
616 |
if exists_subtype (member (op =) Cs) T then |
|
617 |
build_call fiter_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf |
|
618 |
else |
|
619 |
cqf |
|
620 |
end; |
|
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
621 |
|
49276 | 622 |
val crgsss' = map (map (map (repair_calls gcoiters (K I) (K I)))) crgsss; |
623 |
val cshsss' = map (map (map (repair_calls hcorecs (curry mk_sumT) (tack z)))) cshsss; |
|
49212 | 624 |
|
625 |
val goal_coiterss = |
|
49276 | 626 |
map8 (map4 oooo mk_goal_coiter_like pgss) cs cpss gcoiters ns kss ctrss mss crgsss'; |
49233 | 627 |
val goal_corecss = |
49276 | 628 |
map8 (map4 oooo mk_goal_coiter_like phss) cs cpss hcorecs ns kss ctrss mss cshsss'; |
49213 | 629 |
|
630 |
val coiter_tacss = |
|
49229
d5717b5e2217
use map_id, not map_id', to allow better composition
blanchet
parents:
49226
diff
changeset
|
631 |
map3 (map oo mk_coiter_like_tac coiter_defs map_ids) fp_iter_thms pre_map_defs |
49226 | 632 |
ctr_defss; |
49233 | 633 |
val corec_tacss = |
634 |
map3 (map oo mk_coiter_like_tac corec_defs map_ids) fp_rec_thms pre_map_defs |
|
635 |
ctr_defss; |
|
49212 | 636 |
in |
49276 | 637 |
(map2 (map2 (fn goal => fn tac => |
638 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation)) |
|
49213 | 639 |
goal_coiterss coiter_tacss, |
49276 | 640 |
map2 (map2 (fn goal => fn tac => |
641 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |
|
642 |
|> Local_Defs.unfold lthy @{thms sum_case_if} |> Thm.close_derivation)) |
|
49233 | 643 |
goal_corecss corec_tacss) |
49212 | 644 |
end; |
645 |
||
49266 | 646 |
fun mk_disc_coiter_like_thms [_] = K [] |
647 |
| mk_disc_coiter_like_thms thms = map2 (curry (op RS)) thms; |
|
648 |
||
649 |
val disc_coiter_thmss = map2 mk_disc_coiter_like_thms coiter_thmss discIss; |
|
650 |
val disc_corec_thmss = map2 mk_disc_coiter_like_thms corec_thmss discIss; |
|
651 |
||
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
652 |
fun mk_sel_coiter_like_thm coiter_like_thm sel0 sel_thm = |
49266 | 653 |
let |
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
654 |
val (domT, ranT) = dest_funT (fastype_of sel0); |
49266 | 655 |
val arg_cong' = |
656 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
|
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
657 |
[NONE, NONE, SOME (certify lthy sel0)] arg_cong |
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
658 |
|> Thm.varifyT_global; |
49266 | 659 |
val sel_thm' = sel_thm RSN (2, trans); |
660 |
in |
|
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
661 |
coiter_like_thm RS arg_cong' RS sel_thm' |
49266 | 662 |
end; |
663 |
||
664 |
val sel_coiter_thmsss = |
|
665 |
map3 (map3 (map2 o mk_sel_coiter_like_thm)) coiter_thmss selsss sel_thmsss; |
|
666 |
val sel_corec_thmsss = |
|
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
667 |
map3 (map3 (map2 o mk_sel_coiter_like_thm)) corec_thmss selsss sel_thmsss; |
49266 | 668 |
|
49212 | 669 |
val notes = |
49300 | 670 |
[(coitersN, coiter_thmss, []), |
671 |
(disc_coitersN, disc_coiter_thmss, []), |
|
672 |
(sel_coitersN, map flat sel_coiter_thmsss, []), |
|
673 |
(corecsN, corec_thmss, []), |
|
674 |
(disc_corecsN, disc_corec_thmss, []), |
|
675 |
(sel_corecsN, map flat sel_corec_thmsss, [])] |
|
676 |
|> maps (fn (thmN, thmss, attrs) => |
|
49266 | 677 |
map_filter (fn (_, []) => NONE | (b, thms) => |
49300 | 678 |
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
|
679 |
[(thms, [])])) (fp_bs ~~ thmss)); |
49212 | 680 |
in |
49230 | 681 |
lthy |> Local_Theory.notes notes |> snd |
49212 | 682 |
end; |
683 |
||
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
684 |
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
|
685 |
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
|
686 |
|
49204 | 687 |
val lthy' = lthy |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
688 |
|> fold_map define_ctrs_case_for_type (fp_bs ~~ fpTs ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ |
49212 | 689 |
fp_recs ~~ fld_unfs ~~ unf_flds ~~ fld_injects ~~ ns ~~ kss ~~ mss ~~ ctr_binderss ~~ |
49286 | 690 |
ctr_mixfixess ~~ ctr_Tsss ~~ disc_binderss ~~ sel_bindersss ~~ raw_sel_defaultsss) |
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
691 |
|>> split_list |> wrap_types_and_define_iter_likes |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
692 |
|> (if lfp then derive_iter_rec_thms_for_types else derive_coiter_corec_thms_for_types); |
49167 | 693 |
|
694 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
49208 | 695 |
(if lfp then "" else "co") ^ "datatype")); |
49112 | 696 |
in |
49204 | 697 |
(timer; lthy') |
49112 | 698 |
end; |
699 |
||
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
700 |
val datatyp = define_datatype (K I) (K I) (K I); |
49297 | 701 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
702 |
val datatype_cmd = define_datatype Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; |
49119 | 703 |
|
49277 | 704 |
val parse_opt_binding_colon = Scan.optional (Parse.binding --| @{keyword ":"}) no_binder |
49119 | 705 |
|
49112 | 706 |
val parse_ctr_arg = |
49277 | 707 |
@{keyword "("} |-- parse_opt_binding_colon -- Parse.typ --| @{keyword ")"} || |
49129 | 708 |
(Parse.typ >> pair no_binder); |
49112 | 709 |
|
49286 | 710 |
val parse_defaults = |
711 |
@{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"}; |
|
712 |
||
49112 | 713 |
val parse_single_spec = |
714 |
Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix -- |
|
49119 | 715 |
(@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding -- |
49286 | 716 |
Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix)); |
49112 | 717 |
|
49278 | 718 |
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec; |
719 |
||
49112 | 720 |
val _ = |
721 |
Outer_Syntax.local_theory @{command_spec "data"} "define BNF-based inductive datatypes" |
|
49278 | 722 |
(parse_datatype >> datatype_cmd true); |
49112 | 723 |
|
724 |
val _ = |
|
725 |
Outer_Syntax.local_theory @{command_spec "codata"} "define BNF-based coinductive datatypes" |
|
49278 | 726 |
(parse_datatype >> datatype_cmd false); |
49112 | 727 |
|
728 |
end; |