author  blanchet 
Wed, 26 Sep 2012 10:00:59 +0200  
changeset 49591  91b228e26348 
parent 49590  43e2d0e10876 
child 49592  b859a02c1150 
permissions  rwrr 
49509
163914705f8d
renamed toplevel theory from "Codatatype" to "BNF"
blanchet
parents:
49505
diff
changeset

1 
(* Title: HOL/BNF/Tools/bnf_fp_sugar.ML 
49112  2 
Author: Jasmin Blanchette, TU Muenchen 
3 
Copyright 2012 

4 

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

8 
signature BNF_FP_SUGAR = 

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) > 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

13 
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 

22 
structure BNF_FP_Sugar : BNF_FP_SUGAR = 

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 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

29 
open BNF_FP_Sugar_Tactics 
49119  30 

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

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

32 

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

34 
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; 
49300  35 

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

36 
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

37 

49342  38 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
39 

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

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

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

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

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

44 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  45 

49583  46 
fun variant_types ss Ss ctxt = 
47 
let 

48 
val (tfrees, _) = 

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

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

51 
in (tfrees, ctxt') end; 

52 

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

54 

49200  55 
fun mk_tupled_fun x f xs = HOLogic.tupled_lambda x (Term.list_comb (f, xs)); 
56 
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

57 
fun mk_uncurried2_fun f xss = 
49200  58 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); 
59 

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

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

61 
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

62 

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

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

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

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

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

67 
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

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

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

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

71 

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

74 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

75 
end; 

76 

77 
val mk_ctor = mk_ctor_or_dtor range_type; 

78 
val mk_dtor = mk_ctor_or_dtor domain_type; 

79 

80 
fun mk_rec_like lfp Ts Us t = 

81 
let 

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

83 
val (f_Us, prebody) = split_last bindings; 

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

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

86 
in 

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

88 
end; 

89 

90 
fun mk_map live Ts Us t = 

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

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

93 
end; 

94 

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

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

96 
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

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

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

99 

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

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

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

102 
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

103 
 _ => replicate n false); 
49536  104 

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

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

109 
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

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

111 

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

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

114 
fun merge_type_arg T T' = if T = T' then T else cannot_merge_types (); 
49119  115 

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

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

117 
if length As = length As' then map2 merge_type_arg As As' else cannot_merge_types (); 
49119  118 

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

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

120 
op aconv (Logic.dest_implies (Thm.prop_of thm)) 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

121 
handle TERM _ => false; 
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

122 

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

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

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

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

126 

49121  127 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
49336  128 
fun type_binding_of (((_, b), _), _) = b; 
49181  129 
fun mixfix_of ((_, mx), _) = mx; 
49121  130 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  131 

49286  132 
fun disc_of ((((disc, _), _), _), _) = disc; 
133 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  136 
fun ctr_mixfix_of (_, mx) = mx; 
49119  137 

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

138 
fun define_datatypes prepare_constraint prepare_typ prepare_term lfp construct_fp (no_dests, specs) 
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset

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

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

143 

49286  144 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  145 
else (); 
146 

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

148 
val fp_bs = map type_binding_of specs; 
49498  149 
val fp_b_names = map Binding.name_of fp_bs; 
150 
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

151 

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

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

153 
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

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

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

156 

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

157 
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

158 
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

159 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
49119  160 

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

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

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

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

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

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

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

167 
variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS); 
49119  168 

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

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

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

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

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

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

175 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  176 

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

177 
fun mk_fake_T b = 
49121  178 
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

179 
unsorted_As); 
49121  180 

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

181 
val fake_Ts = map mk_fake_T fp_bs; 
49121  182 

49181  183 
val mixfixes = map mixfix_of specs; 
49119  184 

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

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

49121  188 
val ctr_specss = map ctr_specs_of specs; 
49119  189 

49336  190 
val disc_bindingss = map (map disc_of) ctr_specss; 
191 
val ctr_bindingss = 

