author  blanchet 
Wed, 26 Sep 2012 10:00:59 +0200  
changeset 49587  33cf557c7849 
parent 49585  5c4a12550491 
child 49590  43e2d0e10876 
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 > 
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

12 
BNF_Def.BNF list > local_theory > 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

13 
(BNF_Def.BNF list * term list * term list * term list * term list * thm * thm list * 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

14 
thm list * thm list * thm list * thm list list * thm list * thm list * thm list) * 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

16 
bool * ((((typ * sort) list * binding) * mixfix) * ((((binding * binding) * 
49297  17 
(binding * typ) list) * (binding * term) list) * mixfix) list) list > 
18 
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

19 
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

20 
(mixfix list > (string * sort) list option > binding list > typ list * typ list list > 
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP  this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset

21 
BNF_Def.BNF list > local_theory > 
49585
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

22 
(BNF_Def.BNF list * term list * term list * term list * term list * thm * thm list * 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

23 
thm list * thm list * thm list * thm list list * thm list * thm list * thm list) * 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

24 
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

25 
(local_theory > local_theory) parser 
49112  26 
end; 
27 

28 
structure BNF_FP_Sugar : BNF_FP_SUGAR = 

29 
struct 

30 

49119  31 
open BNF_Util 
32 
open BNF_Wrap 

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

33 
open BNF_Def 
49457  34 
open BNF_FP 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

35 
open BNF_FP_Sugar_Tactics 
49119  36 

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

38 
val code_simp_attrs = Code.add_default_eqn_attrib :: simp_attrs; 
49300  39 

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

40 
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

41 

49342  42 
fun resort_tfree S (TFree (s, _)) = TFree (s, S); 
43 

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

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

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

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

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

48 
 typ_subst inst T = the_default T (AList.lookup (op =) inst T); 
49205  49 

49583  50 
fun variant_types ss Ss ctxt = 
51 
let 

52 
val (tfrees, _) = 

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

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

55 
in (tfrees, ctxt') end; 

56 

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

58 

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

61 
fun mk_uncurried2_fun f xss = 
49200  62 
mk_tupled_fun (HOLogic.mk_tuple (map HOLogic.mk_tuple xss)) f (flat xss); 
63 

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

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

65 
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

66 

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

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

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

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

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

71 
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

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

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

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

75 

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

78 
Term.subst_atomic_types (Ts0 ~~ Ts) t 

79 
end; 

80 

81 
val mk_ctor = mk_ctor_or_dtor range_type; 

82 
val mk_dtor = mk_ctor_or_dtor domain_type; 

83 

84 
fun mk_rec_like lfp Ts Us t = 

85 
let 

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

87 
val (f_Us, prebody) = split_last bindings; 

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

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

90 
in 

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

92 
end; 

93 

94 
fun mk_map live Ts Us t = 

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

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

97 
end; 

98 

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

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

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

101 
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

102 
 _ => replicate n false); 
49536  103 

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

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

108 
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

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

110 

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

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

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

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

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

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

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

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

119 
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

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

121 

49121  122 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
49336  123 
fun type_binding_of (((_, b), _), _) = b; 
49181  124 
fun mixfix_of ((_, mx), _) = mx; 
49121  125 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  126 

49286  127 
fun disc_of ((((disc, _), _), _), _) = disc; 
128 
fun ctr_of ((((_, ctr), _), _), _) = ctr; 

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

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

49181  131 
fun ctr_mixfix_of (_, mx) = mx; 
49119  132 

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

133 
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

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

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

138 

49286  139 
val _ = if not lfp andalso no_dests then error "Cannot define destructorless codatatypes" 
49278  140 
else (); 
141 

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

143 
val fp_bs = map type_binding_of specs; 
49498  144 
val fp_b_names = map Binding.name_of fp_bs; 
145 
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

146 

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

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

148 
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

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

150 
end; 
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 
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

153 
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

154 
val unsorted_As = Library.foldr1 merge_type_args unsorted_Ass0; 
49119  155 

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

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

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

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

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

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

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

162 
variant_types (map (prefix "'") fp_b_names) (replicate nn HOLogic.typeS); 
49119  163 

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

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

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

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

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

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

170 
val fake_lthy = Proof_Context.background_theory fake_thy no_defs_lthy; 
49119  171 

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

172 
fun mk_fake_T b = 
49121  173 
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

174 
unsorted_As); 
49121  175 

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

