author | paulson |
Fri, 21 Apr 2000 11:28:18 +0200 | |
changeset 8756 | b03a0b219139 |
parent 8601 | 8fb3a81b4ccf |
child 9315 | f793f05024f6 |
permissions | -rw-r--r-- |
5177 | 1 |
(* Title: HOL/Tools/datatype_abs_proofs.ML |
2 |
ID: $Id$ |
|
3 |
Author: Stefan Berghofer |
|
4 |
Copyright 1998 TU Muenchen |
|
5 |
||
6 |
Proofs and defintions independent of concrete representation |
|
7 |
of datatypes (i.e. requiring only abstract properties such as |
|
8 |
injectivity / distinctness of constructors and induction) |
|
9 |
||
10 |
- case distinction (exhaustion) theorems |
|
11 |
- characteristic equations for primrec combinators |
|
12 |
- characteristic equations for case combinators |
|
13 |
- equations for splitting "P (case ...)" expressions |
|
14 |
- datatype size function |
|
15 |
- "nchotomy" and "case_cong" theorems for TFL |
|
16 |
||
17 |
*) |
|
18 |
||
19 |
signature DATATYPE_ABS_PROOFS = |
|
20 |
sig |
|
21 |
val prove_casedist_thms : string list -> (int * (string * DatatypeAux.dtyp list * |
|
22 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
|
8436 | 23 |
thm -> theory attribute list -> theory -> theory * thm list |
5661 | 24 |
val prove_primrec_thms : bool -> string list -> (int * (string * DatatypeAux.dtyp list * |
5177 | 25 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
26 |
DatatypeAux.datatype_info Symtab.table -> thm list list -> thm list list -> |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
27 |
simpset -> thm -> theory -> theory * (string list * thm list) |
5661 | 28 |
val prove_case_thms : bool -> string list -> (int * (string * DatatypeAux.dtyp list * |
5177 | 29 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
8436 | 30 |
string list -> thm list -> theory -> theory * (thm list list * string list) |
5177 | 31 |
val prove_split_thms : string list -> (int * (string * DatatypeAux.dtyp list * |
32 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
|
33 |
thm list list -> thm list list -> thm list -> thm list list -> theory -> |
|
34 |
theory * (thm * thm) list |
|
5661 | 35 |
val prove_size_thms : bool -> string list -> (int * (string * DatatypeAux.dtyp list * |
5177 | 36 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
37 |
string list -> thm list -> theory -> theory * thm list |
|
38 |
val prove_nchotomys : string list -> (int * (string * DatatypeAux.dtyp list * |
|
39 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
|
40 |
thm list -> theory -> theory * thm list |
|
8601 | 41 |
val prove_weak_case_congs : string list -> (int * (string * DatatypeAux.dtyp list * |
42 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
|
43 |
theory -> theory * thm list |
|
5177 | 44 |
val prove_case_congs : string list -> (int * (string * DatatypeAux.dtyp list * |
45 |
(string * DatatypeAux.dtyp list) list)) list list -> (string * sort) list -> |
|
46 |
thm list -> thm list list -> theory -> theory * thm list |
|
47 |
end; |
|
48 |
||
8436 | 49 |
structure DatatypeAbsProofs: DATATYPE_ABS_PROOFS = |
5177 | 50 |
struct |
51 |
||
52 |
open DatatypeAux; |
|
53 |
||
6394 | 54 |
val thin = read_instantiate_sg (Theory.sign_of Set.thy) [("V", "?X : ?Y")] thin_rl; |
5177 | 55 |
|
56 |
val (_ $ (_ $ (_ $ (distinct_f $ _) $ _))) = hd (prems_of distinct_lemma); |
|
57 |
||
58 |
(************************ case distinction theorems ***************************) |
|
59 |
||
8436 | 60 |
fun prove_casedist_thms new_type_names descr sorts induct case_names_exhausts thy = |
5177 | 61 |
let |
6427 | 62 |
val _ = message "Proving case distinction theorems ..."; |
5177 | 63 |
|
64 |
val descr' = flat descr; |
|
65 |
val recTs = get_rec_types descr' sorts; |
|
66 |
val newTs = take (length (hd descr), recTs); |
|
67 |
||
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
68 |
val {maxidx, ...} = rep_thm induct; |
8305 | 69 |
val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct))); |
5177 | 70 |
|
71 |
fun prove_casedist_thm ((i, t), T) = |
|
72 |
let |
|
73 |
val dummyPs = map (fn (Var (_, Type (_, [T', T'']))) => |
|
74 |
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
|
75 |
val P = Abs ("z", T, HOLogic.imp $ HOLogic.mk_eq (Var (("a", maxidx+1), T), Bound 0) $ |
5177 | 76 |
Var (("P", 0), HOLogic.boolT)) |
77 |
val insts = take (i, dummyPs) @ (P::(drop (i + 1, dummyPs))); |
|
6394 | 78 |
val cert = cterm_of (Theory.sign_of thy); |
5177 | 79 |
val insts' = (map cert induct_Ps) ~~ (map cert insts); |
80 |
val induct' = refl RS ((nth_elem (i, |
|
81 |
split_conj_thm (cterm_instantiate insts' induct))) RSN (2, rev_mp)) |
|
82 |
||
83 |
in prove_goalw_cterm [] (cert t) (fn prems => |
|
84 |
[rtac induct' 1, |
|
85 |
REPEAT (rtac TrueI 1), |
|
86 |
REPEAT ((rtac impI 1) THEN (eresolve_tac prems 1)), |
|
87 |
REPEAT (rtac TrueI 1)]) |
|
88 |
end; |
|
89 |
||
90 |
val casedist_thms = map prove_casedist_thm ((0 upto (length newTs - 1)) ~~ |
|
91 |
(DatatypeProp.make_casedists descr sorts) ~~ newTs) |
|
8436 | 92 |
in thy |> store_thms_atts "exhaust" new_type_names (map single case_names_exhausts) casedist_thms end; |
5177 | 93 |
|
94 |
||
95 |
(*************************** primrec combinators ******************************) |
|
96 |
||
5661 | 97 |
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
|
98 |
(dt_info : datatype_info Symtab.table) constr_inject dist_rewrites dist_ss induct thy = |
5177 | 99 |
let |
6427 | 100 |
val _ = message "Constructing primrec combinators ..."; |
5661 | 101 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
102 |
val fun_rel_comp_name = Sign.intern_const (sign_of Relation.thy) "fun_rel_comp"; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
103 |
val [fun_rel_comp_def, o_def] = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
104 |
map (get_thm Relation.thy) ["fun_rel_comp_def", "o_def"]; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
105 |
|
5661 | 106 |
val big_name = space_implode "_" new_type_names; |
107 |
val thy0 = add_path flat_names big_name thy; |
|
5177 | 108 |
|
109 |
val descr' = flat descr; |
|
110 |
val recTs = get_rec_types descr' sorts; |
|
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
111 |
val used = foldr add_typ_tfree_names (recTs, []); |
5177 | 112 |
val newTs = take (length (hd descr), recTs); |
113 |
||
8305 | 114 |
val induct_Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct))); |
5177 | 115 |
|
5661 | 116 |
val big_rec_name' = big_name ^ "_rec_set"; |
6394 | 117 |
val rec_set_names = map (Sign.full_name (Theory.sign_of thy0)) |
5177 | 118 |
(if length descr' = 1 then [big_rec_name'] else |
119 |
(map ((curry (op ^) (big_rec_name' ^ "_")) o string_of_int) |
|
120 |
(1 upto (length descr')))); |
|
121 |
||
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
122 |
val rec_result_Ts = map TFree (variantlist (replicate (length descr') "'t", used) ~~ |
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
123 |
replicate (length descr') HOLogic.termS); |
5177 | 124 |
|
125 |
val reccomb_fn_Ts = flat (map (fn (i, (_, _, constrs)) => |
|
126 |
map (fn (_, cargs) => |
|
127 |
let |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
128 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
129 |
val recs = filter (is_rec_type o fst) (cargs ~~ Ts); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
130 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
131 |
fun mk_argT (DtRec k, _) = nth_elem (k, rec_result_Ts) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
132 |
| mk_argT (DtType ("fun", [_, DtRec k]), Type ("fun", [T, _])) = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
133 |
T --> nth_elem (k, rec_result_Ts); |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
134 |
|
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
135 |
val argTs = Ts @ map mk_argT recs |
5177 | 136 |
in argTs ---> nth_elem (i, rec_result_Ts) |
137 |
end) constrs) descr'); |
|
138 |
||
139 |
val rec_set_Ts = map (fn (T1, T2) => reccomb_fn_Ts ---> HOLogic.mk_setT |
|
140 |
(HOLogic.mk_prodT (T1, T2))) (recTs ~~ rec_result_Ts); |
|
141 |
||
142 |
val rec_fns = map (uncurry (mk_Free "f")) |
|
143 |
(reccomb_fn_Ts ~~ (1 upto (length reccomb_fn_Ts))); |
|
144 |
val rec_sets = map (fn c => list_comb (Const c, rec_fns)) |
|
145 |
(rec_set_names ~~ rec_set_Ts); |
|
146 |
||
147 |
(* introduction rules for graph of primrec function *) |
|
148 |
||
149 |
fun make_rec_intr T set_name ((rec_intr_ts, l), (cname, cargs)) = |
|
150 |
let |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
151 |
fun mk_prem ((dt, U), (j, k, prems, t1s, t2s)) = |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
152 |
let val free1 = mk_Free "x" U j |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
153 |
in (case (dt, U) of |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
154 |
(DtRec m, _) => |
5177 | 155 |
let val free2 = mk_Free "y" (nth_elem (m, rec_result_Ts)) k |
156 |
in (j + 1, k + 1, (HOLogic.mk_Trueprop (HOLogic.mk_mem |
|
157 |
(HOLogic.mk_prod (free1, free2), nth_elem (m, rec_sets))))::prems, |
|
158 |
free1::t1s, free2::t2s) |
|
159 |
end |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
160 |
| (DtType ("fun", [_, DtRec m]), U' as Type ("fun", [T', _])) => |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
161 |
let val free2 = mk_Free "y" (T' --> nth_elem (m, rec_result_Ts)) k |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
162 |
in (j + 1, k + 1, (HOLogic.mk_Trueprop (HOLogic.mk_mem (free2, |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
163 |
Const (fun_rel_comp_name, [U', snd (strip_type (nth_elem (m, rec_set_Ts)))] ---> |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
164 |
HOLogic.mk_setT (T' --> nth_elem (m, rec_result_Ts))) $ |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
165 |
free1 $ nth_elem (m, rec_sets))))::prems, free1::t1s, free2::t2s) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
166 |
end |
5177 | 167 |
| _ => (j + 1, k, prems, free1::t1s, t2s)) |
168 |
end; |
|
169 |
||
170 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
171 |
val (_, _, prems, t1s, t2s) = foldr mk_prem (cargs ~~ Ts, (1, 1, [], [], [])) |
5177 | 172 |
|
173 |
in (rec_intr_ts @ [Logic.list_implies (prems, HOLogic.mk_Trueprop (HOLogic.mk_mem |
|
174 |
(HOLogic.mk_prod (list_comb (Const (cname, Ts ---> T), t1s), |
|
175 |
list_comb (nth_elem (l, rec_fns), t1s @ t2s)), set_name)))], l + 1) |
|
176 |
end; |
|
177 |
||
178 |
val (rec_intr_ts, _) = foldl (fn (x, ((d, T), set_name)) => |
|
179 |
foldl (make_rec_intr T set_name) (x, #3 (snd d))) |
|
180 |
(([], 0), descr' ~~ recTs ~~ rec_sets); |
|
181 |
||
182 |
val (thy1, {intrs = rec_intrs, elims = rec_elims, ...}) = |
|
5661 | 183 |
setmp InductivePackage.quiet_mode (!quiet_mode) |
184 |
(InductivePackage.add_inductive_i false true big_rec_name' false false true |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
185 |
rec_sets [] (map (fn x => (("", x), [])) rec_intr_ts) [fun_rel_comp_mono] []) thy0; |
5177 | 186 |
|
187 |
(* prove uniqueness and termination of primrec combinators *) |
|
188 |
||
6427 | 189 |
val _ = message "Proving termination and uniqueness of primrec functions ..."; |
5177 | 190 |
|
191 |
fun mk_unique_tac ((tac, intrs), ((((i, (tname, _, constrs)), elim), T), T')) = |
|
192 |
let |
|
193 |
val distinct_tac = (etac Pair_inject 1) THEN |
|
194 |
(if i < length newTs then |
|
195 |
full_simp_tac (HOL_ss addsimps (nth_elem (i, dist_rewrites))) 1 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
196 |
else full_simp_tac dist_ss 1); |
5177 | 197 |
|
198 |
val inject = map (fn r => r RS iffD1) |
|
199 |
(if i < length newTs then nth_elem (i, constr_inject) |
|
200 |
else #inject (the (Symtab.lookup (dt_info, tname)))); |
|
201 |
||
202 |
fun mk_unique_constr_tac n ((tac, intr::intrs, j), (cname, cargs)) = |
|
203 |
let |
|
204 |
val k = length (filter is_rec_type cargs) |
|
205 |
||
206 |
in (EVERY [DETERM tac, |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
207 |
REPEAT (dtac fun_rel_comp_unique 1), |
5177 | 208 |
REPEAT (etac ex1E 1), rtac ex1I 1, |
209 |
DEPTH_SOLVE_1 (ares_tac [intr] 1), |
|
210 |
REPEAT_DETERM_N k (etac thin 1), |
|
211 |
etac elim 1, |
|
212 |
REPEAT_DETERM_N j distinct_tac, |
|
213 |
etac Pair_inject 1, TRY (dresolve_tac inject 1), |
|
214 |
REPEAT (etac conjE 1), hyp_subst_tac 1, |
|
215 |
REPEAT (etac allE 1), |
|
216 |
REPEAT (dtac mp 1 THEN atac 1), |
|
217 |
TRY (hyp_subst_tac 1), |
|
218 |
rtac refl 1, |
|
219 |
REPEAT_DETERM_N (n - j - 1) distinct_tac], |
|
220 |
intrs, j + 1) |
|
221 |
end; |
|
222 |
||
223 |
val (tac', intrs', _) = foldl (mk_unique_constr_tac (length constrs)) |
|
224 |
((tac, intrs, 0), constrs); |
|
225 |
||
226 |
in (tac', intrs') end; |
|
227 |
||
228 |
val rec_unique_thms = |
|
229 |
let |
|
230 |
val rec_unique_ts = map (fn (((set_t, T1), T2), i) => |
|
231 |
Const ("Ex1", (T2 --> HOLogic.boolT) --> HOLogic.boolT) $ |
|
232 |
absfree ("y", T2, HOLogic.mk_mem (HOLogic.mk_prod |
|
233 |
(mk_Free "x" T1 i, Free ("y", T2)), set_t))) |
|
234 |
(rec_sets ~~ recTs ~~ rec_result_Ts ~~ (1 upto length recTs)); |
|
6394 | 235 |
val cert = cterm_of (Theory.sign_of thy1) |
5177 | 236 |
val insts = map (fn ((i, T), t) => absfree ("x" ^ (string_of_int i), T, t)) |
237 |
((1 upto length recTs) ~~ recTs ~~ rec_unique_ts); |
|
238 |
val induct' = cterm_instantiate ((map cert induct_Ps) ~~ |
|
239 |
(map cert insts)) induct; |
|
240 |
val (tac, _) = foldl mk_unique_tac |
|
241 |
((rtac induct' 1, rec_intrs), descr' ~~ rec_elims ~~ recTs ~~ rec_result_Ts) |
|
242 |
||
243 |
in split_conj_thm (prove_goalw_cterm [] |
|
244 |
(cert (HOLogic.mk_Trueprop (mk_conj rec_unique_ts))) (K [tac])) |
|
245 |
end; |
|
246 |
||
247 |
val rec_total_thms = map (fn r => |
|
248 |
r RS ex1_implies_ex RS (select_eq_Ex RS iffD2)) rec_unique_thms; |
|
249 |
||
250 |
(* define primrec combinators *) |
|
251 |
||
252 |
val big_reccomb_name = (space_implode "_" new_type_names) ^ "_rec"; |
|
6394 | 253 |
val reccomb_names = map (Sign.full_name (Theory.sign_of thy1)) |
5177 | 254 |
(if length descr' = 1 then [big_reccomb_name] else |
255 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
|
256 |
(1 upto (length descr')))); |
|
257 |
val reccombs = map (fn ((name, T), T') => list_comb |
|
258 |
(Const (name, reccomb_fn_Ts @ [T] ---> T'), rec_fns)) |
|
259 |
(reccomb_names ~~ recTs ~~ rec_result_Ts); |
|
260 |
||
8436 | 261 |
val (thy2, reccomb_defs) = thy1 |> |
5177 | 262 |
Theory.add_consts_i (map (fn ((name, T), T') => |
263 |
(Sign.base_name name, reccomb_fn_Ts @ [T] ---> T', NoSyn)) |
|
264 |
(reccomb_names ~~ recTs ~~ rec_result_Ts)) |> |
|
7904 | 265 |
(PureThy.add_defs_i o map Thm.no_attributes) (map (fn ((((name, comb), set), T), T') => |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
266 |
((Sign.base_name name) ^ "_def", Logic.mk_equals (comb, absfree ("x", T, |
5177 | 267 |
Const ("Eps", (T' --> HOLogic.boolT) --> T') $ absfree ("y", T', |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
268 |
HOLogic.mk_mem (HOLogic.mk_prod (Free ("x", T), Free ("y", T')), set)))))) |
8436 | 269 |
(reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts)) |>> |
5661 | 270 |
parent_path flat_names; |
5177 | 271 |
|
272 |
||
273 |
(* prove characteristic equations for primrec combinators *) |
|
274 |
||
6427 | 275 |
val _ = message "Proving characteristic theorems for primrec combinators ..." |
5177 | 276 |
|
277 |
val rec_thms = map (fn t => prove_goalw_cterm reccomb_defs |
|
6394 | 278 |
(cterm_of (Theory.sign_of thy2) t) (fn _ => |
5177 | 279 |
[rtac select1_equality 1, |
280 |
resolve_tac rec_unique_thms 1, |
|
281 |
resolve_tac rec_intrs 1, |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
282 |
rewrite_goals_tac [o_def, fun_rel_comp_def], |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
283 |
REPEAT ((rtac CollectI 1 THEN rtac allI 1) ORELSE resolve_tac rec_total_thms 1)])) |
5177 | 284 |
(DatatypeProp.make_primrecs new_type_names descr sorts thy2) |
285 |
||
286 |
in |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
287 |
thy2 |> Theory.add_path (space_implode "_" new_type_names) |> |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
288 |
PureThy.add_thmss [(("recs", rec_thms), [])] |>> |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
289 |
Theory.parent_path |> apsnd (pair reccomb_names o flat) |
5177 | 290 |
end; |
291 |
||
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
292 |
|
5177 | 293 |
(***************************** case combinators *******************************) |
294 |
||
5661 | 295 |
fun prove_case_thms flat_names new_type_names descr sorts reccomb_names primrec_thms thy = |
5177 | 296 |
let |
6427 | 297 |
val _ = message "Proving characteristic theorems for case combinators ..."; |
5661 | 298 |
|
299 |
val thy1 = add_path flat_names (space_implode "_" new_type_names) thy; |
|
5177 | 300 |
|
301 |
val descr' = flat descr; |
|
302 |
val recTs = get_rec_types descr' sorts; |
|
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
303 |
val used = foldr add_typ_tfree_names (recTs, []); |
5177 | 304 |
val newTs = take (length (hd descr), recTs); |
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
305 |
val T' = TFree (variant used "'t", HOLogic.termS); |
5177 | 306 |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
307 |
fun mk_dummyT (DtRec _) = T' |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
308 |
| mk_dummyT (DtType ("fun", [T, _])) = typ_of_dtyp descr' sorts T --> T' |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
309 |
|
5177 | 310 |
val case_dummy_fns = map (fn (_, (_, _, constrs)) => map (fn (_, cargs) => |
311 |
let |
|
312 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
313 |
val Ts' = map mk_dummyT (filter is_rec_type cargs) |
5578
7de426cf179c
Package now chooses type variable names more carefully to
berghofe
parents:
5553
diff
changeset
|
314 |
in Const ("arbitrary", Ts @ Ts' ---> T') |
5177 | 315 |
end) constrs) descr'; |
316 |
||
317 |
val case_names = map (fn s => |
|
6394 | 318 |
Sign.full_name (Theory.sign_of thy1) (s ^ "_case")) new_type_names; |
5177 | 319 |
|
320 |
(* define case combinators via primrec combinators *) |
|
321 |
||
322 |
val (case_defs, thy2) = foldl (fn ((defs, thy), |
|
323 |
((((i, (_, _, constrs)), T), name), recname)) => |
|
324 |
let |
|
325 |
val (fns1, fns2) = ListPair.unzip (map (fn ((_, cargs), j) => |
|
326 |
let |
|
327 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
328 |
val Ts' = Ts @ map mk_dummyT (filter is_rec_type cargs); |
5177 | 329 |
val frees' = map (uncurry (mk_Free "x")) (Ts' ~~ (1 upto length Ts')); |
330 |
val frees = take (length cargs, frees'); |
|
331 |
val free = mk_Free "f" (Ts ---> T') j |
|
332 |
in |
|
333 |
(free, list_abs_free (map dest_Free frees', |
|
334 |
list_comb (free, frees))) |
|
335 |
end) (constrs ~~ (1 upto length constrs))); |
|
336 |
||
337 |
val caseT = (map (snd o dest_Free) fns1) @ [T] ---> T'; |
|
338 |
val fns = (flat (take (i, case_dummy_fns))) @ |
|
339 |
fns2 @ (flat (drop (i + 1, case_dummy_fns))); |
|
340 |
val reccomb = Const (recname, (map fastype_of fns) @ [T] ---> T'); |
|
341 |
val decl = (Sign.base_name name, caseT, NoSyn); |
|
342 |
val def = ((Sign.base_name name) ^ "_def", |
|
343 |
Logic.mk_equals (list_comb (Const (name, caseT), fns1), |
|
344 |
list_comb (reccomb, (flat (take (i, case_dummy_fns))) @ |
|
345 |
fns2 @ (flat (drop (i + 1, case_dummy_fns))) ))); |
|
8436 | 346 |
val (thy', [def_thm]) = thy |> |
7904 | 347 |
Theory.add_consts_i [decl] |> (PureThy.add_defs_i o map Thm.no_attributes) [def]; |
5177 | 348 |
|
8436 | 349 |
in (defs @ [def_thm], thy') |
5661 | 350 |
end) (([], thy1), (hd descr) ~~ newTs ~~ case_names ~~ |
5177 | 351 |
(take (length newTs, reccomb_names))); |
352 |
||
353 |
val case_thms = map (map (fn t => prove_goalw_cterm (case_defs @ |
|
6394 | 354 |
(map mk_meta_eq primrec_thms)) (cterm_of (Theory.sign_of thy2) t) |
5177 | 355 |
(fn _ => [rtac refl 1]))) |
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
356 |
(DatatypeProp.make_cases new_type_names descr sorts thy2) |
5177 | 357 |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
358 |
in |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
359 |
thy2 |> Theory.add_trrules_i |
5661 | 360 |
(DatatypeProp.make_case_trrules new_type_names descr) |> |
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
361 |
parent_path flat_names |> |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
362 |
store_thmss "cases" new_type_names case_thms |> |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
363 |
apsnd (rpair case_names) |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
364 |
end; |
5177 | 365 |
|
366 |
||
367 |
(******************************* case splitting *******************************) |
|
368 |
||
369 |
fun prove_split_thms new_type_names descr sorts constr_inject dist_rewrites |
|
370 |
casedist_thms case_thms thy = |
|
371 |
let |
|
6427 | 372 |
val _ = message "Proving equations for case splitting ..."; |
5177 | 373 |
|
374 |
val descr' = flat descr; |
|
375 |
val recTs = get_rec_types descr' sorts; |
|
376 |
val newTs = take (length (hd descr), recTs); |
|
377 |
||
378 |
fun prove_split_thms ((((((t1, t2), inject), dist_rewrites'), |
|
379 |
exhaustion), case_thms'), T) = |
|
380 |
let |
|
6394 | 381 |
val cert = cterm_of (Theory.sign_of thy); |
5177 | 382 |
val _ $ (_ $ lhs $ _) = hd (Logic.strip_assums_hyp (hd (prems_of exhaustion))); |
383 |
val exhaustion' = cterm_instantiate |
|
384 |
[(cert lhs, cert (Free ("x", T)))] exhaustion; |
|
385 |
val tacsf = K [rtac exhaustion' 1, ALLGOALS (asm_simp_tac |
|
386 |
(HOL_ss addsimps (dist_rewrites' @ inject @ case_thms')))] |
|
387 |
in |
|
388 |
(prove_goalw_cterm [] (cert t1) tacsf, |
|
389 |
prove_goalw_cterm [] (cert t2) tacsf) |
|
390 |
end; |
|
391 |
||
392 |
val split_thm_pairs = map prove_split_thms |
|
393 |
((DatatypeProp.make_splits new_type_names descr sorts thy) ~~ constr_inject ~~ |
|
394 |
dist_rewrites ~~ casedist_thms ~~ case_thms ~~ newTs); |
|
395 |
||
396 |
val (split_thms, split_asm_thms) = ListPair.unzip split_thm_pairs |
|
397 |
||
398 |
in |
|
8436 | 399 |
thy |> store_thms "split" new_type_names split_thms |>>> |
400 |
store_thms "split_asm" new_type_names split_asm_thms |> apsnd ListPair.zip |
|
5177 | 401 |
end; |
402 |
||
403 |
(******************************* size functions *******************************) |
|
404 |
||
5661 | 405 |
fun prove_size_thms flat_names new_type_names descr sorts reccomb_names primrec_thms thy = |
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
406 |
if exists (fn (_, (_, _, constrs)) => exists (fn (_, cargs) => exists |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
407 |
(fn (DtType ("fun", [_, DtRec _])) => true | _ => false) cargs) constrs) (flat descr) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
408 |
then |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
409 |
(thy, []) |
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
410 |
else |
5177 | 411 |
let |
6427 | 412 |
val _ = message "Proving equations for size function ..."; |
5661 | 413 |
|
414 |
val big_name = space_implode "_" new_type_names; |
|
415 |
val thy1 = add_path flat_names big_name thy; |
|
5177 | 416 |
|
417 |
val descr' = flat descr; |
|
418 |
val recTs = get_rec_types descr' sorts; |
|
419 |
||
420 |
val big_size_name = space_implode "_" new_type_names ^ "_size"; |
|
7015
85be09eb136c
- Datatype package now also supports arbitrarily branching datatypes
berghofe
parents:
6522
diff
changeset
|
421 |
val size_name = Sign.intern_const (Theory.sign_of (theory "Arith")) "size"; |
5177 | 422 |
val size_names = replicate (length (hd descr)) size_name @ |
6394 | 423 |
map (Sign.full_name (Theory.sign_of thy1)) |
5177 | 424 |
(if length (flat (tl descr)) = 1 then [big_size_name] else |
425 |
map (fn i => big_size_name ^ "_" ^ string_of_int i) |
|
426 |
(1 upto length (flat (tl descr)))); |
|
427 |
val def_names = map (fn i => big_size_name ^ "_def_" ^ string_of_int i) |
|
428 |
(1 upto length recTs); |
|
429 |
||
7704 | 430 |
fun plus (t1, t2) = Const ("op +", [HOLogic.natT, HOLogic.natT] ---> HOLogic.natT) $ t1 $ t2; |
5177 | 431 |
|
432 |
fun make_sizefun (_, cargs) = |
|
433 |
let |
|
434 |
val Ts = map (typ_of_dtyp descr' sorts) cargs; |
|
435 |
val k = length (filter is_rec_type cargs); |
|
436 |
val t = if k = 0 then HOLogic.zero else |
|
7704 | 437 |
foldl1 plus (map Bound (k - 1 downto 0) @ [HOLogic.mk_nat 1]) |
5177 | 438 |
in |
439 |
foldr (fn (T, t') => Abs ("x", T, t')) (Ts @ replicate k HOLogic.natT, t) |
|
440 |
end; |
|
441 |
||
442 |
val fs = flat (map (fn (_, (_, _, constrs)) => map make_sizefun constrs) descr'); |
|
443 |
val fTs = map fastype_of fs; |
|
444 |
||
8436 | 445 |
val (thy', size_def_thms) = thy1 |> |
5177 | 446 |
Theory.add_consts_i (map (fn (s, T) => |
447 |
(Sign.base_name s, T --> HOLogic.natT, NoSyn)) |
|
448 |
(drop (length (hd descr), size_names ~~ recTs))) |> |
|
7904 | 449 |
(PureThy.add_defs_i o map Thm.no_attributes) (map (fn (((s, T), def_name), rec_name) => |
5177 | 450 |
(def_name, Logic.mk_equals (Const (s, T --> HOLogic.natT), |
451 |
list_comb (Const (rec_name, fTs @ [T] ---> HOLogic.natT), fs)))) |
|
8436 | 452 |
(size_names ~~ recTs ~~ def_names ~~ reccomb_names)) |>> |
5661 | 453 |
parent_path flat_names; |
5177 | 454 |
|
5553 | 455 |
val rewrites = size_def_thms @ map mk_meta_eq primrec_thms; |
5177 | 456 |
|
457 |
val size_thms = map (fn t => prove_goalw_cterm rewrites |
|
6394 | 458 |
(cterm_of (Theory.sign_of thy') t) (fn _ => [rtac refl 1])) |
5177 | 459 |
(DatatypeProp.make_size new_type_names descr sorts thy') |
460 |
||
461 |
in |
|
8477
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
462 |
thy' |> Theory.add_path big_name |> |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
463 |
PureThy.add_thmss [(("size", size_thms), [])] |>> |
17231d71171a
- Fixed bug in prove_casedist_thms (proof failed because of
berghofe
parents:
8436
diff
changeset
|
464 |
Theory.parent_path |> apsnd flat |
5177 | 465 |
end; |
466 |
||
8601 | 467 |
fun prove_weak_case_congs new_type_names descr sorts thy = |
468 |
let |
|
469 |
fun prove_weak_case_cong t = |
|
470 |
prove_goalw_cterm [] (cterm_of (Theory.sign_of thy) t) |
|
471 |
(fn prems => [rtac ((hd prems) RS arg_cong) 1]) |
|
472 |
||
473 |
val weak_case_congs = map prove_weak_case_cong (DatatypeProp.make_weak_case_congs |
|
474 |
new_type_names descr sorts thy) |
|
475 |
||
476 |
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
|
477 |
|
5177 | 478 |
(************************* additional theorems for TFL ************************) |
479 |
||
480 |
fun prove_nchotomys new_type_names descr sorts casedist_thms thy = |
|
481 |
let |
|
6427 | 482 |
val _ = message "Proving additional theorems for TFL ..."; |
5177 | 483 |
|
484 |
fun prove_nchotomy (t, exhaustion) = |
|
485 |
let |
|
486 |
(* For goal i, select the correct disjunct to attack, then prove it *) |
|
487 |
fun tac i 0 = EVERY [TRY (rtac disjI1 i), |
|
488 |
hyp_subst_tac i, REPEAT (rtac exI i), rtac refl i] |
|
489 |
| tac i n = rtac disjI2 i THEN tac i (n - 1) |
|
490 |
in |
|
6394 | 491 |
prove_goalw_cterm [] (cterm_of (Theory.sign_of thy) t) (fn _ => |
5177 | 492 |
[rtac allI 1, |
493 |
exh_tac (K exhaustion) 1, |
|
494 |
ALLGOALS (fn i => tac i (i-1))]) |
|
495 |
end; |
|
496 |
||
497 |
val nchotomys = |
|
498 |
map prove_nchotomy (DatatypeProp.make_nchotomys descr sorts ~~ casedist_thms) |
|
499 |
||
8436 | 500 |
in thy |> store_thms "nchotomy" new_type_names nchotomys end; |
5177 | 501 |
|
502 |
fun prove_case_congs new_type_names descr sorts nchotomys case_thms thy = |
|
503 |
let |
|
504 |
fun prove_case_cong ((t, nchotomy), case_rewrites) = |
|
505 |
let |
|
506 |
val (Const ("==>", _) $ tm $ _) = t; |
|
507 |
val (Const ("Trueprop", _) $ (Const ("op =", _) $ _ $ Ma)) = tm; |
|
6394 | 508 |
val cert = cterm_of (Theory.sign_of thy); |
5177 | 509 |
val nchotomy' = nchotomy RS spec; |
510 |
val nchotomy'' = cterm_instantiate |
|
511 |
[(cert (hd (add_term_vars (concl_of nchotomy', []))), cert Ma)] nchotomy' |
|
512 |
in |
|
513 |
prove_goalw_cterm [] (cert t) (fn prems => |
|
514 |
let val simplify = asm_simp_tac (HOL_ss addsimps (prems @ case_rewrites)) |
|
515 |
in [simp_tac (HOL_ss addsimps [hd prems]) 1, |
|
516 |
cut_facts_tac [nchotomy''] 1, |
|
517 |
REPEAT (etac disjE 1 THEN REPEAT (etac exE 1) THEN simplify 1), |
|
518 |
REPEAT (etac exE 1) THEN simplify 1 (* Get last disjunct *)] |
|
519 |
end) |
|
520 |
end; |
|
521 |
||
522 |
val case_congs = map prove_case_cong (DatatypeProp.make_case_congs |
|
523 |
new_type_names descr sorts thy ~~ nchotomys ~~ case_thms) |
|
524 |
||
8436 | 525 |
in thy |> store_thms "case_cong" new_type_names case_congs end; |
5177 | 526 |
|
527 |
end; |