author  blanchet 
Tue, 30 Apr 2013 11:59:20 +0200  
changeset 51831  a5137cd2c2c2 
parent 51830  403f7ecd061f 
child 51832  35911d5acfa9 
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 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

10 
type fp = 
51824  11 
{lfp: bool, 
12 
fp_index: int, 

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

13 
fp_res: BNF_FP.fp_result, 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

14 
ctr_wrap_res: BNF_Ctr_Sugar.ctr_wrap_result}; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

15 

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

16 
val fp_of: Proof.context > string > fp option 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

17 

51827  18 
val derive_induct_fold_rec_thms_for_types: BNF_Def.BNF list > term list > term list > thm > 
19 
thm list > thm list > BNF_Def.BNF list > BNF_Def.BNF list > typ list > typ list > 

20 
typ list > term list list > thm list list > term list > term list > thm list > thm list > 

21 
Proof.context > 

51811  22 
(thm * thm list * Args.src list) * (thm list list * Args.src list) 
51827  23 
* (thm list list * Args.src list) 
51829  24 
val derive_coinduct_unfold_corec_thms_for_types: BNF_Def.BNF list > term list > term list > 
25 
thm > thm > thm list > thm list > thm list > BNF_Def.BNF list > BNF_Def.BNF list > 

26 
typ list > typ list > typ list > int list list > int list list > int list > 

27 
term list list > thm list list > BNF_Ctr_Sugar.ctr_wrap_result list > term list > 

28 
term list > thm list > thm list > Proof.context > 

51811  29 
(thm * thm list * thm * thm list * Args.src list) * (thm list list * thm list list * 'e list) 
30 
* (thm list list * thm list list) * (thm list list * thm list list * Args.src list) 

51824  31 
* (thm list list * thm list list * Args.src list) 
32 
* (thm list list * thm list list * Args.src list) 

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

33 

49536  34 
val datatypes: bool > 
51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

35 
(mixfix list > (string * sort) list option > binding list > binding list > binding list > 
51758  36 
binding list list > typ list * typ list list > BNF_Def.BNF list > local_theory > 
51757  37 
BNF_FP.fp_result * local_theory) > 
51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

38 
(bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) * 
51758  39 
((((binding * binding) * (binding * typ) list) * (binding * term) list) * 
40 
mixfix) list) list > 

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

42 
val parse_datatype_cmd: bool > 
51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

43 
(mixfix list > (string * sort) list option > binding list > binding list > binding list > 
51758  44 
binding list list > typ list * typ list list > BNF_Def.BNF list > local_theory > 
51757  45 
BNF_FP.fp_result * local_theory) > 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

46 
(local_theory > local_theory) parser 
49112  47 
end; 
48 

49636  49 
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = 
49112  50 
struct 
51 

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

54 
open BNF_Def 
49457  55 
open BNF_FP 
49636  56 
open BNF_FP_Def_Sugar_Tactics 
49119  57 

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

59 

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

60 
type fp = 
51824  61 
{lfp: bool, 
62 
fp_index: int, 

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

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

64 
ctr_wrap_res: ctr_wrap_result}; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

65 

51824  66 
fun eq_fp ({lfp = lfp1, fp_index = fp_index1, fp_res = fp_res1, ...} : fp, 
67 
{lfp = lfp2, fp_index = fp_index2, fp_res = fp_res2, ...} : fp) = 

68 
lfp1 = lfp2 andalso fp_index1 = fp_index2 andalso eq_fp_result (fp_res1, fp_res2); 

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

69 

51824  70 
fun morph_fp phi {lfp, fp_index, fp_res, ctr_wrap_res} = 
71 
{lfp = lfp, fp_index = fp_index, fp_res = morph_fp_result phi fp_res, 

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

72 
ctr_wrap_res = morph_ctr_wrap_result phi ctr_wrap_res}; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

73 

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

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

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

76 
type T = fp Symtab.table; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

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

78 
val extend = I; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

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

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

81 

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

82 
val fp_of = Symtab.lookup o Data.get o Context.Proof; 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

83 

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

84 
fun register_fp key fp = 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

85 
Local_Theory.declaration {syntax = false, pervasive = true} 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

86 
(fn phi => Data.map (Symtab.update_new (key, morph_fp phi fp))); 
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

87 

51824  88 
val fp_name_of_ctor = fst o dest_Type o range_type o fastype_of; 
89 

90 
fun register_fps lfp (fp_res as {ctors, ...}) ctr_wrap_ress lthy = 

91 
((1, ctors), lthy) 

92 
> fold (fn ctr_wrap_res => fn ((kk, ctor :: ctors), lthy) => 

93 
((kk + 1, ctors), register_fp (fp_name_of_ctor ctor) {lfp = lfp, fp_index = kk, 

94 
fp_res = fp_res, ctr_wrap_res = ctr_wrap_res} lthy)) ctr_wrap_ress 

95 
> snd; 

96 

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

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

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

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

102 
fun underscore s = 

103 
let val ss = space_explode Long_Name.separator s in 

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

105 
end; 

