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