author  blanchet 
Fri, 28 Sep 2012 09:12:50 +0200  
changeset 49636  b7256a88a84b 
parent 49633  src/HOL/BNF/Tools/bnf_fp_sugar.ML@5b5450bc544c 
child 49670  c7a034d01936 
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 

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

49 
fun split_list4 xs = (map #1 xs, map #2 xs, map #3 xs, map #4 xs); 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

50 

49342  51 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
52 

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

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

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

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

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

57 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  58 

49583  59 
fun variant_types ss Ss ctxt = 
60 
let 

61 
val (tfrees, _) = 

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

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

64 
in (tfrees, ctxt') end; 

65 

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

67 

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

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

70 
fun mk_uncurried2_fun f xss = 
49200  71 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); 
72 

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

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

74 
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

75 

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

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

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

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

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

80 
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

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

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

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

84 

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

87 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

88 
end; 

89 

90 
val mk_ctor = mk_ctor_or_dtor range_type; 

91 
val mk_dtor = mk_ctor_or_dtor domain_type; 

92 

93 
fun mk_rec_like lfp Ts Us t = 

94 
let 

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

96 
val (f_Us, prebody) = split_last bindings; 

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

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

99 
in 

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

101 
end; 

102 

103 
fun mk_map live Ts Us t = 

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

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

106 
end; 

107 

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

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

109 
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

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

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

112 

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

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

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

115 
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

116 
 _ => replicate n false); 
49536  117 

49498  118 
fun tick u f = Term.lambda u (HOLogic.mk_prod (u, f $ u)); 
49233  119 

49498  120 
fun tack z_name (c, u) f = 
121 
let val z = Free (z_name, mk_sumT (fastype_of u, fastype_of c)) in 

122 
Term.lambda z (mk_sum_case (Term.lambda u u, Term.lambda c (f $ c)) $ z) 

49273
f839ce127a2e
reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets etareduced
blanchet
parents:
49268
diff
changeset

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

124 

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

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

127 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  128 

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

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

130 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  131 

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

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

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

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

135 

49121  136 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
49336  137 
fun type_binding_of (((_, b), _), _) = b; 
49181  138 
fun mixfix_of ((_, mx), _) = mx; 
49121  139 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  140 

49286  141 
fun disc_of ((((disc, _), _), _), _) = disc; 
142 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  145 
fun ctr_mixfix_of (_, mx) = mx; 
49119  146 

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

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

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

152 

49286  153 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  154 
else (); 
155 

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

158 

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

160 
val fp_bs = map type_binding_of specs; 
49498  161 
val fp_b_names = map Binding.name_of fp_bs; 
162 
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

163 

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

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

165 
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

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

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

168 

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

169 
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

170 
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

171 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
49119  172 

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

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

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

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

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

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

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

179 
variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS); 
49119  180 

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

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

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

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

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

185 
Theory.copy #> fold (fn spec => perhaps (try (Sign.add_type no_defs_lthy 
49336  186 
(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

187 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  188 

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

189 
fun mk_fake_T b = 
49121  190 
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

191 
unsorted_As); 
49121  192 

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

193 
val fake_Ts = map mk_fake_T fp_bs; 
49121  194 

49181  195 
val mixfixes = map mixfix_of specs; 
49119  196 

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

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

49121  200 
val ctr_specss = map ctr_specs_of specs; 
49119  201 

49336  202 
val disc_bindingss = map (map disc_of) ctr_specss; 
203 
val ctr_bindingss = 

49633  204 
map2 (fn fp_b_name => map (qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  205 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  206 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  207 

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

209 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  210 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
211 

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

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

213 
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

214 

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

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

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

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

218 

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

219 
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

220 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  221 
[] => () 
49342  222 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  223 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  224 

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

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

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

228 
 eq_fpT_check _ _ = false; 
49146  229 

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

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

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

233 
 kk => nth Xs kk) 
49204  234 
 freeze_fp T = T; 
49121  235 

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

49119  238 

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

239 
val fp_eqs = 
49536  240 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  241 

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

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

243 
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

244 
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

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

246 
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

247 

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

248 
val timer = time (Timer.startRealTimer ()); 
49121  249 

49363  250 
fun add_nesty_bnf_names Us = 
49226  251 
let 
252 
fun add (Type (s, Ts)) ss = 

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

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

255 
end 

49363  256 
 add T ss = (member (op =) Us T, ss); 
49226  257 
in snd oo add end; 
258 

49363  259 
fun nesty_bnfs Us = 
49536  260 
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); 
49363  261 

