author | traytel |
Fri, 28 Sep 2012 11:31:51 +0200 | |
changeset 49639 | 204bd497aa4c |
parent 49638 | e592e9822ae4 |
child 49642 | 9f884142334c |
permissions | -rw-r--r-- |
49636 | 1 |
(* Title: HOL/BNF/Tools/bnf_fp_def_sugar_tactics.ML |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
2 |
Author: Jasmin Blanchette, TU Muenchen |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
3 |
Copyright 2012 |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
4 |
|
49389 | 5 |
Tactics for datatype and codatatype sugar. |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
6 |
*) |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
7 |
|
49636 | 8 |
signature BNF_FP_DEF_SUGAR_TACTICS = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
9 |
sig |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
10 |
val sum_prod_thms_map: thm list |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
11 |
val sum_prod_thms_set: thm list |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
12 |
val sum_prod_thms_rel: thm list |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
13 |
|
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49127
diff
changeset
|
14 |
val mk_case_tac: Proof.context -> int -> int -> int -> thm -> thm -> thm -> tactic |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
15 |
val mk_coinduct_tac: Proof.context -> thm list -> int -> int list -> thm -> thm list -> |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
16 |
thm list -> thm list -> thm list list -> thm list list list -> thm list list list -> tactic |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
17 |
val mk_corec_like_tac: thm list -> thm list -> thm -> thm -> thm -> Proof.context -> tactic |
49501 | 18 |
val mk_ctor_iff_dtor_tac: Proof.context -> ctyp option list -> cterm -> cterm -> thm -> thm -> |
19 |
tactic |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
20 |
val mk_disc_corec_like_iff_tac: thm list -> thm list -> thm list -> Proof.context -> tactic |
49161
a8e74375d971
fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors
blanchet
parents:
49160
diff
changeset
|
21 |
val mk_exhaust_tac: Proof.context -> int -> thm list -> thm -> thm -> tactic |
49127 | 22 |
val mk_half_distinct_tac: Proof.context -> thm -> thm list -> tactic |
49590 | 23 |
val mk_induct_tac: Proof.context -> int -> int list -> int list list -> int list list list -> |
24 |
thm list -> thm -> thm list -> thm list list -> tactic |
|
49126 | 25 |
val mk_inject_tac: Proof.context -> thm -> thm -> tactic |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
26 |
val mk_rec_like_tac: thm list -> thm list -> thm list -> thm -> thm -> Proof.context -> tactic |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
27 |
end; |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
28 |
|
49636 | 29 |
structure BNF_FP_Def_Sugar_Tactics : BNF_FP_DEF_SUGAR_TACTICS = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
30 |
struct |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
31 |
|
49125 | 32 |
open BNF_Tactics |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
33 |
open BNF_Util |
49457 | 34 |
open BNF_FP |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
35 |
|
49590 | 36 |
val basic_simp_thms = @{thms simp_thms(7,8,12,14,22,24)}; |
37 |
val more_simp_thms = basic_simp_thms @ @{thms simp_thms(11,15,16,21)}; |
|
38 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
39 |
val sum_prod_thms_map = @{thms id_apply map_pair_simp sum_map.simps prod.cases}; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
40 |
val sum_prod_thms_set0 = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
41 |
@{thms SUP_empty Sup_empty Sup_insert UN_insert Un_empty_left Un_empty_right Un_iff |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
42 |
Union_Un_distrib collect_def[abs_def] image_def o_apply map_pair_simp |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
43 |
mem_Collect_eq mem_UN_compreh_eq prod_set_simps sum_map.simps sum_set_simps}; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
44 |
val sum_prod_thms_set = @{thms UN_compreh_eq_eq} @ sum_prod_thms_set0; |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
45 |
val sum_prod_thms_rel = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
46 |
@{thms prod.cases prod_rel_def sum.cases sum_rel_def |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
47 |
sum.inject sum.distinct[THEN eq_False[THEN iffD2]]}; |
49368 | 48 |
|
49590 | 49 |
val ss_if_True_False = ss_only @{thms if_True if_False}; |
49589 | 50 |
|
49590 | 51 |
fun mk_proj T k = |
52 |
let val binders = binder_types T in |
|
53 |
fold_rev (fn T => fn t => Abs (Name.uu, T, t)) binders (Bound (length binders - k)) |
|
54 |
end; |
|
55 |
||
56 |
fun inst_as_projs ctxt k thm = |
|
49368 | 57 |
let |
49384 | 58 |
val fs = |
49368 | 59 |
Term.add_vars (prop_of thm) [] |
60 |
|> filter (fn (_, Type (@{type_name fun}, [_, T'])) => T' <> HOLogic.boolT | _ => false); |
|
49384 | 61 |
val cfs = |
49590 | 62 |
map (fn f as (_, T) => (certify ctxt (Var f), certify ctxt (mk_proj T k))) fs; |
49368 | 63 |
in |
49384 | 64 |
Drule.cterm_instantiate cfs thm |
49368 | 65 |
end; |
66 |
||
49590 | 67 |
val inst_as_projs_tac = PRIMITIVE oo inst_as_projs; |
49368 | 68 |
|
49501 | 69 |
fun mk_case_tac ctxt n k m case_def ctr_def dtor_ctor = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
70 |
unfold_thms_tac ctxt [case_def, ctr_def, dtor_ctor] THEN |
49264 | 71 |
(rtac (mk_sum_casesN_balanced n k RS ssubst) THEN' |
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49127
diff
changeset
|
72 |
REPEAT_DETERM_N (Int.max (0, m - 1)) o rtac (@{thm split} RS ssubst) THEN' |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49127
diff
changeset
|
73 |
rtac refl) 1; |
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49127
diff
changeset
|
74 |
|
49501 | 75 |
fun mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor sumEN' = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
76 |
unfold_thms_tac ctxt (ctor_iff_dtor :: ctr_defs) THEN rtac sumEN' 1 THEN |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
77 |
unfold_thms_tac ctxt @{thms all_prod_eq} THEN |
49368 | 78 |
EVERY' (maps (fn k => [select_prem_tac n (rotate_tac 1) k, REPEAT_DETERM o dtac meta_spec, |
79 |
etac meta_mp, atac]) (1 upto n)) 1; |
|
49125 | 80 |
|
49501 | 81 |
fun mk_ctor_iff_dtor_tac ctxt cTs cctor cdtor ctor_dtor dtor_ctor = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
82 |
(rtac iffI THEN' |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
83 |
EVERY' (map3 (fn cTs => fn cx => fn th => |
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
84 |
dtac (Drule.instantiate' cTs [NONE, NONE, SOME cx] arg_cong) THEN' |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
85 |
SELECT_GOAL (unfold_thms_tac ctxt [th]) THEN' |
49501 | 86 |
atac) [rev cTs, cTs] [cdtor, cctor] [dtor_ctor, ctor_dtor])) 1; |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
87 |
|
49501 | 88 |
fun mk_half_distinct_tac ctxt ctor_inject ctr_defs = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
89 |
unfold_thms_tac ctxt (ctor_inject :: @{thms sum.inject} @ ctr_defs) THEN |
49127 | 90 |
rtac @{thm sum.distinct(1)} 1; |
91 |
||
49501 | 92 |
fun mk_inject_tac ctxt ctr_def ctor_inject = |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
93 |
unfold_thms_tac ctxt [ctr_def] THEN rtac (ctor_inject RS ssubst) 1 THEN |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
94 |
unfold_thms_tac ctxt @{thms sum.inject Pair_eq conj_assoc} THEN rtac refl 1; |
49126 | 95 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
96 |
(*TODO: Try "sum_prod_thms_map" here, enriched with a few theorems*) |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
97 |
val rec_like_unfold_thms = |
49539
be6cbf960aa7
fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents:
49510
diff
changeset
|
98 |
@{thms comp_def convol_def id_apply map_pair_def prod_case_Pair_iden sum.simps(5,6) sum_map.simps |
be6cbf960aa7
fixed bug in "fold" tactic with nested products (beyond the sum of product corresponding to constructors)
blanchet
parents:
49510
diff
changeset
|
99 |
split_conv unit_case_Unity}; |
49205 | 100 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
101 |
fun mk_rec_like_tac pre_map_defs map_ids rec_like_defs ctor_rec_like ctr_def ctxt = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
102 |
unfold_thms_tac ctxt (ctr_def :: ctor_rec_like :: rec_like_defs @ pre_map_defs @ map_ids @ |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
103 |
rec_like_unfold_thms) THEN unfold_thms_tac ctxt @{thms id_def} THEN rtac refl 1; |
49205 | 104 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
105 |
fun mk_corec_like_tac corec_like_defs map_ids ctor_dtor_corec_like pre_map_def ctr_def ctxt = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
106 |
unfold_thms_tac ctxt (ctr_def :: corec_like_defs) THEN |
49638 | 107 |
(rtac (ctor_dtor_corec_like RS trans) THEN' asm_simp_tac ss_if_True_False) 1 THEN |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
108 |
unfold_thms_tac ctxt (pre_map_def :: sum_prod_thms_map @ map_ids) THEN |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
109 |
unfold_thms_tac ctxt @{thms id_def} THEN |
49639 | 110 |
(rtac refl ORELSE' rtac (@{thm unit_eq} RS arg_cong)) 1; |
49213 | 111 |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
112 |
fun mk_disc_corec_like_iff_tac case_splits' corec_likes discs ctxt = |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
113 |
EVERY (map3 (fn case_split_tac => fn corec_like_thm => fn disc => |
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
114 |
case_split_tac 1 THEN unfold_thms_tac ctxt [corec_like_thm] THEN |
49590 | 115 |
asm_simp_tac (ss_only basic_simp_thms) 1 THEN |
49484 | 116 |
(if is_refl disc then all_tac else rtac disc 1)) |
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49501
diff
changeset
|
117 |
(map rtac case_splits' @ [K all_tac]) corec_likes discs); |
49482 | 118 |
|
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
119 |
val solve_prem_prem_tac = |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
120 |
REPEAT o (eresolve_tac @{thms bexE rev_bexI} ORELSE' rtac @{thm rev_bexI[OF UNIV_I]} ORELSE' |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
121 |
hyp_subst_tac ORELSE' resolve_tac @{thms disjI1 disjI2}) THEN' |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
122 |
(rtac refl ORELSE' atac ORELSE' rtac @{thm singletonI}); |
49426 | 123 |
|
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
124 |
fun mk_induct_leverage_prem_prems_tac ctxt nn kks set_natural's pre_set_defs = |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
125 |
EVERY' (maps (fn kk => [select_prem_tac nn (dtac meta_spec) kk, etac meta_mp, |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49542
diff
changeset
|
126 |
SELECT_GOAL (unfold_thms_tac ctxt (pre_set_defs @ set_natural's @ sum_prod_thms_set0)), |
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
127 |
solve_prem_prem_tac]) (rev kks)) 1; |
49368 | 128 |
|
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
129 |
fun mk_induct_discharge_prem_tac ctxt nn n set_natural's pre_set_defs m k kks = |
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
130 |
let val r = length kks in |
49391 | 131 |
EVERY' [select_prem_tac n (rotate_tac 1) k, rotate_tac ~1, hyp_subst_tac, |
132 |
REPEAT_DETERM_N m o (dtac meta_spec THEN' rotate_tac ~1)] 1 THEN |
|
133 |
EVERY [REPEAT_DETERM_N r |
|
134 |
(rotate_tac ~1 1 THEN dtac meta_mp 1 THEN rotate_tac 1 1 THEN prefer_tac 2), |
|
135 |
if r > 0 then PRIMITIVE Raw_Simplifier.norm_hhf else all_tac, atac 1, |
|
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
136 |
mk_induct_leverage_prem_prems_tac ctxt nn kks set_natural's pre_set_defs] |
49391 | 137 |
end; |
49368 | 138 |
|
49590 | 139 |
fun mk_induct_tac ctxt nn ns mss kkss ctr_defs ctor_induct' set_natural's pre_set_defss = |
140 |
let val n = Integer.sum ns in |
|
141 |
unfold_thms_tac ctxt ctr_defs THEN rtac ctor_induct' 1 THEN inst_as_projs_tac ctxt 1 THEN |
|
49376
c6366fd0415a
select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking
blanchet
parents:
49375
diff
changeset
|
142 |
EVERY (map4 (EVERY oooo map3 o mk_induct_discharge_prem_tac ctxt nn n set_natural's) |
49429
64ac3471005a
cleaner way of dealing with the set functions of sums and products
blanchet
parents:
49428
diff
changeset
|
143 |
pre_set_defss mss (unflat mss (1 upto n)) kkss) |
49368 | 144 |
end; |
145 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
146 |
fun mk_coinduct_same_ctr ctxt rel_eqs pre_rel_def dtor_ctor ctr_def discs sels = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
147 |
hyp_subst_tac THEN' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
148 |
subst_tac ctxt (SOME [1, 2]) [ctr_def] THEN' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
149 |
SELECT_GOAL (unfold_thms_tac ctxt (pre_rel_def :: dtor_ctor :: sels @ sum_prod_thms_rel)) THEN' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
150 |
(atac ORELSE' REPEAT o etac conjE THEN' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
151 |
full_simp_tac |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
152 |
(ss_only (@{thm prod.inject} :: no_refl discs @ rel_eqs @ more_simp_thms)) THEN_MAYBE' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
153 |
REPEAT o hyp_subst_tac THEN' REPEAT o rtac conjI THEN' REPEAT o rtac refl); |
49590 | 154 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
155 |
fun mk_coinduct_distinct_ctrs discs discs' = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
156 |
hyp_subst_tac THEN' REPEAT o etac conjE THEN' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
157 |
full_simp_tac (ss_only (refl :: no_refl (discs @ discs') @ basic_simp_thms)); |
49590 | 158 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
159 |
fun mk_coinduct_discharge_prem_tac ctxt rel_eqs' nn kk n pre_rel_def dtor_ctor exhaust ctr_defs |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
160 |
discss selss = |
49590 | 161 |
let val ks = 1 upto n in |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
162 |
EVERY' ([rtac allI, rtac allI, rtac impI, select_prem_tac nn (dtac meta_spec) kk, dtac |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
163 |
meta_spec, dtac meta_mp, atac, rtac exhaust, K (inst_as_projs_tac ctxt 1), hyp_subst_tac] @ |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
164 |
map4 (fn k => fn ctr_def => fn discs => fn sels => |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
165 |
EVERY' ([rtac exhaust, K (inst_as_projs_tac ctxt 2)] @ |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
166 |
map2 (fn k' => fn discs' => |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
167 |
if k' = k then |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
168 |
mk_coinduct_same_ctr ctxt rel_eqs' pre_rel_def dtor_ctor ctr_def discs sels |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
169 |
else |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
170 |
mk_coinduct_distinct_ctrs discs discs') ks discss)) ks ctr_defs discss selss) |
49590 | 171 |
end; |
172 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
173 |
fun mk_coinduct_tac ctxt rel_eqs' nn ns dtor_coinduct' pre_rel_defs dtor_ctors exhausts ctr_defss |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
174 |
discsss selsss = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
175 |
(rtac dtor_coinduct' THEN' |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
176 |
EVERY' (map8 (mk_coinduct_discharge_prem_tac ctxt rel_eqs' nn) |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
177 |
(1 upto nn) ns pre_rel_defs dtor_ctors exhausts ctr_defss discsss selsss)) 1; |
49590 | 178 |
|
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
diff
changeset
|
179 |
end; |