176 
val fake_Ts = map mk_fake_T fp_bs; 
49121  177 

49181  178 
val mixfixes = map mixfix_of specs; 
49119  179 

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

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

49121  183 
val ctr_specss = map ctr_specs_of specs; 
49119  184 

49336  185 
val disc_bindingss = map (map disc_of) ctr_specss; 
186 
val ctr_bindingss = 

49498  187 
map2 (fn fp_b_name => map (Binding.qualify false fp_b_name o ctr_of)) fp_b_names ctr_specss; 
49121  188 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  189 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  190 

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

192 
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
49286  193 
val raw_sel_defaultsss = map (map defaults_of) ctr_specss; 
194 

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

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

196 
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

197 

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

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

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

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

201 

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

202 
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

203 
val _ = (case subtract (op =) (map dest_TFree As) rhs_As' of 
49165  204 
[] => () 
49342  205 
 A' :: _ => error ("Extra type variable on righthand side: " ^ 
49204  206 
quote (Syntax.string_of_typ no_defs_lthy (TFree A')))); 
49165  207 

49204  208 
fun eq_fpT (T as Type (s, Us)) (Type (s', Us')) = 
49146  209 
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ 
210 
quote (Syntax.string_of_typ fake_lthy T))) 

49204  211 
 eq_fpT _ _ = false; 
49146  212 

49204  213 
fun freeze_fp (T as Type (s, Us)) = 
49536  214 
(case find_index (eq_fpT T) fake_Ts of ~1 => Type (s, map freeze_fp Us)  j => nth Xs j) 
49204  215 
 freeze_fp T = T; 
49121  216 

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

49119  219 

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

220 
val fp_eqs = 
49536  221 
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctr_sum_prod_TsXs; 
49121  222 

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

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

224 
val (pre_bnfs, ((fp_bnfs as any_fp_bnf :: _, dtors0, ctors0, fp_folds0, fp_recs0, fp_induct, 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

225 
dtor_ctors, ctor_dtors, ctor_injects, fp_map_thms, fp_set_thmss, fp_rel_thms, 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

227 
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

228 

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

229 
val timer = time (Timer.startRealTimer ()); 
49121  230 

49363  231 
fun add_nesty_bnf_names Us = 
49226  232 
let 
233 
fun add (Type (s, Ts)) ss = 

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

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

236 
end 

49363  237 
 add T ss = (member (op =) Us T, ss); 
49226  238 
in snd oo add end; 
239 

49363  240 
fun nesty_bnfs Us = 
49536  241 
map_filter (bnf_of lthy) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_TsssXs []); 
49363  242 

243 
val nesting_bnfs = nesty_bnfs As; 

49536  244 
val nested_bnfs = nesty_bnfs Xs; 
49226  245 

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

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

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

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

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

250 
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

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

252 

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

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

254 

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

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

256 
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

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

258 

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

259 
val B_ify = Term.typ_subst_atomic (As ~~ Bs); 
49167  260 

49501  261 
val ctors = map (mk_ctor As) ctors0; 
262 
val dtors = map (mk_dtor As) dtors0; 

49124  263 

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

265 

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

266 
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

267 

49536  268 
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctr_TsssXs; 
49203  269 
val ns = map length ctr_Tsss; 
49212  270 
val kss = map (fn n => 1 upto n) ns; 
49203  271 
val mss = map (map length) ctr_Tsss; 
272 
val Css = map2 replicate ns Cs; 

273 

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

274 
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

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

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

277 
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

278 
val fp_rec_fun_Ts = fst (split_last (binder_types (fastype_of any_fp_rec))); 
49204  279 

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

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

281 
(zs, cs, cpss, unfold_only as ((pgss, crgsss), _), corec_only as ((phss, cshsss), _))), 
49484  282 
names_lthy) = 
49208  283 
if lfp then 
284 
let 

285 
val y_Tsss = 

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

286 
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

287 
ns mss fp_fold_fun_Ts; 
49208  288 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 
289 

49484  290 
val ((gss, ysss), lthy) = 
49208  291 
lthy 
292 
> mk_Freess "f" g_Tss 

293 
>> mk_Freesss "x" y_Tsss; 

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

294 
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

295 

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

296 
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

297 
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

298 
 dest_rec_prodT T = [T]; 
49204  299 

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

301 
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

302 
dest_sumTN_balanced n o domain_type) ns mss fp_rec_fun_Ts; 
49208  303 
val h_Tss = map2 (map2 (fold_rev (curry (op >)))) z_Tssss Css; 
49204  304 

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

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

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

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

