author  blanchet 
Thu, 06 Sep 2012 11:57:36 +0200  
changeset 49181  64764f0efe80 
parent 49180  592a81b4d413 
child 49182  b8517107ffc5 
permissions  rwrr 
49112  1 
(* Title: HOL/Codatatype/Tools/bnf_fp_sugar.ML 
2 
Author: Jasmin Blanchette, TU Muenchen 

3 
Copyright 2012 

4 

5 
Sugar for constructing LFPs and GFPs. 

6 
*) 

7 

8 
signature BNF_FP_SUGAR = 

9 
sig 

10 
end; 

11 

12 
structure BNF_FP_Sugar : BNF_FP_SUGAR = 

13 
struct 

14 

49119  15 
open BNF_Util 
16 
open BNF_Wrap 

17 
open BNF_FP_Util 

18 
open BNF_LFP 

19 
open BNF_GFP 

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

20 
open BNF_FP_Sugar_Tactics 
49119  21 

49129  22 
val caseN = "case"; 
23 

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

26 
fun merge_type_arg_constrained ctxt (T, c) (T', c') = 

27 
if T = T' then 

28 
(case (c, c') of 

29 
(_, NONE) => (T, c) 

30 
 (NONE, _) => (T, c') 

31 
 _ => 

32 
if c = c' then 

33 
(T, c) 

34 
else 

35 
error ("Inconsistent sort constraints for type variable " ^ 

36 
quote (Syntax.string_of_typ ctxt T))) 

37 
else 

38 
cannot_merge_types (); 

39 

40 
fun merge_type_args_constrained ctxt (cAs, cAs') = 

41 
if length cAs = length cAs' then map2 (merge_type_arg_constrained ctxt) cAs cAs' 

42 
else cannot_merge_types (); 

43 

49121  44 
fun type_args_constrained_of (((cAs, _), _), _) = cAs; 
45 
val type_args_of = map fst o type_args_constrained_of; 

49129  46 
fun type_binder_of (((_, b), _), _) = b; 
49181  47 
fun mixfix_of ((_, mx), _) = mx; 
49121  48 
fun ctr_specs_of (_, ctr_specs) = ctr_specs; 
49119  49 

49121  50 
fun disc_of (((disc, _), _), _) = disc; 
51 
fun ctr_of (((_, ctr), _), _) = ctr; 

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

49181  53 
fun ctr_mixfix_of (_, mx) = mx; 
49119  54 

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

55 
fun prepare_data prepare_typ gfp specs fake_lthy lthy = 
49112  56 
let 
49121  57 
val constrained_As = 
58 
map (map (apfst (prepare_typ fake_lthy)) o type_args_constrained_of) specs 

49119  59 
> Library.foldr1 (merge_type_args_constrained lthy); 
49121  60 
val As = map fst constrained_As; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

61 
val As' = map dest_TFree As; 
49119  62 

49121  63 
val _ = (case duplicates (op =) As of [] => () 
49165  64 
 A :: _ => error ("Duplicate type parameter " ^ quote (Syntax.string_of_typ lthy A))); 
49119  65 

66 
(* TODO: use sort constraints on type args *) 

67 

68 
val N = length specs; 

69 

49121  70 
fun mk_T b = 
71 
Type (fst (Term.dest_Type (Proof_Context.read_type_name fake_lthy true (Binding.name_of b))), 

72 
As); 

73 

49129  74 
val bs = map type_binder_of specs; 
49176  75 
val fp_Ts = map mk_T bs; 
49121  76 

49181  77 
val mixfixes = map mixfix_of specs; 
49119  78 

79 
val _ = (case duplicates Binding.eq_name bs of [] => () 

80 
 b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); 

81 

49121  82 
val ctr_specss = map ctr_specs_of specs; 
49119  83 

49129  84 
val disc_binderss = map (map disc_of) ctr_specss; 
85 
val ctr_binderss = map (map ctr_of) ctr_specss; 

49121  86 
val ctr_argsss = map (map args_of) ctr_specss; 
49181  87 
val ctr_mixfixess = map (map ctr_mixfix_of) ctr_specss; 
49119  88 

49129  89 
val sel_bindersss = map (map (map fst)) ctr_argsss; 
49121  90 
val ctr_Tsss = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; 
91 

49167  92 
val rhs_As' = fold (fold (fold Term.add_tfreesT)) ctr_Tsss []; 
93 
val _ = (case subtract (op =) As' rhs_As' of 

49165  94 
[] => () 
95 
 A' :: _ => error ("Extra type variables on rhs: " ^ 

96 
quote (Syntax.string_of_typ lthy (TFree A')))); 

97 

49176  98 
val ((Cs, Xs), _) = 
49121  99 
lthy 
100 
> fold (fold (fn s => Variable.declare_typ (TFree (s, dummyS))) o type_args_of) specs 

101 
> mk_TFrees N 

49176  102 
>> mk_TFrees N; 
49119  103 

49176  104 
fun is_same_recT (T as Type (s, Us)) (Type (s', Us')) = 
49146  105 
s = s' andalso (Us = Us' orelse error ("Illegal occurrence of recursive type " ^ 
106 
quote (Syntax.string_of_typ fake_lthy T))) 

49176  107 
 is_same_recT _ _ = false; 
49146  108 

49176  109 
fun freeze_recXs (T as Type (s, Us)) = 
110 
(case find_index (is_same_recT T) fp_Ts of 

111 
~1 => Type (s, map freeze_recXs Us) 

112 
 i => nth Xs i) 

113 
 freeze_recXs T = T; 

49121  114 

49176  115 
val ctr_TsssXs = map (map (map freeze_recXs)) ctr_Tsss; 
116 
val sum_prod_TsXs = map (mk_sumTN o map HOLogic.mk_tupleT) ctr_TsssXs; 

49119  117 

49176  118 
val eqs = map dest_TFree Xs ~~ sum_prod_TsXs; 
49121  119 

49176  120 
val ((raw_unfs, raw_flds, raw_fp_iters, raw_fp_recs, unf_flds, fld_unfs, fld_injects), lthy') = 
49169  121 
fp_bnf (if gfp then bnf_gfp else bnf_lfp) bs mixfixes As' eqs lthy; 
49121  122 

49167  123 
val timer = time (Timer.startRealTimer ()); 
124 

49176  125 
fun mk_unf_or_fld get_T Ts t = 
126 
let val Type (_, Ts0) = get_T (fastype_of t) in 

49124  127 
Term.subst_atomic_types (Ts0 ~~ Ts) t 
49121  128 
end; 
49119  129 

49126  130 
val mk_unf = mk_unf_or_fld domain_type; 
131 
val mk_fld = mk_unf_or_fld range_type; 

49121  132 

49126  133 
val unfs = map (mk_unf As) raw_unfs; 
49124  134 
val flds = map (mk_fld As) raw_flds; 
135 

49176  136 
fun mk_fp_iter_or_rec Ts Us t = 
49121  137 
let 
49176  138 
val (binders, body) = strip_type (fastype_of t); 
139 
val Type (_, Ts0) = if gfp then body else List.last binders; 

140 
val Us0 = map (if gfp then domain_type else body_type) (fst (split_last binders)); 

141 
in 

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

143 
end; 

144 

145 
val fp_iters = map (mk_fp_iter_or_rec As Cs) raw_fp_iters; 

146 
val fp_recs = map (mk_fp_iter_or_rec As Cs) raw_fp_recs; 

147 

148 
fun pour_sugar_on_type ((((((((((((((b, fp_T), C), fld), unf), fp_iter), fp_rec), fld_unf), 

149 
unf_fld), fld_inject), ctr_binders), ctr_mixfixes), ctr_Tss), disc_binders), sel_binderss) 

150 
no_defs_lthy = 

151 
let 

152 
val n = length ctr_Tss; 

49121  153 
val ks = 1 upto n; 
154 
val ms = map length ctr_Tss; 

155 

49124  156 
val unf_T = domain_type (fastype_of fld); 
49121  157 
val prod_Ts = map HOLogic.mk_tupleT ctr_Tss; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

158 
val case_Ts = map (fn Ts => Ts > C) ctr_Tss; 
49119  159 

49176  160 
val ((((u, v), fs), xss), _) = 
49124  161 
lthy 
49176  162 
> yield_singleton (mk_Frees "u") unf_T 
163 
>> yield_singleton (mk_Frees "v") fp_T 

164 
>> mk_Frees "f" case_Ts 

49124  165 
>> mk_Freess "x" ctr_Tss; 
49121  166 

49129  167 
val ctr_rhss = 
49121  168 
map2 (fn k => fn xs => 
169 
fold_rev Term.lambda xs (fld $ mk_InN prod_Ts (HOLogic.mk_tuple xs) k)) ks xss; 

170 

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

171 
val case_binder = Binding.suffix_name ("_" ^ caseN) b; 
49129  172 

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

173 
val case_rhs = 
49176  174 
fold_rev Term.lambda (fs @ [v]) (mk_sum_caseN (map2 mk_uncurried_fun fs xss) $ (unf $ v)); 
49129  175 

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

176 
val (((raw_ctrs, raw_ctr_defs), (raw_case, raw_case_def)), (lthy', lthy)) = no_defs_lthy 
49169  177 
> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => 
178 
Local_Theory.define ((b, mx), ((Thm.def_binding b, []), rhs)) #>> apsnd snd) 

179 
ctr_binders ctr_mixfixes ctr_rhss 

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

180 
>> (Local_Theory.define ((case_binder, NoSyn), ((Thm.def_binding case_binder, []), 
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

181 
case_rhs)) #>> apsnd snd) 
49121  182 
> `Local_Theory.restore; 
183 

184 
(*transforms defined frees into consts (and more)*) 

185 
val phi = Proof_Context.export_morphism lthy lthy'; 

186 

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

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

188 
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

189 

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

190 
val ctrs = map (Morphism.term phi) raw_ctrs; 
49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

191 
val casex = Morphism.term phi raw_case; 
49121  192 

49135  193 
fun exhaust_tac {context = ctxt, ...} = 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

194 
let 
49135  195 
val fld_iff_unf_thm = 
196 
let 

197 
val goal = 

198 
fold_rev Logic.all [u, v] 

199 
(mk_Trueprop_eq (HOLogic.mk_eq (v, fld $ u), HOLogic.mk_eq (unf $ v, u))); 

200 
in 

201 
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => 

49176  202 
mk_fld_iff_unf_tac ctxt (map (SOME o certifyT lthy) [unf_T, fp_T]) 
203 
(certify lthy fld) (certify lthy unf) fld_unf unf_fld) 

49135  204 
> Thm.close_derivation 
205 
> Morphism.thm phi 

206 
end; 

207 

208 
val sumEN_thm' = 

209 
Local_Defs.unfold lthy @{thms all_unit_eq} 

210 
(Drule.instantiate' (map (SOME o certifyT lthy) prod_Ts) [] (mk_sumEN n)) 

211 
> Morphism.thm phi; 

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

212 
in 
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac"  arose with uncurried constructors
blanchet
parents:
49157
diff
changeset

213 
mk_exhaust_tac ctxt n ctr_defs fld_iff_unf_thm sumEN_thm' 
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset

214 
end; 
49121  215 

49126  216 
val inject_tacss = 
217 
map2 (fn 0 => K [] 

218 
 _ => fn ctr_def => [fn {context = ctxt, ...} => 

219 
mk_inject_tac ctxt ctr_def fld_inject]) 

220 
ms ctr_defs; 

221 

49127  222 
val half_distinct_tacss = 
223 
map (map (fn (def, def') => fn {context = ctxt, ...} => 

224 
mk_half_distinct_tac ctxt fld_inject [def, def'])) (mk_half_pairss ctr_defs); 

225 

49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

226 
val case_tacs = 
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

227 
map3 (fn k => fn m => fn ctr_def => fn {context = ctxt, ...} => 
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

228 
mk_case_tac ctxt n k m case_def ctr_def unf_fld) ks ms ctr_defs; 
49121  229 

230 
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss @ [case_tacs]; 

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

231 

49176  232 
(* (co)iterators, (co)recursors, (co)induction *) 
233 

234 
val is_recT = member (op =) fp_Ts; 

235 

236 
val ns = map length ctr_Tsss; 

237 
val mss = map (map length) ctr_Tsss; 

238 
val Css = map2 replicate ns Cs; 

239 

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

240 
fun sugar_lfp lthy = 
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

241 
let 
49176  242 
val fp_y_Ts = map domain_type (fst (split_last (binder_types (fastype_of fp_iter)))); 
243 
val y_prod_Tss = map2 dest_sumTN ns fp_y_Ts; 

244 
val y_Tsss = map2 (map2 dest_tupleT) mss y_prod_Tss; 

245 
val g_Tss = map2 (map2 (curry (op >))) y_Tsss Css; 

246 
val iter_T = flat g_Tss > fp_T > C; 

49146  247 

49176  248 
val ((gss, ysss), _) = 
249 
lthy 

250 
> mk_Freess "f" g_Tss 

49177
db8ce685073f
introduced and used "mk_Freesss", and simplified "mk_Freess(')"
blanchet
parents:
49176
diff
changeset

251 
>> mk_Freesss "x" y_Tsss; 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

252 

49146  253 
val iter_rhs = 
49176  254 
fold_rev (fold_rev Term.lambda) gss 
255 
(Term.list_comb (fp_iter, map2 (mk_sum_caseN oo map2 mk_uncurried_fun) gss ysss)); 

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

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

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

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

259 

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

260 
fun sugar_gfp lthy = lthy; 
49119  261 
in 
49130
3c26e17b2849
implemented "mk_case_tac"  and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset

262 
wrap_data tacss ((ctrs, casex), (disc_binders, sel_binderss)) lthy' 
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset

263 
> (if gfp then sugar_gfp else sugar_lfp) 
49119  264 
end; 
49167  265 

266 
val lthy'' = 

49176  267 
fold pour_sugar_on_type (bs ~~ fp_Ts ~~ Cs ~~ flds ~~ unfs ~~ fp_iters ~~ fp_recs ~~ 
268 
fld_unfs ~~ unf_flds ~~ fld_injects ~~ ctr_binderss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ 

269 
disc_binderss ~~ sel_bindersss) lthy'; 

49167  270 

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

272 
(if gfp then "co" else "") ^ "datatype")); 

49112  273 
in 
49167  274 
(timer; lthy'') 
49112  275 
end; 
276 

49121  277 
fun data_cmd info specs lthy = 
278 
let 

49179
f9d48d479c84
don't throw away the context when hacking the theory (first step to localize the sugar code)
blanchet
parents:
49177
diff
changeset

279 
val fake_thy = Theory.copy 
49180  280 
#> fold (fn spec => Sign.add_type lthy 
49181  281 
(type_binder_of spec, length (type_args_constrained_of spec), mixfix_of spec)) specs; 
49179
f9d48d479c84
don't throw away the context when hacking the theory (first step to localize the sugar code)
blanchet
parents:
49177
diff
changeset

282 
val fake_lthy = Proof_Context.background_theory fake_thy lthy; 
49121  283 
in 
284 
prepare_data Syntax.read_typ info specs fake_lthy lthy 

285 
end; 

49119  286 

49129  287 
val parse_opt_binding_colon = Scan.optional (Parse.binding  Parse.$$$ ":") no_binder 
49119  288 

49112  289 
val parse_ctr_arg = 
49119  290 
Parse.$$$ "("  parse_opt_binding_colon  Parse.typ  Parse.$$$ ")"  
49129  291 
(Parse.typ >> pair no_binder); 
49112  292 

293 
val parse_single_spec = 

294 
Parse.type_args_constrained  Parse.binding  Parse.opt_mixfix  

49119  295 
(@{keyword "="}  Parse.enum1 "" (parse_opt_binding_colon  Parse.binding  
296 
Scan.repeat parse_ctr_arg  Parse.opt_mixfix)); 

49112  297 

298 
val _ = 

299 
Outer_Syntax.local_theory @{command_spec "data"} "define BNFbased inductive datatypes" 

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

300 
(Parse.and_list1 parse_single_spec >> data_cmd false); 
49112  301 

302 
val _ = 

303 
Outer_Syntax.local_theory @{command_spec "codata"} "define BNFbased coinductive datatypes" 

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

304 
(Parse.and_list1 parse_single_spec >> data_cmd true); 
49112  305 

306 
end; 