author | blanchet |
Thu, 13 Mar 2014 13:18:13 +0100 | |
changeset 56085 | 3d11892ea537 |
parent 55535 | 10194808430d |
child 56345 | 228e30cb111d |
permissions | -rw-r--r-- |
54701 | 1 |
(* Title: HOL/Tools/Ctr_Sugar/ctr_sugar.ML |
49017 | 2 |
Author: Jasmin Blanchette, TU Muenchen |
54397 | 3 |
Copyright 2012, 2013 |
49017 | 4 |
|
51797 | 5 |
Wrapping existing freely generated type's constructors. |
49017 | 6 |
*) |
7 |
||
54006 | 8 |
signature CTR_SUGAR = |
49017 | 9 |
sig |
51840 | 10 |
type ctr_sugar = |
51839 | 11 |
{ctrs: term list, |
52375 | 12 |
casex: term, |
51839 | 13 |
discs: term list, |
51819 | 14 |
selss: term list list, |
15 |
exhaust: thm, |
|
52375 | 16 |
nchotomy: thm, |
51819 | 17 |
injects: thm list, |
18 |
distincts: thm list, |
|
19 |
case_thms: thm list, |
|
52375 | 20 |
case_cong: thm, |
21 |
weak_case_cong: thm, |
|
22 |
split: thm, |
|
23 |
split_asm: thm, |
|
51819 | 24 |
disc_thmss: thm list list, |
25 |
discIs: thm list, |
|
53475 | 26 |
sel_thmss: thm list list, |
54900 | 27 |
disc_excludesss: thm list list list, |
53475 | 28 |
disc_exhausts: thm list, |
53916 | 29 |
sel_exhausts: thm list, |
53475 | 30 |
collapses: thm list, |
31 |
expands: thm list, |
|
53917 | 32 |
sel_splits: thm list, |
33 |
sel_split_asms: thm list, |
|
54491 | 34 |
case_eq_ifs: thm list}; |
51809 | 35 |
|
51840 | 36 |
val morph_ctr_sugar: morphism -> ctr_sugar -> ctr_sugar |
54256 | 37 |
val transfer_ctr_sugar: Proof.context -> ctr_sugar -> ctr_sugar |
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
38 |
val ctr_sugar_of: Proof.context -> string -> ctr_sugar option |
53906 | 39 |
val ctr_sugars_of: Proof.context -> ctr_sugar list |
54403 | 40 |
val ctr_sugar_of_case: Proof.context -> string -> ctr_sugar option |
54399 | 41 |
val register_ctr_sugar: string -> ctr_sugar -> local_theory -> local_theory |
55444
ec73f81e49e7
iteration n in the 'default' vs. 'update_new' vs. 'update' saga -- 'update' makes sense now that we honor the canonical order on 'merge' (as opposed to raising 'DUP')
blanchet
parents:
55410
diff
changeset
|
42 |
val default_register_ctr_sugar_global: string -> ctr_sugar -> theory -> theory |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
43 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
44 |
val mk_half_pairss: 'a list * 'a list -> ('a * 'a) list list |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
45 |
val join_halves: int -> 'a list list -> 'a list list -> 'a list * 'a list list list |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
46 |
|
49203 | 47 |
val mk_ctr: typ list -> term -> term |
53864
a48d4bd3faaa
use case rather than sequence of ifs in expansion
blanchet
parents:
53857
diff
changeset
|
48 |
val mk_case: typ list -> typ -> term -> term |
49484 | 49 |
val mk_disc_or_sel: typ list -> term -> term |
49622 | 50 |
val name_of_ctr: term -> string |
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
51 |
val name_of_disc: term -> string |
53888 | 52 |
val dest_ctr: Proof.context -> string -> term -> term * term list |
54970
891141de5672
only destruct cases equipped with the right stuff (in particular, 'sel_split')
blanchet
parents:
54900
diff
changeset
|
53 |
val dest_case: Proof.context -> string -> typ list -> term -> |
891141de5672
only destruct cases equipped with the right stuff (in particular, 'sel_split')
blanchet
parents:
54900
diff
changeset
|
54 |
(ctr_sugar * term list * term list) option |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
55 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
56 |
type ('c, 'a, 'v) ctr_spec = ((binding * 'c) * 'a list) * (binding * 'v) list |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
57 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
58 |
val disc_of_ctr_spec: ('c, 'a, 'v) ctr_spec -> binding |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
59 |
val ctr_of_ctr_spec: ('c, 'a, 'v) ctr_spec -> 'c |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
60 |
val args_of_ctr_spec: ('c, 'a, 'v) ctr_spec -> 'a list |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
61 |
val sel_defaults_of_ctr_spec: ('c, 'a, 'v) ctr_spec -> (binding * 'v) list |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
62 |
|
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
63 |
val free_constructors: ({prems: thm list, context: Proof.context} -> tactic) list list -> |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
64 |
((bool * bool) * binding) * (term, binding, term) ctr_spec list -> local_theory -> |
51840 | 65 |
ctr_sugar * local_theory |
49286 | 66 |
val parse_bound_term: (binding * string) parser |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
67 |
val parse_ctr_options: (bool * bool) parser |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
68 |
val parse_ctr_spec: 'c parser -> 'a parser -> ('c, 'a, string) ctr_spec parser |
49017 | 69 |
end; |
70 |
||
54006 | 71 |
structure Ctr_Sugar : CTR_SUGAR = |
49017 | 72 |
struct |
73 |
||
54008
b15cfc2864de
refactoring -- splitting between constructor sugar dependencies and true BNF dependencies
blanchet
parents:
54007
diff
changeset
|
74 |
open Ctr_Sugar_Util |
54006 | 75 |
open Ctr_Sugar_Tactics |
54615
62fb5af93fe2
generalized datatype code generation code so that it works with old-style and new-style (co)datatypes (as long as they are not local)
blanchet
parents:
54493
diff
changeset
|
76 |
open Ctr_Sugar_Code |
49017 | 77 |
|
51840 | 78 |
type ctr_sugar = |
51839 | 79 |
{ctrs: term list, |
52375 | 80 |
casex: term, |
51839 | 81 |
discs: term list, |
51819 | 82 |
selss: term list list, |
83 |
exhaust: thm, |
|
52375 | 84 |
nchotomy: thm, |
51819 | 85 |
injects: thm list, |
86 |
distincts: thm list, |
|
87 |
case_thms: thm list, |
|
52375 | 88 |
case_cong: thm, |
89 |
weak_case_cong: thm, |
|
90 |
split: thm, |
|
91 |
split_asm: thm, |
|
51819 | 92 |
disc_thmss: thm list list, |
93 |
discIs: thm list, |
|
53475 | 94 |
sel_thmss: thm list list, |
54900 | 95 |
disc_excludesss: thm list list list, |
53475 | 96 |
disc_exhausts: thm list, |
53916 | 97 |
sel_exhausts: thm list, |
53475 | 98 |
collapses: thm list, |
99 |
expands: thm list, |
|
53917 | 100 |
sel_splits: thm list, |
101 |
sel_split_asms: thm list, |
|
54491 | 102 |
case_eq_ifs: thm list}; |
51809 | 103 |
|
52375 | 104 |
fun morph_ctr_sugar phi {ctrs, casex, discs, selss, exhaust, nchotomy, injects, distincts, |
53475 | 105 |
case_thms, case_cong, weak_case_cong, split, split_asm, disc_thmss, discIs, sel_thmss, |
54900 | 106 |
disc_excludesss, disc_exhausts, sel_exhausts, collapses, expands, sel_splits, sel_split_asms, |
107 |
case_eq_ifs} = |
|
51839 | 108 |
{ctrs = map (Morphism.term phi) ctrs, |
52375 | 109 |
casex = Morphism.term phi casex, |
51839 | 110 |
discs = map (Morphism.term phi) discs, |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
111 |
selss = map (map (Morphism.term phi)) selss, |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
112 |
exhaust = Morphism.thm phi exhaust, |
52375 | 113 |
nchotomy = Morphism.thm phi nchotomy, |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
114 |
injects = map (Morphism.thm phi) injects, |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
115 |
distincts = map (Morphism.thm phi) distincts, |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
116 |
case_thms = map (Morphism.thm phi) case_thms, |
52375 | 117 |
case_cong = Morphism.thm phi case_cong, |
118 |
weak_case_cong = Morphism.thm phi weak_case_cong, |
|
119 |
split = Morphism.thm phi split, |
|
120 |
split_asm = Morphism.thm phi split_asm, |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
121 |
disc_thmss = map (map (Morphism.thm phi)) disc_thmss, |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
122 |
discIs = map (Morphism.thm phi) discIs, |
53475 | 123 |
sel_thmss = map (map (Morphism.thm phi)) sel_thmss, |
54900 | 124 |
disc_excludesss = map (map (map (Morphism.thm phi))) disc_excludesss, |
53475 | 125 |
disc_exhausts = map (Morphism.thm phi) disc_exhausts, |
53916 | 126 |
sel_exhausts = map (Morphism.thm phi) sel_exhausts, |
53475 | 127 |
collapses = map (Morphism.thm phi) collapses, |
128 |
expands = map (Morphism.thm phi) expands, |
|
53917 | 129 |
sel_splits = map (Morphism.thm phi) sel_splits, |
130 |
sel_split_asms = map (Morphism.thm phi) sel_split_asms, |
|
54491 | 131 |
case_eq_ifs = map (Morphism.thm phi) case_eq_ifs}; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
132 |
|
53906 | 133 |
val transfer_ctr_sugar = |
54740 | 134 |
morph_ctr_sugar o Morphism.transfer_morphism o Proof_Context.theory_of; |
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
135 |
|
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
136 |
structure Data = Generic_Data |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
137 |
( |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
138 |
type T = ctr_sugar Symtab.table; |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
139 |
val empty = Symtab.empty; |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
140 |
val extend = I; |
55394
d5ebe055b599
more liberal merging of BNFs and constructor sugar
blanchet
parents:
55356
diff
changeset
|
141 |
fun merge data : T = Symtab.merge (K true) data; |
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
142 |
); |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
143 |
|
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
144 |
fun ctr_sugar_of ctxt = |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
145 |
Symtab.lookup (Data.get (Context.Proof ctxt)) |
53906 | 146 |
#> Option.map (transfer_ctr_sugar ctxt); |
147 |
||
148 |
fun ctr_sugars_of ctxt = |
|
149 |
Symtab.fold (cons o transfer_ctr_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) []; |
|
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
150 |
|
54403 | 151 |
fun ctr_sugar_of_case ctxt s = |
152 |
find_first (fn {casex = Const (s', _), ...} => s' = s | _ => false) (ctr_sugars_of ctxt); |
|
153 |
||
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
154 |
fun register_ctr_sugar key ctr_sugar = |
54285
578371ba74cc
reverted 3e1d230f1c00 -- pervasiveness is useful, cf. Coinductive_Nat in the AFP
blanchet
parents:
54265
diff
changeset
|
155 |
Local_Theory.declaration {syntax = false, pervasive = true} |
55444
ec73f81e49e7
iteration n in the 'default' vs. 'update_new' vs. 'update' saga -- 'update' makes sense now that we honor the canonical order on 'merge' (as opposed to raising 'DUP')
blanchet
parents:
55410
diff
changeset
|
156 |
(fn phi => Data.map (Symtab.update (key, morph_ctr_sugar phi ctr_sugar))); |
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
157 |
|
55444
ec73f81e49e7
iteration n in the 'default' vs. 'update_new' vs. 'update' saga -- 'update' makes sense now that we honor the canonical order on 'merge' (as opposed to raising 'DUP')
blanchet
parents:
55410
diff
changeset
|
158 |
fun default_register_ctr_sugar_global key ctr_sugar = |
55356
3ea8ace6bc8a
reverted a87e49f4336d -- overwriting of data entries yields to merge problems later
blanchet
parents:
55347
diff
changeset
|
159 |
Context.theory_map (Data.map (Symtab.default (key, ctr_sugar))); |
54400 | 160 |
|
49223 | 161 |
val isN = "is_"; |
162 |
val unN = "un_"; |
|
163 |
fun mk_unN 1 1 suf = unN ^ suf |
|
164 |
| 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
|
165 |
|
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49591
diff
changeset
|
166 |
val caseN = "case"; |
49054 | 167 |
val case_congN = "case_cong"; |
54491 | 168 |
val case_eq_ifN = "case_eq_if"; |
49118 | 169 |
val collapseN = "collapse"; |
49122 | 170 |
val disc_excludeN = "disc_exclude"; |
49054 | 171 |
val disc_exhaustN = "disc_exhaust"; |
53694 | 172 |
val discN = "disc"; |
53700 | 173 |
val discIN = "discI"; |
49054 | 174 |
val distinctN = "distinct"; |
49075 | 175 |
val exhaustN = "exhaust"; |
49486 | 176 |
val expandN = "expand"; |
49075 | 177 |
val injectN = "inject"; |
178 |
val nchotomyN = "nchotomy"; |
|
53694 | 179 |
val selN = "sel"; |
53916 | 180 |
val sel_exhaustN = "sel_exhaust"; |
53917 | 181 |
val sel_splitN = "sel_split"; |
182 |
val sel_split_asmN = "sel_split_asm"; |
|
49054 | 183 |
val splitN = "split"; |
49633 | 184 |
val splitsN = "splits"; |
49054 | 185 |
val split_asmN = "split_asm"; |
186 |
val weak_case_cong_thmsN = "weak_case_cong"; |
|
49019 | 187 |
|
53700 | 188 |
val cong_attrs = @{attributes [cong]}; |
53836 | 189 |
val dest_attrs = @{attributes [dest]}; |
53700 | 190 |
val safe_elim_attrs = @{attributes [elim!]}; |
191 |
val iff_attrs = @{attributes [iff]}; |
|
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54008
diff
changeset
|
192 |
val inductsimp_attrs = @{attributes [induct_simp]}; |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54008
diff
changeset
|
193 |
val nitpicksimp_attrs = @{attributes [nitpick_simp]}; |
49300 | 194 |
val simp_attrs = @{attributes [simp]}; |
54151 | 195 |
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs; |
196 |
val code_nitpicksimp_simp_attrs = code_nitpicksimp_attrs @ simp_attrs; |
|
49046
3c5eba97d93a
allow default names for selectors via wildcard (_) + fix wrong index (k)
blanchet
parents:
49045
diff
changeset
|
197 |
|
55480
59cc4a8bc28a
allow different functions to recurse on the same type, like in the old package
blanchet
parents:
55471
diff
changeset
|
198 |
fun unflat_lookup eq xs ys = map (fn xs' => permute_like_unique eq xs xs' ys); |
49258
84f13469d7f0
allow same selector name for several constructors
blanchet
parents:
49257
diff
changeset
|
199 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
200 |
fun mk_half_pairss' _ ([], []) = [] |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
201 |
| mk_half_pairss' indent (x :: xs, _ :: ys) = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
202 |
indent @ fold_rev (cons o single o pair x) ys (mk_half_pairss' ([] :: indent) (xs, ys)); |
49486 | 203 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
204 |
fun mk_half_pairss p = mk_half_pairss' [[]] p; |
49027 | 205 |
|
49486 | 206 |
fun join_halves n half_xss other_half_xss = |
55342 | 207 |
(splice (flat half_xss) (flat other_half_xss), |
208 |
map2 (map2 append) (Library.chop_groups n half_xss) |
|
209 |
(transpose (Library.chop_groups n other_half_xss))); |
|
49027 | 210 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
211 |
fun mk_undefined T = Const (@{const_name undefined}, T); |
49055 | 212 |
|
49500 | 213 |
fun mk_ctr Ts t = |
214 |
let val Type (_, Ts0) = body_type (fastype_of t) in |
|
54435
4a655e62ad34
fixed type variable confusion in 'datatype_new_compat'
blanchet
parents:
54422
diff
changeset
|
215 |
subst_nonatomic_types (Ts0 ~~ Ts) t |
49203 | 216 |
end; |
217 |
||
49536 | 218 |
fun mk_case Ts T t = |
219 |
let val (Type (_, Ts0), body) = strip_type (fastype_of t) |>> List.last in |
|
54435
4a655e62ad34
fixed type variable confusion in 'datatype_new_compat'
blanchet
parents:
54422
diff
changeset
|
220 |
subst_nonatomic_types ((body, T) :: (Ts0 ~~ Ts)) t |
49536 | 221 |
end; |
222 |
||
53864
a48d4bd3faaa
use case rather than sequence of ifs in expansion
blanchet
parents:
53857
diff
changeset
|
223 |
fun mk_disc_or_sel Ts t = |
54435
4a655e62ad34
fixed type variable confusion in 'datatype_new_compat'
blanchet
parents:
54422
diff
changeset
|
224 |
subst_nonatomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t; |
53864
a48d4bd3faaa
use case rather than sequence of ifs in expansion
blanchet
parents:
53857
diff
changeset
|
225 |
|
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
226 |
fun name_of_const what t = |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
227 |
(case head_of t of |
49622 | 228 |
Const (s, _) => s |
229 |
| Free (s, _) => s |
|
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
230 |
| _ => error ("Cannot extract name of " ^ what)); |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
231 |
|
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
232 |
val name_of_ctr = name_of_const "constructor"; |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
233 |
|
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
234 |
val notN = "not_"; |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
235 |
val eqN = "eq_"; |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
236 |
val neqN = "neq_"; |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
237 |
|
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
238 |
fun name_of_disc t = |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
239 |
(case head_of t of |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
240 |
Abs (_, _, @{const Not} $ (t' $ Bound 0)) => |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
241 |
Long_Name.map_base_name (prefix notN) (name_of_disc t') |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
242 |
| Abs (_, _, Const (@{const_name HOL.eq}, _) $ Bound 0 $ t') => |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
243 |
Long_Name.map_base_name (prefix eqN) (name_of_disc t') |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
244 |
| Abs (_, _, @{const Not} $ (Const (@{const_name HOL.eq}, _) $ Bound 0 $ t')) => |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
245 |
Long_Name.map_base_name (prefix neqN) (name_of_disc t') |
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51771
diff
changeset
|
246 |
| t' => name_of_const "destructor" t'); |
49622 | 247 |
|
248 |
val base_name_of_ctr = Long_Name.base_name o name_of_ctr; |
|
49046
3c5eba97d93a
allow default names for selectors via wildcard (_) + fix wrong index (k)
blanchet
parents:
49045
diff
changeset
|
249 |
|
53888 | 250 |
fun dest_ctr ctxt s t = |
55342 | 251 |
let val (f, args) = Term.strip_comb t in |
53888 | 252 |
(case ctr_sugar_of ctxt s of |
253 |
SOME {ctrs, ...} => |
|
254 |
(case find_first (can (fo_match ctxt f)) ctrs of |
|
255 |
SOME f' => (f', args) |
|
256 |
| NONE => raise Fail "dest_ctr") |
|
257 |
| NONE => raise Fail "dest_ctr") |
|
258 |
end; |
|
259 |
||
53870 | 260 |
fun dest_case ctxt s Ts t = |
261 |
(case Term.strip_comb t of |
|
262 |
(Const (c, _), args as _ :: _) => |
|
263 |
(case ctr_sugar_of ctxt s of |
|
54970
891141de5672
only destruct cases equipped with the right stuff (in particular, 'sel_split')
blanchet
parents:
54900
diff
changeset
|
264 |
SOME (ctr_sugar as {casex = Const (case_name, _), discs = discs0, selss = selss0, ...}) => |
53870 | 265 |
if case_name = c then |
53924 | 266 |
let val n = length discs0 in |
267 |
if n < length args then |
|
268 |
let |
|
269 |
val (branches, obj :: leftovers) = chop n args; |
|
270 |
val discs = map (mk_disc_or_sel Ts) discs0; |
|
271 |
val selss = map (map (mk_disc_or_sel Ts)) selss0; |
|
272 |
val conds = map (rapp obj) discs; |
|
273 |
val branch_argss = map (fn sels => map (rapp obj) sels @ leftovers) selss; |
|
274 |
val branches' = map2 (curry Term.betapplys) branches branch_argss; |
|
275 |
in |
|
54970
891141de5672
only destruct cases equipped with the right stuff (in particular, 'sel_split')
blanchet
parents:
54900
diff
changeset
|
276 |
SOME (ctr_sugar, conds, branches') |
53924 | 277 |
end |
278 |
else |
|
279 |
NONE |
|
53870 | 280 |
end |
281 |
else |
|
282 |
NONE |
|
283 |
| _ => NONE) |
|
284 |
| _ => NONE); |
|
285 |
||
49437 | 286 |
fun eta_expand_arg xs f_xs = fold_rev Term.lambda xs f_xs; |
287 |
||
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
288 |
type ('c, 'a, 'v) ctr_spec = ((binding * 'c) * 'a list) * (binding * 'v) list; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
289 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
290 |
fun disc_of_ctr_spec (((disc, _), _), _) = disc; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
291 |
fun ctr_of_ctr_spec (((_, ctr), _), _) = ctr; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
292 |
fun args_of_ctr_spec ((_, args), _) = args; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
293 |
fun sel_defaults_of_ctr_spec (_, ds) = ds; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
294 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
295 |
fun prepare_free_constructors prep_term (((no_discs_sels, no_code), raw_case_binding), ctr_specs) |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
296 |
no_defs_lthy = |
49017 | 297 |
let |
49019 | 298 |
(* TODO: sanity checks on arguments *) |
49025 | 299 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
300 |
val raw_ctrs = map ctr_of_ctr_spec ctr_specs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
301 |
val raw_disc_bindings = map disc_of_ctr_spec ctr_specs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
302 |
val raw_sel_bindingss = map args_of_ctr_spec ctr_specs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
303 |
val raw_sel_defaultss = map sel_defaults_of_ctr_spec ctr_specs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
304 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
305 |
val n = length raw_ctrs; |
49054 | 306 |
val ks = 1 upto n; |
307 |
||
49121 | 308 |
val _ = if n > 0 then () else error "No constructors specified"; |
309 |
||
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
310 |
val ctrs0 = map (prep_term no_defs_lthy) raw_ctrs; |
55470
46e6e1d91056
removed needless robustness (no longer needed thanks to new syntax)
blanchet
parents:
55469
diff
changeset
|
311 |
val sel_defaultss = map (map (apsnd (prep_term no_defs_lthy))) raw_sel_defaultss; |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
312 |
|
53908 | 313 |
val Type (fcT_name, As0) = body_type (fastype_of (hd ctrs0)); |
314 |
val fc_b_name = Long_Name.base_name fcT_name; |
|
315 |
val fc_b = Binding.name fc_b_name; |
|
49055 | 316 |
|
55410 | 317 |
fun qualify mandatory = Binding.qualify mandatory fc_b_name; |
49633 | 318 |
|
54386 | 319 |
fun dest_TFree_or_TVar (TFree sS) = sS |
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53210
diff
changeset
|
320 |
| dest_TFree_or_TVar (TVar ((s, _), S)) = (s, S) |
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53210
diff
changeset
|
321 |
| dest_TFree_or_TVar _ = error "Invalid type argument"; |
52965
0cd62cb233e0
handle both TVars and TFrees -- necessary for 'wrap_free_constructors'
blanchet
parents:
52963
diff
changeset
|
322 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53210
diff
changeset
|
323 |
val (unsorted_As, B) = |
49055 | 324 |
no_defs_lthy |
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53210
diff
changeset
|
325 |
|> variant_tfrees (map (fst o dest_TFree_or_TVar) As0) |
49055 | 326 |
||> the_single o fst o mk_TFrees 1; |
327 |
||
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53210
diff
changeset
|
328 |
val As = map2 (resort_tfree o snd o dest_TFree_or_TVar) As0 unsorted_As; |
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53210
diff
changeset
|
329 |
|
53908 | 330 |
val fcT = Type (fcT_name, As); |
49055 | 331 |
val ctrs = map (mk_ctr As) ctrs0; |
332 |
val ctr_Tss = map (binder_types o fastype_of) ctrs; |
|
333 |
||
334 |
val ms = map length ctr_Tss; |
|
335 |
||
55470
46e6e1d91056
removed needless robustness (no longer needed thanks to new syntax)
blanchet
parents:
55469
diff
changeset
|
336 |
fun can_definitely_rely_on_disc k = not (Binding.is_empty (nth raw_disc_bindings (k - 1))); |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
337 |
fun can_rely_on_disc k = |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
338 |
can_definitely_rely_on_disc k orelse (k = 1 andalso not (can_definitely_rely_on_disc 2)); |
53925 | 339 |
fun should_omit_disc_binding k = n = 1 orelse (n = 2 andalso can_rely_on_disc (3 - k)); |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
340 |
|
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
341 |
fun is_disc_binding_valid b = |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
342 |
not (Binding.is_empty b orelse Binding.eq_name (b, equal_binding)); |
51787
1267c28c7bdd
changed discriminator default: avoid mixing ctor and dtor views
blanchet
parents:
51781
diff
changeset
|
343 |
|
52322 | 344 |
val standard_disc_binding = Binding.name o prefix isN o base_name_of_ctr; |
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
345 |
|
49336 | 346 |
val disc_bindings = |
55470
46e6e1d91056
removed needless robustness (no longer needed thanks to new syntax)
blanchet
parents:
55469
diff
changeset
|
347 |
raw_disc_bindings |
49120
7f8e69fc6ac9
smarter "*" syntax -- fallback on "_" if "*" is impossible
blanchet
parents:
49119
diff
changeset
|
348 |
|> map4 (fn k => fn m => fn ctr => fn disc => |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
349 |
qualify false |
51787
1267c28c7bdd
changed discriminator default: avoid mixing ctor and dtor views
blanchet
parents:
51781
diff
changeset
|
350 |
(if Binding.is_empty disc then |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
351 |
if should_omit_disc_binding k then disc else standard_disc_binding ctr |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
352 |
else if Binding.eq_name (disc, equal_binding) then |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
353 |
if m = 0 then disc |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
354 |
else error "Cannot use \"=\" syntax for discriminating nonnullary constructor" |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
355 |
else if Binding.eq_name (disc, standard_binding) then |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
356 |
standard_disc_binding ctr |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
357 |
else |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
358 |
disc)) ks ms ctrs0; |
49056 | 359 |
|
51787
1267c28c7bdd
changed discriminator default: avoid mixing ctor and dtor views
blanchet
parents:
51781
diff
changeset
|
360 |
fun standard_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
|
361 |
|
49336 | 362 |
val sel_bindingss = |
55470
46e6e1d91056
removed needless robustness (no longer needed thanks to new syntax)
blanchet
parents:
55469
diff
changeset
|
363 |
map3 (fn ctr => fn m => map2 (fn l => fn sel => |
49633 | 364 |
qualify false |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
365 |
(if Binding.is_empty sel orelse Binding.eq_name (sel, standard_binding) then |
51787
1267c28c7bdd
changed discriminator default: avoid mixing ctor and dtor views
blanchet
parents:
51781
diff
changeset
|
366 |
standard_sel_binding m l ctr |
49302
f5bd87aac224
added optional qualifiers for constructors and destructors, similarly to the old package
blanchet
parents:
49300
diff
changeset
|
367 |
else |
55470
46e6e1d91056
removed needless robustness (no longer needed thanks to new syntax)
blanchet
parents:
55469
diff
changeset
|
368 |
sel)) (1 upto m) o pad_list Binding.empty m) ctrs0 ms raw_sel_bindingss; |
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
369 |
|
49201 | 370 |
val case_Ts = map (fn Ts => Ts ---> B) ctr_Tss; |
49043 | 371 |
|
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
372 |
val (((((((([exh_y], (xss, xss')), yss), fs), gs), [u', v']), [w]), (p, p')), names_lthy) = |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
373 |
no_defs_lthy |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
374 |
|> mk_Frees "y" [fcT] (* for compatibility with "datatype_realizer.ML" *) |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
375 |
||>> mk_Freess' "x" ctr_Tss |
49025 | 376 |
||>> mk_Freess "y" ctr_Tss |
49201 | 377 |
||>> mk_Frees "f" case_Ts |
378 |
||>> mk_Frees "g" case_Ts |
|
53908 | 379 |
||>> (apfst (map (rpair fcT)) oo Variable.variant_fixes) [fc_b_name, fc_b_name ^ "'"] |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
380 |
||>> mk_Frees "z" [B] |
49043 | 381 |
||>> yield_singleton (apfst (op ~~) oo mk_Frees' "P") HOLogic.boolT; |
382 |
||
49498 | 383 |
val u = Free u'; |
384 |
val v = Free v'; |
|
49463 | 385 |
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
|
386 |
|
49025 | 387 |
val xctrs = map2 (curry Term.list_comb) ctrs xss; |
388 |
val yctrs = map2 (curry Term.list_comb) ctrs yss; |
|
49032 | 389 |
|
49043 | 390 |
val xfs = map2 (curry Term.list_comb) fs xss; |
391 |
val xgs = map2 (curry Term.list_comb) gs xss; |
|
392 |
||
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
393 |
(* TODO: Eta-expension is for compatibility with the old datatype package (but it also provides |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
394 |
nicer names). Consider removing. *) |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
395 |
val eta_fs = map2 eta_expand_arg xss xfs; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
396 |
val eta_gs = map2 eta_expand_arg xss xgs; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
397 |
|
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
398 |
val case_binding = |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
399 |
qualify false |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
400 |
(if Binding.is_empty raw_case_binding orelse |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
401 |
Binding.eq_name (raw_case_binding, standard_binding) then |
54493
5b34a5b93ec2
use type suffixes instead of prefixes for 'case', '(un)fold', '(co)rec'
blanchet
parents:
54491
diff
changeset
|
402 |
Binding.prefix_name (caseN ^ "_") fc_b |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
403 |
else |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
404 |
raw_case_binding); |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
405 |
|
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
406 |
fun mk_case_disj xctr xf xs = |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
407 |
list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr), HOLogic.mk_eq (w, xf))); |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
408 |
|
53925 | 409 |
val case_rhs = fold_rev (fold_rev Term.lambda) [fs, [u]] |
410 |
(Const (@{const_name The}, (B --> HOLogic.boolT) --> B) $ |
|
411 |
Term.lambda w (Library.foldr1 HOLogic.mk_disj (map3 mk_case_disj xctrs xfs xss))); |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
412 |
|
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
413 |
val ((raw_case, (_, raw_case_def)), (lthy', lthy)) = no_defs_lthy |
54155 | 414 |
|> Local_Theory.define ((case_binding, NoSyn), |
415 |
((Binding.conceal (Thm.def_binding case_binding), []), case_rhs)) |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
416 |
||> `Local_Theory.restore; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
417 |
|
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
418 |
val phi = Proof_Context.export_morphism lthy lthy'; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
419 |
|
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
420 |
val case_def = Morphism.thm phi raw_case_def; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
421 |
|
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
422 |
val case0 = Morphism.term phi raw_case; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
423 |
val casex = mk_case As B case0; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
424 |
|
51759
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
425 |
val fcase = Term.list_comb (casex, fs); |
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
426 |
|
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
427 |
val ufcase = fcase $ u; |
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
428 |
val vfcase = fcase $ v; |
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
429 |
|
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
430 |
val eta_fcase = Term.list_comb (casex, eta_fs); |
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
431 |
val eta_gcase = Term.list_comb (casex, eta_gs); |
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
432 |
|
51759
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
433 |
val eta_ufcase = eta_fcase $ u; |
587bba425430
eta-contracted weak congruence rules (like in the old package)
blanchet
parents:
51757
diff
changeset
|
434 |
val eta_vgcase = eta_gcase $ v; |
49486 | 435 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
436 |
fun mk_uu_eq () = HOLogic.mk_eq (u, u); |
49486 | 437 |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
438 |
val uv_eq = mk_Trueprop_eq (u, v); |
49486 | 439 |
|
440 |
val exist_xs_u_eq_ctrs = |
|
441 |
map2 (fn xctr => fn xs => list_exists_free xs (HOLogic.mk_eq (u, xctr))) xctrs xss; |
|
49022 | 442 |
|
51743 | 443 |
val unique_disc_no_def = TrueI; (*arbitrary marker*) |
444 |
val alternate_disc_no_def = FalseE; (*arbitrary marker*) |
|
445 |
||
49486 | 446 |
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
|
447 |
HOLogic.mk_not |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
448 |
(let val b = nth disc_bindings (k - 1) in |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
449 |
if is_disc_binding_valid b then get_udisc b (k - 1) else nth exist_xs_u_eq_ctrs (k - 1) |
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51787
diff
changeset
|
450 |
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
|
451 |
|
53917 | 452 |
val (all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy') = |
52969
f2df0730f8ac
clarified option name (since case/fold/rec are also destructors)
blanchet
parents:
52968
diff
changeset
|
453 |
if no_discs_sels then |
55407
81f7e60755c3
use right local theory -- shows up when 'no_discs_sels' is set
blanchet
parents:
55394
diff
changeset
|
454 |
(true, [], [], [], [], [], lthy') |
49278 | 455 |
else |
456 |
let |
|
53908 | 457 |
fun disc_free b = Free (Binding.name_of b, mk_pred1T fcT); |
49025 | 458 |
|
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
459 |
fun disc_spec b exist_xs_u_eq_ctr = mk_Trueprop_eq (disc_free b $ u, exist_xs_u_eq_ctr); |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
460 |
|
49500 | 461 |
fun alternate_disc k = |
462 |
Term.lambda u (alternate_disc_lhs (K o rapp u o disc_free) (3 - k)); |
|
49278 | 463 |
|
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
464 |
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
|
465 |
map2 (fn Ts => fn k => |
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
466 |
(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
|
467 |
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
|
468 |
(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
|
469 |
NONE => fold_rev (Term.lambda o curry Free Name.uu) Ts (mk_undefined T) |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
470 |
| SOME t => t |> Type.constraint (Ts ---> T) |> Syntax.check_term lthy) |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
471 |
| 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
|
472 |
|
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
473 |
fun sel_spec b proto_sels = |
49278 | 474 |
let |
475 |
val _ = |
|
476 |
(case duplicates (op =) (map fst proto_sels) of |
|
477 |
k :: _ => error ("Duplicate selector name " ^ quote (Binding.name_of b) ^ |
|
478 |
" for constructor " ^ |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
479 |
quote (Syntax.string_of_term lthy (nth ctrs (k - 1)))) |
49278 | 480 |
| [] => ()) |
481 |
val T = |
|
482 |
(case distinct (op =) (map (fastype_of o snd o snd) proto_sels) of |
|
483 |
[T] => T |
|
484 |
| T :: T' :: _ => error ("Inconsistent range type for selector " ^ |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
485 |
quote (Binding.name_of b) ^ ": " ^ quote (Syntax.string_of_typ lthy T) ^ " vs. " |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
486 |
^ quote (Syntax.string_of_typ lthy T'))); |
49278 | 487 |
in |
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
488 |
mk_Trueprop_eq (Free (Binding.name_of b, fcT --> T) $ u, |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
489 |
Term.list_comb (mk_case As T case0, mk_sel_case_args b proto_sels T) $ u) |
49278 | 490 |
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
|
491 |
|
49336 | 492 |
val sel_bindings = flat sel_bindingss; |
493 |
val uniq_sel_bindings = distinct Binding.eq_name sel_bindings; |
|
494 |
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
|
495 |
|
49336 | 496 |
val sel_binding_index = |
497 |
if all_sels_distinct then 1 upto length sel_bindings |
|
498 |
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
|
499 |
|
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
|
500 |
val proto_sels = flat (map3 (fn k => fn xs => map (fn x => (k, (xs, x)))) ks xss xss); |
49300 | 501 |
val sel_infos = |
49336 | 502 |
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
|
503 |
|> sort (int_ord o pairself fst) |
49336 | 504 |
|> map snd |> curry (op ~~) uniq_sel_bindings; |
505 |
val sel_bindings = map fst sel_infos; |
|
49258
84f13469d7f0
allow same selector name for several constructors
blanchet
parents:
49257
diff
changeset
|
506 |
|
49336 | 507 |
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
|
508 |
|
49278 | 509 |
val (((raw_discs, raw_disc_defs), (raw_sels, raw_sel_defs)), (lthy', lthy)) = |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
510 |
lthy |
51809 | 511 |
|> apfst split_list o fold_map3 (fn k => fn exist_xs_u_eq_ctr => fn b => |
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
512 |
if Binding.is_empty b then |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
513 |
if n = 1 then pair (Term.lambda u (mk_uu_eq ()), unique_disc_no_def) |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
514 |
else pair (alternate_disc k, alternate_disc_no_def) |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
515 |
else if Binding.eq_name (b, equal_binding) then |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
516 |
pair (Term.lambda u exist_xs_u_eq_ctr, refl) |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
517 |
else |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
518 |
Specification.definition (SOME (b, NONE, NoSyn), |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
519 |
((Thm.def_binding b, []), disc_spec b exist_xs_u_eq_ctr)) #>> apsnd snd) |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
520 |
ks exist_xs_u_eq_ctrs disc_bindings |
49278 | 521 |
||>> apfst split_list o fold_map (fn (b, proto_sels) => |
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
522 |
Specification.definition (SOME (b, NONE, NoSyn), |
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
523 |
((Thm.def_binding b, []), sel_spec b proto_sels)) #>> apsnd snd) sel_infos |
49278 | 524 |
||> `Local_Theory.restore; |
49022 | 525 |
|
49278 | 526 |
val phi = Proof_Context.export_morphism lthy lthy'; |
49025 | 527 |
|
49278 | 528 |
val disc_defs = map (Morphism.thm phi) raw_disc_defs; |
49281 | 529 |
val sel_defs = map (Morphism.thm phi) raw_sel_defs; |
530 |
val sel_defss = unflat_selss sel_defs; |
|
49278 | 531 |
|
532 |
val discs0 = map (Morphism.term phi) raw_discs; |
|
533 |
val selss0 = unflat_selss (map (Morphism.term phi) raw_sels); |
|
49028 | 534 |
|
49278 | 535 |
val discs = map (mk_disc_or_sel As) discs0; |
536 |
val selss = map (map (mk_disc_or_sel As)) selss0; |
|
537 |
in |
|
53917 | 538 |
(all_sels_distinct, discs, selss, disc_defs, sel_defs, sel_defss, lthy') |
49278 | 539 |
end; |
49025 | 540 |
|
49032 | 541 |
fun mk_imp_p Qs = Logic.list_implies (Qs, HOLogic.mk_Trueprop p); |
49029 | 542 |
|
49458 | 543 |
val exhaust_goal = |
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
544 |
let fun mk_prem xctr xs = fold_rev Logic.all xs (mk_imp_p [mk_Trueprop_eq (exh_y, xctr)]) in |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
545 |
fold_rev Logic.all [p, exh_y] (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
|
546 |
end; |
49019 | 547 |
|
49484 | 548 |
val inject_goalss = |
49017 | 549 |
let |
49034
b77e1910af8a
make parallel list indexing possible for inject theorems
blanchet
parents:
49033
diff
changeset
|
550 |
fun mk_goal _ _ [] [] = [] |
49025 | 551 |
| mk_goal xctr yctr xs ys = |
49121 | 552 |
[fold_rev Logic.all (xs @ ys) (mk_Trueprop_eq (HOLogic.mk_eq (xctr, yctr), |
553 |
Library.foldr1 HOLogic.mk_conj (map2 (curry HOLogic.mk_eq) xs ys)))]; |
|
49017 | 554 |
in |
49034
b77e1910af8a
make parallel list indexing possible for inject theorems
blanchet
parents:
49033
diff
changeset
|
555 |
map4 mk_goal xctrs yctrs xss yss |
49017 | 556 |
end; |
557 |
||
49484 | 558 |
val half_distinct_goalss = |
49121 | 559 |
let |
49203 | 560 |
fun mk_goal ((xs, xc), (xs', xc')) = |
49121 | 561 |
fold_rev Logic.all (xs @ xs') |
49203 | 562 |
(HOLogic.mk_Trueprop (HOLogic.mk_not (HOLogic.mk_eq (xc, xc')))); |
49121 | 563 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
564 |
map (map mk_goal) (mk_half_pairss (`I (xss ~~ xctrs))) |
49121 | 565 |
end; |
49019 | 566 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
567 |
val goalss = [exhaust_goal] :: inject_goalss @ half_distinct_goalss; |
49019 | 568 |
|
569 |
fun after_qed thmss lthy = |
|
570 |
let |
|
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
571 |
val ([exhaust_thm0], (inject_thmss, half_distinct_thmss)) = (hd thmss, chop n (tl thmss)); |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
572 |
(* for "datatype_realizer.ML": *) |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
573 |
val exhaust_thm = |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
574 |
Thm.name_derivation (fcT_name ^ Long_Name.separator ^ exhaustN) exhaust_thm0; |
49019 | 575 |
|
49438 | 576 |
val inject_thms = flat inject_thmss; |
577 |
||
53210
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53040
diff
changeset
|
578 |
val rho_As = map (pairself (certifyT lthy)) (map Logic.varifyT_global As ~~ As); |
49486 | 579 |
|
580 |
fun inst_thm t thm = |
|
581 |
Drule.instantiate' [] [SOME (certify lthy t)] |
|
53210
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53040
diff
changeset
|
582 |
(Thm.instantiate (rho_As, []) (Drule.zero_var_indexes thm)); |
49486 | 583 |
|
584 |
val uexhaust_thm = inst_thm u exhaust_thm; |
|
49032 | 585 |
|
49300 | 586 |
val exhaust_cases = map base_name_of_ctr ctrs; |
587 |
||
49048
4e0f0f98be02
rationalized data structure for distinctness theorems
blanchet
parents:
49046
diff
changeset
|
588 |
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
|
589 |
|
49486 | 590 |
val (distinct_thms, (distinct_thmsss', distinct_thmsss)) = |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
591 |
join_halves n half_distinct_thmss other_half_distinct_thmss ||> `transpose; |
49019 | 592 |
|
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
593 |
val nchotomy_thm = |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
594 |
let |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
595 |
val goal = |
49486 | 596 |
HOLogic.mk_Trueprop (HOLogic.mk_all (fst u', snd u', |
597 |
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
|
598 |
in |
51551 | 599 |
Goal.prove_sorry lthy [] [] goal (fn _ => mk_nchotomy_tac n exhaust_thm) |
49667
44d85dc8ca08
use Thm.close_derivation in theorems proved using Skip_Proof.prove; tuned signature;
traytel
parents:
49633
diff
changeset
|
600 |
|> Thm.close_derivation |
49020
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
601 |
end; |
f379cf5d71bd
more work on BNF sugar -- up to derivation of nchotomy
blanchet
parents:
49019
diff
changeset
|
602 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
603 |
val case_thms = |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
604 |
let |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
605 |
val goals = |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
606 |
map3 (fn xctr => fn xf => fn xs => |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
607 |
fold_rev Logic.all (fs @ xs) (mk_Trueprop_eq (fcase $ xctr, xf))) xctrs xfs xss; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
608 |
in |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
609 |
map4 (fn k => fn goal => fn injects => fn distinctss => |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
610 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
611 |
mk_case_tac ctxt n k case_def injects distinctss) |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
612 |
|> Thm.close_derivation) |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
613 |
ks goals inject_thmss distinct_thmsss |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
614 |
end; |
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52965
diff
changeset
|
615 |
|
53917 | 616 |
val (case_cong_thm, weak_case_cong_thm) = |
617 |
let |
|
618 |
fun mk_prem xctr xs xf xg = |
|
619 |
fold_rev Logic.all xs (Logic.mk_implies (mk_Trueprop_eq (v, xctr), |
|
620 |
mk_Trueprop_eq (xf, xg))); |
|
621 |
||
622 |
val goal = |
|
623 |
Logic.list_implies (uv_eq :: map4 mk_prem xctrs xss xfs xgs, |
|
624 |
mk_Trueprop_eq (eta_ufcase, eta_vgcase)); |
|
625 |
val weak_goal = Logic.mk_implies (uv_eq, mk_Trueprop_eq (ufcase, vfcase)); |
|
626 |
in |
|
627 |
(Goal.prove_sorry lthy [] [] goal (fn _ => mk_case_cong_tac lthy uexhaust_thm case_thms), |
|
628 |
Goal.prove_sorry lthy [] [] weak_goal (K (etac arg_cong 1))) |
|
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
629 |
|> pairself (singleton (Proof_Context.export names_lthy lthy) #> |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
630 |
Thm.close_derivation) |
53917 | 631 |
end; |
632 |
||
633 |
val split_lhs = q $ ufcase; |
|
634 |
||
635 |
fun mk_split_conjunct xctr xs f_xs = |
|
636 |
list_all_free xs (HOLogic.mk_imp (HOLogic.mk_eq (u, xctr), q $ f_xs)); |
|
637 |
fun mk_split_disjunct xctr xs f_xs = |
|
638 |
list_exists_free xs (HOLogic.mk_conj (HOLogic.mk_eq (u, xctr), |
|
639 |
HOLogic.mk_not (q $ f_xs))); |
|
640 |
||
641 |
fun mk_split_goal xctrs xss xfs = |
|
642 |
mk_Trueprop_eq (split_lhs, Library.foldr1 HOLogic.mk_conj |
|
643 |
(map3 mk_split_conjunct xctrs xss xfs)); |
|
644 |
fun mk_split_asm_goal xctrs xss xfs = |
|
645 |
mk_Trueprop_eq (split_lhs, HOLogic.mk_not (Library.foldr1 HOLogic.mk_disj |
|
646 |
(map3 mk_split_disjunct xctrs xss xfs))); |
|
647 |
||
648 |
fun prove_split selss goal = |
|
649 |
Goal.prove_sorry lthy [] [] goal (fn _ => |
|
650 |
mk_split_tac lthy uexhaust_thm case_thms selss inject_thmss distinct_thmsss) |
|
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
651 |
|> singleton (Proof_Context.export names_lthy lthy) |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
652 |
|> Thm.close_derivation; |
53917 | 653 |
|
654 |
fun prove_split_asm asm_goal split_thm = |
|
655 |
Goal.prove_sorry lthy [] [] asm_goal (fn {context = ctxt, ...} => |
|
656 |
mk_split_asm_tac ctxt split_thm) |
|
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
657 |
|> singleton (Proof_Context.export names_lthy lthy) |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
658 |
|> Thm.close_derivation; |
53917 | 659 |
|
660 |
val (split_thm, split_asm_thm) = |
|
661 |
let |
|
662 |
val goal = mk_split_goal xctrs xss xfs; |
|
663 |
val asm_goal = mk_split_asm_goal xctrs xss xfs; |
|
664 |
||
665 |
val thm = prove_split (replicate n []) goal; |
|
666 |
val asm_thm = prove_split_asm asm_goal thm; |
|
667 |
in |
|
668 |
(thm, asm_thm) |
|
669 |
end; |
|
670 |
||
55464 | 671 |
val (all_sel_thms, sel_thmss, disc_thmss, nontriv_disc_thmss, discI_thms, |
672 |
nontriv_discI_thms, disc_exclude_thms, disc_exclude_thmsss, disc_exhaust_thms, |
|
673 |
sel_exhaust_thms, all_collapse_thms, safe_collapse_thms, expand_thms, sel_split_thms, |
|
674 |
sel_split_asm_thms, case_eq_if_thms) = |
|
52969
f2df0730f8ac
clarified option name (since case/fold/rec are also destructors)
blanchet
parents:
52968
diff
changeset
|
675 |
if no_discs_sels then |
54900 | 676 |
([], [], [], [], [], [], [], [], [], [], [], [], [], [], [], []) |
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
|
677 |
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
|
678 |
let |
53917 | 679 |
val udiscs = map (rapp u) discs; |
680 |
val uselss = map (map (rapp u)) selss; |
|
681 |
val usel_ctrs = map2 (curry Term.list_comb) ctrs uselss; |
|
682 |
val usel_fs = map2 (curry Term.list_comb) fs uselss; |
|
683 |
||
684 |
val vdiscs = map (rapp v) discs; |
|
685 |
val vselss = map (map (rapp v)) selss; |
|
686 |
||
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
|
687 |
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
|
688 |
zero_var_indexes (Drule.gen_all (Drule.rename_bvars' (map (SOME o fst) xs') |
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
689 |
(Drule.forall_intr_vars (case_thm RS (sel_def RS trans))))); |
49281 | 690 |
|
53704 | 691 |
val sel_thmss = map3 (map oo make_sel_thm) xss' case_thms sel_defss; |
692 |
||
49281 | 693 |
fun has_undefined_rhs thm = |
694 |
(case snd (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of thm))) of |
|
695 |
Const (@{const_name undefined}, _) => true |
|
696 |
| _ => false); |
|
697 |
||
698 |
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
|
699 |
(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
|
700 |
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
|
701 |
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
|
702 |
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
|
703 |
(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
|
704 |
|> filter_out has_undefined_rhs; |
49278 | 705 |
|
706 |
fun mk_unique_disc_def () = |
|
707 |
let |
|
708 |
val m = the_single ms; |
|
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
709 |
val goal = mk_Trueprop_eq (mk_uu_eq (), the_single exist_xs_u_eq_ctrs); |
49278 | 710 |
in |
51551 | 711 |
Goal.prove_sorry lthy [] [] goal (fn _ => mk_unique_disc_def_tac m uexhaust_thm) |
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
712 |
|> singleton (Proof_Context.export names_lthy lthy) |
49692 | 713 |
|> Thm.close_derivation |
49278 | 714 |
end; |
715 |
||
716 |
fun mk_alternate_disc_def k = |
|
717 |
let |
|
718 |
val goal = |
|
49486 | 719 |
mk_Trueprop_eq (alternate_disc_lhs (K (nth udiscs)) (3 - k), |
720 |
nth exist_xs_u_eq_ctrs (k - 1)); |
|
49278 | 721 |
in |
51551 | 722 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
723 |
mk_alternate_disc_def_tac ctxt k (nth disc_defs (2 - k)) |
49486 | 724 |
(nth distinct_thms (2 - k)) uexhaust_thm) |
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
725 |
|> singleton (Proof_Context.export names_lthy lthy) |
49692 | 726 |
|> Thm.close_derivation |
49278 | 727 |
end; |
49028 | 728 |
|
49278 | 729 |
val has_alternate_disc_def = |
730 |
exists (fn def => Thm.eq_thm_prop (def, alternate_disc_no_def)) disc_defs; |
|
731 |
||
732 |
val disc_defs' = |
|
733 |
map2 (fn k => fn def => |
|
734 |
if Thm.eq_thm_prop (def, unique_disc_no_def) then mk_unique_disc_def () |
|
735 |
else if Thm.eq_thm_prop (def, alternate_disc_no_def) then mk_alternate_disc_def k |
|
54634
366297517091
reverted 141cb34744de and e78e7df36690 -- better provide nicer "eta-expanded" definitions for discriminators and selectors, since users might want to unfold them
blanchet
parents:
54626
diff
changeset
|
736 |
else def) ks disc_defs; |
49278 | 737 |
|
738 |
val discD_thms = map (fn def => def RS iffD1) disc_defs'; |
|
739 |
val discI_thms = |
|
740 |
map2 (fn m => fn def => funpow m (fn thm => exI RS thm) (def RS iffD2)) ms |
|
741 |
disc_defs'; |
|
742 |
val not_discI_thms = |
|
743 |
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
|
744 |
(unfold_thms lthy @{thms not_ex} (def RS @{thm ssubst[of _ _ Not]}))) |
49278 | 745 |
ms disc_defs'; |
746 |
||
747 |
val (disc_thmss', disc_thmss) = |
|
748 |
let |
|
749 |
fun mk_thm discI _ [] = refl RS discI |
|
750 |
| mk_thm _ not_discI [distinct] = distinct RS not_discI; |
|
751 |
fun mk_thms discI not_discI distinctss = map (mk_thm discI not_discI) distinctss; |
|
752 |
in |
|
753 |
map3 mk_thms discI_thms not_discI_thms distinct_thmsss' |> `transpose |
|
754 |
end; |
|
755 |
||
55464 | 756 |
val nontriv_disc_thmss = |
757 |
map2 (fn b => if is_disc_binding_valid b then I else K []) disc_bindings disc_thmss; |
|
53704 | 758 |
|
759 |
fun is_discI_boring b = |
|
760 |
(n = 1 andalso Binding.is_empty b) orelse Binding.eq_name (b, equal_binding); |
|
761 |
||
762 |
val nontriv_discI_thms = |
|
763 |
flat (map2 (fn b => if is_discI_boring b then K [] else single) disc_bindings |
|
764 |
discI_thms); |
|
49028 | 765 |
|
49486 | 766 |
val (disc_exclude_thms, (disc_exclude_thmsss', disc_exclude_thmsss)) = |
767 |
let |
|
768 |
fun mk_goal [] = [] |
|
769 |
| mk_goal [((_, udisc), (_, udisc'))] = |
|
770 |
[Logic.all u (Logic.mk_implies (HOLogic.mk_Trueprop udisc, |
|
771 |
HOLogic.mk_Trueprop (HOLogic.mk_not udisc')))]; |
|
772 |
||
49667
44d85dc8ca08
use Thm.close_derivation in theorems proved using Skip_Proof.prove; tuned signature;
traytel
parents:
49633
diff
changeset
|
773 |
fun prove tac goal = |
51551 | 774 |
Goal.prove_sorry lthy [] [] goal (K tac) |
49667
44d85dc8ca08
use Thm.close_derivation in theorems proved using Skip_Proof.prove; tuned signature;
traytel
parents:
49633
diff
changeset
|
775 |
|> Thm.close_derivation; |
49486 | 776 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
777 |
val half_pairss = mk_half_pairss (`I (ms ~~ discD_thms ~~ udiscs)); |
49486 | 778 |
|
779 |
val half_goalss = map mk_goal half_pairss; |
|
780 |
val half_thmss = |
|
781 |
map3 (fn [] => K (K []) | [goal] => fn [(((m, discD), _), _)] => |
|
51798 | 782 |
fn disc_thm => [prove (mk_half_disc_exclude_tac lthy m discD disc_thm) goal]) |
49486 | 783 |
half_goalss half_pairss (flat disc_thmss'); |
49278 | 784 |
|
49486 | 785 |
val other_half_goalss = map (mk_goal o map swap) half_pairss; |
786 |
val other_half_thmss = |
|
787 |
map2 (map2 (prove o mk_other_half_disc_exclude_tac)) half_thmss |
|
788 |
other_half_goalss; |
|
789 |
in |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49536
diff
changeset
|
790 |
join_halves n half_thmss other_half_thmss ||> `transpose |
49486 | 791 |
|>> has_alternate_disc_def ? K [] |
792 |
end; |
|
49278 | 793 |
|
49486 | 794 |
val disc_exhaust_thm = |
795 |
let |
|
796 |
fun mk_prem udisc = mk_imp_p [HOLogic.mk_Trueprop udisc]; |
|
797 |
val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem udiscs)); |
|
798 |
in |
|
51551 | 799 |
Goal.prove_sorry lthy [] [] goal (fn _ => |
49486 | 800 |
mk_disc_exhaust_tac n exhaust_thm discI_thms) |
49667
44d85dc8ca08
use Thm.close_derivation in theorems proved using Skip_Proof.prove; tuned signature;
traytel
parents:
49633
diff
changeset
|
801 |
|> Thm.close_derivation |
49486 | 802 |
end; |
49028 | 803 |
|
53740 | 804 |
val (safe_collapse_thms, all_collapse_thms) = |
49486 | 805 |
let |
54008
b15cfc2864de
refactoring -- splitting between constructor sugar dependencies and true BNF dependencies
blanchet
parents:
54007
diff
changeset
|
806 |
fun mk_goal m udisc usel_ctr = |
49486 | 807 |
let |
808 |
val prem = HOLogic.mk_Trueprop udisc; |
|
53916 | 809 |
val concl = mk_Trueprop_eq ((usel_ctr, u) |> m = 0 ? swap); |
49486 | 810 |
in |
53740 | 811 |
(prem aconv concl, Logic.all u (Logic.mk_implies (prem, concl))) |
49486 | 812 |
end; |
54008
b15cfc2864de
refactoring -- splitting between constructor sugar dependencies and true BNF dependencies
blanchet
parents:
54007
diff
changeset
|
813 |
val (trivs, goals) = map3 mk_goal ms udiscs usel_ctrs |> split_list; |
53740 | 814 |
val thms = |
815 |
map5 (fn m => fn discD => fn sel_thms => fn triv => fn goal => |
|
816 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
|
817 |
mk_collapse_tac ctxt m discD sel_thms ORELSE HEADGOAL atac) |
|
818 |
|> Thm.close_derivation |
|
819 |
|> not triv ? perhaps (try (fn thm => refl RS thm))) |
|
820 |
ms discD_thms sel_thmss trivs goals; |
|
49486 | 821 |
in |
53740 | 822 |
(map_filter (fn (true, _) => NONE | (false, thm) => SOME thm) (trivs ~~ thms), |
823 |
thms) |
|
49486 | 824 |
end; |
49025 | 825 |
|
53916 | 826 |
val swapped_all_collapse_thms = |
827 |
map2 (fn m => fn thm => if m = 0 then thm else thm RS sym) ms all_collapse_thms; |
|
828 |
||
829 |
val sel_exhaust_thm = |
|
830 |
let |
|
831 |
fun mk_prem usel_ctr = mk_imp_p [mk_Trueprop_eq (u, usel_ctr)]; |
|
832 |
val goal = fold_rev Logic.all [p, u] (mk_imp_p (map mk_prem usel_ctrs)); |
|
833 |
in |
|
834 |
Goal.prove_sorry lthy [] [] goal (fn _ => |
|
835 |
mk_sel_exhaust_tac n disc_exhaust_thm swapped_all_collapse_thms) |
|
836 |
|> Thm.close_derivation |
|
837 |
end; |
|
838 |
||
53919 | 839 |
val expand_thm = |
49486 | 840 |
let |
841 |
fun mk_prems k udisc usels vdisc vsels = |
|
842 |
(if k = n then [] else [mk_Trueprop_eq (udisc, vdisc)]) @ |
|
843 |
(if null usels then |
|
844 |
[] |
|
845 |
else |
|
846 |
[Logic.list_implies |
|
847 |
(if n = 1 then [] else map HOLogic.mk_Trueprop [udisc, vdisc], |
|
848 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
|
849 |
(map2 (curry HOLogic.mk_eq) usels vsels)))]); |
|
850 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
851 |
val goal = |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
852 |
Library.foldr Logic.list_implies |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49586
diff
changeset
|
853 |
(map5 mk_prems ks udiscs uselss vdiscs vselss, uv_eq); |
49486 | 854 |
val uncollapse_thms = |
53740 | 855 |
map2 (fn thm => fn [] => thm | _ => thm RS sym) all_collapse_thms uselss; |
49486 | 856 |
in |
53919 | 857 |
Goal.prove_sorry lthy [] [] goal (fn _ => |
858 |
mk_expand_tac lthy n ms (inst_thm u disc_exhaust_thm) |
|
859 |
(inst_thm v disc_exhaust_thm) uncollapse_thms disc_exclude_thmsss |
|
860 |
disc_exclude_thmsss') |
|
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
861 |
|> singleton (Proof_Context.export names_lthy lthy) |
53919 | 862 |
|> Thm.close_derivation |
49486 | 863 |
end; |
49278 | 864 |
|
53917 | 865 |
val (sel_split_thm, sel_split_asm_thm) = |
866 |
let |
|
867 |
val zss = map (K []) xss; |
|
868 |
val goal = mk_split_goal usel_ctrs zss usel_fs; |
|
869 |
val asm_goal = mk_split_asm_goal usel_ctrs zss usel_fs; |
|
870 |
||
871 |
val thm = prove_split sel_thmss goal; |
|
872 |
val asm_thm = prove_split_asm asm_goal thm; |
|
873 |
in |
|
874 |
(thm, asm_thm) |
|
875 |
end; |
|
876 |
||
54491 | 877 |
val case_eq_if_thm = |
49486 | 878 |
let |
53917 | 879 |
val goal = mk_Trueprop_eq (ufcase, mk_IfN B udiscs usel_fs); |
49486 | 880 |
in |
53919 | 881 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
54491 | 882 |
mk_case_eq_if_tac ctxt n uexhaust_thm case_thms disc_thmss' sel_thmss) |
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55407
diff
changeset
|
883 |
|> singleton (Proof_Context.export names_lthy lthy) |
53919 | 884 |
|> Thm.close_derivation |
49486 | 885 |
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
|
886 |
in |
55464 | 887 |
(all_sel_thms, sel_thmss, disc_thmss, nontriv_disc_thmss, discI_thms, |
54900 | 888 |
nontriv_discI_thms, disc_exclude_thms, disc_exclude_thmsss, [disc_exhaust_thm], |
889 |
[sel_exhaust_thm], all_collapse_thms, safe_collapse_thms, [expand_thm], |
|
890 |
[sel_split_thm], [sel_split_asm_thm], [case_eq_if_thm]) |
|
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
|
891 |
end; |
49025 | 892 |
|
49437 | 893 |
val exhaust_case_names_attr = Attrib.internal (K (Rule_Cases.case_names exhaust_cases)); |
53908 | 894 |
val cases_type_attr = Attrib.internal (K (Induct.cases_type fcT_name)); |
49300 | 895 |
|
55464 | 896 |
val nontriv_disc_eq_thmss = |
897 |
map (map (fn th => th RS @{thm eq_False[THEN iffD2]} |
|
898 |
handle THM _ => th RS @{thm eq_True[THEN iffD2]})) nontriv_disc_thmss; |
|
899 |
||
54151 | 900 |
val anonymous_notes = |
901 |
[(map (fn th => th RS notE) distinct_thms, safe_elim_attrs), |
|
55464 | 902 |
(flat nontriv_disc_eq_thmss, code_nitpicksimp_attrs)] |
54151 | 903 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
904 |
||
49052 | 905 |
val notes = |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54008
diff
changeset
|
906 |
[(caseN, case_thms, code_nitpicksimp_simp_attrs), |
49594
55e798614c45
tweaked theorem names (in particular, dropped s's)
blanchet
parents:
49591
diff
changeset
|
907 |
(case_congN, [case_cong_thm], []), |
54491 | 908 |
(case_eq_ifN, case_eq_if_thms, []), |
53740 | 909 |
(collapseN, safe_collapse_thms, simp_attrs), |
55464 | 910 |
(discN, flat nontriv_disc_thmss, simp_attrs), |
53700 | 911 |
(discIN, nontriv_discI_thms, []), |
53836 | 912 |
(disc_excludeN, disc_exclude_thms, dest_attrs), |
49300 | 913 |
(disc_exhaustN, disc_exhaust_thms, [exhaust_case_names_attr]), |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54008
diff
changeset
|
914 |
(distinctN, distinct_thms, simp_attrs @ inductsimp_attrs), |
49300 | 915 |
(exhaustN, [exhaust_thm], [exhaust_case_names_attr, cases_type_attr]), |
49486 | 916 |
(expandN, expand_thms, []), |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54008
diff
changeset
|
917 |
(injectN, inject_thms, iff_attrs @ inductsimp_attrs), |
49300 | 918 |
(nchotomyN, [nchotomy_thm], []), |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54008
diff
changeset
|
919 |
(selN, all_sel_thms, code_nitpicksimp_simp_attrs), |
53916 | 920 |
(sel_exhaustN, sel_exhaust_thms, [exhaust_case_names_attr]), |
53917 | 921 |
(sel_splitN, sel_split_thms, []), |
922 |
(sel_split_asmN, sel_split_asm_thms, []), |
|
49300 | 923 |
(splitN, [split_thm], []), |
924 |
(split_asmN, [split_asm_thm], []), |
|
49633 | 925 |
(splitsN, [split_thm, split_asm_thm], []), |
49300 | 926 |
(weak_case_cong_thmsN, [weak_case_cong_thm], cong_attrs)] |
927 |
|> filter_out (null o #2) |
|
928 |
|> map (fn (thmN, thms, attrs) => |
|
49633 | 929 |
((qualify true (Binding.name thmN), attrs), [(thms, [])])); |
49300 | 930 |
|
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
931 |
val ctr_sugar = |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
932 |
{ctrs = ctrs, casex = casex, discs = discs, selss = selss, exhaust = exhaust_thm, |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
933 |
nchotomy = nchotomy_thm, injects = inject_thms, distincts = distinct_thms, |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
934 |
case_thms = case_thms, case_cong = case_cong_thm, weak_case_cong = weak_case_cong_thm, |
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
935 |
split = split_thm, split_asm = split_asm_thm, disc_thmss = disc_thmss, |
54900 | 936 |
discIs = discI_thms, sel_thmss = sel_thmss, disc_excludesss = disc_exclude_thmsss, |
937 |
disc_exhausts = disc_exhaust_thms, sel_exhausts = sel_exhaust_thms, |
|
938 |
collapses = all_collapse_thms, expands = expand_thms, sel_splits = sel_split_thms, |
|
939 |
sel_split_asms = sel_split_asm_thms, case_eq_ifs = case_eq_if_thms}; |
|
49019 | 940 |
in |
53867
8ad44ecc0d15
keep a database of free constructor type information
blanchet
parents:
53864
diff
changeset
|
941 |
(ctr_sugar, |
51819 | 942 |
lthy |
55464 | 943 |
|> Spec_Rules.add Spec_Rules.Equational ([casex], case_thms) |
55471 | 944 |
|> fold (Spec_Rules.add Spec_Rules.Equational) |
55535
10194808430d
name derivations in 'primrec' for code extraction from proof terms
blanchet
parents:
55480
diff
changeset
|
945 |
(AList.group (eq_list (op aconv)) (map (`(single o lhs_head_of)) all_sel_thms)) |
55471 | 946 |
|> fold (Spec_Rules.add Spec_Rules.Equational) |
947 |
(filter_out (null o snd) (map single discs ~~ nontriv_disc_eq_thmss)) |
|
55410 | 948 |
|> Local_Theory.declaration {syntax = false, pervasive = true} |
54615
62fb5af93fe2
generalized datatype code generation code so that it works with old-style and new-style (co)datatypes (as long as they are not local)
blanchet
parents:
54493
diff
changeset
|
949 |
(fn phi => Case_Translation.register |
62fb5af93fe2
generalized datatype code generation code so that it works with old-style and new-style (co)datatypes (as long as they are not local)
blanchet
parents:
54493
diff
changeset
|
950 |
(Morphism.term phi casex) (map (Morphism.term phi) ctrs)) |
54691
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
951 |
|> Local_Theory.background_theory (fold (fold Code.del_eqn) [disc_defs, sel_defs]) |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
952 |
|> not no_code ? |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
953 |
Local_Theory.declaration {syntax = false, pervasive = false} |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
954 |
(fn phi => Context.mapping |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
955 |
(add_ctr_code fcT_name (map (Morphism.typ phi) As) |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
956 |
(map (dest_Const o Morphism.term phi) ctrs) (Morphism.fact phi inject_thms) |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
957 |
(Morphism.fact phi distinct_thms) (Morphism.fact phi case_thms)) |
506312c293f5
code equations for "local" (co)datatypes available after interpretation of locales with assumptions
traytel
parents:
54635
diff
changeset
|
958 |
I) |
54635
30666a281ae3
proper code generation for discriminators/selectors
blanchet
parents:
54634
diff
changeset
|
959 |
|> Local_Theory.notes (anonymous_notes @ notes) |> snd |
30666a281ae3
proper code generation for discriminators/selectors
blanchet
parents:
54634
diff
changeset
|
960 |
|> register_ctr_sugar fcT_name ctr_sugar) |
49019 | 961 |
end; |
49017 | 962 |
in |
49121 | 963 |
(goalss, after_qed, lthy') |
49017 | 964 |
end; |
965 |
||
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
966 |
fun free_constructors tacss = (fn (goalss, after_qed, lthy) => |
51551 | 967 |
map2 (map2 (Thm.close_derivation oo Goal.prove_sorry lthy [] [])) goalss tacss |
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
968 |
|> (fn thms => after_qed thms lthy)) oo prepare_free_constructors (K I); |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
969 |
|
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
970 |
val free_constructors_cmd = (fn (goalss, after_qed, lthy) => |
49297 | 971 |
Proof.theorem NONE (snd oo after_qed) (map (map (rpair [])) goalss) lthy) oo |
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
972 |
prepare_free_constructors Syntax.read_term; |
49297 | 973 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
974 |
val parse_bound_term = parse_binding --| @{keyword ":"} -- Parse.term; |
49280
52413dc96326
allow default values for selectors in low-level "wrap_data" command
blanchet
parents:
49278
diff
changeset
|
975 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
976 |
val parse_ctr_options = |
54626 | 977 |
Scan.optional (@{keyword "("} |-- Parse.list1 |
55410 | 978 |
(Parse.reserved "no_discs_sels" >> K 0 || Parse.reserved "no_code" >> K 1) --| |
979 |
@{keyword ")"} |
|
980 |
>> (fn js => (member (op =) js 0, member (op =) js 1))) |
|
981 |
(false, false); |
|
49278 | 982 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
983 |
val parse_defaults = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
984 |
@{keyword "("} |-- Parse.reserved "defaults" |-- Scan.repeat parse_bound_term --| @{keyword ")"}; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
985 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
986 |
fun parse_ctr_spec parse_ctr parse_arg = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
987 |
parse_opt_binding_colon -- parse_ctr -- Scan.repeat parse_arg -- |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
988 |
Scan.optional parse_defaults []; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
989 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
990 |
val parse_ctr_specs = Parse.enum1 "|" (parse_ctr_spec Parse.term parse_binding); |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
991 |
|
49017 | 992 |
val _ = |
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
993 |
Outer_Syntax.local_theory_to_proof @{command_spec "free_constructors"} |
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
994 |
"register an existing freely generated type's constructors" |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
995 |
(parse_ctr_options -- parse_binding --| @{keyword "for"} -- parse_ctr_specs |
55468
98b25c51e9e5
renamed 'wrap_free_constructors' to 'free_constructors' (cf. 'functor', 'bnf', etc.)
blanchet
parents:
55464
diff
changeset
|
996 |
>> free_constructors_cmd); |
49017 | 997 |
|
998 |
end; |