310 
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; 
49210  311 
in 
49484  312 
((((gss, g_Tss, yssss), (hss, h_Tss, zssss)), 
313 
([], [], [], (([], []), ([], [])), (([], []), ([], [])))), lthy) 

49210  314 
end 
49208  315 
else 
49210  316 
let 
49221
6d8d5fe9f3a2
fixed bug with onevalue types with phantom type arguments
blanchet
parents:
49220
diff
changeset

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

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

319 

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

49587  322 
fun flat_predss_getterss qss fss = maps (op @) (qss ~~ fss); 
49211  323 

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

326 
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

327 

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

328 
fun mk_types maybe_dest_sumT fun_Ts = 
49212  329 
let 
330 
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

331 
val f_prod_Tss = map2 dest_sumTN_balanced ns f_sum_prod_Ts; 
49275  332 
val f_Tssss = 
333 
map3 (fn C => map2 (map (map (curry (op >) C) o maybe_dest_sumT) oo dest_tupleT)) 

334 
Cs mss' f_prod_Tss; 

335 
val q_Tssss = 

49463  336 
map (map (map (fn [_] => []  [_, C] => [mk_pred1T (domain_type C)]))) f_Tssss; 
49587  337 
val pf_Tss = map3 flat_preds_predsss_gettersss p_Tss q_Tssss f_Tssss; 
49275  338 
in (q_Tssss, f_sum_prod_Ts, f_Tssss, pf_Tss) end; 
49176  339 

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

340 
val (r_Tssss, g_sum_prod_Ts, g_Tssss, pg_Tss) = mk_types single fp_fold_fun_Ts; 
49211  341 

49484  342 
val ((((Free (z, _), cs), pss), gssss), lthy) = 
49210  343 
lthy 
49233  344 
> yield_singleton (mk_Frees "z") dummyT 
345 
>> mk_Frees "a" Cs 

49211  346 
>> mk_Freess "p" p_Tss 
49275  347 
>> mk_Freessss "g" g_Tssss; 
348 
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

349 

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

350 
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

351 
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

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

353 

49275  354 
val (s_Tssss, h_sum_prod_Ts, h_Tssss, ph_Tss) = mk_types dest_corec_sumT fp_rec_fun_Ts; 
49210  355 

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

356 
val hssss_hd = map2 (map2 (map2 (fn T :: _ => fn [g] => retype_free T g))) h_Tssss gssss; 
49484  357 
val ((sssss, hssss_tl), lthy) = 
49275  358 
lthy 
359 
> mk_Freessss "q" s_Tssss 

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

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

49211  362 

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