106 
in 

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

108 
end; 

109 

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

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

111 

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

113 
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; 
49300  114 

50170  115 
fun split_list4 [] = ([], [], [], []) 
116 
 split_list4 ((x1, x2, x3, x4) :: xs) = 

117 
let val (xs1, xs2, xs3, xs4) = split_list4 xs; 

118 
in (x1 :: xs1, x2 :: xs2, x3 :: xs3, x4 :: xs4) end; 

49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

119 

51811  120 
fun add_components_of_typ (Type (s, Ts)) = 
51816  121 
fold add_components_of_typ Ts #> cons (Long_Name.base_name s) 
51811  122 
 add_components_of_typ _ = I; 
123 

51816  124 
fun base_name_of_typ T = space_implode "_" (add_components_of_typ T []); 
51811  125 

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

126 
fun exists_subtype_in Ts = exists_subtype (member (op =) Ts); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

127 

49342  128 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
129 

49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

130 
fun typ_subst inst (T as Type (s, Ts)) = 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

131 
(case AList.lookup (op =) inst T of 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

132 
NONE => Type (s, map (typ_subst inst) Ts) 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

133 
 SOME T' => T') 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

134 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  135 

49583  136 
fun variant_types ss Ss ctxt = 
137 
let 

138 
val (tfrees, _) = 

139 
fold_map2 (fn s => fn S => Name.variant s #> apfst (rpair S)) ss Ss (Variable.names_of ctxt); 

140 
val ctxt' = fold (Variable.declare_constraints o Logic.mk_type o TFree) tfrees ctxt; 

141 
in (tfrees, ctxt') end; 

142 

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

144 

49200  145 
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); 
146 
fun mk_uncurried_fun f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f xs; 

147 

51794  148 
fun flat_rec unzipf xs = 
149 
let val ps = map unzipf xs in 

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

151 
old datatype package: *) 

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

152 
(* 
51794  153 
maps (op @) ps 
51795
096b96281e34
for compatibility, generate recursor arguments in the same order as old package
blanchet
parents:
51794
diff
changeset

154 
*) 
51794  155 
maps fst ps @ maps snd ps 
51793
22f22172a361
started working on compatibility with old package's recursor
blanchet
parents:
51790
diff
changeset

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

157 

51829  158 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
159 

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

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

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

163 

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

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

165 
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

166 

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

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

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

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

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

171 
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

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

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

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

175 

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

178 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

179 
end; 

180 

181 
val mk_ctor = mk_ctor_or_dtor range_type; 

182 
val mk_dtor = mk_ctor_or_dtor domain_type; 

183 

184 
fun mk_rec_like lfp Ts Us t = 

185 
let 

186 
val (bindings, body) = strip_type (fastype_of t); 

187 
val (f_Us, prebody) = split_last bindings; 

188 
val Type (_, Ts0) = if lfp then prebody else body; 

189 
val Us0 = distinct (op =) (map (if lfp then body_type else domain_type) f_Us); 

190 
in 

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

192 
end; 

193 

51827  194 
val mk_fp_rec_like_fun_types = fst o split_last o binder_types o fastype_of o hd; 
195 

196 
fun mk_fp_rec_like lfp As Cs fp_rec_likes0 = 

197 
map (mk_rec_like lfp As Cs) fp_rec_likes0 

198 
> (fn ts => (ts, mk_fp_rec_like_fun_types ts)); 

199 

200 
fun mk_rec_like_fun_arg_typess n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type; 

201 

51829  202 
fun massage_rec_fun_arg_typesss fpTs = 
51827  203 
let 
51829  204 
fun project_recT proj = 
205 
let 

206 
fun project (Type (s as @{type_name prod}, Ts as [T, U])) = 

207 
if member (op =) fpTs T then proj (T, U) else Type (s, map project Ts) 

208 
 project (Type (s, Ts)) = Type (s, map project Ts) 

209 
 project T = T; 

210 
in project end; 

211 
fun unzip_recT T = 

212 
if exists_subtype_in fpTs T then ([project_recT fst T], [project_recT snd T]) else ([T], []); 

213 
in 

214 
map (map (flat_rec unzip_recT)) 

215 
end; 

51827  216 

217 
val mk_fold_fun_typess = map2 (map2 (curry (op >))); 

218 
val mk_rec_fun_typess = mk_fold_fun_typess oo massage_rec_fun_arg_typesss; 

219 

51831  220 
fun mk_unfold_corec_terms_and_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy = 
51829  221 
let 
222 
(*avoid "'a itself" arguments in coiterators and corecursors*) 

223 
fun repair_arity [0] = [1] 

224 
 repair_arity ms = ms; 

225 

226 
fun project_corecT proj = 

227 
let 

228 
fun project (Type (s as @{type_name sum}, Ts as [T, U])) = 

229 
if member (op =) fpTs T then proj (T, U) else Type (s, map project Ts) 

230 
 project (Type (s, Ts)) = Type (s, map project Ts) 

231 
 project T = T; 

232 
in project end; 

233 

234 
fun unzip_corecT T = 

