author | blanchet |
Wed, 03 Oct 2012 22:07:26 +0200 | |
changeset 49693 | 393d7242adaf |
parent 49683 | 78a3d5006cf1 |
child 50170 | 8155e280f239 |
permissions | -rw-r--r-- |
49636 | 1 |
(* Title: HOL/BNF/Tools/bnf_fp_def_sugar.ML |
49112 | 2 |
Author: Jasmin Blanchette, TU Muenchen |
3 |
Copyright 2012 |
|
4 |
||
49389 | 5 |
Sugared datatype and codatatype constructions. |
49112 | 6 |
*) |
7 |
||
49636 | 8 |
signature BNF_FP_DEF_SUGAR = |
49112 | 9 |
sig |
49536 | 10 |
val datatypes: 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 -> |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
12 |
BNF_Def.BNF list -> local_theory -> BNF_FP.fp_result * local_theory) -> |
49633 | 13 |
(bool * bool) * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) * |
49297 | 14 |
(binding * typ) list) * (binding * term) list) * mixfix) list) list -> |
15 |
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
|
16 |
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
|
17 |
(mixfix list -> (string * sort) list option -> binding list -> typ list * typ list list -> |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
18 |
BNF_Def.BNF list -> local_theory -> BNF_FP.fp_result * 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
|
19 |
(local_theory -> local_theory) parser |
49112 | 20 |
end; |
21 |
||
49636 | 22 |
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = |
49112 | 23 |
struct |
24 |
||
49119 | 25 |
open BNF_Util |
26 |
open BNF_Wrap |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
27 |
open BNF_Def |
49457 | 28 |
open BNF_FP |
49636 | 29 |
open BNF_FP_Def_Sugar_Tactics |
49119 | 30 |
|
49622 | 31 |
(* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A") *) |
32 |
fun quasi_unambiguous_case_names names = |
|
33 |
let |
|
34 |
val ps = map (`Long_Name.base_name) names; |
|
35 |
val dups = Library.duplicates (op =) (map fst ps); |
|
36 |
fun underscore s = |
|
37 |
let val ss = space_explode Long_Name.separator s in |
|
38 |
space_implode "_" (drop (length ss - 2) ss) |
|
39 |
end; |
|
40 |
in |
|
41 |
map (fn (base, full) => if member (op =) dups base then underscore full else base) ps |
|
42 |
end; |
|
43 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
44 |
val mp_conj = @{thm mp_conj}; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
45 |
|
49300 | 46 |
val simp_attrs = @{attributes [simp]}; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
47 |
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; |
49300 | 48 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
49 |
fun split_list4 xs = (map #1 xs, map #2 xs, map #3 xs, map #4 xs); |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
50 |
|
49342 | 51 |
fun resort_tfree S (TFree (s, _)) = TFree (s, S); |
52 |
||
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
53 |
fun typ_subst inst (T as Type (s, Ts)) = |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
54 |
(case AList.lookup (op =) inst T of |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
55 |
NONE => Type (s, map (typ_subst inst) Ts) |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
56 |
| SOME T' => T') |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
57 |
| typ_subst inst T = the_default T (AList.lookup (op =) inst T); |
49205 | 58 |
|
49583 | 59 |
fun variant_types ss Ss ctxt = |
60 |
let |
|
61 |
val (tfrees, _) = |
|
62 |
fold_map2 (fn s => fn S => Name.variant s #> apfst (rpair S)) ss Ss (Variable.names_of ctxt); |
|
63 |
val ctxt' = fold (Variable.declare_constraints o Logic.mk_type o TFree) tfrees ctxt; |
|
64 |
in (tfrees, ctxt') end; |
|
65 |
||
49297 | 66 |
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
|
67 |
|
49200 | 68 |
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); |
69 |
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs; |
|
70 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
71 |
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
72 |
Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1)); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
73 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
74 |
fun flip_rels lthy n thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
75 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
76 |
val Rs = Term.add_vars (prop_of thm) []; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
77 |
val Rs' = rev (drop (length Rs - n) Rs); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
78 |
val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs'; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
79 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
80 |
Drule.cterm_instantiate cRs thm |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
81 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
82 |
|
49536 | 83 |
fun mk_ctor_or_dtor get_T Ts t = |
84 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
85 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
|
86 |
end; |
|
87 |
||
88 |
val mk_ctor = mk_ctor_or_dtor range_type; |
|
89 |
val mk_dtor = mk_ctor_or_dtor domain_type; |
|
90 |
||
91 |
fun mk_rec_like lfp Ts Us t = |
|
92 |
let |
|
93 |
val (bindings, body) = strip_type (fastype_of t); |
|
94 |
val (f_Us, prebody) = split_last bindings; |
|
95 |
val Type (_, Ts0) = if lfp then prebody else body; |
|
96 |
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); |
|
97 |
in |
|
98 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
|
99 |
end; |
|
100 |
||
101 |
fun mk_map live Ts Us t = |
|
102 |
let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) |>> List.last in |
|
103 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
|
104 |
end; |
|
105 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
106 |
fun mk_rel live Ts Us t = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
107 |
let val [Type (_, Ts0), Type (_, Us0)] = binder_types (snd (strip_typeN live (fastype_of t))) in |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
108 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
109 |
end; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
110 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
111 |
fun liveness_of_fp_bnf n bnf = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
112 |
(case T_of_bnf bnf of |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
113 |
Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
114 |
| _ => replicate n false); |
49536 | 115 |
|
49124 | 116 |
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters"; |
49119 | 117 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
118 |
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); |
49119 | 119 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
120 |
fun merge_type_args (As, As') = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
121 |
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); |
49119 | 122 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
123 |
fun reassoc_conjs thm = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
124 |
reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]}) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
125 |
handle THM _ => thm; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
126 |
|
49121 | 127 |
fun type_args_constrained_of (((cAs, _), _), _) = cAs; |
49336 | 128 |
fun type_binding_of (((_, b), _), _) = b; |
49181 | 129 |
fun mixfix_of ((_, mx), _) = mx; |
49121 | 130 |
fun ctr_specs_of (_, ctr_specs) = ctr_specs; |
49119 | 131 |
|
49286 | 132 |
fun disc_of ((((disc, _), _), _), _) = disc; |
133 |
fun ctr_of ((((_, ctr), _), _), _) = ctr; |
|
134 |
fun args_of (((_, args), _), _) = args; |
|
135 |
fun defaults_of ((_, ds), _) = ds; |
|
49181 | 136 |
fun ctr_mixfix_of (_, mx) = mx; |
49119 | 137 |
|
49633 | 138 |
fun define_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp |
139 |
(wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 = |
|
49112 | 140 |
let |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
141 |
(* TODO: sanity checks on arguments *) |
49478 | 142 |
(* TODO: integration with function package ("size") *) |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
143 |
|
49286 | 144 |
val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes" |
49278 | 145 |
else (); |
146 |
||
49633 | 147 |
fun qualify mandatory fp_b_name = |
148 |
Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix); |
|
149 |
||
49367 | 150 |
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
|
151 |
val fp_bs = map type_binding_of specs; |
49498 | 152 |
val fp_b_names = map Binding.name_of fp_bs; |
153 |
val fp_common_name = mk_common_name fp_b_names; |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
154 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
155 |
fun prepare_type_arg (ty, c) = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
156 |
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
|
157 |
TFree (s, prepare_constraint no_defs_lthy0 c) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
158 |
end; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
159 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
160 |
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
|
161 |
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
|
162 |
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; |
49119 | 163 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
164 |
val (((Bs0, Cs), Xs), no_defs_lthy) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
165 |
no_defs_lthy0 |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
166 |
|> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
167 |
|> mk_TFrees (length unsorted_As) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
168 |
||>> mk_TFrees nn |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
169 |
||>> apfst (map TFree) o |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
170 |
variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS); |
49119 | 171 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
172 |
(* TODO: cleaner handling of fake contexts, without "background_theory" *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
173 |
(*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
|
174 |
locale and shadows an existing global type*) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
175 |
val fake_thy = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
176 |
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy |
49336 | 177 |
(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
|
178 |
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; |
49119 | 179 |
|
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
|
180 |
fun mk_fake_T b = |
49121 | 181 |
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
|
182 |
unsorted_As); |
49121 | 183 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
184 |
val fake_Ts = map mk_fake_T fp_bs; |
49121 | 185 |
|
49181 | 186 |
val mixfixes = map mixfix_of specs; |
49119 | 187 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
188 |
val _ = (case duplicates Binding.eq_name fp_bs of [] => () |
49119 | 189 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
190 |
||
49121 | 191 |
val ctr_specss = map ctr_specs_of specs; |
49119 | 192 |
|
49336 | 193 |
val disc_bindingss = map (map disc_of) ctr_specss; |
194 |
val ctr_bindingss = |
|
49633 | 195 |
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; |
49121 | 196 |
val ctr_argsss = map (map args_of) ctr_specss; |
49181 | 197 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; |
49119 | 198 |
|
49336 | 199 |
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
|
200 |
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
49286 | 201 |
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; |
202 |
||
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
203 |
val (As :: _) :: fake_ctr_Tsss = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
204 |
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
|
205 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
206 |
val _ = (case duplicates (op =) unsorted_As of [] => () |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
207 |
| A :: _ => error ("Duplicate type parameter " ^ |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
208 |
quote (Syntax.string_of_typ no_defs_lthy A))); |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
209 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
210 |
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
|
211 |
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of |
49165 | 212 |
[] => () |
49342 | 213 |
| A' :: _ => error ("Extra type variable on right-hand side: " ^ |
49204 | 214 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); |
49165 | 215 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
216 |
fun eq_fpT_check (T as Type (s, Us)) (Type (s', Us')) = |
49146 | 217 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ |
218 |
quote (Syntax.string_of_typ fake_lthy T))) |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
219 |
| eq_fpT_check _ _ = false; |
49146 | 220 |
|
49204 | 221 |
fun freeze_fp (T as Type (s, Us)) = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
222 |
(case find_index (eq_fpT_check T) fake_Ts of |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
223 |
~1 => Type (s, map freeze_fp Us) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
224 |
| kk => nth Xs kk) |
49204 | 225 |
| freeze_fp T = T; |
49121 | 226 |
|
49536 | 227 |
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss; |
228 |
val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs; |
|
49119 | 229 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
230 |
val fp_eqs = |
49536 | 231 |
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; |
49121 | 232 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
233 |
(* TODO: clean up list *) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
234 |
val (pre_bnfs, ((fp_bnfs as any_fp_bnf :: _, dtors0, ctors0, fp_folds0, fp_recs0, fp_induct, |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
235 |
fp_strong_induct, dtor_ctors, ctor_dtors, ctor_injects, fp_map_thms, fp_set_thmss, |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
236 |
fp_rel_thms, fp_fold_thms, fp_rec_thms), lthy)) = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
237 |
fp_bnf construct_fp fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
238 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
239 |
val timer = time (Timer.startRealTimer ()); |
49121 | 240 |
|
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
241 |
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
242 |
let |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
243 |
val bnf = the (bnf_of lthy s); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
244 |
val live = live_of_bnf bnf; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
245 |
val mapx = mk_map live Ts Us (map_of_bnf bnf); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
246 |
val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx))); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
247 |
in Term.list_comb (mapx, map build_arg TUs') end; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
248 |
|
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
249 |
fun build_rel_step build_arg (Type (s, Ts)) = |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
250 |
let |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
251 |
val bnf = the (bnf_of lthy s); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
252 |
val live = live_of_bnf bnf; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
253 |
val rel = mk_rel live Ts Ts (rel_of_bnf bnf); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
254 |
val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel))); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
255 |
in Term.list_comb (rel, map build_arg Ts') end; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
256 |
|
49363 | 257 |
fun add_nesty_bnf_names Us = |
49226 | 258 |
let |
259 |
fun add (Type (s, Ts)) ss = |
|
260 |
let val (needs, ss') = fold_map add Ts ss in |
|
261 |
if exists I needs then (true, insert (op =) s ss') else (false, ss') |
|
262 |
end |
|
49363 | 263 |
| add T ss = (member (op =) Us T, ss); |
49226 | 264 |
in snd oo add end; |
265 |
||
49363 | 266 |
fun nesty_bnfs Us = |
49536 | 267 |
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); |
49363 | 268 |
|
269 |
val nesting_bnfs = nesty_bnfs As; |
|
49536 | 270 |
val nested_bnfs = nesty_bnfs Xs; |
49226 | 271 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
272 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
273 |
val pre_set_defss = map set_defs_of_bnf pre_bnfs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
274 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
49683 | 275 |
val nested_map_comps'' = map ((fn thm => thm RS sym) o map_comp_of_bnf) nested_bnfs; |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
276 |
val nested_map_comp's = map map_comp'_of_bnf nested_bnfs; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
277 |
val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs; |
49671 | 278 |
val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
279 |
val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
280 |
val nesting_set_natural's = maps set_natural'_of_bnf nesting_bnfs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
281 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
282 |
val live = live_of_bnf any_fp_bnf; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
283 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
284 |
val Bs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
285 |
map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
286 |
(liveness_of_fp_bnf (length As) any_fp_bnf) As Bs0; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
287 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
288 |
val B_ify = Term.typ_subst_atomic (As ~~ Bs); |
49167 | 289 |
|
49501 | 290 |
val ctors = map (mk_ctor As) ctors0; |
291 |
val dtors = map (mk_dtor As) dtors0; |
|
49124 | 292 |
|
49501 | 293 |
val fpTs = map (domain_type o fastype_of) dtors; |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
294 |
|
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
295 |
val exists_fp_subtype = exists_subtype (member (op =) fpTs); |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
296 |
val exists_Cs_subtype = exists_subtype (member (op =) Cs); |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
297 |
|
49536 | 298 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; |
49203 | 299 |
val ns = map length ctr_Tsss; |
49212 | 300 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 301 |
val mss = map (map length) ctr_Tsss; |
302 |
val Css = map2 replicate ns Cs; |
|
303 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
304 |
val fp_folds as any_fp_fold :: _ = map (mk_rec_like lfp As Cs) fp_folds0; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
305 |
val fp_recs as any_fp_rec :: _ = map (mk_rec_like lfp As Cs) fp_recs0; |
49210 | 306 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
307 |
val fp_fold_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_fold))); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
308 |
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec))); |
49204 | 309 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
310 |
val (((fold_only as (gss, _, _), rec_only as (hss, _, _)), |
49683 | 311 |
(cs, cpss, unfold_only as ((pgss, crssss, cgssss), (_, g_Tsss, _)), |
312 |
corec_only as ((phss, csssss, chssss), (_, h_Tsss, _)))), names_lthy0) = |
|
49208 | 313 |
if lfp then |
314 |
let |
|
315 |
val y_Tsss = |
|
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset
|
316 |
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
317 |
ns mss fp_fold_fun_Ts; |
49208 | 318 |
val g_Tss = map2 (map2 (curry (op --->))) y_Tsss Css; |
319 |
||
49484 | 320 |
val ((gss, ysss), lthy) = |
49208 | 321 |
lthy |
322 |
|> mk_Freess "f" g_Tss |
|
323 |
||>> mk_Freesss "x" y_Tsss; |
|
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
324 |
|
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
325 |
fun proj_recT proj (Type (s as @{type_name prod}, Ts as [T, U])) = |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
326 |
if member (op =) fpTs T then proj (T, U) else Type (s, map (proj_recT proj) Ts) |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
327 |
| proj_recT proj (Type (s, Ts)) = Type (s, map (proj_recT proj) Ts) |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
328 |
| proj_recT _ T = T; |
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
329 |
|
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
330 |
fun unzip_recT T = |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
331 |
if exists_fp_subtype T then [proj_recT fst T, proj_recT snd T] else [T]; |
49204 | 332 |
|
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
333 |
val z_Tsss = |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
334 |
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
335 |
ns mss fp_rec_fun_Ts; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
336 |
val z_Tssss = map (map (map unzip_recT)) z_Tsss; |
49208 | 337 |
val h_Tss = map2 (map2 (fold_rev (curry (op --->)))) z_Tssss Css; |
49204 | 338 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
339 |
val hss = map2 (map2 retype_free) h_Tss gss; |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
340 |
val zsss = map2 (map2 (map2 retype_free)) z_Tsss ysss; |
49210 | 341 |
in |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
342 |
((((gss, g_Tss, ysss), (hss, h_Tss, zsss)), |
49683 | 343 |
([], [], (([], [], []), ([], [], [])), (([], [], []), ([], [], [])))), lthy) |
49210 | 344 |
end |
49208 | 345 |
else |
49210 | 346 |
let |
49221
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
347 |
(*avoid "'a itself" arguments in coiterators and corecursors*) |
6d8d5fe9f3a2
fixed bug with one-value types with phantom type arguments
blanchet
parents:
49220
diff
changeset
|
348 |
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
|
349 |
|
49463 | 350 |
val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs; |
49275 | 351 |
|
49587 | 352 |
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); |
49211 | 353 |
|
49587 | 354 |
fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss |
355 |
| flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = |
|
356 |
p :: flat_predss_getterss qss fss @ flat_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
|
357 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
358 |
fun mk_types maybe_unzipT fun_Ts = |
49212 | 359 |
let |
360 |
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
|
361 |
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; |
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
362 |
val f_Tsss = map2 (map2 dest_tupleT) mss' f_prod_Tss; |
49275 | 363 |
val f_Tssss = |
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
364 |
map2 (fn C => map (map (map (curry (op -->) C) o maybe_unzipT))) Cs f_Tsss; |
49275 | 365 |
val q_Tssss = |
49463 | 366 |
map (map (map (fn [_] => [] | [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; |
49587 | 367 |
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; |
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
368 |
in (q_Tssss, f_sum_prod_Ts, f_Tsss, f_Tssss, pf_Tss) end; |
49176 | 369 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
370 |
val (r_Tssss, g_sum_prod_Ts, g_Tsss, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts; |
49211 | 371 |
|
49683 | 372 |
val (((cs, pss), gssss), lthy) = |
49210 | 373 |
lthy |
49683 | 374 |
|> mk_Frees "a" Cs |
49211 | 375 |
||>> mk_Freess "p" p_Tss |
49275 | 376 |
||>> mk_Freessss "g" g_Tssss; |
377 |
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
|
378 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
379 |
fun proj_corecT proj (Type (s as @{type_name sum}, Ts as [T, U])) = |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
380 |
if member (op =) fpTs T then proj (T, U) else Type (s, map (proj_corecT proj) Ts) |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
381 |
| proj_corecT proj (Type (s, Ts)) = Type (s, map (proj_corecT proj) Ts) |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
382 |
| proj_corecT _ T = T; |
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset
|
383 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
384 |
fun unzip_corecT T = |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
385 |
if exists_fp_subtype T then [proj_corecT fst T, proj_corecT snd T] else [T]; |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
386 |
|
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
387 |
val (s_Tssss, h_sum_prod_Ts, h_Tsss, h_Tssss, ph_Tss) = |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
388 |
mk_types unzip_corecT fp_rec_fun_Ts; |
49210 | 389 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
390 |
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; |
49484 | 391 |
val ((sssss, hssss_tl), lthy) = |
49275 | 392 |
lthy |
393 |
|> mk_Freessss "q" s_Tssss |
|
394 |
||>> mk_Freessss "h" (map (map (map tl)) h_Tssss); |
|
395 |
val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl; |
|
49211 | 396 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
397 |
val cpss = map2 (map o rapp) cs pss; |
49212 | 398 |
|
49683 | 399 |
fun mk_terms qssss fssss = |
49212 | 400 |
let |
49587 | 401 |
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; |
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
402 |
val cqssss = map2 (map o map o map o rapp) cs qssss; |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
403 |
val cfssss = map2 (map o map o map o rapp) cs fssss; |
49683 | 404 |
in (pfss, cqssss, cfssss) end; |
49210 | 405 |
in |
49484 | 406 |
(((([], [], []), ([], [], [])), |
49683 | 407 |
(cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, g_Tsss, pg_Tss)), |
408 |
(mk_terms sssss hssss, (h_sum_prod_Ts, h_Tsss, ph_Tss)))), lthy) |
|
49210 | 409 |
end; |
410 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
411 |
fun define_ctrs_case_for_type (((((((((((((((((((((((((fp_bnf, fp_b), fpT), C), ctor), dtor), |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
412 |
fp_fold), fp_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs), |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
413 |
pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings), |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
414 |
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = |
49176 | 415 |
let |
49498 | 416 |
val fp_b_name = Binding.name_of fp_b; |
417 |
||
49501 | 418 |
val dtorT = domain_type (fastype_of ctor); |
49210 | 419 |
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
|
420 |
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
|
421 |
val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss; |
49119 | 422 |
|
49593 | 423 |
val (((((w, fs), xss), yss), u'), names_lthy) = |
49204 | 424 |
no_defs_lthy |
49501 | 425 |
|> yield_singleton (mk_Frees "w") dtorT |
49176 | 426 |
||>> mk_Frees "f" case_Ts |
49370 | 427 |
||>> mk_Freess "x" ctr_Tss |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
428 |
||>> mk_Freess "y" (map (map B_ify) ctr_Tss) |
49498 | 429 |
||>> yield_singleton Variable.variant_fixes fp_b_name; |
49370 | 430 |
|
49498 | 431 |
val u = Free (u', fpT); |
49121 | 432 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
433 |
val tuple_xs = map HOLogic.mk_tuple xss; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
434 |
val tuple_ys = map HOLogic.mk_tuple yss; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
435 |
|
49129 | 436 |
val ctr_rhss = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
437 |
map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
438 |
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; |
49121 | 439 |
|
49633 | 440 |
val case_binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ caseN) fp_b); |
49129 | 441 |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
442 |
val case_rhs = |
49498 | 443 |
fold_rev Term.lambda (fs @ [u]) |
49501 | 444 |
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); |
49129 | 445 |
|
49201 | 446 |
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 447 |
|> 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
|
448 |
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) |
49336 | 449 |
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) |
49121 | 450 |
||> `Local_Theory.restore; |
451 |
||
452 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
453 |
||
454 |
val ctr_defs = map (Morphism.thm phi) raw_ctr_defs; |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
455 |
val ctr_defs' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
456 |
map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs; |
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
457 |
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
|
458 |
|
49203 | 459 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
460 |
val casex0 = Morphism.term phi raw_case; |
|
461 |
||
462 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 463 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
464 |
fun wrap lthy = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
465 |
let |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
466 |
fun exhaust_tac {context = ctxt, ...} = |
49135 | 467 |
let |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
468 |
val ctor_iff_dtor_thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
469 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
470 |
val goal = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
471 |
fold_rev Logic.all [w, u] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
472 |
(mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w))); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
473 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
474 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
475 |
mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT]) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
476 |
(certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
477 |
|> Thm.close_derivation |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
478 |
|> Morphism.thm phi |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
479 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
480 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
481 |
val sumEN_thm' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
482 |
unfold_thms lthy @{thms all_unit_eq} |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
483 |
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
484 |
(mk_sumEN_balanced n)) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
485 |
|> Morphism.thm phi; |
49135 | 486 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
487 |
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' |
49135 | 488 |
end; |
489 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
490 |
val inject_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
491 |
map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} => |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
492 |
mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
493 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
494 |
val half_distinct_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
495 |
map (map (fn (def, def') => fn {context = ctxt, ...} => |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
496 |
mk_half_distinct_tac ctxt ctor_inject [def, def'])) (mk_half_pairss (`I ctr_defs)); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
497 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
498 |
val case_tacs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
499 |
map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} => |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
500 |
mk_case_tac ctxt n k m case_def ctr_def dtor_ctor) ks ms ctr_defs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
501 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
502 |
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs]; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
503 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
504 |
val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
505 |
in |
49633 | 506 |
wrap_datatype tacss (((wrap_opts, ctrs0), casex0), (disc_bindings, (sel_bindingss, |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
507 |
sel_defaultss))) lthy |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
508 |
end; |
49121 | 509 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
510 |
fun derive_maps_sets_rels (wrap_res, lthy) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
511 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
512 |
val rel_flip = rel_flip_of_bnf fp_bnf; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
513 |
val nones = replicate live NONE; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
514 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
515 |
val ctor_cong = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
516 |
if lfp then Drule.dummy_thm |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
517 |
else cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor)] arg_cong; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
518 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
519 |
fun mk_cIn ify = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
520 |
certify lthy o (not lfp ? curry (op $) (map_types ify ctor)) oo |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
521 |
mk_InN_balanced (ify ctr_sum_prod_T) n; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
522 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
523 |
val cxIns = map2 (mk_cIn I) tuple_xs ks; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
524 |
val cyIns = map2 (mk_cIn B_ify) tuple_ys ks; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
525 |
|
49682 | 526 |
fun mk_map_thm ctr_def' cxIn = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
527 |
fold_thms lthy [ctr_def'] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
528 |
(unfold_thms lthy (pre_map_def :: |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
529 |
(if lfp then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
530 |
(cterm_instantiate_pos (nones @ [SOME cxIn]) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
531 |
(if lfp then fp_map_thm else fp_map_thm RS ctor_cong))) |
49593 | 532 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
533 |
|
49682 | 534 |
fun mk_set_thm fp_set_thm ctr_def' cxIn = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
535 |
fold_thms lthy [ctr_def'] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
536 |
(unfold_thms lthy (pre_set_defs @ nested_set_natural's @ nesting_set_natural's @ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
537 |
(if lfp then [] else [dtor_ctor]) @ sum_prod_thms_set) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
538 |
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) |
49593 | 539 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
540 |
|
49682 | 541 |
fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
542 |
|
49682 | 543 |
val map_thms = map2 mk_map_thm ctr_defs' cxIns; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
544 |
val set_thmss = map mk_set_thms fp_set_thms; |
49127 | 545 |
|
49682 | 546 |
val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
547 |
|
49682 | 548 |
fun mk_rel_thm postproc ctr_defs' cxIn cyIn = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
549 |
fold_thms lthy ctr_defs' |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
550 |
(unfold_thms lthy (pre_rel_def :: (if lfp then [] else [dtor_ctor]) @ |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
551 |
sum_prod_thms_rel) |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
552 |
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) |
49593 | 553 |
|> postproc |
554 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
555 |
|
49682 | 556 |
fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) = |
557 |
mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn; |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
558 |
|
49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
559 |
val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
560 |
|
49682 | 561 |
fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
562 |
mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def'] |
49682 | 563 |
cxIn cyIn; |
49121 | 564 |
|
49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
565 |
fun mk_other_half_rel_distinct_thm thm = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
566 |
flip_rels lthy live thm RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
567 |
|
49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
568 |
val half_rel_distinct_thmss = |
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
569 |
map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos); |
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
570 |
val other_half_rel_distinct_thmss = |
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
571 |
map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss; |
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
572 |
val (rel_distinct_thms, _) = |
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
573 |
join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
574 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
575 |
val notes = |
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
576 |
[(mapN, map_thms, code_simp_attrs), |
49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
577 |
(rel_distinctN, rel_distinct_thms, code_simp_attrs), |
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset
|
578 |
(rel_injectN, rel_inject_thms, code_simp_attrs), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
579 |
(setsN, flat set_thmss, code_simp_attrs)] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
580 |
|> filter_out (null o #2) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
581 |
|> map (fn (thmN, thms, attrs) => |
49633 | 582 |
((qualify true fp_b_name (Binding.name thmN), attrs), [(thms, [])])); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
583 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
584 |
(wrap_res, lthy |> Local_Theory.notes notes |> snd) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
585 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
586 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
587 |
fun define_fold_rec no_defs_lthy = |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
588 |
let |
49208 | 589 |
val fpT_to_C = fpT --> C; |
49199 | 590 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
591 |
fun build_prod_proj mk_proj (T, U) = |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
592 |
if T = U then |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
593 |
id_const T |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
594 |
else |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
595 |
(case (T, U) of |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
596 |
(Type (s, _), Type (s', _)) => |
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
597 |
if s = s' then build_map (build_prod_proj mk_proj) T U else mk_proj T |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
598 |
| _ => mk_proj T); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
599 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
600 |
(* TODO: Avoid these complications; cf. corec case *) |
49672
902b24e0ffb4
fixed recursor definition for datatypes with inner products (e.g. "'a trm" from the lambda-term example)
blanchet
parents:
49671
diff
changeset
|
601 |
fun mk_U proj (Type (s as @{type_name prod}, Ts as [T', U])) = |
902b24e0ffb4
fixed recursor definition for datatypes with inner products (e.g. "'a trm" from the lambda-term example)
blanchet
parents:
49671
diff
changeset
|
602 |
if member (op =) fpTs T' then proj (T', U) else Type (s, map (mk_U proj) Ts) |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
603 |
| mk_U proj (Type (s, Ts)) = Type (s, map (mk_U proj) Ts) |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
604 |
| mk_U _ T = T; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
605 |
|
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
606 |
fun unzip_rec (x as Free (_, T)) = |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
607 |
if exists_fp_subtype T then |
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
608 |
[build_prod_proj fst_const (T, mk_U fst T) $ x, |
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
609 |
build_prod_proj snd_const (T, mk_U snd T) $ x] |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
610 |
else |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
611 |
[x]; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
612 |
|
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
613 |
fun mk_rec_like_arg f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f (maps unzip_rec xs); |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
614 |
|
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
615 |
fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xsss)) = |
49215 | 616 |
let |
617 |
val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C; |
|
49633 | 618 |
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); |
49215 | 619 |
val spec = |
49336 | 620 |
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)), |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
621 |
Term.list_comb (fp_rec_like, |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
622 |
map2 (mk_sum_caseN_balanced oo map2 mk_rec_like_arg) fss xsss)); |
49336 | 623 |
in (binding, spec) end; |
49199 | 624 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
625 |
val rec_like_infos = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
626 |
[(foldN, fp_fold, fold_only), |
49215 | 627 |
(recN, fp_rec, rec_only)]; |
628 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
629 |
val (bindings, specs) = map generate_rec_like rec_like_infos |> split_list; |
49215 | 630 |
|
631 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49201 | 632 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
49199 | 633 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
49336 | 634 |
#>> apsnd snd) bindings specs |
49199 | 635 |
||> `Local_Theory.restore; |
49201 | 636 |
|
637 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
638 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
639 |
val [fold_def, rec_def] = map (Morphism.thm phi) defs; |
49201 | 640 |
|
49536 | 641 |
val [foldx, recx] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
642 |
in |
49693
393d7242adaf
thread the right local theory through + reenable parallel proofs for previously problematic theories
blanchet
parents:
49683
diff
changeset
|
643 |
((foldx, recx, fold_def, rec_def), lthy') |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
644 |
end; |
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
645 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
646 |
fun define_unfold_corec no_defs_lthy = |
49210 | 647 |
let |
648 |
val B_to_fpT = C --> fpT; |
|
49211 | 649 |
|
49683 | 650 |
fun build_sum_inj mk_inj (T, U) = |
651 |
if T = U then |
|
652 |
id_const T |
|
653 |
else |
|
654 |
(case (T, U) of |
|
655 |
(Type (s, _), Type (s', _)) => |
|
656 |
if s = s' then build_map (build_sum_inj mk_inj) T U |
|
657 |
else uncurry mk_inj (dest_sumT U) |
|
658 |
| _ => uncurry mk_inj (dest_sumT U)); |
|
659 |
||
660 |
fun build_dtor_corec_like_arg _ [] [cf] = cf |
|
661 |
| build_dtor_corec_like_arg T [cq] [cf, cf'] = |
|
662 |
mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf) |
|
663 |
(build_sum_inj Inr_const (fastype_of cf', T) $ cf') |
|
664 |
||
665 |
val crgsss = map3 (map3 (map3 build_dtor_corec_like_arg)) g_Tsss crssss cgssss; |
|
666 |
val cshsss = map3 (map3 (map3 build_dtor_corec_like_arg)) h_Tsss csssss chssss; |
|
667 |
||
49276 | 668 |
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = |
669 |
Term.lambda c (mk_IfN sum_prod_T cps |
|
670 |
(map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n))); |
|
49275 | 671 |
|
49683 | 672 |
fun generate_corec_like (suf, fp_rec_like, (cqfsss, ((pfss, _, _), (f_sum_prod_Ts, _, |
673 |
pf_Tss)))) = |
|
49211 | 674 |
let |
675 |
val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT; |
|
49633 | 676 |
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); |
49211 | 677 |
val spec = |
49336 | 678 |
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)), |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
679 |
Term.list_comb (fp_rec_like, |
49276 | 680 |
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); |
49336 | 681 |
in (binding, spec) end; |
49210 | 682 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
683 |
val corec_like_infos = |
49683 | 684 |
[(unfoldN, fp_fold, (crgsss, unfold_only)), |
685 |
(corecN, fp_rec, (cshsss, corec_only))]; |
|
49212 | 686 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
687 |
val (bindings, specs) = map generate_corec_like corec_like_infos |> split_list; |
49211 | 688 |
|
689 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49210 | 690 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
691 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
|
49336 | 692 |
#>> apsnd snd) bindings specs |
49210 | 693 |
||> `Local_Theory.restore; |
694 |
||
695 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
696 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
697 |
val [unfold_def, corec_def] = map (Morphism.thm phi) defs; |
49210 | 698 |
|
49536 | 699 |
val [unfold, corec] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts; |
49210 | 700 |
in |
49693
393d7242adaf
thread the right local theory through + reenable parallel proofs for previously problematic theories
blanchet
parents:
49683
diff
changeset
|
701 |
((unfold, corec, unfold_def, corec_def), lthy') |
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
702 |
end; |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
703 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
704 |
val define_rec_likes = if lfp then define_fold_rec else define_unfold_corec; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
705 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
706 |
fun massage_res ((wrap_res, rec_like_res), lthy) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
707 |
(((ctrs, xss, ctr_defs, wrap_res), rec_like_res), lthy); |
49119 | 708 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
709 |
(wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy') |
49119 | 710 |
end; |
49167 | 711 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
712 |
fun wrap_types_and_more (wrap_types_and_mores, lthy) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
713 |
fold_map I wrap_types_and_mores lthy |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
714 |
|>> apsnd split_list4 o apfst split_list4 o split_list; |
49226 | 715 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
716 |
(* TODO: Add map, sets, rel simps *) |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
717 |
val mk_simp_thmss = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
718 |
map3 (fn (_, _, _, injects, distincts, cases, _, _, _) => fn rec_likes => fn fold_likes => |
49505 | 719 |
injects @ distincts @ cases @ rec_likes @ fold_likes); |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
720 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
721 |
fun derive_induct_fold_rec_thms_for_types (((ctrss, xsss, ctr_defss, wrap_ress), (folds, recs, |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
722 |
fold_defs, rec_defs)), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
723 |
let |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
724 |
val (((ps, ps'), us'), names_lthy) = |
49370 | 725 |
lthy |
49463 | 726 |
|> mk_Frees' "P" (map mk_pred1T fpTs) |
49498 | 727 |
||>> Variable.variant_fixes fp_b_names; |
49370 | 728 |
|
49498 | 729 |
val us = map2 (curry Free) us' fpTs; |
49370 | 730 |
|
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
731 |
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
|
732 |
let |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
733 |
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
|
734 |
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
|
735 |
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
|
736 |
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
|
737 |
(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
|
738 |
~1 => Term.dummy |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
739 |
| 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
|
740 |
in |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
741 |
(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
|
742 |
end; |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
743 |
|
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
744 |
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
|
745 |
|
49337 | 746 |
val (induct_thms, induct_thm) = |
747 |
let |
|
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
748 |
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
|
749 |
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
|
750 |
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
|
751 |
end; |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
752 |
|
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
753 |
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
|
754 |
(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
|
755 |
~1 => |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
756 |
(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
|
757 |
NONE => [] |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
758 |
| SOME raw_sets0 => |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
759 |
let |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
760 |
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
|
761 |
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
|
762 |
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
|
763 |
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
|
764 |
val xysets = map (pair x) (ys ~~ sets); |
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
765 |
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
|
766 |
in |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
767 |
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
|
768 |
end) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
769 |
| kk => [([], (kk + 1, x))]) |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
770 |
| mk_raw_prem_prems _ _ = []; |
49342 | 771 |
|
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
772 |
fun close_prem_prem xs t = |
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
773 |
fold_rev Logic.all (map Free (drop (nn + length xs) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
774 |
(rev (Term.add_frees t (map dest_Free xs @ ps'))))) t; |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
775 |
|
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
776 |
fun mk_prem_prem xs (xysets, (j, x)) = |
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
777 |
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
|
778 |
HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets, |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
779 |
HOLogic.mk_Trueprop (nth ps (j - 1) $ x))); |
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset
|
780 |
|
49372 | 781 |
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
|
782 |
let |
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
783 |
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
|
784 |
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
|
785 |
in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end; |
49342 | 786 |
|
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
787 |
fun mk_prem (xs, raw_pprems, concl) = |
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset
|
788 |
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); |
49368 | 789 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
790 |
val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss; |
49389 | 791 |
|
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
|
792 |
val goal = |
49372 | 793 |
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss, |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
794 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us))); |
49368 | 795 |
|
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49427
diff
changeset
|
796 |
val kksss = map (map (map (fst o snd) o #2)) raw_premss; |
49368 | 797 |
|
49501 | 798 |
val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); |
49342 | 799 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
800 |
val 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
|
801 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
49590 | 802 |
mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' |
49389 | 803 |
nested_set_natural's pre_set_defss) |
49368 | 804 |
|> singleton (Proof_Context.export names_lthy lthy) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
805 |
|> Thm.close_derivation; |
49337 | 806 |
in |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
807 |
`(conj_dests nn) thm |
49337 | 808 |
end; |
49201 | 809 |
|
49622 | 810 |
val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss); |
49437 | 811 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
812 |
val (fold_thmss, rec_thmss) = |
49207 | 813 |
let |
49337 | 814 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
815 |
val gfolds = map (lists_bmoc gss) folds; |
49337 | 816 |
val hrecs = map (lists_bmoc hss) recs; |
817 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
818 |
fun mk_goal fss frec_like xctr f xs fxs = |
49207 | 819 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
820 |
(mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs))); |
49204 | 821 |
|
49682 | 822 |
fun build_rec_like frec_likes (T, U) = |
49234 | 823 |
if T = U then |
49368 | 824 |
id_const T |
49234 | 825 |
else |
826 |
(case find_index (curry (op =) T) fpTs of |
|
49682 | 827 |
~1 => build_map (build_rec_like frec_likes) T U |
828 |
| kk => nth frec_likes kk); |
|
49233 | 829 |
|
49682 | 830 |
val mk_U = typ_subst (map2 pair fpTs Cs); |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
831 |
|
49682 | 832 |
fun intr_rec_likes frec_likes maybe_cons (x as Free (_, T)) = |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
833 |
if exists_fp_subtype T then |
49682 | 834 |
maybe_cons x [build_rec_like frec_likes (T, mk_U T) $ x] |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
835 |
else |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
836 |
[x]; |
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
837 |
|
49682 | 838 |
val gxsss = map (map (maps (intr_rec_likes gfolds (K I)))) xsss; |
839 |
val hxsss = map (map (maps (intr_rec_likes hrecs cons))) xsss; |
|
49204 | 840 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
841 |
val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss; |
49484 | 842 |
val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss; |
49204 | 843 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
844 |
val fold_tacss = |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
845 |
map2 (map o mk_rec_like_tac pre_map_defs [] nesting_map_ids'' fold_defs) fp_fold_thms |
49363 | 846 |
ctr_defss; |
49203 | 847 |
val rec_tacss = |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
848 |
map2 (map o mk_rec_like_tac pre_map_defs nested_map_comp's |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
849 |
(nested_map_ids'' @ nesting_map_ids'') rec_defs) fp_rec_thms ctr_defss; |
49484 | 850 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
851 |
fun prove goal tac = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
852 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
853 |
|> Thm.close_derivation; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
854 |
in |
49595
e8c57e59cbf8
got rid of other instance of shaky "Thm.generalize"
blanchet
parents:
49594
diff
changeset
|
855 |
(map2 (map2 prove) fold_goalss fold_tacss, map2 (map2 prove) rec_goalss rec_tacss) |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
856 |
end; |
49201 | 857 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
858 |
val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss; |
49438 | 859 |
|
49437 | 860 |
val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases)); |
861 |
fun induct_type_attr T_name = Attrib.internal (K (Induct.induct_type T_name)); |
|
862 |
||
49337 | 863 |
val common_notes = |
49437 | 864 |
(if nn > 1 then [(inductN, [induct_thm], [induct_case_names_attr])] else []) |
49337 | 865 |
|> map (fn (thmN, thms, attrs) => |
49633 | 866 |
((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); |
49337 | 867 |
|
49226 | 868 |
val notes = |
49633 | 869 |
[(foldN, fold_thmss, K code_simp_attrs), |
870 |
(inductN, map single induct_thms, |
|
49437 | 871 |
fn T_name => [induct_case_names_attr, induct_type_attr T_name]), |
49622 | 872 |
(recN, rec_thmss, K code_simp_attrs), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
873 |
(simpsN, simp_thmss, K [])] |
49300 | 874 |
|> maps (fn (thmN, thmss, attrs) => |
49633 | 875 |
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => |
876 |
((qualify true fp_b_name (Binding.name thmN), attrs T_name), |
|
877 |
[(thms, [])])) fp_b_names fpTs thmss); |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
878 |
in |
49337 | 879 |
lthy |> Local_Theory.notes (common_notes @ notes) |> snd |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
880 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
881 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
882 |
fun derive_coinduct_unfold_corec_thms_for_types (((ctrss, _, ctr_defss, wrap_ress), (unfolds, |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
883 |
corecs, unfold_defs, corec_defs)), lthy) = |
49212 | 884 |
let |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
885 |
val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
886 |
|
49484 | 887 |
val discss = map (map (mk_disc_or_sel As) o #1) wrap_ress; |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
888 |
val selsss = map (map (map (mk_disc_or_sel As)) o #2) wrap_ress; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
889 |
val exhaust_thms = map #3 wrap_ress; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
890 |
val disc_thmsss = map #7 wrap_ress; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
891 |
val discIss = map #8 wrap_ress; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
892 |
val sel_thmsss = map #9 wrap_ress; |
49438 | 893 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
894 |
val (((rs, us'), vs'), names_lthy) = |
49370 | 895 |
lthy |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
896 |
|> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
897 |
||>> Variable.variant_fixes fp_b_names |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
898 |
||>> Variable.variant_fixes (map (suffix "'") fp_b_names); |
49370 | 899 |
|
49498 | 900 |
val us = map2 (curry Free) us' fpTs; |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
901 |
val udiscss = map2 (map o rapp) us discss; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
902 |
val uselsss = map2 (map o map o rapp) us selsss; |
49370 | 903 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
904 |
val vs = map2 (curry Free) vs' fpTs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
905 |
val vdiscss = map2 (map o rapp) vs discss; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
906 |
val vselsss = map2 (map o map o rapp) vs selsss; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
907 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
908 |
val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) = |
49337 | 909 |
let |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
910 |
val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
911 |
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
912 |
val strong_rs = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
913 |
map4 (fn u => fn v => fn uvr => fn uv_eq => |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
914 |
fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
915 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
916 |
fun build_rel rs' T = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
917 |
(case find_index (curry (op =) T) fpTs of |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
918 |
~1 => |
49683 | 919 |
if exists_fp_subtype T then build_rel_step (build_rel rs') T else HOLogic.eq_const T |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
920 |
| kk => nth rs' kk); |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
921 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
922 |
fun build_rel_app rs' usel vsel = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
923 |
fold rapp [usel, vsel] (build_rel rs' (fastype_of usel)); |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
924 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
925 |
fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
926 |
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
927 |
(if null usels then |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
928 |
[] |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
929 |
else |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
930 |
[Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc], |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
931 |
Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app rs') usels vsels))]); |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
932 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
933 |
fun mk_prem_concl rs' n udiscs uselss vdiscs vselss = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
934 |
Library.foldr1 HOLogic.mk_conj |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
935 |
(flat (map5 (mk_prem_ctr_concls rs' n) (1 upto n) udiscs uselss vdiscs vselss)) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
936 |
handle List.Empty => @{term True}; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
937 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
938 |
fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
939 |
fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr, |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
940 |
HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss))); |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
941 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
942 |
val concl = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
943 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
944 |
(map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v))) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
945 |
uvrs us vs)); |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
946 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
947 |
fun mk_goal rs' = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
948 |
Logic.list_implies (map8 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss, |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
949 |
concl); |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
950 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
951 |
val goal = mk_goal rs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
952 |
val strong_goal = mk_goal strong_rs; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
953 |
|
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
954 |
fun prove dtor_coinduct' goal = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
955 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
956 |
mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
957 |
exhaust_thms ctr_defss disc_thmsss sel_thmsss) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
958 |
|> singleton (Proof_Context.export names_lthy lthy) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
959 |
|> Thm.close_derivation; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
960 |
|
49590 | 961 |
fun postproc nn thm = |
962 |
Thm.permute_prems 0 nn |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
963 |
(if nn = 1 then thm RS mp |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
964 |
else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
965 |
|> Drule.zero_var_indexes |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
966 |
|> `(conj_dests nn); |
49337 | 967 |
in |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
968 |
(postproc nn (prove fp_induct goal), postproc nn (prove fp_strong_induct strong_goal)) |
49337 | 969 |
end; |
49212 | 970 |
|
49484 | 971 |
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; |
972 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
973 |
val gunfolds = map (lists_bmoc pgss) unfolds; |
49484 | 974 |
val hcorecs = map (lists_bmoc phss) corecs; |
975 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
976 |
val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) = |
49212 | 977 |
let |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
978 |
fun mk_goal pfss c cps fcorec_like n k ctr m cfs' = |
49212 | 979 |
fold_rev (fold_rev Logic.all) ([c] :: pfss) |
49484 | 980 |
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
981 |
mk_Trueprop_eq (fcorec_like $ c, Term.list_comb (ctr, take m cfs')))); |
49212 | 982 |
|
49683 | 983 |
fun build_corec_like fcorec_likes (T, U) = |
49234 | 984 |
if T = U then |
49368 | 985 |
id_const T |
49234 | 986 |
else |
987 |
(case find_index (curry (op =) U) fpTs of |
|
49683 | 988 |
~1 => build_map (build_corec_like fcorec_likes) T U |
989 |
| kk => nth fcorec_likes kk); |
|
990 |
||
991 |
val mk_U = typ_subst (map2 pair Cs fpTs); |
|
49233 | 992 |
|
49683 | 993 |
fun intr_corec_likes fcorec_likes [] [cf] = |
994 |
let val T = fastype_of cf in |
|
995 |
if exists_Cs_subtype T then build_corec_like fcorec_likes (T, mk_U T) $ cf else cf |
|
996 |
end |
|
997 |
| intr_corec_likes fcorec_likes [cq] [cf, cf'] = |
|
998 |
mk_If cq (intr_corec_likes fcorec_likes [] [cf]) |
|
999 |
(intr_corec_likes fcorec_likes [] [cf']); |
|
1000 |
||
1001 |
val crgsss = map2 (map2 (map2 (intr_corec_likes gunfolds))) crssss cgssss; |
|
1002 |
val cshsss = map2 (map2 (map2 (intr_corec_likes hcorecs))) csssss chssss; |
|
49212 | 1003 |
|
49683 | 1004 |
val unfold_goalss = |
1005 |
map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss; |
|
1006 |
val corec_goalss = |
|
1007 |
map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss; |
|
1008 |
||
1009 |
fun mk_map_if_distrib bnf = |
|
1010 |
let |
|
1011 |
val mapx = map_of_bnf bnf; |
|
1012 |
val live = live_of_bnf bnf; |
|
1013 |
val ((Ts, T), U) = strip_typeN (live + 1) (fastype_of mapx) |>> split_last; |
|
1014 |
val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts); |
|
1015 |
val t = Term.list_comb (mapx, map (Var o apfst (rpair 0)) fs); |
|
1016 |
in |
|
1017 |
Drule.instantiate' (map (SOME o certifyT lthy) [U, T]) [SOME (certify lthy t)] |
|
1018 |
@{thm if_distrib} |
|
49276 | 1019 |
end; |
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset
|
1020 |
|
49683 | 1021 |
val nested_map_if_distribs = map mk_map_if_distrib nested_bnfs; |
49213 | 1022 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1023 |
val unfold_tacss = |
49683 | 1024 |
map3 (map oo mk_corec_like_tac unfold_defs [] [] nesting_map_ids'' []) |
1025 |
fp_fold_thms pre_map_defs ctr_defss; |
|
49233 | 1026 |
val corec_tacss = |
49683 | 1027 |
map3 (map oo mk_corec_like_tac corec_defs nested_map_comps'' nested_map_comp's |
1028 |
(nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs) |
|
1029 |
fp_rec_thms pre_map_defs ctr_defss; |
|
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1030 |
|
49484 | 1031 |
fun prove goal tac = |
1032 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |> Thm.close_derivation; |
|
1033 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1034 |
val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss; |
49683 | 1035 |
val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1036 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1037 |
val filter_safesss = |
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1038 |
map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo |
49683 | 1039 |
curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss); |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1040 |
|
49683 | 1041 |
val safe_unfold_thmss = filter_safesss unfold_thmss; |
1042 |
val safe_corec_thmss = filter_safesss corec_thmss; |
|
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1043 |
in |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1044 |
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) |
49212 | 1045 |
end; |
1046 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1047 |
val (disc_unfold_iff_thmss, disc_corec_iff_thmss) = |
49482 | 1048 |
let |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1049 |
fun mk_goal c cps fcorec_like n k disc = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1050 |
mk_Trueprop_eq (disc $ (fcorec_like $ c), |
49484 | 1051 |
if n = 1 then @{const True} |
1052 |
else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps)); |
|
1053 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1054 |
val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss; |
49484 | 1055 |
val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; |
1056 |
||
1057 |
fun mk_case_split' cp = |
|
1058 |
Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split}; |
|
1059 |
||
1060 |
val case_splitss' = map (map mk_case_split') cpss; |
|
49482 | 1061 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1062 |
val unfold_tacss = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1063 |
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' unfold_thmss disc_thmsss; |
49484 | 1064 |
val corec_tacss = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1065 |
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss; |
49484 | 1066 |
|
1067 |
fun prove goal tac = |
|
1068 |
Skip_Proof.prove lthy [] [] goal (tac o #context) |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1069 |
|> singleton (Proof_Context.export names_lthy0 no_defs_lthy) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1070 |
|> Thm.close_derivation; |
49484 | 1071 |
|
1072 |
fun proves [_] [_] = [] |
|
1073 |
| proves goals tacs = map2 prove goals tacs; |
|
49482 | 1074 |
in |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1075 |
(map2 proves unfold_goalss unfold_tacss, |
49484 | 1076 |
map2 proves corec_goalss corec_tacss) |
49482 | 1077 |
end; |
1078 |
||
49605
ea566f5e1724
avoid another brand of trivial "disc_rel" theorems (which made the simplifier loop for all single-constructor types)
blanchet
parents:
49595
diff
changeset
|
1079 |
val is_triv_discI = is_triv_implies orf is_concl_refl; |
ea566f5e1724
avoid another brand of trivial "disc_rel" theorems (which made the simplifier loop for all single-constructor types)
blanchet
parents:
49595
diff
changeset
|
1080 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1081 |
fun mk_disc_corec_like_thms corec_likes discIs = |
49605
ea566f5e1724
avoid another brand of trivial "disc_rel" theorems (which made the simplifier loop for all single-constructor types)
blanchet
parents:
49595
diff
changeset
|
1082 |
map (op RS) (filter_out (is_triv_discI o snd) (corec_likes ~~ discIs)); |
49266 | 1083 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1084 |
val disc_unfold_thmss = map2 mk_disc_corec_like_thms unfold_thmss discIss; |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1085 |
val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss; |
49266 | 1086 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1087 |
fun mk_sel_corec_like_thm corec_like_thm sel sel_thm = |
49266 | 1088 |
let |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1089 |
val (domT, ranT) = dest_funT (fastype_of sel); |
49266 | 1090 |
val arg_cong' = |
1091 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
|
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1092 |
[NONE, NONE, SOME (certify lthy sel)] arg_cong |
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset
|
1093 |
|> Thm.varifyT_global; |
49266 | 1094 |
val sel_thm' = sel_thm RSN (2, trans); |
1095 |
in |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1096 |
corec_like_thm RS arg_cong' RS sel_thm' |
49266 | 1097 |
end; |
1098 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1099 |
fun mk_sel_corec_like_thms corec_likess = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1100 |
map3 (map3 (map2 o mk_sel_corec_like_thm)) corec_likess selsss sel_thmsss |> map flat; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1101 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1102 |
val sel_unfold_thmss = mk_sel_corec_like_thms unfold_thmss; |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1103 |
val sel_corec_thmss = mk_sel_corec_like_thms corec_thmss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1104 |
|
49587 | 1105 |
fun flat_corec_like_thms corec_likes disc_corec_likes sel_corec_likes = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1106 |
corec_likes @ disc_corec_likes @ sel_corec_likes; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1107 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1108 |
val simp_thmss = |
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1109 |
mk_simp_thmss wrap_ress |
49587 | 1110 |
(map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss) |
1111 |
(map3 flat_corec_like_thms safe_unfold_thmss disc_unfold_thmss sel_unfold_thmss); |
|
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1112 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1113 |
val anonymous_notes = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1114 |
[(flat safe_unfold_thmss @ flat safe_corec_thmss, simp_attrs)] |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1115 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
49266 | 1116 |
|
49342 | 1117 |
val common_notes = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1118 |
(if nn > 1 then |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1119 |
(* FIXME: attribs *) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1120 |
[(coinductN, [coinduct_thm], []), |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1121 |
(strong_coinductN, [strong_coinduct_thm], [])] |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1122 |
else |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1123 |
[]) |
49342 | 1124 |
|> map (fn (thmN, thms, attrs) => |
49633 | 1125 |
((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); |
49342 | 1126 |
|
49212 | 1127 |
val notes = |
49342 | 1128 |
[(coinductN, map single coinduct_thms, []), (* FIXME: attribs *) |
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1129 |
(corecN, corec_thmss, []), |
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1130 |
(disc_corecN, disc_corec_thmss, simp_attrs), |
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1131 |
(disc_corec_iffN, disc_corec_iff_thmss, simp_attrs), |
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1132 |
(disc_unfoldN, disc_unfold_thmss, simp_attrs), |
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1133 |
(disc_unfold_iffN, disc_unfold_iff_thmss, simp_attrs), |
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1134 |
(sel_corecN, sel_corec_thmss, simp_attrs), |
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1135 |
(sel_unfoldN, sel_unfold_thmss, simp_attrs), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1136 |
(simpsN, simp_thmss, []), |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1137 |
(strong_coinductN, map single strong_coinduct_thms, []), (* FIXME: attribs *) |
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset
|
1138 |
(unfoldN, unfold_thmss, [])] |
49300 | 1139 |
|> maps (fn (thmN, thmss, attrs) => |
49633 | 1140 |
map_filter (fn (_, []) => NONE | (fp_b_name, thms) => |
1141 |
SOME ((qualify true fp_b_name (Binding.name thmN), attrs), |
|
1142 |
[(thms, [])])) (fp_b_names ~~ thmss)); |
|
49212 | 1143 |
in |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1144 |
lthy |> Local_Theory.notes (anonymous_notes @ common_notes @ notes) |> snd |
49212 | 1145 |
end; |
1146 |
||
49204 | 1147 |
val lthy' = lthy |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1148 |
|> fold_map define_ctrs_case_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ Cs ~~ ctors ~~ dtors ~~ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1149 |
fp_folds ~~ fp_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1150 |
pre_set_defss ~~ pre_rel_defs ~~ fp_map_thms ~~ fp_set_thmss ~~ fp_rel_thms ~~ ns ~~ kss ~~ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1151 |
mss ~~ ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1152 |
raw_sel_defaultsss) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1153 |
|> wrap_types_and_more |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1154 |
|> (if lfp then derive_induct_fold_rec_thms_for_types |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1155 |
else derive_coinduct_unfold_corec_thms_for_types); |
49167 | 1156 |
|
1157 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
49208 | 1158 |
(if lfp then "" else "co") ^ "datatype")); |
49112 | 1159 |
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
|
1160 |
timer; lthy' |
49112 | 1161 |
end; |
1162 |
||
49536 | 1163 |
val datatypes = define_datatypes (K I) (K I) (K I); |
49297 | 1164 |
|
49536 | 1165 |
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; |
49119 | 1166 |
|
49112 | 1167 |
val parse_ctr_arg = |
49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset
|
1168 |
@{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} || |
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49429
diff
changeset
|
1169 |
(Parse.typ >> pair Binding.empty); |
49112 | 1170 |
|
49286 | 1171 |
val parse_defaults = |
1172 |
@{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"}; |
|
1173 |
||
49112 | 1174 |
val parse_single_spec = |
1175 |
Parse.type_args_constrained -- Parse.binding -- Parse.opt_mixfix -- |
|
49119 | 1176 |
(@{keyword "="} |-- Parse.enum1 "|" (parse_opt_binding_colon -- Parse.binding -- |
49286 | 1177 |
Scan.repeat parse_ctr_arg -- Scan.optional parse_defaults [] -- Parse.opt_mixfix)); |
49112 | 1178 |
|
49278 | 1179 |
val parse_datatype = parse_wrap_options -- Parse.and_list1 parse_single_spec; |
1180 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1181 |
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp; |
49112 | 1182 |
|
1183 |
end; |