author | blanchet |
Fri, 21 Sep 2012 16:45:06 +0200 | |
changeset 49510 | ba50d204095e |
parent 49509 | src/HOL/Codatatype/Tools/bnf_wrap.ML@163914705f8d |
child 49536 | 898aea2e7a94 |
permissions | -rw-r--r-- |
49509
163914705f8d
renamed top-level theory from "Codatatype" to "BNF"
blanchet
parents:
49504
diff
changeset
|
1 |
(* Title: HOL/BNF/Tools/bnf_wrap.ML |
49017 | 2 |
Author: Jasmin Blanchette, TU Muenchen |
3 |
Copyright 2012 |
|
4 |
||
49074 | 5 |
Wrapping existing datatypes. |
49017 | 6 |
*) |
7 |
||
49074 | 8 |
signature BNF_WRAP = |
49017 | 9 |
sig |
49121 | 10 |
val mk_half_pairss: 'a list -> ('a * 'a) list list |
49203 | 11 |
val mk_ctr: typ list -> term -> term |
49484 | 12 |
val mk_disc_or_sel: typ list -> term -> term |
49437 | 13 |
val base_name_of_ctr: term -> string |
49199 | 14 |
val wrap_datatype: ({prems: thm list, context: Proof.context} -> tactic) list list -> |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
15 |
((bool * term list) * term) * |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
16 |
(binding list * (binding list list * (binding * term) list list)) -> local_theory -> |
49484 | 17 |
(term list * term list list * thm list * thm list * thm list * thm list list * thm list * |
18 |
thm list list) * local_theory |
|
49278 | 19 |
val parse_wrap_options: bool parser |
49286 | 20 |
val parse_bound_term: (binding * string) parser |
49017 | 21 |
end; |
22 |
||
49074 | 23 |
structure BNF_Wrap : BNF_WRAP = |
49017 | 24 |
struct |
25 |
||
26 |
open BNF_Util |
|
49074 | 27 |
open BNF_Wrap_Tactics |
49017 | 28 |
|
49223 | 29 |
val isN = "is_"; |
30 |
val unN = "un_"; |
|
31 |
fun mk_unN 1 1 suf = unN ^ suf |
|
32 |
| mk_unN _ l suf = unN ^ suf ^ string_of_int l; |
|
49046
3c5eba97d93a
allow default names for selectors via wildcard (_) + fix wrong index (k)
blanchet
parents:
49045
diff
changeset
|
33 |
|
49054 | 34 |
val case_congN = "case_cong"; |
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
35 |
val case_eqN = "case_eq"; |
49054 | 36 |
val casesN = "cases"; |
49118 | 37 |
val collapseN = "collapse"; |
49122 | 38 |
val disc_excludeN = "disc_exclude"; |
49054 | 39 |
val disc_exhaustN = "disc_exhaust"; |
40 |
val discsN = "discs"; |
|
41 |
val distinctN = "distinct"; |
|
49075 | 42 |
val exhaustN = "exhaust"; |
49486 | 43 |
val expandN = "expand"; |
49075 | 44 |
val injectN = "inject"; |
45 |
val nchotomyN = "nchotomy"; |
|
49054 | 46 |
val selsN = "sels"; |
47 |
val splitN = "split"; |
|
48 |
val split_asmN = "split_asm"; |
|
49 |
val weak_case_cong_thmsN = "weak_case_cong"; |
|
49019 | 50 |
|
49336 | 51 |
val std_binding = @{binding _}; |
49300 | 52 |
|
53 |
val induct_simp_attrs = @{attributes [induct_simp]}; |
|
54 |
val cong_attrs = @{attributes [cong]}; |
|
55 |
val iff_attrs = @{attributes [iff]}; |
|
56 |
val safe_elim_attrs = @{attributes [elim!]}; |
|
57 |
val simp_attrs = @{attributes [simp]}; |
|
49046
3c5eba97d93a
allow default names for selectors via wildcard (_) + fix wrong index (k)
blanchet
parents:
49045
diff
changeset
|
58 |
|
49056 | 59 |
fun pad_list x n xs = xs @ replicate (n - length xs) x; |
60 |
||
49259 | 61 |
fun unflat_lookup eq ys zs = map (map (fn x => nth zs (find_index (curry eq x) ys))); |
49258
84f13469d7f0
allow same selector name for several constructors
blanchet
parents:
49257
diff
changeset
|
62 |
|
49048
4e0f0f98be02
rationalized data structure for distinctness theorems
blanchet
parents:
49046
diff
changeset
|
63 |
fun mk_half_pairss' _ [] = [] |
49486 | 64 |
| mk_half_pairss' indent (x :: xs) = |
65 |
indent @ fold_rev (cons o single o pair x) xs (mk_half_pairss' ([] :: indent) xs); |
|
66 |
||
67 |
fun mk_half_pairss xs = mk_half_pairss' [[]] xs; |
|
49027 | 68 |
|
49486 | 69 |
fun join_halves n half_xss other_half_xss = |
70 |
let |
|
71 |
val xsss = |
|
72 |
map2 (map2 append) (Library.chop_groups n half_xss) |
|
73 |
(transpose (Library.chop_groups n other_half_xss)) |
|
74 |
val xs = interleave (flat half_xss) (flat other_half_xss); |
|
75 |
in (xs, xsss |> `transpose) end; |
|
49027 | 76 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
77 |
fun mk_undefined T = Const (@{const_name undefined}, T); |
49055 | 78 |
|
49500 | 79 |
fun mk_ctr Ts t = |
80 |
let val Type (_, Ts0) = body_type (fastype_of t) in |
|
81 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
|
49203 | 82 |
end; |
83 |
||
49484 | 84 |
fun mk_disc_or_sel Ts t = |
85 |
Term.subst_atomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t; |
|
86 |
||
49300 | 87 |
fun base_name_of_ctr c = |
88 |
Long_Name.base_name (case head_of c of |
|
89 |
Const (s, _) => s |
|
90 |
| Free (s, _) => s |
|
91 |
| _ => error "Cannot extract name of constructor"); |
|
49046
3c5eba97d93a
allow default names for selectors via wildcard (_) + fix wrong index (k)
blanchet
parents:
49045
diff
changeset
|
92 |
|
49500 | 93 |
fun rapp u t = betapply (t, u); |
49486 | 94 |
|
49437 | 95 |
fun eta_expand_arg xs f_xs = fold_rev Term.lambda xs f_xs; |
96 |
||
49278 | 97 |
fun prepare_wrap_datatype prep_term (((no_dests, raw_ctrs), raw_case), |
49336 | 98 |
(raw_disc_bindings, (raw_sel_bindingss, raw_sel_defaultss))) no_defs_lthy = |
49017 | 99 |
let |
49019 | 100 |
(* TODO: sanity checks on arguments *) |
49113 | 101 |
(* TODO: case syntax *) |
49025 | 102 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
103 |
val n = length raw_ctrs; |
49054 | 104 |
val ks = 1 upto n; |
105 |
||
49121 | 106 |
val _ = if n > 0 then () else error "No constructors specified"; |
107 |
||
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
108 |
val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs; |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
109 |
val case0 = prep_term no_defs_lthy raw_case; |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
110 |
val sel_defaultss = |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
111 |
pad_list [] n (map (map (apsnd (prep_term no_defs_lthy))) raw_sel_defaultss); |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
112 |
|
49300 | 113 |
val Type (dataT_name, As0) = body_type (fastype_of (hd ctrs0)); |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
114 |
val data_b = Binding.qualified_name dataT_name; |
49498 | 115 |
val data_b_name = Binding.name_of data_b; |
49055 | 116 |
|
117 |
val (As, B) = |
|
118 |
no_defs_lthy |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
119 |
|> mk_TFrees' (map Type.sort_of_atyp As0) |
49055 | 120 |
||> the_single o fst o mk_TFrees 1; |
121 |
||
49300 | 122 |
val dataT = Type (dataT_name, As); |
49055 | 123 |
val ctrs = map (mk_ctr As) ctrs0; |
124 |
val ctr_Tss = map (binder_types o fastype_of) ctrs; |
|
125 |
||
126 |
val ms = map length ctr_Tss; |
|
127 |
||
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49364
diff
changeset
|
128 |
val raw_disc_bindings' = pad_list Binding.empty n raw_disc_bindings; |
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
129 |
|
49174
41790d616f63
by default, only generate one discriminator for a two-value datatype
blanchet
parents:
49157
diff
changeset
|
130 |
fun can_really_rely_on_disc k = |
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49364
diff
changeset
|
131 |
not (Binding.eq_name (nth raw_disc_bindings' (k - 1), Binding.empty)) orelse |
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49364
diff
changeset
|
132 |
nth ms (k - 1) = 0; |
49174
41790d616f63
by default, only generate one discriminator for a two-value datatype
blanchet
parents:
49157
diff
changeset
|
133 |
fun can_rely_on_disc k = |
41790d616f63
by default, only generate one discriminator for a two-value datatype
blanchet
parents:
49157
diff
changeset
|
134 |
can_really_rely_on_disc k orelse (k = 1 andalso not (can_really_rely_on_disc 2)); |
49336 | 135 |
fun can_omit_disc_binding k m = |
49174
41790d616f63
by default, only generate one discriminator for a two-value datatype
blanchet
parents:
49157
diff
changeset
|
136 |
n = 1 orelse m = 0 orelse (n = 2 andalso can_rely_on_disc (3 - k)); |
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
137 |
|
49336 | 138 |
val std_disc_binding = |
49498 | 139 |
Binding.qualify false data_b_name o Binding.name o prefix isN o base_name_of_ctr; |
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
140 |
|
49336 | 141 |
val disc_bindings = |
142 |
raw_disc_bindings' |
|
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
143 |
|> map4 (fn k => fn m => fn ctr => fn disc => |
49498 | 144 |
Option.map (Binding.qualify false data_b_name) |
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49364
diff
changeset
|
145 |
(if Binding.eq_name (disc, Binding.empty) then |
49336 | 146 |
if can_omit_disc_binding k m then NONE else SOME (std_disc_binding ctr) |
147 |
else if Binding.eq_name (disc, std_binding) then |
|
148 |
SOME (std_disc_binding ctr) |
|
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
149 |
else |
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
150 |
SOME disc)) ks ms ctrs0; |
49056 | 151 |
|
49336 | 152 |
val no_discs = map is_none disc_bindings; |
49137 | 153 |
val no_discs_at_all = forall I no_discs; |
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
154 |
|
49336 | 155 |
fun std_sel_binding m l = Binding.name o mk_unN m l o base_name_of_ctr; |
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
156 |
|
49336 | 157 |
val sel_bindingss = |
158 |
pad_list [] n raw_sel_bindingss |
|
49056 | 159 |
|> map3 (fn ctr => fn m => map2 (fn l => fn sel => |
49498 | 160 |
Binding.qualify false data_b_name |
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49364
diff
changeset
|
161 |
(if Binding.eq_name (sel, Binding.empty) orelse Binding.eq_name (sel, std_binding) then |
49336 | 162 |
std_sel_binding m l ctr |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
163 |
else |
49434
433dc7e028c8
separated registration of BNFs from bnf_def (BNFs are now stored only for bnf_def and (co)data commands)
traytel
parents:
49364
diff
changeset
|
164 |
sel)) (1 upto m) o pad_list Binding.empty m) ctrs0 ms; |
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
165 |
|
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
166 |
fun mk_case Ts T = |
49121 | 167 |
let |
49336 | 168 |
val (bindings, body) = strip_type (fastype_of case0) |
169 |
val Type (_, Ts0) = List.last bindings |
|
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
170 |
in Term.subst_atomic_types ((body, T) :: (Ts0 ~~ Ts)) case0 end; |
49022 | 171 |
|
49201 | 172 |
val casex = mk_case As B; |
173 |
val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss; |
|
49043 | 174 |
|
49498 | 175 |
val (((((((xss, xss'), yss), fs), gs), [u', v']), (p, p')), names_lthy) = no_defs_lthy |> |
49364
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
176 |
mk_Freess' "x" ctr_Tss |
49025 | 177 |
||>> mk_Freess "y" ctr_Tss |
49201 | 178 |
||>> mk_Frees "f" case_Ts |
179 |
||>> mk_Frees "g" case_Ts |
|
49498 | 180 |
||>> (apfst (map (rpair dataT)) oo Variable.variant_fixes) [data_b_name, data_b_name ^ "'"] |
49043 | 181 |
||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT; |
182 |
||
49498 | 183 |
val u = Free u'; |
184 |
val v = Free v'; |
|
49463 | 185 |
val q = Free (fst p', mk_pred1T B); |
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
186 |
|
49025 | 187 |
val xctrs = map2 (curry Term.list_comb) ctrs xss; |
188 |
val yctrs = map2 (curry Term.list_comb) ctrs yss; |
|
49032 | 189 |
|
49043 | 190 |
val xfs = map2 (curry Term.list_comb) fs xss; |
191 |
val xgs = map2 (curry Term.list_comb) gs xss; |
|
192 |
||
49437 | 193 |
val eta_fs = map2 eta_expand_arg xss xfs; |
194 |
val eta_gs = map2 eta_expand_arg xss xgs; |
|
49043 | 195 |
|
49201 | 196 |
val fcase = Term.list_comb (casex, eta_fs); |
197 |
val gcase = Term.list_comb (casex, eta_gs); |
|
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
198 |
|
49486 | 199 |
val ufcase = fcase $ u; |
200 |
val vfcase = fcase $ v; |
|
201 |
val vgcase = gcase $ v; |
|
202 |
||
203 |
fun mk_u_eq_u () = HOLogic.mk_eq (u, u); |
|
204 |
||
205 |
val u_eq_v = mk_Trueprop_eq (u, v); |
|
206 |
||
207 |
val exist_xs_u_eq_ctrs = |
|
208 |
map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (u, xctr))) xctrs xss; |
|
49022 | 209 |
|
49278 | 210 |
val unique_disc_no_def = TrueI; (*arbitrary marker*) |
211 |
val alternate_disc_no_def = FalseE; (*arbitrary marker*) |
|
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
212 |
|
49486 | 213 |
fun alternate_disc_lhs get_udisc k = |
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
214 |
HOLogic.mk_not |
49336 | 215 |
(case nth disc_bindings (k - 1) of |
49486 | 216 |
NONE => nth exist_xs_u_eq_ctrs (k - 1) |
217 |
| SOME b => get_udisc b (k - 1)); |
|
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
218 |
|
49486 | 219 |
val (all_sels_distinct, discs, selss, udiscs, uselss, vdiscs, vselss, disc_defs, sel_defs, |
220 |
sel_defss, lthy') = |
|
49278 | 221 |
if no_dests then |
49486 | 222 |
(true, [], [], [], [], [], [], [], [], [], no_defs_lthy) |
49278 | 223 |
else |
224 |
let |
|
49463 | 225 |
fun disc_free b = Free (Binding.name_of b, mk_pred1T dataT); |
49025 | 226 |
|
49486 | 227 |
fun disc_spec b exist_xs_u_eq_ctr = mk_Trueprop_eq (disc_free b $ u, exist_xs_u_eq_ctr); |
49278 | 228 |
|
49500 | 229 |
fun alternate_disc k = |
230 |
Term.lambda u (alternate_disc_lhs (K o rapp u o disc_free) (3 - k)); |
|
49278 | 231 |
|
49364
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
232 |
fun mk_default T t = |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
233 |
let |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
234 |
val Ts0 = map TFree (Term.add_tfreesT (fastype_of t) []); |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
235 |
val Ts = map TFree (Term.add_tfreesT T []); |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
236 |
in Term.subst_atomic_types (Ts0 ~~ Ts) t end; |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
237 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
238 |
fun mk_sel_case_args b proto_sels T = |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
239 |
map2 (fn Ts => fn k => |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
240 |
(case AList.lookup (op =) proto_sels k of |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
241 |
NONE => |
49364
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
242 |
(case AList.lookup Binding.eq_name (rev (nth sel_defaultss (k - 1))) b of |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
243 |
NONE => fold_rev (Term.lambda o curry Free Name.uu) Ts (mk_undefined T) |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
244 |
| SOME t => mk_default (Ts ---> T) t) |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
245 |
| SOME (xs, x) => fold_rev Term.lambda xs x)) ctr_Tss ks; |
49258
84f13469d7f0
allow same selector name for several constructors
blanchet
parents:
49257
diff
changeset
|
246 |
|
49278 | 247 |
fun sel_spec b proto_sels = |
248 |
let |
|
249 |
val _ = |
|
250 |
(case duplicates (op =) (map fst proto_sels) of |
|
251 |
k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^ |
|
252 |
" for constructor " ^ |
|
253 |
quote (Syntax.string_of_term no_defs_lthy (nth ctrs (k - 1)))) |
|
254 |
| [] => ()) |
|
255 |
val T = |
|
256 |
(case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of |
|
257 |
[T] => T |
|
258 |
| T :: T' :: _ => error ("Inconsistent range type for selector " ^ |
|
259 |
quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ no_defs_lthy T) ^ |
|
260 |
" vs. " ^ quote (Syntax.string_of_typ no_defs_lthy T'))); |
|
261 |
in |
|
49486 | 262 |
mk_Trueprop_eq (Free (Binding.name_of b, dataT --> T) $ u, |
263 |
Term.list_comb (mk_case As T, mk_sel_case_args b proto_sels T) $ u) |
|
49278 | 264 |
end; |
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
265 |
|
49336 | 266 |
val sel_bindings = flat sel_bindingss; |
267 |
val uniq_sel_bindings = distinct Binding.eq_name sel_bindings; |
|
268 |
val all_sels_distinct = (length uniq_sel_bindings = length sel_bindings); |
|
49285
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
269 |
|
49336 | 270 |
val sel_binding_index = |
271 |
if all_sels_distinct then 1 upto length sel_bindings |
|
272 |
else map (fn b => find_index (curry Binding.eq_name b) uniq_sel_bindings) sel_bindings; |
|
49285
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
273 |
|
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
274 |
val proto_sels = flat (map3 (fn k => fn xs => map (fn x => (k, (xs, x)))) ks xss xss); |
49300 | 275 |
val sel_infos = |
49336 | 276 |
AList.group (op =) (sel_binding_index ~~ proto_sels) |
49285
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
277 |
|> sort (int_ord o pairself fst) |
49336 | 278 |
|> map snd |> curry (op ~~) uniq_sel_bindings; |
279 |
val sel_bindings = map fst sel_infos; |
|
49258
84f13469d7f0
allow same selector name for several constructors
blanchet
parents:
49257
diff
changeset
|
280 |
|
49336 | 281 |
fun unflat_selss xs = unflat_lookup Binding.eq_name sel_bindings xs sel_bindingss; |
49258
84f13469d7f0
allow same selector name for several constructors
blanchet
parents:
49257
diff
changeset
|
282 |
|
49278 | 283 |
val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) = |
284 |
no_defs_lthy |
|
49486 | 285 |
|> apfst split_list o fold_map4 (fn k => fn m => fn exist_xs_u_eq_ctr => |
49278 | 286 |
fn NONE => |
49486 | 287 |
if n = 1 then pair (Term.lambda u (mk_u_eq_u ()), unique_disc_no_def) |
288 |
else if m = 0 then pair (Term.lambda u exist_xs_u_eq_ctr, refl) |
|
49278 | 289 |
else pair (alternate_disc k, alternate_disc_no_def) |
290 |
| SOME b => Specification.definition (SOME (b, NONE, NoSyn), |
|
49486 | 291 |
((Thm.def_binding b, []), disc_spec b exist_xs_u_eq_ctr)) #>> apsnd snd) |
292 |
ks ms exist_xs_u_eq_ctrs disc_bindings |
|
49278 | 293 |
||>> apfst split_list o fold_map (fn (b, proto_sels) => |
294 |
Specification.definition (SOME (b, NONE, NoSyn), |
|
49300 | 295 |
((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos |
49278 | 296 |
||> `Local_Theory.restore; |
49022 | 297 |
|
49278 | 298 |
val phi = Proof_Context.export_morphism lthy lthy'; |
49025 | 299 |
|
49278 | 300 |
val disc_defs = map (Morphism.thm phi) raw_disc_defs; |
49281 | 301 |
val sel_defs = map (Morphism.thm phi) raw_sel_defs; |
302 |
val sel_defss = unflat_selss sel_defs; |
|
49278 | 303 |
|
304 |
val discs0 = map (Morphism.term phi) raw_discs; |
|
305 |
val selss0 = unflat_selss (map (Morphism.term phi) raw_sels); |
|
49028 | 306 |
|
49278 | 307 |
val discs = map (mk_disc_or_sel As) discs0; |
308 |
val selss = map (map (mk_disc_or_sel As)) selss0; |
|
49486 | 309 |
|
49500 | 310 |
val udiscs = map (rapp u) discs; |
311 |
val uselss = map (map (rapp u)) selss; |
|
49486 | 312 |
|
49500 | 313 |
val vdiscs = map (rapp v) discs; |
314 |
val vselss = map (map (rapp v)) selss; |
|
49278 | 315 |
in |
49486 | 316 |
(all_sels_distinct, discs, selss, udiscs, uselss, vdiscs, vselss, disc_defs, sel_defs, |
317 |
sel_defss, lthy') |
|
49278 | 318 |
end; |
49025 | 319 |
|
49032 | 320 |
fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p); |
49029 | 321 |
|
49458 | 322 |
val exhaust_goal = |
49486 | 323 |
let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (u, xctr)]) in |
324 |
fold_rev Logic.all [p, u] (mk_imp_p (map2 mk_prem xctrs xss)) |
|
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
325 |
end; |
49019 | 326 |
|
49484 | 327 |
val inject_goalss = |
49017 | 328 |
let |
49034
b77e1910af8a
make parallel list indexing possible for inject theorems
blanchet
parents:
49033
diff
changeset
|
329 |
fun mk_goal _ _ [] [] = [] |
49025 | 330 |
| mk_goal xctr yctr xs ys = |
49121 | 331 |
[fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr), |
332 |
Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))]; |
|
49017 | 333 |
in |
49034
b77e1910af8a
make parallel list indexing possible for inject theorems
blanchet
parents:
49033
diff
changeset
|
334 |
map4 mk_goal xctrs yctrs xss yss |
49017 | 335 |
end; |
336 |
||
49484 | 337 |
val half_distinct_goalss = |
49121 | 338 |
let |
49203 | 339 |
fun mk_goal ((xs, xc), (xs', xc')) = |
49121 | 340 |
fold_rev Logic.all (xs @ xs') |
49203 | 341 |
(HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc')))); |
49121 | 342 |
in |
343 |
map (map mk_goal) (mk_half_pairss (xss ~~ xctrs)) |
|
344 |
end; |
|
49019 | 345 |
|
49458 | 346 |
val cases_goal = |
49121 | 347 |
map3 (fn xs => fn xctr => fn xf => |
49201 | 348 |
fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xss xctrs xfs; |
49025 | 349 |
|
49484 | 350 |
val goalss = [exhaust_goal] :: inject_goalss @ half_distinct_goalss @ [cases_goal]; |
49019 | 351 |
|
352 |
fun after_qed thmss lthy = |
|
353 |
let |
|
49048
4e0f0f98be02
rationalized data structure for distinctness theorems
blanchet
parents:
49046
diff
changeset
|
354 |
val ([exhaust_thm], (inject_thmss, (half_distinct_thmss, [case_thms]))) = |
4e0f0f98be02
rationalized data structure for distinctness theorems
blanchet
parents:
49046
diff
changeset
|
355 |
(hd thmss, apsnd (chop (n * n)) (chop n (tl thmss))); |
49019 | 356 |
|
49438 | 357 |
val inject_thms = flat inject_thmss; |
358 |
||
49486 | 359 |
val Tinst = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As); |
360 |
||
361 |
fun inst_thm t thm = |
|
362 |
Drule.instantiate' [] [SOME (certify lthy t)] |
|
363 |
(Thm.instantiate (Tinst, []) (Drule.zero_var_indexes thm)); |
|
364 |
||
365 |
val uexhaust_thm = inst_thm u exhaust_thm; |
|
49032 | 366 |
|
49300 | 367 |
val exhaust_cases = map base_name_of_ctr ctrs; |
368 |
||
49048
4e0f0f98be02
rationalized data structure for distinctness theorems
blanchet
parents:
49046
diff
changeset
|
369 |
val other_half_distinct_thmss = map (map (fn thm => thm RS not_sym)) half_distinct_thmss; |
4e0f0f98be02
rationalized data structure for distinctness theorems
blanchet
parents:
49046
diff
changeset
|
370 |
|
49486 | 371 |
val (distinct_thms, (distinct_thmsss', distinct_thmsss)) = |
372 |
join_halves n half_distinct_thmss other_half_distinct_thmss; |
|
49019 | 373 |
|
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
374 |
val nchotomy_thm = |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
375 |
let |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
376 |
val goal = |
49486 | 377 |
HOLogic.mk_Trueprop (HOLogic.mk_all (fst u', snd u', |
378 |
Library.foldr1 HOLogic.mk_disj exist_xs_u_eq_ctrs)); |
|
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
379 |
in |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
380 |
Skip_Proof.prove lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm) |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
381 |
end; |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
382 |
|
49484 | 383 |
val (all_sel_thms, sel_thmss, disc_thmss, disc_thms, discI_thms, disc_exclude_thms, |
49486 | 384 |
disc_exhaust_thms, collapse_thms, expand_thms, case_eq_thms) = |
49278 | 385 |
if no_dests then |
49486 | 386 |
([], [], [], [], [], [], [], [], [], []) |
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
387 |
else |
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
388 |
let |
49364
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
389 |
fun make_sel_thm xs' case_thm sel_def = |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
390 |
zero_var_indexes (Drule.gen_all (Drule.rename_bvars' (map (SOME o fst) xs') |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
391 |
(Drule.forall_intr_vars (case_thm RS (sel_def RS trans))))); |
49281 | 392 |
|
393 |
fun has_undefined_rhs thm = |
|
394 |
(case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of |
|
395 |
Const (@{const_name undefined}, _) => true |
|
396 |
| _ => false); |
|
397 |
||
49364
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
398 |
val sel_thmss = map3 (map oo make_sel_thm) xss' case_thms sel_defss; |
49281 | 399 |
|
400 |
val all_sel_thms = |
|
49285
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
401 |
(if all_sels_distinct andalso forall null sel_defaultss then |
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
402 |
flat sel_thmss |
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
403 |
else |
49364
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
404 |
map_product (fn s => fn (xs', c) => make_sel_thm xs' c s) sel_defs |
838b5e8ede73
allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)
blanchet
parents:
49336
diff
changeset
|
405 |
(xss' ~~ case_thms)) |
49285
036b833b99aa
removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)
blanchet
parents:
49281
diff
changeset
|
406 |
|> filter_out has_undefined_rhs; |
49278 | 407 |
|
408 |
fun mk_unique_disc_def () = |
|
409 |
let |
|
410 |
val m = the_single ms; |
|
49486 | 411 |
val goal = mk_Trueprop_eq (mk_u_eq_u (), the_single exist_xs_u_eq_ctrs); |
49278 | 412 |
in |
49486 | 413 |
Skip_Proof.prove lthy [] [] goal (fn _ => mk_unique_disc_def_tac m uexhaust_thm) |
49278 | 414 |
|> singleton (Proof_Context.export names_lthy lthy) |
415 |
|> Thm.close_derivation |
|
416 |
end; |
|
417 |
||
418 |
fun mk_alternate_disc_def k = |
|
419 |
let |
|
420 |
val goal = |
|
49486 | 421 |
mk_Trueprop_eq (alternate_disc_lhs (K (nth udiscs)) (3 - k), |
422 |
nth exist_xs_u_eq_ctrs (k - 1)); |
|
49278 | 423 |
in |
424 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
425 |
mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k)) |
|
49486 | 426 |
(nth distinct_thms (2 - k)) uexhaust_thm) |
49278 | 427 |
|> singleton (Proof_Context.export names_lthy lthy) |
428 |
|> Thm.close_derivation |
|
429 |
end; |
|
49028 | 430 |
|
49278 | 431 |
val has_alternate_disc_def = |
432 |
exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs; |
|
433 |
||
434 |
val disc_defs' = |
|
435 |
map2 (fn k => fn def => |
|
436 |
if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def () |
|
437 |
else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k |
|
438 |
else def) ks disc_defs; |
|
439 |
||
440 |
val discD_thms = map (fn def => def RS iffD1) disc_defs'; |
|
441 |
val discI_thms = |
|
442 |
map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms |
|
443 |
disc_defs'; |
|
444 |
val not_discI_thms = |
|
445 |
map2 (fn m => fn def => funpow m (fn thm => allI RS thm) |
|
49504
df9b897fb254
renamed "iter"/"coiter" to "fold"/"unfold" (cf. Wadler)
blanchet
parents:
49500
diff
changeset
|
446 |
(unfold_thms lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]}))) |
49278 | 447 |
ms disc_defs'; |
448 |
||
449 |
val (disc_thmss', disc_thmss) = |
|
450 |
let |
|
451 |
fun mk_thm discI _ [] = refl RS discI |
|
452 |
| mk_thm _ not_discI [distinct] = distinct RS not_discI; |
|
453 |
fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss; |
|
454 |
in |
|
455 |
map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose |
|
456 |
end; |
|
457 |
||
458 |
val disc_thms = flat (map2 (fn true => K [] | false => I) no_discs disc_thmss); |
|
49028 | 459 |
|
49486 | 460 |
val (disc_exclude_thms, (disc_exclude_thmsss', disc_exclude_thmsss)) = |
461 |
let |
|
462 |
fun mk_goal [] = [] |
|
463 |
| mk_goal [((_, udisc), (_, udisc'))] = |
|
464 |
[Logic.all u (Logic.mk_implies (HOLogic.mk_Trueprop udisc, |
|
465 |
HOLogic.mk_Trueprop (HOLogic.mk_not udisc')))]; |
|
466 |
||
467 |
fun prove tac goal = Skip_Proof.prove lthy [] [] goal (K tac); |
|
468 |
||
469 |
val infos = ms ~~ discD_thms ~~ udiscs; |
|
470 |
val half_pairss = mk_half_pairss infos; |
|
471 |
||
472 |
val half_goalss = map mk_goal half_pairss; |
|
473 |
val half_thmss = |
|
474 |
map3 (fn [] => K (K []) | [goal] => fn [(((m, discD), _), _)] => |
|
475 |
fn disc_thm => [prove (mk_half_disc_exclude_tac m discD disc_thm) goal]) |
|
476 |
half_goalss half_pairss (flat disc_thmss'); |
|
49278 | 477 |
|
49486 | 478 |
val other_half_goalss = map (mk_goal o map swap) half_pairss; |
479 |
val other_half_thmss = |
|
480 |
map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss |
|
481 |
other_half_goalss; |
|
482 |
in |
|
483 |
join_halves n half_thmss other_half_thmss |
|
484 |
|>> has_alternate_disc_def ? K [] |
|
485 |
end; |
|
49278 | 486 |
|
49486 | 487 |
val disc_exhaust_thm = |
488 |
let |
|
489 |
fun mk_prem udisc = mk_imp_p [HOLogic.mk_Trueprop udisc]; |
|
490 |
val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem udiscs)); |
|
491 |
in |
|
492 |
Skip_Proof.prove lthy [] [] goal (fn _ => |
|
493 |
mk_disc_exhaust_tac n exhaust_thm discI_thms) |
|
494 |
end; |
|
49028 | 495 |
|
49278 | 496 |
val disc_exhaust_thms = |
49486 | 497 |
if has_alternate_disc_def orelse no_discs_at_all then [] else [disc_exhaust_thm]; |
498 |
||
499 |
val (collapse_thms, collapse_thm_opts) = |
|
500 |
let |
|
501 |
fun mk_goal ctr udisc usels = |
|
502 |
let |
|
503 |
val prem = HOLogic.mk_Trueprop udisc; |
|
504 |
val concl = |
|
505 |
mk_Trueprop_eq ((null usels ? swap) (Term.list_comb (ctr, usels), u)); |
|
506 |
in |
|
507 |
if prem aconv concl then NONE |
|
508 |
else SOME (Logic.all u (Logic.mk_implies (prem, concl))) |
|
509 |
end; |
|
510 |
val goals = map3 mk_goal ctrs udiscs uselss; |
|
511 |
in |
|
512 |
map4 (fn m => fn discD => fn sel_thms => Option.map (fn goal => |
|
513 |
Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
514 |
mk_collapse_tac ctxt m discD sel_thms) |
|
515 |
|> perhaps (try (fn thm => refl RS thm)))) ms discD_thms sel_thmss goals |
|
516 |
|> `(map_filter I) |
|
517 |
end; |
|
49025 | 518 |
|
49486 | 519 |
val expand_thms = |
520 |
let |
|
521 |
fun mk_prems k udisc usels vdisc vsels = |
|
522 |
(if k = n then [] else [mk_Trueprop_eq (udisc, vdisc)]) @ |
|
523 |
(if null usels then |
|
524 |
[] |
|
525 |
else |
|
526 |
[Logic.list_implies |
|
527 |
(if n = 1 then [] else map HOLogic.mk_Trueprop [udisc, vdisc], |
|
528 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
|
529 |
(map2 (curry HOLogic.mk_eq) usels vsels)))]); |
|
530 |
||
531 |
val uncollapse_thms = |
|
532 |
map (fn NONE => Drule.dummy_thm | SOME thm => thm RS sym) collapse_thm_opts; |
|
533 |
||
534 |
val goal = |
|
535 |
Library.foldr Logic.list_implies |
|
536 |
(map5 mk_prems ks udiscs uselss vdiscs vselss, u_eq_v); |
|
537 |
in |
|
538 |
[Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
539 |
mk_expand_tac ctxt n ms (inst_thm u disc_exhaust_thm) |
|
540 |
(inst_thm v disc_exhaust_thm) uncollapse_thms disc_exclude_thmsss |
|
541 |
disc_exclude_thmsss')] |
|
542 |
|> Proof_Context.export names_lthy lthy |
|
543 |
end; |
|
49278 | 544 |
|
545 |
val case_eq_thms = |
|
49486 | 546 |
let |
547 |
fun mk_body f usels = Term.list_comb (f, usels); |
|
548 |
val goal = mk_Trueprop_eq (ufcase, mk_IfN B udiscs (map2 mk_body fs uselss)); |
|
549 |
in |
|
550 |
[Skip_Proof.prove lthy [] [] goal (fn {context = ctxt, ...} => |
|
551 |
mk_case_eq_tac ctxt n uexhaust_thm case_thms disc_thmss' sel_thmss)] |
|
552 |
|> Proof_Context.export names_lthy lthy |
|
553 |
end; |
|
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
554 |
in |
49484 | 555 |
(all_sel_thms, sel_thmss, disc_thmss, disc_thms, discI_thms, disc_exclude_thms, |
49486 | 556 |
disc_exhaust_thms, collapse_thms, expand_thms, case_eq_thms) |
49116
3d520eec2746
allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)
blanchet
parents:
49114
diff
changeset
|
557 |
end; |
49025 | 558 |
|
49033 | 559 |
val (case_cong_thm, weak_case_cong_thm) = |
49032 | 560 |
let |
561 |
fun mk_prem xctr xs f g = |
|
49486 | 562 |
fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (v, xctr), |
49032 | 563 |
mk_Trueprop_eq (f, g))); |
49033 | 564 |
|
49032 | 565 |
val goal = |
49486 | 566 |
Logic.list_implies (u_eq_v :: map4 mk_prem xctrs xss fs gs, |
567 |
mk_Trueprop_eq (ufcase, vgcase)); |
|
568 |
val weak_goal = Logic.mk_implies (u_eq_v, mk_Trueprop_eq (ufcase, vfcase)); |
|
49032 | 569 |
in |
49486 | 570 |
(Skip_Proof.prove lthy [] [] goal (fn _ => mk_case_cong_tac uexhaust_thm case_thms), |
49458 | 571 |
Skip_Proof.prove lthy [] [] weak_goal (K (etac arg_cong 1))) |
49033 | 572 |
|> pairself (singleton (Proof_Context.export names_lthy lthy)) |
49032 | 573 |
end; |
49025 | 574 |
|
49044 | 575 |
val (split_thm, split_asm_thm) = |
49043 | 576 |
let |
49044 | 577 |
fun mk_conjunct xctr xs f_xs = |
49486 | 578 |
list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (u, xctr), q $ f_xs)); |
49044 | 579 |
fun mk_disjunct xctr xs f_xs = |
49486 | 580 |
list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr), |
49044 | 581 |
HOLogic.mk_not (q $ f_xs))); |
582 |
||
49486 | 583 |
val lhs = q $ ufcase; |
49044 | 584 |
|
49043 | 585 |
val goal = |
49044 | 586 |
mk_Trueprop_eq (lhs, Library.foldr1 HOLogic.mk_conj (map3 mk_conjunct xctrs xss xfs)); |
49458 | 587 |
val asm_goal = |
49044 | 588 |
mk_Trueprop_eq (lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj |
589 |
(map3 mk_disjunct xctrs xss xfs))); |
|
590 |
||
591 |
val split_thm = |
|
49049 | 592 |
Skip_Proof.prove lthy [] [] goal |
49486 | 593 |
(fn _ => mk_split_tac uexhaust_thm case_thms inject_thmss distinct_thmsss) |
49044 | 594 |
|> singleton (Proof_Context.export names_lthy lthy) |
595 |
val split_asm_thm = |
|
49458 | 596 |
Skip_Proof.prove lthy [] [] asm_goal (fn {context = ctxt, ...} => |
49044 | 597 |
mk_split_asm_tac ctxt split_thm) |
598 |
|> singleton (Proof_Context.export names_lthy lthy) |
|
49043 | 599 |
in |
49044 | 600 |
(split_thm, split_asm_thm) |
49043 | 601 |
end; |
49025 | 602 |
|
49437 | 603 |
val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases)); |
49300 | 604 |
val cases_type_attr = Attrib.internal (K (Induct.cases_type dataT_name)); |
605 |
||
49052 | 606 |
val notes = |
49300 | 607 |
[(case_congN, [case_cong_thm], []), |
608 |
(case_eqN, case_eq_thms, []), |
|
609 |
(casesN, case_thms, simp_attrs), |
|
610 |
(collapseN, collapse_thms, simp_attrs), |
|
611 |
(discsN, disc_thms, simp_attrs), |
|
612 |
(disc_excludeN, disc_exclude_thms, []), |
|
613 |
(disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]), |
|
614 |
(distinctN, distinct_thms, simp_attrs @ induct_simp_attrs), |
|
615 |
(exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]), |
|
49486 | 616 |
(expandN, expand_thms, []), |
49438 | 617 |
(injectN, inject_thms, iff_attrs @ induct_simp_attrs), |
49300 | 618 |
(nchotomyN, [nchotomy_thm], []), |
619 |
(selsN, all_sel_thms, simp_attrs), |
|
620 |
(splitN, [split_thm], []), |
|
621 |
(split_asmN, [split_asm_thm], []), |
|
622 |
(weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)] |
|
623 |
|> filter_out (null o #2) |
|
624 |
|> map (fn (thmN, thms, attrs) => |
|
49498 | 625 |
((Binding.qualify true data_b_name (Binding.name thmN), attrs), [(thms, [])])); |
49300 | 626 |
|
627 |
val notes' = |
|
628 |
[(map (fn th => th RS notE) distinct_thms, safe_elim_attrs)] |
|
629 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
|
49019 | 630 |
in |
49484 | 631 |
((discs, selss, inject_thms, distinct_thms, case_thms, disc_thmss, discI_thms, sel_thmss), |
49438 | 632 |
lthy |> Local_Theory.notes (notes' @ notes) |> snd) |
49019 | 633 |
end; |
49017 | 634 |
in |
49121 | 635 |
(goalss, after_qed, lthy') |
49017 | 636 |
end; |
637 |
||
49199 | 638 |
fun wrap_datatype tacss = (fn (goalss, after_qed, lthy) => |
49111 | 639 |
map2 (map2 (Skip_Proof.prove lthy [] [])) goalss tacss |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
640 |
|> (fn thms => after_qed thms lthy)) oo prepare_wrap_datatype (K I); |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
641 |
|
49297 | 642 |
val wrap_datatype_cmd = (fn (goalss, after_qed, lthy) => |
643 |
Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo |
|
644 |
prepare_wrap_datatype Syntax.read_term; |
|
645 |
||
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
646 |
fun parse_bracket_list parser = @{keyword "["} |-- Parse.list parser --| @{keyword "]"}; |
49111 | 647 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
648 |
val parse_bindings = parse_bracket_list Parse.binding; |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
649 |
val parse_bindingss = parse_bracket_list parse_bindings; |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
650 |
|
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
651 |
val parse_bound_term = (Parse.binding --| @{keyword ":"}) -- Parse.term; |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
652 |
val parse_bound_terms = parse_bracket_list parse_bound_term; |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
653 |
val parse_bound_termss = parse_bracket_list parse_bound_terms; |
49017 | 654 |
|
49278 | 655 |
val parse_wrap_options = |
656 |
Scan.optional (@{keyword "("} |-- (@{keyword "no_dests"} >> K true) --| @{keyword ")"}) false; |
|
657 |
||
49017 | 658 |
val _ = |
49074 | 659 |
Outer_Syntax.local_theory_to_proof @{command_spec "wrap_data"} "wraps an existing datatype" |
49278 | 660 |
((parse_wrap_options -- (@{keyword "["} |-- Parse.list Parse.term --| @{keyword "]"}) -- |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
661 |
Parse.term -- Scan.optional (parse_bindings -- Scan.optional (parse_bindingss -- |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
662 |
Scan.optional parse_bound_termss []) ([], [])) ([], ([], []))) |
49199 | 663 |
>> wrap_datatype_cmd); |
49017 | 664 |
|
665 |
end; |