49276  365 
fun mk_preds_getters_join [] [cf] = cf 
366 
 mk_preds_getters_join [cq] [cf, cf'] = 

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

368 

49275  369 
fun mk_terms qssss fssss = 
49212  370 
let 
49587  371 
val pfss = map3 flat_preds_predsss_gettersss pss qssss fssss; 
49275  372 
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

373 
val cfssss = map2 (fn c => map (map (map (fn f => f $ c)))) cs fssss; 
49276  374 
val cqfsss = map2 (map2 (map2 mk_preds_getters_join)) cqssss cfssss; 
375 
in (pfss, cqfsss) end; 

49210  376 
in 
49484  377 
(((([], [], []), ([], [], [])), 
378 
([z], cs, cpss, (mk_terms rssss gssss, (g_sum_prod_Ts, pg_Tss)), 

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

49210  380 
end; 
381 

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

382 
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

383 
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

384 
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

385 
ctr_mixfixes), ctr_Tss), disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = 
49176  386 
let 
49498  387 
val fp_b_name = Binding.name_of fp_b; 
388 

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

391 
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

392 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  393 

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

399 
>> mk_Freess "y" (map (map B_ify) ctr_Tss) 
49498  400 
>> yield_singleton Variable.variant_fixes fp_b_name; 
49370  401 

49498  402 
val u = Free (u', fpT); 
49121  403 

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

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

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

406 

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

408 
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

409 
mk_InN_balanced ctr_sum_prod_T n tuple_x k)) ks xss tuple_xs; 
49121  410 

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

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

413 
val case_rhs = 
49498  414 
fold_rev Term.lambda (fs @ [u]) 
49501  415 
(mk_sum_caseN_balanced (map2 mk_uncurried_fun fs xss) $ (dtor $ u)); 
49129  416 

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

419 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 
49336  420 
(case_binding :: ctr_bindings) (NoSyn :: ctr_mixfixes) (case_rhs :: ctr_rhss) 
49121  421 
> `Local_Theory.restore; 
422 

423 
val phi = Proof_Context.export_morphism lthy lthy'; 

424 

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

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

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

427 
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

428 
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

429 

49203  430 
val ctrs0 = map (Morphism.term phi) raw_ctrs; 
431 
val casex0 = Morphism.term phi raw_case; 

432 

433 
val ctrs = map (mk_ctr As) ctrs0; 

49121  434 

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

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

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

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

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

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

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

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

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

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

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

446 
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

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

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

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

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

451 

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

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

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

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

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

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

458 
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' 
49135  459 
end; 
460 

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

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

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

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

464 

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

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

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

467 
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

468 

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

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

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

471 
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

472 

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

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

474 

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

475 
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

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

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

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

479 
end; 
49121  480 

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

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

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

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

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

485 

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

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

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

488 
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

489 

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

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

491 
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

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

493 

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

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

495 
val cyIns = map2 (mk_cIn B_ify) tuple_ys ks; 
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 thaw xs = Thm.generalize ([], map (fst o dest_Free) xs) 1 o Drule.zero_var_indexes; 
49126  498 

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

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

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

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

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

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

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

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

506 

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

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

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

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

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

511 
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) 
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_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

515 

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

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

517 
val set_thmss = map mk_set_thms fp_set_thms; 
49127  518 

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

519 
val rel_infos = (ctr_defs' ~~ xss ~~ cxIns, ctr_defs' ~~ yss ~~ cyIns); 
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_rel_thm finish_off ctr_defs' xs cxIn ys cyIn = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

522 
fold_thms lthy ctr_defs' 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

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

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

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

526 
> finish_off > thaw (xs @ ys); 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

527 

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

528 
fun mk_pos_rel_thm (((ctr_def', xs), cxIn), ((_, ys), cyIn)) = 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

529 
mk_rel_thm (perhaps (try (fn th => th RS @{thm eq_sym_Unity_imp}))) [ctr_def'] 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

530 
xs cxIn ys cyIn; 
5c4a12550491
generate highlevel "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset

531 

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

532 
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

533 

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

534 
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

535 
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

536 
xs cxIn ys cyIn; 
49121  537 

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

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

539 
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

540 

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

541 
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

542 
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

543 
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

544 

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

545 
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

546 

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

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

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

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

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

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

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

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

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

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

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

557 

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

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

559 
let 
49208  560 
val fpT_to_C = fpT > C; 
49199  561 

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

562 
fun generate_rec_like (suf, fp_rec_like, (fss, f_Tss, xssss)) = 
49215  563 
let 
564 
val res_T = fold_rev (curry (op >)) f_Tss fpT_to_C; 

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

568 
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

569 
map2 (mk_sum_caseN_balanced oo map2 mk_uncurried2_fun) fss xssss)); 
49336  570 
in (binding, spec) end; 
49199  571 

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

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

573 
[(foldN, fp_fold, fold_only), 
49215  574 
(recN, fp_rec, rec_only)]; 
575 

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

576 
val (bindings, specs) = map generate_rec_like rec_like_infos > split_list; 
49215  577 

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

49201  579 
> apfst split_list o fold_map2 (fn b => fn spec => 
49199  580 
Specification.definition (SOME (b, NONE, NoSyn), ((Thm.def_binding b, []), spec)) 
49336  581 
#>> apsnd snd) bindings specs 
49199  582 
> `Local_Theory.restore; 
49201  583 

584 
val phi = Proof_Context.export_morphism lthy lthy'; 

585 

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

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

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

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

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

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

592 

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

593 
fun define_unfold_corec no_defs_lthy = 
49210  594 
let 
595 
val B_to_fpT = C > fpT; 

49211  596 

49276  597 
fun mk_preds_getterss_join c n cps sum_prod_T cqfss = 
598 
Term.lambda c (mk_IfN sum_prod_T cps 

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

49275  600 

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

601 
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

602 
pf_Tss))) = 
49211  603 
let 
604 
val res_T = fold_rev (curry (op >)) pf_Tss B_to_fpT; 

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

