1 (* Title: HOL/BNF/Tools/bnf_fp_rec_sugar_tactics.ML |
|
2 Author: Jasmin Blanchette, TU Muenchen |
|
3 Copyright 2013 |
|
4 |
|
5 Tactics for recursor and corecursor sugar. |
|
6 *) |
|
7 |
|
8 signature BNF_FP_REC_SUGAR_TACTICS = |
|
9 sig |
|
10 val mk_primcorec_assumption_tac: Proof.context -> thm list -> int -> tactic |
|
11 val mk_primcorec_code_of_raw_code_tac: thm list -> thm -> tactic |
|
12 val mk_primcorec_ctr_of_dtr_tac: Proof.context -> int -> thm -> thm option -> thm list -> tactic |
|
13 val mk_primcorec_disc_tac: Proof.context -> thm list -> thm -> int -> int -> thm list list list -> |
|
14 tactic |
|
15 val mk_primcorec_raw_code_of_ctr_tac: Proof.context -> thm list -> thm list -> thm list -> |
|
16 thm list -> int list -> thm list -> tactic |
|
17 val mk_primcorec_sel_tac: Proof.context -> thm list -> thm list -> thm list -> thm list -> |
|
18 thm list -> thm list -> thm list -> thm -> int -> int -> thm list list list -> tactic |
|
19 val mk_primrec_tac: Proof.context -> int -> thm list -> thm list -> thm list -> thm -> tactic |
|
20 end; |
|
21 |
|
22 structure BNF_FP_Rec_Sugar_Tactics : BNF_FP_REC_SUGAR_TACTICS = |
|
23 struct |
|
24 |
|
25 open BNF_Util |
|
26 open BNF_Tactics |
|
27 |
|
28 val falseEs = @{thms not_TrueE FalseE}; |
|
29 val neq_eq_eq_contradict = @{thm neq_eq_eq_contradict}; |
|
30 val split_if = @{thm split_if}; |
|
31 val split_if_asm = @{thm split_if_asm}; |
|
32 val split_connectI = @{thms allI impI conjI}; |
|
33 |
|
34 fun mk_primrec_tac ctxt num_extra_args map_idents map_comps fun_defs recx = |
|
35 unfold_thms_tac ctxt fun_defs THEN |
|
36 HEADGOAL (rtac (funpow num_extra_args (fn thm => thm RS fun_cong) recx RS trans)) THEN |
|
37 unfold_thms_tac ctxt (@{thms id_def split o_def fst_conv snd_conv} @ map_comps @ map_idents) THEN |
|
38 HEADGOAL (rtac refl); |
|
39 |
|
40 fun mk_primcorec_assumption_tac ctxt discIs = |
|
41 SELECT_GOAL (unfold_thms_tac ctxt |
|
42 @{thms not_not not_False_eq_True de_Morgan_conj de_Morgan_disj} THEN |
|
43 SOLVE (HEADGOAL (REPEAT o (rtac refl ORELSE' atac ORELSE' etac conjE ORELSE' |
|
44 resolve_tac @{thms TrueI conjI disjI1 disjI2} ORELSE' |
|
45 dresolve_tac discIs THEN' atac ORELSE' |
|
46 etac notE THEN' atac ORELSE' |
|
47 etac disjE)))); |
|
48 |
|
49 fun mk_primcorec_same_case_tac m = |
|
50 HEADGOAL (if m = 0 then rtac TrueI |
|
51 else REPEAT_DETERM_N (m - 1) o (rtac conjI THEN' atac) THEN' atac); |
|
52 |
|
53 fun mk_primcorec_different_case_tac ctxt excl = |
|
54 unfold_thms_tac ctxt @{thms not_not not_False_eq_True not_True_eq_False} THEN |
|
55 HEADGOAL (rtac excl THEN_ALL_NEW mk_primcorec_assumption_tac ctxt []); |
|
56 |
|
57 fun mk_primcorec_cases_tac ctxt k m exclsss = |
|
58 let val n = length exclsss in |
|
59 EVERY (map (fn [] => if k = n then all_tac else mk_primcorec_same_case_tac m |
|
60 | [excl] => mk_primcorec_different_case_tac ctxt excl) |
|
61 (take k (nth exclsss (k - 1)))) |
|
62 end; |
|
63 |
|
64 fun mk_primcorec_prelude ctxt defs thm = |
|
65 unfold_thms_tac ctxt defs THEN HEADGOAL (rtac thm) THEN |
|
66 unfold_thms_tac ctxt @{thms Let_def split}; |
|
67 |
|
68 fun mk_primcorec_disc_tac ctxt defs disc_corec k m exclsss = |
|
69 mk_primcorec_prelude ctxt defs disc_corec THEN mk_primcorec_cases_tac ctxt k m exclsss; |
|
70 |
|
71 fun mk_primcorec_sel_tac ctxt defs distincts splits split_asms maps map_idents map_comps f_sel k m |
|
72 exclsss = |
|
73 mk_primcorec_prelude ctxt defs (f_sel RS trans) THEN |
|
74 mk_primcorec_cases_tac ctxt k m exclsss THEN |
|
75 HEADGOAL (REPEAT_DETERM o (rtac refl ORELSE' rtac ext ORELSE' |
|
76 eresolve_tac falseEs ORELSE' |
|
77 resolve_tac split_connectI ORELSE' |
|
78 Splitter.split_asm_tac (split_if_asm :: split_asms) ORELSE' |
|
79 Splitter.split_tac (split_if :: splits) ORELSE' |
|
80 eresolve_tac (map (fn thm => thm RS neq_eq_eq_contradict) distincts) THEN' atac ORELSE' |
|
81 etac notE THEN' atac ORELSE' |
|
82 (CHANGED o SELECT_GOAL (unfold_thms_tac ctxt |
|
83 (@{thms id_apply o_def split_def sum.cases} @ maps @ map_comps @ map_idents))))); |
|
84 |
|
85 fun mk_primcorec_ctr_of_dtr_tac ctxt m collapse maybe_disc_f sel_fs = |
|
86 HEADGOAL (rtac ((if null sel_fs then collapse else collapse RS sym) RS trans) THEN' |
|
87 (the_default (K all_tac) (Option.map rtac maybe_disc_f)) THEN' REPEAT_DETERM_N m o atac) THEN |
|
88 unfold_thms_tac ctxt sel_fs THEN HEADGOAL (rtac refl); |
|
89 |
|
90 (* TODO: reduce code duplication with selector tactic above *) |
|
91 fun mk_primcorec_raw_code_of_ctr_single_tac ctxt distincts discIs splits split_asms m f_ctr = |
|
92 HEADGOAL (REPEAT o (resolve_tac split_connectI ORELSE' split_tac (split_if :: splits))) THEN |
|
93 mk_primcorec_prelude ctxt [] (f_ctr RS trans) THEN |
|
94 HEADGOAL ((REPEAT_DETERM_N m o mk_primcorec_assumption_tac ctxt discIs) THEN' |
|
95 SELECT_GOAL (SOLVE (HEADGOAL (REPEAT_DETERM o |
|
96 (rtac refl ORELSE' atac ORELSE' |
|
97 resolve_tac split_connectI ORELSE' |
|
98 Splitter.split_asm_tac (split_if_asm :: split_asms) ORELSE' |
|
99 Splitter.split_tac (split_if :: splits) ORELSE' |
|
100 mk_primcorec_assumption_tac ctxt discIs ORELSE' |
|
101 eresolve_tac (map (fn thm => thm RS neq_eq_eq_contradict) distincts) THEN' atac ORELSE' |
|
102 (TRY o dresolve_tac discIs) THEN' etac notE THEN' atac))))); |
|
103 |
|
104 fun mk_primcorec_raw_code_of_ctr_tac ctxt distincts discIs splits split_asms ms ctr_thms = |
|
105 EVERY (map2 (mk_primcorec_raw_code_of_ctr_single_tac ctxt distincts discIs splits split_asms) |
|
106 ms ctr_thms); |
|
107 |
|
108 fun mk_primcorec_code_of_raw_code_tac splits raw = |
|
109 HEADGOAL (rtac raw ORELSE' rtac (raw RS trans) THEN' REPEAT_DETERM o |
|
110 (rtac refl ORELSE' |
|
111 (TRY o rtac sym) THEN' atac ORELSE' |
|
112 resolve_tac split_connectI ORELSE' |
|
113 Splitter.split_tac (split_if :: splits) ORELSE' |
|
114 etac notE THEN' atac)); |
|
115 |
|
116 end; |
|