author  blanchet 
Wed, 05 Jun 2013 10:05:08 +0200  
changeset 52296  45b5935b11b4 
parent 52295  e8a482afb53d 
child 52297  0215f48d9b64 
permissions  rwrr 
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, 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

12 
fp: BNF_FP_Util.fp_kind, 
51838  13 
index: int, 
52294  14 
Xs: typ list, 
15 
ctr_TsssXs : typ list list list, 

51838  16 
pre_bnfs: BNF_Def.bnf list, 
51850
106afdf5806c
renamed a few FPrelated files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents:
51847
diff
changeset

17 
fp_res: BNF_FP_Util.fp_result, 
51906  18 
ctr_defss: thm list list, 
51842  19 
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

20 
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

21 
co_recs: term list, 
51864  22 
co_induct: thm, 
23 
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

24 
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

25 
co_rec_thmss: thm list list}; 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

26 

52295  27 
val of_fp_sugar: (fp_sugar > 'a list) > fp_sugar > 'a 
51896  28 
val morph_fp_sugar: morphism > fp_sugar > fp_sugar 
29 
val fp_sugar_of: Proof.context > string > fp_sugar option 

51852  30 

51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

31 
val tvar_subst: theory > typ list > typ list > ((string * int) * typ) list 
51860  32 
val exists_subtype_in: typ list > typ > bool 
52292  33 
val flat_rec: ('a > 'b list) > 'a list > 'b list 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

34 
val mk_co_iter: theory > BNF_FP_Util.fp_kind > typ > typ list > term > term 
51907  35 
val nesty_bnfs: Proof.context > typ list list list > typ list > BNF_Def.bnf list 
51855  36 
val indexify_fst: ''a list > (int > ''a * 'b > 'c) > ''a * 'b > 'c 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

37 
val mk_un_fold_co_rec_prelims: BNF_FP_Util.fp_kind > typ list > typ list > int list > 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

38 
int list list > term list > term list > Proof.context > 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

39 
(term list * term list * ((term list list * typ list list * term list list list list) 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

40 
* (term list list * typ list list * term list list list list)) option 
51903  41 
* (term list * term list list 
42 
* ((term list list * term list list list list * term list list list list) 

43 
* (typ list * typ list list list * typ list list)) 

44 
* ((term list list * term list list list list * term list list list list) 

45 
* (typ list * typ list list list * typ list list))) option) 

46 
* Proof.context 

52293  47 
val mk_map: int > typ list > typ list > term > term 
51855  48 
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

49 

52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

50 
val mk_iter_fun_arg_typessss: typ list > int list > int list list > term > 
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

51 
typ list list list list 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

52 
val define_fold_rec: (term list list * typ list list * term list list list list) 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

53 
* (term list list * typ list list * term list list list list) > (string > binding) > 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

54 
typ list > typ list > term > term > Proof.context > 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

55 
(term * term * thm * thm) * Proof.context 
51902  56 
val define_unfold_corec: term list * term list list 
57 
* ((term list list * term list list list list * term list list list list) 

58 
* (typ list * typ list list list * typ list list)) 

59 
* ((term list list * term list list list list * term list list list list) 

60 
* (typ list * typ list list list * typ list list)) > 

52172  61 
(string > binding) > typ list > typ list > term > term > Proof.context > 
51902  62 
(term * term * thm * thm) * Proof.context 
51837
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset

63 
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

64 
thm list > thm list > BNF_Def.bnf list > BNF_Def.bnf list > typ list > typ list > 
51912  65 
term list list > thm list list > term list > term list > thm list > thm list > 
51852  66 
local_theory > 
51811  67 
(thm * thm list * Args.src list) * (thm list list * Args.src list) 
51827  68 
* (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

69 
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

70 
thm > thm > thm list > thm list > thm list > BNF_Def.bnf list > BNF_Def.bnf list > 
51829  71 
typ list > typ list > typ list > int list list > int list list > int list > 
51840  72 
thm list list > BNF_Ctr_Sugar.ctr_sugar list > term list > term list > thm list > 
51852  73 
thm list > local_theory > 
51839  74 
(thm * thm list * thm * thm list * Args.src list) 
75 
* (thm list list * thm list list * Args.src list) 

51811  76 
* (thm list list * thm list list) * (thm list list * thm list list * Args.src list) 
51824  77 
* (thm list list * thm list list * Args.src list) 
78 
* (thm list list * thm list list * Args.src list) 

51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

79 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

80 
val co_datatypes: BNF_FP_Util.fp_kind > (mixfix list > binding list > binding list > 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

81 
binding list list > binding list > (string * sort) list > typ list * typ list list > 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

82 
BNF_Def.bnf list > local_theory > BNF_FP_Util.fp_result * local_theory) > 
51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

83 
(bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) * 
51758  84 
((((binding * binding) * (binding * typ) list) * (binding * term) list) * 
85 
mixfix) list) list > 

49297  86 
local_theory > local_theory 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

87 
val parse_co_datatype_cmd: BNF_FP_Util.fp_kind > (mixfix list > binding list > binding list > 
51867  88 
binding list list > binding list > (string * sort) list > typ list * typ list list > 
89 
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

90 
(local_theory > local_theory) parser 
49112  91 
end; 
92 

49636  93 
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = 
49112  94 
struct 
95 

49119  96 
open BNF_Util 
51797  97 
open BNF_Ctr_Sugar 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

98 
open BNF_Def 
51850
106afdf5806c
renamed a few FPrelated files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents:
51847
diff
changeset

99 
open BNF_FP_Util 
49636  100 
open BNF_FP_Def_Sugar_Tactics 
49119  101 

51788  102 
val EqN = "Eq_"; 
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset

103 

51840  104 
type fp_sugar = 
51859  105 
{T: typ, 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

106 
fp: fp_kind, 
51838  107 
index: int, 
52294  108 
Xs: typ list, 
109 
ctr_TsssXs : typ list list list, 

51838  110 
pre_bnfs: bnf list, 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

111 
fp_res: fp_result, 
51906  112 
ctr_defss: thm list list, 
51842  113 
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

114 
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

115 
co_recs: term list, 
51864  116 
co_induct: thm, 
117 
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

118 
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

119 
co_rec_thmss: thm list list}; 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

120 

52295  121 
fun of_fp_sugar f (fp_sugar as {index, ...}) = nth (f fp_sugar) index; 
122 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

123 
fun eq_fp_sugar ({T = T1, fp = fp1, index = index1, fp_res = fp_res1, ...} : fp_sugar, 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

124 
{T = T2, fp = fp2, index = index2, fp_res = fp_res2, ...} : fp_sugar) = 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

125 
T1 = T2 andalso fp1 = fp2 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

126 

52294  127 
(* There is no point in morphing the lowlevel fields "Xs" and "ctr_TsssXs". *) 
128 
fun morph_fp_sugar phi {T, fp, index, Xs, ctr_TsssXs, pre_bnfs, fp_res, ctr_defss, ctr_sugars, 

129 
un_folds, co_recs, co_induct, strong_co_induct, un_fold_thmss, co_rec_thmss} = 

130 
{T = Morphism.typ phi T, fp = fp, index = index, pre_bnfs = map (morph_bnf phi) pre_bnfs, 

131 
Xs = Xs, ctr_TsssXs = ctr_TsssXs, fp_res = morph_fp_result phi fp_res, 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

132 
ctr_defss = map (map (Morphism.thm phi)) ctr_defss, 
51906  133 
ctr_sugars = map (morph_ctr_sugar phi) ctr_sugars, un_folds = map (Morphism.term phi) un_folds, 
134 
co_recs = map (Morphism.term phi) co_recs, co_induct = Morphism.thm phi co_induct, 

135 
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

136 
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

137 
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

138 

38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

139 
structure Data = Generic_Data 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

140 
( 
51840  141 
type T = fp_sugar Symtab.table; 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

142 
val empty = Symtab.empty; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

143 
val extend = I; 
51840  144 
val merge = Symtab.merge eq_fp_sugar; 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

145 
); 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

146 

51840  147 
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

148 

51840  149 
fun register_fp_sugar key fp_sugar = 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

150 
Local_Theory.declaration {syntax = false, pervasive = true} 
51840  151 
(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

152 

52294  153 
fun register_fp_sugars fp Xs ctr_TsssXs pre_bnfs (fp_res as {Ts, ...}) ctr_defss ctr_sugars un_folds 
154 
co_recs co_induct strong_co_induct un_fold_thmss co_rec_thmss lthy = 

51844  155 
(0, lthy) 
51859  156 
> fold (fn T as Type (s, _) => fn (kk, lthy) => (kk + 1, 
52294  157 
register_fp_sugar s {T = T, fp = fp, index = kk, Xs = Xs, ctr_TsssXs = ctr_TsssXs, 
158 
pre_bnfs = pre_bnfs, fp_res = fp_res, ctr_defss = ctr_defss, ctr_sugars = ctr_sugars, 

159 
un_folds = un_folds, co_recs = co_recs, co_induct = co_induct, 

160 
strong_co_induct = strong_co_induct, un_fold_thmss = un_fold_thmss, 

51864  161 
co_rec_thmss = co_rec_thmss} lthy)) Ts 
51824  162 
> snd; 
163 

51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset

164 
(* This function could produce clashes in contrived examples (e.g., "x.A", "x.x_A", "y.A"). *) 
49622  165 
fun quasi_unambiguous_case_names names = 
166 
let 

167 
val ps = map (`Long_Name.base_name) names; 

168 
val dups = Library.duplicates (op =) (map fst ps); 

169 
fun underscore s = 

170 
let val ss = space_explode Long_Name.separator s in 

171 
space_implode "_" (drop (length ss  2) ss) 

172 
end; 

173 
in 

174 
map (fn (base, full) => if member (op =) dups base then underscore full else base) ps 

175 
end; 

176 

49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

177 
val mp_conj = @{thm mp_conj}; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

178 

49300  179 
val simp_attrs = @{attributes [simp]}; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

180 
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; 
49300  181 

51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

182 
fun tvar_subst thy Ts Us = 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

183 
Vartab.fold (cons o apsnd snd) (fold (Sign.typ_match thy) (Ts ~~ Us) Vartab.empty) []; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

184 

51860  185 
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

186 

49342  187 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
188 

51845  189 
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

190 
(case AList.lookup (op =) inst T of 
51845  191 
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

192 
 SOME T' => T') 
51845  193 
 typ_subst_nonatomic inst T = the_default T (AList.lookup (op =) inst T); 
49205  194 

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

196 

51794  197 
fun flat_rec unzipf xs = 
198 
let val ps = map unzipf xs in 

199 
(* The first line below gives the preferred order. The second line is for compatibility with the 

200 
old datatype package: *) 

52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

201 
(* 
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

202 
flat ps 
51795
096b96281e34
for compatibility, generate recursor arguments in the same order as old package
blanchet
parents:
51794
diff
changeset

203 
*) 
52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

204 
map hd ps @ maps tl ps 
51793
22f22172a361
started working on compatibility with old package's recursor
blanchet
parents:
51790
diff
changeset

205 
end; 
22f22172a361
started working on compatibility with old package's recursor
blanchet
parents:
51790
diff
changeset

206 

51829  207 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
208 

209 
fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss 

210 
 flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = 

211 
p :: flat_predss_getterss qss fss @ flat_preds_predsss_gettersss ps qsss fsss; 

212 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

213 
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

214 
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs; 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

215 
fun mk_uncurried2_fun f xss = 
52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

216 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat_rec I xss); 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

217 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

218 
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

219 
Abs ("x", T1, Abs ("y", T2, Var (x, T2 > T1 > T3) $ Bound 0 $ Bound 1)); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

220 

5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

221 
fun flip_rels lthy n thm = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

222 
let 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

223 
val Rs = Term.add_vars (prop_of thm) []; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

224 
val Rs' = rev (drop (length Rs  n) Rs); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

225 
val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs'; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

226 
in 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

227 
Drule.cterm_instantiate cRs thm 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

228 
end; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

229 

49536  230 
fun mk_ctor_or_dtor get_T Ts t = 
231 
let val Type (_, Ts0) = get_T (fastype_of t) in 

232 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

233 
end; 

234 

235 
val mk_ctor = mk_ctor_or_dtor range_type; 

236 
val mk_dtor = mk_ctor_or_dtor domain_type; 

237 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

238 
fun mk_co_iter thy fp fpT Cs t = 
49536  239 
let 
240 
val (bindings, body) = strip_type (fastype_of t); 

52197  241 
val (f_Cs, prebody) = split_last bindings; 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

242 
val fpT0 = if fp = Least_FP then prebody else body; 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

243 
val Cs0 = distinct (op =) (map (if fp = Least_FP then body_type else domain_type) f_Cs); 
52197  244 
val rho = tvar_subst thy (fpT0 :: Cs0) (fpT :: Cs); 
49536  245 
in 
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

246 
Term.subst_TVars rho t 
49536  247 
end; 
248 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

249 
fun mk_co_iters thy fp fpTs Cs ts0 = 
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

250 
let 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

251 
val nn = length fpTs; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

252 
val (fpTs0, Cs0) = 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

253 
map ((fp = Greatest_FP ? swap) o dest_funT o snd o strip_typeN nn o fastype_of) ts0 
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

254 
> split_list; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

255 
val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs); 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

256 
in 
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

257 
map (Term.subst_TVars rho) ts0 
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

258 
end; 
51827  259 

52169  260 
val mk_fp_iter_fun_types = fst o split_last o binder_types o fastype_of; 
261 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

262 
fun meta_unzip_rec getT left right nested fpTs y = 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

263 
let val T = getT y in 
52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

264 
if member (op =) fpTs T then [left y, right y] 
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

265 
else if exists_subtype_in fpTs T then [nested y] 
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

266 
else [y] 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

267 
end; 
52208  268 

52209  269 
fun project_co_recT special_Tname fpTs proj = 
51827  270 
let 
52209  271 
fun project (Type (s, Ts as T :: Ts')) = 
272 
if s = special_Tname andalso member (op =) fpTs T then proj (hd Ts, hd Ts') 

273 
else Type (s, map project Ts) 

274 
 project T = T; 

275 
in project end; 

276 

277 
val project_recT = project_co_recT @{type_name prod}; 

278 
val project_corecT = project_co_recT @{type_name sum}; 

279 

52296  280 
fun unzip_recT Cs (T as Type (@{type_name prod}, Ts as [_, U])) = 
281 
if member (op =) Cs U then Ts else [T] 

52216  282 
 unzip_recT _ T = [T]; 
51827  283 

51846  284 
fun mk_fun_arg_typess n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type; 
285 

52296  286 
fun mk_iter_fun_arg_typessss Cs ns mss = 
51885  287 
mk_fp_iter_fun_types 
288 
#> map3 mk_fun_arg_typess ns mss 

52296  289 
#> map (map (map (unzip_recT Cs))); 
51885  290 

52296  291 
fun mk_fold_rec_args_types Cs ns mss ctor_fold_fun_Ts ctor_rec_fun_Ts lthy = 
51832  292 
let 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

293 
val Css = map2 replicate ns Cs; 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

294 
val y_Tsss = map3 mk_fun_arg_typess ns mss ctor_fold_fun_Ts; 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

295 
val g_Tss = map2 (fn C => map (fn y_Ts => y_Ts > C)) Cs y_Tsss; 
51832  296 

297 
val ((gss, ysss), lthy) = 

298 
lthy 

299 
> mk_Freess "f" g_Tss 

300 
>> mk_Freesss "x" y_Tsss; 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

301 
val yssss = map (map (map single)) ysss; 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

302 

4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

303 
val z_Tssss = 
52296  304 
map3 (fn n => fn ms => map2 (map (unzip_recT Cs) oo dest_tupleT) ms o 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

305 
dest_sumTN_balanced n o domain_type) ns mss ctor_rec_fun_Ts; 
51832  306 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

307 
val z_Tsss = map3 mk_fun_arg_typess ns mss ctor_rec_fun_Ts; 
52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

308 
val z_Tsss' = map (map (flat_rec I)) z_Tssss; 
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

309 
val h_Tss = map2 (map2 (curry (op >))) z_Tsss' Css; 
51832  310 

311 
val hss = map2 (map2 retype_free) h_Tss gss; 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

312 
val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss; 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

313 
val (zssss_tl, lthy) = 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

314 
lthy 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

315 
> mk_Freessss "y" (map (map (map tl)) z_Tssss); 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

316 
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; 
51832  317 
in 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

318 
(((gss, g_Tss, yssss), (hss, h_Tss, zssss)), lthy) 
51832  319 
end; 
320 

51888  321 
fun mk_unfold_corec_args_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy = 
51829  322 
let 
323 
(*avoid "'a itself" arguments in coiterators and corecursors*) 

324 
fun repair_arity [0] = [1] 

325 
 repair_arity ms = ms; 

326 

52296  327 
(* FIXME: Can use "Cs" instead? *) 
51829  328 
fun unzip_corecT T = 
52209  329 
if exists_subtype_in fpTs T then [project_corecT fpTs fst T, project_corecT fpTs snd T] 
330 
else [T]; 

51829  331 

51831  332 
val p_Tss = map2 (fn n => replicate (Int.max (0, n  1)) o mk_pred1T) ns Cs; 
51829  333 

334 
fun mk_types maybe_unzipT fun_Ts = 

335 
let 

336 
val f_sum_prod_Ts = map range_type fun_Ts; 

337 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 

338 
val f_Tsss = map2 (map2 dest_tupleT o repair_arity) mss f_prod_Tss; 

51889  339 
val f_Tssss = map2 (fn C => map (map (map (curry (op >) C) o maybe_unzipT))) Cs f_Tsss; 
51829  340 
val q_Tssss = 
52213  341 
map (map (map (fn [_] => []  [_, T] => [mk_pred1T (domain_type T)]))) f_Tssss; 
51829  342 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
51889  343 
in (q_Tssss, f_Tssss, (f_sum_prod_Ts, f_Tsss, pf_Tss)) end; 
51829  344 

51889  345 
val (r_Tssss, g_Tssss, unfold_types) = mk_types single dtor_unfold_fun_Ts; 
346 
val (s_Tssss, h_Tssss, corec_types) = mk_types unzip_corecT dtor_corec_fun_Ts; 

51831  347 

51829  348 
val (((cs, pss), gssss), lthy) = 
349 
lthy 

350 
> mk_Frees "a" Cs 

351 
>> mk_Freess "p" p_Tss 

352 
>> mk_Freessss "g" g_Tssss; 

353 
val rssss = map (map (map (fn [] => []))) r_Tssss; 

354 

355 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 

356 
val ((sssss, hssss_tl), lthy) = 

357 
lthy 

358 
> mk_Freessss "q" s_Tssss 

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

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

51831  361 

362 
val cpss = map2 (map o rapp) cs pss; 

51829  363 

51889  364 
fun mk_args qssss fssss = 
51831  365 
let 
366 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 

367 
val cqssss = map2 (map o map o map o rapp) cs qssss; 

368 
val cfssss = map2 (map o map o map o rapp) cs fssss; 

369 
in (pfss, cqssss, cfssss) end; 

370 

51889  371 
val unfold_args = mk_args rssss gssss; 
372 
val corec_args = mk_args sssss hssss; 

51831  373 
in 
51889  374 
((cs, cpss, (unfold_args, unfold_types), (corec_args, corec_types)), lthy) 
51831  375 
end; 
51829  376 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

377 
fun mk_un_fold_co_rec_prelims fp fpTs Cs ns mss fp_folds0 fp_recs0 lthy = 
51903  378 
let 
52169  379 
val thy = Proof_Context.theory_of lthy; 
380 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

381 
val (fp_fold_fun_Ts, fp_folds) = mk_co_iters thy fp fpTs Cs fp_folds0 
52173  382 
> `(mk_fp_iter_fun_types o hd); 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

383 
val (fp_rec_fun_Ts, fp_recs) = mk_co_iters thy fp fpTs Cs fp_recs0 
52173  384 
> `(mk_fp_iter_fun_types o hd); 
51903  385 

386 
val ((fold_rec_args_types, unfold_corec_args_types), lthy') = 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

387 
if fp = Least_FP then 
52296  388 
mk_fold_rec_args_types Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy 
51903  389 
>> (rpair NONE o SOME) 
390 
else 

391 
mk_unfold_corec_args_types fpTs Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy 

392 
>> (pair NONE o SOME) 

393 
in 

394 
((fp_folds, fp_recs, fold_rec_args_types, unfold_corec_args_types), lthy') 

395 
end; 

396 

49536  397 
fun mk_map live Ts Us t = 
398 
let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) >> List.last in 

399 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 

400 
end; 

401 

49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

402 
fun mk_rel live Ts Us t = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

403 
let val [Type (_, Ts0), Type (_, Us0)] = binder_types (snd (strip_typeN live (fastype_of t))) in 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

404 
Term.subst_atomic_types (Ts0 @ Us0 ~~ Ts @ Us) t 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

405 
end; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

406 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

407 
fun liveness_of_fp_bnf n bnf = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

408 
(case T_of_bnf bnf of 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

409 
Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

410 
 _ => replicate n false); 
49536  411 

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

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

414 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  415 

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

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

417 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  418 

49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

419 
fun reassoc_conjs thm = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

420 
reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]}) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

421 
handle THM _ => thm; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

422 

51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

423 
fun type_args_named_constrained_of ((((ncAs, _), _), _), _) = ncAs; 
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

424 
fun type_binding_of ((((_, b), _), _), _) = b; 
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

425 
fun map_binding_of (((_, (b, _)), _), _) = b; 
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

426 
fun rel_binding_of (((_, (_, b)), _), _) = b; 
49181  427 
fun mixfix_of ((_, mx), _) = mx; 
49121  428 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  429 

49286  430 
fun disc_of ((((disc, _), _), _), _) = disc; 
431 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  434 
fun ctr_mixfix_of (_, mx) = mx; 
49119  435 

51907  436 
fun add_nesty_bnf_names Us = 
437 
let 

438 
fun add (Type (s, Ts)) ss = 

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

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

441 
end 

442 
 add T ss = (member (op =) Us T, ss); 

443 
in snd oo add end; 

444 

445 
fun nesty_bnfs ctxt ctr_Tsss Us = 

446 
map_filter (bnf_of ctxt) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_Tsss []); 

447 

51855  448 
fun indexify_fst xs f (x, y) = f (find_index (curry (op =) x) xs) (x, y); 
449 

51854  450 
fun build_map lthy build_simple = 
51853  451 
let 
452 
fun build (TU as (T, U)) = 

453 
if T = U then 

454 
id_const T 

455 
else 

456 
(case TU of 

51854  457 
(Type (s, Ts), Type (s', Us)) => 
458 
if s = s' then 

459 
let 

460 
val bnf = the (bnf_of lthy s); 

461 
val live = live_of_bnf bnf; 

462 
val mapx = mk_map live Ts Us (map_of_bnf bnf); 

463 
val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx))); 

464 
in Term.list_comb (mapx, map build TUs') end 

465 
else 

466 
build_simple TU 

51853  467 
 _ => build_simple TU); 
468 
in build end; 

469 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

470 
fun mk_iter_body lthy fpTs ctor_iter fss xssss = 
51884  471 
let 
52209  472 
fun build_proj sel sel_const (x as Free (_, T)) = 
473 
build_map lthy (sel_const o fst) (T, project_recT fpTs sel T) $ x; 

51884  474 
in 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

475 
Term.list_comb (ctor_iter, map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss) 
51884  476 
end; 
477 

51900  478 
fun mk_preds_getterss_join c cps sum_prod_T cqfss = 
479 
let val n = length cqfss in 

480 
Term.lambda c (mk_IfN sum_prod_T cps 

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

482 
end; 

51886  483 

51900  484 
fun mk_coiter_body lthy cs cpss f_sum_prod_Ts f_Tsss cqssss cfssss dtor_coiter = 
51888  485 
let 
486 
fun build_sum_inj mk_inj = build_map lthy (uncurry mk_inj o dest_sumT o snd); 

487 

488 
fun build_dtor_coiter_arg _ [] [cf] = cf 

489 
 build_dtor_coiter_arg T [cq] [cf, cf'] = 

490 
mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf) 

491 
(build_sum_inj Inr_const (fastype_of cf', T) $ cf') 

492 

493 
val cqfsss = map3 (map3 (map3 build_dtor_coiter_arg)) f_Tsss cqssss cfssss; 

494 
in 

51900  495 
Term.list_comb (dtor_coiter, map4 mk_preds_getterss_join cs cpss f_sum_prod_Ts cqfsss) 
51888  496 
end; 
51886  497 

52172  498 
fun define_fold_rec (fold_only, rec_only) mk_binding fpTs Cs ctor_fold ctor_rec lthy0 = 
51897  499 
let 
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

500 
val thy = Proof_Context.theory_of lthy0; 
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

501 

51899  502 
val nn = length fpTs; 
503 

52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

504 
val fpT_to_C as Type (_, [fpT, _]) = snd (strip_typeN nn (fastype_of ctor_fold)); 
51897  505 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

506 
fun generate_iter (suf, ctor_iter, (fss, f_Tss, xssss)) = 
51897  507 
let 
51899  508 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 
51897  509 
val binding = mk_binding suf; 
510 
val spec = 

511 
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)), 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

512 
mk_iter_body lthy0 fpTs ctor_iter fss xssss); 
51897  513 
in (binding, spec) end; 
514 

515 
val binding_specs = 

516 
map generate_iter [(foldN, ctor_fold, fold_only), (recN, ctor_rec, rec_only)]; 

517 

51907  518 
val ((csts, defs), (lthy', lthy)) = lthy0 
51897  519 
> apfst split_list o fold_map (fn (b, spec) => 
520 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 

521 
#>> apsnd snd) binding_specs 

522 
> `Local_Theory.restore; 

523 

524 
val phi = Proof_Context.export_morphism lthy lthy'; 

525 

526 
val [fold_def, rec_def] = map (Morphism.thm phi) defs; 

527 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

528 
val [foldx, recx] = map (mk_co_iter thy Least_FP fpT Cs o Morphism.term phi) csts; 
51897  529 
in 
530 
((foldx, recx, fold_def, rec_def), lthy') 

531 
end; 

532 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

533 
(* TODO: merge with above function? *) 
52172  534 
fun define_unfold_corec (cs, cpss, unfold_only, corec_only) mk_binding fpTs Cs dtor_unfold 
51907  535 
dtor_corec lthy0 = 
51897  536 
let 
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

537 
val thy = Proof_Context.theory_of lthy0; 
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

538 

51899  539 
val nn = length fpTs; 
540 

52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset

541 
val C_to_fpT as Type (_, [_, fpT]) = snd (strip_typeN nn (fastype_of dtor_unfold)); 
51897  542 

543 
fun generate_coiter (suf, dtor_coiter, ((pfss, cqssss, cfssss), 

544 
(f_sum_prod_Ts, f_Tsss, pf_Tss))) = 

545 
let 

51899  546 
val res_T = fold_rev (curry (op >)) pf_Tss C_to_fpT; 
51897  547 
val binding = mk_binding suf; 
548 
val spec = 

549 
mk_Trueprop_eq (lists_bmoc pfss (Free (Binding.name_of binding, res_T)), 

51907  550 
mk_coiter_body lthy0 cs cpss f_sum_prod_Ts f_Tsss cqssss cfssss dtor_coiter); 
51897  551 
in (binding, spec) end; 
552 

553 
val binding_specs = 

554 
map generate_coiter [(unfoldN, dtor_unfold, unfold_only), (corecN, dtor_corec, corec_only)]; 

555 

51907  556 
val ((csts, defs), (lthy', lthy)) = lthy0 
51897  557 
> apfst split_list o fold_map (fn (b, spec) => 
558 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 

559 
#>> apsnd snd) binding_specs 

560 
> `Local_Theory.restore; 

561 

562 
val phi = Proof_Context.export_morphism lthy lthy'; 

563 

564 
val [unfold_def, corec_def] = map (Morphism.thm phi) defs; 

565 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

566 
val [unfold, corec] = map (mk_co_iter thy Greatest_FP fpT Cs o Morphism.term phi) csts; 
51897  567 
in 
568 
((unfold, corec, unfold_def, corec_def), lthy') 

52172  569 
end ; 
51897  570 

52171  571 
fun derive_induct_fold_rec_thms_for_types pre_bnfs ctor_folds ctor_recs ctor_induct ctor_fold_thms 
51912  572 
ctor_rec_thms nesting_bnfs nested_bnfs fpTs Cs ctrss ctr_defss folds recs fold_defs rec_defs 
51827  573 
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

574 
let 
51827  575 
val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss; 
576 

51815  577 
val nn = length pre_bnfs; 
51827  578 
val ns = map length ctr_Tsss; 
579 
val mss = map (map length) ctr_Tsss; 

51815  580 

51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

581 
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

582 
val pre_set_defss = map set_defs_of_bnf pre_bnfs; 
51830  583 
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

584 
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

585 
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

586 

51816  587 
val fp_b_names = map base_name_of_typ fpTs; 
51811  588 

52171  589 
val ctor_fold_fun_Ts = mk_fp_iter_fun_types (hd ctor_folds); 
590 
val ctor_rec_fun_Ts = mk_fp_iter_fun_types (hd ctor_recs); 

51827  591 

51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset

592 
val (((gss, _, _), (hss, _, _)), names_lthy0) = 
52296  593 
mk_fold_rec_args_types Cs ns mss ctor_fold_fun_Ts ctor_rec_fun_Ts lthy; 
51827  594 

51832  595 
val ((((ps, ps'), xsss), us'), names_lthy) = 
596 
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

597 
> mk_Frees' "P" (map mk_pred1T fpTs) 
51827  598 
>> mk_Freesss "x" ctr_Tsss 
51816  599 
>> 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

600 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

601 
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

602 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

603 
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

604 
let 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

605 
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

606 
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

607 
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

608 
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

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

610 
~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

611 
 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

612 
in 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

614 
end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

615 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

616 
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

617 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

618 
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

619 
let 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

620 
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

621 
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

622 
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

623 
end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

624 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

625 
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

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

627 
~1 => 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

629 
NONE => [] 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

630 
 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

631 
let 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

632 
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

633 
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

634 
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

635 
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

636 
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

637 
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

638 
in 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

639 
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

640 
end) 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

641 
 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

642 
 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

643 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

644 
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

645 
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

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

647 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

648 
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

649 
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

650 
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

651 
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

652 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

653 
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

654 
let 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

655 
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

656 
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

657 
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

658 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

659 
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

660 
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

661 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

662 
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

663 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

664 
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

665 
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

666 
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

667 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

668 
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

669 

51814  670 
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

671 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

672 
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

673 
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

674 
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

675 
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

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

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

678 
in 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

679 
`(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

680 
end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

681 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

682 
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

683 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

684 
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

685 
let 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

686 
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

687 
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

688 
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

689 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

690 
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

691 
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

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

693 

51845  694 
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

695 

52217  696 
fun mk_nested_U maybe_mk_prodT = 
697 
typ_subst_nonatomic (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs); 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

698 

4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

699 
fun unzip_iters fiters maybe_tick maybe_mk_prodT = 
52208  700 
meta_unzip_rec (snd o dest_Free) I 
701 
(fn x as Free (_, T) => build_map lthy (indexify_fst fpTs (K o nth fiters)) 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

702 
(T, mk_U T) $ x) 
52217  703 
(fn x as Free (_, T) => build_map lthy (indexify_fst fpTs (fn kk => fn _ => 
704 
maybe_tick (nth us kk) (nth fiters kk))) (T, mk_nested_U maybe_mk_prodT T) $ x) 

52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

705 
fpTs; 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

706 

4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

707 
fun tick u f = Term.lambda u (HOLogic.mk_prod (u, f $ u)); 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

708 

52215
7facaee8586f
tuning (use lists rather than pairs of lists throughout)
blanchet
parents:
52214
diff
changeset

709 
val gxsss = map (map (flat_rec (single o List.last o unzip_iters gfolds (K I) (K I)))) xsss; 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

710 
val hxsss = map (map (flat_rec (unzip_iters hrecs tick (curry HOLogic.mk_prodT)))) 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

711 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

712 
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

713 
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

714 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

715 
val fold_tacss = 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

716 
map2 (map o mk_iter_tac pre_map_defs nesting_map_ids'' fold_defs) 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

717 
ctor_fold_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

718 
val rec_tacss = 
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

719 
map2 (map o mk_iter_tac pre_map_defs (nested_map_ids'' @ nesting_map_ids'') rec_defs) 
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset

720 
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

721 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

722 
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

723 
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

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

725 
in 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

727 
end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

728 

355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

729 
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

730 
in 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

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

733 
end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

734 

52171  735 
fun derive_coinduct_unfold_corec_thms_for_types pre_bnfs dtor_unfolds dtor_corecs dtor_coinduct 
51814  736 
dtor_strong_induct dtor_ctors dtor_unfold_thms dtor_corec_thms nesting_bnfs nested_bnfs fpTs Cs 
51840  737 
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

738 
let 
51815  739 
val nn = length pre_bnfs; 
740 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

741 
val pre_map_defs = map map_def_of_bnf pre_bnfs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

742 
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; 
51830  743 
val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs; 
744 
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

745 
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

746 
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

747 
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

748 

51816  749 
val fp_b_names = map base_name_of_typ fpTs; 
51811  750 

52171  751 
val dtor_unfold_fun_Ts = mk_fp_iter_fun_types (hd dtor_unfolds); 
752 
val dtor_corec_fun_Ts = mk_fp_iter_fun_types (hd dtor_corecs); 

51829  753 

51840  754 
val ctrss = map (map (mk_ctr As) o #ctrs) ctr_sugars; 
755 
val discss = map (map (mk_disc_or_sel As) o #discs) ctr_sugars; 

756 
val selsss = map (map (map (mk_disc_or_sel As)) o #selss) ctr_sugars; 

757 
val exhausts = map #exhaust ctr_sugars; 

758 
val disc_thmsss = map #disc_thmss ctr_sugars; 

759 
val discIss = map #discIs ctr_sugars; 

760 
val sel_thmsss = map #sel_thmss ctr_sugars; 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

761 

51831  762 
val ((cs, cpss, ((pgss, crssss, cgssss), _), ((phss, csssss, chssss), _)), names_lthy0) = 
51888  763 
mk_unfold_corec_args_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy; 
51831  764 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

765 
val (((rs, us'), vs'), names_lthy) = 
51831  766 
names_lthy0 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

767 
> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) 
51816  768 
>> Variable.variant_fixes fp_b_names 
769 
>> Variable.variant_fixes (map (suffix "'") fp_b_names); 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

770 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

771 
val us = map2 (curry Free) us' fpTs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

772 
val udiscss = map2 (map o rapp) us discss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

773 
val uselsss = map2 (map o map o rapp) us selsss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

774 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

775 
val vs = map2 (curry Free) vs' fpTs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

776 
val vdiscss = map2 (map o rapp) vs discss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

777 
val vselsss = map2 (map o map o rapp) vs selsss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

778 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

779 
val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

780 
let 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

781 
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

782 
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

783 
val strong_rs = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

784 
map4 (fn u => fn v => fn uvr => fn uv_eq => 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

785 
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

786 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

787 
fun build_rel rs' T = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

788 
(case find_index (curry (op =) T) fpTs of 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

789 
~1 => 
51856  790 
if exists_subtype_in fpTs T then 
791 
let 

792 
val Type (s, Ts) = T 

793 
val bnf = the (bnf_of lthy s); 

794 
val live = live_of_bnf bnf; 

795 
val rel = mk_rel live Ts Ts (rel_of_bnf bnf); 

796 
val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel))); 

797 
in Term.list_comb (rel, map (build_rel rs') Ts') end 

798 
else 

799 
HOLogic.eq_const T 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

800 
 kk => nth rs' kk); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

801 

51856  802 
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

803 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

804 
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

805 
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

806 
(if null usels then 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

807 
[] 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

808 
else 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

810 
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

811 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

812 
fun mk_prem_concl rs' n udiscs uselss vdiscs vselss = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

813 
Library.foldr1 HOLogic.mk_conj 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

815 
handle List.Empty => @{term True}; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

816 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

817 
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

818 
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

819 
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

820 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

821 
val concl = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

822 
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

824 
uvrs us vs)); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

825 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

826 
fun mk_goal rs' = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

827 
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

828 
concl); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

829 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

830 
val goal = mk_goal rs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

831 
val strong_goal = mk_goal strong_rs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

832 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

833 
fun prove dtor_coinduct' goal = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

834 
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

835 
mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors 
51819  836 
exhausts ctr_defss disc_thmsss sel_thmsss) 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

837 
> singleton (Proof_Context.export names_lthy lthy) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

838 
> Thm.close_derivation; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

839 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

840 
fun postproc nn thm = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

841 
Thm.permute_prems 0 nn 
51828  842 
(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

843 
> Drule.zero_var_indexes 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

844 
> `(conj_dests nn); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

845 
in 
51814  846 
(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

847 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

848 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

849 
fun mk_coinduct_concls ms discs ctrs = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

850 
let 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

851 
fun mk_disc_concl disc = [name_of_disc disc]; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

852 
fun mk_ctr_concl 0 _ = [] 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

853 
 mk_ctr_concl _ ctor = [name_of_ctr ctor]; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

854 
val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]]; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

855 
val ctr_concls = map2 mk_ctr_concl ms ctrs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

856 
in 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

857 
flat (map2 append disc_concls ctr_concls) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

858 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

859 

51816  860 
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

861 
val coinduct_conclss = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

862 
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

863 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

864 
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

865 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

866 
val gunfolds = map (lists_bmoc pgss) unfolds; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

867 
val hcorecs = map (lists_bmoc phss) corecs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

868 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

869 
val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

870 
let 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

871 
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

872 
fold_rev (fold_rev Logic.all) ([c] :: pfss) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

874 
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

875 

51845  876 
val mk_U = typ_subst_nonatomic (map2 pair Cs fpTs); 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

877 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

878 
fun intr_coiters fcoiters [] [cf] = 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

879 
let val T = fastype_of cf in 
51855  880 
if exists_subtype_in Cs T then 
881 
build_map lthy (indexify_fst Cs (K o nth fcoiters)) (T, mk_U T) $ cf 

882 
else 

883 
cf 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

884 
end 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

885 
 intr_coiters fcoiters [cq] [cf, cf'] = 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

886 
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

887 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

888 
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

889 
val cshsss = map2 (map2 (map2 (intr_coiters hcorecs))) csssss chssss; 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

890 

51828  891 
val unfold_goalss = map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss; 
892 
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

893 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

894 
fun mk_map_if_distrib bnf = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

895 
let 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

896 
val mapx = map_of_bnf bnf; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

897 
val live = live_of_bnf bnf; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

898 
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

899 
val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

900 
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

901 
in 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

902 
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

903 
@{thm if_distrib} 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

904 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

905 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

906 
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

907 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

908 
val unfold_tacss = 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

909 
map3 (map oo mk_coiter_tac unfold_defs [] [] nesting_map_ids'' []) 
51814  910 
dtor_unfold_thms pre_map_defs ctr_defss; 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

911 
val corec_tacss = 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

912 
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

913 
(nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs) 
51814  914 
dtor_corec_thms pre_map_defs ctr_defss; 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

915 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

916 
fun prove goal tac = 
51815  917 
Goal.prove_sorry lthy [] [] goal (tac o #context) 
918 
> Thm.close_derivation; 

51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

919 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

920 
val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

921 
val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

922 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

923 
val filter_safesss = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

924 
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

925 
curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

926 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

927 
val safe_unfold_thmss = filter_safesss unfold_thmss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

928 
val safe_corec_thmss = filter_safesss corec_thmss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

929 
in 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

930 
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

931 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

932 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

933 
val (disc_unfold_iff_thmss, disc_corec_iff_thmss) = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

934 
let 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

935 
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

936 
mk_Trueprop_eq (disc $ (fcoiter $ c), 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

937 
if n = 1 then @{const True} 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

938 
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

939 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

940 
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

941 
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

942 

51828  943 
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

944 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

945 
val case_splitss' = map (map mk_case_split') cpss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

946 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

947 
val unfold_tacss = 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

948 
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

949 
val corec_tacss = 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

950 
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

951 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

952 
fun prove goal tac = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

953 
Goal.prove_sorry lthy [] [] goal (tac o #context) 
51829  954 
> singleton (Proof_Context.export names_lthy lthy) 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

955 
> Thm.close_derivation; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

956 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

957 
fun proves [_] [_] = [] 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

958 
 proves goals tacs = map2 prove goals tacs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

959 
in 
51828  960 
(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

961 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

962 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

963 
val is_triv_discI = is_triv_implies orf is_concl_refl; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

964 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

965 
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

966 
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

967 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

968 
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

969 
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

970 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

971 
fun mk_sel_coiter_thm coiter_thm sel sel_thm = 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

972 
let 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

973 
val (domT, ranT) = dest_funT (fastype_of sel); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

974 
val arg_cong' = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

975 
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

976 
[NONE, NONE, SOME (certify lthy sel)] arg_cong 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

977 
> Thm.varifyT_global; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

978 
val sel_thm' = sel_thm RSN (2, trans); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

979 
in 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

980 
coiter_thm RS arg_cong' RS sel_thm' 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

981 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

982 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

983 
fun mk_sel_coiter_thms coiterss = 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

984 
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

985 

51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

986 
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

987 
val sel_corec_thmss = mk_sel_coiter_thms corec_thmss; 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

988 

7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

989 
val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn)); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

990 
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

991 
val coinduct_case_concl_attrs = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

992 
map2 (fn casex => fn concls => 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

993 
Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls)))) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

994 
coinduct_cases coinduct_conclss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

995 
val coinduct_case_attrs = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

996 
coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

997 
in 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

999 
(unfold_thmss, corec_thmss, []), 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

1000 
(safe_unfold_thmss, safe_corec_thmss), 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

1001 
(disc_unfold_thmss, disc_corec_thmss, simp_attrs), 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

1002 
(disc_unfold_iff_thmss, disc_corec_iff_thmss, simp_attrs), 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

1003 
(sel_unfold_thmss, sel_corec_thmss, simp_attrs)) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

1004 
end; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

1005 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

1006 
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp 
49633  1007 
(wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 = 
49112  1008 
let 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

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

1010 

52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

1011 
val _ = if fp = Greatest_FP andalso no_dests then 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

1012 
error "Cannot define destructorless codatatypes" 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

1013 
else 
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

1014 
(); 
49278  1015 

49633  1016 
fun qualify mandatory fp_b_name = 
1017 
Binding.qualify mandatory fp_b_name o (rep_compat ? Binding.qualify false rep_compat_prefix); 

1018 

49367  1019 
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

1020 
val fp_bs = map type_binding_of specs; 
49498  1021 
val fp_b_names = map Binding.name_of fp_bs; 
1022 
val fp_common_name = mk_common_name fp_b_names; 

51758  1023 
val map_bs = map map_binding_of specs; 
51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

1024 
val rel_bs = map rel_binding_of specs; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

1025 

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

1027 
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

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

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

1030 

51758  1031 
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

1032 
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

1033 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
51758  1034 
val set_bss = map (map fst o type_args_named_constrained_of) specs; 
49119  1035 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1036 
val (((Bs0, Cs), Xs), no_defs_lthy) = 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

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

1038 
> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1039 
> mk_TFrees (length unsorted_As) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1040 
>> mk_TFrees nn 
51858
7a08fe1e19b1
added and moved library functions (used in primrec code)
blanchet
parents:
51857
diff
changeset

1041 
>> variant_tfrees fp_b_names; 
49119  1042 

52195  1043 
(* TODO: Cleaner handling of fake contexts, without "background_theory". The case where the new 
1044 
type is defined in a locale and shadows an existing global type is currently not handled. *) 

51768  1045 

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

1046 
fun add_fake_type spec = 
51768  1047 
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

1048 
length (type_args_named_constrained_of spec), mixfix_of spec); 
51768  1049 

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

1050 
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

1051 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  1052 

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

1053 
fun mk_fake_T b = 
49121  1054 
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

1055 
unsorted_As); 
49121  1056 

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

1057 
val fake_Ts = map mk_fake_T fp_bs; 
49121  1058 

49181  1059 
val mixfixes = map mixfix_of specs; 
49119  1060 

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

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

49121  1064 
val ctr_specss = map ctr_specs_of specs; 
49119  1065 

49336  1066 
val disc_bindingss = map (map disc_of) ctr_specss; 
1067 
val ctr_bindingss = 

49633  1068 
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  1069 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  1070 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  1071 

49336  1072 
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

1073 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  1074 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
1075 

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

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

1077 
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

1078 

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

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

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

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

1082 

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

1083 
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

1084 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  1085 
[] => () 
49342  1086 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  1087 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  1088 

49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1089 
fun eq_fpT_check (T as Type (s, Us)) (Type (s', Us')) = 
49146  1090 
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ 
1091 
quote (Syntax.string_of_typ fake_lthy T))) 

49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1092 
 eq_fpT_check _ _ = false; 
49146  1093 

49204  1094 
fun freeze_fp (T as Type (s, Us)) = 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1095 
(case find_index (eq_fpT_check T) fake_Ts of 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1096 
~1 => Type (s, map freeze_fp Us) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1097 
 kk => nth Xs kk) 
49204  1098 
 freeze_fp T = T; 
49121  1099 

49536  1100 
val ctr_TsssXs = map (map (map freeze_fp)) fake_ctr_Tsss; 
1101 
val ctr_sum_prod_TsXs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctr_TsssXs; 

49119  1102 

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

1103 
val fp_eqs = 
49536  1104 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  1105 

51839  1106 
val (pre_bnfs, (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, dtors = dtors0, 
51869  1107 
un_folds = fp_folds0, co_recs = fp_recs0, co_induct = fp_induct, 
1108 
strong_co_induct = fp_strong_induct, dtor_ctors, ctor_dtors, ctor_injects, 

1109 
map_thms = fp_map_thms, set_thmss = fp_set_thmss, rel_thms = fp_rel_thms, 

1110 
un_fold_thms = fp_fold_thms, co_rec_thms = fp_rec_thms, ...}, lthy)) = 

51868  1111 
fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As) fp_eqs 
1112 
no_defs_lthy0; 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1113 

5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1114 
val timer = time (Timer.startRealTimer ()); 
49121  1115 

51907  1116 
val nesting_bnfs = nesty_bnfs lthy ctr_TsssXs As; 
1117 
val nested_bnfs = nesty_bnfs lthy ctr_TsssXs Xs; 

49226  1118 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1119 
val pre_map_defs = map map_def_of_bnf pre_bnfs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1120 
val pre_set_defss = map set_defs_of_bnf pre_bnfs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1121 
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; 
51830  1122 
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

1123 
val nested_set_map's = maps set_map'_of_bnf nested_bnfs; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1124 

5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1125 
val live = live_of_bnf any_fp_bnf; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1126 

5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1127 
val Bs = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1128 
map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1129 
(liveness_of_fp_bnf (length As) any_fp_bnf) As Bs0; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1130 

5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1131 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  1132 

49501  1133 
val ctors = map (mk_ctor As) ctors0; 
1134 
val dtors = map (mk_dtor As) dtors0; 

49124  1135 

49501  1136 
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

1137 

51780  1138 
fun massage_simple_notes base = 
1139 
filter_out (null o #2) 

1140 
#> map (fn (thmN, thms, attrs) => 

1141 
((qualify true base (Binding.name thmN), attrs), [(thms, [])])); 

1142 

1143 
val massage_multi_notes = 

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

1145 
if forall null thmss then 

1146 
[] 

1147 
else 

1148 
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => 

1149 
((qualify true fp_b_name (Binding.name thmN), attrs T_name), 

1150 
[(thms, [])])) fp_b_names fpTs thmss); 

1151 

49536  1152 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  1153 
val ns = map length ctr_Tsss; 
49212  1154 
val kss = map (fn n => 1 upto n) ns; 
49203  1155 
val mss = map (map length) ctr_Tsss; 
1156 

51903  1157 
val ((fp_folds, fp_recs, fold_rec_args_types, unfold_corec_args_types), lthy) = 
52207
21026c312cc3
tuning  avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset

1158 
mk_un_fold_co_rec_prelims fp fpTs Cs ns mss fp_folds0 fp_recs0 lthy; 
49210  1159 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1160 
fun define_ctrs_case_for_type (((((((((((((((((((((((((fp_bnf, fp_b), fpT), C), ctor), dtor), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1161 
fp_fold), fp_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1162 
pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), ctr_bindings), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1163 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  1164 
let 
49498  1165 
val fp_b_name = Binding.name_of fp_b; 
1166 

49501  1167 
val dtorT = domain_type (fastype_of ctor); 
49210  1168 
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

1169 
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

1170 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  1171 

49593  1172 
val (((((w, fs), xss), yss), u'), names_lthy) = 
49204  1173 
no_defs_lthy 
49501  1174 
> yield_singleton (mk_Frees "w") dtorT 
49176  1175 
>> mk_Frees "f" case_Ts 
49370  1176 
>> mk_Freess "x" ctr_Tss 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1177 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  1178 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  1179 

49498  1180 
val u = Free (u', fpT); 
49121  1181 

49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1182 
val tuple_xs = map HOLogic.mk_tuple xss; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1183 
val tuple_ys = map HOLogic.mk_tuple yss; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1184 

49129  1185 
val ctr_rhss = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1186 
map3 (fn k => fn xs => fn tuple_x => fold_rev Term.lambda xs (ctor $ 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1187 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  1188 

49633  1189 
val case_binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ caseN) fp_b); 
49129 