262 
val nesting_bnfs = nesty_bnfs As; 

49536  263 
val nested_bnfs = nesty_bnfs Xs; 
49226  264 

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

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

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

267 
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

268 
val nested_set_natural's = maps set_natural'_of_bnf nested_bnfs; 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

269 
val nesting_map_ids = map map_id_of_bnf nesting_bnfs; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

270 
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

271 

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

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

273 

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

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

275 
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

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

277 

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

278 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  279 

49501  280 
val ctors = map (mk_ctor As) ctors0; 
281 
val dtors = map (mk_dtor As) dtors0; 

49124  282 

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

284 

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

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

286 

49536  287 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  288 
val ns = map length ctr_Tsss; 
49212  289 
val kss = map (fn n => 1 upto n) ns; 
49203  290 
val mss = map (map length) ctr_Tsss; 
291 
val Css = map2 replicate ns Cs; 

292 

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

293 
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

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

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

296 
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

297 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec))); 
49204  298 

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

299 
val (((fold_only as (gss, _, _), rec_only as (hss, _, _)), 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

300 
(zs, cs, cpss, unfold_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))), 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

301 
names_lthy0) = 
49208  302 
if lfp then 
303 
let 

304 
val y_Tsss = 

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

305 
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

306 
ns mss fp_fold_fun_Ts; 
49208  307 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
308 

49484  309 
val ((gss, ysss), lthy) = 
49208  310 
lthy 
311 
> mk_Freess "f" g_Tss 

312 
>> mk_Freesss "x" y_Tsss; 

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

313 
val yssss = map (map (map single)) ysss; 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

314 

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

315 
fun dest_rec_prodT (T as Type (@{type_name prod}, Us as [_, U])) = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

316 
if member (op =) Cs U then Us else [T] 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

317 
 dest_rec_prodT T = [T]; 
49204  318 

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

