author  blanchet 
Fri, 08 Mar 2013 14:15:39 +0100  
changeset 51380  cac8c9a636b6 
parent 50170  8155e280f239 
child 51551  88d1d19fb74f 
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 
49536  10 
val datatypes: bool > 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

11 
(mixfix list > (string * sort) list option > binding list > typ list * typ list list > 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

12 
BNF_Def.BNF list > local_theory > BNF_FP.fp_result * local_theory) > 
49633  13 
(bool * bool) * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) * 
49297  14 
(binding * typ) list) * (binding * term) list) * mixfix) list) list > 
15 
local_theory > local_theory 

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

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

17 
(mixfix list > (string * sort) list option > binding list > typ list * typ list list > 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

18 
BNF_Def.BNF list > local_theory > BNF_FP.fp_result * local_theory) > 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

19 
(local_theory > local_theory) parser 
49112  20 
end; 
21 

49636  22 
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = 
49112  23 
struct 
24 

49119  25 
open BNF_Util 
26 
open BNF_Wrap 

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

27 
open BNF_Def 
49457  28 
open BNF_FP 
49636  29 
open BNF_FP_Def_Sugar_Tactics 
49119  30 

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

33 
let 

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

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

36 
fun underscore s = 

37 
let val ss = space_explode Long_Name.separator s in 

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

39 
end; 

40 
in 

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

42 
end; 

43 

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

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

45 

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

47 
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; 
49300  48 

50170  49 
fun split_list4 [] = ([], [], [], []) 
50 
 split_list4 ((x1, x2, x3, x4) :: xs) = 

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

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

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

53 

49342  54 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
55 

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

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

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

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

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

60 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  61 

49583  62 
fun variant_types ss Ss ctxt = 
63 
let 

64 
val (tfrees, _) = 

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

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

67 
in (tfrees, ctxt') end; 

68 

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

70 

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

73 

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

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

75 
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

76 

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

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

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

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

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

81 
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

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

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

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

85 

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

88 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

89 
end; 

90 

91 
val mk_ctor = mk_ctor_or_dtor range_type; 

92 
val mk_dtor = mk_ctor_or_dtor domain_type; 

93 

94 
fun mk_rec_like lfp Ts Us t = 

95 
let 

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

97 
val (f_Us, prebody) = split_last bindings; 

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

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

100 
in 

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

102 
end; 

103 

104 
fun mk_map live Ts Us t = 

105 
let val (Type (_, Ts0), Type (_, Us0)) = strip_typeN (live + 1) (fastype_of t) >> List.last in 

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

107 
end; 

108 

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

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

110 
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

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

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

113 

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

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

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

116 
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

117 
 _ => replicate n false); 
49536  118 

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

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

121 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  122 

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

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

124 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  125 

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

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

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

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

129 

49121  130 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
49336  131 
fun type_binding_of (((_, b), _), _) = b; 
49181  132 
fun mixfix_of ((_, mx), _) = mx; 
49121  133 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  134 

49286  135 
fun disc_of ((((disc, _), _), _), _) = disc; 
136 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  139 
fun ctr_mixfix_of (_, mx) = mx; 
49119  140 

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

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

144 
(* TODO: sanity checks on arguments *) 
49478  145 
(* TODO: integration with function package ("size") *) 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

146 

49286  147 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  148 
else (); 
149 

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

152 

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

154 
val fp_bs = map type_binding_of specs; 
49498  155 
val fp_b_names = map Binding.name_of fp_bs; 
156 
val fp_common_name = mk_common_name fp_b_names; 

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

157 

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

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

159 
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

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

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

162 

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

163 
val Ass0 = map (map prepare_type_arg o type_args_constrained_of) specs; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

164 
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

165 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
49119  166 

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

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

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

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

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

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

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

173 
variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS); 
49119  174 

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

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

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

177 
locale and shadows an existing global type*) 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

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

179 
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy 
49336  180 
(type_binding_of spec, length (type_args_constrained_of spec), mixfix_of spec)))) specs; 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

181 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  182 

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

183 
fun mk_fake_T b = 
49121  184 
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

185 
unsorted_As); 
49121  186 

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

187 
val fake_Ts = map mk_fake_T fp_bs; 
49121  188 

49181  189 
val mixfixes = map mixfix_of specs; 
49119  190 

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

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

49121  194 
val ctr_specss = map ctr_specs_of specs; 
49119  195 

49336  196 
val disc_bindingss = map (map disc_of) ctr_specss; 
197 
val ctr_bindingss = 

49633  198 
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  199 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  200 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  201 

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

203 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  204 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
205 

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

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

207 
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

208 

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

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

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

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

212 

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

213 
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

214 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  215 
[] => () 
49342  216 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  217 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  218 

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

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

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

222 
 eq_fpT_check _ _ = false; 
49146  223 

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

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

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

227 
 kk => nth Xs kk) 
49204  228 
 freeze_fp T = T; 
49121  229 

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

49119  232 

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

233 
val fp_eqs = 
49536  234 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  235 

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

236 
(* TODO: clean up list *) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

237 
val (pre_bnfs, ((fp_bnfs as any_fp_bnf :: _, dtors0, ctors0, fp_folds0, fp_recs0, fp_induct, 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

238 
fp_strong_induct, dtor_ctors, ctor_dtors, ctor_injects, fp_map_thms, fp_set_thmss, 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

239 
fp_rel_thms, fp_fold_thms, fp_rec_thms), lthy)) = 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

240 
fp_bnf construct_fp fp_bs mixfixes (map dest_TFree unsorted_As) fp_eqs no_defs_lthy0; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

