author | blanchet |
Wed, 03 Sep 2014 22:47:35 +0200 | |
changeset 58175 | 2412a3369c30 |
parent 58159 | e3d1912a0c8f |
child 58177 | 166131276380 |
permissions | -rw-r--r-- |
55061 | 1 |
(* Title: HOL/Tools/BNF/bnf_fp_def_sugar.ML |
49112 | 2 |
Author: Jasmin Blanchette, TU Muenchen |
57668 | 3 |
Author: Martin Desharnais, TU Muenchen |
4 |
Copyright 2012, 2013, 2014 |
|
49112 | 5 |
|
49389 | 6 |
Sugared datatype and codatatype constructions. |
49112 | 7 |
*) |
8 |
||
49636 | 9 |
signature BNF_FP_DEF_SUGAR = |
49112 | 10 |
sig |
56650
1f9ab71d43a5
no need to make 'size' generation an interpretation -- overkill
blanchet
parents:
56648
diff
changeset
|
11 |
val fp_sugar_of: Proof.context -> string -> BNF_FP_Util.fp_sugar option |
58116 | 12 |
val fp_sugar_of_global: theory -> string -> BNF_FP_Util.fp_sugar option |
56650
1f9ab71d43a5
no need to make 'size' generation an interpretation -- overkill
blanchet
parents:
56648
diff
changeset
|
13 |
val fp_sugars_of: Proof.context -> BNF_FP_Util.fp_sugar list |
58116 | 14 |
val fp_sugars_of_global: theory -> BNF_FP_Util.fp_sugar list |
56650
1f9ab71d43a5
no need to make 'size' generation an interpretation -- overkill
blanchet
parents:
56648
diff
changeset
|
15 |
val fp_sugar_interpretation: (BNF_FP_Util.fp_sugar list -> theory -> theory) -> theory -> theory |
1f9ab71d43a5
no need to make 'size' generation an interpretation -- overkill
blanchet
parents:
56648
diff
changeset
|
16 |
val register_fp_sugars: BNF_FP_Util.fp_sugar list -> local_theory -> local_theory |
51852 | 17 |
|
53106 | 18 |
val co_induct_of: 'a list -> 'a |
19 |
val strong_co_induct_of: 'a list -> 'a |
|
20 |
||
52868 | 21 |
val flat_corec_preds_predsss_gettersss: 'a list -> 'a list list list -> 'a list list list -> |
22 |
'a list |
|
57397 | 23 |
val nesting_bnfs: Proof.context -> typ list list list -> typ list -> BNF_Def.bnf list |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
24 |
|
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
25 |
type lfp_sugar_thms = |
58011
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
26 |
(thm list * thm * Token.src list) * (thm list list * Token.src list) |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
27 |
|
54256 | 28 |
val morph_lfp_sugar_thms: morphism -> lfp_sugar_thms -> lfp_sugar_thms |
58115 | 29 |
val transfer_lfp_sugar_thms: theory -> lfp_sugar_thms -> lfp_sugar_thms |
54256 | 30 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
31 |
type gfp_sugar_thms = |
58011
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
32 |
((thm list * thm) list * (Token.src list * Token.src list)) |
57489 | 33 |
* thm list list |
34 |
* thm list list |
|
58011
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
35 |
* (thm list list * Token.src list) |
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
36 |
* (thm list list list * Token.src list) |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
37 |
|
54256 | 38 |
val morph_gfp_sugar_thms: morphism -> gfp_sugar_thms -> gfp_sugar_thms |
58115 | 39 |
val transfer_gfp_sugar_thms: theory -> gfp_sugar_thms -> gfp_sugar_thms |
54256 | 40 |
|
55867 | 41 |
val mk_co_recs_prelims: BNF_Util.fp_kind -> typ list list list -> typ list -> typ list -> |
42 |
typ list -> typ list -> int list -> int list list -> term list -> Proof.context -> |
|
43 |
(term list |
|
44 |
* (typ list list * typ list list list list * term list list * term list list list list) option |
|
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
45 |
* (string * term list * term list list |
55867 | 46 |
* ((term list list * term list list list) * typ list)) option) |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
47 |
* Proof.context |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
48 |
val repair_nullary_single_ctr: typ list list -> typ list list |
55867 | 49 |
val mk_corec_p_pred_types: typ list -> int list -> typ list list |
50 |
val mk_corec_fun_arg_types: typ list list list -> typ list -> typ list -> typ list -> int list -> |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
51 |
int list list -> term -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
52 |
typ list list |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
53 |
* (typ list list list list * typ list list list * typ list list list list * typ list) |
55867 | 54 |
val define_rec: |
56641
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
55 |
typ list list * typ list list list list * term list list * term list list list list -> |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
56 |
(string -> binding) -> typ list -> typ list -> term list -> term -> Proof.context -> |
55864 | 57 |
(term * thm) * Proof.context |
55867 | 58 |
val define_corec: 'a * term list * term list list |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
59 |
* ((term list list * term list list list) * typ list) -> (string -> binding) -> 'b list -> |
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
60 |
typ list -> term list -> term -> local_theory -> (term * thm) * local_theory |
55867 | 61 |
val derive_induct_recs_thms_for_types: BNF_Def.bnf list -> |
62 |
('a * typ list list list list * term list list * 'b) option -> thm -> thm list -> |
|
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
63 |
BNF_Def.bnf list -> BNF_Def.bnf list -> typ list -> typ list -> typ list -> |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
64 |
typ list list list -> thm list -> thm list -> thm list -> term list list -> thm list list -> |
55864 | 65 |
term list -> thm list -> Proof.context -> lfp_sugar_thms |
55867 | 66 |
val derive_coinduct_corecs_thms_for_types: BNF_Def.bnf list -> |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
67 |
string * term list * term list list * ((term list list * term list list list) * typ list) -> |
55867 | 68 |
thm -> thm list -> thm list -> thm list -> BNF_Def.bnf list -> typ list -> typ list -> |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
69 |
typ list -> typ list list list -> int list list -> int list list -> int list -> thm list -> |
55864 | 70 |
thm list -> (thm -> thm) -> thm list list -> Ctr_Sugar.ctr_sugar list -> term list -> |
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
71 |
thm list -> (thm list -> thm list) -> Proof.context -> gfp_sugar_thms |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
72 |
|
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
73 |
val co_datatypes: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list -> |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
74 |
binding list list -> binding list -> (string * sort) list -> typ list * typ list list -> |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
75 |
BNF_Def.bnf list -> BNF_Comp.absT_info list -> local_theory -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
76 |
BNF_FP_Util.fp_result * local_theory) -> |
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
77 |
(bool * bool) |
57206
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
78 |
* ((((((binding option * (typ * sort)) list * binding) * mixfix) |
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
79 |
* ((binding, binding * typ) Ctr_Sugar.ctr_spec * mixfix) list) * (binding * binding)) |
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
80 |
* term list) list -> |
49297 | 81 |
local_theory -> local_theory |
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
82 |
val parse_co_datatype_cmd: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list -> |
51867 | 83 |
binding list list -> binding list -> (string * sort) list -> typ list * typ list list -> |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
84 |
BNF_Def.bnf list -> BNF_Comp.absT_info list -> local_theory -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
85 |
BNF_FP_Util.fp_result * local_theory) -> |
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
86 |
(local_theory -> local_theory) parser |
49112 | 87 |
end; |
88 |
||
49636 | 89 |
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = |
49112 | 90 |
struct |
91 |
||
54006 | 92 |
open Ctr_Sugar |
55571 | 93 |
open BNF_FP_Rec_Sugar_Util |
49119 | 94 |
open BNF_Util |
53222 | 95 |
open BNF_Comp |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
96 |
open BNF_Def |
51850
106afdf5806c
renamed a few FP-related files, to make it clear that these are not the sum of LFP + GFP but rather shared basic libraries
blanchet
parents:
51847
diff
changeset
|
97 |
open BNF_FP_Util |
49636 | 98 |
open BNF_FP_Def_Sugar_Tactics |
56650
1f9ab71d43a5
no need to make 'size' generation an interpretation -- overkill
blanchet
parents:
56648
diff
changeset
|
99 |
open BNF_LFP_Size |
49119 | 100 |
|
51788 | 101 |
val EqN = "Eq_"; |
57489 | 102 |
|
58093 | 103 |
val case_transferN = "case_transfer"; |
57999 | 104 |
val ctr_transferN = "ctr_transfer"; |
58095 | 105 |
val disc_transferN = "disc_transfer"; |
57489 | 106 |
val corec_codeN = "corec_code"; |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
107 |
val map_disc_iffN = "map_disc_iff"; |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
108 |
val map_selN = "map_sel"; |
57893 | 109 |
val set_casesN = "set_cases"; |
57891 | 110 |
val set_introsN = "set_intros"; |
57700 | 111 |
val set_inductN = "set_induct"; |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
112 |
val set_selN = "set_sel"; |
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset
|
113 |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
114 |
structure Data = Generic_Data |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
115 |
( |
51840 | 116 |
type T = fp_sugar Symtab.table; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
117 |
val empty = Symtab.empty; |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
118 |
val extend = I; |
55394
d5ebe055b599
more liberal merging of BNFs and constructor sugar
blanchet
parents:
55356
diff
changeset
|
119 |
fun merge data : T = Symtab.merge (K true) data; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
120 |
); |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
121 |
|
57893 | 122 |
fun zipping_map f = |
123 |
let |
|
124 |
fun zmap _ [] = [] |
|
125 |
| zmap xs (y :: ys) = f (xs, y, ys) :: zmap (xs @ [y]) ys |
|
126 |
in zmap [] end; |
|
127 |
||
58104 | 128 |
|
57700 | 129 |
fun choose_binary_fun fs AB = |
130 |
find_first (fastype_of #> binder_types #> (fn [A, B] => AB = (A, B))) fs; |
|
58104 | 131 |
fun build_binary_fun_app fs t u = |
132 |
Option.map (rapp u o rapp t) (choose_binary_fun fs (fastype_of t, fastype_of u)); |
|
57700 | 133 |
|
58104 | 134 |
fun build_the_rel rel_table ctxt Rs Ts A B = |
135 |
build_rel rel_table ctxt Ts (the o choose_binary_fun Rs) (A, B); |
|
136 |
fun build_rel_app ctxt Rs Ts t u = |
|
137 |
build_the_rel [] ctxt Rs Ts (fastype_of t) (fastype_of u) $ t $ u; |
|
138 |
||
139 |
fun mk_parametricity_goal ctxt Rs t u = |
|
140 |
let val prem = build_the_rel [] ctxt Rs [] (fastype_of t) (fastype_of u) in |
|
141 |
HOLogic.mk_Trueprop (prem $ t $ u) |
|
142 |
end; |
|
57525 | 143 |
|
57700 | 144 |
val name_of_set = name_of_const "set"; |
145 |
||
58116 | 146 |
fun fp_sugar_of_generic context = |
147 |
Option.map (transfer_fp_sugar (Context.theory_of context)) o Symtab.lookup (Data.get context) |
|
148 |
||
149 |
fun fp_sugars_of_generic context = |
|
150 |
Symtab.fold (cons o transfer_fp_sugar (Context.theory_of context) o snd) (Data.get context) []; |
|
53907 | 151 |
|
58116 | 152 |
val fp_sugar_of = fp_sugar_of_generic o Context.Proof; |
153 |
val fp_sugar_of_global = fp_sugar_of_generic o Context.Theory; |
|
154 |
||
155 |
val fp_sugars_of = fp_sugars_of_generic o Context.Proof; |
|
156 |
val fp_sugars_of_global = fp_sugars_of_generic o Context.Theory; |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
157 |
|
53106 | 158 |
fun co_induct_of (i :: _) = i; |
159 |
fun strong_co_induct_of [_, s] = s; |
|
160 |
||
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
161 |
structure FP_Sugar_Interpretation = Interpretation |
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
162 |
( |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
163 |
type T = fp_sugar list; |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
164 |
val eq: T * T -> bool = op = o pairself (map #T); |
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
165 |
); |
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
166 |
|
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
167 |
fun with_repaired_path f (fp_sugars as ({T = Type (s, _), ...} : fp_sugar) :: _) thy = |
56376
5a93b8f928a2
added same idiomatic handling of namings for Ctr_Sugar/BNF-related interpretation hooks as for typedef and (old-style) datatypes
blanchet
parents:
56347
diff
changeset
|
168 |
thy |
56767 | 169 |
|> Sign.root_path |
170 |
|> Sign.add_path (Long_Name.qualifier s) |
|
58175 | 171 |
|> f (map (transfer_fp_sugar thy) fp_sugars) |
56767 | 172 |
|> Sign.restore_naming thy; |
56376
5a93b8f928a2
added same idiomatic handling of namings for Ctr_Sugar/BNF-related interpretation hooks as for typedef and (old-style) datatypes
blanchet
parents:
56347
diff
changeset
|
173 |
|
56657 | 174 |
fun fp_sugar_interpretation f = FP_Sugar_Interpretation.interpretation (with_repaired_path f); |
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
175 |
|
56650
1f9ab71d43a5
no need to make 'size' generation an interpretation -- overkill
blanchet
parents:
56648
diff
changeset
|
176 |
fun register_fp_sugars (fp_sugars as {fp, ...} :: _) = |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
177 |
fold (fn fp_sugar as {T = Type (s, _), ...} => |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
178 |
Local_Theory.declaration {syntax = false, pervasive = true} |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
179 |
(fn phi => Data.map (Symtab.update (s, morph_fp_sugar phi fp_sugar)))) |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
180 |
fp_sugars |
56651 | 181 |
#> fp = Least_FP ? generate_lfp_size fp_sugars |
58175 | 182 |
#> Local_Theory.background_theory (fn thy => FP_Sugar_Interpretation.data |
183 |
(map (the o fp_sugar_of_global thy o fst o dest_Type o #T) fp_sugars) thy); |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
184 |
|
57397 | 185 |
fun register_as_fp_sugars Ts BTs Xs fp pre_bnfs absT_infos fp_nesting_bnfs live_nesting_bnfs fp_res |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
186 |
ctrXs_Tsss ctr_defss ctr_sugars co_recs co_rec_defs mapss common_co_inducts co_inductss |
58117
9608028d8f43
more compatibility between old- and new-style datatypes
blanchet
parents:
58116
diff
changeset
|
187 |
co_rec_thmss co_rec_discss co_rec_selsss rel_injectss rel_distinctss noted = |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
188 |
let |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
189 |
val fp_sugars = |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
190 |
map_index (fn (kk, T) => |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
191 |
{T = T, BT = nth BTs kk, X = nth Xs kk, fp = fp, fp_res = fp_res, fp_res_index = kk, |
57397 | 192 |
pre_bnf = nth pre_bnfs kk, absT_info = nth absT_infos kk, |
193 |
fp_nesting_bnfs = fp_nesting_bnfs, live_nesting_bnfs = live_nesting_bnfs, |
|
194 |
ctrXs_Tss = nth ctrXs_Tsss kk, ctr_defs = nth ctr_defss kk, ctr_sugar = nth ctr_sugars kk, |
|
195 |
co_rec = nth co_recs kk, co_rec_def = nth co_rec_defs kk, maps = nth mapss kk, |
|
196 |
common_co_inducts = common_co_inducts, co_inducts = nth co_inductss kk, |
|
58117
9608028d8f43
more compatibility between old- and new-style datatypes
blanchet
parents:
58116
diff
changeset
|
197 |
co_rec_thms = nth co_rec_thmss kk, co_rec_discs = nth co_rec_discss kk, |
9608028d8f43
more compatibility between old- and new-style datatypes
blanchet
parents:
58116
diff
changeset
|
198 |
co_rec_selss = nth co_rec_selsss kk, rel_injects = nth rel_injectss kk, |
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
199 |
rel_distincts = nth rel_distinctss kk} |
57633 | 200 |
|> morph_fp_sugar (substitute_noted_thm noted)) Ts; |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
201 |
in |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
202 |
register_fp_sugars fp_sugars |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
203 |
end; |
51824 | 204 |
|
55342 | 205 |
(* This function could produce (fairly harmless) clashes in contrived examples (e.g., "x.A", |
206 |
"x.x_A", "y.A"). *) |
|
49622 | 207 |
fun quasi_unambiguous_case_names names = |
208 |
let |
|
209 |
val ps = map (`Long_Name.base_name) names; |
|
210 |
val dups = Library.duplicates (op =) (map fst ps); |
|
211 |
fun underscore s = |
|
212 |
let val ss = space_explode Long_Name.separator s in |
|
213 |
space_implode "_" (drop (length ss - 2) ss) |
|
214 |
end; |
|
215 |
in |
|
216 |
map (fn (base, full) => if member (op =) dups base then underscore full else base) ps |
|
217 |
end; |
|
218 |
||
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
219 |
val mp_conj = @{thm mp_conj}; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
220 |
|
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
221 |
val fundefcong_attrs = @{attributes [fundef_cong]}; |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
222 |
val nitpicksimp_attrs = @{attributes [nitpick_simp]}; |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
223 |
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs; |
49300 | 224 |
val simp_attrs = @{attributes [simp]}; |
225 |
||
49297 | 226 |
val lists_bmoc = fold (fn xs => fn t => Term.list_comb (t, xs)); |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
227 |
|
55871 | 228 |
fun flat_corec_predss_getterss qss gss = maps (op @) (qss ~~ gss); |
51829 | 229 |
|
55871 | 230 |
fun flat_corec_preds_predsss_gettersss [] [qss] [gss] = flat_corec_predss_getterss qss gss |
231 |
| flat_corec_preds_predsss_gettersss (p :: ps) (qss :: qsss) (gss :: gsss) = |
|
232 |
p :: flat_corec_predss_getterss qss gss @ flat_corec_preds_predsss_gettersss ps qsss gsss; |
|
51829 | 233 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
234 |
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
235 |
Abs ("x", T1, Abs ("y", T2, Var (x, T2 --> T1 --> T3) $ Bound 0 $ Bound 1)); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
236 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
237 |
fun flip_rels lthy n thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
238 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
239 |
val Rs = Term.add_vars (prop_of thm) []; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
240 |
val Rs' = rev (drop (length Rs - n) Rs); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
241 |
val cRs = map (fn f => (certify lthy (Var f), certify lthy (mk_flip f))) Rs'; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
242 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
243 |
Drule.cterm_instantiate cRs thm |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
244 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
245 |
|
49536 | 246 |
fun mk_ctor_or_dtor get_T Ts t = |
247 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
248 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
|
249 |
end; |
|
250 |
||
251 |
val mk_ctor = mk_ctor_or_dtor range_type; |
|
252 |
val mk_dtor = mk_ctor_or_dtor domain_type; |
|
253 |
||
55867 | 254 |
fun mk_xtor_co_recs thy fp fpTs Cs ts0 = |
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
255 |
let |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
256 |
val nn = length fpTs; |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
257 |
val (fpTs0, Cs0) = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
258 |
map ((fp = Greatest_FP ? swap) o dest_funT o snd o strip_typeN nn o fastype_of) ts0 |
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
259 |
|> split_list; |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
260 |
val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs); |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
261 |
in |
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
262 |
map (Term.subst_TVars rho) ts0 |
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
263 |
end; |
51827 | 264 |
|
57665 | 265 |
fun mk_set Ts t = |
266 |
subst_nonatomic_types (snd (Term.dest_Type (domain_type (fastype_of t))) ~~ Ts) t; |
|
267 |
||
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
268 |
fun liveness_of_fp_bnf n bnf = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
269 |
(case T_of_bnf bnf of |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
270 |
Type (_, Ts) => map (not o member (op =) (deads_of_bnf bnf)) Ts |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
271 |
| _ => replicate n false); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
272 |
|
55700 | 273 |
fun cannot_merge_types fp = |
274 |
error ("Mutually " ^ co_prefix fp ^ "recursive types must have the same type parameters"); |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
275 |
|
55700 | 276 |
fun merge_type_arg fp T T' = if T = T' then T else cannot_merge_types fp; |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
277 |
|
55700 | 278 |
fun merge_type_args fp (As, As') = |
279 |
if length As = length As' then map2 (merge_type_arg fp) As As' else cannot_merge_types fp; |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
280 |
|
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
281 |
fun type_args_named_constrained_of_spec (((((ncAs, _), _), _), _), _) = ncAs; |
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
282 |
fun type_binding_of_spec (((((_, b), _), _), _), _) = b; |
57206
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
283 |
fun mixfix_of_spec ((((_, mx), _), _), _) = mx; |
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
284 |
fun mixfixed_ctr_specs_of_spec (((_, mx_ctr_specs), _), _) = mx_ctr_specs; |
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
285 |
fun map_binding_of_spec ((_, (b, _)), _) = b; |
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
286 |
fun rel_binding_of_spec ((_, (_, b)), _) = b; |
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
287 |
fun sel_default_eqs_of_spec (_, ts) = ts; |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
288 |
|
57397 | 289 |
fun add_nesting_bnf_names Us = |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
290 |
let |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
291 |
fun add (Type (s, Ts)) ss = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
292 |
let val (needs, ss') = fold_map add Ts ss in |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
293 |
if exists I needs then (true, insert (op =) s ss') else (false, ss') |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
294 |
end |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
295 |
| add T ss = (member (op =) Us T, ss); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
296 |
in snd oo add end; |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
297 |
|
57397 | 298 |
fun nesting_bnfs ctxt ctr_Tsss Us = |
299 |
map_filter (bnf_of ctxt) (fold (fold (fold (add_nesting_bnf_names Us))) ctr_Tsss []); |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
300 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
301 |
fun indexify proj xs f p = f (find_index (curry (op =) (proj p)) xs) p; |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
302 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
303 |
type lfp_sugar_thms = |
58011
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
304 |
(thm list * thm * Token.src list) * (thm list list * Token.src list); |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
305 |
|
55867 | 306 |
fun morph_lfp_sugar_thms phi ((inducts, induct, induct_attrs), (recss, rec_attrs)) = |
54256 | 307 |
((map (Morphism.thm phi) inducts, Morphism.thm phi induct, induct_attrs), |
55867 | 308 |
(map (map (Morphism.thm phi)) recss, rec_attrs)) |
55095 | 309 |
: lfp_sugar_thms; |
54256 | 310 |
|
58115 | 311 |
val transfer_lfp_sugar_thms = morph_lfp_sugar_thms o Morphism.transfer_morphism; |
54256 | 312 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
313 |
type gfp_sugar_thms = |
58011
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
314 |
((thm list * thm) list * (Token.src list * Token.src list)) |
57489 | 315 |
* thm list list |
316 |
* thm list list |
|
58011
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
317 |
* (thm list list * Token.src list) |
bc6bced136e5
tuned signature -- moved type src to Token, without aliases;
wenzelm
parents:
57999
diff
changeset
|
318 |
* (thm list list list * Token.src list); |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
319 |
|
57260
8747af0d1012
fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents:
57206
diff
changeset
|
320 |
fun morph_gfp_sugar_thms phi ((coinducts_pairs, coinduct_attrs_pair), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
321 |
corecss, corec_discss, (corec_disc_iffss, corec_disc_iff_attrs), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
322 |
(corec_selsss, corec_sel_attrs)) = |
54256 | 323 |
((map (apfst (map (Morphism.thm phi)) o apsnd (Morphism.thm phi)) coinducts_pairs, |
57260
8747af0d1012
fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents:
57206
diff
changeset
|
324 |
coinduct_attrs_pair), |
57489 | 325 |
map (map (Morphism.thm phi)) corecss, |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
326 |
map (map (Morphism.thm phi)) corec_discss, |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
327 |
(map (map (Morphism.thm phi)) corec_disc_iffss, corec_disc_iff_attrs), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
328 |
(map (map (map (Morphism.thm phi))) corec_selsss, corec_sel_attrs)) : gfp_sugar_thms; |
54256 | 329 |
|
58115 | 330 |
val transfer_gfp_sugar_thms = morph_gfp_sugar_thms o Morphism.transfer_morphism; |
54256 | 331 |
|
58159 | 332 |
fun unzip_recT (Type (@{type_name prod}, _)) T = [T] |
333 |
| unzip_recT _ (Type (@{type_name prod}, Ts)) = Ts |
|
334 |
| unzip_recT _ T = [T]; |
|
335 |
||
55867 | 336 |
fun mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss ctor_rec_fun_Ts lthy = |
51832 | 337 |
let |
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
338 |
val Css = map2 replicate ns Cs; |
55869 | 339 |
val x_Tssss = |
55867 | 340 |
map6 (fn absT => fn repT => fn n => fn ms => fn ctr_Tss => fn ctor_rec_fun_T => |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
341 |
map2 (map2 unzip_recT) |
55867 | 342 |
ctr_Tss (dest_absumprodT absT repT n ms (domain_type ctor_rec_fun_T))) |
343 |
absTs repTs ns mss ctr_Tsss ctor_rec_fun_Ts; |
|
51832 | 344 |
|
55869 | 345 |
val x_Tsss' = map (map flat_rec_arg_args) x_Tssss; |
346 |
val f_Tss = map2 (map2 (curry (op --->))) x_Tsss' Css; |
|
51832 | 347 |
|
55869 | 348 |
val ((fss, xssss), lthy) = |
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
349 |
lthy |
55869 | 350 |
|> mk_Freess "f" f_Tss |
351 |
||>> mk_Freessss "x" x_Tssss; |
|
51832 | 352 |
in |
55869 | 353 |
((f_Tss, x_Tssss, fss, xssss), lthy) |
51832 | 354 |
end; |
355 |
||
58159 | 356 |
fun unzip_corecT (Type (@{type_name sum}, _)) T = [T] |
357 |
| unzip_corecT _ (Type (@{type_name sum}, Ts)) = Ts |
|
358 |
| unzip_corecT _ T = [T]; |
|
359 |
||
55867 | 360 |
(*avoid "'a itself" arguments in corecursors*) |
55966 | 361 |
fun repair_nullary_single_ctr [[]] = [[HOLogic.unitT]] |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
362 |
| repair_nullary_single_ctr Tss = Tss; |
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
363 |
|
55867 | 364 |
fun mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss fun_Ts = |
51829 | 365 |
let |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
366 |
val ctr_Tsss' = map repair_nullary_single_ctr ctr_Tsss; |
55869 | 367 |
val g_absTs = map range_type fun_Ts; |
368 |
val g_Tsss = map repair_nullary_single_ctr (map5 dest_absumprodT absTs repTs ns mss g_absTs); |
|
369 |
val g_Tssss = map3 (fn C => map2 (map2 (map (curry (op -->) C) oo unzip_corecT))) |
|
370 |
Cs ctr_Tsss' g_Tsss; |
|
371 |
val q_Tssss = map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) g_Tssss; |
|
52870 | 372 |
in |
55869 | 373 |
(q_Tssss, g_Tsss, g_Tssss, g_absTs) |
52870 | 374 |
end; |
51829 | 375 |
|
55867 | 376 |
fun mk_corec_p_pred_types Cs ns = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs; |
52898 | 377 |
|
55867 | 378 |
fun mk_corec_fun_arg_types ctr_Tsss Cs absTs repTs ns mss dtor_corec = |
379 |
(mk_corec_p_pred_types Cs ns, |
|
380 |
mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss |
|
381 |
(binder_fun_types (fastype_of dtor_corec))); |
|
51829 | 382 |
|
55867 | 383 |
fun mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts lthy = |
384 |
let |
|
385 |
val p_Tss = mk_corec_p_pred_types Cs ns; |
|
51829 | 386 |
|
55869 | 387 |
val (q_Tssss, g_Tsss, g_Tssss, corec_types) = |
55867 | 388 |
mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts; |
51831 | 389 |
|
55869 | 390 |
val (((((Free (x, _), cs), pss), qssss), gssss), lthy) = |
51829 | 391 |
lthy |
55869 | 392 |
|> yield_singleton (mk_Frees "x") dummyT |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
393 |
||>> mk_Frees "a" Cs |
51829 | 394 |
||>> mk_Freess "p" p_Tss |
55869 | 395 |
||>> mk_Freessss "q" q_Tssss |
396 |
||>> mk_Freessss "g" g_Tssss; |
|
51831 | 397 |
|
398 |
val cpss = map2 (map o rapp) cs pss; |
|
51829 | 399 |
|
57303 | 400 |
fun build_sum_inj mk_inj = build_map lthy [] (uncurry mk_inj o dest_sumT o snd); |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
401 |
|
55871 | 402 |
fun build_dtor_corec_arg _ [] [cg] = cg |
403 |
| build_dtor_corec_arg T [cq] [cg, cg'] = |
|
404 |
mk_If cq (build_sum_inj Inl_const (fastype_of cg, T) $ cg) |
|
405 |
(build_sum_inj Inr_const (fastype_of cg', T) $ cg'); |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
406 |
|
55869 | 407 |
val pgss = map3 flat_corec_preds_predsss_gettersss pss qssss gssss; |
408 |
val cqssss = map2 (map o map o map o rapp) cs qssss; |
|
409 |
val cgssss = map2 (map o map o map o rapp) cs gssss; |
|
410 |
val cqgsss = map3 (map3 (map3 build_dtor_corec_arg)) g_Tsss cqssss cgssss; |
|
51831 | 411 |
in |
55869 | 412 |
((x, cs, cpss, ((pgss, cqgsss), corec_types)), lthy) |
51831 | 413 |
end; |
51829 | 414 |
|
55867 | 415 |
fun mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy = |
51903 | 416 |
let |
52169 | 417 |
val thy = Proof_Context.theory_of lthy; |
418 |
||
55867 | 419 |
val (xtor_co_rec_fun_Ts, xtor_co_recs) = |
420 |
mk_xtor_co_recs thy fp fpTs Cs xtor_co_recs0 |> `(binder_fun_types o fastype_of o hd); |
|
51903 | 421 |
|
55867 | 422 |
val ((recs_args_types, corecs_args_types), lthy') = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
423 |
if fp = Least_FP then |
56641
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
424 |
mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
425 |
|>> (rpair NONE o SOME) |
51903 | 426 |
else |
55867 | 427 |
mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
428 |
|>> (pair NONE o SOME); |
51903 | 429 |
in |
55867 | 430 |
((xtor_co_recs, recs_args_types, corecs_args_types), lthy') |
51903 | 431 |
end; |
432 |
||
55869 | 433 |
fun mk_preds_getterss_join c cps absT abs cqgss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
434 |
let |
55869 | 435 |
val n = length cqgss; |
436 |
val ts = map2 (mk_absumprod absT abs n) (1 upto n) cqgss; |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
437 |
in |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
438 |
Term.lambda c (mk_IfN absT cps ts) |
51900 | 439 |
end; |
51886 | 440 |
|
55867 | 441 |
fun define_co_rec fp fpT Cs b rhs lthy0 = |
51897 | 442 |
let |
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
443 |
val thy = Proof_Context.theory_of lthy0; |
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
444 |
|
53569
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
445 |
val maybe_conceal_def_binding = Thm.def_binding |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
446 |
#> Config.get lthy0 bnf_note_all = false ? Binding.conceal; |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
447 |
|
55864 | 448 |
val ((cst, (_, def)), (lthy', lthy)) = lthy0 |
449 |
|> Local_Theory.define ((b, NoSyn), ((maybe_conceal_def_binding b, []), rhs)) |
|
52327 | 450 |
||> `Local_Theory.restore; |
451 |
||
452 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
453 |
||
55869 | 454 |
val cst' = mk_co_rec thy fp fpT Cs (Morphism.term phi cst); |
55864 | 455 |
val def' = Morphism.thm phi def; |
52327 | 456 |
in |
55864 | 457 |
((cst', def'), lthy') |
52327 | 458 |
end; |
459 |
||
56641
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
460 |
fun define_rec (_, _, fss, xssss) mk_binding fpTs Cs reps ctor_rec = |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
461 |
let |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
462 |
val nn = length fpTs; |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
463 |
val (ctor_rec_absTs, fpT) = strip_typeN nn (fastype_of ctor_rec) |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
464 |
|>> map domain_type ||> domain_type; |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
465 |
in |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
466 |
define_co_rec Least_FP fpT Cs (mk_binding recN) |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
467 |
(fold_rev (fold_rev Term.lambda) fss (Term.list_comb (ctor_rec, |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
468 |
map4 (fn ctor_rec_absT => fn rep => fn fs => fn xsss => |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
469 |
mk_case_absumprod ctor_rec_absT rep fs (map (map HOLogic.mk_tuple) xsss) |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
470 |
(map flat_rec_arg_args xsss)) |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
471 |
ctor_rec_absTs reps fss xssss))) |
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
472 |
end; |
51897 | 473 |
|
55869 | 474 |
fun define_corec (_, cs, cpss, ((pgss, cqgsss), f_absTs)) mk_binding fpTs Cs abss dtor_corec = |
51897 | 475 |
let |
51899 | 476 |
val nn = length fpTs; |
55867 | 477 |
val fpT = range_type (snd (strip_typeN nn (fastype_of dtor_corec))); |
51897 | 478 |
in |
55867 | 479 |
define_co_rec Greatest_FP fpT Cs (mk_binding corecN) |
55869 | 480 |
(fold_rev (fold_rev Term.lambda) pgss (Term.list_comb (dtor_corec, |
481 |
map5 mk_preds_getterss_join cs cpss f_absTs abss cqgsss))) |
|
52320 | 482 |
end; |
51897 | 483 |
|
57471 | 484 |
fun postproc_co_induct lthy nn prop prop_conj = |
485 |
Drule.zero_var_indexes |
|
486 |
#> `(conj_dests nn) |
|
487 |
#>> map (fn thm => Thm.permute_prems 0 (~1) (thm RS prop)) |
|
488 |
##> (fn thm => Thm.permute_prems 0 (~nn) |
|
489 |
(if nn = 1 then thm RS prop |
|
57932 | 490 |
else funpow nn (fn thm => unfold_thms lthy @{thms conj_assoc} (thm RS prop_conj)) thm)); |
57471 | 491 |
|
492 |
fun mk_induct_attrs ctrss = |
|
493 |
let |
|
494 |
val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss); |
|
495 |
val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases)); |
|
496 |
in |
|
497 |
[induct_case_names_attr] |
|
498 |
end; |
|
499 |
||
57535 | 500 |
fun derive_rel_induct_thms_for_types lthy fpA_Ts As Bs ctrAss ctrAs_Tsss exhausts ctor_rel_induct |
501 |
ctor_defss ctor_injects pre_rel_defs abs_inverses live_nesting_rel_eqs = |
|
57471 | 502 |
let |
503 |
val B_ify = typ_subst_nonatomic (As ~~ Bs) |
|
504 |
val fpB_Ts = map B_ify fpA_Ts; |
|
505 |
val ctrBs_Tsss = map (map (map B_ify)) ctrAs_Tsss; |
|
506 |
val ctrBss = map (map (subst_nonatomic_types (As ~~ Bs))) ctrAss; |
|
507 |
||
508 |
val ((((Rs, IRs), ctrAsss), ctrBsss), names_lthy) = lthy |
|
509 |
|> mk_Frees "R" (map2 mk_pred2T As Bs) |
|
510 |
||>> mk_Frees "IR" (map2 mk_pred2T fpA_Ts fpB_Ts) |
|
511 |
||>> mk_Freesss "a" ctrAs_Tsss |
|
512 |
||>> mk_Freesss "b" ctrBs_Tsss; |
|
513 |
||
514 |
val premises = |
|
515 |
let |
|
516 |
fun mk_prem ctrA ctrB argAs argBs = |
|
517 |
fold_rev Logic.all (argAs @ argBs) (fold_rev (curry Logic.mk_implies) |
|
57565 | 518 |
(map2 (HOLogic.mk_Trueprop oo build_rel_app names_lthy (Rs @ IRs) fpA_Ts) argAs argBs) |
519 |
(HOLogic.mk_Trueprop (build_rel_app names_lthy (Rs @ IRs) fpA_Ts |
|
520 |
(Term.list_comb (ctrA, argAs)) (Term.list_comb (ctrB, argBs))))); |
|
57471 | 521 |
in |
522 |
flat (map4 (map4 mk_prem) ctrAss ctrBss ctrAsss ctrBsss) |
|
523 |
end; |
|
524 |
||
57525 | 525 |
val goal = HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 mk_leq |
58104 | 526 |
(map2 (build_the_rel [] lthy (Rs @ IRs) []) fpA_Ts fpB_Ts) IRs)); |
57471 | 527 |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
528 |
val rel_induct0_thm = |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
529 |
Goal.prove_sorry lthy [] premises goal (fn {context = ctxt, prems} => |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
530 |
mk_rel_induct0_tac ctxt ctor_rel_induct prems (map (certify ctxt) IRs) exhausts ctor_defss |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
531 |
ctor_injects pre_rel_defs abs_inverses live_nesting_rel_eqs) |
57471 | 532 |
|> singleton (Proof_Context.export names_lthy lthy) |
533 |
|> Thm.close_derivation; |
|
534 |
in |
|
535 |
(postproc_co_induct lthy (length fpA_Ts) @{thm predicate2D} @{thm predicate2D_conj} |
|
536 |
rel_induct0_thm, |
|
537 |
mk_induct_attrs ctrAss) |
|
538 |
end; |
|
539 |
||
55867 | 540 |
fun derive_induct_recs_thms_for_types pre_bnfs rec_args_typess ctor_induct ctor_rec_thms |
57397 | 541 |
live_nesting_bnfs fp_nesting_bnfs fpTs Cs Xs ctrXs_Tsss fp_abs_inverses fp_type_definitions |
542 |
abs_inverses ctrss ctr_defss recs rec_defs lthy = |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
543 |
let |
51827 | 544 |
val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss; |
545 |
||
51815 | 546 |
val nn = length pre_bnfs; |
51827 | 547 |
val ns = map length ctr_Tsss; |
548 |
val mss = map (map length) ctr_Tsss; |
|
51815 | 549 |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
550 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
551 |
val pre_set_defss = map set_defs_of_bnf pre_bnfs; |
57399 | 552 |
val live_nesting_map_ident0s = map map_ident0_of_bnf live_nesting_bnfs; |
553 |
val fp_nesting_map_ident0s = map map_ident0_of_bnf fp_nesting_bnfs; |
|
57397 | 554 |
val fp_nesting_set_maps = maps set_map_of_bnf fp_nesting_bnfs; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
555 |
|
51816 | 556 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 557 |
|
51832 | 558 |
val ((((ps, ps'), xsss), us'), names_lthy) = |
52315
fafab8eac3ee
avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents:
52314
diff
changeset
|
559 |
lthy |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
560 |
|> mk_Frees' "P" (map mk_pred1T fpTs) |
51827 | 561 |
||>> mk_Freesss "x" ctr_Tsss |
51816 | 562 |
||>> Variable.variant_fixes fp_b_names; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
563 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
564 |
val us = map2 (curry Free) us' fpTs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
565 |
|
57665 | 566 |
fun mk_sets bnf = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
567 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
568 |
val Type (T_name, Us) = T_of_bnf bnf; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
569 |
val lives = lives_of_bnf bnf; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
570 |
val sets = sets_of_bnf bnf; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
571 |
fun mk_set U = |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
572 |
(case find_index (curry (op =) U) lives of |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
573 |
~1 => Term.dummy |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
574 |
| i => nth sets i); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
575 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
576 |
(T_name, map mk_set Us) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
577 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
578 |
|
57665 | 579 |
val setss_fp_nesting = map mk_sets fp_nesting_bnfs; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
580 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
581 |
val (induct_thms, induct_thm) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
582 |
let |
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
583 |
fun mk_raw_prem_prems _ (x as Free (_, Type _)) (X as TFree _) = |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
584 |
[([], (find_index (curry (op =) X) Xs + 1, x))] |
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
585 |
| mk_raw_prem_prems names_lthy (x as Free (s, Type (T_name, Ts0))) (Type (_, Xs_Ts0)) = |
57665 | 586 |
(case AList.lookup (op =) setss_fp_nesting T_name of |
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
587 |
NONE => [] |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
588 |
| SOME raw_sets0 => |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
589 |
let |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
590 |
val (Xs_Ts, (Ts, raw_sets)) = |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
591 |
filter (exists_subtype_in Xs o fst) (Xs_Ts0 ~~ (Ts0 ~~ raw_sets0)) |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
592 |
|> split_list ||> split_list; |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
593 |
val sets = map (mk_set Ts0) raw_sets; |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
594 |
val (ys, names_lthy') = names_lthy |> mk_Frees s Ts; |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
595 |
val xysets = map (pair x) (ys ~~ sets); |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
596 |
val ppremss = map2 (mk_raw_prem_prems names_lthy') ys Xs_Ts; |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
597 |
in |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
598 |
flat (map2 (map o apfst o cons) xysets ppremss) |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
599 |
end) |
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
600 |
| mk_raw_prem_prems _ _ _ = []; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
601 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
602 |
fun close_prem_prem xs t = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
603 |
fold_rev Logic.all (map Free (drop (nn + length xs) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
604 |
(rev (Term.add_frees t (map dest_Free xs @ ps'))))) t; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
605 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
606 |
fun mk_prem_prem xs (xysets, (j, x)) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
607 |
close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) => |
57567 | 608 |
mk_Trueprop_mem (y, set $ x')) xysets, |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
609 |
HOLogic.mk_Trueprop (nth ps (j - 1) $ x))); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
610 |
|
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
611 |
fun mk_raw_prem phi ctr ctr_Ts ctrXs_Ts = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
612 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
613 |
val (xs, names_lthy') = names_lthy |> mk_Frees "x" ctr_Ts; |
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
614 |
val pprems = flat (map2 (mk_raw_prem_prems names_lthy') xs ctrXs_Ts); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
615 |
in (xs, pprems, HOLogic.mk_Trueprop (phi $ Term.list_comb (ctr, xs))) end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
616 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
617 |
fun mk_prem (xs, raw_pprems, concl) = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
618 |
fold_rev Logic.all xs (Logic.list_implies (map (mk_prem_prem xs) raw_pprems, concl)); |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
619 |
|
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
620 |
val raw_premss = map4 (map3 o mk_raw_prem) ps ctrss ctr_Tsss ctrXs_Tsss; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
621 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
622 |
val goal = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
623 |
Library.foldr (Logic.list_implies o apfst (map mk_prem)) (raw_premss, |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
624 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 (curry (op $)) ps us))); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
625 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
626 |
val kksss = map (map (map (fst o snd) o #2)) raw_premss; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
627 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
628 |
val ctor_induct' = ctor_induct OF (map2 mk_absumprodE fp_type_definitions mss); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
629 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
630 |
val thm = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
631 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
632 |
mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' fp_abs_inverses |
57397 | 633 |
abs_inverses fp_nesting_set_maps pre_set_defss) |
57633 | 634 |
|> singleton (Proof_Context.export names_lthy lthy); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
635 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
636 |
`(conj_dests nn) thm |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
637 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
638 |
|
52305 | 639 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
640 |
||
55867 | 641 |
fun mk_rec_thmss (_, x_Tssss, fss, _) recs rec_defs ctor_rec_thms = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
642 |
let |
55867 | 643 |
val frecs = map (lists_bmoc fss) recs; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
644 |
|
55871 | 645 |
fun mk_goal frec xctr f xs fxs = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
646 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
55867 | 647 |
(mk_Trueprop_eq (frec $ xctr, Term.list_comb (f, fxs))); |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
648 |
|
52302 | 649 |
fun maybe_tick (T, U) u f = |
650 |
if try (fst o HOLogic.dest_prodT) U = SOME T then |
|
651 |
Term.lambda u (HOLogic.mk_prod (u, f $ u)) |
|
652 |
else |
|
653 |
f; |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
654 |
|
55867 | 655 |
fun build_rec (x as Free (_, T)) U = |
52368 | 656 |
if T = U then |
657 |
x |
|
658 |
else |
|
57303 | 659 |
build_map lthy [] (indexify (perhaps (try (snd o HOLogic.dest_prodT)) o snd) Cs |
55867 | 660 |
(fn kk => fn TU => maybe_tick TU (nth us kk) (nth frecs kk))) (T, U) $ x; |
52301
7935e82a4ae4
simpler, more robust iterator goal construction code
blanchet
parents:
52300
diff
changeset
|
661 |
|
55867 | 662 |
val fxsss = map2 (map2 (flat_rec_arg_args oo map2 (map o build_rec))) xsss x_Tssss; |
55871 | 663 |
val goalss = map5 (map4 o mk_goal) frecs xctrss fss xsss fxsss; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
664 |
|
57397 | 665 |
val tacss = map4 (map ooo |
57399 | 666 |
mk_rec_tac pre_map_defs (fp_nesting_map_ident0s @ live_nesting_map_ident0s) rec_defs) |
55867 | 667 |
ctor_rec_thms fp_abs_inverses abs_inverses ctr_defss; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
668 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
669 |
fun prove goal tac = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
670 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
671 |
|> Thm.close_derivation; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
672 |
in |
52305 | 673 |
map2 (map2 prove) goalss tacss |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
674 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
675 |
|
56641
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
676 |
val rec_thmss = mk_rec_thmss (the rec_args_typess) recs rec_defs ctor_rec_thms; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
677 |
in |
57471 | 678 |
((induct_thms, induct_thm, mk_induct_attrs ctrss), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
679 |
(rec_thmss, code_nitpicksimp_attrs @ simp_attrs)) |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
680 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
681 |
|
57535 | 682 |
fun mk_coinduct_attributes fpTs ctrss discss mss = |
57302 | 683 |
let |
684 |
val nn = length fpTs; |
|
685 |
val fp_b_names = map base_name_of_typ fpTs; |
|
57535 | 686 |
|
57302 | 687 |
fun mk_coinduct_concls ms discs ctrs = |
688 |
let |
|
689 |
fun mk_disc_concl disc = [name_of_disc disc]; |
|
690 |
fun mk_ctr_concl 0 _ = [] |
|
691 |
| mk_ctr_concl _ ctor = [name_of_ctr ctor]; |
|
692 |
val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]]; |
|
693 |
val ctr_concls = map2 mk_ctr_concl ms ctrs; |
|
694 |
in |
|
695 |
flat (map2 append disc_concls ctr_concls) |
|
696 |
end; |
|
57535 | 697 |
|
57302 | 698 |
val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names); |
699 |
val coinduct_conclss = |
|
700 |
map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss; |
|
701 |
||
702 |
val common_coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn)); |
|
703 |
val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1)); |
|
704 |
||
705 |
val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases)); |
|
706 |
val coinduct_case_concl_attrs = |
|
707 |
map2 (fn casex => fn concls => |
|
708 |
Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls)))) |
|
709 |
coinduct_cases coinduct_conclss; |
|
710 |
||
711 |
val common_coinduct_attrs = |
|
712 |
common_coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs; |
|
713 |
val coinduct_attrs = |
|
714 |
coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs; |
|
715 |
in |
|
716 |
(coinduct_attrs, common_coinduct_attrs) |
|
717 |
end; |
|
718 |
||
57535 | 719 |
fun derive_rel_coinduct_thm_for_types lthy fpA_Ts ns As Bs mss (ctr_sugars : ctr_sugar list) |
720 |
abs_inverses abs_injects ctor_injects dtor_ctors rel_pre_defs ctor_defss dtor_rel_coinduct |
|
721 |
live_nesting_rel_eqs = |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
722 |
let |
57302 | 723 |
val fpB_Ts = map (typ_subst_nonatomic (As ~~ Bs)) fpA_Ts; |
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
724 |
|
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
725 |
val (Rs, IRs, fpAs, fpBs, names_lthy) = |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
726 |
let |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
727 |
val fp_names = map base_name_of_typ fpA_Ts; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
728 |
val ((((Rs, IRs), fpAs_names), fpBs_names), names_lthy) = lthy |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
729 |
|> mk_Frees "R" (map2 mk_pred2T As Bs) |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
730 |
||>> mk_Frees "IR" (map2 mk_pred2T fpA_Ts fpB_Ts) |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
731 |
||>> Variable.variant_fixes fp_names |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
732 |
||>> Variable.variant_fixes (map (suffix "'") fp_names); |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
733 |
in |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
734 |
(Rs, IRs, |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
735 |
map2 (curry Free) fpAs_names fpA_Ts, |
57302 | 736 |
map2 (curry Free) fpBs_names fpB_Ts, |
737 |
names_lthy) |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
738 |
end; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
739 |
|
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
740 |
val ((discA_tss, selA_tsss), (discB_tss, selB_tsss)) = |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
741 |
let |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
742 |
val discss = map #discs ctr_sugars; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
743 |
val selsss = map #selss ctr_sugars; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
744 |
fun mk_discss ts Ts = map2 (map o rapp) ts (map (map (mk_disc_or_sel Ts)) discss); |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
745 |
fun mk_selsss ts Ts = map2 (map o map o rapp) ts (map (map (map (mk_disc_or_sel Ts))) |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
746 |
selsss); |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
747 |
in |
57302 | 748 |
((mk_discss fpAs As, mk_selsss fpAs As), |
749 |
(mk_discss fpBs Bs, mk_selsss fpBs Bs)) |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
750 |
end; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
751 |
|
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
752 |
val premises = |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
753 |
let |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
754 |
fun mk_prem_ctr_concls n k discA_t selA_ts discB_t selB_ts = |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
755 |
(if k = n then [] else [HOLogic.mk_eq (discA_t, discB_t)]) @ |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
756 |
(case (selA_ts, selB_ts) of |
57303 | 757 |
([], []) => [] |
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
758 |
| (_ :: _, _ :: _) => |
57565 | 759 |
[Library.foldr HOLogic.mk_imp |
760 |
(if n = 1 then [] else [discA_t, discB_t], |
|
761 |
Library.foldr1 HOLogic.mk_conj |
|
762 |
(map2 (build_rel_app lthy (Rs @ IRs) fpA_Ts) selA_ts selB_ts))]); |
|
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
763 |
|
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
764 |
fun mk_prem_concl n discA_ts selA_tss discB_ts selB_tss = |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
765 |
Library.foldr1 HOLogic.mk_conj (flat (map5 (mk_prem_ctr_concls n) |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
766 |
(1 upto n) discA_ts selA_tss discB_ts selB_tss)) |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
767 |
handle List.Empty => @{term True}; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
768 |
|
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
769 |
fun mk_prem IR tA tB n discA_ts selA_tss discB_ts selB_tss = |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
770 |
fold_rev Logic.all [tA, tB] (Logic.mk_implies (HOLogic.mk_Trueprop (IR $ tA $ tB), |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
771 |
HOLogic.mk_Trueprop (mk_prem_concl n discA_ts selA_tss discB_ts selB_tss))); |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
772 |
in |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
773 |
map8 mk_prem IRs fpAs fpBs ns discA_tss selA_tsss discB_tss selB_tsss |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
774 |
end; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
775 |
|
57525 | 776 |
val goal = HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj (map2 mk_leq |
58104 | 777 |
IRs (map2 (build_the_rel [] lthy (Rs @ IRs) []) fpA_Ts fpB_Ts))); |
57302 | 778 |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
779 |
val rel_coinduct0_thm = |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
780 |
Goal.prove_sorry lthy [] premises goal (fn {context = ctxt, prems} => |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
781 |
mk_rel_coinduct0_tac ctxt dtor_rel_coinduct (map (certify ctxt) IRs) prems |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
782 |
(map #exhaust ctr_sugars) (map (flat o #disc_thmss) ctr_sugars) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
783 |
(map (flat o #sel_thmss) ctr_sugars) ctor_defss dtor_ctors ctor_injects abs_injects |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
784 |
rel_pre_defs abs_inverses live_nesting_rel_eqs) |
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
785 |
|> singleton (Proof_Context.export names_lthy lthy) |
57302 | 786 |
|> Thm.close_derivation; |
787 |
in |
|
57471 | 788 |
(postproc_co_induct lthy (length fpA_Ts) @{thm predicate2D} @{thm predicate2D_conj} |
789 |
rel_coinduct0_thm, |
|
57535 | 790 |
mk_coinduct_attributes fpA_Ts (map #ctrs ctr_sugars) (map #discs ctr_sugars) mss) |
57301
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
791 |
end; |
7b997028aaac
generate 'rel_coinduct0' theorem for codatatypes
desharna
parents:
57279
diff
changeset
|
792 |
|
57700 | 793 |
fun derive_set_induct_thms_for_types lthy nn fpTs ctrss setss dtor_set_inducts exhausts |
794 |
set_pre_defs ctor_defs dtor_ctors Abs_pre_inverses = |
|
795 |
let |
|
796 |
fun mk_prems A Ps ctr_args t ctxt = |
|
797 |
(case fastype_of t of |
|
57891 | 798 |
Type (type_name, innerTs) => |
57700 | 799 |
(case bnf_of ctxt type_name of |
800 |
NONE => ([], ctxt) |
|
801 |
| SOME bnf => |
|
802 |
let |
|
803 |
fun seq_assm a set ctxt = |
|
804 |
let |
|
805 |
val X = HOLogic.dest_setT (range_type (fastype_of set)); |
|
806 |
val (x, ctxt') = yield_singleton (mk_Frees "x") X ctxt; |
|
807 |
val assm = mk_Trueprop_mem (x, set $ a); |
|
808 |
in |
|
809 |
(case build_binary_fun_app Ps x a of |
|
810 |
NONE => |
|
811 |
mk_prems A Ps ctr_args x ctxt' |
|
812 |
|>> map (Logic.all x o Logic.mk_implies o pair assm) |
|
813 |
| SOME f => |
|
814 |
([Logic.all x |
|
815 |
(Logic.mk_implies (assm, |
|
816 |
Logic.mk_implies (HOLogic.mk_Trueprop f, |
|
817 |
HOLogic.mk_Trueprop (the (build_binary_fun_app Ps x ctr_args)))))], |
|
818 |
ctxt')) |
|
819 |
end; |
|
820 |
in |
|
57891 | 821 |
fold_map (seq_assm t o mk_set innerTs) (sets_of_bnf bnf) ctxt |
57700 | 822 |
|>> flat |
823 |
end) |
|
824 |
| T => |
|
825 |
if T = A then ([HOLogic.mk_Trueprop (the (build_binary_fun_app Ps t ctr_args))], ctxt) |
|
826 |
else ([], ctxt)); |
|
827 |
||
828 |
fun mk_prems_for_ctr A Ps ctr ctxt = |
|
829 |
let |
|
57893 | 830 |
val (args, ctxt') = mk_Frees "z" (binder_types (fastype_of ctr)) ctxt; |
57700 | 831 |
in |
832 |
fold_map (mk_prems A Ps (list_comb (ctr, args))) args ctxt' |
|
833 |
|>> map (fold_rev Logic.all args) o flat |
|
834 |
|>> (fn prems => (prems, mk_names (length prems) (name_of_ctr ctr))) |
|
835 |
end; |
|
836 |
||
837 |
fun mk_prems_and_concl_for_type A Ps ((fpT, ctrs), set) ctxt = |
|
838 |
let |
|
839 |
val ((x, fp), ctxt') = ctxt |
|
840 |
|> yield_singleton (mk_Frees "x") A |
|
841 |
||>> yield_singleton (mk_Frees "a") fpT; |
|
842 |
val concl = mk_Ball (set $ fp) (Term.absfree (dest_Free x) |
|
843 |
(the (build_binary_fun_app Ps x fp))); |
|
844 |
in |
|
845 |
fold_map (mk_prems_for_ctr A Ps) ctrs ctxt' |
|
846 |
|>> split_list |
|
847 |
|>> map_prod flat flat |
|
848 |
|>> apfst (rpair concl) |
|
849 |
end; |
|
850 |
||
851 |
fun mk_thm ctxt fpTs ctrss sets = |
|
852 |
let |
|
853 |
val A = HOLogic.dest_setT (range_type (fastype_of (hd sets))); |
|
854 |
val (Ps, ctxt') = mk_Frees "P" (map (fn fpT => A --> fpT --> HOLogic.boolT) fpTs) ctxt; |
|
855 |
val (((premises, conclusion), case_names), ctxt'') = |
|
856 |
(fold_map (mk_prems_and_concl_for_type A Ps) (fpTs ~~ ctrss ~~ sets) ctxt') |
|
857 |
|>> apfst split_list o split_list |
|
858 |
|>> apfst (apfst flat) |
|
859 |
|>> apfst (apsnd (Library.foldr1 HOLogic.mk_conj)) |
|
860 |
|>> apsnd flat; |
|
861 |
||
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
862 |
val thm = |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
863 |
Goal.prove_sorry lthy [] premises (HOLogic.mk_Trueprop conclusion) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
864 |
(fn {context = ctxt, prems} => |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
865 |
mk_set_induct0_tac ctxt (map (certify ctxt'') Ps) prems dtor_set_inducts exhausts |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
866 |
set_pre_defs ctor_defs dtor_ctors Abs_pre_inverses) |
57700 | 867 |
|> singleton (Proof_Context.export ctxt'' ctxt) |
868 |
|> Thm.close_derivation; |
|
869 |
||
870 |
val case_names_attr = |
|
871 |
Attrib.internal (K (Rule_Cases.case_names (quasi_unambiguous_case_names case_names))); |
|
872 |
val induct_set_attrs = map (Attrib.internal o K o Induct.induct_pred o name_of_set) sets; |
|
873 |
in |
|
874 |
(thm, case_names_attr :: induct_set_attrs) |
|
875 |
end |
|
876 |
val consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1)); |
|
877 |
in |
|
878 |
map (fn Asets => |
|
879 |
let |
|
880 |
fun massage_thm thm = rotate_prems (~1) (thm RS bspec); |
|
881 |
in |
|
882 |
mk_thm lthy fpTs ctrss Asets |> nn = 1 ? map_prod massage_thm (cons consumes_attr) |
|
883 |
end) (transpose setss) |
|
884 |
end; |
|
885 |
||
55871 | 886 |
fun derive_coinduct_corecs_thms_for_types pre_bnfs (x, cs, cpss, ((pgss, cqgsss), _)) |
57397 | 887 |
dtor_coinduct dtor_injects dtor_ctors dtor_corec_thms live_nesting_bnfs fpTs Cs Xs ctrXs_Tsss |
888 |
kss mss ns fp_abs_inverses abs_inverses mk_vimage2p ctr_defss (ctr_sugars : ctr_sugar list) |
|
55864 | 889 |
corecs corec_defs export_args lthy = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
890 |
let |
55867 | 891 |
fun mk_ctor_dtor_corec_thm dtor_inject dtor_ctor corec = |
892 |
iffD1 OF [dtor_inject, trans OF [corec, dtor_ctor RS sym]]; |
|
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
893 |
|
55867 | 894 |
val ctor_dtor_corec_thms = map3 mk_ctor_dtor_corec_thm dtor_injects dtor_ctors dtor_corec_thms; |
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
895 |
|
51815 | 896 |
val nn = length pre_bnfs; |
897 |
||
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
898 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
899 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
57399 | 900 |
val live_nesting_map_ident0s = map map_ident0_of_bnf live_nesting_bnfs; |
57397 | 901 |
val live_nesting_rel_eqs = map rel_eq_of_bnf live_nesting_bnfs; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
902 |
|
51816 | 903 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 904 |
|
53210
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53203
diff
changeset
|
905 |
val ctrss = map #ctrs ctr_sugars; |
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53203
diff
changeset
|
906 |
val discss = map #discs ctr_sugars; |
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53203
diff
changeset
|
907 |
val selsss = map #selss ctr_sugars; |
51840 | 908 |
val exhausts = map #exhaust ctr_sugars; |
909 |
val disc_thmsss = map #disc_thmss ctr_sugars; |
|
910 |
val discIss = map #discIs ctr_sugars; |
|
911 |
val sel_thmsss = map #sel_thmss ctr_sugars; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
912 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
913 |
val (((rs, us'), vs'), names_lthy) = |
52341 | 914 |
lthy |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
915 |
|> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) |
51816 | 916 |
||>> Variable.variant_fixes fp_b_names |
917 |
||>> Variable.variant_fixes (map (suffix "'") fp_b_names); |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
918 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
919 |
val us = map2 (curry Free) us' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
920 |
val udiscss = map2 (map o rapp) us discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
921 |
val uselsss = map2 (map o map o rapp) us selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
922 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
923 |
val vs = map2 (curry Free) vs' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
924 |
val vdiscss = map2 (map o rapp) vs discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
925 |
val vselsss = map2 (map o map o rapp) vs selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
926 |
|
52345 | 927 |
val coinduct_thms_pairs = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
928 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
929 |
val uvrs = map3 (fn r => fn u => fn v => r $ u $ v) rs us vs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
930 |
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
931 |
val strong_rs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
932 |
map4 (fn u => fn v => fn uvr => fn uv_eq => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
933 |
fold_rev Term.lambda [u, v] (HOLogic.mk_disj (uvr, uv_eq))) us vs uvrs uv_eqs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
934 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
935 |
fun build_the_rel rs' T Xs_T = |
58104 | 936 |
build_rel [] lthy [] (fn (_, X) => nth rs' (find_index (curry (op =) X) Xs)) (T, Xs_T) |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
937 |
|> Term.subst_atomic_types (Xs ~~ fpTs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
938 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
939 |
fun build_rel_app rs' usel vsel Xs_T = |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
940 |
fold rapp [usel, vsel] (build_the_rel rs' (fastype_of usel) Xs_T); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
941 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
942 |
fun mk_prem_ctr_concls rs' n k udisc usels vdisc vsels ctrXs_Ts = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
943 |
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
944 |
(if null usels then |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
945 |
[] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
946 |
else |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
947 |
[Library.foldr HOLogic.mk_imp (if n = 1 then [] else [udisc, vdisc], |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
948 |
Library.foldr1 HOLogic.mk_conj (map3 (build_rel_app rs') usels vsels ctrXs_Ts))]); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
949 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
950 |
fun mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss = |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
951 |
Library.foldr1 HOLogic.mk_conj (flat (map6 (mk_prem_ctr_concls rs' n) |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
952 |
(1 upto n) udiscs uselss vdiscs vselss ctrXs_Tss)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
953 |
handle List.Empty => @{term True}; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
954 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
955 |
fun mk_prem rs' uvr u v n udiscs uselss vdiscs vselss ctrXs_Tss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
956 |
fold_rev Logic.all [u, v] (Logic.mk_implies (HOLogic.mk_Trueprop uvr, |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
957 |
HOLogic.mk_Trueprop (mk_prem_concl rs' n udiscs uselss vdiscs vselss ctrXs_Tss))); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
958 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
959 |
val concl = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
960 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
961 |
(map3 (fn uvr => fn u => fn v => HOLogic.mk_imp (uvr, HOLogic.mk_eq (u, v))) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
962 |
uvrs us vs)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
963 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
964 |
fun mk_goal rs' = |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
965 |
Logic.list_implies (map9 (mk_prem rs') uvrs us vs ns udiscss uselsss vdiscss vselsss |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
966 |
ctrXs_Tsss, concl); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
967 |
|
52345 | 968 |
val goals = map mk_goal [rs, strong_rs]; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
969 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
970 |
fun prove dtor_coinduct' goal = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
971 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
57397 | 972 |
mk_coinduct_tac ctxt live_nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs |
973 |
fp_abs_inverses abs_inverses dtor_ctors exhausts ctr_defss disc_thmsss sel_thmsss) |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
974 |
|> singleton (Proof_Context.export names_lthy lthy) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
975 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
976 |
|
53106 | 977 |
val rel_eqs = map rel_eq_of_bnf pre_bnfs; |
978 |
val rel_monos = map rel_mono_of_bnf pre_bnfs; |
|
979 |
val dtor_coinducts = |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
980 |
[dtor_coinduct, mk_coinduct_strong_thm dtor_coinduct rel_eqs rel_monos mk_vimage2p lthy] |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
981 |
in |
57471 | 982 |
map2 (postproc_co_induct lthy nn mp mp_conj oo prove) dtor_coinducts goals |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
983 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
984 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
985 |
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
986 |
|
55869 | 987 |
val gcorecs = map (lists_bmoc pgss) corecs; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
988 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
989 |
val corec_thmss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
990 |
let |
55869 | 991 |
fun mk_goal c cps gcorec n k ctr m cfs' = |
992 |
fold_rev (fold_rev Logic.all) ([c] :: pgss) |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
993 |
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, |
55869 | 994 |
mk_Trueprop_eq (gcorec $ c, Term.list_comb (ctr, take m cfs')))); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
995 |
|
55869 | 996 |
val mk_U = typ_subst_nonatomic (map2 (fn C => fn fpT => (mk_sumT (fpT, C), fpT)) Cs fpTs); |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
997 |
|
55869 | 998 |
fun tack (c, u) f = |
999 |
let val x' = Free (x, mk_sumT (fastype_of u, fastype_of c)) in |
|
1000 |
Term.lambda x' (mk_case_sum (Term.lambda u u, Term.lambda c (f $ c)) $ x') |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
1001 |
end; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1002 |
|
55869 | 1003 |
fun build_corec cqg = |
1004 |
let val T = fastype_of cqg in |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
1005 |
if exists_subtype_in Cs T then |
55869 | 1006 |
let val U = mk_U T in |
57303 | 1007 |
build_map lthy [] (indexify fst (map2 (curry mk_sumT) fpTs Cs) (fn kk => fn _ => |
55869 | 1008 |
tack (nth cs kk, nth us kk) (nth gcorecs kk))) (T, U) $ cqg |
52368 | 1009 |
end |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
1010 |
else |
55869 | 1011 |
cqg |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
1012 |
end; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1013 |
|
55869 | 1014 |
val cqgsss' = map (map (map build_corec)) cqgsss; |
1015 |
val goalss = map8 (map4 oooo mk_goal) cs cpss gcorecs ns kss ctrss mss cqgsss'; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1016 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1017 |
val tacss = |
57399 | 1018 |
map4 (map ooo mk_corec_tac corec_defs live_nesting_map_ident0s) |
55867 | 1019 |
ctor_dtor_corec_thms pre_map_defs abs_inverses ctr_defss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1020 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1021 |
fun prove goal tac = |
51815 | 1022 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
1023 |
|> Thm.close_derivation; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1024 |
in |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1025 |
map2 (map2 prove) goalss tacss |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1026 |
|> map (map (unfold_thms lthy @{thms case_sum_if})) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1027 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1028 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1029 |
val corec_disc_iff_thmss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1030 |
let |
55869 | 1031 |
fun mk_goal c cps gcorec n k disc = |
1032 |
mk_Trueprop_eq (disc $ (gcorec $ c), |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1033 |
if n = 1 then @{const True} |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1034 |
else Library.foldr1 HOLogic.mk_conj (seq_conds mk_maybe_not n k cps)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1035 |
|
55869 | 1036 |
val goalss = map6 (map2 oooo mk_goal) cs cpss gcorecs ns kss discss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1037 |
|
51828 | 1038 |
fun mk_case_split' cp = Drule.instantiate' [] [SOME (certify lthy cp)] @{thm case_split}; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1039 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1040 |
val case_splitss' = map (map mk_case_split') cpss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1041 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1042 |
val tacss = map3 (map oo mk_corec_disc_iff_tac) case_splitss' corec_thmss disc_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1043 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1044 |
fun prove goal tac = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1045 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
52357
a5d3730043c2
use right context when exporting variables (cf. AFP Coinductive_List failures)
blanchet
parents:
52356
diff
changeset
|
1046 |
|> singleton export_args |
51829 | 1047 |
|> singleton (Proof_Context.export names_lthy lthy) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1048 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1049 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1050 |
fun proves [_] [_] = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1051 |
| proves goals tacs = map2 prove goals tacs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1052 |
in |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1053 |
map2 proves goalss tacss |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1054 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1055 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1056 |
fun mk_corec_disc_thms corecs discIs = map (op RS) (corecs ~~ discIs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1057 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1058 |
val corec_disc_thmss = map2 mk_corec_disc_thms corec_thmss discIss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1059 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1060 |
fun mk_corec_sel_thm corec_thm sel sel_thm = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1061 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1062 |
val (domT, ranT) = dest_funT (fastype_of sel); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1063 |
val arg_cong' = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1064 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1065 |
[NONE, NONE, SOME (certify lthy sel)] arg_cong |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1066 |
|> Thm.varifyT_global; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1067 |
val sel_thm' = sel_thm RSN (2, trans); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1068 |
in |
55867 | 1069 |
corec_thm RS arg_cong' RS sel_thm' |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1070 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1071 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1072 |
fun mk_corec_sel_thms corec_thmss = |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1073 |
map3 (map3 (map2 o mk_corec_sel_thm)) corec_thmss selsss sel_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1074 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1075 |
val corec_sel_thmsss = mk_corec_sel_thms corec_thmss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1076 |
in |
57535 | 1077 |
((coinduct_thms_pairs, |
1078 |
mk_coinduct_attributes fpTs (map #ctrs ctr_sugars) (map #discs ctr_sugars) mss), |
|
57489 | 1079 |
corec_thmss, |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1080 |
corec_disc_thmss, |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1081 |
(corec_disc_iff_thmss, simp_attrs), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1082 |
(corec_sel_thmsss, simp_attrs)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1083 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1084 |
|
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1085 |
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp |
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1086 |
((discs_sels0, no_code), specs) no_defs_lthy0 = |
49112 | 1087 |
let |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1088 |
(* TODO: sanity checks on arguments *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1089 |
|
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1090 |
val discs_sels = discs_sels0 orelse fp = Greatest_FP; |
49278 | 1091 |
|
49367 | 1092 |
val nn = length specs; |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1093 |
val fp_bs = map type_binding_of_spec specs; |
49498 | 1094 |
val fp_b_names = map Binding.name_of fp_bs; |
1095 |
val fp_common_name = mk_common_name fp_b_names; |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1096 |
val map_bs = map map_binding_of_spec specs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1097 |
val rel_bs = map rel_binding_of_spec specs; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1098 |
|
51758 | 1099 |
fun prepare_type_arg (_, (ty, c)) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1100 |
let val TFree (s, _) = prepare_typ no_defs_lthy0 ty in |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1101 |
TFree (s, prepare_constraint no_defs_lthy0 c) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1102 |
end; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1103 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1104 |
val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of_spec) specs; |
56254 | 1105 |
val unsorted_Ass0 = map (map (resort_tfree @{sort type})) Ass0; |
55700 | 1106 |
val unsorted_As = Library.foldr1 (merge_type_args fp) unsorted_Ass0; |
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1107 |
val num_As = length unsorted_As; |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
1108 |
|
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
1109 |
val set_boss = map (map fst o type_args_named_constrained_of_spec) specs; |
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
1110 |
val set_bss = map (map (the_default Binding.empty)) set_boss; |
49119 | 1111 |
|
58093 | 1112 |
val ((((Bs0, Cs as C1 :: _), Es as E1 :: _), Xs), no_defs_lthy) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1113 |
no_defs_lthy0 |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1114 |
|> fold (Variable.declare_typ o resort_tfree dummyS) unsorted_As |
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1115 |
|> mk_TFrees num_As |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1116 |
||>> mk_TFrees nn |
58093 | 1117 |
||>> mk_TFrees nn |
51858
7a08fe1e19b1
added and moved library functions (used in primrec code)
blanchet
parents:
51857
diff
changeset
|
1118 |
||>> variant_tfrees fp_b_names; |
49119 | 1119 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1120 |
fun add_fake_type spec = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1121 |
Typedecl.basic_typedecl (type_binding_of_spec spec, num_As, mixfix_of_spec spec); |
51768 | 1122 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
1123 |
val (fake_T_names, fake_lthy) = fold_map add_fake_type specs no_defs_lthy0; |
49119 | 1124 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1125 |
val qsoty = quote o Syntax.string_of_typ fake_lthy; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1126 |
|
54253 | 1127 |
val _ = (case Library.duplicates (op =) unsorted_As of [] => () |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1128 |
| A :: _ => error ("Duplicate type parameter " ^ qsoty A ^ " in " ^ co_prefix fp ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1129 |
"datatype specification")); |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1130 |
|
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1131 |
val bad_args = |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1132 |
map (Logic.type_map (singleton (Variable.polymorphic no_defs_lthy0))) unsorted_As |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1133 |
|> filter_out Term.is_TVar; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1134 |
val _ = null bad_args orelse |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1135 |
error ("Locally fixed type argument " ^ qsoty (hd bad_args) ^ " in " ^ co_prefix fp ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1136 |
"datatype specification"); |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1137 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1138 |
val mixfixes = map mixfix_of_spec specs; |
49119 | 1139 |
|
54253 | 1140 |
val _ = (case Library.duplicates Binding.eq_name fp_bs of [] => () |
49119 | 1141 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
1142 |
||
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1143 |
val mx_ctr_specss = map mixfixed_ctr_specs_of_spec specs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1144 |
val ctr_specss = map (map fst) mx_ctr_specss; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1145 |
val ctr_mixfixess = map (map snd) mx_ctr_specss; |
49119 | 1146 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1147 |
val disc_bindingss = map (map disc_of_ctr_spec) ctr_specss; |
49336 | 1148 |
val ctr_bindingss = |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1149 |
map2 (fn fp_b_name => map (Binding.qualify false fp_b_name o ctr_of_ctr_spec)) fp_b_names |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1150 |
ctr_specss; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1151 |
val ctr_argsss = map (map args_of_ctr_spec) ctr_specss; |
49119 | 1152 |
|
49336 | 1153 |
val sel_bindingsss = map (map (map fst)) ctr_argsss; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1154 |
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
1155 |
val raw_sel_default_eqss = map sel_default_eqs_of_spec specs; |
49286 | 1156 |
|
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
1157 |
val (As :: _) :: fake_ctr_Tsss = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1158 |
burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0); |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1159 |
val As' = map dest_TFree As; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1160 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
1161 |
val rhs_As' = fold (fold (fold Term.add_tfreesT)) fake_ctr_Tsss []; |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1162 |
val _ = (case subtract (op =) As' rhs_As' of [] => () |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1163 |
| extras => error ("Extra type variables on right-hand side: " ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1164 |
commas (map (qsoty o TFree) extras))); |
49165 | 1165 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
1166 |
val fake_Ts = map (fn s => Type (s, As)) fake_T_names; |
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
1167 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1168 |
fun eq_fpT_check (T as Type (s, Ts)) (T' as Type (s', Ts')) = |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1169 |
s = s' andalso (Ts = Ts' orelse |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1170 |
error ("Wrong type arguments in " ^ co_prefix fp ^ "recursive type " ^ qsoty T ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1171 |
" (expected " ^ qsoty T' ^ ")")) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1172 |
| eq_fpT_check _ _ = false; |
49146 | 1173 |
|
53222 | 1174 |
fun freeze_fp (T as Type (s, Ts)) = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1175 |
(case find_index (eq_fpT_check T) fake_Ts of |
53222 | 1176 |
~1 => Type (s, map freeze_fp Ts) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1177 |
| kk => nth Xs kk) |
49204 | 1178 |
| freeze_fp T = T; |
49121 | 1179 |
|
53222 | 1180 |
val unfreeze_fp = Term.typ_subst_atomic (Xs ~~ fake_Ts); |
1181 |
||
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
1182 |
val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss; |
55966 | 1183 |
val ctrXs_repTs = map mk_sumprodT_balanced ctrXs_Tsss; |
49119 | 1184 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1185 |
val fp_eqs = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1186 |
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_repTs; |
49121 | 1187 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1188 |
val rhsXs_As' = fold (fold (fold Term.add_tfreesT)) ctrXs_Tsss []; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1189 |
val _ = (case subtract (op =) rhsXs_As' As' of [] => () |
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1190 |
| extras => List.app (fn extra => warning ("Unused type variable on right-hand side of " ^ |
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1191 |
co_prefix fp ^ "datatype definition: " ^ qsoty (TFree extra))) extras); |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1192 |
|
55701 | 1193 |
val killed_As = |
1194 |
map_filter (fn (A, set_bos) => if exists is_none set_bos then SOME A else NONE) |
|
1195 |
(unsorted_As ~~ transpose set_boss); |
|
1196 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1197 |
val ((pre_bnfs, absT_infos), (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, |
55868 | 1198 |
dtors = dtors0, xtor_co_recs = xtor_co_recs0, xtor_co_induct, dtor_ctors, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1199 |
ctor_dtors, ctor_injects, dtor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms, |
57700 | 1200 |
xtor_co_rec_thms, rel_xtor_co_induct_thm, dtor_set_induct_thms, ...}, |
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
1201 |
lthy)) = |
55701 | 1202 |
fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As) |
1203 |
(map dest_TFree killed_As) fp_eqs no_defs_lthy0 |
|
53222 | 1204 |
handle BAD_DEAD (X, X_backdrop) => |
1205 |
(case X_backdrop of |
|
1206 |
Type (bad_tc, _) => |
|
1207 |
let |
|
1208 |
val fake_T = qsoty (unfreeze_fp X); |
|
1209 |
val fake_T_backdrop = qsoty (unfreeze_fp X_backdrop); |
|
1210 |
fun register_hint () = |
|
1211 |
"\nUse the " ^ quote (fst (fst @{command_spec "bnf"})) ^ " command to register " ^ |
|
1212 |
quote bad_tc ^ " as a bounded natural functor to allow nested (co)recursion through \ |
|
1213 |
\it"; |
|
1214 |
in |
|
1215 |
if is_some (bnf_of no_defs_lthy bad_tc) orelse |
|
1216 |
is_some (fp_sugar_of no_defs_lthy bad_tc) then |
|
53256 | 1217 |
error ("Inadmissible " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
1218 |
" in type expression " ^ fake_T_backdrop) |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58104
diff
changeset
|
1219 |
else if is_some (Old_Datatype_Data.get_info (Proof_Context.theory_of no_defs_lthy) |
53222 | 1220 |
bad_tc) then |
1221 |
error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
|
1222 |
" via the old-style datatype " ^ quote bad_tc ^ " in type expression " ^ |
|
1223 |
fake_T_backdrop ^ register_hint ()) |
|
1224 |
else |
|
1225 |
error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
|
1226 |
" via type constructor " ^ quote bad_tc ^ " in type expression " ^ fake_T_backdrop ^ |
|
1227 |
register_hint ()) |
|
1228 |
end); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1229 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1230 |
val abss = map #abs absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1231 |
val reps = map #rep absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1232 |
val absTs = map #absT absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1233 |
val repTs = map #repT absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1234 |
val abs_injects = map #abs_inject absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1235 |
val abs_inverses = map #abs_inverse absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1236 |
val type_definitions = map #type_definition absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1237 |
|
53143
ba80154a1118
configuration option to control timing output for (co)datatypes
traytel
parents:
53126
diff
changeset
|
1238 |
val time = time lthy; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1239 |
val timer = time (Timer.startRealTimer ()); |
49121 | 1240 |
|
57397 | 1241 |
val fp_nesting_bnfs = nesting_bnfs lthy ctrXs_Tsss Xs; |
1242 |
val live_nesting_bnfs = nesting_bnfs lthy ctrXs_Tsss As; |
|
49226 | 1243 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1244 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1245 |
val pre_set_defss = map set_defs_of_bnf pre_bnfs; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1246 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
57397 | 1247 |
val fp_nesting_set_maps = maps set_map_of_bnf fp_nesting_bnfs; |
1248 |
val live_nesting_set_maps = maps set_map_of_bnf live_nesting_bnfs; |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1249 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1250 |
val live = live_of_bnf any_fp_bnf; |
52961 | 1251 |
val _ = |
1252 |
if live = 0 andalso exists (not o Binding.is_empty) (map_bs @ rel_bs) then |
|
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1253 |
warning "Map function and relator names ignored" |
52961 | 1254 |
else |
1255 |
(); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1256 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1257 |
val Bs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1258 |
map3 (fn alive => fn A as TFree (_, S) => fn B => if alive then resort_tfree S B else A) |
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1259 |
(liveness_of_fp_bnf num_As any_fp_bnf) As Bs0; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1260 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1261 |
val B_ify = Term.typ_subst_atomic (As ~~ Bs); |
49167 | 1262 |
|
49501 | 1263 |
val ctors = map (mk_ctor As) ctors0; |
1264 |
val dtors = map (mk_dtor As) dtors0; |
|
49124 | 1265 |
|
49501 | 1266 |
val fpTs = map (domain_type o fastype_of) dtors; |
56638 | 1267 |
val fpBTs = map B_ify fpTs; |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
1268 |
|
51780 | 1269 |
fun massage_simple_notes base = |
1270 |
filter_out (null o #2) |
|
57700 | 1271 |
#> map (fn (thmN, thms, f_attrs) => |
1272 |
((Binding.qualify true base (Binding.name thmN), []), map_index (fn (i, thm) => ([thm], f_attrs i)) thms)); |
|
51780 | 1273 |
|
1274 |
val massage_multi_notes = |
|
1275 |
maps (fn (thmN, thmss, attrs) => |
|
53792 | 1276 |
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => |
55410 | 1277 |
((Binding.qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])])) |
53792 | 1278 |
fp_b_names fpTs thmss) |
1279 |
#> filter_out (null o fst o hd o snd); |
|
51780 | 1280 |
|
52310
28063e412793
support induction principles with multiple occurrences of the same type in "fpTs" and (hopefully) with loss of recursion (e.g. primrec definition of is_nil, where the IH can be dropped)
blanchet
parents:
52309
diff
changeset
|
1281 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss; |
49203 | 1282 |
val ns = map length ctr_Tsss; |
49212 | 1283 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 1284 |
val mss = map (map length) ctr_Tsss; |
1285 |
||
55867 | 1286 |
val ((xtor_co_recs, recs_args_types, corecs_args_types), lthy') = |
55868 | 1287 |
mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy; |
49210 | 1288 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1289 |
fun define_ctrs_dtrs_for_type (((((((((((((((((((((((((((fp_bnf, fp_b), fpT), ctor), dtor), |
55867 | 1290 |
xtor_co_rec), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs), |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1291 |
pre_rel_def), fp_map_thm), fp_set_thms), fp_rel_thm), n), ks), ms), abs), |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1292 |
abs_inject), abs_inverse), type_definition), ctr_bindings), ctr_mixfixes), ctr_Tss), |
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
1293 |
disc_bindings), sel_bindingss), raw_sel_default_eqs) no_defs_lthy = |
49176 | 1294 |
let |
49498 | 1295 |
val fp_b_name = Binding.name_of fp_b; |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1296 |
val fpBT = B_ify fpT; |
49498 | 1297 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1298 |
val ctr_absT = domain_type (fastype_of ctor); |
49119 | 1299 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1300 |
val ((((w, xss), yss), u'), names_lthy) = |
49204 | 1301 |
no_defs_lthy |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1302 |
|> yield_singleton (mk_Frees "w") ctr_absT |
49370 | 1303 |
||>> mk_Freess "x" ctr_Tss |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1304 |
||>> mk_Freess "y" (map (map B_ify) ctr_Tss) |
49498 | 1305 |
||>> yield_singleton Variable.variant_fixes fp_b_name; |
49370 | 1306 |
|
49498 | 1307 |
val u = Free (u', fpT); |
49121 | 1308 |
|
49129 | 1309 |
val ctr_rhss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1310 |
map2 (fn k => fn xs => fold_rev Term.lambda xs (ctor $ mk_absumprod ctr_absT abs n k xs)) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1311 |
ks xss; |
49121 | 1312 |
|
53569
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1313 |
val maybe_conceal_def_binding = Thm.def_binding |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1314 |
#> Config.get no_defs_lthy bnf_note_all = false ? Binding.conceal; |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1315 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1316 |
val ((raw_ctrs, raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 1317 |
|> apfst split_list o fold_map3 (fn b => fn mx => fn rhs => |
53569
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1318 |
Local_Theory.define ((b, mx), ((maybe_conceal_def_binding b, []), rhs)) #>> apsnd snd) |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1319 |
ctr_bindings ctr_mixfixes ctr_rhss |
49121 | 1320 |
||> `Local_Theory.restore; |
1321 |
||
1322 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
1323 |
||
1324 |
val ctr_defs = map (Morphism.thm phi) raw_ctr_defs; |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1325 |
val ctr_defs' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1326 |
map2 (fn m => fn def => mk_unabs_def m (def RS meta_eq_to_obj_eq)) ms ctr_defs; |
49130
3c26e17b2849
implemented "mk_case_tac" -- and got rid of "cheat_tac"
blanchet
parents:
49129
diff
changeset
|
1327 |
|
49203 | 1328 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
1329 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 1330 |
|
51897 | 1331 |
fun wrap_ctrs lthy = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1332 |
let |
50170 | 1333 |
fun exhaust_tac {context = ctxt, prems = _} = |
49135 | 1334 |
let |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1335 |
val ctor_iff_dtor_thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1336 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1337 |
val goal = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1338 |
fold_rev Logic.all [w, u] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1339 |
(mk_Trueprop_eq (HOLogic.mk_eq (u, ctor $ w), HOLogic.mk_eq (dtor $ u, w))); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1340 |
in |
51551 | 1341 |
Goal.prove_sorry lthy [] [] goal (fn {context = ctxt, ...} => |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1342 |
mk_ctor_iff_dtor_tac ctxt (map (SOME o certifyT lthy) [ctr_absT, fpT]) |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1343 |
(certify lthy ctor) (certify lthy dtor) ctor_dtor dtor_ctor) |
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55397
diff
changeset
|
1344 |
|> Morphism.thm phi |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1345 |
|> Thm.close_derivation |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1346 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1347 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1348 |
val sumEN_thm' = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1349 |
unfold_thms lthy @{thms unit_all_eq1} (mk_absumprodE type_definition ms) |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1350 |
|> Morphism.thm phi; |
49135 | 1351 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1352 |
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' |
49135 | 1353 |
end; |
1354 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1355 |
val inject_tacss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1356 |
map2 (fn ctr_def => fn 0 => [] | _ => [fn {context = ctxt, ...} => |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1357 |
mk_inject_tac ctxt ctr_def ctor_inject abs_inject]) ctr_defs ms; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1358 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1359 |
val half_distinct_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1360 |
map (map (fn (def, def') => fn {context = ctxt, ...} => |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1361 |
mk_half_distinct_tac ctxt ctor_inject abs_inject [def, def'])) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1362 |
(mk_half_pairss (`I ctr_defs)); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1363 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1364 |
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1365 |
|
57830
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1366 |
val sel_Tss = map (map (curry (op -->) fpT)) ctr_Tss; |
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1367 |
val sel_bTs = |
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1368 |
flat sel_bindingss ~~ flat sel_Tss |
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1369 |
|> filter_out (Binding.is_empty o fst) |
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1370 |
|> distinct (Binding.eq_name o pairself fst); |
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1371 |
val sel_default_lthy = fake_local_theory_for_sel_defaults sel_bTs lthy; |
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1372 |
|
2d0f0d6fdf3e
correctly resolve selector names in default value equations
blanchet
parents:
57824
diff
changeset
|
1373 |
val sel_default_eqs = map (prepare_term sel_default_lthy) raw_sel_default_eqs; |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1374 |
|
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
1375 |
fun ctr_spec_of disc_b ctr0 sel_bs = ((disc_b, ctr0), sel_bs); |
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
1376 |
val ctr_specs = map3 ctr_spec_of disc_bindings ctrs0 sel_bindingss; |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1377 |
in |
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
1378 |
free_constructors tacss ((((discs_sels, no_code), standard_binding), ctr_specs), |
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
1379 |
sel_default_eqs) lthy |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1380 |
end; |
49121 | 1381 |
|
58093 | 1382 |
fun derive_maps_sets_rels (ctr_sugar as {casex, case_cong, case_thms, discs, selss, ctrs, |
58095 | 1383 |
exhaust, exhaust_discs, disc_thmss, sel_thmss, injects, distincts, distinct_discsss, |
1384 |
...} : ctr_sugar, lthy) = |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1385 |
if live = 0 then |
51840 | 1386 |
((([], [], [], []), ctr_sugar), lthy) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1387 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1388 |
let |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1389 |
val rel_flip = rel_flip_of_bnf fp_bnf; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1390 |
val nones = replicate live NONE; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1391 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1392 |
val ctor_cong = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1393 |
if fp = Least_FP then |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1394 |
Drule.dummy_thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1395 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1396 |
let val ctor' = mk_ctor Bs ctor in |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1397 |
cterm_instantiate_pos [NONE, NONE, SOME (certify lthy ctor')] arg_cong |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1398 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1399 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1400 |
fun mk_cIn ctor k xs = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1401 |
let val absT = domain_type (fastype_of ctor) in |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1402 |
mk_absumprod absT abs n k xs |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1403 |
|> fp = Greatest_FP ? curry (op $) ctor |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1404 |
|> certify lthy |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1405 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1406 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1407 |
val cxIns = map2 (mk_cIn ctor) ks xss; |
56638 | 1408 |
val cyIns = map2 (mk_cIn (Term.map_types B_ify ctor)) ks yss; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1409 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1410 |
fun mk_map_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1411 |
fold_thms lthy [ctr_def'] |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1412 |
(unfold_thms lthy (o_apply :: pre_map_def :: |
56978
0c1b4987e6b2
proper handling of 'ctor_dtor' for mutual corecursive cases where not all type variables are present in all low-level constructors (cf. 'coind_wit1' etc. in 'Misc_Codatatypes.thy')
blanchet
parents:
56956
diff
changeset
|
1413 |
(if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_map @ |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1414 |
abs_inverses) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1415 |
(cterm_instantiate_pos (nones @ [SOME cxIn]) |
56978
0c1b4987e6b2
proper handling of 'ctor_dtor' for mutual corecursive cases where not all type variables are present in all low-level constructors (cf. 'coind_wit1' etc. in 'Misc_Codatatypes.thy')
blanchet
parents:
56956
diff
changeset
|
1416 |
(if fp = Least_FP then fp_map_thm |
0c1b4987e6b2
proper handling of 'ctor_dtor' for mutual corecursive cases where not all type variables are present in all low-level constructors (cf. 'coind_wit1' etc. in 'Misc_Codatatypes.thy')
blanchet
parents:
56956
diff
changeset
|
1417 |
else fp_map_thm RS ctor_cong RS (ctor_dtor RS sym RS trans)))) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1418 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1419 |
|
57815 | 1420 |
fun mk_set0_thm fp_set_thm ctr_def' cxIn = |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1421 |
fold_thms lthy [ctr_def'] |
57397 | 1422 |
(unfold_thms lthy (pre_set_defs @ fp_nesting_set_maps @ live_nesting_set_maps @ |
57891 | 1423 |
(if fp = Least_FP then [] else [dtor_ctor]) @ basic_sumprod_thms_set @ |
57815 | 1424 |
@{thms UN_Un sup_assoc[THEN sym]} @ abs_inverses) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1425 |
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1426 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1427 |
|
57815 | 1428 |
fun mk_set0_thms fp_set_thm = map2 (mk_set0_thm fp_set_thm) ctr_defs' cxIns; |
49127 | 1429 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1430 |
val map_thms = map2 mk_map_thm ctr_defs' cxIns; |
57815 | 1431 |
val set0_thmss = map mk_set0_thms fp_set_thms; |
1432 |
val set0_thms = flat set0_thmss; |
|
1433 |
val set_thms = set0_thms |
|
1434 |
|> map (unfold_thms lthy @{thms insert_is_Un[THEN sym] Un_empty_left |
|
1435 |
Un_insert_left}); |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1436 |
|
57525 | 1437 |
val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns); |
1438 |
||
1439 |
fun mk_rel_thm postproc ctr_defs' cxIn cyIn = |
|
1440 |
fold_thms lthy ctr_defs' |
|
1441 |
(unfold_thms lthy (pre_rel_def :: abs_inverse :: |
|
1442 |
(if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_rel @ |
|
1443 |
@{thms vimage2p_def sum.inject sum.distinct(1)[THEN eq_False[THEN iffD2]]}) |
|
1444 |
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) |
|
1445 |
|> postproc |
|
1446 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
|
1447 |
||
1448 |
fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) = |
|
1449 |
mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn; |
|
1450 |
||
1451 |
fun mk_rel_intro_thm thm = |
|
1452 |
let |
|
1453 |
fun impl thm = rotate_prems (~1) (impl (rotate_prems 1 (conjI RS thm))) |
|
1454 |
handle THM _ => thm |
|
1455 |
in |
|
1456 |
impl (thm RS iffD2) |
|
1457 |
handle THM _ => thm |
|
1458 |
end; |
|
1459 |
||
1460 |
fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) = |
|
1461 |
mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def'] |
|
1462 |
cxIn cyIn; |
|
1463 |
||
1464 |
fun mk_other_half_rel_distinct_thm thm = |
|
1465 |
flip_rels lthy live thm |
|
1466 |
RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2); |
|
1467 |
||
1468 |
val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos); |
|
1469 |
val rel_intro_thms = map mk_rel_intro_thm rel_inject_thms; |
|
1470 |
||
1471 |
val half_rel_distinct_thmss = |
|
1472 |
map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos); |
|
1473 |
val other_half_rel_distinct_thmss = |
|
1474 |
map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss; |
|
1475 |
val (rel_distinct_thms, _) = |
|
1476 |
join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss; |
|
1477 |
||
1478 |
val rel_eq_thms = |
|
1479 |
map (fn th => th RS @{thm eq_False[THEN iffD2]}) rel_distinct_thms @ |
|
1480 |
map2 (fn th => fn 0 => th RS @{thm eq_True[THEN iffD2]} | _ => th) |
|
1481 |
rel_inject_thms ms; |
|
1482 |
||
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1483 |
val (map_disc_iff_thms, map_sel_thms, set_sel_thms, rel_sel_thms, set_intros_thms, |
58095 | 1484 |
case_transfer_thms, ctr_transfer_thms, disc_transfer_thms, |
1485 |
(set_cases_thms, set_cases_attrss), (rel_cases_thm, rel_cases_attrs)) = |
|
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1486 |
let |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1487 |
val live_AsBs = filter (op <>) (As ~~ Bs); |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1488 |
val fTs = map (op -->) live_AsBs; |
57893 | 1489 |
val (((((fs, Rs), ta), tb), thesis), names_lthy) = names_lthy |
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1490 |
|> mk_Frees "f" fTs |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1491 |
||>> mk_Frees "R" (map (uncurry mk_pred2T) live_AsBs) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1492 |
||>> yield_singleton (mk_Frees "a") fpT |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1493 |
||>> yield_singleton (mk_Frees "b") fpBT |
57893 | 1494 |
||>> apfst HOLogic.mk_Trueprop o |
1495 |
yield_singleton (mk_Frees "thesis") HOLogic.boolT; |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1496 |
val map_term = mk_map live As Bs (map_of_bnf fp_bnf); |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1497 |
val ctrAs = map (mk_ctr As) ctrs; |
57999 | 1498 |
val ctrBs = map (mk_ctr Bs) ctrs; |
1499 |
val relAsBs = mk_rel live As Bs (rel_of_bnf fp_bnf); |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1500 |
val setAs = map (mk_set As) (sets_of_bnf fp_bnf); |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1501 |
val discAs = map (mk_disc_or_sel As) discs; |
58095 | 1502 |
val discBs = map (mk_disc_or_sel Bs) discs; |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1503 |
val selAss = map (map (mk_disc_or_sel As)) selss; |
57563 | 1504 |
val discAs_selAss = flat (map2 (map o pair) discAs selAss); |
1505 |
||
57999 | 1506 |
val ctr_transfer_thms = |
1507 |
let |
|
58093 | 1508 |
val goals = map2 (mk_parametricity_goal names_lthy Rs) ctrAs ctrBs; |
57999 | 1509 |
in |
1510 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
|
58044 | 1511 |
(K (mk_ctr_transfer_tac rel_intro_thms)) |
57999 | 1512 |
|> Conjunction.elim_balanced (length goals) |
1513 |
|> Proof_Context.export names_lthy lthy |
|
1514 |
|> map Thm.close_derivation |
|
1515 |
end; |
|
1516 |
||
57893 | 1517 |
val (set_cases_thms, set_cases_attrss) = |
1518 |
let |
|
1519 |
fun mk_prems assms elem t ctxt = |
|
1520 |
(case fastype_of t of |
|
1521 |
Type (type_name, xs) => |
|
1522 |
(case bnf_of ctxt type_name of |
|
1523 |
NONE => ([], ctxt) |
|
1524 |
| SOME bnf => |
|
1525 |
apfst flat (fold_map (fn set => fn ctxt => |
|
1526 |
let |
|
1527 |
val X = HOLogic.dest_setT (range_type (fastype_of set)); |
|
1528 |
val new_var = not (X = fastype_of elem); |
|
1529 |
val (x, ctxt') = |
|
1530 |
if new_var then yield_singleton (mk_Frees "x") X ctxt |
|
1531 |
else (elem, ctxt); |
|
1532 |
in |
|
1533 |
mk_prems (mk_Trueprop_mem (x, set $ t) :: assms) elem x ctxt' |
|
1534 |
|>> map (if new_var then Logic.all x else I) |
|
1535 |
end) (map (mk_set xs) (sets_of_bnf bnf)) ctxt)) |
|
1536 |
| T => rpair ctxt |
|
1537 |
(if T = fastype_of elem then [fold (curry Logic.mk_implies) assms thesis] |
|
1538 |
else [])); |
|
1539 |
in |
|
1540 |
split_list (map (fn set => |
|
1541 |
let |
|
1542 |
val A = HOLogic.dest_setT (range_type (fastype_of set)); |
|
1543 |
val (elem, names_lthy) = yield_singleton (mk_Frees "e") A names_lthy; |
|
1544 |
val premss = |
|
1545 |
map (fn ctr => |
|
1546 |
let |
|
1547 |
val (args, names_lthy) = |
|
1548 |
mk_Frees "z" (binder_types (fastype_of ctr)) names_lthy; |
|
1549 |
in |
|
1550 |
flat (zipping_map (fn (prev_args, arg, next_args) => |
|
1551 |
let |
|
1552 |
val (args_with_elem, args_without_elem) = |
|
1553 |
if fastype_of arg = A then |
|
1554 |
(prev_args @ [elem] @ next_args, prev_args @ next_args) |
|
1555 |
else |
|
1556 |
`I (prev_args @ [arg] @ next_args); |
|
1557 |
in |
|
1558 |
mk_prems |
|
1559 |
[mk_Trueprop_eq (ta, Term.list_comb (ctr, args_with_elem))] |
|
1560 |
elem arg names_lthy |
|
1561 |
|> fst |
|
1562 |
|> map (fold_rev Logic.all args_without_elem) |
|
1563 |
end) args) |
|
1564 |
end) ctrAs; |
|
1565 |
val goal = Logic.mk_implies (mk_Trueprop_mem (elem, set $ ta), thesis); |
|
1566 |
val thm = |
|
1567 |
Goal.prove_sorry lthy [] (flat premss) goal |
|
1568 |
(fn {context = ctxt, prems} => |
|
58044 | 1569 |
mk_set_cases_tac ctxt (certify ctxt ta) prems exhaust set_thms) |
57893 | 1570 |
|> singleton (Proof_Context.export names_lthy lthy) |
1571 |
|> Thm.close_derivation |
|
1572 |
|> rotate_prems ~1; |
|
57987 | 1573 |
|
1574 |
val consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1)); |
|
1575 |
val cases_set_attr = |
|
1576 |
Attrib.internal (K (Induct.cases_pred (name_of_set set))); |
|
57893 | 1577 |
in |
57987 | 1578 |
(* TODO: @{attributes [elim?]} *) |
1579 |
(thm, [consumes_attr, cases_set_attr]) |
|
57893 | 1580 |
end) setAs) |
1581 |
end; |
|
1582 |
||
57891 | 1583 |
val set_intros_thms = |
1584 |
let |
|
1585 |
fun mk_goals A setA ctr_args t ctxt = |
|
1586 |
(case fastype_of t of |
|
1587 |
Type (type_name, innerTs) => |
|
1588 |
(case bnf_of ctxt type_name of |
|
1589 |
NONE => ([], ctxt) |
|
1590 |
| SOME bnf => |
|
1591 |
apfst flat (fold_map (fn set => fn ctxt => |
|
1592 |
let |
|
1593 |
val X = HOLogic.dest_setT (range_type (fastype_of set)); |
|
1594 |
val (x, ctxt') = yield_singleton (mk_Frees "x") X ctxt; |
|
1595 |
val assm = mk_Trueprop_mem (x, set $ t); |
|
1596 |
in |
|
1597 |
apfst (map (Logic.mk_implies o pair assm)) |
|
1598 |
(mk_goals A setA ctr_args x ctxt') |
|
1599 |
end) (map (mk_set innerTs) (sets_of_bnf bnf)) ctxt)) |
|
1600 |
| T => |
|
1601 |
(if T = A then [mk_Trueprop_mem (t, setA $ ctr_args)] else [], ctxt)); |
|
1602 |
||
1603 |
val (goals, names_lthy) = |
|
1604 |
apfst flat (fold_map (fn set => fn ctxt => |
|
1605 |
let |
|
1606 |
val A = HOLogic.dest_setT (range_type (fastype_of set)); |
|
1607 |
in |
|
1608 |
apfst flat (fold_map (fn ctr => fn ctxt => |
|
1609 |
let |
|
1610 |
val (args, ctxt') = |
|
1611 |
mk_Frees "arg" (binder_types (fastype_of ctr)) ctxt; |
|
1612 |
val ctr_args = Term.list_comb (ctr, args); |
|
1613 |
in |
|
1614 |
apfst flat (fold_map (mk_goals A set ctr_args) args ctxt') |
|
1615 |
end) ctrAs ctxt) |
|
1616 |
end) setAs lthy); |
|
1617 |
in |
|
1618 |
if null goals then [] |
|
1619 |
else |
|
1620 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
|
1621 |
(fn {context = ctxt, prems = _} => mk_set_intros_tac ctxt set0_thms) |
|
1622 |
|> Conjunction.elim_balanced (length goals) |
|
1623 |
|> Proof_Context.export names_lthy lthy |
|
1624 |
|> map Thm.close_derivation |
|
1625 |
end; |
|
1626 |
||
57563 | 1627 |
val rel_sel_thms = |
1628 |
let |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1629 |
val selBss = map (map (mk_disc_or_sel Bs)) selss; |
57563 | 1630 |
val n = length discAs; |
1631 |
||
1632 |
fun mk_rhs n k discA selAs discB selBs = |
|
1633 |
(if k = n then [] else [HOLogic.mk_eq (discA $ ta, discB $ tb)]) @ |
|
1634 |
(case (selAs, selBs) of |
|
1635 |
([], []) => [] |
|
1636 |
| (_ :: _, _ :: _) => [Library.foldr HOLogic.mk_imp |
|
1637 |
(if n = 1 then [] else [discA $ ta, discB $ tb], |
|
1638 |
Library.foldr1 HOLogic.mk_conj (map2 (build_rel_app names_lthy Rs []) |
|
1639 |
(map (rapp ta) selAs) (map (rapp tb) selBs)))]); |
|
1640 |
||
1641 |
val goals = if n = 0 then [] |
|
1642 |
else [mk_Trueprop_eq |
|
1643 |
(build_rel_app names_lthy Rs [] ta tb, |
|
1644 |
Library.foldr1 HOLogic.mk_conj |
|
1645 |
(flat (map5 (mk_rhs n) (1 upto n) discAs selAss discBs selBss)))]; |
|
1646 |
in |
|
1647 |
if null goals then |
|
1648 |
[] |
|
1649 |
else |
|
1650 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
|
1651 |
(fn {context = ctxt, prems = _} => |
|
58044 | 1652 |
mk_rel_sel_tac ctxt (certify ctxt ta) (certify ctxt tb) exhaust |
1653 |
(flat disc_thmss) (flat sel_thmss) rel_inject_thms distincts |
|
1654 |
rel_distinct_thms) |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1655 |
|> Conjunction.elim_balanced (length goals) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1656 |
|> Proof_Context.export names_lthy lthy |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1657 |
|> map Thm.close_derivation |
57563 | 1658 |
end; |
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1659 |
|
57525 | 1660 |
val (rel_cases_thm, rel_cases_attrs) = |
1661 |
let |
|
57999 | 1662 |
val rel_Rs_a_b = list_comb (relAsBs, Rs) $ ta $ tb; |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1663 |
val ctrBs = map (mk_ctr Bs) ctrs; |
57525 | 1664 |
|
1665 |
fun mk_assms ctrA ctrB ctxt = |
|
1666 |
let |
|
1667 |
val argA_Ts = binder_types (fastype_of ctrA); |
|
1668 |
val argB_Ts = binder_types (fastype_of ctrB); |
|
1669 |
val ((argAs, argBs), names_ctxt) = ctxt |
|
1670 |
|> mk_Frees "x" argA_Ts |
|
1671 |
||>> mk_Frees "y" argB_Ts; |
|
1672 |
val ctrA_args = list_comb (ctrA, argAs); |
|
1673 |
val ctrB_args = list_comb (ctrB, argBs); |
|
1674 |
in |
|
1675 |
(fold_rev Logic.all (argAs @ argBs) (Logic.list_implies |
|
1676 |
(mk_Trueprop_eq (ta, ctrA_args) :: |
|
1677 |
mk_Trueprop_eq (tb, ctrB_args) :: |
|
57565 | 1678 |
map2 (HOLogic.mk_Trueprop oo build_rel_app lthy Rs []) |
1679 |
argAs argBs, |
|
57525 | 1680 |
thesis)), |
1681 |
names_ctxt) |
|
1682 |
end; |
|
1683 |
||
1684 |
val (assms, names_lthy) = fold_map2 mk_assms ctrAs ctrBs names_lthy; |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1685 |
val goal = |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1686 |
Logic.list_implies (HOLogic.mk_Trueprop rel_Rs_a_b :: assms, thesis); |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1687 |
val thm = |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1688 |
Goal.prove_sorry lthy [] [] goal |
57525 | 1689 |
(fn {context = ctxt, prems = _} => |
58044 | 1690 |
mk_rel_cases_tac ctxt (certify ctxt ta) (certify ctxt tb) exhaust |
1691 |
injects rel_inject_thms distincts rel_distinct_thms |
|
1692 |
(map rel_eq_of_bnf live_nesting_bnfs)) |
|
57525 | 1693 |
|> singleton (Proof_Context.export names_lthy lthy) |
1694 |
|> Thm.close_derivation; |
|
1695 |
||
1696 |
val ctr_names = quasi_unambiguous_case_names ((map name_of_ctr) ctrAs); |
|
1697 |
val case_names_attr = Attrib.internal (K (Rule_Cases.case_names ctr_names)); |
|
1698 |
val consumes_attr = Attrib.internal (K (Rule_Cases.consumes 1)); |
|
1699 |
val cases_pred_attr = Attrib.internal o K o Induct.cases_pred; |
|
1700 |
in |
|
1701 |
(thm, [consumes_attr, case_names_attr, cases_pred_attr ""]) |
|
1702 |
end; |
|
1703 |
||
58093 | 1704 |
val case_transfer_thms = |
1705 |
let |
|
1706 |
val (R, names_lthy) = |
|
1707 |
yield_singleton (mk_Frees "R") (mk_pred2T C1 E1) names_lthy; |
|
1708 |
||
1709 |
val caseA = mk_case As C1 casex; |
|
1710 |
val caseB = mk_case Bs E1 casex; |
|
1711 |
val goal = mk_parametricity_goal names_lthy (R :: Rs) caseA caseB; |
|
1712 |
in |
|
1713 |
Goal.prove_sorry lthy [] [] goal |
|
1714 |
(fn {context = ctxt, prems = _} => |
|
1715 |
mk_case_transfer_tac ctxt rel_cases_thm case_thms) |
|
1716 |
|> singleton (Proof_Context.export names_lthy lthy) |
|
1717 |
|> Thm.close_derivation |
|
1718 |
end; |
|
1719 |
||
58095 | 1720 |
val disc_transfer_thms = |
1721 |
let |
|
1722 |
val goals = map2 (mk_parametricity_goal names_lthy Rs) discAs discBs; |
|
1723 |
in |
|
1724 |
if null goals then [] |
|
1725 |
else |
|
1726 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
|
1727 |
(fn {context = ctxt, prems = _} => |
|
1728 |
mk_disc_transfer_tac ctxt (the_single rel_sel_thms) |
|
1729 |
(the_single exhaust_discs) (flat (flat distinct_discsss))) |
|
1730 |
|> Conjunction.elim_balanced (length goals) |
|
1731 |
|> Proof_Context.export names_lthy lthy |
|
1732 |
|> map Thm.close_derivation |
|
1733 |
end; |
|
1734 |
||
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1735 |
val map_disc_iff_thms = |
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1736 |
let |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1737 |
val discsB = map (mk_disc_or_sel Bs) discs; |
57563 | 1738 |
val discsA_t = map (fn disc1 => Term.betapply (disc1, ta)) discAs; |
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1739 |
|
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1740 |
fun mk_goal (discA_t, discB) = |
57205 | 1741 |
if head_of discA_t aconv HOLogic.Not orelse is_refl_bool discA_t then |
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1742 |
NONE |
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1743 |
else |
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1744 |
SOME (mk_Trueprop_eq |
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1745 |
(betapply (discB, (Term.list_comb (map_term, fs) $ ta)), discA_t)); |
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1746 |
|
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1747 |
val goals = map_filter mk_goal (discsA_t ~~ discsB); |
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1748 |
in |
57199 | 1749 |
if null goals then |
1750 |
[] |
|
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1751 |
else |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1752 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1753 |
(fn {context = ctxt, prems = _} => |
58044 | 1754 |
mk_map_disc_iff_tac ctxt (certify ctxt ta) exhaust (flat disc_thmss) |
1755 |
map_thms) |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1756 |
|> Conjunction.elim_balanced (length goals) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1757 |
|> Proof_Context.export names_lthy lthy |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1758 |
|> map Thm.close_derivation |
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1759 |
end; |
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1760 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1761 |
val map_sel_thms = |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1762 |
let |
57152 | 1763 |
fun mk_goal (discA, selA) = |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1764 |
let |
57199 | 1765 |
val prem = Term.betapply (discA, ta); |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1766 |
val selB = mk_disc_or_sel Bs selA; |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1767 |
val lhs = selB $ (Term.list_comb (map_term, fs) $ ta); |
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1768 |
val lhsT = fastype_of lhs; |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1769 |
val map_rhsT = |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1770 |
map_atyps (perhaps (AList.lookup (op =) (map swap live_AsBs))) lhsT; |
57303 | 1771 |
val map_rhs = build_map lthy [] |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1772 |
(the o (AList.lookup (op =) (live_AsBs ~~ fs))) (map_rhsT, lhsT); |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1773 |
val rhs = (case map_rhs of |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1774 |
Const (@{const_name id}, _) => selA $ ta |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1775 |
| _ => map_rhs $ (selA $ ta)); |
57199 | 1776 |
val concl = mk_Trueprop_eq (lhs, rhs); |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1777 |
in |
57205 | 1778 |
if is_refl_bool prem then concl |
57199 | 1779 |
else Logic.mk_implies (HOLogic.mk_Trueprop prem, concl) |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1780 |
end; |
58044 | 1781 |
|
57563 | 1782 |
val goals = map mk_goal discAs_selAss; |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1783 |
in |
57199 | 1784 |
if null goals then |
1785 |
[] |
|
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1786 |
else |
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1787 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1788 |
(fn {context = ctxt, prems = _} => |
58044 | 1789 |
mk_map_sel_tac ctxt (certify ctxt ta) exhaust (flat disc_thmss) |
1790 |
map_thms (flat sel_thmss)) |
|
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1791 |
|> Conjunction.elim_balanced (length goals) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1792 |
|> Proof_Context.export names_lthy lthy |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1793 |
|> map Thm.close_derivation |
57046
b3613d7e108b
generate 'sel_map[simp]' theorem for (co)datatypes and tuning 'disc_map_iff'
desharna
parents:
56991
diff
changeset
|
1794 |
end; |
57199 | 1795 |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1796 |
val set_sel_thms = |
57152 | 1797 |
let |
1798 |
fun mk_goal discA selA setA ctxt = |
|
1799 |
let |
|
57199 | 1800 |
val prem = Term.betapply (discA, ta); |
57152 | 1801 |
val sel_rangeT = range_type (fastype_of selA); |
1802 |
val A = HOLogic.dest_setT (range_type (fastype_of setA)); |
|
57199 | 1803 |
|
57152 | 1804 |
fun travese_nested_types t ctxt = |
1805 |
(case fastype_of t of |
|
57891 | 1806 |
Type (type_name, innerTs) => |
57568 | 1807 |
(case bnf_of ctxt type_name of |
57152 | 1808 |
NONE => ([], ctxt) |
1809 |
| SOME bnf => |
|
1810 |
let |
|
1811 |
fun seq_assm a set ctxt = |
|
1812 |
let |
|
1813 |
val X = HOLogic.dest_setT (range_type (fastype_of set)); |
|
1814 |
val (x, ctxt') = yield_singleton (mk_Frees "x") X ctxt; |
|
57567 | 1815 |
val assm = mk_Trueprop_mem (x, set $ a); |
57152 | 1816 |
in |
1817 |
travese_nested_types x ctxt' |
|
1818 |
|>> map (Logic.mk_implies o pair assm) |
|
1819 |
end; |
|
1820 |
in |
|
57891 | 1821 |
fold_map (seq_assm t o mk_set innerTs) (sets_of_bnf bnf) ctxt |
57152 | 1822 |
|>> flat |
1823 |
end) |
|
1824 |
| T => |
|
1825 |
if T = A then |
|
57567 | 1826 |
([mk_Trueprop_mem (t, setA $ ta)], ctxt) |
57152 | 1827 |
else |
1828 |
([], ctxt)); |
|
57199 | 1829 |
|
1830 |
val (concls, ctxt') = |
|
57152 | 1831 |
if sel_rangeT = A then |
57567 | 1832 |
([mk_Trueprop_mem (selA $ ta, setA $ ta)], ctxt) |
57152 | 1833 |
else |
57568 | 1834 |
travese_nested_types (selA $ ta) ctxt; |
57152 | 1835 |
in |
1836 |
if exists_subtype_in [A] sel_rangeT then |
|
57205 | 1837 |
if is_refl_bool prem then |
57199 | 1838 |
(concls, ctxt') |
57152 | 1839 |
else |
57199 | 1840 |
(map (Logic.mk_implies o pair (HOLogic.mk_Trueprop prem)) concls, |
1841 |
ctxt') |
|
1842 |
else |
|
1843 |
([], ctxt) |
|
57152 | 1844 |
end; |
1845 |
val (goals, names_lthy) = apfst (flat o flat) (fold_map (fn (disc, sel) => |
|
57891 | 1846 |
fold_map (mk_goal disc sel) setAs) discAs_selAss names_lthy); |
57152 | 1847 |
in |
57199 | 1848 |
if null goals then |
1849 |
[] |
|
57152 | 1850 |
else |
1851 |
Goal.prove_sorry lthy [] [] (Logic.mk_conjunction_balanced goals) |
|
1852 |
(fn {context = ctxt, prems = _} => |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1853 |
mk_set_sel_tac ctxt (certify ctxt ta) exhaust (flat disc_thmss) |
57898
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1854 |
(flat sel_thmss) set0_thms) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1855 |
|> Conjunction.elim_balanced (length goals) |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1856 |
|> Proof_Context.export names_lthy lthy |
f7f75b33d6c8
avoid needless (and wrong w.r.t. sorts) generation of type variables; tuned whitespaces;
blanchet
parents:
57893
diff
changeset
|
1857 |
|> map Thm.close_derivation |
57152 | 1858 |
end; |
56991
8e9ca31e9b8e
generate 'disc_map_iff[simp]' theorem for (co)datatypes
desharna
parents:
56978
diff
changeset
|
1859 |
in |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1860 |
(map_disc_iff_thms, map_sel_thms, set_sel_thms, rel_sel_thms, set_intros_thms, |
58095 | 1861 |
case_transfer_thms, ctr_transfer_thms, disc_transfer_thms, |
1862 |
(set_cases_thms, set_cases_attrss), (rel_cases_thm, rel_cases_attrs)) |
|
57094
589ec121ce1a
don't generate discriminators and selectors for 'datatype_new' unless the user asked for it
blanchet
parents:
57091
diff
changeset
|
1863 |
end; |
56956 | 1864 |
|
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1865 |
val anonymous_notes = |
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
1866 |
[([case_cong], fundefcong_attrs), |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1867 |
(rel_eq_thms, code_nitpicksimp_attrs)] |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1868 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1869 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1870 |
val notes = |
58093 | 1871 |
[(case_transferN, [case_transfer_thms], K []), |
1872 |
(ctr_transferN, ctr_transfer_thms, K []), |
|
58095 | 1873 |
(disc_transferN, disc_transfer_thms, K []), |
57999 | 1874 |
(mapN, map_thms, K (code_nitpicksimp_attrs @ simp_attrs)), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1875 |
(map_disc_iffN, map_disc_iff_thms, K simp_attrs), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1876 |
(map_selN, map_sel_thms, K []), |
57700 | 1877 |
(rel_casesN, [rel_cases_thm], K rel_cases_attrs), |
1878 |
(rel_distinctN, rel_distinct_thms, K simp_attrs), |
|
1879 |
(rel_injectN, rel_inject_thms, K simp_attrs), |
|
1880 |
(rel_introsN, rel_intro_thms, K []), |
|
1881 |
(rel_selN, rel_sel_thms, K []), |
|
1882 |
(setN, set_thms, K (code_nitpicksimp_attrs @ simp_attrs)), |
|
57893 | 1883 |
(set_casesN, set_cases_thms, nth set_cases_attrss), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1884 |
(set_introsN, set_intros_thms, K []), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1885 |
(set_selN, set_sel_thms, K [])] |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1886 |
|> massage_simple_notes fp_b_name; |
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1887 |
|
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1888 |
val (noted, lthy') = |
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1889 |
lthy |
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1890 |
|> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) map_thms) |
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1891 |
|> fp = Least_FP |
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1892 |
? Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) rel_eq_thms) |
57815 | 1893 |
|> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) set0_thms) |
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1894 |
|> Local_Theory.notes (anonymous_notes @ notes); |
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1895 |
|
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1896 |
val subst = Morphism.thm (substitute_noted_thm noted); |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1897 |
in |
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1898 |
(((map subst map_thms, map subst rel_inject_thms, map subst rel_distinct_thms, |
57815 | 1899 |
map (map subst) set0_thmss), ctr_sugar), lthy') |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1900 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1901 |
|
55410 | 1902 |
fun mk_binding pre = Binding.qualify false fp_b_name (Binding.prefix_name (pre ^ "_") fp_b); |
49287
ebe2a5cec4bf
allow defaults for one datatype to involve the constructor of another one in the mutually recursive case
blanchet
parents:
49286
diff
changeset
|
1903 |
|
55867 | 1904 |
fun massage_res (((maps_sets_rels, ctr_sugar), co_rec_res), lthy) = |
1905 |
(((maps_sets_rels, (ctrs, xss, ctr_defs, ctr_sugar)), co_rec_res), lthy); |
|
49119 | 1906 |
in |
51897 | 1907 |
(wrap_ctrs |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1908 |
#> derive_maps_sets_rels |
52313 | 1909 |
##>> |
56641
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
1910 |
(if fp = Least_FP then define_rec (the recs_args_types) mk_binding fpTs Cs reps |
55867 | 1911 |
else define_corec (the corecs_args_types) mk_binding fpTs Cs abss) xtor_co_rec |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1912 |
#> massage_res, lthy') |
49119 | 1913 |
end; |
49167 | 1914 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1915 |
fun wrap_types_etc (wrap_types_etcs, lthy) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1916 |
fold_map I wrap_types_etcs lthy |
52342 | 1917 |
|>> apsnd split_list o apfst (apsnd split_list4 o apfst split_list4 o split_list) |
1918 |
o split_list; |
|
49226 | 1919 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1920 |
fun mk_simp_thms ({injects, distincts, case_thms, ...} : ctr_sugar) co_recs mapsx rel_injects |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1921 |
rel_distincts setss = |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1922 |
injects @ distincts @ case_thms @ co_recs @ mapsx @ rel_injects @ rel_distincts @ flat setss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1923 |
|
55867 | 1924 |
fun derive_note_induct_recs_thms_for_types |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
1925 |
((((mapss, rel_injectss, rel_distinctss, setss), (ctrss, _, ctr_defss, ctr_sugars)), |
55864 | 1926 |
(recs, rec_defs)), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1927 |
let |
55869 | 1928 |
val ((induct_thms, induct_thm, induct_attrs), (rec_thmss, rec_attrs)) = |
55868 | 1929 |
derive_induct_recs_thms_for_types pre_bnfs recs_args_types xtor_co_induct xtor_co_rec_thms |
57397 | 1930 |
live_nesting_bnfs fp_nesting_bnfs fpTs Cs Xs ctrXs_Tsss abs_inverses type_definitions |
55868 | 1931 |
abs_inverses ctrss ctr_defss recs rec_defs lthy; |
49201 | 1932 |
|
51830 | 1933 |
val induct_type_attr = Attrib.internal o K o Induct.induct_type; |
57471 | 1934 |
val induct_pred_attr = Attrib.internal o K o Induct.induct_pred; |
1935 |
||
1936 |
val ((rel_induct_thmss, common_rel_induct_thms), |
|
1937 |
(rel_induct_attrs, common_rel_induct_attrs)) = |
|
1938 |
if live = 0 then |
|
1939 |
((replicate nn [], []), ([], [])) |
|
1940 |
else |
|
1941 |
let |
|
1942 |
val ((rel_induct_thms, common_rel_induct_thm), rel_induct_attrs) = |
|
57535 | 1943 |
derive_rel_induct_thms_for_types lthy fpTs As Bs ctrss ctr_Tsss |
1944 |
(map #exhaust ctr_sugars) rel_xtor_co_induct_thm ctr_defss ctor_injects |
|
1945 |
pre_rel_defs abs_inverses (map rel_eq_of_bnf live_nesting_bnfs); |
|
57471 | 1946 |
in |
1947 |
((map single rel_induct_thms, single common_rel_induct_thm), |
|
1948 |
(rel_induct_attrs, rel_induct_attrs)) |
|
1949 |
end; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1950 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1951 |
val simp_thmss = |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
1952 |
map6 mk_simp_thms ctr_sugars rec_thmss mapss rel_injectss rel_distinctss setss; |
49438 | 1953 |
|
49337 | 1954 |
val common_notes = |
57471 | 1955 |
(if nn > 1 then |
57700 | 1956 |
[(inductN, [induct_thm], K induct_attrs), |
1957 |
(rel_inductN, common_rel_induct_thms, K common_rel_induct_attrs)] |
|
57633 | 1958 |
else |
1959 |
[]) |
|
51780 | 1960 |
|> massage_simple_notes fp_common_name; |
49337 | 1961 |
|
49226 | 1962 |
val notes = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1963 |
[(inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]), |
55869 | 1964 |
(recN, rec_thmss, K rec_attrs), |
57471 | 1965 |
(rel_inductN, rel_induct_thmss, K (rel_induct_attrs @ [induct_pred_attr ""])), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1966 |
(simpsN, simp_thmss, K [])] |
51780 | 1967 |
|> massage_multi_notes; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1968 |
in |
51824 | 1969 |
lthy |
56641
029997d3b5d8
reverted rb458558cbcc2 -- better to keep 'case' and 'rec' distinct, otherwise we lose the connection between 'ctor_rec' (the low-level recursor) and 'rec'
blanchet
parents:
56640
diff
changeset
|
1970 |
|> Spec_Rules.add Spec_Rules.Equational (recs, flat rec_thmss) |
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1971 |
|> Local_Theory.notes (common_notes @ notes) |
57633 | 1972 |
(* for "datatype_realizer.ML": *) |
1973 |
|>> name_noted_thms |
|
1974 |
(fst (dest_Type (hd fpTs)) ^ (implode (map (prefix "_") (tl fp_b_names)))) inductN |
|
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
1975 |
|-> register_as_fp_sugars fpTs fpBTs Xs Least_FP pre_bnfs absT_infos fp_nesting_bnfs |
57397 | 1976 |
live_nesting_bnfs fp_res ctrXs_Tsss ctr_defss ctr_sugars recs rec_defs mapss [induct_thm] |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
1977 |
(map single induct_thms) rec_thmss (replicate nn []) (replicate nn []) rel_injectss |
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
1978 |
rel_distinctss |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1979 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1980 |
|
55867 | 1981 |
fun derive_note_coinduct_corecs_thms_for_types |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
1982 |
((((mapss, rel_injectss, rel_distinctss, setss), (_, _, ctr_defss, ctr_sugars)), |
55867 | 1983 |
(corecs, corec_defs)), lthy) = |
49212 | 1984 |
let |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1985 |
val (([(coinduct_thms, coinduct_thm), (coinduct_strong_thms, coinduct_strong_thm)], |
57260
8747af0d1012
fixed postprocessing of 'coinduct' formula to obtain right property format (without needless hypotheses)
blanchet
parents:
57206
diff
changeset
|
1986 |
(coinduct_attrs, common_coinduct_attrs)), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1987 |
corec_thmss, corec_disc_thmss, |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
1988 |
(corec_disc_iff_thmss, corec_disc_iff_attrs), (corec_sel_thmsss, corec_sel_attrs)) = |
55867 | 1989 |
derive_coinduct_corecs_thms_for_types pre_bnfs (the corecs_args_types) xtor_co_induct |
57397 | 1990 |
dtor_injects dtor_ctors xtor_co_rec_thms live_nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss mss |
1991 |
ns abs_inverses abs_inverses I ctr_defss ctr_sugars corecs corec_defs |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1992 |
(Proof_Context.export lthy' no_defs_lthy) lthy; |
49212 | 1993 |
|
57489 | 1994 |
fun distinct_prems ctxt th = |
57890
1e13f63fb452
use Goal.prove_sorry instead of Goal.prove where possible (= no schematics in goal and tactic is expected to succeed)
traytel
parents:
57882
diff
changeset
|
1995 |
Goal.prove (*no sorry*) ctxt [] [] |
57489 | 1996 |
(th |> Thm.prop_of |> Logic.strip_horn |>> distinct (op aconv) |> Logic.list_implies) |
1997 |
(fn _ => HEADGOAL (cut_tac th THEN' atac) THEN ALLGOALS eq_assume_tac); |
|
1998 |
||
1999 |
fun eq_ifIN _ [thm] = thm |
|
2000 |
| eq_ifIN ctxt (thm :: thms) = |
|
2001 |
distinct_prems ctxt (@{thm eq_ifI} OF |
|
2002 |
(map (unfold_thms ctxt @{thms atomize_imp[of _ "t = u" for t u]}) |
|
2003 |
[thm, eq_ifIN ctxt thms])); |
|
2004 |
||
57890
1e13f63fb452
use Goal.prove_sorry instead of Goal.prove where possible (= no schematics in goal and tactic is expected to succeed)
traytel
parents:
57882
diff
changeset
|
2005 |
val corec_code_thms = map (eq_ifIN lthy) corec_thmss; |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2006 |
val corec_sel_thmss = map flat corec_sel_thmsss; |
53475 | 2007 |
|
51830 | 2008 |
val coinduct_type_attr = Attrib.internal o K o Induct.coinduct_type; |
57302 | 2009 |
val coinduct_pred_attr = Attrib.internal o K o Induct.coinduct_pred; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
2010 |
|
55867 | 2011 |
val flat_corec_thms = append oo append; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
2012 |
|
57471 | 2013 |
val ((rel_coinduct_thmss, common_rel_coinduct_thms), |
2014 |
(rel_coinduct_attrs, common_rel_coinduct_attrs)) = |
|
2015 |
if live = 0 then |
|
2016 |
((replicate nn [], []), ([], [])) |
|
2017 |
else |
|
2018 |
let |
|
2019 |
val ((rel_coinduct_thms, common_rel_coinduct_thm), |
|
2020 |
(rel_coinduct_attrs, common_rel_coinduct_attrs)) = |
|
2021 |
derive_rel_coinduct_thm_for_types lthy fpTs ns As Bs mss ctr_sugars abs_inverses |
|
2022 |
abs_injects ctor_injects dtor_ctors pre_rel_defs ctr_defss rel_xtor_co_induct_thm |
|
2023 |
(map rel_eq_of_bnf live_nesting_bnfs) |
|
2024 |
in |
|
2025 |
((map single rel_coinduct_thms, single common_rel_coinduct_thm), |
|
2026 |
(rel_coinduct_attrs, common_rel_coinduct_attrs)) |
|
2027 |
end; |
|
2028 |
||
57700 | 2029 |
val (set_induct_thms, set_induct_attrss) = |
2030 |
derive_set_induct_thms_for_types lthy nn fpTs (map #ctrs ctr_sugars) |
|
2031 |
(map (map (mk_set As)) (map sets_of_bnf fp_bnfs)) dtor_set_induct_thms |
|
2032 |
(map #exhaust ctr_sugars) (flat pre_set_defss) (flat ctr_defss) |
|
2033 |
dtor_ctors abs_inverses |
|
2034 |
|> split_list; |
|
2035 |
||
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
2036 |
val simp_thmss = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
2037 |
map6 mk_simp_thms ctr_sugars |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2038 |
(map3 flat_corec_thms corec_disc_thmss corec_disc_iff_thmss corec_sel_thmss) |
56648
2ffa440b3074
manual merge + added 'rel_distincts' field to record for symmetry
blanchet
parents:
56641
diff
changeset
|
2039 |
mapss rel_injectss rel_distinctss setss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
2040 |
|
49342 | 2041 |
val common_notes = |
57700 | 2042 |
(set_inductN, set_induct_thms, nth set_induct_attrss) :: |
57302 | 2043 |
(if nn > 1 then |
57700 | 2044 |
[(coinductN, [coinduct_thm], K common_coinduct_attrs), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2045 |
(coinduct_strongN, [coinduct_strong_thm], K common_coinduct_attrs), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2046 |
(rel_coinductN, common_rel_coinduct_thms, K common_rel_coinduct_attrs)] |
57700 | 2047 |
else []) |
51780 | 2048 |
|> massage_simple_notes fp_common_name; |
49342 | 2049 |
|
49212 | 2050 |
val notes = |
51780 | 2051 |
[(coinductN, map single coinduct_thms, |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
2052 |
fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2053 |
(coinduct_strongN, map single coinduct_strong_thms, K coinduct_attrs), |
57489 | 2054 |
(corecN, corec_thmss, K []), |
2055 |
(corec_codeN, map single corec_code_thms, K code_nitpicksimp_attrs), |
|
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2056 |
(corec_discN, corec_disc_thmss, K []), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2057 |
(corec_disc_iffN, corec_disc_iff_thmss, K corec_disc_iff_attrs), |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2058 |
(corec_selN, corec_sel_thmss, K corec_sel_attrs), |
57471 | 2059 |
(rel_coinductN, rel_coinduct_thmss, K (rel_coinduct_attrs @ [coinduct_pred_attr ""])), |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2060 |
(simpsN, simp_thmss, K [])] |
51780 | 2061 |
|> massage_multi_notes; |
49212 | 2062 |
in |
51824 | 2063 |
lthy |
55867 | 2064 |
|> fold (curry (Spec_Rules.add Spec_Rules.Equational) corecs) |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2065 |
[flat corec_sel_thmss, flat corec_thmss] |
57631
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
2066 |
|> Local_Theory.notes (common_notes @ notes) |
959caab43a3d
use the noted theorem whenever possible, also in 'BNF_Def'
blanchet
parents:
57568
diff
changeset
|
2067 |
|-> register_as_fp_sugars fpTs fpBTs Xs Greatest_FP pre_bnfs absT_infos fp_nesting_bnfs |
57397 | 2068 |
live_nesting_bnfs fp_res ctrXs_Tsss ctr_defss ctr_sugars corecs corec_defs mapss |
57983
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2069 |
[coinduct_thm, coinduct_strong_thm] (transpose [coinduct_thms, coinduct_strong_thms]) |
6edc3529bb4e
reordered some (co)datatype property names for more consistency
blanchet
parents:
57932
diff
changeset
|
2070 |
corec_thmss corec_disc_thmss corec_sel_thmsss rel_injectss rel_distinctss |
49212 | 2071 |
end; |
2072 |
||
52367 | 2073 |
val lthy'' = lthy' |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
2074 |
|> fold_map define_ctrs_dtrs_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ ctors ~~ dtors ~~ |
55867 | 2075 |
xtor_co_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~ pre_set_defss ~~ |
2076 |
pre_rel_defs ~~ xtor_map_thms ~~ xtor_set_thmss ~~ xtor_rel_thms ~~ ns ~~ kss ~~ mss ~~ |
|
2077 |
abss ~~ abs_injects ~~ abs_inverses ~~ type_definitions ~~ ctr_bindingss ~~ ctr_mixfixess ~~ |
|
57200
aab87ffa60cc
use 'where' clause for selector default value syntax
blanchet
parents:
57199
diff
changeset
|
2078 |
ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ raw_sel_default_eqss) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
2079 |
|> wrap_types_etc |
55966 | 2080 |
|> case_fp fp derive_note_induct_recs_thms_for_types |
55867 | 2081 |
derive_note_coinduct_corecs_thms_for_types; |
49167 | 2082 |
|
2083 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
52899 | 2084 |
co_prefix fp ^ "datatype")); |
49112 | 2085 |
in |
52367 | 2086 |
timer; lthy'' |
49112 | 2087 |
end; |
2088 |
||
53974 | 2089 |
fun co_datatypes x = define_co_datatypes (K I) (K I) (K I) x; |
49297 | 2090 |
|
53974 | 2091 |
fun co_datatype_cmd x = |
2092 |
define_co_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term x; |
|
49119 | 2093 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
2094 |
val parse_ctr_arg = |
57205 | 2095 |
@{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} |
2096 |
|| Parse.typ >> pair Binding.empty; |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
2097 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
2098 |
val parse_ctr_specs = |
57091 | 2099 |
Parse.enum1 "|" (parse_ctr_spec Parse.binding parse_ctr_arg -- Parse.opt_mixfix); |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
2100 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
2101 |
val parse_spec = |
57206
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
2102 |
parse_type_args_named_constrained -- Parse.binding -- Parse.opt_mixfix -- |
d9be905d6283
changed syntax of map: and rel: arguments to BNF-based datatypes
blanchet
parents:
57205
diff
changeset
|
2103 |
(@{keyword "="} |-- parse_ctr_specs) -- parse_map_rel_bindings -- parse_sel_default_eqs; |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
2104 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
2105 |
val parse_co_datatype = parse_ctr_options -- Parse.and_list1 parse_spec; |
49278 | 2106 |
|
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
2107 |
fun parse_co_datatype_cmd fp construct_fp = parse_co_datatype >> co_datatype_cmd fp construct_fp; |
49112 | 2108 |
|
56522
f54003750e7d
don't forget to init Interpretation and transfer theorems in the interpretation hook
kuncar
parents:
56521
diff
changeset
|
2109 |
val _ = Context.>> (Context.map_theory FP_Sugar_Interpretation.init); |
f54003750e7d
don't forget to init Interpretation and transfer theorems in the interpretation hook
kuncar
parents:
56521
diff
changeset
|
2110 |
|
49112 | 2111 |
end; |