49498  192 
map2 (fn fp_b_name => map (Binding.qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  193 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  194 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  195 

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

197 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  198 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
199 

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

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

201 
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

202 

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

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

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

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

206 

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

207 
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

208 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  209 
[] => () 
49342  210 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  211 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  212 

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

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

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

216 
 eq_fpT_check _ _ = false; 
49146  217 

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

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

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

221 
 kk => nth Xs kk) 
49204  222 
 freeze_fp T = T; 
49121  223 

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

49119  226 

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

227 
val fp_eqs = 
49536  228 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  229 

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

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

231 
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

232 
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

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

234 
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

235 

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

236 
val timer = time (Timer.startRealTimer ()); 
49121  237 

49363  238 
fun add_nesty_bnf_names Us = 
49226  239 
let 
240 
fun add (Type (s, Ts)) ss = 

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

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

243 
end 

49363  244 
 add T ss = (member (op =) Us T, ss); 
49226  245 
in snd oo add end; 
246 

49363  247 
fun nesty_bnfs Us = 
49536  248 
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); 
49363  249 

250 
val nesting_bnfs = nesty_bnfs As; 

49536  251 
val nested_bnfs = nesty_bnfs Xs; 
49226  252 

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

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

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

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

256 
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

257 
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

258 
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

259 

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

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

261 

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

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

263 
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

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

265 

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

266 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  267 

49501  268 
val ctors = map (mk_ctor As) ctors0; 
269 
val dtors = map (mk_dtor As) dtors0; 

49124  270 

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

272 

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

273 
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

274 

49536  275 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  276 
val ns = map length ctr_Tsss; 
49212  277 
val kss = map (fn n => 1 upto n) ns; 
49203  278 
val mss = map (map length) ctr_Tsss; 
279 
val Css = map2 replicate ns Cs; 

280 

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

281 
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

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

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

284 
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

285 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec))); 
49204  286 

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

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

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

289 
names_lthy0) = 
49208  290 
if lfp then 
291 
let 

292 
val y_Tsss = 

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

293 
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

294 
ns mss fp_fold_fun_Ts; 
49208  295 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
296 

49484  297 
val ((gss, ysss), lthy) = 
49208  298 
lthy 
299 
> mk_Freess "f" g_Tss 

300 
>> mk_Freesss "x" y_Tsss; 

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

301 
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

302 

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

303 
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

304 
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

305 
 dest_rec_prodT T = [T]; 
49204  306 

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

308 
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

309 
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; 
49208  310 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  311 

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

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

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

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

317 
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; 
49210  318 
in 
49484  319 
((((gss, g_Tss, yssss), (hss, h_Tss, zssss)), 
320 
([], [], [], (([], []), ([], [])), (([], []), ([], [])))), lthy) 

49210  321 
end 
49208  322 
else 
49210  323 
let 
49221
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

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

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

326 

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

49587  329 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
49211  330 

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

333 
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

334 

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

335 
fun mk_types maybe_dest_sumT fun_Ts = 
49212  336 
let 
337 
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

338 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49275  339 
val f_Tssss = 
340 
map3 (fn C => map2 (map (map (curry (op >) C) o maybe_dest_sumT) oo dest_tupleT)) 

341 
Cs mss' f_prod_Tss; 

342 
val q_Tssss = 

