author | haftmann |
Tue, 29 Jul 2008 08:15:40 +0200 | |
changeset 27691 | ce171cbd4b93 |
parent 26711 | 3a478bfa1650 |
child 28083 | 103d9282a946 |
permissions | -rw-r--r-- |
5177 | 1 |
(* Title: HOL/Tools/datatype_abs_proofs.ML |
2 |
ID: $Id$ |
|
11539 | 3 |
Author: Stefan Berghofer, TU Muenchen |
5177 | 4 |
|
5 |
Proofs and defintions independent of concrete representation |
|
6 |
of datatypes (i.e. requiring only abstract properties such as |
|
7 |
injectivity / distinctness of constructors and induction) |
|
8 |
||
9 |
- case distinction (exhaustion) theorems |
|
10 |
- characteristic equations for primrec combinators |
|
11 |
- characteristic equations for case combinators |
|
12 |
- equations for splitting "P (case ...)" expressions |
|
24699
c6674504103f
datatype interpretators for size and datatype_realizer
haftmann
parents:
24589
diff
changeset
|
13 |
- "nchotomy" and "case_cong" theorems for TFL |
5177 | 14 |
|
15 |
*) |
|
16 |
||
17 |
signature DATATYPE_ABS_PROOFS = |
|
18 |
sig |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
19 |
val prove_casedist_thms : string list -> |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
20 |
DatatypeAux.descr list -> (string * sort) list -> thm -> |
18728 | 21 |
attribute list -> theory -> thm list * theory |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
22 |
val prove_primrec_thms : bool -> string list -> |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
23 |
DatatypeAux.descr list -> (string * sort) list -> |
5177 | 24 |
DatatypeAux.datatype_info Symtab.table -> thm list list -> thm list list -> |
18314 | 25 |
simpset -> thm -> theory -> (string list * thm list) * theory |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
26 |
val prove_case_thms : bool -> string list -> |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
27 |
DatatypeAux.descr list -> (string * sort) list -> |
18314 | 28 |
string list -> thm list -> theory -> (thm list list * string list) * theory |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
29 |
val prove_split_thms : string list -> |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
30 |
DatatypeAux.descr list -> (string * sort) list -> |
5177 | 31 |
thm list list -> thm list list -> thm list -> thm list list -> theory -> |
18314 | 32 |
(thm * thm) list * theory |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
33 |
val prove_nchotomys : string list -> DatatypeAux.descr list -> |
18314 | 34 |
(string * sort) list -> thm list -> theory -> thm list * theory |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
35 |
val prove_weak_case_congs : string list -> DatatypeAux.descr list -> |
18314 | 36 |
(string * sort) list -> theory -> thm list * theory |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
37 |
val prove_case_congs : string list -> |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
38 |
DatatypeAux.descr list -> (string * sort) list -> |
18314 | 39 |
thm list -> thm list list -> theory -> thm list * theory |
5177 | 40 |
end; |
41 |
||
8436 | 42 |
structure DatatypeAbsProofs: DATATYPE_ABS_PROOFS = |
5177 | 43 |
struct |
44 |
||
45 |
open DatatypeAux; |
|
46 |
||
47 |
(************************ case distinction theorems ***************************) |
|
48 |
||
8436 | 49 |
fun prove_casedist_thms new_type_names descr sorts induct case_names_exhausts thy = |
5177 | 50 |
let |
6427 | 51 |
val _ = message "Proving case distinction theorems ..."; |
5177 | 52 |
|
15570 | 53 |
val descr' = List.concat descr; |
5177 | 54 |
val recTs = get_rec_types descr' sorts; |
15570 | 55 |
val newTs = Library.take (length (hd descr), recTs); |
5177 | 56 |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
57 |
val {maxidx, ...} = rep_thm induct; |
8305 | 58 |
val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct))); |
5177 | 59 |
|
60 |
fun prove_casedist_thm ((i, t), T) = |
|
61 |
let |
|
62 |
val dummyPs = map (fn (Var (_, Type (_, [T', T'']))) => |
|
63 |
Abs ("z", T', Const ("True", T''))) induct_Ps; |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
64 |
val P = Abs ("z", T, HOLogic.imp $ HOLogic.mk_eq (Var (("a", maxidx+1), T), Bound 0) $ |
5177 | 65 |
Var (("P", 0), HOLogic.boolT)) |
15570 | 66 |
val insts = Library.take (i, dummyPs) @ (P::(Library.drop (i + 1, dummyPs))); |
17985 | 67 |
val cert = cterm_of thy; |
5177 | 68 |
val insts' = (map cert induct_Ps) ~~ (map cert insts); |
15570 | 69 |
val induct' = refl RS ((List.nth |
70 |
(split_conj_thm (cterm_instantiate insts' induct), i)) RSN (2, rev_mp)) |
|
5177 | 71 |
|
17985 | 72 |
in |
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
73 |
SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t) |
26711 | 74 |
(fn {prems, ...} => EVERY |
17985 | 75 |
[rtac induct' 1, |
76 |
REPEAT (rtac TrueI 1), |
|
77 |
REPEAT ((rtac impI 1) THEN (eresolve_tac prems 1)), |
|
20046 | 78 |
REPEAT (rtac TrueI 1)]) |
5177 | 79 |
end; |
80 |
||
81 |
val casedist_thms = map prove_casedist_thm ((0 upto (length newTs - 1)) ~~ |
|
82 |
(DatatypeProp.make_casedists descr sorts) ~~ newTs) |
|
18314 | 83 |
in |
84 |
thy |
|
85 |
|> store_thms_atts "exhaust" new_type_names (map single case_names_exhausts) casedist_thms |
|
86 |
end; |
|
5177 | 87 |
|
88 |
||
89 |
(*************************** primrec combinators ******************************) |
|
90 |
||
5661 | 91 |
fun prove_primrec_thms flat_names new_type_names descr sorts |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
92 |
(dt_info : datatype_info Symtab.table) constr_inject dist_rewrites dist_ss induct thy = |
5177 | 93 |
let |
6427 | 94 |
val _ = message "Constructing primrec combinators ..."; |
5661 | 95 |
|
96 |
val big_name = space_implode "_" new_type_names; |
|
97 |
val thy0 = add_path flat_names big_name thy; |
|
5177 | 98 |
|
15570 | 99 |
val descr' = List.concat descr; |
5177 | 100 |
val recTs = get_rec_types descr' sorts; |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
101 |
val used = foldr add_typ_tfree_names [] recTs; |
15570 | 102 |
val newTs = Library.take (length (hd descr), recTs); |
5177 | 103 |
|
8305 | 104 |
val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct))); |
5177 | 105 |
|
5661 | 106 |
val big_rec_name' = big_name ^ "_rec_set"; |
21021 | 107 |
val rec_set_names' = |
108 |
if length descr' = 1 then [big_rec_name'] else |
|
109 |
map ((curry (op ^) (big_rec_name' ^ "_")) o string_of_int) |
|
110 |
(1 upto (length descr')); |
|
22578 | 111 |
val rec_set_names = map (Sign.full_name thy0) rec_set_names'; |
5177 | 112 |
|
15459
16dd63c78049
Introduced function DatatypeProp.make_primrec_Ts to avoid code duplication.
berghofe
parents:
14981
diff
changeset
|
113 |
val (rec_result_Ts, reccomb_fn_Ts) = DatatypeProp.make_primrec_Ts descr sorts used; |
5177 | 114 |
|
21021 | 115 |
val rec_set_Ts = map (fn (T1, T2) => |
116 |
reccomb_fn_Ts @ [T1, T2] ---> HOLogic.boolT) (recTs ~~ rec_result_Ts); |
|
5177 | 117 |
|
118 |
val rec_fns = map (uncurry (mk_Free "f")) |
|
119 |
(reccomb_fn_Ts ~~ (1 upto (length reccomb_fn_Ts))); |
|
21021 | 120 |
val rec_sets' = map (fn c => list_comb (Free c, rec_fns)) |
121 |
(rec_set_names' ~~ rec_set_Ts); |
|
5177 | 122 |
val rec_sets = map (fn c => list_comb (Const c, rec_fns)) |
123 |
(rec_set_names ~~ rec_set_Ts); |
|
124 |
||
125 |
(* introduction rules for graph of primrec function *) |
|
126 |
||
21021 | 127 |
fun make_rec_intr T rec_set ((rec_intr_ts, l), (cname, cargs)) = |
5177 | 128 |
let |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
129 |
fun mk_prem ((dt, U), (j, k, prems, t1s, t2s)) = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
130 |
let val free1 = mk_Free "x" U j |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
131 |
in (case (strip_dtyp dt, strip_type U) of |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
132 |
((_, DtRec m), (Us, _)) => |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
133 |
let |
15570 | 134 |
val free2 = mk_Free "y" (Us ---> List.nth (rec_result_Ts, m)) k; |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
135 |
val i = length Us |
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
136 |
in (j + 1, k + 1, HOLogic.mk_Trueprop (HOLogic.list_all |
21021 | 137 |
(map (pair "x") Us, List.nth (rec_sets', m) $ |
138 |
app_bnds free1 i $ app_bnds free2 i)) :: prems, |
|
5177 | 139 |
free1::t1s, free2::t2s) |
140 |
end |
|
141 |
| _ => (j + 1, k, prems, free1::t1s, t2s)) |
|
142 |
end; |
|
143 |
||
144 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
145 |
val (_, _, prems, t1s, t2s) = foldr mk_prem (1, 1, [], [], []) (cargs ~~ Ts) |
5177 | 146 |
|
21021 | 147 |
in (rec_intr_ts @ [Logic.list_implies (prems, HOLogic.mk_Trueprop |
148 |
(rec_set $ list_comb (Const (cname, Ts ---> T), t1s) $ |
|
149 |
list_comb (List.nth (rec_fns, l), t1s @ t2s)))], l + 1) |
|
5177 | 150 |
end; |
151 |
||
15570 | 152 |
val (rec_intr_ts, _) = Library.foldl (fn (x, ((d, T), set_name)) => |
153 |
Library.foldl (make_rec_intr T set_name) (x, #3 (snd d))) |
|
21021 | 154 |
(([], 0), descr' ~~ recTs ~~ rec_sets'); |
5177 | 155 |
|
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
156 |
val ({intrs = rec_intrs, elims = rec_elims, ...}, thy1) = |
26475
3cc1e48d0ce1
eliminated quiet_mode ref of some packages (avoid CRITICAL setmp!);
wenzelm
parents:
26128
diff
changeset
|
157 |
InductivePackage.add_inductive_global (serial_string ()) |
3cc1e48d0ce1
eliminated quiet_mode ref of some packages (avoid CRITICAL setmp!);
wenzelm
parents:
26128
diff
changeset
|
158 |
{quiet_mode = ! quiet_mode, verbose = false, kind = Thm.internalK, |
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
159 |
alt_name = big_rec_name', coind = false, no_elim = false, no_ind = true, |
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
160 |
skip_mono = true} |
26128 | 161 |
(map (fn (s, T) => ((s, T), NoSyn)) (rec_set_names' ~~ rec_set_Ts)) |
162 |
(map dest_Free rec_fns) |
|
26475
3cc1e48d0ce1
eliminated quiet_mode ref of some packages (avoid CRITICAL setmp!);
wenzelm
parents:
26128
diff
changeset
|
163 |
(map (fn x => (("", []), x)) rec_intr_ts) [] thy0; |
5177 | 164 |
|
165 |
(* prove uniqueness and termination of primrec combinators *) |
|
166 |
||
6427 | 167 |
val _ = message "Proving termination and uniqueness of primrec functions ..."; |
5177 | 168 |
|
169 |
fun mk_unique_tac ((tac, intrs), ((((i, (tname, _, constrs)), elim), T), T')) = |
|
170 |
let |
|
21021 | 171 |
val distinct_tac = |
5177 | 172 |
(if i < length newTs then |
15570 | 173 |
full_simp_tac (HOL_ss addsimps (List.nth (dist_rewrites, i))) 1 |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
174 |
else full_simp_tac dist_ss 1); |
5177 | 175 |
|
176 |
val inject = map (fn r => r RS iffD1) |
|
15570 | 177 |
(if i < length newTs then List.nth (constr_inject, i) |
17412 | 178 |
else #inject (the (Symtab.lookup dt_info tname))); |
5177 | 179 |
|
180 |
fun mk_unique_constr_tac n ((tac, intr::intrs, j), (cname, cargs)) = |
|
181 |
let |
|
15570 | 182 |
val k = length (List.filter is_rec_type cargs) |
5177 | 183 |
|
184 |
in (EVERY [DETERM tac, |
|
185 |
REPEAT (etac ex1E 1), rtac ex1I 1, |
|
186 |
DEPTH_SOLVE_1 (ares_tac [intr] 1), |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
187 |
REPEAT_DETERM_N k (etac thin_rl 1 THEN rotate_tac 1 1), |
5177 | 188 |
etac elim 1, |
189 |
REPEAT_DETERM_N j distinct_tac, |
|
21021 | 190 |
TRY (dresolve_tac inject 1), |
5177 | 191 |
REPEAT (etac conjE 1), hyp_subst_tac 1, |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
192 |
REPEAT (EVERY [etac allE 1, dtac mp 1, atac 1]), |
5177 | 193 |
TRY (hyp_subst_tac 1), |
194 |
rtac refl 1, |
|
195 |
REPEAT_DETERM_N (n - j - 1) distinct_tac], |
|
196 |
intrs, j + 1) |
|
197 |
end; |
|
198 |
||
15570 | 199 |
val (tac', intrs', _) = Library.foldl (mk_unique_constr_tac (length constrs)) |
5177 | 200 |
((tac, intrs, 0), constrs); |
201 |
||
202 |
in (tac', intrs') end; |
|
203 |
||
204 |
val rec_unique_thms = |
|
205 |
let |
|
206 |
val rec_unique_ts = map (fn (((set_t, T1), T2), i) => |
|
207 |
Const ("Ex1", (T2 --> HOLogic.boolT) --> HOLogic.boolT) $ |
|
21021 | 208 |
absfree ("y", T2, set_t $ mk_Free "x" T1 i $ Free ("y", T2))) |
209 |
(rec_sets ~~ recTs ~~ rec_result_Ts ~~ (1 upto length recTs)); |
|
17985 | 210 |
val cert = cterm_of thy1 |
5177 | 211 |
val insts = map (fn ((i, T), t) => absfree ("x" ^ (string_of_int i), T, t)) |
212 |
((1 upto length recTs) ~~ recTs ~~ rec_unique_ts); |
|
213 |
val induct' = cterm_instantiate ((map cert induct_Ps) ~~ |
|
214 |
(map cert insts)) induct; |
|
15570 | 215 |
val (tac, _) = Library.foldl mk_unique_tac |
23590
ad95084a5c63
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
22994
diff
changeset
|
216 |
(((rtac induct' THEN_ALL_NEW ObjectLogic.atomize_prems_tac) 1 |
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
217 |
THEN rewtac (mk_meta_eq choice_eq), rec_intrs), |
10911
eb5721204b38
proper induction rule for arbitrarily branching datatype;
wenzelm
parents:
10214
diff
changeset
|
218 |
descr' ~~ rec_elims ~~ recTs ~~ rec_result_Ts); |
5177 | 219 |
|
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
220 |
in split_conj_thm (SkipProof.prove_global thy1 [] [] |
20046 | 221 |
(HOLogic.mk_Trueprop (mk_conj rec_unique_ts)) (K tac)) |
5177 | 222 |
end; |
223 |
||
11435 | 224 |
val rec_total_thms = map (fn r => r RS theI') rec_unique_thms; |
5177 | 225 |
|
226 |
(* define primrec combinators *) |
|
227 |
||
228 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
22578 | 229 |
val reccomb_names = map (Sign.full_name thy1) |
5177 | 230 |
(if length descr' = 1 then [big_reccomb_name] else |
231 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
232 |
(1 upto (length descr')))); |
|
233 |
val reccombs = map (fn ((name, T), T') => list_comb |
|
234 |
(Const (name, reccomb_fn_Ts @ [T] ---> T'), rec_fns)) |
|
235 |
(reccomb_names ~~ recTs ~~ rec_result_Ts); |
|
236 |
||
18358 | 237 |
val (reccomb_defs, thy2) = |
238 |
thy1 |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24699
diff
changeset
|
239 |
|> Sign.add_consts_i (map (fn ((name, T), T') => |
18358 | 240 |
(Sign.base_name name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) |
241 |
(reccomb_names ~~ recTs ~~ rec_result_Ts)) |
|
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
26711
diff
changeset
|
242 |
|> (PureThy.add_defs false o map Thm.no_attributes) (map (fn ((((name, comb), set), T), T') => |
18358 | 243 |
((Sign.base_name name) ^ "_def", Logic.mk_equals (comb, absfree ("x", T, |
11435 | 244 |
Const ("The", (T' --> HOLogic.boolT) --> T') $ absfree ("y", T', |
21021 | 245 |
set $ Free ("x", T) $ Free ("y", T')))))) |
18358 | 246 |
(reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts)) |
247 |
||> parent_path flat_names; |
|
5177 | 248 |
|
249 |
||
250 |
(* prove characteristic equations for primrec combinators *) |
|
251 |
||
6427 | 252 |
val _ = message "Proving characteristic theorems for primrec combinators ..." |
5177 | 253 |
|
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
254 |
val rec_thms = map (fn t => SkipProof.prove_global thy2 [] [] t |
17985 | 255 |
(fn _ => EVERY |
256 |
[rewrite_goals_tac reccomb_defs, |
|
257 |
rtac the1_equality 1, |
|
5177 | 258 |
resolve_tac rec_unique_thms 1, |
259 |
resolve_tac rec_intrs 1, |
|
20046 | 260 |
REPEAT (rtac allI 1 ORELSE resolve_tac rec_total_thms 1)])) |
5177 | 261 |
(DatatypeProp.make_primrecs new_type_names descr sorts thy2) |
262 |
||
263 |
in |
|
18314 | 264 |
thy2 |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24699
diff
changeset
|
265 |
|> Sign.add_path (space_implode "_" new_type_names) |
18377 | 266 |
|> PureThy.add_thmss [(("recs", rec_thms), [])] |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24699
diff
changeset
|
267 |
||> Sign.parent_path |
18314 | 268 |
|-> (fn thms => pair (reccomb_names, Library.flat thms)) |
5177 | 269 |
end; |
270 |
||
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
271 |
|
5177 | 272 |
(***************************** case combinators *******************************) |
273 |
||
5661 | 274 |
fun prove_case_thms flat_names new_type_names descr sorts reccomb_names primrec_thms thy = |
5177 | 275 |
let |
6427 | 276 |
val _ = message "Proving characteristic theorems for case combinators ..."; |
5661 | 277 |
|
278 |
val thy1 = add_path flat_names (space_implode "_" new_type_names) thy; |
|
5177 | 279 |
|
15570 | 280 |
val descr' = List.concat descr; |
5177 | 281 |
val recTs = get_rec_types descr' sorts; |
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset
|
282 |
val used = foldr add_typ_tfree_names [] recTs; |
15570 | 283 |
val newTs = Library.take (length (hd descr), recTs); |
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20046
diff
changeset
|
284 |
val T' = TFree (Name.variant used "'t", HOLogic.typeS); |
5177 | 285 |
|
13641
63d1790a43ed
Reimplemented parts of datatype package dealing with datatypes involving
berghofe
parents:
12910
diff
changeset
|
286 |
fun mk_dummyT dt = binder_types (typ_of_dtyp descr' sorts dt) ---> T'; |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
287 |
|
5177 | 288 |
val case_dummy_fns = map (fn (_, (_, _, constrs)) => map (fn (_, cargs) => |
289 |
let |
|
290 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
15570 | 291 |
val Ts' = map mk_dummyT (List.filter is_rec_type cargs) |
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
292 |
in Const ("arbitrary", Ts @ Ts' ---> T') |
5177 | 293 |
end) constrs) descr'; |
294 |
||
22578 | 295 |
val case_names = map (fn s => Sign.full_name thy1 (s ^ "_case")) new_type_names; |
5177 | 296 |
|
297 |
(* define case combinators via primrec combinators *) |
|
298 |
||
15570 | 299 |
val (case_defs, thy2) = Library.foldl (fn ((defs, thy), |
5177 | 300 |
((((i, (_, _, constrs)), T), name), recname)) => |
301 |
let |
|
302 |
val (fns1, fns2) = ListPair.unzip (map (fn ((_, cargs), j) => |
|
303 |
let |
|
304 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
15570 | 305 |
val Ts' = Ts @ map mk_dummyT (List.filter is_rec_type cargs); |
5177 | 306 |
val frees' = map (uncurry (mk_Free "x")) (Ts' ~~ (1 upto length Ts')); |
15570 | 307 |
val frees = Library.take (length cargs, frees'); |
5177 | 308 |
val free = mk_Free "f" (Ts ---> T') j |
309 |
in |
|
310 |
(free, list_abs_free (map dest_Free frees', |
|
311 |
list_comb (free, frees))) |
|
312 |
end) (constrs ~~ (1 upto length constrs))); |
|
313 |
||
314 |
val caseT = (map (snd o dest_Free) fns1) @ [T] ---> T'; |
|
15570 | 315 |
val fns = (List.concat (Library.take (i, case_dummy_fns))) @ |
316 |
fns2 @ (List.concat (Library.drop (i + 1, case_dummy_fns))); |
|
5177 | 317 |
val reccomb = Const (recname, (map fastype_of fns) @ [T] ---> T'); |
318 |
val decl = (Sign.base_name name, caseT, NoSyn); |
|
319 |
val def = ((Sign.base_name name) ^ "_def", |
|
320 |
Logic.mk_equals (list_comb (Const (name, caseT), fns1), |
|
15570 | 321 |
list_comb (reccomb, (List.concat (Library.take (i, case_dummy_fns))) @ |
322 |
fns2 @ (List.concat (Library.drop (i + 1, case_dummy_fns))) ))); |
|
18358 | 323 |
val ([def_thm], thy') = |
324 |
thy |
|
24959
119793c84647
replaced Sign.add_consts_authentic by Sign.declare_const;
wenzelm
parents:
24814
diff
changeset
|
325 |
|> Sign.declare_const [] decl |> snd |
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
26711
diff
changeset
|
326 |
|> (PureThy.add_defs false o map Thm.no_attributes) [def]; |
5177 | 327 |
|
8436 | 328 |
in (defs @ [def_thm], thy') |
5661 | 329 |
end) (([], thy1), (hd descr) ~~ newTs ~~ case_names ~~ |
15570 | 330 |
(Library.take (length newTs, reccomb_names))); |
5177 | 331 |
|
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
332 |
val case_thms = map (map (fn t => SkipProof.prove_global thy2 [] [] t |
20046 | 333 |
(fn _ => EVERY [rewrite_goals_tac (case_defs @ map mk_meta_eq primrec_thms), rtac refl 1]))) |
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
334 |
(DatatypeProp.make_cases new_type_names descr sorts thy2) |
5177 | 335 |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
336 |
in |
18314 | 337 |
thy2 |
338 |
|> parent_path flat_names |
|
339 |
|> store_thmss "cases" new_type_names case_thms |
|
340 |
|-> (fn thmss => pair (thmss, case_names)) |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
341 |
end; |
5177 | 342 |
|
343 |
||
344 |
(******************************* case splitting *******************************) |
|
345 |
||
346 |
fun prove_split_thms new_type_names descr sorts constr_inject dist_rewrites |
|
347 |
casedist_thms case_thms thy = |
|
348 |
let |
|
6427 | 349 |
val _ = message "Proving equations for case splitting ..."; |
5177 | 350 |
|
15570 | 351 |
val descr' = List.concat descr; |
5177 | 352 |
val recTs = get_rec_types descr' sorts; |
15570 | 353 |
val newTs = Library.take (length (hd descr), recTs); |
5177 | 354 |
|
355 |
fun prove_split_thms ((((((t1, t2), inject), dist_rewrites'), |
|
356 |
exhaustion), case_thms'), T) = |
|
357 |
let |
|
17985 | 358 |
val cert = cterm_of thy; |
5177 | 359 |
val _ $ (_ $ lhs $ _) = hd (Logic.strip_assums_hyp (hd (prems_of exhaustion))); |
360 |
val exhaustion' = cterm_instantiate |
|
361 |
[(cert lhs, cert (Free ("x", T)))] exhaustion; |
|
17985 | 362 |
val tacf = K (EVERY [rtac exhaustion' 1, ALLGOALS (asm_simp_tac |
363 |
(HOL_ss addsimps (dist_rewrites' @ inject @ case_thms')))]) |
|
5177 | 364 |
in |
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
365 |
(SkipProof.prove_global thy [] [] t1 tacf, |
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
366 |
SkipProof.prove_global thy [] [] t2 tacf) |
5177 | 367 |
end; |
368 |
||
369 |
val split_thm_pairs = map prove_split_thms |
|
370 |
((DatatypeProp.make_splits new_type_names descr sorts thy) ~~ constr_inject ~~ |
|
371 |
dist_rewrites ~~ casedist_thms ~~ case_thms ~~ newTs); |
|
372 |
||
373 |
val (split_thms, split_asm_thms) = ListPair.unzip split_thm_pairs |
|
374 |
||
375 |
in |
|
18314 | 376 |
thy |
377 |
|> store_thms "split" new_type_names split_thms |
|
378 |
||>> store_thms "split_asm" new_type_names split_asm_thms |
|
379 |
|-> (fn (thms1, thms2) => pair (thms1 ~~ thms2)) |
|
5177 | 380 |
end; |
381 |
||
8601 | 382 |
fun prove_weak_case_congs new_type_names descr sorts thy = |
383 |
let |
|
384 |
fun prove_weak_case_cong t = |
|
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
385 |
SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t) |
26711 | 386 |
(fn {prems, ...} => EVERY [rtac ((hd prems) RS arg_cong) 1]) |
8601 | 387 |
|
388 |
val weak_case_congs = map prove_weak_case_cong (DatatypeProp.make_weak_case_congs |
|
389 |
new_type_names descr sorts thy) |
|
390 |
||
391 |
in thy |> store_thms "weak_case_cong" new_type_names weak_case_congs end; |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
392 |
|
5177 | 393 |
(************************* additional theorems for TFL ************************) |
394 |
||
395 |
fun prove_nchotomys new_type_names descr sorts casedist_thms thy = |
|
396 |
let |
|
6427 | 397 |
val _ = message "Proving additional theorems for TFL ..."; |
5177 | 398 |
|
399 |
fun prove_nchotomy (t, exhaustion) = |
|
400 |
let |
|
401 |
(* For goal i, select the correct disjunct to attack, then prove it *) |
|
402 |
fun tac i 0 = EVERY [TRY (rtac disjI1 i), |
|
403 |
hyp_subst_tac i, REPEAT (rtac exI i), rtac refl i] |
|
404 |
| tac i n = rtac disjI2 i THEN tac i (n - 1) |
|
405 |
in |
|
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
406 |
SkipProof.prove_global thy [] [] t (fn _ => |
17985 | 407 |
EVERY [rtac allI 1, |
5177 | 408 |
exh_tac (K exhaustion) 1, |
20046 | 409 |
ALLGOALS (fn i => tac i (i-1))]) |
5177 | 410 |
end; |
411 |
||
412 |
val nchotomys = |
|
413 |
map prove_nchotomy (DatatypeProp.make_nchotomys descr sorts ~~ casedist_thms) |
|
414 |
||
8436 | 415 |
in thy |> store_thms "nchotomy" new_type_names nchotomys end; |
5177 | 416 |
|
417 |
fun prove_case_congs new_type_names descr sorts nchotomys case_thms thy = |
|
418 |
let |
|
419 |
fun prove_case_cong ((t, nchotomy), case_rewrites) = |
|
420 |
let |
|
421 |
val (Const ("==>", _) $ tm $ _) = t; |
|
422 |
val (Const ("Trueprop", _) $ (Const ("op =", _) $ _ $ Ma)) = tm; |
|
22578 | 423 |
val cert = cterm_of thy; |
5177 | 424 |
val nchotomy' = nchotomy RS spec; |
425 |
val nchotomy'' = cterm_instantiate |
|
426 |
[(cert (hd (add_term_vars (concl_of nchotomy', []))), cert Ma)] nchotomy' |
|
427 |
in |
|
26531
96e82c7861fa
- use SkipProof.prove_global instead of Goal.prove_global
berghofe
parents:
26475
diff
changeset
|
428 |
SkipProof.prove_global thy [] (Logic.strip_imp_prems t) (Logic.strip_imp_concl t) |
26711 | 429 |
(fn {prems, ...} => |
17985 | 430 |
let val simplify = asm_simp_tac (HOL_ss addsimps (prems @ case_rewrites)) |
431 |
in EVERY [simp_tac (HOL_ss addsimps [hd prems]) 1, |
|
432 |
cut_facts_tac [nchotomy''] 1, |
|
433 |
REPEAT (etac disjE 1 THEN REPEAT (etac exE 1) THEN simplify 1), |
|
434 |
REPEAT (etac exE 1) THEN simplify 1 (* Get last disjunct *)] |
|
20046 | 435 |
end) |
5177 | 436 |
end; |
437 |
||
438 |
val case_congs = map prove_case_cong (DatatypeProp.make_case_congs |
|
439 |
new_type_names descr sorts thy ~~ nchotomys ~~ case_thms) |
|
440 |
||
8436 | 441 |
in thy |> store_thms "case_cong" new_type_names case_congs end; |
5177 | 442 |
|
443 |
end; |