author | blanchet |
Thu, 02 May 2013 18:16:28 +0200 | |
changeset 51865 | 55099e63c5ca |
parent 51864 | 9761deff11bc |
child 51866 | 142a82883831 |
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 |
51840 | 10 |
type fp_sugar = |
51859 | 11 |
{T: typ, |
12 |
lfp: bool, |
|
51838 | 13 |
index: int, |
14 |
pre_bnfs: BNF_Def.bnf list, |
|
51850
106afdf5806c
renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents:
51847
diff
changeset
|
15 |
fp_res: BNF_FP_Util.fp_result, |
51842 | 16 |
ctr_sugars: BNF_Ctr_Sugar.ctr_sugar list, |
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
17 |
un_folds: term list, |
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
18 |
co_recs: term list, |
51864 | 19 |
co_induct: thm, |
20 |
strong_co_induct: thm, |
|
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
21 |
un_fold_thmss: thm list list, |
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
22 |
co_rec_thmss: thm list list}; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
23 |
|
51852 | 24 |
val fp_sugar_of: local_theory -> string -> fp_sugar option |
25 |
||
51860 | 26 |
val exists_subtype_in: typ list -> typ -> bool |
51855 | 27 |
val indexify_fst: ''a list -> (int -> ''a * 'b -> 'c) -> ''a * 'b -> 'c |
28 |
val build_map: local_theory -> (typ * typ -> term) -> typ * typ -> term |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
29 |
|
51846 | 30 |
val mk_fp_iter_fun_types: term -> typ list |
31 |
val mk_fun_arg_typess: int -> int list -> typ -> typ list list |
|
32 |
val unzip_recT: typ list -> typ -> typ list * typ list |
|
33 |
val mk_fold_fun_typess: typ list list list -> typ list list -> typ list list |
|
34 |
val mk_rec_fun_typess: typ list -> typ list list list -> typ list list -> typ list list |
|
35 |
||
51837
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset
|
36 |
val derive_induct_fold_rec_thms_for_types: BNF_Def.bnf list -> term list -> term list -> thm -> |
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset
|
37 |
thm list -> thm list -> BNF_Def.bnf list -> BNF_Def.bnf list -> typ list -> typ list -> |
51827 | 38 |
typ list -> term list list -> thm list list -> term list -> term list -> thm list -> thm list -> |
51852 | 39 |
local_theory -> |
51811 | 40 |
(thm * thm list * Args.src list) * (thm list list * Args.src list) |
51827 | 41 |
* (thm list list * Args.src list) |
51837
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset
|
42 |
val derive_coinduct_unfold_corec_thms_for_types: BNF_Def.bnf list -> term list -> term list -> |
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset
|
43 |
thm -> thm -> thm list -> thm list -> thm list -> BNF_Def.bnf list -> BNF_Def.bnf list -> |
51829 | 44 |
typ list -> typ list -> typ list -> int list list -> int list list -> int list -> |
51840 | 45 |
thm list list -> BNF_Ctr_Sugar.ctr_sugar list -> term list -> term list -> thm list -> |
51852 | 46 |
thm list -> local_theory -> |
51839 | 47 |
(thm * thm list * thm * thm list * Args.src list) |
48 |
* (thm list list * thm list list * Args.src list) |
|
51811 | 49 |
* (thm list list * thm list list) * (thm list list * thm list list * Args.src list) |
51824 | 50 |
* (thm list list * thm list list * Args.src list) |
51 |
* (thm list list * thm list list * Args.src list) |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
52 |
|
51865 | 53 |
val co_datatypes: bool -> (mixfix list -> binding list -> binding list -> binding list -> |
54 |
binding list list -> (string * sort) list option -> typ list * typ list list -> |
|
55 |
BNF_Def.bnf list -> local_theory -> BNF_FP_Util.fp_result * local_theory) -> |
|
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
56 |
(bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) * |
51758 | 57 |
((((binding * binding) * (binding * typ) list) * (binding * term) list) * |
58 |
mixfix) list) list -> |
|
49297 | 59 |
local_theory -> local_theory |
51865 | 60 |
val parse_co_datatype_cmd: bool -> (mixfix list -> binding list -> binding list -> binding list -> |
61 |
binding list list -> (string * sort) list option -> typ list * typ list list -> |
|
62 |
BNF_Def.bnf list -> local_theory -> BNF_FP_Util.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
|
63 |
(local_theory -> local_theory) parser |
49112 | 64 |
end; |
65 |
||
49636 | 66 |
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = |
49112 | 67 |
struct |
68 |
||
49119 | 69 |
open BNF_Util |
51797 | 70 |
open BNF_Ctr_Sugar |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
71 |
open BNF_Def |
51850
106afdf5806c
renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents:
51847
diff
changeset
|
72 |
open BNF_FP_Util |
49636 | 73 |
open BNF_FP_Def_Sugar_Tactics |
49119 | 74 |
|
51788 | 75 |
val EqN = "Eq_"; |
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset
|
76 |
|
51840 | 77 |
type fp_sugar = |
51859 | 78 |
{T: typ, |
79 |
lfp: bool, |
|
51838 | 80 |
index: int, |
81 |
pre_bnfs: bnf list, |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
82 |
fp_res: fp_result, |
51842 | 83 |
ctr_sugars: ctr_sugar list, |
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
84 |
un_folds: term list, |
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
85 |
co_recs: term list, |
51864 | 86 |
co_induct: thm, |
87 |
strong_co_induct: thm, |
|
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
88 |
un_fold_thmss: thm list list, |
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
89 |
co_rec_thmss: thm list list}; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
90 |
|
51859 | 91 |
fun eq_fp_sugar ({T = T1, lfp = lfp1, index = index1, fp_res = fp_res1, ...} : fp_sugar, |
92 |
{T = T2, lfp = lfp2, index = index2, fp_res = fp_res2, ...} : fp_sugar) = |
|
93 |
T1 = T2 andalso lfp1 = lfp2 andalso index1 = index2 andalso eq_fp_result (fp_res1, fp_res2); |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
94 |
|
51864 | 95 |
fun morph_fp_sugar phi {T, lfp, index, pre_bnfs, fp_res, ctr_sugars, un_folds, co_recs, co_induct, |
96 |
strong_co_induct, un_fold_thmss, co_rec_thmss} = |
|
51859 | 97 |
{T = Morphism.typ phi T, lfp = lfp, index = index, pre_bnfs = map (morph_bnf phi) pre_bnfs, |
51842 | 98 |
fp_res = morph_fp_result phi fp_res, ctr_sugars = map (morph_ctr_sugar phi) ctr_sugars, |
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
99 |
un_folds = map (Morphism.term phi) un_folds, co_recs = map (Morphism.term phi) co_recs, |
51864 | 100 |
co_induct = Morphism.thm phi co_induct, strong_co_induct = Morphism.thm phi strong_co_induct, |
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
101 |
un_fold_thmss = map (map (Morphism.thm phi)) un_fold_thmss, |
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
102 |
co_rec_thmss = map (map (Morphism.thm phi)) co_rec_thmss}; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
103 |
|
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
104 |
structure Data = Generic_Data |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
105 |
( |
51840 | 106 |
type T = fp_sugar Symtab.table; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
107 |
val empty = Symtab.empty; |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
108 |
val extend = I; |
51840 | 109 |
val merge = Symtab.merge eq_fp_sugar; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
110 |
); |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
111 |
|
51840 | 112 |
val fp_sugar_of = Symtab.lookup o Data.get o Context.Proof; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
113 |
|
51840 | 114 |
fun register_fp_sugar key fp_sugar = |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
115 |
Local_Theory.declaration {syntax = false, pervasive = true} |
51840 | 116 |
(fn phi => Data.map (Symtab.update_new (key, morph_fp_sugar phi fp_sugar))); |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
117 |
|
51864 | 118 |
fun register_fp_sugars lfp pre_bnfs (fp_res as {Ts, ...}) ctr_sugars un_folds co_recs co_induct |
119 |
strong_co_induct un_fold_thmss co_rec_thmss lthy = |
|
51844 | 120 |
(0, lthy) |
51859 | 121 |
|> fold (fn T as Type (s, _) => fn (kk, lthy) => (kk + 1, |
122 |
register_fp_sugar s {T = T, lfp = lfp, index = kk, pre_bnfs = pre_bnfs, fp_res = fp_res, |
|
51864 | 123 |
ctr_sugars = ctr_sugars, un_folds = un_folds, co_recs = co_recs, co_induct = co_induct, |
124 |
strong_co_induct = strong_co_induct, un_fold_thmss = un_fold_thmss, |
|
125 |
co_rec_thmss = co_rec_thmss} lthy)) Ts |
|
51824 | 126 |
|> snd; |
127 |
||
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset
|
128 |
(* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A"). *) |
49622 | 129 |
fun quasi_unambiguous_case_names names = |
130 |
let |
|
131 |
val ps = map (`Long_Name.base_name) names; |
|
132 |
val dups = Library.duplicates (op =) (map fst ps); |
|
133 |
fun underscore s = |
|
134 |
let val ss = space_explode Long_Name.separator s in |
|
135 |
space_implode "_" (drop (length ss - 2) ss) |
|
136 |
end; |
|
137 |
in |
|
138 |
map (fn (base, full) => if member (op =) dups base then underscore full else base) ps |
|
139 |
end; |
|
140 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
141 |
val mp_conj = @{thm mp_conj}; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
142 |
|
49300 | 143 |
val simp_attrs = @{attributes [simp]}; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
144 |
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; |
49300 | 145 |
|
50170 | 146 |
fun split_list4 [] = ([], [], [], []) |
147 |
| split_list4 ((x1, x2, x3, x4) :: xs) = |
|
148 |
let val (xs1, xs2, xs3, xs4) = split_list4 xs; |
|
149 |
in (x1 :: xs1, x2 :: xs2, x3 :: xs3, x4 :: xs4) end; |
|
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
150 |
|
51860 | 151 |
val exists_subtype_in = Term.exists_subtype o member (op =); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
152 |
|
49342 | 153 |
fun resort_tfree S (TFree (s, _)) = TFree (s, S); |
154 |
||
51845 | 155 |
fun typ_subst_nonatomic inst (T as Type (s, Ts)) = |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
156 |
(case AList.lookup (op =) inst T of |
51845 | 157 |
NONE => Type (s, map (typ_subst_nonatomic inst) Ts) |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
158 |
| SOME T' => T') |
51845 | 159 |
| typ_subst_nonatomic inst T = the_default T (AList.lookup (op =) inst T); |
49205 | 160 |
|
49297 | 161 |
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
|
162 |
|
49200 | 163 |
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); |
164 |
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs; |
|
165 |
||
51794 | 166 |
fun flat_rec unzipf xs = |
167 |
let val ps = map unzipf xs in |
|
168 |
(* The first line below gives the preferred order. The second line is for compatibility with the |
|
169 |
old datatype package: *) |
|
51795
096b96281e34
for compatibility, generate recursor arguments in the same order as old package
blanchet
parents:
51794
diff
changeset
|
170 |
(* |
51794 | 171 |
maps (op @) ps |
51795
096b96281e34
for compatibility, generate recursor arguments in the same order as old package
blanchet
parents:
51794
diff
changeset
|
172 |
*) |
51794 | 173 |
maps fst ps @ maps snd ps |
51793
22f22172a361
started working on compatibility with old package's recursor
blanchet
parents:
51790
diff
changeset
|
174 |
end; |
22f22172a361
started working on compatibility with old package's recursor
blanchet
parents:
51790
diff
changeset
|
175 |
|
51829 | 176 |
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); |
177 |
||
178 |
fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss |
|
179 |
| flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = |
|
180 |
p :: flat_predss_getterss qss fss @ flat_preds_predsss_gettersss ps qsss fsss; |
|
181 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
182 |
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
183 |
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
|
184 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
185 |
fun flip_rels lthy n thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
186 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
187 |
val Rs = Term.add_vars (prop_of thm) []; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
188 |
val Rs' = rev (drop (length Rs - n) Rs); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
189 |
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
|
190 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
191 |
Drule.cterm_instantiate cRs thm |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
192 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
193 |
|
49536 | 194 |
fun mk_ctor_or_dtor get_T Ts t = |
195 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
196 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
|
197 |
end; |
|
198 |
||
199 |
val mk_ctor = mk_ctor_or_dtor range_type; |
|
200 |
val mk_dtor = mk_ctor_or_dtor domain_type; |
|
201 |
||
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
202 |
fun mk_xxiter lfp Ts Us t = |
49536 | 203 |
let |
204 |
val (bindings, body) = strip_type (fastype_of t); |
|
205 |
val (f_Us, prebody) = split_last bindings; |
|
206 |
val Type (_, Ts0) = if lfp then prebody else body; |
|
207 |
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); |
|
208 |
in |
|
209 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
|
210 |
end; |
|
211 |
||
51846 | 212 |
val mk_fp_iter_fun_types = fst o split_last o binder_types o fastype_of; |
213 |
||
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
214 |
fun mk_fp_iter lfp As Cs fp_iters0 = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
215 |
map (mk_xxiter lfp As Cs) fp_iters0 |
51846 | 216 |
|> (fn ts => (ts, mk_fp_iter_fun_types (hd ts))); |
51827 | 217 |
|
51846 | 218 |
fun unzip_recT fpTs T = |
51827 | 219 |
let |
51829 | 220 |
fun project_recT proj = |
221 |
let |
|
222 |
fun project (Type (s as @{type_name prod}, Ts as [T, U])) = |
|
223 |
if member (op =) fpTs T then proj (T, U) else Type (s, map project Ts) |
|
224 |
| project (Type (s, Ts)) = Type (s, map project Ts) |
|
225 |
| project T = T; |
|
226 |
in project end; |
|
227 |
in |
|
51846 | 228 |
if exists_subtype_in fpTs T then ([project_recT fst T], [project_recT snd T]) else ([T], []) |
51829 | 229 |
end; |
51827 | 230 |
|
51846 | 231 |
val massage_rec_fun_arg_typesss = map o map o flat_rec o unzip_recT; |
232 |
||
51827 | 233 |
val mk_fold_fun_typess = map2 (map2 (curry (op --->))); |
234 |
val mk_rec_fun_typess = mk_fold_fun_typess oo massage_rec_fun_arg_typesss; |
|
235 |
||
51846 | 236 |
fun mk_fun_arg_typess n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type; |
237 |
||
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
238 |
fun mk_fold_rec_terms_types fpTs Css ns mss ctor_fold_fun_Ts ctor_rec_fun_Ts lthy = |
51832 | 239 |
let |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
240 |
val y_Tsss = map3 mk_fun_arg_typess ns mss ctor_fold_fun_Ts; |
51832 | 241 |
val g_Tss = mk_fold_fun_typess y_Tsss Css; |
242 |
||
243 |
val ((gss, ysss), lthy) = |
|
244 |
lthy |
|
245 |
|> mk_Freess "f" g_Tss |
|
246 |
||>> mk_Freesss "x" y_Tsss; |
|
247 |
||
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
248 |
val z_Tsss = map3 mk_fun_arg_typess ns mss ctor_rec_fun_Ts; |
51832 | 249 |
val h_Tss = mk_rec_fun_typess fpTs z_Tsss Css; |
250 |
||
251 |
val hss = map2 (map2 retype_free) h_Tss gss; |
|
252 |
val zsss = map2 (map2 (map2 retype_free)) z_Tsss ysss; |
|
253 |
in |
|
254 |
(((gss, g_Tss, ysss), (hss, h_Tss, zsss)), lthy) |
|
255 |
end; |
|
256 |
||
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
257 |
fun mk_unfold_corec_terms_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy = |
51829 | 258 |
let |
259 |
(*avoid "'a itself" arguments in coiterators and corecursors*) |
|
260 |
fun repair_arity [0] = [1] |
|
261 |
| repair_arity ms = ms; |
|
262 |
||
263 |
fun project_corecT proj = |
|
264 |
let |
|
265 |
fun project (Type (s as @{type_name sum}, Ts as [T, U])) = |
|
266 |
if member (op =) fpTs T then proj (T, U) else Type (s, map project Ts) |
|
267 |
| project (Type (s, Ts)) = Type (s, map project Ts) |
|
268 |
| project T = T; |
|
269 |
in project end; |
|
270 |
||
271 |
fun unzip_corecT T = |
|
272 |
if exists_subtype_in fpTs T then [project_corecT fst T, project_corecT snd T] else [T]; |
|
273 |
||
51831 | 274 |
val p_Tss = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs; |
51829 | 275 |
|
276 |
fun mk_types maybe_unzipT fun_Ts = |
|
277 |
let |
|
278 |
val f_sum_prod_Ts = map range_type fun_Ts; |
|
279 |
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; |
|
280 |
val f_Tsss = map2 (map2 dest_tupleT o repair_arity) mss f_prod_Tss; |
|
281 |
val f_Tssss = |
|
282 |
map2 (fn C => map (map (map (curry (op -->) C) o maybe_unzipT))) Cs f_Tsss; |
|
283 |
val q_Tssss = |
|
284 |
map (map (map (fn [_] => [] | [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; |
|
285 |
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; |
|
286 |
in (q_Tssss, f_sum_prod_Ts, f_Tsss, f_Tssss, pf_Tss) end; |
|
287 |
||
51831 | 288 |
val (r_Tssss, g_sum_prod_Ts, g_Tsss, g_Tssss, pg_Tss) = mk_types single dtor_unfold_fun_Ts; |
289 |
val (s_Tssss, h_sum_prod_Ts, h_Tsss, h_Tssss, ph_Tss) = mk_types unzip_corecT dtor_corec_fun_Ts; |
|
290 |
||
51829 | 291 |
val (((cs, pss), gssss), lthy) = |
292 |
lthy |
|
293 |
|> mk_Frees "a" Cs |
|
294 |
||>> mk_Freess "p" p_Tss |
|
295 |
||>> mk_Freessss "g" g_Tssss; |
|
296 |
val rssss = map (map (map (fn [] => []))) r_Tssss; |
|
297 |
||
298 |
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; |
|
299 |
val ((sssss, hssss_tl), lthy) = |
|
300 |
lthy |
|
301 |
|> mk_Freessss "q" s_Tssss |
|
302 |
||>> mk_Freessss "h" (map (map (map tl)) h_Tssss); |
|
303 |
val hssss = map2 (map2 (map2 cons)) hssss_hd hssss_tl; |
|
51831 | 304 |
|
305 |
val cpss = map2 (map o rapp) cs pss; |
|
51829 | 306 |
|
51831 | 307 |
fun mk_terms qssss fssss = |
308 |
let |
|
309 |
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; |
|
310 |
val cqssss = map2 (map o map o map o rapp) cs qssss; |
|
311 |
val cfssss = map2 (map o map o map o rapp) cs fssss; |
|
312 |
in (pfss, cqssss, cfssss) end; |
|
313 |
||
314 |
val unfold_terms = mk_terms rssss gssss; |
|
315 |
val corec_terms = mk_terms sssss hssss; |
|
316 |
in |
|
317 |
((cs, cpss, (unfold_terms, (g_sum_prod_Ts, g_Tsss, pg_Tss)), |
|
318 |
(corec_terms, (h_sum_prod_Ts, h_Tsss, ph_Tss))), lthy) |
|
319 |
end; |
|
51829 | 320 |
|
49536 | 321 |
fun mk_map live Ts Us t = |
322 |
let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) |>> List.last in |
|
323 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
|
324 |
end; |
|
325 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
326 |
fun mk_rel live Ts Us t = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
327 |
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
|
328 |
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
329 |
end; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
330 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
331 |
fun liveness_of_fp_bnf n bnf = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
332 |
(case T_of_bnf bnf of |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
333 |
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
|
334 |
| _ => replicate n false); |
49536 | 335 |
|
49124 | 336 |
fun cannot_merge_types () = error "Mutually recursive types must have the same type parameters"; |
49119 | 337 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
338 |
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); |
49119 | 339 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
340 |
fun merge_type_args (As, As') = |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
341 |
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); |
49119 | 342 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
343 |
fun reassoc_conjs thm = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
344 |
reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]}) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
345 |
handle THM _ => thm; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
346 |
|
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
347 |
fun type_args_named_constrained_of ((((ncAs, _), _), _), _) = ncAs; |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
348 |
fun type_binding_of ((((_, b), _), _), _) = b; |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
349 |
fun map_binding_of (((_, (b, _)), _), _) = b; |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
350 |
fun rel_binding_of (((_, (_, b)), _), _) = b; |
49181 | 351 |
fun mixfix_of ((_, mx), _) = mx; |
49121 | 352 |
fun ctr_specs_of (_, ctr_specs) = ctr_specs; |
49119 | 353 |
|
49286 | 354 |
fun disc_of ((((disc, _), _), _), _) = disc; |
355 |
fun ctr_of ((((_, ctr), _), _), _) = ctr; |
|
356 |
fun args_of (((_, args), _), _) = args; |
|
357 |
fun defaults_of ((_, ds), _) = ds; |
|
49181 | 358 |
fun ctr_mixfix_of (_, mx) = mx; |
49119 | 359 |
|
51855 | 360 |
fun indexify_fst xs f (x, y) = f (find_index (curry (op =) x) xs) (x, y); |
361 |
||
51854 | 362 |
fun build_map lthy build_simple = |
51853 | 363 |
let |
364 |
fun build (TU as (T, U)) = |
|
365 |
if T = U then |
|
366 |
id_const T |
|
367 |
else |
|
368 |
(case TU of |
|
51854 | 369 |
(Type (s, Ts), Type (s', Us)) => |
370 |
if s = s' then |
|
371 |
let |
|
372 |
val bnf = the (bnf_of lthy s); |
|
373 |
val live = live_of_bnf bnf; |
|
374 |
val mapx = mk_map live Ts Us (map_of_bnf bnf); |
|
375 |
val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx))); |
|
376 |
in Term.list_comb (mapx, map build TUs') end |
|
377 |
else |
|
378 |
build_simple TU |
|
51853 | 379 |
| _ => build_simple TU); |
380 |
in build end; |
|
381 |
||
51827 | 382 |
fun derive_induct_fold_rec_thms_for_types pre_bnfs ctor_folds0 ctor_recs0 ctor_induct ctor_fold_thms |
383 |
ctor_rec_thms nesting_bnfs nested_bnfs fpTs Cs As ctrss ctr_defss folds recs fold_defs rec_defs |
|
384 |
lthy = |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
385 |
let |
51827 | 386 |
val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss; |
387 |
||
51815 | 388 |
val nn = length pre_bnfs; |
51827 | 389 |
val ns = map length ctr_Tsss; |
390 |
val mss = map (map length) ctr_Tsss; |
|
391 |
val Css = map2 replicate ns Cs; |
|
51815 | 392 |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
393 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
394 |
val pre_set_defss = map set_defs_of_bnf pre_bnfs; |
51830 | 395 |
val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
396 |
val nested_map_comp's = map map_comp'_of_bnf nested_bnfs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
397 |
val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
398 |
val nested_set_map's = maps set_map'_of_bnf nested_bnfs; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
399 |
|
51816 | 400 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 401 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
402 |
val (_, ctor_fold_fun_Ts) = mk_fp_iter true As Cs ctor_folds0; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
403 |
val (_, ctor_rec_fun_Ts) = mk_fp_iter true As Cs ctor_recs0; |
51827 | 404 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
405 |
val (((gss, _, _), (hss, _, _)), names_lthy0) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
406 |
mk_fold_rec_terms_types fpTs Css ns mss ctor_fold_fun_Ts ctor_rec_fun_Ts lthy; |
51827 | 407 |
|
51832 | 408 |
val ((((ps, ps'), xsss), us'), names_lthy) = |
409 |
names_lthy0 |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
410 |
|> mk_Frees' "P" (map mk_pred1T fpTs) |
51827 | 411 |
||>> mk_Freesss "x" ctr_Tsss |
51816 | 412 |
||>> Variable.variant_fixes fp_b_names; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
413 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
414 |
val us = map2 (curry Free) us' fpTs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
415 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
416 |
fun mk_sets_nested bnf = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
417 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
418 |
val Type (T_name, Us) = T_of_bnf bnf; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
419 |
val lives = lives_of_bnf bnf; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
420 |
val sets = sets_of_bnf bnf; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
421 |
fun mk_set U = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
422 |
(case find_index (curry (op =) U) lives of |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
423 |
~1 => Term.dummy |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
424 |
| i => nth sets i); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
425 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
426 |
(T_name, map mk_set Us) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
427 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
428 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
429 |
val setss_nested = map mk_sets_nested nested_bnfs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
430 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
431 |
val (induct_thms, induct_thm) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
432 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
433 |
fun mk_set Ts t = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
434 |
let val Type (_, Ts0) = domain_type (fastype_of t) in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
435 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
436 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
437 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
438 |
fun mk_raw_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
439 |
(case find_index (curry (op =) T) fpTs of |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
440 |
~1 => |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
441 |
(case AList.lookup (op =) setss_nested T_name of |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
442 |
NONE => [] |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
443 |
| SOME raw_sets0 => |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
444 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
445 |
val (Ts, raw_sets) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
446 |
split_list (filter (exists_subtype_in fpTs o fst) (Ts0 ~~ raw_sets0)); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
447 |
val sets = map (mk_set Ts0) raw_sets; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
448 |
val (ys, names_lthy') = names_lthy |> mk_Frees s Ts; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
449 |
val xysets = map (pair x) (ys ~~ sets); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
450 |
val ppremss = map (mk_raw_prem_prems names_lthy') ys; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
451 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
452 |
flat (map2 (map o apfst o cons) xysets ppremss) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
453 |
end) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
454 |
| kk => [([], (kk + 1, x))]) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
455 |
| mk_raw_prem_prems _ _ = []; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
456 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
457 |
fun close_prem_prem xs t = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
458 |
fold_rev Logic.all (map Free (drop (nn + length xs) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
459 |
(rev (Term.add_frees t (map dest_Free xs @ ps'))))) t; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
460 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
461 |
fun mk_prem_prem xs (xysets, (j, x)) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
462 |
close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) => |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
463 |
HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets, |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
464 |
HOLogic.mk_Trueprop (nth ps (j - 1) $ x))); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
465 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
466 |
fun mk_raw_prem phi ctr ctr_Ts = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
467 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
468 |
val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
469 |
val pprems = maps (mk_raw_prem_prems names_lthy') xs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
470 |
in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
471 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
472 |
fun mk_prem (xs, raw_pprems, concl) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
473 |
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
474 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
475 |
val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
476 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
477 |
val goal = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
478 |
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss, |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
479 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us))); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
480 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
481 |
val kksss = map (map (map (fst o snd) o #2)) raw_premss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
482 |
|
51814 | 483 |
val ctor_induct' = ctor_induct OF (map mk_sumEN_tupled_balanced mss); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
484 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
485 |
val thm = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
486 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
487 |
mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' nested_set_map's |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
488 |
pre_set_defss) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
489 |
|> singleton (Proof_Context.export names_lthy lthy) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
490 |
|> Thm.close_derivation; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
491 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
492 |
`(conj_dests nn) thm |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
493 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
494 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
495 |
val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
496 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
497 |
val (fold_thmss, rec_thmss) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
498 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
499 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
500 |
val gfolds = map (lists_bmoc gss) folds; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
501 |
val hrecs = map (lists_bmoc hss) recs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
502 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
503 |
fun mk_goal fss fiter xctr f xs fxs = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
504 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
505 |
(mk_Trueprop_eq (fiter $ xctr, Term.list_comb (f, fxs))); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
506 |
|
51845 | 507 |
val mk_U = typ_subst_nonatomic (map2 pair fpTs Cs); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
508 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
509 |
fun unzip_iters fiters combine (x as Free (_, T)) = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
510 |
if exists_subtype_in fpTs T then |
51855 | 511 |
combine (x, build_map lthy (indexify_fst fpTs (K o nth fiters)) (T, mk_U T) $ x) |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
512 |
else |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
513 |
([x], []); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
514 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
515 |
val gxsss = map (map (flat_rec (unzip_iters gfolds (fn (_, t) => ([t], []))))) xsss; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
516 |
val hxsss = map (map (flat_rec (unzip_iters hrecs (pairself single)))) xsss; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
517 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
518 |
val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
519 |
val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
520 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
521 |
val fold_tacss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
522 |
map2 (map o mk_iter_tac pre_map_defs [] nesting_map_ids'' fold_defs) ctor_fold_thms |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
523 |
ctr_defss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
524 |
val rec_tacss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
525 |
map2 (map o mk_iter_tac pre_map_defs nested_map_comp's |
51814 | 526 |
(nested_map_ids'' @ nesting_map_ids'') rec_defs) ctor_rec_thms ctr_defss; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
527 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
528 |
fun prove goal tac = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
529 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
530 |
|> Thm.close_derivation; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
531 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
532 |
(map2 (map2 prove) fold_goalss fold_tacss, map2 (map2 prove) rec_goalss rec_tacss) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
533 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
534 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
535 |
val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases)); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
536 |
in |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
537 |
((induct_thm, induct_thms, [induct_case_names_attr]), |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
538 |
(fold_thmss, code_simp_attrs), (rec_thmss, code_simp_attrs)) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
539 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
540 |
|
51829 | 541 |
fun derive_coinduct_unfold_corec_thms_for_types pre_bnfs dtor_unfolds0 dtor_corecs0 dtor_coinduct |
51814 | 542 |
dtor_strong_induct dtor_ctors dtor_unfold_thms dtor_corec_thms nesting_bnfs nested_bnfs fpTs Cs |
51840 | 543 |
As kss mss ns ctr_defss ctr_sugars unfolds corecs unfold_defs corec_defs lthy = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
544 |
let |
51815 | 545 |
val nn = length pre_bnfs; |
546 |
||
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
547 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
548 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
51830 | 549 |
val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs; |
550 |
val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
551 |
val nested_map_comp's = map map_comp'_of_bnf nested_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
552 |
val nested_map_comps'' = map ((fn thm => thm RS sym) o map_comp_of_bnf) nested_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
553 |
val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
554 |
|
51816 | 555 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 556 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
557 |
val (_, dtor_unfold_fun_Ts) = mk_fp_iter false As Cs dtor_unfolds0; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
558 |
val (_, dtor_corec_fun_Ts) = mk_fp_iter false As Cs dtor_corecs0; |
51829 | 559 |
|
51840 | 560 |
val ctrss = map (map (mk_ctr As) o #ctrs) ctr_sugars; |
561 |
val discss = map (map (mk_disc_or_sel As) o #discs) ctr_sugars; |
|
562 |
val selsss = map (map (map (mk_disc_or_sel As)) o #selss) ctr_sugars; |
|
563 |
val exhausts = map #exhaust ctr_sugars; |
|
564 |
val disc_thmsss = map #disc_thmss ctr_sugars; |
|
565 |
val discIss = map #discIs ctr_sugars; |
|
566 |
val sel_thmsss = map #sel_thmss ctr_sugars; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
567 |
|
51831 | 568 |
val ((cs, cpss, ((pgss, crssss, cgssss), _), ((phss, csssss, chssss), _)), names_lthy0) = |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
569 |
mk_unfold_corec_terms_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy; |
51831 | 570 |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
571 |
val (((rs, us'), vs'), names_lthy) = |
51831 | 572 |
names_lthy0 |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
573 |
|> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) |
51816 | 574 |
||>> Variable.variant_fixes fp_b_names |
575 |
||>> Variable.variant_fixes (map (suffix "'") fp_b_names); |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
576 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
577 |
val us = map2 (curry Free) us' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
578 |
val udiscss = map2 (map o rapp) us discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
579 |
val uselsss = map2 (map o map o rapp) us selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
580 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
581 |
val vs = map2 (curry Free) vs' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
582 |
val vdiscss = map2 (map o rapp) vs discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
583 |
val vselsss = map2 (map o map o rapp) vs selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
584 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
585 |
val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
586 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
587 |
val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
588 |
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
589 |
val strong_rs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
590 |
map4 (fn u => fn v => fn uvr => fn uv_eq => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
591 |
fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
592 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
593 |
fun build_rel rs' T = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
594 |
(case find_index (curry (op =) T) fpTs of |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
595 |
~1 => |
51856 | 596 |
if exists_subtype_in fpTs T then |
597 |
let |
|
598 |
val Type (s, Ts) = T |
|
599 |
val bnf = the (bnf_of lthy s); |
|
600 |
val live = live_of_bnf bnf; |
|
601 |
val rel = mk_rel live Ts Ts (rel_of_bnf bnf); |
|
602 |
val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel))); |
|
603 |
in Term.list_comb (rel, map (build_rel rs') Ts') end |
|
604 |
else |
|
605 |
HOLogic.eq_const T |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
606 |
| kk => nth rs' kk); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
607 |
|
51856 | 608 |
fun build_rel_app rs' usel vsel = fold rapp [usel, vsel] (build_rel rs' (fastype_of usel)); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
609 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
610 |
fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
611 |
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
612 |
(if null usels then |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
613 |
[] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
614 |
else |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
615 |
[Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc], |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
616 |
Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app rs') usels vsels))]); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
617 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
618 |
fun mk_prem_concl rs' n udiscs uselss vdiscs vselss = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
619 |
Library.foldr1 HOLogic.mk_conj |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
620 |
(flat (map5 (mk_prem_ctr_concls rs' n) (1 upto n) udiscs uselss vdiscs vselss)) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
621 |
handle List.Empty => @{term True}; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
622 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
623 |
fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
624 |
fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr, |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
625 |
HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss))); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
626 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
627 |
val concl = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
628 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
629 |
(map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v))) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
630 |
uvrs us vs)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
631 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
632 |
fun mk_goal rs' = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
633 |
Logic.list_implies (map8 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss, |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
634 |
concl); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
635 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
636 |
val goal = mk_goal rs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
637 |
val strong_goal = mk_goal strong_rs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
638 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
639 |
fun prove dtor_coinduct' goal = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
640 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
641 |
mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors |
51819 | 642 |
exhausts ctr_defss disc_thmsss sel_thmsss) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
643 |
|> singleton (Proof_Context.export names_lthy lthy) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
644 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
645 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
646 |
fun postproc nn thm = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
647 |
Thm.permute_prems 0 nn |
51828 | 648 |
(if nn = 1 then thm RS mp else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
649 |
|> Drule.zero_var_indexes |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
650 |
|> `(conj_dests nn); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
651 |
in |
51814 | 652 |
(postproc nn (prove dtor_coinduct goal), postproc nn (prove dtor_strong_induct strong_goal)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
653 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
654 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
655 |
fun mk_coinduct_concls ms discs ctrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
656 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
657 |
fun mk_disc_concl disc = [name_of_disc disc]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
658 |
fun mk_ctr_concl 0 _ = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
659 |
| mk_ctr_concl _ ctor = [name_of_ctr ctor]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
660 |
val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
661 |
val ctr_concls = map2 mk_ctr_concl ms ctrs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
662 |
in |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
663 |
flat (map2 append disc_concls ctr_concls) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
664 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
665 |
|
51816 | 666 |
val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
667 |
val coinduct_conclss = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
668 |
map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
669 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
670 |
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
671 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
672 |
val gunfolds = map (lists_bmoc pgss) unfolds; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
673 |
val hcorecs = map (lists_bmoc phss) corecs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
674 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
675 |
val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
676 |
let |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
677 |
fun mk_goal pfss c cps fcoiter n k ctr m cfs' = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
678 |
fold_rev (fold_rev Logic.all) ([c] :: pfss) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
679 |
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
680 |
mk_Trueprop_eq (fcoiter $ c, Term.list_comb (ctr, take m cfs')))); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
681 |
|
51845 | 682 |
val mk_U = typ_subst_nonatomic (map2 pair Cs fpTs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
683 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
684 |
fun intr_coiters fcoiters [] [cf] = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
685 |
let val T = fastype_of cf in |
51855 | 686 |
if exists_subtype_in Cs T then |
687 |
build_map lthy (indexify_fst Cs (K o nth fcoiters)) (T, mk_U T) $ cf |
|
688 |
else |
|
689 |
cf |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
690 |
end |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
691 |
| intr_coiters fcoiters [cq] [cf, cf'] = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
692 |
mk_If cq (intr_coiters fcoiters [] [cf]) (intr_coiters fcoiters [] [cf']); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
693 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
694 |
val crgsss = map2 (map2 (map2 (intr_coiters gunfolds))) crssss cgssss; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
695 |
val cshsss = map2 (map2 (map2 (intr_coiters hcorecs))) csssss chssss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
696 |
|
51828 | 697 |
val unfold_goalss = map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss; |
698 |
val corec_goalss = map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
699 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
700 |
fun mk_map_if_distrib bnf = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
701 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
702 |
val mapx = map_of_bnf bnf; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
703 |
val live = live_of_bnf bnf; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
704 |
val ((Ts, T), U) = strip_typeN (live + 1) (fastype_of mapx) |>> split_last; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
705 |
val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
706 |
val t = Term.list_comb (mapx, map (Var o apfst (rpair 0)) fs); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
707 |
in |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
708 |
Drule.instantiate' (map (SOME o certifyT lthy) [U, T]) [SOME (certify lthy t)] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
709 |
@{thm if_distrib} |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
710 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
711 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
712 |
val nested_map_if_distribs = map mk_map_if_distrib nested_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
713 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
714 |
val unfold_tacss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
715 |
map3 (map oo mk_coiter_tac unfold_defs [] [] nesting_map_ids'' []) |
51814 | 716 |
dtor_unfold_thms pre_map_defs ctr_defss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
717 |
val corec_tacss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
718 |
map3 (map oo mk_coiter_tac corec_defs nested_map_comps'' nested_map_comp's |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
719 |
(nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs) |
51814 | 720 |
dtor_corec_thms pre_map_defs ctr_defss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
721 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
722 |
fun prove goal tac = |
51815 | 723 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
724 |
|> Thm.close_derivation; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
725 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
726 |
val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
727 |
val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
728 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
729 |
val filter_safesss = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
730 |
map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
731 |
curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
732 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
733 |
val safe_unfold_thmss = filter_safesss unfold_thmss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
734 |
val safe_corec_thmss = filter_safesss corec_thmss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
735 |
in |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
736 |
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
737 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
738 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
739 |
val (disc_unfold_iff_thmss, disc_corec_iff_thmss) = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
740 |
let |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
741 |
fun mk_goal c cps fcoiter n k disc = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
742 |
mk_Trueprop_eq (disc $ (fcoiter $ c), |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
743 |
if n = 1 then @{const True} |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
744 |
else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
745 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
746 |
val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
747 |
val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
748 |
|
51828 | 749 |
fun mk_case_split' cp = Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split}; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
750 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
751 |
val case_splitss' = map (map mk_case_split') cpss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
752 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
753 |
val unfold_tacss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
754 |
map3 (map oo mk_disc_coiter_iff_tac) case_splitss' unfold_thmss disc_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
755 |
val corec_tacss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
756 |
map3 (map oo mk_disc_coiter_iff_tac) case_splitss' corec_thmss disc_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
757 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
758 |
fun prove goal tac = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
759 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
51829 | 760 |
|> singleton (Proof_Context.export names_lthy lthy) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
761 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
762 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
763 |
fun proves [_] [_] = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
764 |
| proves goals tacs = map2 prove goals tacs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
765 |
in |
51828 | 766 |
(map2 proves unfold_goalss unfold_tacss, map2 proves corec_goalss corec_tacss) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
767 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
768 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
769 |
val is_triv_discI = is_triv_implies orf is_concl_refl; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
770 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
771 |
fun mk_disc_coiter_thms coiters discIs = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
772 |
map (op RS) (filter_out (is_triv_discI o snd) (coiters ~~ discIs)); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
773 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
774 |
val disc_unfold_thmss = map2 mk_disc_coiter_thms unfold_thmss discIss; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
775 |
val disc_corec_thmss = map2 mk_disc_coiter_thms corec_thmss discIss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
776 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
777 |
fun mk_sel_coiter_thm coiter_thm sel sel_thm = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
778 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
779 |
val (domT, ranT) = dest_funT (fastype_of sel); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
780 |
val arg_cong' = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
781 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
782 |
[NONE, NONE, SOME (certify lthy sel)] arg_cong |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
783 |
|> Thm.varifyT_global; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
784 |
val sel_thm' = sel_thm RSN (2, trans); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
785 |
in |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
786 |
coiter_thm RS arg_cong' RS sel_thm' |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
787 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
788 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
789 |
fun mk_sel_coiter_thms coiterss = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
790 |
map3 (map3 (map2 o mk_sel_coiter_thm)) coiterss selsss sel_thmsss |> map flat; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
791 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
792 |
val sel_unfold_thmss = mk_sel_coiter_thms unfold_thmss; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
793 |
val sel_corec_thmss = mk_sel_coiter_thms corec_thmss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
794 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
795 |
val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
796 |
val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
797 |
val coinduct_case_concl_attrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
798 |
map2 (fn casex => fn concls => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
799 |
Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls)))) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
800 |
coinduct_cases coinduct_conclss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
801 |
val coinduct_case_attrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
802 |
coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
803 |
in |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
804 |
((coinduct_thm, coinduct_thms, strong_coinduct_thm, strong_coinduct_thms, coinduct_case_attrs), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
805 |
(unfold_thmss, corec_thmss, []), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
806 |
(safe_unfold_thmss, safe_corec_thmss), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
807 |
(disc_unfold_thmss, disc_corec_thmss, simp_attrs), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
808 |
(disc_unfold_iff_thmss, disc_corec_iff_thmss, simp_attrs), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
809 |
(sel_unfold_thmss, sel_corec_thmss, simp_attrs)) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
810 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
811 |
|
51863 | 812 |
fun define_co_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp |
49633 | 813 |
(wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 = |
49112 | 814 |
let |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
815 |
(* TODO: sanity checks on arguments *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
816 |
|
49286 | 817 |
val _ = if not lfp andalso no_dests then error "Cannot define destructor-less codatatypes" |
49278 | 818 |
else (); |
819 |
||
49633 | 820 |
fun qualify mandatory fp_b_name = |
821 |
Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix); |
|
822 |
||
49367 | 823 |
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
|
824 |
val fp_bs = map type_binding_of specs; |
49498 | 825 |
val fp_b_names = map Binding.name_of fp_bs; |
826 |
val fp_common_name = mk_common_name fp_b_names; |
|
51758 | 827 |
val map_bs = map map_binding_of specs; |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
828 |
val rel_bs = map rel_binding_of specs; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
829 |
|
51758 | 830 |
fun prepare_type_arg (_, (ty, c)) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
831 |
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
|
832 |
TFree (s, prepare_constraint no_defs_lthy0 c) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
833 |
end; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
834 |
|
51758 | 835 |
val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of) specs; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
836 |
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
|
837 |
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; |
51758 | 838 |
val set_bss = map (map fst o type_args_named_constrained_of) specs; |
49119 | 839 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
840 |
val (((Bs0, Cs), Xs), no_defs_lthy) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
841 |
no_defs_lthy0 |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
842 |
|> 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
|
843 |
|> mk_TFrees (length unsorted_As) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
844 |
||>> mk_TFrees nn |
51858
7a08fe1e19b1
added and moved library functions (used in primrec code)
blanchet
parents:
51857
diff
changeset
|
845 |
||>> variant_tfrees fp_b_names; |
49119 | 846 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
847 |
(* TODO: cleaner handling of fake contexts, without "background_theory" *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
848 |
(*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
|
849 |
locale and shadows an existing global type*) |
51768 | 850 |
|
51769
5c657ca97d99
simplified code -- no need for two attempts, the error we get from mixfix the first time is good (and better to get than a parse error in the specification because the user tries to use a mixfix that silently failed)
blanchet
parents:
51768
diff
changeset
|
851 |
fun add_fake_type spec = |
51768 | 852 |
Sign.add_type no_defs_lthy (type_binding_of spec, |
51769
5c657ca97d99
simplified code -- no need for two attempts, the error we get from mixfix the first time is good (and better to get than a parse error in the specification because the user tries to use a mixfix that silently failed)
blanchet
parents:
51768
diff
changeset
|
853 |
length (type_args_named_constrained_of spec), mixfix_of spec); |
51768 | 854 |
|
51769
5c657ca97d99
simplified code -- no need for two attempts, the error we get from mixfix the first time is good (and better to get than a parse error in the specification because the user tries to use a mixfix that silently failed)
blanchet
parents:
51768
diff
changeset
|
855 |
val fake_thy = Theory.copy #> fold add_fake_type specs; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
856 |
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; |
49119 | 857 |
|
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
|
858 |
fun mk_fake_T b = |
49121 | 859 |
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
|
860 |
unsorted_As); |
49121 | 861 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
862 |
val fake_Ts = map mk_fake_T fp_bs; |
49121 | 863 |
|
49181 | 864 |
val mixfixes = map mixfix_of specs; |
49119 | 865 |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
866 |
val _ = (case duplicates Binding.eq_name fp_bs of [] => () |
49119 | 867 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
868 |
||
49121 | 869 |
val ctr_specss = map ctr_specs_of specs; |
49119 | 870 |
|
49336 | 871 |
val disc_bindingss = map (map disc_of) ctr_specss; |
872 |
val ctr_bindingss = |
|
49633 | 873 |
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; |
49121 | 874 |
val ctr_argsss = map (map args_of) ctr_specss; |
49181 | 875 |
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; |
49119 | 876 |
|
49336 | 877 |
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
|
878 |
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
49286 | 879 |
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; |
880 |
||
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
881 |
val (As :: _) :: fake_ctr_Tsss = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
882 |
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
|
883 |
|
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
884 |
val _ = (case duplicates (op =) unsorted_As of [] => () |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
885 |
| A :: _ => error ("Duplicate type parameter " ^ |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
886 |
quote (Syntax.string_of_typ no_defs_lthy A))); |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
887 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
888 |
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
|
889 |
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of |
49165 | 890 |
[] => () |
49342 | 891 |
| A' :: _ => error ("Extra type variable on right-hand side: " ^ |
49204 | 892 |
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); |
49165 | 893 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
894 |
fun eq_fpT_check (T as Type (s, Us)) (Type (s', Us')) = |
49146 | 895 |
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ |
896 |
quote (Syntax.string_of_typ fake_lthy T))) |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
897 |
| eq_fpT_check _ _ = false; |
49146 | 898 |
|
49204 | 899 |
fun freeze_fp (T as Type (s, Us)) = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
900 |
(case find_index (eq_fpT_check T) fake_Ts of |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
901 |
~1 => Type (s, map freeze_fp Us) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
902 |
| kk => nth Xs kk) |
49204 | 903 |
| freeze_fp T = T; |
49121 | 904 |
|
49536 | 905 |
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss; |
906 |
val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs; |
|
49119 | 907 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
908 |
val fp_eqs = |
49536 | 909 |
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; |
49121 | 910 |
|
51839 | 911 |
val (pre_bnfs, (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, dtors = dtors0, |
51805 | 912 |
folds = fp_folds0, recs = fp_recs0, induct = fp_induct, strong_induct = fp_strong_induct, |
913 |
dtor_ctors, ctor_dtors, ctor_injects, map_thms = fp_map_thms, set_thmss = fp_set_thmss, |
|
51859 | 914 |
rel_thms = fp_rel_thms, fold_thms = fp_fold_thms, rec_thms = fp_rec_thms, ...}, lthy)) = |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
915 |
fp_bnf construct_fp fp_bs mixfixes map_bs rel_bs set_bss (map dest_TFree unsorted_As) fp_eqs |
51758 | 916 |
no_defs_lthy0; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
917 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
918 |
val timer = time (Timer.startRealTimer ()); |
49121 | 919 |
|
49363 | 920 |
fun add_nesty_bnf_names Us = |
49226 | 921 |
let |
922 |
fun add (Type (s, Ts)) ss = |
|
923 |
let val (needs, ss') = fold_map add Ts ss in |
|
924 |
if exists I needs then (true, insert (op =) s ss') else (false, ss') |
|
925 |
end |
|
49363 | 926 |
| add T ss = (member (op =) Us T, ss); |
49226 | 927 |
in snd oo add end; |
928 |
||
49363 | 929 |
fun nesty_bnfs Us = |
49536 | 930 |
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); |
49363 | 931 |
|
932 |
val nesting_bnfs = nesty_bnfs As; |
|
49536 | 933 |
val nested_bnfs = nesty_bnfs Xs; |
49226 | 934 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
935 |
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
|
936 |
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
|
937 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
51830 | 938 |
val nesting_set_map's = maps set_map'_of_bnf nesting_bnfs; |
51766
f19a4d0ab1bf
renamed "set_natural" to "set_map", reflecting {Bl,Po,Tr} concensus
blanchet
parents:
51758
diff
changeset
|
939 |
val nested_set_map's = maps set_map'_of_bnf nested_bnfs; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
940 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
941 |
val live = live_of_bnf any_fp_bnf; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
942 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
943 |
val Bs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
944 |
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
|
945 |
(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
|
946 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
947 |
val B_ify = Term.typ_subst_atomic (As ~~ Bs); |
49167 | 948 |
|
49501 | 949 |
val ctors = map (mk_ctor As) ctors0; |
950 |
val dtors = map (mk_dtor As) dtors0; |
|
49124 | 951 |
|
49501 | 952 |
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
|
953 |
|
51780 | 954 |
fun massage_simple_notes base = |
955 |
filter_out (null o #2) |
|
956 |
#> map (fn (thmN, thms, attrs) => |
|
957 |
((qualify true base (Binding.name thmN), attrs), [(thms, [])])); |
|
958 |
||
959 |
val massage_multi_notes = |
|
960 |
maps (fn (thmN, thmss, attrs) => |
|
961 |
if forall null thmss then |
|
962 |
[] |
|
963 |
else |
|
964 |
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => |
|
965 |
((qualify true fp_b_name (Binding.name thmN), attrs T_name), |
|
966 |
[(thms, [])])) fp_b_names fpTs thmss); |
|
967 |
||
49536 | 968 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; |
49203 | 969 |
val ns = map length ctr_Tsss; |
49212 | 970 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 971 |
val mss = map (map length) ctr_Tsss; |
972 |
val Css = map2 replicate ns Cs; |
|
973 |
||
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
974 |
val (fp_folds, fp_fold_fun_Ts) = mk_fp_iter lfp As Cs fp_folds0; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
975 |
val (fp_recs, fp_rec_fun_Ts) = mk_fp_iter lfp As Cs fp_recs0; |
49210 | 976 |
|
51827 | 977 |
val (((fold_only, rec_only), |
51830 | 978 |
(cs, cpss, unfold_only as ((_, crssss, cgssss), (_, g_Tsss, _)), |
979 |
corec_only as ((_, csssss, chssss), (_, h_Tsss, _)))), _) = |
|
49208 | 980 |
if lfp then |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
981 |
mk_fold_rec_terms_types fpTs Css ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy |
51832 | 982 |
|>> rpair ([], [], (([], [], []), ([], [], [])), (([], [], []), ([], [], []))) |
49208 | 983 |
else |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
984 |
mk_unfold_corec_terms_types fpTs Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy |
51831 | 985 |
|>> pair (([], [], []), ([], [], [])); |
49210 | 986 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
987 |
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
|
988 |
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
|
989 |
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
|
990 |
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = |
49176 | 991 |
let |
49498 | 992 |
val fp_b_name = Binding.name_of fp_b; |
993 |
||
49501 | 994 |
val dtorT = domain_type (fastype_of ctor); |
49210 | 995 |
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
|
996 |
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
|
997 |
val case_Ts = map (fn Ts => Ts ---> C) ctr_Tss; |
49119 | 998 |
|
49593 | 999 |
val (((((w, fs), xss), yss), u'), names_lthy) = |
49204 | 1000 |
no_defs_lthy |
49501 | 1001 |
|> yield_singleton (mk_Frees "w") dtorT |
49176 | 1002 |
||>> mk_Frees "f" case_Ts |
49370 | 1003 |
||>> mk_Freess "x" ctr_Tss |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1004 |
||>> mk_Freess "y" (map (map B_ify) ctr_Tss) |
49498 | 1005 |
||>> yield_singleton Variable.variant_fixes fp_b_name; |
49370 | 1006 |
|
49498 | 1007 |
val u = Free (u', fpT); |
49121 | 1008 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1009 |
val tuple_xs = map HOLogic.mk_tuple xss; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1010 |
val tuple_ys = map HOLogic.mk_tuple yss; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1011 |
|
49129 | 1012 |
val ctr_rhss = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1013 |
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
|
1014 |
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; |
49121 | 1015 |
|
49633 | 1016 |
val case_binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ caseN) fp_b); |
49129 | 1017 |
|
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
1018 |
val case_rhs = |
49498 | 1019 |
fold_rev Term.lambda (fs @ [u]) |
49501 | 1020 |
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); |
49129 | 1021 |
|
49201 | 1022 |
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 1023 |
|> 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
|
1024 |
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) |
49336 | 1025 |
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) |
49121 | 1026 |
||> `Local_Theory.restore; |
1027 |
||
1028 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
1029 |
||
1030 |
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
|
1031 |
val ctr_defs' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1032 |
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
|
1033 |
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
|
1034 |
|
49203 | 1035 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
1036 |
val casex0 = Morphism.term phi raw_case; |
|
1037 |
||
1038 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 1039 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1040 |
fun wrap lthy = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1041 |
let |
50170 | 1042 |
fun exhaust_tac {context = ctxt, prems = _} = |
49135 | 1043 |
let |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1044 |
val ctor_iff_dtor_thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1045 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1046 |
val goal = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1047 |
fold_rev Logic.all [w, u] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1048 |
(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
|
1049 |
in |
51551 | 1050 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1051 |
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
|
1052 |
(certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1053 |
|> Thm.close_derivation |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1054 |
|> Morphism.thm phi |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1055 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1056 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1057 |
val sumEN_thm' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1058 |
unfold_thms lthy @{thms all_unit_eq} |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1059 |
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1060 |
(mk_sumEN_balanced n)) |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1061 |
|> Morphism.thm phi; |
49135 | 1062 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1063 |
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' |
49135 | 1064 |
end; |
1065 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1066 |
val inject_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1067 |
map2 (fn 0 => K [] | _ => fn ctr_def => [fn {context = ctxt, ...} => |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1068 |
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
|
1069 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1070 |
val half_distinct_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1071 |
map (map (fn (def, def') => fn {context = ctxt, ...} => |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1072 |
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
|
1073 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1074 |
val case_tacs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1075 |
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
|
1076 |
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
|
1077 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1078 |
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
|
1079 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1080 |
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
|
1081 |
in |
51781 | 1082 |
wrap_free_constructors tacss (((wrap_opts, ctrs0), casex0), (disc_bindings, |
1083 |
(sel_bindingss, sel_defaultss))) lthy |
|
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1084 |
end; |
49121 | 1085 |
|
51840 | 1086 |
fun derive_maps_sets_rels (ctr_sugar, lthy) = |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1087 |
if live = 0 then |
51840 | 1088 |
((([], [], [], []), ctr_sugar), lthy) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1089 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1090 |
let |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1091 |
val rel_flip = rel_flip_of_bnf fp_bnf; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1092 |
val nones = replicate live NONE; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1093 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1094 |
val ctor_cong = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1095 |
if lfp then |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1096 |
Drule.dummy_thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1097 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1098 |
let val ctor' = mk_ctor Bs ctor in |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1099 |
cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor')] arg_cong |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1100 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1101 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1102 |
fun mk_cIn ify = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1103 |
certify lthy o (not lfp ? curry (op $) (map_types ify ctor)) oo |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1104 |
mk_InN_balanced (ify ctr_sum_prod_T) n; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1105 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1106 |
val cxIns = map2 (mk_cIn I) tuple_xs ks; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1107 |
val cyIns = map2 (mk_cIn B_ify) tuple_ys ks; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1108 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1109 |
fun mk_map_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1110 |
fold_thms lthy [ctr_def'] |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1111 |
(unfold_thms lthy (pre_map_def :: |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1112 |
(if lfp then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1113 |
(cterm_instantiate_pos (nones @ [SOME cxIn]) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1114 |
(if lfp then fp_map_thm else fp_map_thm RS ctor_cong))) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1115 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1116 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1117 |
fun mk_set_thm fp_set_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1118 |
fold_thms lthy [ctr_def'] |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1119 |
(unfold_thms lthy (pre_set_defs @ nested_set_map's @ nesting_set_map's @ |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1120 |
(if lfp then [] else [dtor_ctor]) @ sum_prod_thms_set) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1121 |
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1122 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1123 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1124 |
fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns; |
49127 | 1125 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1126 |
val map_thms = map2 mk_map_thm ctr_defs' cxIns; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1127 |
val set_thmss = map mk_set_thms fp_set_thms; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1128 |
|
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1129 |
val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1130 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1131 |
fun mk_rel_thm postproc ctr_defs' cxIn cyIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1132 |
fold_thms lthy ctr_defs' |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1133 |
(unfold_thms lthy (@{thm Inl_Inr_False} :: pre_rel_def :: |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1134 |
(if lfp then [] else [dtor_ctor]) @ sum_prod_thms_rel) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1135 |
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1136 |
|> postproc |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1137 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1138 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1139 |
fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1140 |
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
|
1141 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1142 |
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
|
1143 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1144 |
fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1145 |
mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def'] |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1146 |
cxIn cyIn; |
49121 | 1147 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1148 |
fun mk_other_half_rel_distinct_thm thm = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1149 |
flip_rels lthy live thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1150 |
RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1151 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1152 |
val half_rel_distinct_thmss = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1153 |
map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos); |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1154 |
val other_half_rel_distinct_thmss = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1155 |
map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1156 |
val (rel_distinct_thms, _) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1157 |
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
|
1158 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1159 |
val notes = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1160 |
[(mapN, map_thms, code_simp_attrs), |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1161 |
(rel_distinctN, rel_distinct_thms, code_simp_attrs), |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1162 |
(rel_injectN, rel_inject_thms, code_simp_attrs), |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1163 |
(setsN, flat set_thmss, code_simp_attrs)] |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1164 |
|> massage_simple_notes fp_b_name; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1165 |
in |
51840 | 1166 |
(((map_thms, rel_inject_thms, rel_distinct_thms, set_thmss), ctr_sugar), |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1167 |
lthy |> Local_Theory.notes notes |> snd) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1168 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1169 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1170 |
fun define_fold_rec no_defs_lthy = |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
1171 |
let |
49208 | 1172 |
val fpT_to_C = fpT --> C; |
49199 | 1173 |
|
51854 | 1174 |
fun build_prod_proj mk_proj = build_map lthy (mk_proj o fst); |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
1175 |
|
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset
|
1176 |
(* 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
|
1177 |
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
|
1178 |
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
|
1179 |
| 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
|
1180 |
| mk_U _ T = T; |
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
1181 |
|
51794 | 1182 |
fun unzip_rec (x as Free (_, T)) = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1183 |
if exists_subtype_in fpTs T then |
51794 | 1184 |
([build_prod_proj fst_const (T, mk_U fst T) $ x], |
1185 |
[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
|
1186 |
else |
51794 | 1187 |
([x], []); |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
1188 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1189 |
fun mk_iter_arg f xs = |
51794 | 1190 |
mk_tupled_fun (HOLogic.mk_tuple xs) f (flat_rec unzip_rec xs); |
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset
|
1191 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1192 |
fun generate_iter (suf, ctor_iter, (fss, f_Tss, xsss)) = |
49215 | 1193 |
let |
1194 |
val res_T = fold_rev (curry (op --->)) f_Tss fpT_to_C; |
|
49633 | 1195 |
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); |
49215 | 1196 |
val spec = |
49336 | 1197 |
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1198 |
Term.list_comb (ctor_iter, |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1199 |
map2 (mk_sum_caseN_balanced oo map2 mk_iter_arg) fss xsss)); |
49336 | 1200 |
in (binding, spec) end; |
49199 | 1201 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1202 |
val iter_infos = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1203 |
[(foldN, fp_fold, fold_only), |
49215 | 1204 |
(recN, fp_rec, rec_only)]; |
1205 |
||
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1206 |
val (bindings, specs) = map generate_iter iter_infos |> split_list; |
49215 | 1207 |
|
1208 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49201 | 1209 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
49199 | 1210 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
49336 | 1211 |
#>> apsnd snd) bindings specs |
49199 | 1212 |
||> `Local_Theory.restore; |
49201 | 1213 |
|
1214 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
1215 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1216 |
val [fold_def, rec_def] = map (Morphism.thm phi) defs; |
49201 | 1217 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1218 |
val [foldx, recx] = map (mk_xxiter lfp As Cs o Morphism.term phi) csts; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
1219 |
in |
49693
393d7242adaf
thread the right local theory through + reenable parallel proofs for previously problematic theories
blanchet
parents:
49683
diff
changeset
|
1220 |
((foldx, recx, fold_def, rec_def), lthy') |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
1221 |
end; |
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
1222 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1223 |
fun define_unfold_corec no_defs_lthy = |
49210 | 1224 |
let |
1225 |
val B_to_fpT = C --> fpT; |
|
49211 | 1226 |
|
51854 | 1227 |
fun build_sum_inj mk_inj = build_map lthy (uncurry mk_inj o dest_sumT o snd); |
49683 | 1228 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1229 |
fun build_dtor_coiter_arg _ [] [cf] = cf |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1230 |
| build_dtor_coiter_arg T [cq] [cf, cf'] = |
49683 | 1231 |
mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf) |
1232 |
(build_sum_inj Inr_const (fastype_of cf', T) $ cf') |
|
1233 |
||
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1234 |
val crgsss = map3 (map3 (map3 build_dtor_coiter_arg)) g_Tsss crssss cgssss; |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1235 |
val cshsss = map3 (map3 (map3 build_dtor_coiter_arg)) h_Tsss csssss chssss; |
49683 | 1236 |
|
49276 | 1237 |
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = |
1238 |
Term.lambda c (mk_IfN sum_prod_T cps |
|
1239 |
(map2 (mk_InN_balanced sum_prod_T n) (map HOLogic.mk_tuple cqfss) (1 upto n))); |
|
49275 | 1240 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1241 |
fun generate_coiter (suf, dtor_coiter, (cqfsss, ((pfss, _, _), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1242 |
(f_sum_prod_Ts, _, pf_Tss)))) = |
49211 | 1243 |
let |
1244 |
val res_T = fold_rev (curry (op --->)) pf_Tss B_to_fpT; |
|
49633 | 1245 |
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); |
49211 | 1246 |
val spec = |
49336 | 1247 |
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1248 |
Term.list_comb (dtor_coiter, |
49276 | 1249 |
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); |
49336 | 1250 |
in (binding, spec) end; |
49210 | 1251 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1252 |
val coiter_infos = |
49683 | 1253 |
[(unfoldN, fp_fold, (crgsss, unfold_only)), |
1254 |
(corecN, fp_rec, (cshsss, corec_only))]; |
|
49212 | 1255 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1256 |
val (bindings, specs) = map generate_coiter coiter_infos |> split_list; |
49211 | 1257 |
|
1258 |
val ((csts, defs), (lthy', lthy)) = no_defs_lthy |
|
49210 | 1259 |
|> apfst split_list o fold_map2 (fn b => fn spec => |
1260 |
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) |
|
49336 | 1261 |
#>> apsnd snd) bindings specs |
49210 | 1262 |
||> `Local_Theory.restore; |
1263 |
||
1264 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
1265 |
||
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1266 |
val [unfold_def, corec_def] = map (Morphism.thm phi) defs; |
49210 | 1267 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1268 |
val [unfold, corec] = map (mk_xxiter lfp As Cs o Morphism.term phi) csts; |
49210 | 1269 |
in |
49693
393d7242adaf
thread the right local theory through + reenable parallel proofs for previously problematic theories
blanchet
parents:
49683
diff
changeset
|
1270 |
((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
|
1271 |
end; |
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
1272 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1273 |
fun massage_res (((maps_sets_rels, ctr_sugar), xxiter_res), lthy) = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1274 |
(((maps_sets_rels, (ctrs, xss, ctr_defs, ctr_sugar)), xxiter_res), lthy); |
49119 | 1275 |
in |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1276 |
(wrap |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1277 |
#> derive_maps_sets_rels |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1278 |
##>> (if lfp then define_fold_rec else define_unfold_corec) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1279 |
#> massage_res, lthy') |
49119 | 1280 |
end; |
49167 | 1281 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1282 |
fun wrap_types_etc (wrap_types_etcs, lthy) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1283 |
fold_map I wrap_types_etcs lthy |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1284 |
|>> apsnd split_list4 o apfst (apsnd split_list4 o apfst split_list4 o split_list) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1285 |
o split_list; |
49226 | 1286 |
|
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1287 |
val mk_simp_thmss = |
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
1288 |
map7 (fn {injects, distincts, case_thms, ...} => fn un_folds => fn co_recs => |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1289 |
fn mapsx => fn rel_injects => fn rel_distincts => fn setss => |
51857
17e7f00563fb
tuned names -- co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset
|
1290 |
injects @ distincts @ case_thms @ co_recs @ un_folds @ mapsx @ rel_injects |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1291 |
@ rel_distincts @ flat setss); |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1292 |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1293 |
fun derive_and_note_induct_fold_rec_thms_for_types |
51840 | 1294 |
((((mapsx, rel_injects, rel_distincts, setss), (ctrss, _, ctr_defss, ctr_sugars)), |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1295 |
(folds, recs, fold_defs, rec_defs)), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1296 |
let |
51833 | 1297 |
val ((induct_thm, induct_thms, induct_attrs), (fold_thmss, fold_attrs), |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1298 |
(rec_thmss, rec_attrs)) = |
51827 | 1299 |
derive_induct_fold_rec_thms_for_types pre_bnfs fp_folds0 fp_recs0 fp_induct fp_fold_thms |
1300 |
fp_rec_thms nesting_bnfs nested_bnfs fpTs Cs As ctrss ctr_defss folds recs fold_defs |
|
1301 |
rec_defs lthy; |
|
49201 | 1302 |
|
51830 | 1303 |
val induct_type_attr = Attrib.internal o K o Induct.induct_type; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1304 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1305 |
val simp_thmss = |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1306 |
mk_simp_thmss ctr_sugars fold_thmss rec_thmss mapsx rel_injects rel_distincts setss; |
49438 | 1307 |
|
49337 | 1308 |
val common_notes = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1309 |
(if nn > 1 then [(inductN, [induct_thm], induct_attrs)] else []) |
51780 | 1310 |
|> massage_simple_notes fp_common_name; |
49337 | 1311 |
|
49226 | 1312 |
val notes = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1313 |
[(foldN, fold_thmss, K fold_attrs), |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1314 |
(inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]), |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1315 |
(recN, rec_thmss, K rec_attrs), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1316 |
(simpsN, simp_thmss, K [])] |
51780 | 1317 |
|> massage_multi_notes; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1318 |
in |
51824 | 1319 |
lthy |
1320 |
|> Local_Theory.notes (common_notes @ notes) |> snd |
|
51864 | 1321 |
|> register_fp_sugars true pre_bnfs fp_res ctr_sugars folds recs induct_thm induct_thm |
1322 |
fold_thmss rec_thmss |
|
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1323 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1324 |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1325 |
fun derive_and_note_coinduct_unfold_corec_thms_for_types |
51859 | 1326 |
((((mapsx, rel_injects, rel_distincts, setss), (_, _, ctr_defss, ctr_sugars)), |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1327 |
(unfolds, corecs, unfold_defs, corec_defs)), lthy) = |
49212 | 1328 |
let |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1329 |
val ((coinduct_thm, coinduct_thms, strong_coinduct_thm, strong_coinduct_thms, |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1330 |
coinduct_attrs), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1331 |
(unfold_thmss, corec_thmss, coiter_attrs), |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1332 |
(safe_unfold_thmss, safe_corec_thmss), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1333 |
(disc_unfold_thmss, disc_corec_thmss, disc_coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1334 |
(disc_unfold_iff_thmss, disc_corec_iff_thmss, disc_coiter_iff_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1335 |
(sel_unfold_thmss, sel_corec_thmss, sel_coiter_attrs)) = |
51829 | 1336 |
derive_coinduct_unfold_corec_thms_for_types pre_bnfs fp_folds0 fp_recs0 fp_induct |
51811 | 1337 |
fp_strong_induct dtor_ctors fp_fold_thms fp_rec_thms nesting_bnfs nested_bnfs fpTs Cs As |
51840 | 1338 |
kss mss ns ctr_defss ctr_sugars unfolds corecs unfold_defs corec_defs lthy; |
49212 | 1339 |
|
51830 | 1340 |
val coinduct_type_attr = Attrib.internal o K o Induct.coinduct_type; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1341 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1342 |
fun flat_coiter_thms coiters disc_coiters sel_coiters = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1343 |
coiters @ disc_coiters @ sel_coiters; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1344 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1345 |
val simp_thmss = |
51840 | 1346 |
mk_simp_thmss ctr_sugars |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1347 |
(map3 flat_coiter_thms safe_unfold_thmss disc_unfold_thmss sel_unfold_thmss) |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1348 |
(map3 flat_coiter_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1349 |
mapsx rel_injects rel_distincts setss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1350 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1351 |
val anonymous_notes = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset
|
1352 |
[(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
|
1353 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
49266 | 1354 |
|
49342 | 1355 |
val common_notes = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1356 |
(if nn > 1 then |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1357 |
[(coinductN, [coinduct_thm], coinduct_attrs), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1358 |
(strong_coinductN, [strong_coinduct_thm], coinduct_attrs)] |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1359 |
else |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1360 |
[]) |
51780 | 1361 |
|> massage_simple_notes fp_common_name; |
49342 | 1362 |
|
49212 | 1363 |
val notes = |
51780 | 1364 |
[(coinductN, map single coinduct_thms, |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1365 |
fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1366 |
(corecN, corec_thmss, K coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1367 |
(disc_corecN, disc_corec_thmss, K disc_coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1368 |
(disc_corec_iffN, disc_corec_iff_thmss, K disc_coiter_iff_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1369 |
(disc_unfoldN, disc_unfold_thmss, K disc_coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1370 |
(disc_unfold_iffN, disc_unfold_iff_thmss, K disc_coiter_iff_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1371 |
(sel_corecN, sel_corec_thmss, K sel_coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1372 |
(sel_unfoldN, sel_unfold_thmss, K sel_coiter_attrs), |
51780 | 1373 |
(simpsN, simp_thmss, K []), |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1374 |
(strong_coinductN, map single strong_coinduct_thms, K coinduct_attrs), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1375 |
(unfoldN, unfold_thmss, K coiter_attrs)] |
51780 | 1376 |
|> massage_multi_notes; |
49212 | 1377 |
in |
51824 | 1378 |
lthy |
1379 |
|> Local_Theory.notes (anonymous_notes @ common_notes @ notes) |> snd |
|
51864 | 1380 |
|> register_fp_sugars false pre_bnfs fp_res ctr_sugars unfolds corecs coinduct_thm |
1381 |
strong_coinduct_thm unfold_thmss corec_thmss |
|
49212 | 1382 |
end; |
1383 |
||
49204 | 1384 |
val lthy' = lthy |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1385 |
|> 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
|
1386 |
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
|
1387 |
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
|
1388 |
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
|
1389 |
raw_sel_defaultsss) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1390 |
|> wrap_types_etc |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1391 |
|> (if lfp then derive_and_note_induct_fold_rec_thms_for_types |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1392 |
else derive_and_note_coinduct_unfold_corec_thms_for_types); |
49167 | 1393 |
|
1394 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
51863 | 1395 |
datatype_word lfp)); |
49112 | 1396 |
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
|
1397 |
timer; lthy' |
49112 | 1398 |
end; |
1399 |
||
51863 | 1400 |
val co_datatypes = define_co_datatypes (K I) (K I) (K I); |
49297 | 1401 |
|
51863 | 1402 |
val co_datatype_cmd = |
1403 |
define_co_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term; |
|
49119 | 1404 |
|
49112 | 1405 |
val parse_ctr_arg = |
49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset
|
1406 |
@{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
|
1407 |
(Parse.typ >> pair Binding.empty); |
49112 | 1408 |
|
49286 | 1409 |
val parse_defaults = |
1410 |
@{keyword "("} |-- @{keyword "defaults"} |-- Scan.repeat parse_bound_term --| @{keyword ")"}; |
|
1411 |
||
51758 | 1412 |
val parse_type_arg_constrained = |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1413 |
Parse.type_ident -- Scan.option (@{keyword "::"} |-- Parse.!!! Parse.sort); |
51758 | 1414 |
|
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1415 |
val parse_type_arg_named_constrained = parse_opt_binding_colon -- parse_type_arg_constrained; |
51758 | 1416 |
|
1417 |
val parse_type_args_named_constrained = |
|
1418 |
parse_type_arg_constrained >> (single o pair Binding.empty) || |
|
1419 |
@{keyword "("} |-- Parse.!!! (Parse.list1 parse_type_arg_named_constrained --| @{keyword ")"}) || |
|
51756 | 1420 |
Scan.succeed []; |
1421 |
||
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1422 |
val parse_map_rel_binding = Parse.short_ident --| @{keyword ":"} -- parse_binding; |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1423 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1424 |
val no_map_rel = (Binding.empty, Binding.empty); |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1425 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1426 |
(* "map" and "rel" are purposedly not registered as keywords, because they are short and nice names |
51833 | 1427 |
that we don't want them to be highlighted everywhere. *) |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1428 |
fun extract_map_rel ("map", b) = apfst (K b) |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1429 |
| extract_map_rel ("rel", b) = apsnd (K b) |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1430 |
| extract_map_rel (s, _) = error ("Expected \"map\" or \"rel\" instead of " ^ quote s); |
49112 | 1431 |
|
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1432 |
val parse_map_rel_bindings = |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1433 |
@{keyword "("} |-- Scan.repeat parse_map_rel_binding --| @{keyword ")"} |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1434 |
>> (fn ps => fold extract_map_rel ps no_map_rel) || |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1435 |
Scan.succeed no_map_rel; |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1436 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1437 |
val parse_ctr_spec = |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1438 |
parse_opt_binding_colon -- parse_binding -- Scan.repeat parse_ctr_arg -- |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1439 |
Scan.optional parse_defaults [] -- Parse.opt_mixfix; |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1440 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1441 |
val parse_spec = |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1442 |
parse_type_args_named_constrained -- parse_binding -- parse_map_rel_bindings -- |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1443 |
Parse.opt_mixfix -- (@{keyword "="} |-- Parse.enum1 "|" parse_ctr_spec); |
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1444 |
|
51863 | 1445 |
val parse_co_datatype = parse_wrap_options -- Parse.and_list1 parse_spec; |
49278 | 1446 |
|
51863 | 1447 |
fun parse_co_datatype_cmd lfp construct_fp = parse_co_datatype >> co_datatype_cmd lfp construct_fp; |
49112 | 1448 |
|
1449 |
end; |