608 
Term.list_comb (fp_rec_like, 
49276  609 
map5 mk_preds_getterss_join cs ns cpss f_sum_prod_Ts cqfsss)); 
49336  610 
in (binding, spec) end; 
49210  611 

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

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

613 
[(unfoldN, fp_fold, unfold_only), 
49215  614 
(corecN, fp_rec, corec_only)]; 
49212  615 

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

616 
val (bindings, specs) = map generate_corec_like corec_like_infos > split_list; 
49211  617 

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

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

49336  621 
#>> apsnd snd) bindings specs 
49210  622 
> `Local_Theory.restore; 
623 

624 
val phi = Proof_Context.export_morphism lthy lthy'; 

625 

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

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

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

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

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

632 

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

633 
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

634 

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

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

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

638 
(wrap #> (live > 0 ? derive_maps_sets_rels) ##>> define_rec_likes #> massage_res, lthy') 
49119  639 
end; 
49167  640 

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

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

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

643 
>> apsnd split_list4 o apfst split_list4 o split_list; 
49226  644 

49437  645 
fun build_map build_arg (Type (s, Ts)) (Type (_, Us)) = 
49234  646 
let 
49392  647 
val bnf = the (bnf_of lthy s); 
49393  648 
val live = live_of_bnf bnf; 
649 
val mapx = mk_map live Ts Us (map_of_bnf bnf); 

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

49234  651 
val args = map build_arg TUs; 
652 
in Term.list_comb (mapx, args) end; 

653 

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

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

655 
val mk_simp_thmss = 
49505  656 
map3 (fn (_, _, injects, distincts, cases, _, _, _) => fn rec_likes => fn fold_likes => 
657 
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

658 

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

659 
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

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

661 
let 
49498  662 
val (((phis, phis'), us'), names_lthy) = 
49370  663 
lthy 
49463  664 
> mk_Frees' "P" (map mk_pred1T fpTs) 
49498  665 
>> Variable.variant_fixes fp_b_names; 
49370  666 

49498  667 
val us = map2 (curry Free) us' fpTs; 
49370  668 

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

669 
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

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

671 
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

672 
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

673 
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

674 
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

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

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

677 
 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

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

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

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

681 

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

682 
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

683 

49337  684 
val (induct_thms, induct_thm) = 
685 
let 

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

686 
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

687 
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

688 
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

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

690 

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

691 
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

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

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

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

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

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

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

698 
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

699 
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

700 
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

701 
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

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

703 
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

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

705 
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

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

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

708 
 mk_raw_prem_prems _ _ = []; 
49342  709 

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

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

711 
fold_rev Logic.all (map Free (drop (nn + length xs) 
19237e465055
fixed issue with bound variables in prem prems + tuning
blanchet
parents:
49377
diff
changeset

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

713 

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

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

715 
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

716 
HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets, 
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset

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

718 

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

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

721 
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

722 
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

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

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

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

726 
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); 
49368  727 

49389  728 
val raw_premss = map3 (map2 o mk_raw_prem) phis ctrss ctr_Tsss; 
729 

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

730 
val goal = 
49372  731 
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss, 
49498  732 
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) phis us))); 
49368  733 

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

734 
val kksss = map (map (map (fst o snd) o #2)) raw_premss; 
49368  735 

49501  736 
val ctor_induct' = fp_induct OF (map mk_sumEN_tupled_balanced mss); 
49342  737 

738 
val induct_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

739 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 
49501  740 
mk_induct_tac ctxt ns mss kksss (flat ctr_defss) ctor_induct' 
49389  741 
nested_set_natural's pre_set_defss) 
49368  742 
> singleton (Proof_Context.export names_lthy lthy) 
49337  743 
in 
49367  744 
`(conj_dests nn) induct_thm 
49337  745 
end; 
49201  746 

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

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

750 
val (fold_thmss, rec_thmss) = 
49207  751 
let 
49337  752 
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