235 
if exists_subtype_in fpTs T then [project_corecT fst T, project_corecT snd T] else [T]; 

236 

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

239 
fun mk_types maybe_unzipT fun_Ts = 

240 
let 

241 
val f_sum_prod_Ts = map range_type fun_Ts; 

242 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 

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

244 
val f_Tssss = 

245 
map2 (fn C => map (map (map (curry (op >) C) o maybe_unzipT))) Cs f_Tsss; 

246 
val q_Tssss = 

247 
map (map (map (fn [_] => []  [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; 

248 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 

249 
in (q_Tssss, f_sum_prod_Ts, f_Tsss, f_Tssss, pf_Tss) end; 

250 

51831  251 
val (r_Tssss, g_sum_prod_Ts, g_Tsss, g_Tssss, pg_Tss) = mk_types single dtor_unfold_fun_Ts; 
252 
val (s_Tssss, h_sum_prod_Ts, h_Tsss, h_Tssss, ph_Tss) = mk_types unzip_corecT dtor_corec_fun_Ts; 

253 

51829  254 
val (((cs, pss), gssss), lthy) = 
255 
lthy 

256 
> mk_Frees "a" Cs 

257 
>> mk_Freess "p" p_Tss 

258 
>> mk_Freessss "g" g_Tssss; 

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

260 

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

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

263 
lthy 

264 
> mk_Freessss "q" s_Tssss 

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

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

51831  267 

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

51829  269 

51831  270 
fun mk_terms qssss fssss = 
271 
let 

272 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 

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

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

275 
in (pfss, cqssss, cfssss) end; 

276 

277 
val unfold_terms = mk_terms rssss gssss; 

278 
val corec_terms = mk_terms sssss hssss; 

279 
in 

280 
((cs, cpss, (unfold_terms, (g_sum_prod_Ts, g_Tsss, pg_Tss)), 

281 
(corec_terms, (h_sum_prod_Ts, h_Tsss, ph_Tss))), lthy) 

282 
end; 

51829  283 

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

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

287 
end; 

288 

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

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

290 
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

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

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

293 

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

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

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

296 
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

297 
 _ => replicate n false); 
49536  298 

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

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

301 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  302 

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

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

304 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  305 

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

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

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

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

309 

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

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

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

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

313 
fun rel_binding_of (((_, (_, b)), _), _) = b; 
49181  314 
fun mixfix_of ((_, mx), _) = mx; 
49121  315 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  316 

49286  317 
fun disc_of ((((disc, _), _), _), _) = disc; 
318 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  321 
fun ctr_mixfix_of (_, mx) = mx; 
49119  322 

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

323 
fun build_map lthy build_arg (Type (s, Ts)) (Type (_, Us)) = 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

325 
val bnf = the (bnf_of lthy s); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

326 
val live = live_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

327 
val mapx = mk_map live Ts Us (map_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

328 
val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx))); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

329 
in Term.list_comb (mapx, map build_arg TUs') end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

330 

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

331 
fun build_rel_step lthy build_arg (Type (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

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

333 
val bnf = the (bnf_of lthy s); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

334 
val live = live_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

335 
val rel = mk_rel live Ts Ts (rel_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

336 
val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel))); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

337 
in Term.list_comb (rel, map build_arg Ts') end; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

338 

51827  339 
fun derive_induct_fold_rec_thms_for_types pre_bnfs ctor_folds0 ctor_recs0 ctor_induct ctor_fold_thms 
340 
ctor_rec_thms nesting_bnfs nested_bnfs fpTs Cs As ctrss ctr_defss folds recs fold_defs rec_defs 

341 
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

342 
let 
51827  343 
val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss; 
344 

51815  345 
val nn = length pre_bnfs; 
51827  346 
val ns = map length ctr_Tsss; 
347 
val mss = map (map length) ctr_Tsss; 

348 
val Css = map2 replicate ns Cs; 

51815  349 

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

350 
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

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

353 
val nested_map_comp's = map map_comp'_of_bnf nested_bnfs; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

354 
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

355 
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

356 

51816  357 
val fp_b_names = map base_name_of_typ fpTs; 
51811  358 

51827  359 
val (_, ctor_fold_fun_Ts) = mk_fp_rec_like true As Cs ctor_folds0; 
360 
val (_, ctor_rec_fun_Ts) = mk_fp_rec_like true As Cs ctor_recs0; 

361 

362 
val y_Tsss = map3 mk_rec_like_fun_arg_typess ns mss ctor_fold_fun_Ts; 

363 
val g_Tss = mk_fold_fun_typess y_Tsss Css; 

364 

365 
val z_Tsss = map3 mk_rec_like_fun_arg_typess ns mss ctor_rec_fun_Ts; 

366 
val h_Tss = mk_rec_fun_typess fpTs z_Tsss Css; 

367 

368 
val (((((ps, ps'), xsss), gss), us'), names_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

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

370 
> mk_Frees' "P" (map mk_pred1T fpTs) 
51827  371 
>> mk_Freesss "x" ctr_Tsss 
372 
>> mk_Freess "f" g_Tss 

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

374 

51827  375 
val hss = map2 (map2 retype_free) h_Tss gss; 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

376 
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

377 

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

378 
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

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

380 
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

381 
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

382 
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

383 
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

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

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

386 
 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

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

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

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

390 

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

391 
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

392 

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

393 
val (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

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

395 
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

396 
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

397 
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

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

399 

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

400 
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

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

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

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

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

405 
 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

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

407 
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

408 
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

409 
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

410 
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

411 
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

412 
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

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

414 
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

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

416 
 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

417 
 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

418 

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

419 
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

420 
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

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

422 

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

423 
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

424 
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

425 
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

426 
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

427 

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

428 
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

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

430 
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

431 
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

432 
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

433 

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

434 
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

435 
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

436 

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

437 
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

438 

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

439 
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

440 
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

441 
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

442 

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

443 
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

444 

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

446 

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

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

448 
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

449 
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

450 
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

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

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

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

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

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

456 

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

457 
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

458 

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

459 
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

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

461 
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

462 
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

463 
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

464 

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

465 
fun mk_goal fss frec_like xctr f xs fxs = 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

466 
fold_rev (fold_rev Logic.all) (xs :: fss) 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

467 
(mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs))); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

468 

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

469 
fun build_rec_like frec_likes (T, U) = 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

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

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

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

474 
~1 => build_map lthy (build_rec_like frec_likes) T U 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

475 
 kk => nth frec_likes kk); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

476 

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

477 
val mk_U = typ_subst (map2 pair fpTs Cs); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

478 

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

479 
fun unzip_rec_likes frec_likes combine (x as Free (_, T)) = 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

481 
combine (x, build_rec_like frec_likes (T, mk_U T) $ x) 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

483 
([x], []); 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

484 

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

485 
val gxsss = map (map (flat_rec (unzip_rec_likes gfolds (fn (_, t) => ([t], []))))) xsss; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

486 
val hxsss = map (map (flat_rec (unzip_rec_likes hrecs (pairself single)))) xsss; 
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

487 

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

488 
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

489 
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

490 

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

491 
val fold_tacss = 
51814  492 
map2 (map o mk_rec_like_tac pre_map_defs [] nesting_map_ids'' fold_defs) ctor_fold_thms 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

494 
val 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

495 
map2 (map o mk_rec_like_tac pre_map_defs nested_map_comp's 
51814  496 
(nested_map_ids'' @ nesting_map_ids'') rec_defs) ctor_rec_thms ctr_defss; 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

497 

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

498 
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

499 
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

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

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

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

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

504 

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

505 
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

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

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

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

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

510 

51829  511 
fun derive_coinduct_unfold_corec_thms_for_types pre_bnfs dtor_unfolds0 dtor_corecs0 dtor_coinduct 
51814  512 
dtor_strong_induct dtor_ctors dtor_unfold_thms dtor_corec_thms nesting_bnfs nested_bnfs fpTs Cs 
51829  513 
As kss mss ns ctrss ctr_defss ctr_wrap_ress unfolds corecs unfold_defs corec_defs lthy = 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

514 
let 
51815  515 
val nn = length pre_bnfs; 
516 

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

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

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

521 
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

522 
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

523 
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

524 

51816  525 
val fp_b_names = map base_name_of_typ fpTs; 
51811  526 

51829  527 
val (_, dtor_unfold_fun_Ts) = mk_fp_rec_like false As Cs dtor_unfolds0; 
528 
val (_, dtor_corec_fun_Ts) = mk_fp_rec_like false As Cs dtor_corecs0; 

529 

51819  530 
val discss = map (map (mk_disc_or_sel As) o #discs) ctr_wrap_ress; 
531 
val selsss = map (map (map (mk_disc_or_sel As)) o #selss) ctr_wrap_ress; 

532 
val exhausts = map #exhaust ctr_wrap_ress; 

533 
val disc_thmsss = map #disc_thmss ctr_wrap_ress; 

534 
val discIss = map #discIs ctr_wrap_ress; 

535 
val sel_thmsss = map #sel_thmss ctr_wrap_ress; 

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

536 

51831  537 
val ((cs, cpss, ((pgss, crssss, cgssss), _), ((phss, csssss, chssss), _)), names_lthy0) = 
538 
mk_unfold_corec_terms_and_types fpTs Cs ns mss dtor_unfold_fun_Ts dtor_corec_fun_Ts lthy; 

539 

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

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

542 
> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) 
51816  543 
>> Variable.variant_fixes fp_b_names 
544 
>> Variable.variant_fixes (map (suffix "'") fp_b_names); 

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

545 

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

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

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

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

549 

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

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

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

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

553 

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

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

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

556 
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

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

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

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

560 
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

561 

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

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

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

564 
~1 => 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

565 
if exists_subtype_in fpTs T then build_rel_step lthy (build_rel rs') T 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

566 
else HOLogic.eq_const T 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

568 

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

569 
fun build_rel_app rs' usel vsel = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

570 
fold rapp [usel, vsel] (build_rel rs' (fastype_of usel)); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

571 

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

572 
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

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

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

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

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

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

578 
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

579 

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

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

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

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

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

584 

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

585 
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

586 
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

587 
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

588 

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

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

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

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

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

593 

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

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

595 
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

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

597 

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

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

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

600 

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

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

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

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

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

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

607 

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

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

609 
Thm.permute_prems 0 nn 
51828  610 
(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

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

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

613 
in 
51814  614 
(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

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

616 

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

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

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

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

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

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

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

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

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

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

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

627 

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

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

630 
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

631 

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

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

633 

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

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

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

636 

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

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

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

639 
fun mk_goal pfss c cps fcorec_like n k ctr m cfs' = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

641 
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

642 
mk_Trueprop_eq (fcorec_like $ c, Term.list_comb (ctr, take m cfs')))); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

643 

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

644 
fun build_corec_like fcorec_likes (T, U) = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

645 
if T = U then 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

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

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

649 
~1 => build_map lthy (build_corec_like fcorec_likes) T U 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

651 

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

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

653 

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

654 
fun intr_corec_likes fcorec_likes [] [cf] = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

655 
let val T = fastype_of cf in 
51828  656 
if exists_subtype_in Cs T then build_corec_like fcorec_likes (T, mk_U T) $ cf else cf 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

658 
 intr_corec_likes fcorec_likes [cq] [cf, cf'] = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

659 
mk_If cq (intr_corec_likes fcorec_likes [] [cf]) 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

660 
(intr_corec_likes fcorec_likes [] [cf']); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

661 

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

662 
val crgsss = map2 (map2 (map2 (intr_corec_likes gunfolds))) crssss cgssss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

664 

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

667 

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

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

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

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

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

672 
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

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

674 
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

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

676 
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

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

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

679 

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

680 
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

681 

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

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

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

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

686 
map3 (map oo mk_corec_like_tac corec_defs nested_map_comps'' nested_map_comp's 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

689 

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

690 
fun prove goal tac = 
51815  691 
Goal.prove_sorry lthy [] [] goal (tac o #context) 
692 
> Thm.close_derivation; 

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

693 

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

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

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

696 

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

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

698 
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

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

700 

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

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

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

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

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

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

706 

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

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

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

709 
fun mk_goal c cps fcorec_like n k disc = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

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

712 
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

713 

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

714 
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

715 
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

716 

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

718 

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

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

720 

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

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

722 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' unfold_thmss disc_thmsss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

724 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

725 

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

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

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

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

730 

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

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

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

733 
in 
51828  734 
(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

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

736 

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

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

738 

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

739 
fun mk_disc_corec_like_thms corec_likes discIs = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

740 
map (op RS) (filter_out (is_triv_discI o snd) (corec_likes ~~ discIs)); 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

741 

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

742 
val disc_unfold_thmss = map2 mk_disc_corec_like_thms unfold_thmss discIss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

743 
val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

744 

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

745 
fun mk_sel_corec_like_thm corec_like_thm sel sel_thm = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

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

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

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

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

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

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

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

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

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

756 

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

757 
fun mk_sel_corec_like_thms corec_likess = 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

758 
map3 (map3 (map2 o mk_sel_corec_like_thm)) corec_likess selsss sel_thmsss > map flat; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

759 

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

760 
val sel_unfold_thmss = mk_sel_corec_like_thms unfold_thmss; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

762 

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

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

764 
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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

779 

49633  780 
fun define_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp 
781 
(wrap_opts as (no_dests, rep_compat), specs) no_defs_lthy0 = 

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

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

784 

49286  785 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  786 
else (); 
787 

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

790 

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

792 
val fp_bs = map type_binding_of specs; 
49498  793 
val fp_b_names = map Binding.name_of fp_bs; 
794 
val fp_common_name = mk_common_name fp_b_names; 

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

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

797 

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

799 
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

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

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

802 

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

804 
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

805 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
51758  806 
val set_bss = map (map fst o type_args_named_constrained_of) specs; 
49119  807 

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

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

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

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

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

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

813 
>> apfst (map TFree) o 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

814 
variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS); 
49119  815 

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

816 
(* TODO: cleaner handling of fake contexts, without "background_theory" *) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

817 
(*the "perhaps o try" below helps gracefully handles the case where the new type is defined in a 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

818 
locale and shadows an existing global type*) 
51768  819 

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

820 
fun add_fake_type spec = 
51768  821 
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

822 
length (type_args_named_constrained_of spec), mixfix_of spec); 
51768  823 

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

824 
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

825 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  826 

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

827 
fun mk_fake_T b = 
49121  828 
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

829 
unsorted_As); 
49121  830 

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

831 
val fake_Ts = map mk_fake_T fp_bs; 
49121  832 

49181  833 
val mixfixes = map mixfix_of specs; 
49119  834 

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

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

49121  838 
val ctr_specss = map ctr_specs_of specs; 
49119  839 

49336  840 
val disc_bindingss = map (map disc_of) ctr_specss; 
841 
val ctr_bindingss = 

49633  842 
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  843 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  844 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  845 

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

847 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  848 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
849 

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

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

851 
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

852 

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

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

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

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

856 

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

857 
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

858 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  859 
[] => () 
49342  860 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  861 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  862 

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

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

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

866 
 eq_fpT_check _ _ = false; 
49146  867 

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

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

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

871 
 kk => nth Xs kk) 
49204  872 
 freeze_fp T = T; 
49121  873 

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

49119  876 

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

877 
val fp_eqs = 
49536  878 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  879 

51824  880 
val (pre_bnfs, (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, dtors = dtors0, ctors = ctors0, 
51805  881 
folds = fp_folds0, recs = fp_recs0, induct = fp_induct, strong_induct = fp_strong_induct, 
882 
dtor_ctors, ctor_dtors, ctor_injects, map_thms = fp_map_thms, set_thmss = fp_set_thmss, 

883 
rel_thms = fp_rel_thms, fold_thms = fp_fold_thms, rec_thms = fp_rec_thms}, lthy)) = 

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

884 
fp_bnf construct_fp fp_bs mixfixes map_bs rel_bs set_bss (map dest_TFree unsorted_As) fp_eqs 
51758  885 
no_defs_lthy0; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

886 

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

887 
val timer = time (Timer.startRealTimer ()); 
49121  888 

49363  889 
fun add_nesty_bnf_names Us = 
49226  890 
let 
891 
fun add (Type (s, Ts)) ss = 

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

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

894 
end 

49363  895 
 add T ss = (member (op =) Us T, ss); 
49226  896 
in snd oo add end; 
897 

49363  898 
fun nesty_bnfs Us = 
49536  899 
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); 
49363  900 

901 
val nesting_bnfs = nesty_bnfs As; 

49536  902 
val nested_bnfs = nesty_bnfs Xs; 
49226  903 

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

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

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

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

908 
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

909 

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

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

911 

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

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

913 
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

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

915 

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

916 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  917 

49501  918 
val ctors = map (mk_ctor As) ctors0; 
919 
val dtors = map (mk_dtor As) dtors0; 

49124  920 

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

922 

51780  923 
fun massage_simple_notes base = 
924 
filter_out (null o #2) 

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

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

927 

928 
val massage_multi_notes = 

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

930 
if forall null thmss then 

931 
[] 

932 
else 

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

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

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

936 

49536  937 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  938 
val ns = map length ctr_Tsss; 
49212  939 
val kss = map (fn n => 1 upto n) ns; 
49203  940 
val mss = map (map length) ctr_Tsss; 
941 
val Css = map2 replicate ns Cs; 

942 

51827  943 
val (fp_folds, fp_fold_fun_Ts) = mk_fp_rec_like lfp As Cs fp_folds0; 
944 
val (fp_recs, fp_rec_fun_Ts) = mk_fp_rec_like lfp As Cs fp_recs0; 

49210  945 

51827  946 
val (((fold_only, rec_only), 
51830  947 
(cs, cpss, unfold_only as ((_, crssss, cgssss), (_, g_Tsss, _)), 
948 
corec_only as ((_, csssss, chssss), (_, h_Tsss, _)))), _) = 

49208  949 
if lfp then 
950 
let 

51827  951 
val y_Tsss = map3 mk_rec_like_fun_arg_typess ns mss fp_fold_fun_Ts; 
952 
val g_Tss = mk_fold_fun_typess y_Tsss Css; 

49208  953 

49484  954 
val ((gss, ysss), lthy) = 
49208  955 
lthy 
956 
> mk_Freess "f" g_Tss 

957 
>> mk_Freesss "x" y_Tsss; 

49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

958 

51827  959 
val z_Tsss = map3 mk_rec_like_fun_arg_typess ns mss fp_rec_fun_Ts; 
960 
val h_Tss = mk_rec_fun_typess fpTs z_Tsss Css; 

49204  961 

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

962 
val hss = map2 (map2 retype_free) h_Tss gss; 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

963 
val zsss = map2 (map2 (map2 retype_free)) z_Tsss ysss; 
49210  964 
in 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

965 
((((gss, g_Tss, ysss), (hss, h_Tss, zsss)), 
49683  966 
([], [], (([], [], []), ([], [], [])), (([], [], []), ([], [], [])))), lthy) 
49210  967 
end 
49208  968 
else 
51831  969 
mk_unfold_corec_terms_and_types fpTs Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy 
970 
>> pair (([], [], []), ([], [], [])); 

49210  971 

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

972 
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

973 
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

974 
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

975 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  976 
let 
49498  977 
val fp_b_name = Binding.name_of fp_b; 
978 

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

981 
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

982 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  983 

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

989 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  990 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  991 

49498  992 
val u = Free (u', fpT); 
49121  993 

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

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

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

996 

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

998 
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

999 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  1000 

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

49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

1003 
val case_rhs = 
49498  1004 
fold_rev Term.lambda (fs @ [u]) 
49501  1005 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); 
49129  1006 

49201  1007 
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy 
49169  1008 
> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => 
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

1009 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  1010 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  1011 
> `Local_Theory.restore; 
1012 

1013 
val phi = Proof_Context.export_morphism lthy lthy'; 

1014 

1015 
val ctr_defs = map (Morphism.thm phi) raw_ctr_defs; 

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

1016 
val ctr_defs' = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1017 
map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs; 
49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

1018 
val case_def = Morphism.thm phi raw_case_def; 
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

1019 

49203  1020 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
1021 
val casex0 = Morphism.term phi raw_case; 

1022 

1023 
val ctrs = map (mk_ctr As) ctrs0; 

49121  1024 

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

1025 
fun wrap lthy = 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

1026 
let 
50170  1027 
fun exhaust_tac {context = ctxt, prems = _} = 
49135  1028 
let 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

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

1032 
fold_rev Logic.all [w, u] 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1033 
(mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w))); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1034 
in 
51551  1035 
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1036 
mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [dtorT, fpT]) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1037 
(certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1038 
> Thm.close_derivation 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1039 
> Morphism.thm phi 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

1041 

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

1042 
val sumEN_thm' = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1043 
unfold_thms lthy @{thms all_unit_eq} 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1044 
(Drule.instantiate' (map (SOME o certifyT lthy) ctr_prod_Ts) [] 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1045 
(mk_sumEN_balanced n)) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1046 
> Morphism.thm phi; 
49135  1047 
in 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1048 
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' 
49135  1049 
end; 
1050 

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

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

1052 
map2 (fn 0 => K []  _ => fn ctr_def => [fn {context = ctxt, ...} => 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1053 
mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1054 

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

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

1056 
map (map (fn (def, def') => fn {context = ctxt, ...} => 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1057 
mk_half_distinct_tac ctxt ctor_inject [def, def'])) (mk_half_pairss (`I ctr_defs)); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1058 

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

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

1060 
map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} => 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1061 
mk_case_tac ctxt n k m case_def ctr_def dtor_ctor) ks ms ctr_defs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1062 

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

1063 
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs]; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1064 

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

1065 
val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

1066 
in 
51781  1067 
wrap_free_constructors tacss (((wrap_opts, ctrs0), casex0), (disc_bindings, 
1068 
(sel_bindingss, sel_defaultss))) lthy 

49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

1069 
end; 
49121  1070 

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

1071 
fun derive_maps_sets_rels (ctr_wrap_res, lthy) = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

1073 
val rel_flip = rel_flip_of_bnf fp_bnf; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1074 
val nones = replicate live NONE; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1075 

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

1076 
val ctor_cong = 
51746
5af40820948b
avoid accidental specialization of the types in the "map" property of codatatypes
blanchet
parents:
51745
diff
changeset

1077 
if lfp then 
5af40820948b
avoid accidental specialization of the types in the "map" property of codatatypes
blanchet
parents:
51745
diff
changeset

1078 
Drule.dummy_thm 
5af40820948b
avoid accidental specialization of the types in the "map" property of codatatypes
blanchet
parents:
51745
diff
changeset

1079 
else 
5af40820948b
avoid accidental specialization of the types in the "map" property of codatatypes
blanchet
parents:
51745
diff
changeset

1080 
let val ctor' = mk_ctor Bs ctor in 
5af40820948b
avoid accidental specialization of the types in the "map" property of codatatypes
blanchet
parents:
51745
diff
changeset

1081 
cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor')] arg_cong 
5af40820948b
avoid accidental specialization of the types in the "map" property of codatatypes
blanchet
parents:
51745
diff
changeset

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

1083 

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

1084 
fun mk_cIn ify = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1085 
certify lthy o (not lfp ? curry (op $) (map_types ify ctor)) oo 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1086 
mk_InN_balanced (ify ctr_sum_prod_T) n; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1087 

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

1088 
val cxIns = map2 (mk_cIn I) tuple_xs ks; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1089 
val cyIns = map2 (mk_cIn B_ify) tuple_ys ks; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1090 

49682  1091 
fun mk_map_thm ctr_def' cxIn = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1092 
fold_thms lthy [ctr_def'] 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1093 
(unfold_thms lthy (pre_map_def :: 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1094 
(if lfp then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1095 
(cterm_instantiate_pos (nones @ [SOME cxIn]) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1096 
(if lfp then fp_map_thm else fp_map_thm RS ctor_cong))) 
49593  1097 
> singleton (Proof_Context.export names_lthy no_defs_lthy); 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1098 

49682  1099 
fun mk_set_thm fp_set_thm ctr_def' cxIn = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1100 
fold_thms lthy [ctr_def'] 
51766
f19a4d0ab1bf
renamed "set_natural" to "set_map", reflecting {Bl,Po,Tr} concensus
blanchet
parents:
51758
diff
changeset

1101 
(unfold_thms lthy (pre_set_defs @ nested_set_map's @ nesting_set_map's @ 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1102 
(if lfp then [] else [dtor_ctor]) @ sum_prod_thms_set) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1103 
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) 
49593  1104 
> singleton (Proof_Context.export names_lthy no_defs_lthy); 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1105 

49682  1106 
fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1107 

49682  1108 
val map_thms = map2 mk_map_thm ctr_defs' cxIns; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1109 
val set_thmss = map mk_set_thms fp_set_thms; 
49127  1110 

49682  1111 
val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns); 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1112 

49682  1113 
fun mk_rel_thm postproc ctr_defs' cxIn cyIn = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1114 
fold_thms lthy ctr_defs' 
51745
a06a3c777add
simplify "Inl () = Inr ()" as well (not entirely clear why this is necessary)
blanchet
parents:
51551
diff
changeset

1115 
(unfold_thms lthy (@{thm Inl_Inr_False} :: pre_rel_def :: 
a06a3c777add
simplify "Inl () = Inr ()" as well (not entirely clear why this is necessary)
blanchet
parents:
51551
diff
changeset

1116 
(if lfp then [] else [dtor_ctor]) @ sum_prod_thms_rel) 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1117 
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) 
49593  1118 
> postproc 
1119 
> singleton (Proof_Context.export names_lthy no_defs_lthy); 

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

1120 

49682  1121 
fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) = 
1122 
mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn; 

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

1123 

49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1124 
val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos); 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1125 

49682  1126 
fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1127 
mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def'] 
49682  1128 
cxIn cyIn; 
49121  1129 

49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1130 
fun mk_other_half_rel_distinct_thm thm = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1131 
flip_rels lthy live thm RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1132 

49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1133 
val half_rel_distinct_thmss = 
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1134 
map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos); 
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1135 
val other_half_rel_distinct_thmss = 
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1136 
map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss; 
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1137 
val (rel_distinct_thms, _) = 
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1138 
join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

1139 

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

1140 
val notes = 
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1141 
[(mapN, map_thms, code_simp_attrs), 
49592
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1142 
(rel_distinctN, rel_distinct_thms, code_simp_attrs), 
b859a02c1150
fixed "rels" + split them into injectivity and distinctness
blanchet
parents:
49591
diff
changeset

1143 
(rel_injectN, rel_inject_thms, code_simp_attrs), 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1144 
(setsN, flat set_thmss, code_simp_attrs)] 
51780  1145 
> massage_simple_notes fp_b_name; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

1147 
(ctr_wrap_res, lthy > Local_Theory.notes notes > snd) 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

1149 

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

1150 
fun define_fold_rec no_defs_lthy = 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

1151 
let 
49208  1152 
val fpT_to_C = fpT > C; 
49199  1153 

49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

1154 
fun build_prod_proj mk_proj (T, U) = 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1155 
if T = U then 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1156 
id_const T 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1157 
else 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1158 
(case (T, U) of 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1159 
(Type (s, _), Type (s', _)) => 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

1160 
if s = s' then build_map lthy (build_prod_proj mk_proj) T U else mk_proj T 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1161 
 _ => mk_proj T); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1162 

49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

1163 
(* TODO: Avoid these complications; cf. corec case *) 
49672
902b24e0ffb4
fixed recursor definition for datatypes with inner products (e.g. "'a trm" from the lambdaterm example)
blanchet
parents:
49671
diff
changeset

1164 
fun mk_U proj (Type (s as @{type_name prod}, Ts as [T', U])) = 
902b24e0ffb4
fixed recursor definition for datatypes with inner products (e.g. "'a trm" from the lambdaterm example)
blanchet
parents:
49671
diff
changeset

1165 
if member (op =) fpTs T' then proj (T', U) else Type (s, map (mk_U proj) Ts) 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1166 
 mk_U proj (Type (s, Ts)) = Type (s, map (mk_U proj) Ts) 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1167 
 mk_U _ T = T; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1168 

51794  1169 
fun unzip_rec (x as Free (_, T)) = 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

1170 
if exists_subtype_in fpTs T then 
51794  1171 
([build_prod_proj fst_const (T, mk_U fst T) $ x], 
1172 
[build_prod_proj snd_const (T, mk_U snd T) $ x]) 

49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1173 
else 
51794  1174 
([x], []); 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1175 

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

1176 
fun mk_rec_like_arg f xs = 
51794  1177 
mk_tupled_fun (HOLogic.mk_tuple xs) f (flat_rec unzip_rec xs); 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1178 

c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1179 
fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xsss)) = 
49215  1180 
let 
1181 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 

49633  1182 
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); 
49215  1183 
val spec = 
49336  1184 
mk_Trueprop_eq (lists_bmoc fss (Free (Binding.name_of binding, res_T)), 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1185 
Term.list_comb (fp_rec_like, 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

1186 
map2 (mk_sum_caseN_balanced oo map2 mk_rec_like_arg) fss xsss)); 
49336  1187 
in (binding, spec) end; 
49199  1188 

49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1189 
val rec_like_infos = 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1190 
[(foldN, fp_fold, fold_only), 
49215  1191 
(recN, fp_rec, rec_only)]; 
1192 

49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1193 
val (bindings, specs) = map generate_rec_like rec_like_infos > split_list; 
49215  1194< 