241 

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

242 
val timer = time (Timer.startRealTimer ()); 
49121  243 

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

244 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

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

246 
val bnf = the (bnf_of lthy s); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

247 
val live = live_of_bnf bnf; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

248 
val mapx = mk_map live Ts Us (map_of_bnf bnf); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

249 
val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx))); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

250 
in Term.list_comb (mapx, map build_arg TUs') end; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

251 

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

252 
fun build_rel_step build_arg (Type (s, Ts)) = 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

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

254 
val bnf = the (bnf_of lthy s); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

255 
val live = live_of_bnf bnf; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

256 
val rel = mk_rel live Ts Ts (rel_of_bnf bnf); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

257 
val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel))); 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

258 
in Term.list_comb (rel, map build_arg Ts') end; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

259 

49363  260 
fun add_nesty_bnf_names Us = 
49226  261 
let 
262 
fun add (Type (s, Ts)) ss = 

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

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

265 
end 

49363  266 
 add T ss = (member (op =) Us T, ss); 
49226  267 
in snd oo add end; 
268 

49363  269 
fun nesty_bnfs Us = 
49536  270 
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); 
49363  271 

272 
val nesting_bnfs = nesty_bnfs As; 

49536  273 
val nested_bnfs = nesty_bnfs Xs; 
49226  274 

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

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

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

277 
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; 
49683  278 
val nested_map_comps'' = map ((fn thm => thm RS sym) o map_comp_of_bnf) nested_bnfs; 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

279 
val nested_map_comp's = map map_comp'_of_bnf nested_bnfs; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

280 
val nested_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nested_bnfs; 
49671  281 
val nesting_map_ids'' = map (unfold_thms lthy @{thms id_def} o map_id_of_bnf) nesting_bnfs; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

282 
val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

283 
val nesting_set_natural's = maps set_natural'_of_bnf nesting_bnfs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

284 

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

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

286 

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

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

288 
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

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

290 

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

291 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  292 

49501  293 
val ctors = map (mk_ctor As) ctors0; 
294 
val dtors = map (mk_dtor As) dtors0; 

49124  295 

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

297 

1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

298 
val exists_fp_subtype = exists_subtype (member (op =) fpTs); 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

299 
val exists_Cs_subtype = exists_subtype (member (op =) Cs); 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

300 

49536  301 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  302 
val ns = map length ctr_Tsss; 
49212  303 
val kss = map (fn n => 1 upto n) ns; 
49203  304 
val mss = map (map length) ctr_Tsss; 
305 
val Css = map2 replicate ns Cs; 

306 

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

307 
val fp_folds as any_fp_fold :: _ = map (mk_rec_like lfp As Cs) fp_folds0; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

308 
val fp_recs as any_fp_rec :: _ = map (mk_rec_like lfp As Cs) fp_recs0; 
49210  309 

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

310 
val fp_fold_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_fold))); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

311 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec))); 
49204  312 

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

313 
val (((fold_only as (gss, _, _), rec_only as (hss, _, _)), 
49683  314 
(cs, cpss, unfold_only as ((pgss, crssss, cgssss), (_, g_Tsss, _)), 
315 
corec_only as ((phss, csssss, chssss), (_, h_Tsss, _)))), names_lthy0) = 

49208  316 
if lfp then 
317 
let 

318 
val y_Tsss = 

49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

319 
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

320 
ns mss fp_fold_fun_Ts; 
49208  321 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
322 

49484  323 
val ((gss, ysss), lthy) = 
49208  324 
lthy 
325 
> mk_Freess "f" g_Tss 

326 
>> mk_Freesss "x" y_Tsss; 

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

327 

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

328 
fun proj_recT proj (Type (s as @{type_name prod}, Ts as [T, U])) = 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

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

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

331 
 proj_recT _ T = T; 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

332 

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

333 
fun unzip_recT T = 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

334 
if exists_fp_subtype T then [proj_recT fst T, proj_recT snd T] else [T]; 
49204  335 

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

336 
val z_Tsss = 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

337 
map3 (fn n => fn ms => map2 dest_tupleT ms o dest_sumTN_balanced n o domain_type) 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

338 
ns mss fp_rec_fun_Ts; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

339 
val z_Tssss = map (map (map unzip_recT)) z_Tsss; 
49208  340 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  341 

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

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

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

345 
((((gss, g_Tss, ysss), (hss, h_Tss, zsss)), 
49683  346 
([], [], (([], [], []), ([], [], [])), (([], [], []), ([], [], [])))), lthy) 
49210  347 
end 
49208  348 
else 
49210  349 
let 
49221
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

350 
(*avoid "'a itself" arguments in coiterators and corecursors*) 
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

351 
val mss' = map (fn [0] => [1]  ms => ms) mss; 
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

352 

49463  353 
val p_Tss = map2 (fn n => replicate (Int.max (0, n  1)) o mk_pred1T) ns Cs; 
49275  354 

49587  355 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
49211  356 

49587  357 
fun flat_preds_predsss_gettersss [] [qss] [fss] = flat_predss_getterss qss fss 
358 
 flat_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = 

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

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

360 

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

361 
fun mk_types maybe_unzipT fun_Ts = 
49212  362 
let 
363 
val f_sum_prod_Ts = map range_type fun_Ts; 

49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

364 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

365 
val f_Tsss = map2 (map2 dest_tupleT) mss' f_prod_Tss; 
49275  366 
val f_Tssss = 
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