753 
val gfolds = map (lists_bmoc gss) folds; 
49337  754 
val hrecs = map (lists_bmoc hss) recs; 
755 

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

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

758 
(mk_Trueprop_eq (frec_like $ xctr, Term.list_comb (f, fxs))); 
49204  759 

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

760 
fun build_call frec_likes maybe_tick (T, U) = 
49234  761 
if T = U then 
49368  762 
id_const T 
49234  763 
else 
764 
(case find_index (curry (op =) T) fpTs of 

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

765 
~1 => build_map (build_call frec_likes maybe_tick) T U 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

766 
 j => maybe_tick (nth us j) (nth frec_likes j)); 
49233  767 

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

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

769 
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

770 

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

771 
fun intr_calls 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

772 
if member (op =) fpTs T then 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

773 
maybe_cons x [build_call 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

774 
else if exists_fp_subtype T then 
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

775 
[build_call 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

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

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

778 

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

779 
val gxsss = map (map (maps (intr_calls gfolds (K I) (K I) (K I)))) xsss; 
49342  780 
val hxsss = map (map (maps (intr_calls hrecs cons tick (curry HOLogic.mk_prodT)))) xsss; 
49204  781 

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

782 
val fold_goalss = map5 (map4 o mk_goal gss) gfolds xctrss gss xsss gxsss; 
49484  783 
val rec_goalss = map5 (map4 o mk_goal hss) hrecs xctrss hss xsss hxsss; 
49204  784 

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

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

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

789 
map2 (map o mk_rec_like_tac pre_map_defs nesting_map_ids rec_defs) fp_rec_thms 
49363  790 
ctr_defss; 
49484  791 

792 
fun prove goal tac = Skip_Proof.prove lthy [] [] goal (tac o #context); 

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

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

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

796 
end; 
49201  797 

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

798 
val simp_thmss = mk_simp_thmss wrap_ress rec_thmss fold_thmss; 
49438  799 

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

802 

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

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

49226  808 
val notes = 
49437  809 
[(inductN, map single induct_thms, 
810 
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

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

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

813 
(simpsN, simp_thmss, K [])] 
49300  814 
> maps (fn (thmN, thmss, attrs) => 
49437  815 
map3 (fn b => fn Type (T_name, _) => fn thms => 
816 
((Binding.qualify true (Binding.name_of b) (Binding.name thmN), attrs T_name), 

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

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

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

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

821 

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

822 
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

823 
corecs, unfold_defs, corec_defs)), lthy) = 
49212  824 
let 
49484  825 
val discss = map (map (mk_disc_or_sel As) o #1) wrap_ress; 
826 
val selsss = map #2 wrap_ress; 

827 
val disc_thmsss = map #6 wrap_ress; 

828 
val discIss = map #7 wrap_ress; 

829 
val sel_thmsss = map #8 wrap_ress; 

49438  830 

49498  831 
val (us', _) = 
49370  832 
lthy 
49498  833 
> Variable.variant_fixes fp_b_names; 
49370  834 

49498  835 
val us = map2 (curry Free) us' fpTs; 
49370  836 

49337  837 
val (coinduct_thms, coinduct_thm) = 
838 
let 

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

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

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

841 

49337  842 
val coinduct_thm = fp_induct; 
843 
in 

49367  844 
`(conj_dests nn) coinduct_thm 
49337  845 
end; 
49212  846 

49484  847 
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; 
848 

849 
val z = the_single zs; 

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

850 
val gunfolds = map (lists_bmoc pgss) unfolds; 
49484  851 
val hcorecs = map (lists_bmoc phss) corecs; 
852 

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

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

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

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

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

860 
fun build_call frec_likes maybe_tack (T, U) = 
49234  861 
if T = U then 
49368  862 
id_const T 
49234  863 
else 
864 
(case find_index (curry (op =) U) fpTs of 

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

865 
~1 => build_map (build_call frec_likes maybe_tack) T U 
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49502
diff
changeset

866 
 j => maybe_tack (nth cs j, nth us j) (nth frec_likes j)); 
49233  867 

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

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

869 
typ_subst (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); 
49212  870 

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

871 
fun intr_calls frec_likes maybe_mk_sumT maybe_tack cqf = 
49276  872 
let val T = fastype_of cqf in 
873 
if exists_subtype (member (op =) Cs) T then 

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

874 
build_call frec_likes maybe_tack (T, mk_U maybe_mk_sumT T) $ cqf 
49276  875 
else 
876 
cqf 

877 
end; 

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

878 

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

879 
val crgsss' = map (map (map (intr_calls gunfolds (K I) (K I)))) crgsss; 
49342  880 
val cshsss' = map (map (map (intr_calls hcorecs (curry mk_sumT) (tack z)))) cshsss; 
49212  881 

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

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

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

49213  886 

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

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

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

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

893 

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

896 

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

897 
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

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

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

901 

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

902 
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

903 
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

904 

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

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

906 
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

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

908 

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

909 
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

910 
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

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

912 
(unfold_thmss, corec_thmss, safe_unfold_thmss, safe_corec_thmss) 
49212  913 
end; 
914 

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

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

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

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

921 

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

922 
val unfold_goalss = map6 (map2 oooo mk_goal) cs cpss gunfolds ns kss discss; 
49484  923 
val corec_goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; 
924 

925 
fun mk_case_split' cp = 

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

927 

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

49482  929 

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

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

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

933 
map3 (map oo mk_disc_corec_like_iff_tac) case_splitss' corec_thmss disc_thmsss; 
49484  934 

935 
fun prove goal tac = 

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

937 
> Thm.close_derivation 

938 
> singleton (Proof_Context.export names_lthy no_defs_lthy); 

939 

940 
fun proves [_] [_] = [] 

941 
 proves goals tacs = map2 prove goals tacs; 

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

943 
(map2 proves unfold_goalss unfold_tacss, 
49484  944 
map2 proves corec_goalss corec_tacss) 
49482  945 
end; 
946 

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

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

948 
map (op RS) (filter_out (is_triv_implies o snd) (corec_likes ~~ discIs)); 
49266  949 

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

950 
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

951 
val disc_corec_thmss = map2 mk_disc_corec_like_thms corec_thmss discIss; 
49266  952 

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

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

955 
val (domT, ranT) = dest_funT (fastype_of sel); 
49266  956 
val arg_cong' = 
957 
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

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

959 
> Thm.varifyT_global; 
49266  960 
val sel_thm' = sel_thm RSN (2, trans); 
961 
in 

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

962 
corec_like_thm RS arg_cong' RS sel_thm' 
49266  963 
end; 
964 

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

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

966 
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

967 

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

968 
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

969 
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

970 

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

972 
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

973 

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

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

975 
mk_simp_thmss wrap_ress 
49587  976 
(map3 flat_corec_like_thms safe_corec_thmss disc_corec_thmss sel_corec_thmss) 
977 
(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

978 

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

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

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

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

49342  983 
val common_notes = 
49367  984 
(if nn > 1 then [(coinductN, [coinduct_thm], [])] (* FIXME: attribs *) else []) 
49342  985 
> map (fn (thmN, thms, attrs) => 
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset

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

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

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

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

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

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

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

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

997 
(simpsN, simp_thmss, []), 
49518
b377da40244b
renamed LFP lowlevel rel property to have ctor not dtor in its name
blanchet
parents:
49510
diff
changeset

998 
(unfoldsN, unfold_thmss, [])] 
49300  999 
> maps (fn (thmN, thmss, attrs) => 
49266  1000 
map_filter (fn (_, []) => NONE  (b, thms) => 
49300  1001 
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

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

1004 
lthy > Local_Theory.notes (anonymous_notes @ common_notes @ notes) > snd 
49212  1005 
end; 
1006 

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

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

1009 
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

1010 
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

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

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

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

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

1015 
else derive_coinduct_unfold_corec_thms_for_types); 
49167  1016 

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

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

1020 
timer; lthy' 
49112  1021 
end; 
1022 

49536  1023 
val datatypes = define_datatypes (K I) (K I) (K I); 
49297  1024 

49536  1025 
val datatype_cmd = define_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.read_term; 
49119  1026 

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

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

1029 
(Parse.typ >> pair Binding.empty); 
49112  1030 

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

1033 

49112  1034 
val parse_single_spec = 
1035 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

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

49278  1039 
val parse_datatype = parse_wrap_options  Parse.and_list1 parse_single_spec; 
1040 

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

1041 
fun parse_datatype_cmd lfp construct_fp = parse_datatype >> datatype_cmd lfp construct_fp; 
49112  1042 

1043 
end; 