author  blanchet 
Tue, 07 May 2013 21:09:47 +0200  
changeset 51911  6c425d450a8c 
parent 51910  31bb70ddee7e 
child 51912  a6b963bc46f0 
permissions  rwrr 
49636  1 
(* Title: HOL/BNF/Tools/bnf_fp_def_sugar.ML 
49112  2 
Author: Jasmin Blanchette, TU Muenchen 
3 
Copyright 2012 

4 

49389  5 
Sugared datatype and codatatype constructions. 
49112  6 
*) 
7 

49636  8 
signature BNF_FP_DEF_SUGAR = 
49112  9 
sig 
51840  10 
type fp_sugar = 
51859  11 
{T: typ, 
12 
lfp: bool, 

51838  13 
index: int, 
14 
pre_bnfs: BNF_Def.bnf list, 

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

15 
fp_res: BNF_FP_Util.fp_result, 
51906  16 
ctr_defss: thm list list, 
51842  17 
ctr_sugars: BNF_Ctr_Sugar.ctr_sugar list, 
51857
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

18 
un_folds: term list, 
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

19 
co_recs: term list, 
51864  20 
co_induct: thm, 
21 
strong_co_induct: thm, 

51857
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

22 
un_fold_thmss: thm list list, 
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

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

24 

51896  25 
val morph_fp_sugar: morphism > fp_sugar > fp_sugar 
26 
val fp_sugar_of: Proof.context > string > fp_sugar option 

51852  27 

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

28 
val tvar_subst: theory > typ list > typ list > ((string * int) * typ) list 
51860  29 
val exists_subtype_in: typ list > typ > bool 
51907  30 
val nesty_bnfs: Proof.context > typ list list list > typ list > BNF_Def.bnf list 
51855  31 
val indexify_fst: ''a list > (int > ''a * 'b > 'c) > ''a * 'b > 'c 
51903  32 
val mk_un_fold_co_rec_prelims: bool > typ list > typ list > typ list > int list > 
33 
int list list > term list > term list > Proof.context > 

34 
(term list * term list * ((term list list * typ list list * term list list list) 

35 
* (term list list * typ list list * term list list list)) option 

36 
* (term list * term list list 

37 
* ((term list list * term list list list list * term list list list list) 

38 
* (typ list * typ list list list * typ list list)) 

39 
* ((term list list * term list list list list * term list list list list) 

40 
* (typ list * typ list list list * typ list list))) option) 

41 
* Proof.context 

51855  42 
val build_map: local_theory > (typ * typ > term) > typ * typ > term 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

43 

51885  44 
val mk_iter_fun_arg_types_pairsss: typ list > int list > int list list > term > 
45 
(typ list * typ list) list list list 

51902  46 
val define_fold_rec: (term list list * typ list list * term list list list) 
47 
* (term list list * typ list list * term list list list) > (string > binding) > typ list > 

51897  48 
typ list > typ list > term > term > Proof.context > 
51902  49 
(term * term * thm * thm) * Proof.context 
50 
val define_unfold_corec: term list * term list list 

51 
* ((term list list * term list list list list * term list list list list) 

52 
* (typ list * typ list list list * typ list list)) 

53 
* ((term list list * term list list list list * term list list list list) 

54 
* (typ list * typ list list list * typ list list)) > 

55 
(string > binding) > 'a list > typ list > typ list > term > term > Proof.context > 

56 
(term * term * thm * thm) * Proof.context 

51837
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset

57 
val derive_induct_fold_rec_thms_for_types: BNF_Def.bnf list > term list > term list > thm > 
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset

58 
thm list > thm list > BNF_Def.bnf list > BNF_Def.bnf list > typ list > typ list > 
51827  59 
typ list > term list list > thm list list > term list > term list > thm list > thm list > 
51852  60 
local_theory > 
51811  61 
(thm * thm list * Args.src list) * (thm list list * Args.src list) 
51827  62 
* (thm list list * Args.src list) 
51837
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset

63 
val derive_coinduct_unfold_corec_thms_for_types: BNF_Def.bnf list > term list > term list > 
087498724486
lowercase type constructor, for consistency (cf. fp_result not FP_result nor FP_Result)
blanchet
parents:
51835
diff
changeset

64 
thm > thm > thm list > thm list > thm list > BNF_Def.bnf list > BNF_Def.bnf list > 
51829  65 
typ list > typ list > typ list > int list list > int list list > int list > 
51840  66 
thm list list > BNF_Ctr_Sugar.ctr_sugar list > term list > term list > thm list > 
51852  67 
thm list > local_theory > 
51839  68 
(thm * thm list * thm * thm list * Args.src list) 
69 
* (thm list list * thm list list * Args.src list) 

51811  70 
* (thm list list * thm list list) * (thm list list * thm list list * Args.src list) 
51824  71 
* (thm list list * thm list list * Args.src list) 
72 
* (thm list list * thm list list * Args.src list) 

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

73 

51867  74 
val co_datatypes: bool > (mixfix list > binding list > binding list > binding list list > 
75 
binding list > (string * sort) list > typ list * typ list list > BNF_Def.bnf list > 

51866  76 
local_theory > BNF_FP_Util.fp_result * local_theory) > 
51767
bbcdd8519253
honor userspecified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset

77 
(bool * bool) * (((((binding * (typ * sort)) list * binding) * (binding * binding)) * mixfix) * 
51758  78 
((((binding * binding) * (binding * typ) list) * (binding * term) list) * 
79 
mixfix) list) list > 

49297  80 
local_theory > local_theory 
51867  81 
val parse_co_datatype_cmd: bool > (mixfix list > binding list > binding list > 
82 
binding list list > binding list > (string * sort) list > typ list * typ list list > 

83 
BNF_Def.bnf list > local_theory > BNF_FP_Util.fp_result * local_theory) > 

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

84 
(local_theory > local_theory) parser 
49112  85 
end; 
86 

49636  87 
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = 
49112  88 
struct 
89 

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

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

93 
open BNF_FP_Util 
49636  94 
open BNF_FP_Def_Sugar_Tactics 
49119  95 

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

97 

51840  98 
type fp_sugar = 
51859  99 
{T: typ, 
100 
lfp: bool, 

51838  101 
index: int, 
102 
pre_bnfs: bnf list, 

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

103 
fp_res: fp_result, 
51906  104 
ctr_defss: thm list list, 
51842  105 
ctr_sugars: ctr_sugar list, 
51857
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

106 
un_folds: term list, 
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

107 
co_recs: term list, 
51864  108 
co_induct: thm, 
109 
strong_co_induct: thm, 

51857
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

110 
un_fold_thmss: thm list list, 
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

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

112 

51859  113 
fun eq_fp_sugar ({T = T1, lfp = lfp1, index = index1, fp_res = fp_res1, ...} : fp_sugar, 
114 
{T = T2, lfp = lfp2, index = index2, fp_res = fp_res2, ...} : fp_sugar) = 

115 
T1 = T2 andalso lfp1 = lfp2 andalso index1 = index2 andalso eq_fp_result (fp_res1, fp_res2); 

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

116 

51906  117 
fun morph_fp_sugar phi {T, lfp, index, pre_bnfs, fp_res, ctr_defss, ctr_sugars, un_folds, co_recs, 
118 
co_induct, strong_co_induct, un_fold_thmss, co_rec_thmss} = 

51859  119 
{T = Morphism.typ phi T, lfp = lfp, index = index, pre_bnfs = map (morph_bnf phi) pre_bnfs, 
51906  120 
fp_res = morph_fp_result phi fp_res, ctr_defss = map (map (Morphism.thm phi)) ctr_defss, 
121 
ctr_sugars = map (morph_ctr_sugar phi) ctr_sugars, un_folds = map (Morphism.term phi) un_folds, 

122 
co_recs = map (Morphism.term phi) co_recs, co_induct = Morphism.thm phi co_induct, 

123 
strong_co_induct = Morphism.thm phi strong_co_induct, 

51857
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

124 
un_fold_thmss = map (map (Morphism.thm phi)) un_fold_thmss, 
17e7f00563fb
tuned names  co_ and un_ with underscore are to be understood as (co) and (un)
blanchet
parents:
51856
diff
changeset

125 
co_rec_thmss = map (map (Morphism.thm phi)) co_rec_thmss}; 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

126 

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

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

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

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

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

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

134 

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

136 

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

138 
Local_Theory.declaration {syntax = false, pervasive = true} 
51840  139 
(fn phi => Data.map (Symtab.update_new (key, morph_fp_sugar phi fp_sugar))); 
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset

140 

51906  141 
fun register_fp_sugars lfp pre_bnfs (fp_res as {Ts, ...}) ctr_defss ctr_sugars un_folds co_recs 
142 
co_induct strong_co_induct un_fold_thmss co_rec_thmss lthy = 

51844  143 
(0, lthy) 
51859  144 
> fold (fn T as Type (s, _) => fn (kk, lthy) => (kk + 1, 
145 
register_fp_sugar s {T = T, lfp = lfp, index = kk, pre_bnfs = pre_bnfs, fp_res = fp_res, 

51906  146 
ctr_defss = ctr_defss, ctr_sugars = ctr_sugars, un_folds = un_folds, co_recs = co_recs, 
147 
co_induct = co_induct, strong_co_induct = strong_co_induct, un_fold_thmss = un_fold_thmss, 

51864  148 
co_rec_thmss = co_rec_thmss} lthy)) Ts 
51824  149 
> snd; 
150 

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

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

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

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

156 
fun underscore s = 

157 
let val ss = space_explode Long_Name.separator s in 

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

159 
end; 

160 
in 

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

162 
end; 

163 

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

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

165 

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

167 
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; 
49300  168 

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

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

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

171 

51860  172 
val exists_subtype_in = Term.exists_subtype o member (op =); 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

173 

49342  174 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
175 

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

177 
(case AList.lookup (op =) inst T of 
51845  178 
NONE => Type (s, map (typ_subst_nonatomic inst) Ts) 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

179 
 SOME T' => T') 
51845  180 
 typ_subst_nonatomic inst T = the_default T (AList.lookup (op =) inst T); 
49205  181 

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

183 

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

186 

51794  187 
fun flat_rec unzipf xs = 
188 
let val ps = map unzipf xs in 

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

190 
old datatype package: *) 

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

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

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

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

196 

51829  197 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
198 

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

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

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

202 

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

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

204 
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

205 

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

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

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

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

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

210 
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

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

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

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

214 

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

217 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

218 
end; 

219 

220 
val mk_ctor = mk_ctor_or_dtor range_type; 

221 
val mk_dtor = mk_ctor_or_dtor domain_type; 

222 

51883  223 
fun mk_co_iter lfp Ts Us t = 
49536  224 
let 
225 
val (bindings, body) = strip_type (fastype_of t); 

226 
val (f_Us, prebody) = split_last bindings; 

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

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

229 
in 

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

231 
end; 

232 

51846  233 
val mk_fp_iter_fun_types = fst o split_last o binder_types o fastype_of; 
234 

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

235 
fun mk_fp_iters ctxt lfp fpTs Cs fp_iters0 = 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

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

237 
val thy = Proof_Context.theory_of ctxt; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

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

239 
val (fpTs0, Cs0) = 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

240 
map ((not lfp ? swap) o dest_funT o snd o strip_typeN nn o fastype_of) fp_iters0 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

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

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

243 
val subst = Term.subst_TVars rho; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

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

245 
map subst fp_iters0 > (fn ts => (ts, mk_fp_iter_fun_types (hd ts))) 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

246 
end; 
51827  247 

51846  248 
fun unzip_recT fpTs T = 
51827  249 
let 
51829  250 
fun project_recT proj = 
251 
let 

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

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

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

255 
 project T = T; 

256 
in project end; 

257 
in 

51846  258 
if exists_subtype_in fpTs T then ([project_recT fst T], [project_recT snd T]) else ([T], []) 
51829  259 
end; 
51827  260 

51889  261 
fun mk_fold_fun_typess y_Tsss Cs = map2 (fn C => map (fn y_Ts => y_Ts > C)) Cs y_Tsss; 
51905  262 
val mk_rec_fun_typess = mk_fold_fun_typess oo map o map o flat_rec o unzip_recT; 
51827  263 

51846  264 
fun mk_fun_arg_typess n ms = map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type; 
265 

51885  266 
fun mk_iter_fun_arg_types_pairsss fpTs ns mss = 
267 
mk_fp_iter_fun_types 

268 
#> map3 mk_fun_arg_typess ns mss 

269 
#> map (map (map (unzip_recT fpTs))); 

270 

51889  271 
fun mk_fold_rec_args_types fpTs Cs ns mss ctor_fold_fun_Ts ctor_rec_fun_Ts lthy = 
51832  272 
let 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

273 
val y_Tsss = map3 mk_fun_arg_typess ns mss ctor_fold_fun_Ts; 
51889  274 
val g_Tss = mk_fold_fun_typess y_Tsss Cs; 
51832  275 

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

277 
lthy 

278 
> mk_Freess "f" g_Tss 

279 
>> mk_Freesss "x" y_Tsss; 

280 

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

281 
val z_Tsss = map3 mk_fun_arg_typess ns mss ctor_rec_fun_Ts; 
51889  282 
val h_Tss = mk_rec_fun_typess fpTs z_Tsss Cs; 
51832  283 

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

285 
val zsss = map2 (map2 (map2 retype_free)) z_Tsss ysss; 

286 
in 

287 
(((gss, g_Tss, ysss), (hss, h_Tss, zsss)), lthy) 

288 
end; 

289 

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

293 
fun repair_arity [0] = [1] 

294 
 repair_arity ms = ms; 

295 

296 
fun project_corecT proj = 

297 
let 

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

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

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

301 
 project T = T; 

302 
in project end; 

303 

304 
fun unzip_corecT T = 

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

306 

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

309 
fun mk_types maybe_unzipT fun_Ts = 

310 
let 

311 
val f_sum_prod_Ts = map range_type fun_Ts; 

312 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 

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

51889  314 
val f_Tssss = map2 (fn C => map (map (map (curry (op >) C) o maybe_unzipT))) Cs f_Tsss; 
51829  315 
val q_Tssss = 
316 
map (map (map (fn [_] => []  [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; 

317 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 

51889  318 
in (q_Tssss, f_Tssss, (f_sum_prod_Ts, f_Tsss, pf_Tss)) end; 
51829  319 

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

51831  322 

51829  323 
val (((cs, pss), gssss), lthy) = 
324 
lthy 

325 
> mk_Frees "a" Cs 

326 
>> mk_Freess "p" p_Tss 

327 
>> mk_Freessss "g" g_Tssss; 

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

329 

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

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

332 
lthy 

333 
> mk_Freessss "q" s_Tssss 

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

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

51831  336 

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

51829  338 

51889  339 
fun mk_args qssss fssss = 
51831  340 
let 
341 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 

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

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

344 
in (pfss, cqssss, cfssss) end; 

345 

51889  346 
val unfold_args = mk_args rssss gssss; 
347 
val corec_args = mk_args sssss hssss; 

51831  348 
in 
51889  349 
((cs, cpss, (unfold_args, unfold_types), (corec_args, corec_types)), lthy) 
51831  350 
end; 
51829  351 

51903  352 
fun mk_un_fold_co_rec_prelims lfp fpTs As Cs ns mss fp_folds0 fp_recs0 lthy = 
353 
let 

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

354 
val (fp_folds, fp_fold_fun_Ts) = mk_fp_iters lthy lfp fpTs Cs fp_folds0; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

355 
val (fp_recs, fp_rec_fun_Ts) = mk_fp_iters lthy lfp fpTs Cs fp_recs0; 
51903  356 

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

358 
if lfp then 

359 
mk_fold_rec_args_types fpTs Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy 

360 
>> (rpair NONE o SOME) 

361 
else 

362 
mk_unfold_corec_args_types fpTs Cs ns mss fp_fold_fun_Ts fp_rec_fun_Ts lthy 

363 
>> (pair NONE o SOME) 

364 
in 

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

366 
end; 

367 

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

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

371 
end; 

372 

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

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

374 
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

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

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

377 

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

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

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

380 
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

381 
 _ => replicate n false); 
49536  382 

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

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

385 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  386 

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

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

388 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  389 

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

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

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

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

393 

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

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

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

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

397 
fun rel_binding_of (((_, (_, b)), _), _) = b; 
49181  398 
fun mixfix_of ((_, mx), _) = mx; 
49121  399 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  400 

49286  401 
fun disc_of ((((disc, _), _), _), _) = disc; 
402 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  405 
fun ctr_mixfix_of (_, mx) = mx; 
49119  406 

51907  407 
fun add_nesty_bnf_names Us = 
408 
let 

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

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

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

412 
end 

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

414 
in snd oo add end; 

415 

416 
fun nesty_bnfs ctxt ctr_Tsss Us = 

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

418 

51855  419 
fun indexify_fst xs f (x, y) = f (find_index (curry (op =) x) xs) (x, y); 
420 

51854  421 
fun build_map lthy build_simple = 
51853  422 
let 
423 
fun build (TU as (T, U)) = 

424 
if T = U then 

425 
id_const T 

426 
else 

427 
(case TU of 

51854  428 
(Type (s, Ts), Type (s', Us)) => 
429 
if s = s' then 

430 
let 

431 
val bnf = the (bnf_of lthy s); 

432 
val live = live_of_bnf bnf; 

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

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

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

436 
else 

437 
build_simple TU 

51853  438 
 _ => build_simple TU); 
439 
in build end; 

440 

51884  441 
fun mk_iter_body lthy fpTs ctor_iter fss xsss = 
442 
let 

443 
fun build_prod_proj mk_proj = build_map lthy (mk_proj o fst); 

444 

445 
(* TODO: Avoid these complications; cf. corec case *) 

446 
fun mk_U proj (Type (s as @{type_name prod}, Ts as [T', U])) = 

447 
if member (op =) fpTs T' then proj (T', U) else Type (s, map (mk_U proj) Ts) 

448 
 mk_U proj (Type (s, Ts)) = Type (s, map (mk_U proj) Ts) 

449 
 mk_U _ T = T; 

450 

451 
fun unzip_rec (x as Free (_, T)) = 

452 
if exists_subtype_in fpTs T then 

453 
([build_prod_proj fst_const (T, mk_U fst T) $ x], 

454 
[build_prod_proj snd_const (T, mk_U snd T) $ x]) 

455 
else 

456 
([x], []); 

457 

458 
fun mk_iter_arg f xs = mk_tupled_fun (HOLogic.mk_tuple xs) f (flat_rec unzip_rec xs); 

459 
in 

460 
Term.list_comb (ctor_iter, map2 (mk_sum_caseN_balanced oo map2 mk_iter_arg) fss xsss) 

461 
end; 

462 

51900  463 
fun mk_preds_getterss_join c cps sum_prod_T cqfss = 
464 
let val n = length cqfss in 

465 
Term.lambda c (mk_IfN sum_prod_T cps 

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

467 
end; 

51886  468 

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

472 

473 
fun build_dtor_coiter_arg _ [] [cf] = cf 

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

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

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

477 

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

479 
in 

51900  480 
Term.list_comb (dtor_coiter, map4 mk_preds_getterss_join cs cpss f_sum_prod_Ts cqfsss) 
51888  481 
end; 
51886  482 

51907  483 
fun define_fold_rec (fold_only, rec_only) mk_binding fpTs As Cs ctor_fold ctor_rec lthy0 = 
51897  484 
let 
51899  485 
val nn = length fpTs; 
486 

487 
val fpT_to_C = snd (strip_typeN nn (fastype_of ctor_fold)); 

51897  488 

489 
fun generate_iter (suf, ctor_iter, (fss, f_Tss, xsss)) = 

490 
let 

51899  491 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 
51897  492 
val binding = mk_binding suf; 
493 
val spec = 

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

51907  495 
mk_iter_body lthy0 fpTs ctor_iter fss xsss); 
51897  496 
in (binding, spec) end; 
497 

498 
val binding_specs = 

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

500 

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

504 
#>> apsnd snd) binding_specs 

505 
> `Local_Theory.restore; 

506 

507 
val phi = Proof_Context.export_morphism lthy lthy'; 

508 

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

510 

511 
val [foldx, recx] = map (mk_co_iter true As Cs o Morphism.term phi) csts; 

512 
in 

513 
((foldx, recx, fold_def, rec_def), lthy') 

514 
end; 

515 

51902  516 
fun define_unfold_corec (cs, cpss, unfold_only, corec_only) mk_binding fpTs As Cs dtor_unfold 
51907  517 
dtor_corec lthy0 = 
51897  518 
let 
51899  519 
val nn = length fpTs; 
520 

521 
val C_to_fpT = snd (strip_typeN nn (fastype_of dtor_unfold)); 

51897  522 

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

524 
(f_sum_prod_Ts, f_Tsss, pf_Tss))) = 

525 
let 

51899  526 
val res_T = fold_rev (curry (op >)) pf_Tss C_to_fpT; 
51897  527 
val binding = mk_binding suf; 
528 
val spec = 

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

51907  530 
mk_coiter_body lthy0 cs cpss f_sum_prod_Ts f_Tsss cqssss cfssss dtor_coiter); 
51897  531 
in (binding, spec) end; 
532 

533 
val binding_specs = 

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

535 

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

539 
#>> apsnd snd) binding_specs 

540 
> `Local_Theory.restore; 

541 

542 
val phi = Proof_Context.export_morphism lthy lthy'; 

543 

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

545 

546 
val [unfold, corec] = map (mk_co_iter false As Cs o Morphism.term phi) csts; 

547 
in 

548 
((unfold, corec, unfold_def, corec_def), lthy') 

549 
end; 

550 

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

553 
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

554 
let 
51827  555 
val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss; 
556 

51815  557 
val nn = length pre_bnfs; 
51827  558 
val ns = map length ctr_Tsss; 
559 
val mss = map (map length) ctr_Tsss; 

51815  560 

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

561 
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

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

564 
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

565 
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

566 
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

567 

51816  568 
val fp_b_names = map base_name_of_typ fpTs; 
51811  569 

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

570 
val (_, ctor_fold_fun_Ts) = mk_fp_iters lthy true fpTs Cs ctor_folds0; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

571 
val (_, ctor_rec_fun_Ts) = mk_fp_iters lthy true fpTs Cs ctor_recs0; 
51827  572 

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

573 
val (((gss, _, _), (hss, _, _)), names_lthy0) = 
51889  574 
mk_fold_rec_args_types fpTs Cs ns mss ctor_fold_fun_Ts ctor_rec_fun_Ts lthy; 
51827  575 

51832  576 
val ((((ps, ps'), xsss), us'), names_lthy) = 
577 
names_lthy0 

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

578 
> mk_Frees' "P" (map mk_pred1T fpTs) 
51827  579 
>> mk_Freesss "x" ctr_Tsss 
51816  580 
>> 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

581 

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

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

583 

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

584 
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

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

586 
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

587 
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

588 
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

589 
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

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

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

592 
 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

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

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

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

596 

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

597 
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

598 

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

599 
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

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

601 
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

602 
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

603 
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

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

605 

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

606 
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

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

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

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

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

611 
 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

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

613 
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

614 
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

615 
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

616 
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

617 
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

618 
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

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

620 
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

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

622 
 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

623 
 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

624 

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

625 
fun 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

626 
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

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

628 

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

629 
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

630 
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

631 
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

632 
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

633 

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

634 
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

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

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

637 
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

638 
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

639 

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

640 
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

641 
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

642 

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

643 
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

644 

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

645 
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

646 
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

647 
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

648 

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

649 
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

650 

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

652 

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

653 
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

654 
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

655 
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

656 
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

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

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

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

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

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

662 

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

663 
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

664 

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

665 
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

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

667 
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

668 
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

669 
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

670 

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

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

672 
fold_rev (fold_rev Logic.all) (xs :: fss) 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

674 

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

676 

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

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

678 
if exists_subtype_in fpTs T then 
51855  679 
combine (x, build_map lthy (indexify_fst fpTs (K o nth fiters)) (T, mk_U T) $ x) 
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset

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

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

682 

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

683 
val gxsss = map (map (flat_rec (unzip_iters gfolds (fn (_, t) => ([t], []))))) xsss; 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

685 

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

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

687 
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

688 

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

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

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

691 
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

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

693 
map2 (map o mk_iter_tac pre_map_defs nested_map_comp's 
51814  694 
(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

695 

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

696 
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

697 
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

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

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

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

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

702 

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

703 
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

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

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

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

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

708 

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

712 
let 
51815  713 
val nn = length pre_bnfs; 
714 

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

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

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

719 
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

720 
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

721 
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

722 

51816  723 
val fp_b_names = map base_name_of_typ fpTs; 
51811  724 

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

725 
val (_, dtor_unfold_fun_Ts) = mk_fp_iters lthy false fpTs Cs dtor_unfolds0; 
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset

726 
val (_, dtor_corec_fun_Ts) = mk_fp_iters lthy false fpTs Cs dtor_corecs0; 
51829  727 

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

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

731 
val exhausts = map #exhaust ctr_sugars; 

732 
val disc_thmsss = map #disc_thmss ctr_sugars; 

733 
val discIss = map #discIs ctr_sugars; 

734 
val sel_thmsss = map #sel_thmss ctr_sugars; 

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

735 

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

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

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

741 
> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) 
51816  742 
>> Variable.variant_fixes fp_b_names 
743 
>> Variable.variant_fixes (map (suffix "'") fp_b_names); 

51810
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 
val us = map2 (curry Free) us' fpTs; 
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

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

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

748 

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

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

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

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

752 

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

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

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

755 
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

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

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

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

759 
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

760 

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

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

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

763 
~1 => 
51856  764 
if exists_subtype_in fpTs T then 
765 
let 

766 
val Type (s, Ts) = T 

767 
val bnf = the (bnf_of lthy s); 

768 
val live = live_of_bnf bnf; 

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

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

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

772 
else 

773 
HOLogic.eq_const T 

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

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

775 

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

777 

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

778 
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

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

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

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

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

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

784 
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

785 

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

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

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

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

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

790 

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

791 
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

792 
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

793 
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

794 

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

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

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

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

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

799 

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

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

801 
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

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

803 

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

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

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

806 

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

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

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

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

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

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

813 

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

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

815 
Thm.permute_prems 0 nn 
51828  816 
(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

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

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

819 
in 
51814  820 
(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

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

822 

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

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

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

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

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

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

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

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

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

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

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

833 

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

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

836 
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

837 

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

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

839 

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

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

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

842 

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

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

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

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

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

847 
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, 
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

849 

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

851 

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

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

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

856 
else 

857 
cf 

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

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

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

860 
mk_If cq (intr_coiters fcoiters [] [cf]) (intr_coiters fcoiters [] [cf']); 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

861 

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

862 
val crgsss = map2 (map2 (map2 (intr_coiters gunfolds))) crssss cgssss; 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

864 

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

867 

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

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

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

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

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

872 
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

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

874 
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

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

876 
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

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

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

879 

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

880 
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

881 

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

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

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

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

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

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

889 

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

890 
fun prove goal tac = 
51815  891 
Goal.prove_sorry lthy [] [] goal (tac o #context) 
892 
> Thm.close_derivation; 

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

893 

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

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

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

896 

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

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

898 
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

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

900 

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

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

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

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

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

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

906 

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

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

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

909 
fun mk_goal c cps fcoiter n k disc = 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

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

912 
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

913 

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

914 
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

915 
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

916 

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

918 

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

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

920 

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

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

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

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

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

925 

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

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

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

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

930 

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

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

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

933 
in 
51828  934 
(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

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

936 

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

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

938 

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

939 
fun mk_disc_coiter_thms coiters discIs = 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

941 

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

942 
val disc_unfold_thmss = map2 mk_disc_coiter_thms unfold_thmss discIss; 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

944 

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

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

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

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

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

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

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

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

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

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

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

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

956 

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

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

958 
map3 (map3 (map2 o mk_sel_coiter_thm)) coiterss selsss sel_thmsss > map flat; 
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset

959 

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

960 
val sel_unfold_thmss = mk_sel_coiter_thms unfold_thmss; 
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset

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

962 

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

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

964 
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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

979 

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

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

984 

49286  985 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  986 
else (); 
987 

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

990 

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

992 
val fp_bs = map type_binding_of specs; 
49498  993 
val fp_b_names = map Binding.name_of fp_bs; 
994 
val fp_common_name = mk_common_name fp_b_names; 

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

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

997 

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

999 
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

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

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

1002 

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

1004 
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

1005 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
51758  1006 
val set_bss = map (map fst o type_args_named_constrained_of) specs; 
49119  1007 

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

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

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

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

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

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

1013 
>> variant_tfrees fp_b_names; 
49119  1014 

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

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

1016 
(*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

1017 
locale and shadows an existing global type*) 
51768  1018 

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

1019 
fun add_fake_type spec = 
51768  1020 
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

1021 
length (type_args_named_constrained_of spec), mixfix_of spec); 
51768  1022 

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

1023 
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

1024 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  1025 

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

1026 
fun mk_fake_T b = 
49121  1027 
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

1028 
unsorted_As); 
49121  1029 

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

1030 
val fake_Ts = map mk_fake_T fp_bs; 
49121  1031 

49181  1032 
val mixfixes = map mixfix_of specs; 
49119  1033 

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

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

49121  1037 
val ctr_specss = map ctr_specs_of specs; 
49119  1038 

49336  1039 
val disc_bindingss = map (map disc_of) ctr_specss; 
1040 
val ctr_bindingss = 

49633  1041 
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  1042 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  1043 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  1044 

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

1046 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  1047 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
1048 

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

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

1050 
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

1051 

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

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

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

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

1055 

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

1056 
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

1057 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  1058 
[] => () 
49342  1059 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  1060 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  1061 

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

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

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

1065 
 eq_fpT_check _ _ = false; 
49146  1066 

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

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

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

1070 
 kk => nth Xs kk) 
49204  1071 
 freeze_fp T = T; 
49121  1072 

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

49119  1075 

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

1076 
val fp_eqs = 
49536  1077 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  1078 

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

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

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

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

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

1086 

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

1087 
val timer = time (Timer.startRealTimer ()); 
49121  1088 

51907  1089 
val nesting_bnfs = nesty_bnfs lthy ctr_TsssXs As; 
1090 
val nested_bnfs = nesty_bnfs lthy ctr_TsssXs Xs; 

49226  1091 

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

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

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

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

1096 
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

1097 

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

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

1099 

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

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

1101 
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

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

1103 

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

1104 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  1105 

49501  1106 
val ctors = map (mk_ctor As) ctors0; 
1107 
val dtors = map (mk_dtor As) dtors0; 

49124  1108 

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

1110 

51780  1111 
fun massage_simple_notes base = 
1112 
filter_out (null o #2) 

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

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

1115 

1116 
val massage_multi_notes = 

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

1118 
if forall null thmss then 

1119 
[] 

1120 
else 

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

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

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

1124 

49536  1125 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  1126 
val ns = map length ctr_Tsss; 
49212  1127 
val kss = map (fn n => 1 upto n) ns; 
49203  1128 
val mss = map (map length) ctr_Tsss; 
1129 

51903  1130 
val ((fp_folds, fp_recs, fold_rec_args_types, unfold_corec_args_types), lthy) = 
1131 
mk_un_fold_co_rec_prelims lfp fpTs As Cs ns mss fp_folds0 fp_recs0 lthy; 

49210  1132 

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

1133 
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

1134 
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

1135 
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

1136 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  1137 
let 
49498  1138 
val fp_b_name = Binding.name_of fp_b; 
1139 

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

1142 
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

1143 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  1144 

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

1150 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  1151 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  1152 

49498  1153 
val u = Free (u', fpT); 
49121  1154 

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

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

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

1157 

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

1159 
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

1160 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  1161 

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

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

1164 
val case_rhs = 
49498  1165 
fold_rev Term.lambda (fs @ [u]) 
49501  1166 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); 
49129  1167 

49201  1168 
val ((raw_case :: raw_ctrs, raw_case_def :: raw_ctr_defs), (lthy', lthy)) = no_defs_lthy 
49169  1169 
> 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

1170 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  1171 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  1172 
> `Local_Theory.restore; 
1173 

1174 
val phi = Proof_Context.export_morphism lthy lthy'; 

1175 

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

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

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

1178 
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

1179 
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

1180 

49203  1181 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
1182 
val casex0 = Morphism.term phi raw_case; 

1183 

1184 
val ctrs = map (mk_ctr As) ctrs0; 

49121  1185 

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

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

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

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

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

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

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

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

1197 
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

1198 
(certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor) 