320 
map3 (fn n => fn ms => map2 (map dest_rec_prodT oo dest_tupleT) ms o 
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

321 
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; 
49208  322 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  323 

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

324 
val hss = map2 (map2 retype_free) h_Tss gss; 
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

325 
val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss; 
49484  326 
val (zssss_tl, lthy) = 
49208  327 
lthy 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

328 
> mk_Freessss "y" (map (map (map tl)) z_Tssss); 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

329 
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; 
49210  330 
in 
49484  331 
((((gss, g_Tss, yssss), (hss, h_Tss, zssss)), 
332 
([], [], [], (([], []), ([], [])), (([], []), ([], [])))), lthy) 

49210  333 
end 
49208  334 
else 
49210  335 
let 
49221
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

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

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

338 

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

49587  341 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
49211  342 

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

345 
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

346 

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

347 
fun mk_types maybe_dest_sumT fun_Ts = 
49212  348 
let 
349 
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

350 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49275  351 
val f_Tssss = 
352 
map3 (fn C => map2 (map (map (curry (op >) C) o maybe_dest_sumT) oo dest_tupleT)) 

353 
Cs mss' f_prod_Tss; 

354 
val q_Tssss = 

49463  355 
map (map (map (fn [_] => []  [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; 
49587  356 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
49275  357 
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; 
49176  358 

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

359 
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts; 
49211  360 

49484  361 
val ((((Free (z, _), cs), pss), gssss), lthy) = 
49210  362 
lthy 
49233  363 
> yield_singleton (mk_Frees "z") dummyT 
364 
>> mk_Frees "a" Cs 

49211  365 
>> mk_Freess "p" p_Tss 
49275  366 
>> mk_Freessss "g" g_Tssss; 
367 
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

368 

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

369 
fun dest_corec_sumT (T as Type (@{type_name sum}, Us as [_, U])) = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

370 
if member (op =) Cs U then Us else [T] 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

371 
 dest_corec_sumT T = [T]; 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

372 

49275  373 
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; 
49210  374 

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

375 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 
49484  376 
val ((sssss, hssss_tl), lthy) = 
49275  377 
lthy 
378 
> mk_Freessss "q" s_Tssss 

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

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

49211  381 

49212  382 
val cpss = map2 (fn c => map (fn p => p $ c)) cs pss; 
383 

49276  384 
fun mk_preds_getters_join [] [cf] = cf 
385 
 mk_preds_getters_join [cq] [cf, cf'] = 

386 
mk_If cq (mk_Inl (fastype_of cf') cf) (mk_Inr (fastype_of cf) cf'); 

387 

49275  388 
fun mk_terms qssss fssss = 
49212  389 
let 
49587  390 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 
49275  391 
val cqssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs qssss; 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

392 
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; 
49276  393 
val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss; 
394 
in (pfss, cqfsss) end; 

49210  395 
in 
49484  396 
(((([], [], []), ([], [], [])), 
397 
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), 

398 
(mk_terms sssss hssss, (h_sum_prod_Ts, ph_Tss)))), lthy) 

49210  399 
end; 
400 

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

401 
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

402 
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

403 
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

404 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  405 
let 
49498  406 
val fp_b_name = Binding.name_of fp_b; 
407 

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

410 
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

411 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  412 

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

418 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  419 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  420 

49498  421 
val u = Free (u', fpT); 
49121  422 

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

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

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

425 

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

427 
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

428 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  429 

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

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

432 
val case_rhs = 
49498  433 
fold_rev Term.lambda (fs @ [u]) 
49501  434 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); 
49129  435 

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

438 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  439 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  440 
> `Local_Theory.restore; 
441 

442 
val phi = Proof_Context.export_morphism lthy lthy'; 

443 

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

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

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

446 
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

447 
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

448 

49203  449 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
450 
val casex0 = Morphism.term phi raw_case; 

451 

452 
val ctrs = map (mk_ctr As) ctrs0; 

49121  453 

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

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

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

456 
fun exhaust_tac {context = ctxt, ...} = 
49135  457 
let 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

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

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

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

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

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

465 
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

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

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

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

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

470 

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

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

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

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

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

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

477 
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' 
49135  478 
end; 
479 

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

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

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

482 
mk_inject_tac ctxt ctr_def ctor_inject]) ms ctr_defs; 
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 half_distinct_tacss = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

486 
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

487 

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

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

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

490 
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

491 

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

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

493 

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

494 
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

495 
in 
49633  496 
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

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

498 
end; 
49121  499 

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

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

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

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

503 
val nones = replicate live NONE; 
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 ctor_cong = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

507 
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

508 

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

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

510 
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

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

512 

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

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

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

515 

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

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

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

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

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

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

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

523 

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

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

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

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

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

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

530 

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

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

532 

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

533 
val map_thms = map3 mk_map_thm ctr_defs' xss cxIns; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

534 
val set_thmss = map mk_set_thms fp_set_thms; 
49127  535 

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

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

537 

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

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

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

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

542 
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) 
49593  543 
> postproc 
544 
> singleton (Proof_Context.export names_lthy no_defs_lthy); 

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

545 

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

546 
fun mk_rel_inject_thm (((ctr_def', xs), cxIn), ((_, ys), cyIn)) = 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

547 
mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] xs cxIn ys cyIn; 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

548 

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

549 
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

550 

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

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

552 
mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def'] 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

553 
xs cxIn ys cyIn; 
49121  554 

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

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

556 
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

557 

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

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

559 
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

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

561 
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

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

563 
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

564 

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

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

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

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

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

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

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

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

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

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

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

576 

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

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

578 
let 
49208  579 
val fpT_to_C = fpT > C; 
49199  580 

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

581 
fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xssss)) = 
49215  582 
let 
583 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 

49633  584 
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); 
49215  585 
val spec = 
49336  586 
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

587 
Term.list_comb (fp_rec_like, 
49255
2ecc533d6697
use balanced sums for constructors (to gracefully handle 100 constructors or more)
blanchet
parents:
49254
diff
changeset

588 
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); 
49336  589 
in (binding, spec) end; 
49199  590 

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

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

592 
[(foldN, fp_fold, fold_only), 
49215  593 
(recN, fp_rec, rec_only)]; 
594 

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

595 
val (bindings, specs) = map generate_rec_like rec_like_infos > split_list; 
49215  596 

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

49201  598 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  599 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49336  600 
#>> apsnd snd) bindings specs 
49199  601 
> `Local_Theory.restore; 
49201  602 

603 
val phi = Proof_Context.export_morphism lthy lthy'; 

604 

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

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

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

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

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

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

611 

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

612 
fun define_unfold_corec no_defs_lthy = 
49210  613 
let 
614 
val B_to_fpT = C > fpT; 

49211  615 

49276  616 
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = 
617 
Term.lambda c (mk_IfN sum_prod_T cps 

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

49275  619 

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

620 
fun generate_corec_like (suf, fp_rec_like, ((pfss, cqfsss), (f_sum_prod_Ts, 
49274
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

621 
pf_Tss))) = 
49211  622 
let 
623 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

49633  624 
val binding = qualify false fp_b_name (Binding.suffix_name ("_" ^ suf) fp_b); 
49211  625 
val spec = 
49336  626 
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

627 
Term.list_comb (fp_rec_like, 
49276  628 
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); 
49336  629 
in (binding, spec) end; 
49210  630 

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

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

632 
[(unfoldN, fp_fold, unfold_only), 
49215  633 
(corecN, fp_rec, corec_only)]; 
49212  634 

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

635 
val (bindings, specs) = map generate_corec_like corec_like_infos > split_list; 
49211  636 

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

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

49336  640 
#>> apsnd snd) bindings specs 
49210  641 
> `Local_Theory.restore; 
642 

643 
val phi = Proof_Context.export_morphism lthy lthy'; 

644 

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

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

49536  647 
val [unfold, corec] = map (mk_rec_like lfp As Cs o Morphism.term phi) csts; 
49210  648 
in 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

651 

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

652 
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

653 

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

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

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

657 
(wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy') 
49119  658 
end; 
49167  659 

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

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

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

662 
>> apsnd split_list4 o apfst split_list4 o split_list; 
49226  663 

49437  664 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
49234  665 
let 
49392  666 
val bnf = the (bnf_of lthy s); 
49393  667 
val live = live_of_bnf bnf; 
668 
val mapx = mk_map live Ts Us (map_of_bnf bnf); 

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

669 
val TUs' = map dest_funT (fst (strip_typeN live (fastype_of mapx))); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

670 
in Term.list_comb (mapx, map build_arg TUs') end; 
49234  671 

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

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

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

674 
map3 (fn (_, _, _, injects, distincts, cases, _, _, _) => fn rec_likes => fn fold_likes => 
49505  675 
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

676 

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

677 
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

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

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

680 
val (((ps, ps'), us'), names_lthy) = 
49370  681 
lthy 
49463  682 
> mk_Frees' "P" (map mk_pred1T fpTs) 
49498  683 
>> Variable.variant_fixes fp_b_names; 
49370  684 

49498  685 
val us = map2 (curry Free) us' fpTs; 
49370  686 

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

687 
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

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

689 
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

690 
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

691 
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

692 
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

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

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

695 
 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

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

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

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

699 

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

700 
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

701 

49337  702 
val (induct_thms, induct_thm) = 
703 
let 

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

704 
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

705 
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

706 
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

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

708 

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

709 
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

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

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

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

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

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

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

716 
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

717 
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

718 
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

719 
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

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

721 
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

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

723 
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

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

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

726 
 mk_raw_prem_prems _ _ = []; 
49342  727 

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

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

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

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

731 

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

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

733 
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

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

735 
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

736 

49372  737 
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

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

739 
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

740 
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

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

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

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

744 
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); 
49368  745 

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

746 
val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss; 
49389  747 

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

748 
val goal = 
49372  749 
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

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

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

752 
val kksss = map (map (map (fst o snd) o #2)) raw_premss; 
49368  753 

49501  754 
val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); 
49342  755 

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

756 
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

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

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

763 
`(conj_dests nn) thm 
49337  764 
end; 
49201  765 

49622  766 
val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss); 
49437  767 

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

768 
val (fold_thmss, rec_thmss) = 
49207  769 
let 
49337  770 
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

771 
val gfolds = map (lists_bmoc gss) folds; 
49337  772 
val hrecs = map (lists_bmoc hss) recs; 
773 

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

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

776 
(mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs))); 
49204  777 

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

778 
fun build_rec_like frec_likes maybe_tick (T, U) = 
49234  779 
if T = U then 
49368  780 
id_const T 
49234  781 
else 
782 
(case find_index (curry (op =) T) fpTs of 

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

783 
~1 => build_map (build_rec_like frec_likes maybe_tick) T U 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

784 
 kk => maybe_tick (nth us kk) (nth frec_likes kk)); 
49233  785 

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

786 
fun mk_U maybe_mk_prodT = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

787 
typ_subst (map2 (fn fpT => fn C => (fpT, maybe_mk_prodT fpT C)) fpTs Cs); 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

788 

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

789 
fun intr_rec_likes frec_likes maybe_cons maybe_tick maybe_mk_prodT (x as Free (_, T)) = 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

790 
if member (op =) fpTs T then 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

791 
maybe_cons x [build_rec_like frec_likes (K I) (T, mk_U (K I) T) $ x] 
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset

792 
else if exists_fp_subtype T then 
49591
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

793 
[build_rec_like frec_likes maybe_tick (T, mk_U maybe_mk_prodT T) $ x] 
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset

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

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

796 

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

797 
val gxsss = map (map (maps (intr_rec_likes gfolds (K I) (K I) (K I)))) xsss; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

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

799 
map (map (maps (intr_rec_likes hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 
49204  800 

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

801 
val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss; 
49484  802 
val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss; 
49204  803 

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

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

805 
map2 (map o mk_rec_like_tac pre_map_defs nesting_map_ids fold_defs) fp_fold_thms 
49363  806 
ctr_defss; 
49203  807 
val rec_tacss = 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

808 
map2 (map o mk_rec_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms 
49363  809 
ctr_defss; 
49484  810 

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

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

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

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

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

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

816 
end; 
49201  817 

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

818 
val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss; 
49438  819 

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

822 

49337  823 
val common_notes = 
49437  824 
(if nn > 1 then [(inductN, [induct_thm], [induct_case_names_attr])] else []) 
49337  825 
> map (fn (thmN, thms, attrs) => 
49633  826 
((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 
49337  827 

49226  828 
val notes = 
49633  829 
[(foldN, fold_thmss, K code_simp_attrs), 
830 
(inductN, map single induct_thms, 

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

833 
(simpsN, simp_thmss, K [])] 
49300  834 
> maps (fn (thmN, thmss, attrs) => 
49633  835 
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => 
836 
((qualify true fp_b_name (Binding.name thmN), attrs T_name), 

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

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

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

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

841 

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

842 
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

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

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

846 

49484  847 
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

848 
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

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

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

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

852 
val sel_thmsss = map #9 wrap_ress; 
49438  853 

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

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

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

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

858 
>> Variable.variant_fixes (map (suffix "'") fp_b_names); 
49370  859 

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

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

862 
val uselsss = map2 (map o map o rapp) us selsss; 
49370  863 

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

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

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

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

867 

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

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

870 
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

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

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

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

874 
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

875 

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

876 
fun build_rel_step build_arg (Type (s, Ts)) = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

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

878 
val bnf = the (bnf_of lthy s); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

879 
val live = live_of_bnf bnf; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

880 
val rel = mk_rel live Ts Ts (rel_of_bnf bnf); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

881 
val Ts' = map domain_type (fst (strip_typeN live (fastype_of rel))); 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

882 
in Term.list_comb (rel, map build_arg Ts') end; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

883 

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

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

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

886 
~1 => 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

887 
if exists_fp_subtype T then build_rel_step (build_rel rs') T 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

888 
else HOLogic.eq_const T 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

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

890 

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

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

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

893 

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

894 
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

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

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

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

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

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

900 
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

901 

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

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

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

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

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

906 

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

907 
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

908 
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

909 
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

910 

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

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

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

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

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

915 

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

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

917 
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

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

919 

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

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

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

922 

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

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

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

925 
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

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

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

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

929 

49590  930 
fun postproc nn thm = 
931 
Thm.permute_prems 0 nn 

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

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

933 
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

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

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

937 
(postproc nn (prove fp_induct goal), postproc nn (prove fp_strong_induct strong_goal)) 
49337  938 
end; 
49212  939 

49484  940 
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; 
941 

942 
val z = the_single zs; 

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

943 
val gunfolds = map (lists_bmoc pgss) unfolds; 
49484  944 
val hcorecs = map (lists_bmoc phss) corecs; 
945 

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

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

948 
fun mk_goal pfss c cps fcorec_like n k ctr m cfs' = 
49212  949 
fold_rev (fold_rev Logic.all) ([c] :: pfss) 
49484  950 
(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

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

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

953 
fun build_corec_like fcorec_likes maybe_tack (T, U) = 
49234  954 
if T = U then 
49368  955 
id_const T 
49234  956 
else 
957 
(case find_index (curry (op =) U) fpTs of 

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

958 
~1 => build_map (build_corec_like fcorec_likes maybe_tack) T U 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

959 
 kk => maybe_tack (nth cs kk, nth us kk) (nth fcorec_likes kk)); 
49233  960 

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

961 
fun mk_U maybe_mk_sumT = 
ddd606ec45b9
first step towards splitting corecursor function arguments into (p, g, h) triples
blanchet
parents:
49273
diff
changeset

962 
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); 
49212  963 

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

964 
fun intr_corec_likes fcorec_likes maybe_mk_sumT maybe_tack cqf = 
49276  965 
let val T = fastype_of cqf in 
966 
if exists_subtype (member (op =) Cs) T then 

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

967 
build_corec_like fcorec_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf 
49276  968 
else 
969 
cqf 

970 
end; 

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

971 

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

972 
val crgsss' = map (map (map (intr_corec_likes gunfolds (K I) (K I)))) crgsss; 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

973 
val cshsss' = 
91b228e26348
generate highlevel "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset

974 
map (map (map (intr_corec_likes hcorecs (curry mk_sumT) (tack z)))) cshsss; 
49212  975 

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

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

977 
map8 (map4 oooo mk_goal pgss) cs cpss gunfolds ns kss ctrss mss crgsss'; 
49484  978 
val corec_goalss = 
979 
map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss'; 

49213  980 

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

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

982 
map3 (map oo mk_corec_like_tac unfold_defs nesting_map_ids) fp_fold_thms pre_map_defs 
49226  983 
ctr_defss; 
49233  984 
val corec_tacss = 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

985 
map3 (map oo mk_corec_like_tac corec_defs nesting_map_ids) fp_rec_thms pre_map_defs 
49233  986 
ctr_defss; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

987 

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

990 

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

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

992 
val corec_thmss = 
49484  993 
map2 (map2 prove) corec_goalss corec_tacss 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

994 
> map (map (unfold_thms lthy @{thms sum_case_if})); 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

995 

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

996 
val unfold_safesss = map2 (map2 (map2 (curry (op =)))) crgsss' crgsss; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

997 
val corec_safesss = map2 (map2 (map2 (curry (op =)))) cshsss' cshsss; 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

998 

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

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

1000 
map2 (map_filter (fn (safes, thm) => if forall I safes then SOME thm else NONE) oo 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1001 
curry (op ~~)); 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1002 

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

1003 
val safe_unfold_thmss = filter_safesss unfold_safesss unfold_thmss; 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

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

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

1006 
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) 
49212  1007 
end; 
1008 

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

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

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

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

1015 

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

1016 
val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss; 
49484  1017 
val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; 
1018 

1019 
fun mk_case_split' cp = 

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

1021 

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

49482  1023 

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

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

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

1027 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss; 
49484  1028 

1029 
fun prove goal tac = 

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

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

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

1032 
> Thm.close_derivation; 
49484  1033 

1034 
fun proves [_] [_] = [] 

1035 
 proves goals tacs = map2 prove goals tacs; 

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

1037 
(map2 proves unfold_goalss unfold_tacss, 
49484  1038 
map2 proves corec_goalss corec_tacss) 
49482  1039 
end; 
1040 

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

1041 
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

1042 

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

1043 
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

1044 
map (op RS) (filter_out (is_triv_discI o snd) (corec_likes ~~ discIs)); 
49266  1045 

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

1046 
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

1047 
val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss; 
49266  1048 

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

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

1051 
val (domT, ranT) = dest_funT (fastype_of sel); 
49266  1052 
val arg_cong' = 
1053 
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

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

1055 
> Thm.varifyT_global; 
49266  1056 
val sel_thm' = sel_thm RSN (2, trans); 
1057 
in 

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

1058 
corec_like_thm RS arg_cong' RS sel_thm' 
49266  1059 
end; 
1060 

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

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

1062 
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

1063 

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

1064 
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

1065 
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

1066 

49587  1067 
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

1068 
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

1069 

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

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

1071 
mk_simp_thmss wrap_ress 
49587  1072 
(map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss) 
1073 
(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

1074 

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

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

1076 
[(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

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

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

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

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

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

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

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

1085 
[]) 
49342  1086 
> map (fn (thmN, thms, attrs) => 
49633  1087 
((qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 
49342  1088 

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

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

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

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

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

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

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

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

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

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

1100 
(unfoldN, unfold_thmss, [])] 
49300  1101 
> maps (fn (thmN, thmss, attrs) => 
49633  1102 
map_filter (fn (_, []) => NONE  (fp_b_name, thms) => 
1103 
SOME ((qualify true fp_b_name (Binding.name thmN), attrs), 

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

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

1106 
lthy > Local_Theory.notes (anonymous_notes @ common_notes @ notes) > snd 
49212  1107 
end; 
1108 

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

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

1111 
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

1112 
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

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

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

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

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

1117 
else derive_coinduct_unfold_corec_thms_for_types); 
49167  1118 

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

49208  1120 
(if lfp then "" else "co") ^ "datatype")); 
49112  1121 
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

1122 
timer; lthy' 
49112  1123 
end; 
1124 

49536  1125 
val datatypes = define_datatypes (K I) (K I) (K I); 
49297  1126 

49536  1127 
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; 
49119  1128 

49112  1129 
val parse_ctr_arg = 
49329
82452dc63ed5
desambiguate grammar (e.g. for Nil's mixfix ("[]"))
blanchet
parents:
49311
diff
changeset

1130 
@{keyword "("}  parse_binding_colon  Parse.typ  @{keyword ")"}  
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49429
diff
changeset

1131 
(Parse.typ >> pair Binding.empty); 
49112  1132 

49286  1133 
val parse_defaults = 
1134 
@{keyword "("}  @{keyword "defaults"}  Scan.repeat parse_bound_term  @{keyword ")"}; 

1135 

49112  1136 
val parse_single_spec = 
1137 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

49119  1138 
(@{keyword "="}  Parse.enum1 "" (parse_opt_binding_colon  Parse.binding  
49286  1139 
Scan.repeat parse_ctr_arg  Scan.optional parse_defaults []  Parse.opt_mixfix)); 
49112  1140 

49278  1141 
val parse_datatype = parse_wrap_options  Parse.and_list1 parse_single_spec; 
1142 

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

1143 
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp; 
49112  1144 

1145 
end; 