49463  343 
map (map (map (fn [_] => []  [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; 
49587  344 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
49275  345 
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; 
49176  346 

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

347 
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts; 
49211  348 

49484  349 
val ((((Free (z, _), cs), pss), gssss), lthy) = 
49210  350 
lthy 
49233  351 
> yield_singleton (mk_Frees "z") dummyT 
352 
>> mk_Frees "a" Cs 

49211  353 
>> mk_Freess "p" p_Tss 
49275  354 
>> mk_Freessss "g" g_Tssss; 
355 
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

356 

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

357 
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

358 
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

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

360 

49275  361 
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; 
49210  362 

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

363 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 
49484  364 
val ((sssss, hssss_tl), lthy) = 
49275  365 
lthy 
366 
> mk_Freessss "q" s_Tssss 

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

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

49211  369 

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

49276  372 
fun mk_preds_getters_join [] [cf] = cf 
373 
 mk_preds_getters_join [cq] [cf, cf'] = 

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

375 

49275  376 
fun mk_terms qssss fssss = 
49212  377 
let 
49587  378 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 
49275  379 
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

380 
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; 
49276  381 
val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss; 
382 
in (pfss, cqfsss) end; 

49210  383 
in 
49484  384 
(((([], [], []), ([], [], [])), 
385 
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), 

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

49210  387 
end; 
388 

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

389 
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

390 
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

391 
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

392 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  393 
let 
49498  394 
val fp_b_name = Binding.name_of fp_b; 
395 

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

398 
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

399 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  400 

49536  401 
val (((((w, fs), xss), yss), u'), _) = 
49204  402 
no_defs_lthy 
49501  403 
> yield_singleton (mk_Frees "w") dtorT 
49176  404 
>> mk_Frees "f" case_Ts 
49370  405 
>> mk_Freess "x" ctr_Tss 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

406 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  407 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  408 

49498  409 
val u = Free (u', fpT); 
49121  410 

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

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

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

413 

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

415 
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

416 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  417 

49336  418 
val case_binding = Binding.suffix_name ("_" ^ caseN) fp_b; 
49129  419 

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

420 
val case_rhs = 
49498  421 
fold_rev Term.lambda (fs @ [u]) 
49501  422 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); 
49129  423 

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

426 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  427 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  428 
> `Local_Theory.restore; 
429 

430 
val phi = Proof_Context.export_morphism lthy lthy'; 

431 

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

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

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

434 
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

435 
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

436 

49203  437 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
438 
val casex0 = Morphism.term phi raw_case; 

439 

440 
val ctrs = map (mk_ctr As) ctrs0; 

49121  441 

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

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

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

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

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

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

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

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

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

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

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

453 
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

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

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

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

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

458 

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

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

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

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

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

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

465 
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' 
49135  466 
end; 
467 

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

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

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

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

471 

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

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

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

474 
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

475 

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

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

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

478 
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

479 

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

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

481 

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

482 
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

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

484 
wrap_datatype tacss (((no_dests, ctrs0), casex0), (disc_bindings, (sel_bindingss, 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

486 
end; 
49121  487 

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

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

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

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

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

492 

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

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

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

495 
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

496 

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

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

498 
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

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

500 

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

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

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

503 

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

504 
fun thaw xs = Thm.generalize ([], map (fst o dest_Free) xs) 1 o Drule.zero_var_indexes; 
49126  505 

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

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

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

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

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

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

511 
(if lfp then fp_map_thm else fp_map_thm RS ctor_cong))) 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

512 
> thaw xs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

513 

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

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

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

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

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

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

519 
> thaw xs; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

520 

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

521 
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

522 

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

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

524 
val set_thmss = map mk_set_thms fp_set_thms; 
49127  525 

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

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

527 

49590  528 
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

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

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

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

532 
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) 
49590  533 
> postproc > thaw (xs @ ys); 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

534 

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

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

536 
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

537 

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

538 
val pos_rel_thms = map mk_pos_rel_thm (op ~~ rel_infos); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

539 

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

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

541 
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

542 
xs cxIn ys cyIn; 
49121  543 

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

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

545 
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

546 

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

547 
val half_neg_rel_thmss = map (map mk_half_neg_rel_thm) (mk_half_pairss rel_infos); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

548 
val other_half_neg_rel_thmss = map (map mk_other_half_neg_rel_thm) half_neg_rel_thmss; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

549 
val (neg_rel_thms, _) = join_halves n half_neg_rel_thmss other_half_neg_rel_thmss; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

550 

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

551 
val rel_thms = pos_rel_thms @ neg_rel_thms; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

552 

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

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

554 
[(mapsN, map_thms, code_simp_attrs), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

555 
(relsN, rel_thms, code_simp_attrs), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

558 
> map (fn (thmN, thms, attrs) => 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

559 
((Binding.qualify true fp_b_name (Binding.name thmN), attrs), [(thms, [])])); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

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

563 

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

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

565 
let 
49208  566 
val fpT_to_C = fpT > C; 
49199  567 

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

568 
fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xssss)) = 
49215  569 
let 
570 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 

49336  571 
val binding = Binding.suffix_name ("_" ^ suf) fp_b; 
49215  572 
val spec = 
49336  573 
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

574 
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

575 
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); 
49336  576 
in (binding, spec) end; 
49199  577 

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

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

579 
[(foldN, fp_fold, fold_only), 
49215  580 
(recN, fp_rec, rec_only)]; 
581 

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

582 
val (bindings, specs) = map generate_rec_like rec_like_infos > split_list; 
49215  583 

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

49201  585 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  586 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49336  587 
#>> apsnd snd) bindings specs 
49199  588 
> `Local_Theory.restore; 
49201  589 

590 
val phi = Proof_Context.export_morphism lthy lthy'; 

591 

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

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

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

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

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

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

598 

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

599 
fun define_unfold_corec no_defs_lthy = 
49210  600 
let 
601 
val B_to_fpT = C > fpT; 

49211  602 

49276  603 
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = 
604 
Term.lambda c (mk_IfN sum_prod_T cps 

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

49275  606 

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

607 
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

608 
pf_Tss))) = 
49211  609 
let 
610 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

49336  611 
val binding = Binding.suffix_name ("_" ^ suf) fp_b; 
49211  612 
val spec = 
49336  613 
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

614 
Term.list_comb (fp_rec_like, 
49276  615 
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); 
49336  616 
in (binding, spec) end; 
49210  617 

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

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

619 
[(unfoldN, fp_fold, unfold_only), 
49215  620 
(corecN, fp_rec, corec_only)]; 
49212  621 

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

622 
val (bindings, specs) = map generate_corec_like corec_like_infos > split_list; 
49211  623 

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

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

49336  627 
#>> apsnd snd) bindings specs 
49210  628 
> `Local_Theory.restore; 
629 

630 
val phi = Proof_Context.export_morphism lthy lthy'; 

631 

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

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

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

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

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

638 

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

639 
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

640 

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

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

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

644 
(wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy') 
49119  645 
end; 
49167  646 

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

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

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

649 
>> apsnd split_list4 o apfst split_list4 o split_list; 
49226  650 

49437  651 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
49234  652 
let 
49392  653 
val bnf = the (bnf_of lthy s); 
49393  654 
val live = live_of_bnf bnf; 
655 
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

656 
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

657 
in Term.list_comb (mapx, map build_arg TUs') end; 
49234  658 

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

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

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

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

663 

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

664 
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

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

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

667 
val (((ps, ps'), us'), names_lthy) = 
49370  668 
lthy 
49463  669 
> mk_Frees' "P" (map mk_pred1T fpTs) 
49498  670 
>> Variable.variant_fixes fp_b_names; 
49370  671 

49498  672 
val us = map2 (curry Free) us' fpTs; 
49370  673 

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

674 
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

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

676 
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

677 
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

678 
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

679 
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

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

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

682 
 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

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

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

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

686 

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

687 
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

688 

49337  689 
val (induct_thms, induct_thm) = 
690 
let 

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

691 
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

692 
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

693 
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

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

695 

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

696 
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

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

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

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

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

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

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

703 
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

704 
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

705 
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

706 
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

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

708 
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

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

710 
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

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

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

713 
 mk_raw_prem_prems _ _ = []; 
49342  714 

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

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

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

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

718 

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

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

720 
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

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

722 
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

723 

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

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

726 
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

727 
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

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

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

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

731 
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); 
49368  732 

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

733 
val raw_premss = map3 (map2 o mk_raw_prem) ps ctrss ctr_Tsss; 
49389  734 

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

735 
val goal = 
49372  736 
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

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

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

739 
val kksss = map (map (map (fst o snd) o #2)) raw_premss; 
49368  740 

49501  741 
val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); 
49342  742 

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

743 
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

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

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

750 
`(conj_dests nn) thm 
49337  751 
end; 
49201  752 

49438  753 
(* TODO: Generate nicer names in case of clashes *) 
49437  754 
val induct_cases = Datatype_Prop.indexify_names (maps (map base_name_of_ctr) ctrss); 
755 

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

756 
val (fold_thmss, rec_thmss) = 
49207  757 
let 
49337  758 
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

759 
val gfolds = map (lists_bmoc gss) folds; 
49337  760 
val hrecs = map (lists_bmoc hss) recs; 
761 

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

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

764 
(mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs))); 
49204  765 

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

766 
fun build_rec_like frec_likes maybe_tick (T, U) = 
49234  767 
if T = U then 
49368  768 
id_const T 
49234  769 
else 
770 
(case find_index (curry (op =) T) fpTs of 

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

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

772 
 kk => maybe_tick (nth us kk) (nth frec_likes kk)); 
49233  773 

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

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

775 
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

776 

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

777 
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

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

779 
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

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

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

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

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

784 

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

785 
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

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

787 
map (map (maps (intr_rec_likes hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 
49204  788 

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

789 
val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss; 
49484  790 
val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss; 
49204  791 

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

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

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

796 
map2 (map o mk_rec_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms 
49363  797 
ctr_defss; 
49484  798 

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

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

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

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

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

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

805 
end; 
49201  806 

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

807 
val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss; 
49438  808 

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

811 

49337  812 
val common_notes = 
49437  813 
(if nn > 1 then [(inductN, [induct_thm], [induct_case_names_attr])] else []) 
49337  814 
> map (fn (thmN, thms, attrs) => 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

815 
((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 
49337  816 

49226  817 
val notes = 
49437  818 
[(inductN, map single induct_thms, 
819 
fn T_name => [induct_case_names_attr, induct_type_attr T_name]), 

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

820 
(foldsN, fold_thmss, K (code_simp_attrs)), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

821 
(recsN, rec_thmss, K (code_simp_attrs)), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

822 
(simpsN, simp_thmss, K [])] 
49300  823 
> maps (fn (thmN, thmss, attrs) => 
49437  824 
map3 (fn b => fn Type (T_name, _) => fn thms => 
825 
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs T_name), 

826 
[(thms, [])])) fp_bs fpTs thmss); 

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

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

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

830 

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

831 
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

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

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

835 

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

837 
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

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

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

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

841 
val sel_thmsss = map #9 wrap_ress; 
49438  842 

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

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

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

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

847 
>> Variable.variant_fixes (map (suffix "'") fp_b_names); 
49370  848 

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

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

851 
val uselsss = map2 (map o map o rapp) us selsss; 
49370  852 

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

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

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

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

856 

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

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

859 
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

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

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

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

863 
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

864 

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

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

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

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

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

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

870 
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

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

872 

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

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

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

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

876 
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

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

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

879 

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

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

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

882 

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

883 
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

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

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

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

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

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

889 
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

890 

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

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

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

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

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

895 

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

896 
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

897 
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

898 
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

899 

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

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

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

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

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

904 

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

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

906 
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

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

908 

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

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

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

911 

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

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

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

914 
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

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

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

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

918 

49590  919 
fun postproc nn thm = 
920 
Thm.permute_prems 0 nn 

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

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

922 
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

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

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

926 
(postproc nn (prove fp_induct goal), postproc nn (prove fp_strong_induct strong_goal)) 
49337  927 
end; 
49212  928 

49484  929 
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; 
930 

931 
val z = the_single zs; 

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

932 
val gunfolds = map (lists_bmoc pgss) unfolds; 
49484  933 
val hcorecs = map (lists_bmoc phss) corecs; 
934 

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

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

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

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

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

942 
fun build_corec_like fcorec_likes maybe_tack (T, U) = 
49234  943 
if T = U then 
49368  944 
id_const T 
49234  945 
else 
946 
(case find_index (curry (op =) U) fpTs of 

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

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

948 
 kk => maybe_tack (nth cs kk, nth us kk) (nth fcorec_likes kk)); 
49233  949 

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

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

951 
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); 
49212  952 

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

953 
fun intr_corec_likes fcorec_likes maybe_mk_sumT maybe_tack cqf = 
49276  954 
let val T = fastype_of cqf in 
955 
if exists_subtype (member (op =) Cs) T then 

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

956 
build_corec_like fcorec_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf 
49276  957 
else 
958 
cqf 

959 
end; 

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

960 

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

961 
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

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

963 
map (map (map (intr_corec_likes hcorecs (curry mk_sumT) (tack z)))) cshsss; 
49212  964 

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

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

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

49213  969 

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

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

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

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

976 

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

979 

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

980 
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

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

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

984 

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

985 
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

986 
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

987 

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

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

989 
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

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

991 

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

992 
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

993 
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

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

995 
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) 
49212  996 
end; 
997 

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

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

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

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

1004 

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

1005 
val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss; 
49484  1006 
val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; 
1007 

1008 
fun mk_case_split' cp = 

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

1010 

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

49482  1012 

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

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

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

1016 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss; 
49484  1017 

1018 
fun prove goal tac = 

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

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

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

1021 
> Thm.close_derivation; 
49484  1022 

1023 
fun proves [_] [_] = [] 

1024 
 proves goals tacs = map2 prove goals tacs; 

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

1026 
(map2 proves unfold_goalss unfold_tacss, 
49484  1027 
map2 proves corec_goalss corec_tacss) 
49482  1028 
end; 
1029 

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

1030 
fun mk_disc_corec_like_thms corec_likes discIs = 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1031 
map (op RS) (filter_out (is_triv_implies o snd) (corec_likes ~~ discIs)); 
49266  1032 

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

1033 
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

1034 
val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss; 
49266  1035 

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

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

1038 
val (domT, ranT) = dest_funT (fastype_of sel); 
49266  1039 
val arg_cong' = 
1040 
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

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

1042 
> Thm.varifyT_global; 
49266  1043 
val sel_thm' = sel_thm RSN (2, trans); 
1044 
in 

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

1045 
corec_like_thm RS arg_cong' RS sel_thm' 
49266  1046 
end; 
1047 

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

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

1049 
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

1050 

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

1051 
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

1052 
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

1053 

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

1055 
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

1056 

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

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

1058 
mk_simp_thmss wrap_ress 
49587  1059 
(map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss) 
1060 
(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

1061 

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

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

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

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

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

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

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

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

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

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

1072 
[]) 
49342  1073 
> map (fn (thmN, thms, attrs) => 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1074 
((Binding.qualify true fp_common_name (Binding.name thmN), attrs), [(thms, [])])); 
49342  1075 

49212  1076 
val notes = 
49342  1077 
[(coinductN, map single coinduct_thms, []), (* FIXME: attribs *) 
49482  1078 
(corecsN, corec_thmss, []), 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1079 
(disc_corec_iffsN, disc_corec_iff_thmss, simp_attrs), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

1080 
(disc_corecsN, disc_corec_thmss, simp_attrs), 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

1082 
(disc_unfoldsN, disc_unfold_thmss, simp_attrs), 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

1083 
(sel_unfoldsN, sel_unfold_thmss, simp_attrs), 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1084 
(sel_corecsN, sel_corec_thmss, simp_attrs), 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

1086 
(strong_coinductN, map single strong_coinduct_thms, []), (* FIXME: attribs *) 
49518
b377da40244b
renamed LFP lowlevel rel property to have ctor not dtor in its name
blanchet
parents:
49510
diff
changeset

1087 
(unfoldsN, unfold_thmss, [])] 
49300  1088 
> maps (fn (thmN, thmss, attrs) => 
49266  1089 
map_filter (fn (_, []) => NONE  (b, thms) => 
49300  1090 
SOME ((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs), 
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset

1091 
[(thms, [])])) (fp_bs ~~ thmss)); 
49212  1092 
in 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

1093 
lthy > Local_Theory.notes (anonymous_notes @ common_notes @ notes) > snd 
49212  1094 
end; 
1095 

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

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

1098 
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

1099 
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

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

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

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

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

1104 
else derive_coinduct_unfold_corec_thms_for_types); 
49167  1105 

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

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

1109 
timer; lthy' 
49112  1110 
end; 
1111 

49536  1112 
val datatypes = define_datatypes (K I) (K I) (K I); 
49297  1113 

49536  1114 
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; 
49119  1115 

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

1117 
@{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

1118 
(Parse.typ >> pair Binding.empty); 
49112  1119 

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

1122 

49112  1123 
val parse_single_spec = 
1124 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

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

49278  1128 
val parse_datatype = parse_wrap_options  Parse.and_list1 parse_single_spec; 
1129 

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

1130 
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp; 
49112  1131 

1132 
end; 