367 
map2 (fn C => map (map (map (curry (op >) C) o maybe_unzipT))) Cs f_Tsss; 
49275  368 
val q_Tssss = 
49463  369 
map (map (map (fn [_] => []  [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; 
49587  370 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

371 
in (q_Tssss, f_sum_prod_Ts, f_Tsss, f_Tssss, pf_Tss) end; 
49176  372 

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

373 
val (r_Tssss, g_sum_prod_Ts, g_Tsss, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts; 
49211  374 

49683  375 
val (((cs, pss), gssss), lthy) = 
49210  376 
lthy 
49683  377 
> mk_Frees "a" Cs 
49211  378 
>> mk_Freess "p" p_Tss 
49275  379 
>> mk_Freessss "g" g_Tssss; 
380 
val rssss = map (map (map (fn [] => []))) r_Tssss; 

49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

381 

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

382 
fun proj_corecT proj (Type (s as @{type_name sum}, Ts as [T, U])) = 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

383 
if member (op =) fpTs T then proj (T, U) else Type (s, map (proj_corecT proj) Ts) 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

384 
 proj_corecT proj (Type (s, Ts)) = Type (s, map (proj_corecT proj) Ts) 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

385 
 proj_corecT _ T = T; 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

386 

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

387 
fun unzip_corecT T = 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

388 
if exists_fp_subtype T then [proj_corecT fst T, proj_corecT snd T] else [T]; 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

389 

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

390 
val (s_Tssss, h_sum_prod_Ts, h_Tsss, h_Tssss, ph_Tss) = 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

391 
mk_types unzip_corecT fp_rec_fun_Ts; 
49210  392 

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

393 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 
49484  394 
val ((sssss, hssss_tl), lthy) = 
49275  395 
lthy 
396 
> mk_Freessss "q" s_Tssss 

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

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

49211  399 

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

400 
val cpss = map2 (map o rapp) cs pss; 
49212  401 

49683  402 
fun mk_terms qssss fssss = 
49212  403 
let 
49587  404 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

405 
val cqssss = map2 (map o map o map o rapp) cs qssss; 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

406 
val cfssss = map2 (map o map o map o rapp) cs fssss; 
49683  407 
in (pfss, cqssss, cfssss) end; 
49210  408 
in 
49484  409 
(((([], [], []), ([], [], [])), 
49683  410 
(cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, g_Tsss, pg_Tss)), 
411 
(mk_terms sssss hssss, (h_sum_prod_Ts, h_Tsss, ph_Tss)))), lthy) 

49210  412 
end; 
413 

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

414 
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

415 
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

416 
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

417 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  418 
let 
49498  419 
val fp_b_name = Binding.name_of fp_b; 
420 

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

423 
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

424 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  425 

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

431 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  432 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  433 

49498  434 
val u = Free (u', fpT); 
49121  435 

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

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

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

438 

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

440 
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

441 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  442 

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

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

445 
val case_rhs = 
49498  446 
fold_rev Term.lambda (fs @ [u]) 
49501  447 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); 
49129  448 

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

451 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  452 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  453 
> `Local_Theory.restore; 
454 

455 
val phi = Proof_Context.export_morphism lthy lthy'; 

456 

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

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

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

459 
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

460 
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

461 

49203  462 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
463 
val casex0 = Morphism.term phi raw_case; 

464 

465 
val ctrs = map (mk_ctr As) ctrs0; 

49121  466 

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

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

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

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

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

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

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

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

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

477 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

478 
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

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

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

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

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

483 

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

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

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

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

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

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

490 
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' 
49135  491 
end; 
492 

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

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

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

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

496 

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

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

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

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

500 

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

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

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

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

504 

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

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

506 

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

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

508 
in 
49633  509 
wrap_datatype tacss (((wrap_opts, ctrs0), casex0), (disc_bindings, (sel_bindingss, 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

511 
end; 
49121  512 

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

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

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

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

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

517 

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

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

519 
if lfp then Drule.dummy_thm 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

520 
else cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor)] arg_cong; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

521 

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

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

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

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

525 

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

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

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

528 

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

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

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

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

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

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

536 

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

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

539 
(unfold_thms lthy (pre_set_defs @ nested_set_natural's @ nesting_set_natural's @ 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

543 

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

545 

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

547 
val set_thmss = map mk_set_thms fp_set_thms; 
49127  548 

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

550 

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

552 
fold_thms lthy ctr_defs' 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

553 
(unfold_thms lthy (pre_rel_def :: (if lfp then [] else [dtor_ctor]) @ 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

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

555 
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) 
49593  556 
> postproc 
557 
> singleton (Proof_Context.export names_lthy no_defs_lthy); 

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

558 

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

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

561 

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

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

563 

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

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

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

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

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

570 

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

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

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

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

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

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

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

577 

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

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

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

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

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

582 
(setsN, flat set_thmss, code_simp_attrs)] 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

583 
> filter_out (null o #2) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

584 
> map (fn (thmN, thms, attrs) => 
49633  585 
((qualify true fp_b_name (Binding.name thmN), attrs), [(thms, [])])); 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

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

589 

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

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

591 
let 
49208  592 
val fpT_to_C = fpT > C; 
49199  593 

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

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

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

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

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

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

599 
(Type (s, _), Type (s', _)) => 
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

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

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

602 

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

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

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

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

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

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

608 

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

609 
fun unzip_rec (x as Free (_, T)) = 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

610 
if exists_fp_subtype T then 
49681
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

611 
[build_prod_proj fst_const (T, mk_U fst T) $ x, 
aa66ea552357
changed type of corecursor for the nested recursion case
blanchet
parents:
49672
diff
changeset

612 
build_prod_proj snd_const (T, mk_U snd T) $ x] 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

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

614 
[x]; 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

615 

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

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

617 

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

618 
fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xsss)) = 
49215  619 
let 
620 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 

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

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

625 
map2 (mk_sum_caseN_balanced oo map2 mk_rec_like_arg) fss xsss)); 
49336  626 
in (binding, spec) end; 
49199  627 

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

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

629 
[(foldN, fp_fold, fold_only), 
49215  630 
(recN, fp_rec, rec_only)]; 
631 

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

632 
val (bindings, specs) = map generate_rec_like rec_like_infos > split_list; 
49215  633 

634 
val ((csts, defs), (lthy', lthy)) = no_defs_lthy 

49201  635 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  636 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49336  637 
#>> apsnd snd) bindings specs 
49199  638 
> `Local_Theory.restore; 
49201  639 

640 
val phi = Proof_Context.export_morphism lthy lthy'; 

641 

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

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

49536  644 
val [foldx, recx] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

645 
in 
49693
393d7242adaf
thread the right local theory through + reenable parallel proofs for previously problematic theories
blanchet
parents:
49683
diff
changeset

646 
((foldx, recx, fold_def, rec_def), lthy') 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

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

648 

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

649 
fun define_unfold_corec no_defs_lthy = 
49210  650 
let 
651 
val B_to_fpT = C > fpT; 

49211  652 

49683  653 
fun build_sum_inj mk_inj (T, U) = 
654 
if T = U then 

655 
id_const T 

656 
else 

657 
(case (T, U) of 

658 
(Type (s, _), Type (s', _)) => 

659 
if s = s' then build_map (build_sum_inj mk_inj) T U 

660 
else uncurry mk_inj (dest_sumT U) 

661 
 _ => uncurry mk_inj (dest_sumT U)); 

662 

663 
fun build_dtor_corec_like_arg _ [] [cf] = cf 

664 
 build_dtor_corec_like_arg T [cq] [cf, cf'] = 

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

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

667 

668 
val crgsss = map3 (map3 (map3 build_dtor_corec_like_arg)) g_Tsss crssss cgssss; 

669 
val cshsss = map3 (map3 (map3 build_dtor_corec_like_arg)) h_Tsss csssss chssss; 

670 

49276  671 
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = 
672 
Term.lambda c (mk_IfN sum_prod_T cps 

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

49275  674 

49683  675 
fun generate_corec_like (suf, fp_rec_like, (cqfsss, ((pfss, _, _), (f_sum_prod_Ts, _, 
676 
pf_Tss)))) = 

49211  677 
let 
678 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

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

682 
Term.list_comb (fp_rec_like, 
49276  683 
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); 
49336  684 
in (binding, spec) end; 
49210  685 

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

686 
val corec_like_infos = 
49683  687 
[(unfoldN, fp_fold, (crgsss, unfold_only)), 
688 
(corecN, fp_rec, (cshsss, corec_only))]; 

49212  689 

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

690 
val (bindings, specs) = map generate_corec_like corec_like_infos > split_list; 
49211  691 

692 
val ((csts, defs), (lthy', lthy)) = no_defs_lthy 

49210  693 
> apfst split_list o fold_map2 (fn b => fn spec => 
694 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 

49336  695 
#>> apsnd snd) bindings specs 
49210  696 
> `Local_Theory.restore; 
697 

698 
val phi = Proof_Context.export_morphism lthy lthy'; 

699 

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

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

49536  702 
val [unfold, corec] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts; 
49210  703 
in 
49693
393d7242adaf
thread the right local theory through + reenable parallel proofs for previously problematic theories
blanchet
parents:
49683
diff
changeset

704 
((unfold, corec, unfold_def, corec_def), lthy') 
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

705 
end; 
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset

706 

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

707 
val define_rec_likes = if lfp then define_fold_rec else define_unfold_corec; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

708 

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

709 
fun massage_res ((wrap_res, rec_like_res), lthy) = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

710 
(((ctrs, xss, ctr_defs, wrap_res), rec_like_res), lthy); 
49119  711 
in 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

712 
(wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy') 
49119  713 
end; 
49167  714 

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

715 
fun wrap_types_and_more (wrap_types_and_mores, lthy) = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

716 
fold_map I wrap_types_and_mores lthy 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

717 
>> apsnd split_list4 o apfst split_list4 o split_list; 
49226  718 

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

719 
(* TODO: Add map, sets, rel simps *) 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

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

721 
map3 (fn (_, _, _, injects, distincts, cases, _, _, _) => fn rec_likes => fn fold_likes => 
49505  722 
injects @ distincts @ cases @ rec_likes @ fold_likes); 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

723 

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

724 
fun derive_induct_fold_rec_thms_for_types (((ctrss, xsss, ctr_defss, wrap_ress), (folds, recs, 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

725 
fold_defs, rec_defs)), lthy) = 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

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

727 
val (((ps, ps'), us'), names_lthy) = 
49370  728 
lthy 
49463  729 
> mk_Frees' "P" (map mk_pred1T fpTs) 
49498  730 
>> Variable.variant_fixes fp_b_names; 
49370  731 

49498  732 
val us = map2 (curry Free) us' fpTs; 
49370  733 

49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

734 
fun mk_sets_nested bnf = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

735 
let 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

736 
val Type (T_name, Us) = T_of_bnf bnf; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

737 
val lives = lives_of_bnf bnf; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

738 
val sets = sets_of_bnf bnf; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

739 
fun mk_set U = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

740 
(case find_index (curry (op =) U) lives of 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

741 
~1 => Term.dummy 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

742 
 i => nth sets i); 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

743 
in 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

744 
(T_name, map mk_set Us) 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

745 
end; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

746 

1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

747 
val setss_nested = map mk_sets_nested nested_bnfs; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

748 

49337  749 
val (induct_thms, induct_thm) = 
750 
let 

49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

751 
fun mk_set Ts t = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

752 
let val Type (_, Ts0) = domain_type (fastype_of t) in 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

753 
Term.subst_atomic_types (Ts0 ~~ Ts) t 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

754 
end; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

755 

49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset

756 
fun mk_raw_prem_prems names_lthy (x as Free (s, T as Type (T_name, Ts0))) = 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

757 
(case find_index (curry (op =) T) fpTs of 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

758 
~1 => 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

759 
(case AList.lookup (op =) setss_nested T_name of 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

760 
NONE => [] 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

761 
 SOME raw_sets0 => 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

762 
let 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

763 
val (Ts, raw_sets) = 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

764 
split_list (filter (exists_fp_subtype o fst) (Ts0 ~~ raw_sets0)); 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

765 
val sets = map (mk_set Ts0) raw_sets; 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

766 
val (ys, names_lthy') = names_lthy > mk_Frees s Ts; 
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset

767 
val xysets = map (pair x) (ys ~~ sets); 
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset

768 
val ppremss = map (mk_raw_prem_prems names_lthy') ys; 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

769 
in 
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset

770 
flat (map2 (map o apfst o cons) xysets ppremss) 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

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

772 
 kk => [([], (kk + 1, x))]) 
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset

773 
 mk_raw_prem_prems _ _ = []; 
49342  774 

49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

775 
fun close_prem_prem xs t = 
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

776 
fold_rev Logic.all (map Free (drop (nn + length xs) 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

777 
(rev (Term.add_frees t (map dest_Free xs @ ps'))))) t; 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

778 

49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

779 
fun mk_prem_prem xs (xysets, (j, x)) = 
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

780 
close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) => 
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset

781 
HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets, 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

782 
HOLogic.mk_Trueprop (nth ps (j  1) $ x))); 
49375
993677c1cf2a
tuned code before fixing "mk_induct_discharge_prem_prems_tac"
blanchet
parents:
49372
diff
changeset

783 

49372  784 
fun mk_raw_prem phi ctr ctr_Ts = 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

785 
let 
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

786 
val (xs, names_lthy') = names_lthy > mk_Frees "x" ctr_Ts; 
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset

787 
val pprems = maps (mk_raw_prem_prems names_lthy') xs; 
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

788 
in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end; 
49342  789 

49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset

790 
fun mk_prem (xs, raw_pprems, concl) = 
49378
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

791 
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); 
49368  792 

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

793 
val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss; 
49389  794 

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

795 
val goal = 
49372  796 
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss, 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

797 
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us))); 
49368  798 

49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49427
diff
changeset

799 
val kksss = map (map (map (fst o snd) o #2)) raw_premss; 
49368  800 

49501  801 
val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); 
49342  802 

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

803 
val thm = 
49361
cc1d39529dd1
derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive
blanchet
parents:
49342
diff
changeset

804 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 
49590  805 
mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' 
49389  806 
nested_set_natural's pre_set_defss) 
49368  807 
> singleton (Proof_Context.export names_lthy lthy) 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

808 
> Thm.close_derivation; 
49337  809 
in 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

810 
`(conj_dests nn) thm 
49337  811 
end; 
49201  812 

49622  813 
val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss); 
49437  814 

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

815 
val (fold_thmss, rec_thmss) = 
49207  816 
let 
49337  817 
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

818 
val gfolds = map (lists_bmoc gss) folds; 
49337  819 
val hrecs = map (lists_bmoc hss) recs; 
820 

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

821 
fun mk_goal fss frec_like xctr f xs fxs = 
49207  822 
fold_rev (fold_rev Logic.all) (xs :: fss) 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

823 
(mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs))); 
49204  824 

49682  825 
fun build_rec_like frec_likes (T, U) = 
49234  826 
if T = U then 
49368  827 
id_const T 
49234  828 
else 
829 
(case find_index (curry (op =) T) fpTs of 

49682  830 
~1 => build_map (build_rec_like frec_likes) T U 
831 
 kk => nth frec_likes kk); 

49233  832 

49682  833 
val mk_U = typ_subst (map2 pair fpTs Cs); 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

834 

49682  835 
fun intr_rec_likes frec_likes maybe_cons (x as Free (_, T)) = 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

836 
if exists_fp_subtype T then 
49682  837 
maybe_cons x [build_rec_like frec_likes (T, mk_U T) $ x] 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

839 
[x]; 
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

840 

49682  841 
val gxsss = map (map (maps (intr_rec_likes gfolds (K I)))) xsss; 
842 
val hxsss = map (map (maps (intr_rec_likes hrecs cons))) xsss; 

49204  843 

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

844 
val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss; 
49484  845 
val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss; 
49204  846 

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

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

848 
map2 (map o mk_rec_like_tac pre_map_defs [] nesting_map_ids'' fold_defs) fp_fold_thms 
49363  849 
ctr_defss; 
49203  850 
val rec_tacss = 
49670
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

851 
map2 (map o mk_rec_like_tac pre_map_defs nested_map_comp's 
c7a034d01936
changed the type of the recursor for nested recursion
blanchet
parents:
49636
diff
changeset

852 
(nested_map_ids'' @ nesting_map_ids'') rec_defs) fp_rec_thms ctr_defss; 
49484  853 

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

854 
fun prove goal tac = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

855 
Skip_Proof.prove lthy [] [] goal (tac o #context) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

856 
> Thm.close_derivation; 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

857 
in 
49595
e8c57e59cbf8
got rid of other instance of shaky "Thm.generalize"
blanchet
parents:
49594
diff
changeset

858 
(map2 (map2 prove) fold_goalss fold_tacss, map2 (map2 prove) rec_goalss rec_tacss) 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

859 
end; 
49201  860 

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

861 
val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss; 
49438  862 

49437  863 
val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases)); 
864 
fun induct_type_attr T_name = Attrib.internal (K (Induct.induct_type T_name)); 

865 

49337  866 
val common_notes = 
49437  867 
(if nn > 1 then [(inductN, [induct_thm], [induct_case_names_attr])] else []) 
49337  868 
> map (fn (thmN, thms, attrs) => 
49633  869 
((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 
49337  870 

49226  871 
val notes = 
49633  872 
[(foldN, fold_thmss, K code_simp_attrs), 
873 
(inductN, map single induct_thms, 

49437  874 
fn T_name => [induct_case_names_attr, induct_type_attr T_name]), 
49622  875 
(recN, rec_thmss, K code_simp_attrs), 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

876 
(simpsN, simp_thmss, K [])] 
49300  877 
> maps (fn (thmN, thmss, attrs) => 
49633  878 
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => 
879 
((qualify true fp_b_name (Binding.name thmN), attrs T_name), 

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

49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

881 
in 
49337  882 
lthy > Local_Theory.notes (common_notes @ notes) > snd 
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

883 
end; 
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset

884 

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

885 
fun derive_coinduct_unfold_corec_thms_for_types (((ctrss, _, ctr_defss, wrap_ress), (unfolds, 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

886 
corecs, unfold_defs, corec_defs)), lthy) = 
49212  887 
let 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

888 
val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

889 

49484  890 
val discss = map (map (mk_disc_or_sel As) o #1) wrap_ress; 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

891 
val selsss = map (map (map (mk_disc_or_sel As)) o #2) wrap_ress; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

892 
val exhaust_thms = map #3 wrap_ress; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

893 
val disc_thmsss = map #7 wrap_ress; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

894 
val discIss = map #8 wrap_ress; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

895 
val sel_thmsss = map #9 wrap_ress; 
49438  896 

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

897 
val (((rs, us'), vs'), names_lthy) = 
49370  898 
lthy 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

899 
> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

900 
>> Variable.variant_fixes fp_b_names 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

901 
>> Variable.variant_fixes (map (suffix "'") fp_b_names); 
49370  902 

49498  903 
val us = map2 (curry Free) us' fpTs; 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

904 
val udiscss = map2 (map o rapp) us discss; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

905 
val uselsss = map2 (map o map o rapp) us selsss; 
49370  906 

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

907 
val vs = map2 (curry Free) vs' fpTs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

908 
val vdiscss = map2 (map o rapp) vs discss; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

909 
val vselsss = map2 (map o map o rapp) vs selsss; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

910 

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

911 
val ((coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)) = 
49337  912 
let 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

913 
val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

914 
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

915 
val strong_rs = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

916 
map4 (fn u => fn v => fn uvr => fn uv_eq => 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

917 
fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

918 

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

919 
fun build_rel rs' T = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

920 
(case find_index (curry (op =) T) fpTs of 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

921 
~1 => 
49683  922 
if exists_fp_subtype T then build_rel_step (build_rel rs') T else HOLogic.eq_const T 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

923 
 kk => nth rs' kk); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

924 

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

925 
fun build_rel_app rs' usel vsel = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

926 
fold rapp [usel, vsel] (build_rel rs' (fastype_of usel)); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

927 

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

928 
fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

929 
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

930 
(if null usels then 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

931 
[] 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

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

933 
[Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc], 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

934 
Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app rs') usels vsels))]); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

935 

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

936 
fun mk_prem_concl rs' n udiscs uselss vdiscs vselss = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

937 
Library.foldr1 HOLogic.mk_conj 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

938 
(flat (map5 (mk_prem_ctr_concls rs' n) (1 upto n) udiscs uselss vdiscs vselss)) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

939 
handle List.Empty => @{term True}; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

940 

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

941 
fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

942 
fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr, 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

943 
HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss))); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

944 

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

945 
val concl = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

946 
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

947 
(map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v))) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

948 
uvrs us vs)); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

949 

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

950 
fun mk_goal rs' = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

951 
Logic.list_implies (map8 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss, 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

952 
concl); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

953 

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

954 
val goal = mk_goal rs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

955 
val strong_goal = mk_goal strong_rs; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

956 

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

957 
fun prove dtor_coinduct' goal = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

958 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

959 
mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs dtor_ctors 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

960 
exhaust_thms ctr_defss disc_thmsss sel_thmsss) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

961 
> singleton (Proof_Context.export names_lthy lthy) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

962 
> Thm.close_derivation; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

963 

49590  964 
fun postproc nn thm = 
965 
Thm.permute_prems 0 nn 

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

966 
(if nn = 1 then thm RS mp 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

967 
else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

968 
> Drule.zero_var_indexes 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

969 
> `(conj_dests nn); 
49337  970 
in 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

971 
(postproc nn (prove fp_induct goal), postproc nn (prove fp_strong_induct strong_goal)) 
49337  972 
end; 
49212  973 

49484  974 
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; 
975 

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

976 
val gunfolds = map (lists_bmoc pgss) unfolds; 
49484  977 
val hcorecs = map (lists_bmoc phss) corecs; 
978 

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

979 
val (unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) = 
49212  980 
let 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

981 
fun mk_goal pfss c cps fcorec_like n k ctr m cfs' = 
49212  982 
fold_rev (fold_rev Logic.all) ([c] :: pfss) 
49484  983 
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

984 
mk_Trueprop_eq (fcorec_like $ c, Term.list_comb (ctr, take m cfs')))); 
49212  985 

49683  986 
fun build_corec_like fcorec_likes (T, U) = 
49234  987 
if T = U then 
49368  988 
id_const T 
49234  989 
else 
990 
(case find_index (curry (op =) U) fpTs of 

49683  991 
~1 => build_map (build_corec_like fcorec_likes) T U 
992 
 kk => nth fcorec_likes kk); 

993 

994 
val mk_U = typ_subst (map2 pair Cs fpTs); 

49233  995 

49683  996 
fun intr_corec_likes fcorec_likes [] [cf] = 
997 
let val T = fastype_of cf in 

998 
if exists_Cs_subtype T then build_corec_like fcorec_likes (T, mk_U T) $ cf else cf 

999 
end 

1000 
 intr_corec_likes fcorec_likes [cq] [cf, cf'] = 

1001 
mk_If cq (intr_corec_likes fcorec_likes [] [cf]) 

1002 
(intr_corec_likes fcorec_likes [] [cf']); 

1003 

1004 
val crgsss = map2 (map2 (map2 (intr_corec_likes gunfolds))) crssss cgssss; 

1005 
val cshsss = map2 (map2 (map2 (intr_corec_likes hcorecs))) csssss chssss; 

49212  1006 

49683  1007 
val unfold_goalss = 
1008 
map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss; 

1009 
val corec_goalss = 

1010 
map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss; 

1011 

1012 
fun mk_map_if_distrib bnf = 

1013 
let 

1014 
val mapx = map_of_bnf bnf; 

1015 
val live = live_of_bnf bnf; 

1016 
val ((Ts, T), U) = strip_typeN (live + 1) (fastype_of mapx) >> split_last; 

1017 
val fs = Variable.variant_frees lthy [mapx] (map (pair "f") Ts); 

1018 
val t = Term.list_comb (mapx, map (Var o apfst (rpair 0)) fs); 

1019 
in 

1020 
Drule.instantiate' (map (SOME o certifyT lthy) [U, T]) [SOME (certify lthy t)] 

1021 
@{thm if_distrib} 

49276  1022 
end; 
49232
9ea11f0c53e4
fixed and enabled generation of "coiters" theorems, including the recursive case
blanchet
parents:
49230
diff
changeset

1023 

49683  1024 
val nested_map_if_distribs = map mk_map_if_distrib nested_bnfs; 
49213  1025 

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

1026 
val unfold_tacss = 
49683  1027 
map3 (map oo mk_corec_like_tac unfold_defs [] [] nesting_map_ids'' []) 
1028 
fp_fold_thms pre_map_defs ctr_defss; 

49233  1029 
val corec_tacss = 
49683  1030 
map3 (map oo mk_corec_like_tac corec_defs nested_map_comps'' nested_map_comp's 
1031 
(nested_map_ids'' @ nesting_map_ids'') nested_map_if_distribs) 

1032 
fp_rec_thms pre_map_defs ctr_defss; 

49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1033 

49484  1034 
fun prove goal tac = 
1035 
Skip_Proof.prove lthy [] [] goal (tac o #context) > Thm.close_derivation; 

1036 

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

1037 
val unfold_thmss = map2 (map2 prove) unfold_goalss unfold_tacss; 
49683  1038 
val corec_thmss = map2 (map2 prove) corec_goalss corec_tacss; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1039 

504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1040 
val filter_safesss = 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1041 
map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo 
49683  1042 
curry (op ~~)) (map2 (map2 (map2 (member (op =)))) cgssss crgsss); 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1043 

49683  1044 
val safe_unfold_thmss = filter_safesss unfold_thmss; 
1045 
val safe_corec_thmss = filter_safesss corec_thmss; 

49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

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

1047 
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) 
49212  1048 
end; 
1049 

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

1050 
val (disc_unfold_iff_thmss, disc_corec_iff_thmss) = 
49482  1051 
let 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1052 
fun mk_goal c cps fcorec_like n k disc = 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1053 
mk_Trueprop_eq (disc $ (fcorec_like $ c), 
49484  1054 
if n = 1 then @{const True} 
1055 
else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps)); 

1056 

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

1057 
val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss; 
49484  1058 
val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; 
1059 

1060 
fun mk_case_split' cp = 

1061 
Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split}; 

1062 

1063 
val case_splitss' = map (map mk_case_split') cpss; 

49482  1064 

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

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

1066 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' unfold_thmss disc_thmsss; 
49484  1067 
val corec_tacss = 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1068 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss; 
49484  1069 

1070 
fun prove goal tac = 

1071 
Skip_Proof.prove lthy [] [] goal (tac o #context) 

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

1072 
> singleton (Proof_Context.export names_lthy0 no_defs_lthy) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1073 
> Thm.close_derivation; 
49484  1074 

1075 
fun proves [_] [_] = [] 

1076 
 proves goals tacs = map2 prove goals tacs; 

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

1078 
(map2 proves unfold_goalss unfold_tacss, 
49484  1079 
map2 proves corec_goalss corec_tacss) 
49482  1080 
end; 
1081 

49605
ea566f5e1724
avoid another brand of trivial "disc_rel" theorems (which made the simplifier loop for all singleconstructor types)
blanchet
parents:
49595
diff
changeset

1082 
val is_triv_discI = is_triv_implies orf is_concl_refl; 
ea566f5e1724
avoid another brand of trivial "disc_rel" theorems (which made the simplifier loop for all singleconstructor types)
blanchet
parents:
49595
diff
changeset

1083 

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

1084 
fun mk_disc_corec_like_thms corec_likes discIs = 
49605
ea566f5e1724
avoid another brand of trivial "disc_rel" theorems (which made the simplifier loop for all singleconstructor types)
blanchet
parents:
49595
diff
changeset

1085 
map (op RS) (filter_out (is_triv_discI o snd) (corec_likes ~~ discIs)); 
49266  1086 

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

1087 
val disc_unfold_thmss = map2 mk_disc_corec_like_thms unfold_thmss discIss; 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1088 
val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss; 
49266  1089 

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

1090 
fun mk_sel_corec_like_thm corec_like_thm sel sel_thm = 
49266  1091 
let 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1092 
val (domT, ranT) = dest_funT (fastype_of sel); 
49266  1093 
val arg_cong' = 
1094 
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) 

49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1095 
[NONE, NONE, SOME (certify lthy sel)] arg_cong 
49267
c96a07255e10
correctly generate sel_coiter and sel_corec theorems
blanchet
parents:
49266
diff
changeset

1096 
> Thm.varifyT_global; 
49266  1097 
val sel_thm' = sel_thm RSN (2, trans); 
1098 
in 

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

1099 
corec_like_thm RS arg_cong' RS sel_thm' 
49266  1100 
end; 
1101 

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

1102 
fun mk_sel_corec_like_thms corec_likess = 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1103 
map3 (map3 (map2 o mk_sel_corec_like_thm)) corec_likess selsss sel_thmsss > map flat; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1104 

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

1105 
val sel_unfold_thmss = mk_sel_corec_like_thms unfold_thmss; 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1106 
val sel_corec_thmss = mk_sel_corec_like_thms corec_thmss; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1107 

49587  1108 
fun flat_corec_like_thms corec_likes disc_corec_likes sel_corec_likes = 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1109 
corec_likes @ disc_corec_likes @ sel_corec_likes; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1110 

504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1111 
val simp_thmss = 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1112 
mk_simp_thmss wrap_ress 
49587  1113 
(map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss) 
1114 
(map3 flat_corec_like_thms safe_unfold_thmss disc_unfold_thmss sel_unfold_thmss); 

49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1115 

504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

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

1117 
[(flat safe_unfold_thmss @ flat safe_corec_thmss, simp_attrs)] 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1118 
> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); 
49266  1119 

49342  1120 
val common_notes = 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1121 
(if nn > 1 then 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1122 
(* FIXME: attribs *) 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1123 
[(coinductN, [coinduct_thm], []), 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1124 
(strong_coinductN, [strong_coinduct_thm], [])] 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

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

1126 
[]) 
49342  1127 
> map (fn (thmN, thms, attrs) => 
49633  1128 
((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 
49342  1129 

49212  1130 
val notes = 
49342  1131 
[(coinductN, map single coinduct_thms, []), (* FIXME: attribs *) 
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1132 
(corecN, corec_thmss, []), 
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1133 
(disc_corecN, disc_corec_thmss, simp_attrs), 
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1134 
(disc_corec_iffN, disc_corec_iff_thmss, simp_attrs), 
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1135 
(disc_unfoldN, disc_unfold_thmss, simp_attrs), 
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1136 
(disc_unfold_iffN, disc_unfold_iff_thmss, simp_attrs), 
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1137 
(sel_corecN, sel_corec_thmss, simp_attrs), 
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1138 
(sel_unfoldN, sel_unfold_thmss, simp_attrs), 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1139 
(simpsN, simp_thmss, []), 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

1140 
(strong_coinductN, map single strong_coinduct_thms, []), (* FIXME: attribs *) 
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49593
diff
changeset

1141 
(unfoldN, unfold_thmss, [])] 
49300  1142 
> maps (fn (thmN, thmss, attrs) => 
49633  1143 
map_filter (fn (_, []) => NONE  (fp_b_name, thms) => 
1144 
SOME ((qualify true fp_b_name (Binding.name thmN), attrs), 

1145 
[(thms, [])])) (fp_b_names ~~ thmss)); 

49212  1146 
in 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1147 
lthy > Local_Theory.notes (anonymous_notes @ common_notes @ notes) > snd 
49212  1148 
end; 
1149 

49204  1150 
val lthy' = lthy 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1151 
> fold_map define_ctrs_case_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ Cs ~~ ctors ~~ dtors ~~ 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1152 
fp_folds ~~ fp_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~ 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1153 
pre_set_defss ~~ pre_rel_defs ~~ fp_map_thms ~~ fp_set_thmss ~~ fp_rel_thms ~~ ns ~~ kss ~~ 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1154 
mss ~~ ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

1157 
> (if lfp then derive_induct_fold_rec_thms_for_types 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1158 
else derive_coinduct_unfold_corec_thms_for_types); 
49167  1159 

1160 
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ 

49208  1161 
(if lfp then "" else "co") ^ "datatype")); 
49112  1162 
in 
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

1163 
timer; lthy' 
49112  1164 
end; 
1165 
