author | blanchet |
Wed, 23 Apr 2014 10:23:26 +0200 | |
changeset 56640 | 0a35354137a5 |
parent 56638 | 092a306bcc3d |
child 56641 | 029997d3b5d8 |
permissions | -rw-r--r-- |
55061 | 1 |
(* Title: HOL/Tools/BNF/bnf_fp_def_sugar.ML |
49112 | 2 |
Author: Jasmin Blanchette, TU Muenchen |
52349 | 3 |
Copyright 2012, 2013 |
49112 | 4 |
|
49389 | 5 |
Sugared datatype and codatatype constructions. |
49112 | 6 |
*) |
7 |
||
49636 | 8 |
signature BNF_FP_DEF_SUGAR = |
49112 | 9 |
sig |
51840 | 10 |
type fp_sugar = |
51859 | 11 |
{T: typ, |
56638 | 12 |
BT: typ, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
13 |
X: typ, |
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
14 |
fp: BNF_Util.fp_kind, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
15 |
fp_res_index: int, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
16 |
fp_res: BNF_FP_Util.fp_result, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
17 |
pre_bnf: BNF_Def.bnf, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
18 |
absT_info: BNF_Comp.absT_info, |
52356 | 19 |
nested_bnfs: BNF_Def.bnf list, |
53267
aad7d276b849
store nesting_bnfs in fp_sugar (required in "nested to mutual" reduction)
traytel
parents:
53266
diff
changeset
|
20 |
nesting_bnfs: BNF_Def.bnf list, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
21 |
ctrXs_Tss: typ list list, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
22 |
ctr_defs: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
23 |
ctr_sugar: Ctr_Sugar.ctr_sugar, |
55863 | 24 |
co_rec: term, |
56640
0a35354137a5
generate 'rec_o_map' and 'size_o_map' in size extension
blanchet
parents:
56638
diff
changeset
|
25 |
co_rec_def: thm, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
26 |
maps: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
27 |
common_co_inducts: thm list, |
52343 | 28 |
co_inducts: thm list, |
55863 | 29 |
co_rec_thms: thm list, |
30 |
disc_co_recs: thm list, |
|
56521 | 31 |
sel_co_recss: thm list list, |
32 |
rel_injects: thm list}; |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
33 |
|
51896 | 34 |
val morph_fp_sugar: morphism -> fp_sugar -> fp_sugar |
54256 | 35 |
val transfer_fp_sugar: Proof.context -> fp_sugar -> fp_sugar |
51896 | 36 |
val fp_sugar_of: Proof.context -> string -> fp_sugar option |
53907 | 37 |
val fp_sugars_of: Proof.context -> fp_sugar list |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
38 |
val fp_sugar_interpretation: (fp_sugar list -> theory -> theory) -> theory -> theory |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
39 |
val register_fp_sugars: fp_sugar list -> local_theory -> local_theory |
51852 | 40 |
|
53106 | 41 |
val co_induct_of: 'a list -> 'a |
42 |
val strong_co_induct_of: 'a list -> 'a |
|
43 |
||
52868 | 44 |
val flat_corec_preds_predsss_gettersss: 'a list -> 'a list list list -> 'a list list list -> |
45 |
'a list |
|
51907 | 46 |
val nesty_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
|
47 |
|
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
48 |
type lfp_sugar_thms = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
49 |
(thm list * thm * Args.src list) * (thm list list * Args.src list) |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
50 |
|
54256 | 51 |
val morph_lfp_sugar_thms: morphism -> lfp_sugar_thms -> lfp_sugar_thms |
52 |
val transfer_lfp_sugar_thms: Proof.context -> lfp_sugar_thms -> lfp_sugar_thms |
|
53 |
||
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
54 |
type gfp_sugar_thms = |
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
55 |
((thm list * thm) list * Args.src list) |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
56 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
57 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
58 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
59 |
* (thm list list list * Args.src list) |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
60 |
|
54256 | 61 |
val morph_gfp_sugar_thms: morphism -> gfp_sugar_thms -> gfp_sugar_thms |
62 |
val transfer_gfp_sugar_thms: Proof.context -> gfp_sugar_thms -> gfp_sugar_thms |
|
63 |
||
55867 | 64 |
val mk_co_recs_prelims: BNF_Util.fp_kind -> typ list list list -> typ list -> typ list -> |
65 |
typ list -> typ list -> int list -> int list list -> term list -> Proof.context -> |
|
66 |
(term list |
|
67 |
* (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
|
68 |
* (string * term list * term list list |
55867 | 69 |
* ((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
|
70 |
* Proof.context |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
71 |
val repair_nullary_single_ctr: typ list list -> typ list list |
55867 | 72 |
val mk_corec_p_pred_types: typ list -> int list -> typ list list |
73 |
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
|
74 |
int list list -> term -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
75 |
typ list list |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
76 |
* (typ list list list list * typ list list list * typ list list list list * typ list) |
55867 | 77 |
val define_rec: |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
78 |
(typ list list * typ list list list list * term list list * term list list list list) option -> |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
79 |
(string -> binding) -> typ list -> typ list -> term list -> term -> Proof.context -> |
55864 | 80 |
(term * thm) * Proof.context |
55867 | 81 |
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
|
82 |
* ((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
|
83 |
typ list -> term list -> term -> local_theory -> (term * thm) * local_theory |
55867 | 84 |
val derive_induct_recs_thms_for_types: BNF_Def.bnf list -> |
85 |
('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
|
86 |
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
|
87 |
typ list list list -> thm list -> thm list -> thm list -> term list list -> thm list list -> |
55864 | 88 |
term list -> thm list -> Proof.context -> lfp_sugar_thms |
55867 | 89 |
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
|
90 |
string * term list * term list list * ((term list list * term list list list) * typ list) -> |
55867 | 91 |
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
|
92 |
typ list -> typ list list list -> int list list -> int list list -> int list -> thm list -> |
55864 | 93 |
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
|
94 |
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
|
95 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
96 |
type co_datatype_spec = |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
97 |
((((binding option * (typ * sort)) list * binding) * (binding * binding)) * mixfix) |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
98 |
* ((binding, binding * typ, term) Ctr_Sugar.ctr_spec * mixfix) list |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
99 |
|
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
100 |
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
|
101 |
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
|
102 |
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
|
103 |
BNF_FP_Util.fp_result * local_theory) -> |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
104 |
(bool * bool) * co_datatype_spec list -> |
49297 | 105 |
local_theory -> local_theory |
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
106 |
val parse_co_datatype_cmd: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list -> |
51867 | 107 |
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
|
108 |
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
|
109 |
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
|
110 |
(local_theory -> local_theory) parser |
49112 | 111 |
end; |
112 |
||
49636 | 113 |
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = |
49112 | 114 |
struct |
115 |
||
54006 | 116 |
open Ctr_Sugar |
55571 | 117 |
open BNF_FP_Rec_Sugar_Util |
49119 | 118 |
open BNF_Util |
53222 | 119 |
open BNF_Comp |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
120 |
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
|
121 |
open BNF_FP_Util |
49636 | 122 |
open BNF_FP_Def_Sugar_Tactics |
49119 | 123 |
|
51788 | 124 |
val EqN = "Eq_"; |
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset
|
125 |
|
51840 | 126 |
type fp_sugar = |
51859 | 127 |
{T: typ, |
56638 | 128 |
BT: typ, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
129 |
X: typ, |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
130 |
fp: fp_kind, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
131 |
fp_res_index: int, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
132 |
fp_res: fp_result, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
133 |
pre_bnf: bnf, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
134 |
absT_info: absT_info, |
52356 | 135 |
nested_bnfs: bnf list, |
53267
aad7d276b849
store nesting_bnfs in fp_sugar (required in "nested to mutual" reduction)
traytel
parents:
53266
diff
changeset
|
136 |
nesting_bnfs: bnf list, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
137 |
ctrXs_Tss: typ list list, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
138 |
ctr_defs: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
139 |
ctr_sugar: Ctr_Sugar.ctr_sugar, |
55863 | 140 |
co_rec: term, |
56640
0a35354137a5
generate 'rec_o_map' and 'size_o_map' in size extension
blanchet
parents:
56638
diff
changeset
|
141 |
co_rec_def: thm, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
142 |
maps: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
143 |
common_co_inducts: thm list, |
52343 | 144 |
co_inducts: thm list, |
55863 | 145 |
co_rec_thms: thm list, |
146 |
disc_co_recs: thm list, |
|
56521 | 147 |
sel_co_recss: thm list list, |
148 |
rel_injects: thm list}; |
|
52295 | 149 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
150 |
fun morph_fp_sugar phi ({T, X, fp, fp_res, fp_res_index, pre_bnf, absT_info, nested_bnfs, |
55863 | 151 |
nesting_bnfs, ctrXs_Tss, ctr_defs, ctr_sugar, co_rec, maps, common_co_inducts, co_inducts, |
56521 | 152 |
co_rec_thms, disc_co_recs, sel_co_recss, rel_injects} : fp_sugar) = |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
153 |
{T = Morphism.typ phi T, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
154 |
X = Morphism.typ phi X, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
155 |
fp = fp, |
53267
aad7d276b849
store nesting_bnfs in fp_sugar (required in "nested to mutual" reduction)
traytel
parents:
53266
diff
changeset
|
156 |
fp_res = morph_fp_result phi fp_res, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
157 |
fp_res_index = fp_res_index, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
158 |
pre_bnf = morph_bnf phi pre_bnf, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
159 |
absT_info = morph_absT_info phi absT_info, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
160 |
nested_bnfs = map (morph_bnf phi) nested_bnfs, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
161 |
nesting_bnfs = map (morph_bnf phi) nesting_bnfs, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
162 |
ctrXs_Tss = map (map (Morphism.typ phi)) ctrXs_Tss, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
163 |
ctr_defs = map (Morphism.thm phi) ctr_defs, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
164 |
ctr_sugar = morph_ctr_sugar phi ctr_sugar, |
55863 | 165 |
co_rec = Morphism.term phi co_rec, |
56640
0a35354137a5
generate 'rec_o_map' and 'size_o_map' in size extension
blanchet
parents:
56638
diff
changeset
|
166 |
co_rec_def = Morphism.thm phi co_rec_def, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
167 |
maps = map (Morphism.thm phi) maps, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
168 |
common_co_inducts = map (Morphism.thm phi) common_co_inducts, |
52343 | 169 |
co_inducts = map (Morphism.thm phi) co_inducts, |
55863 | 170 |
co_rec_thms = map (Morphism.thm phi) co_rec_thms, |
171 |
disc_co_recs = map (Morphism.thm phi) disc_co_recs, |
|
56521 | 172 |
sel_co_recss = map (map (Morphism.thm phi)) sel_co_recss, |
173 |
rel_injects = map (Morphism.thm phi) rel_injects}; |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
174 |
|
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
175 |
val transfer_fp_sugar = morph_fp_sugar o Morphism.transfer_morphism o Proof_Context.theory_of; |
53907 | 176 |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
177 |
structure Data = Generic_Data |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
178 |
( |
51840 | 179 |
type T = fp_sugar Symtab.table; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
180 |
val empty = Symtab.empty; |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
181 |
val extend = I; |
55394
d5ebe055b599
more liberal merging of BNFs and constructor sugar
blanchet
parents:
55356
diff
changeset
|
182 |
fun merge data : T = Symtab.merge (K true) data; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
183 |
); |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
184 |
|
53126
f4d2c64c7aa8
transfer stored fp_sugar theorems into the "current" theory when retrieving an fp_sugar (avoids non-trivial merges)
traytel
parents:
53106
diff
changeset
|
185 |
fun fp_sugar_of ctxt = |
f4d2c64c7aa8
transfer stored fp_sugar theorems into the "current" theory when retrieving an fp_sugar (avoids non-trivial merges)
traytel
parents:
53106
diff
changeset
|
186 |
Symtab.lookup (Data.get (Context.Proof ctxt)) |
53907 | 187 |
#> Option.map (transfer_fp_sugar ctxt); |
188 |
||
189 |
fun fp_sugars_of ctxt = |
|
190 |
Symtab.fold (cons o transfer_fp_sugar ctxt o snd) (Data.get (Context.Proof ctxt)) []; |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
191 |
|
53106 | 192 |
fun co_induct_of (i :: _) = i; |
193 |
fun strong_co_induct_of [_, s] = s; |
|
194 |
||
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
195 |
structure FP_Sugar_Interpretation = Interpretation |
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
196 |
( |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
197 |
type T = fp_sugar list; |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
198 |
val eq: T * T -> bool = op = o pairself (map #T); |
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
199 |
); |
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
200 |
|
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
201 |
fun with_repaired_path f (fp_sugars : fp_sugar list) 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
|
202 |
thy |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
203 |
(* FIXME: |> Sign.root_path*) |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
204 |
|> Sign.add_path (Long_Name.qualifier (mk_common_name (map (fst o dest_Type o #T) fp_sugars))) |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
205 |
|> f fp_sugars |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
206 |
|> 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
|
207 |
|
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
|
208 |
val fp_sugar_interpretation = FP_Sugar_Interpretation.interpretation o with_repaired_path; |
56347
6edbd4d20717
added new-style (co)datatype interpretation hook
blanchet
parents:
56254
diff
changeset
|
209 |
|
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
210 |
fun register_fp_sugars fp_sugars = |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
211 |
fold (fn fp_sugar as {T as Type (s, _), ...} => |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
212 |
Local_Theory.declaration {syntax = false, pervasive = true} |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
213 |
(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
|
214 |
fp_sugars |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
215 |
#> Local_Theory.background_theory (FP_Sugar_Interpretation.data fp_sugars); |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
216 |
|
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
217 |
fun register_as_fp_sugars Xs fp pre_bnfs absT_infos nested_bnfs nesting_bnfs (fp_res as {Ts, ...}) |
55863 | 218 |
ctrXs_Tsss ctr_defss ctr_sugars co_recs mapss common_co_inducts co_inductss co_rec_thmss |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
219 |
disc_co_recss sel_co_recsss = |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
220 |
let |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
221 |
val fp_sugars = |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
222 |
map_index (fn (kk, T) => |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
223 |
{T = T, X = nth Xs kk, fp = fp, fp_res = fp_res, fp_res_index = kk, |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
224 |
pre_bnf = nth pre_bnfs kk, absT_info = nth absT_infos kk, nested_bnfs = nested_bnfs, |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
225 |
nesting_bnfs = nesting_bnfs, ctrXs_Tss = nth ctrXs_Tsss kk, ctr_defs = nth ctr_defss kk, |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
226 |
ctr_sugar = nth ctr_sugars kk, co_rec = nth co_recs kk, maps = nth mapss kk, |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
227 |
common_co_inducts = common_co_inducts, co_inducts = nth co_inductss kk, |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
228 |
co_rec_thms = nth co_rec_thmss kk, disc_co_recs = nth disc_co_recss kk, |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
229 |
sel_co_recss = nth sel_co_recsss kk}) Ts |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
230 |
in |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
231 |
register_fp_sugars fp_sugars |
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
232 |
end; |
51824 | 233 |
|
55342 | 234 |
(* This function could produce (fairly harmless) clashes in contrived examples (e.g., "x.A", |
235 |
"x.x_A", "y.A"). *) |
|
49622 | 236 |
fun quasi_unambiguous_case_names names = |
237 |
let |
|
238 |
val ps = map (`Long_Name.base_name) names; |
|
239 |
val dups = Library.duplicates (op =) (map fst ps); |
|
240 |
fun underscore s = |
|
241 |
let val ss = space_explode Long_Name.separator s in |
|
242 |
space_implode "_" (drop (length ss - 2) ss) |
|
243 |
end; |
|
244 |
in |
|
245 |
map (fn (base, full) => if member (op =) dups base then underscore full else base) ps |
|
246 |
end; |
|
247 |
||
52355 | 248 |
val id_def = @{thm id_def}; |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
249 |
val mp_conj = @{thm mp_conj}; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
250 |
|
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
251 |
val fundefcong_attrs = @{attributes [fundef_cong]}; |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
252 |
val nitpicksimp_attrs = @{attributes [nitpick_simp]}; |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
253 |
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs; |
49300 | 254 |
val simp_attrs = @{attributes [simp]}; |
255 |
||
49297 | 256 |
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
|
257 |
|
55871 | 258 |
fun flat_corec_predss_getterss qss gss = maps (op @) (qss ~~ gss); |
51829 | 259 |
|
55871 | 260 |
fun flat_corec_preds_predsss_gettersss [] [qss] [gss] = flat_corec_predss_getterss qss gss |
261 |
| flat_corec_preds_predsss_gettersss (p :: ps) (qss :: qsss) (gss :: gsss) = |
|
262 |
p :: flat_corec_predss_getterss qss gss @ flat_corec_preds_predsss_gettersss ps qsss gsss; |
|
51829 | 263 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
264 |
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
265 |
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
|
266 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
267 |
fun flip_rels lthy n thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
268 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
269 |
val Rs = Term.add_vars (prop_of thm) []; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
270 |
val Rs' = rev (drop (length Rs - n) Rs); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
271 |
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
|
272 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
273 |
Drule.cterm_instantiate cRs thm |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
274 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
275 |
|
49536 | 276 |
fun mk_ctor_or_dtor get_T Ts t = |
277 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
278 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
|
279 |
end; |
|
280 |
||
281 |
val mk_ctor = mk_ctor_or_dtor range_type; |
|
282 |
val mk_dtor = mk_ctor_or_dtor domain_type; |
|
283 |
||
55867 | 284 |
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
|
285 |
let |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
286 |
val nn = length fpTs; |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
287 |
val (fpTs0, Cs0) = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
288 |
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
|
289 |
|> split_list; |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
290 |
val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs); |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
291 |
in |
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
292 |
map (Term.subst_TVars rho) ts0 |
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
293 |
end; |
51827 | 294 |
|
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
295 |
fun unzip_recT (Type (@{type_name prod}, _)) T = [T] |
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
296 |
| unzip_recT _ (Type (@{type_name prod}, Ts)) = Ts |
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
297 |
| unzip_recT _ T = [T]; |
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
298 |
|
53591 | 299 |
fun unzip_corecT (Type (@{type_name sum}, _)) T = [T] |
53901 | 300 |
| unzip_corecT _ (Type (@{type_name sum}, Ts)) = Ts |
52871 | 301 |
| unzip_corecT _ T = [T]; |
302 |
||
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
303 |
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
|
304 |
(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
|
305 |
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
|
306 |
| _ => replicate n false); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
307 |
|
55700 | 308 |
fun cannot_merge_types fp = |
309 |
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
|
310 |
|
55700 | 311 |
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
|
312 |
|
55700 | 313 |
fun merge_type_args fp (As, As') = |
314 |
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
|
315 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
316 |
fun reassoc_conjs thm = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
317 |
reassoc_conjs (thm RS @{thm conj_assoc[THEN iffD1]}) |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
318 |
handle THM _ => thm; |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
319 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
320 |
type co_datatype_spec = |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
321 |
((((binding option * (typ * sort)) list * binding) * (binding * binding)) * mixfix) |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
322 |
* ((binding, binding * typ, term) ctr_spec * mixfix) list; |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
323 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
324 |
fun type_args_named_constrained_of_spec ((((ncAs, _), _), _), _) = ncAs; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
325 |
fun type_binding_of_spec ((((_, b), _), _), _) = b; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
326 |
fun map_binding_of_spec (((_, (b, _)), _), _) = b; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
327 |
fun rel_binding_of_spec (((_, (_, b)), _), _) = b; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
328 |
fun mixfix_of_spec ((_, mx), _) = mx; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
329 |
fun mixfixed_ctr_specs_of_spec (_, mx_ctr_specs) = mx_ctr_specs; |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
330 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
331 |
fun add_nesty_bnf_names Us = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
332 |
let |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
333 |
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
|
334 |
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
|
335 |
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
|
336 |
end |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
337 |
| 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
|
338 |
in snd oo add end; |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
339 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
340 |
fun nesty_bnfs ctxt ctr_Tsss Us = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
341 |
map_filter (bnf_of ctxt) (fold (fold (fold (add_nesty_bnf_names Us))) ctr_Tsss []); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
342 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
343 |
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
|
344 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
345 |
type lfp_sugar_thms = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
346 |
(thm list * thm * Args.src list) * (thm list list * Args.src list); |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
347 |
|
55867 | 348 |
fun morph_lfp_sugar_thms phi ((inducts, induct, induct_attrs), (recss, rec_attrs)) = |
54256 | 349 |
((map (Morphism.thm phi) inducts, Morphism.thm phi induct, induct_attrs), |
55867 | 350 |
(map (map (Morphism.thm phi)) recss, rec_attrs)) |
55095 | 351 |
: lfp_sugar_thms; |
54256 | 352 |
|
353 |
val transfer_lfp_sugar_thms = |
|
54740 | 354 |
morph_lfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of; |
54256 | 355 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
356 |
type gfp_sugar_thms = |
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
357 |
((thm list * thm) list * Args.src list) |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
358 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
359 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
360 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
361 |
* (thm list list list * Args.src list); |
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
362 |
|
54256 | 363 |
fun morph_gfp_sugar_thms phi ((coinducts_pairs, coinduct_attrs), |
55871 | 364 |
(corecss, corec_attrs), (disc_corecss, disc_corec_attrs), |
365 |
(disc_corec_iffss, disc_corec_iff_attrs), (sel_corecsss, sel_corec_attrs)) = |
|
54256 | 366 |
((map (apfst (map (Morphism.thm phi)) o apsnd (Morphism.thm phi)) coinducts_pairs, |
367 |
coinduct_attrs), |
|
55867 | 368 |
(map (map (Morphism.thm phi)) corecss, corec_attrs), |
55871 | 369 |
(map (map (Morphism.thm phi)) disc_corecss, disc_corec_attrs), |
370 |
(map (map (Morphism.thm phi)) disc_corec_iffss, disc_corec_iff_attrs), |
|
371 |
(map (map (map (Morphism.thm phi))) sel_corecsss, sel_corec_attrs)) : gfp_sugar_thms; |
|
54256 | 372 |
|
373 |
val transfer_gfp_sugar_thms = |
|
54740 | 374 |
morph_gfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of; |
54256 | 375 |
|
55867 | 376 |
fun mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss ctor_rec_fun_Ts lthy = |
51832 | 377 |
let |
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
378 |
val Css = map2 replicate ns Cs; |
55869 | 379 |
val x_Tssss = |
55867 | 380 |
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
|
381 |
map2 (map2 unzip_recT) |
55867 | 382 |
ctr_Tss (dest_absumprodT absT repT n ms (domain_type ctor_rec_fun_T))) |
383 |
absTs repTs ns mss ctr_Tsss ctor_rec_fun_Ts; |
|
51832 | 384 |
|
55869 | 385 |
val x_Tsss' = map (map flat_rec_arg_args) x_Tssss; |
386 |
val f_Tss = map2 (map2 (curry (op --->))) x_Tsss' Css; |
|
51832 | 387 |
|
55869 | 388 |
val ((fss, xssss), lthy) = |
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
389 |
lthy |
55869 | 390 |
|> mk_Freess "f" f_Tss |
391 |
||>> mk_Freessss "x" x_Tssss; |
|
51832 | 392 |
in |
55869 | 393 |
((f_Tss, x_Tssss, fss, xssss), lthy) |
51832 | 394 |
end; |
395 |
||
55867 | 396 |
(*avoid "'a itself" arguments in corecursors*) |
55966 | 397 |
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
|
398 |
| 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
|
399 |
|
55867 | 400 |
fun mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss fun_Ts = |
51829 | 401 |
let |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
402 |
val ctr_Tsss' = map repair_nullary_single_ctr ctr_Tsss; |
55869 | 403 |
val g_absTs = map range_type fun_Ts; |
404 |
val g_Tsss = map repair_nullary_single_ctr (map5 dest_absumprodT absTs repTs ns mss g_absTs); |
|
405 |
val g_Tssss = map3 (fn C => map2 (map2 (map (curry (op -->) C) oo unzip_corecT))) |
|
406 |
Cs ctr_Tsss' g_Tsss; |
|
407 |
val q_Tssss = map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) g_Tssss; |
|
52870 | 408 |
in |
55869 | 409 |
(q_Tssss, g_Tsss, g_Tssss, g_absTs) |
52870 | 410 |
end; |
51829 | 411 |
|
55867 | 412 |
fun mk_corec_p_pred_types Cs ns = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs; |
52898 | 413 |
|
55867 | 414 |
fun mk_corec_fun_arg_types ctr_Tsss Cs absTs repTs ns mss dtor_corec = |
415 |
(mk_corec_p_pred_types Cs ns, |
|
416 |
mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss |
|
417 |
(binder_fun_types (fastype_of dtor_corec))); |
|
51829 | 418 |
|
55867 | 419 |
fun mk_corecs_args_types ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts lthy = |
420 |
let |
|
421 |
val p_Tss = mk_corec_p_pred_types Cs ns; |
|
51829 | 422 |
|
55869 | 423 |
val (q_Tssss, g_Tsss, g_Tssss, corec_types) = |
55867 | 424 |
mk_corec_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss dtor_corec_fun_Ts; |
51831 | 425 |
|
55869 | 426 |
val (((((Free (x, _), cs), pss), qssss), gssss), lthy) = |
51829 | 427 |
lthy |
55869 | 428 |
|> 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
|
429 |
||>> mk_Frees "a" Cs |
51829 | 430 |
||>> mk_Freess "p" p_Tss |
55869 | 431 |
||>> mk_Freessss "q" q_Tssss |
432 |
||>> mk_Freessss "g" g_Tssss; |
|
51831 | 433 |
|
434 |
val cpss = map2 (map o rapp) cs pss; |
|
51829 | 435 |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
436 |
fun build_sum_inj mk_inj = build_map lthy (uncurry mk_inj o dest_sumT o snd); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
437 |
|
55871 | 438 |
fun build_dtor_corec_arg _ [] [cg] = cg |
439 |
| build_dtor_corec_arg T [cq] [cg, cg'] = |
|
440 |
mk_If cq (build_sum_inj Inl_const (fastype_of cg, T) $ cg) |
|
441 |
(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
|
442 |
|
55869 | 443 |
val pgss = map3 flat_corec_preds_predsss_gettersss pss qssss gssss; |
444 |
val cqssss = map2 (map o map o map o rapp) cs qssss; |
|
445 |
val cgssss = map2 (map o map o map o rapp) cs gssss; |
|
446 |
val cqgsss = map3 (map3 (map3 build_dtor_corec_arg)) g_Tsss cqssss cgssss; |
|
51831 | 447 |
in |
55869 | 448 |
((x, cs, cpss, ((pgss, cqgsss), corec_types)), lthy) |
51831 | 449 |
end; |
51829 | 450 |
|
55867 | 451 |
fun mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy = |
51903 | 452 |
let |
52169 | 453 |
val thy = Proof_Context.theory_of lthy; |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
454 |
val nn = length fpTs; |
52169 | 455 |
|
55867 | 456 |
val (xtor_co_rec_fun_Ts, xtor_co_recs) = |
457 |
mk_xtor_co_recs thy fp fpTs Cs xtor_co_recs0 |> `(binder_fun_types o fastype_of o hd); |
|
51903 | 458 |
|
55867 | 459 |
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
|
460 |
if fp = Least_FP then |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
461 |
if nn = 1 andalso forall (forall (forall (not o exists_subtype_in fpTs))) ctr_Tsss then |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
462 |
((NONE, NONE), lthy) |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
463 |
else |
55867 | 464 |
mk_recs_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_rec_fun_Ts lthy |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
465 |
|>> (rpair NONE o SOME) |
51903 | 466 |
else |
55867 | 467 |
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
|
468 |
|>> (pair NONE o SOME); |
51903 | 469 |
in |
55867 | 470 |
((xtor_co_recs, recs_args_types, corecs_args_types), lthy') |
51903 | 471 |
end; |
472 |
||
55869 | 473 |
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
|
474 |
let |
55869 | 475 |
val n = length cqgss; |
476 |
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
|
477 |
in |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
478 |
Term.lambda c (mk_IfN absT cps ts) |
51900 | 479 |
end; |
51886 | 480 |
|
55867 | 481 |
fun define_co_rec fp fpT Cs b rhs lthy0 = |
51897 | 482 |
let |
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
483 |
val thy = Proof_Context.theory_of lthy0; |
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
484 |
|
53569
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
485 |
val maybe_conceal_def_binding = Thm.def_binding |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
486 |
#> Config.get lthy0 bnf_note_all = false ? Binding.conceal; |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
487 |
|
55864 | 488 |
val ((cst, (_, def)), (lthy', lthy)) = lthy0 |
489 |
|> Local_Theory.define ((b, NoSyn), ((maybe_conceal_def_binding b, []), rhs)) |
|
52327 | 490 |
||> `Local_Theory.restore; |
491 |
||
492 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
493 |
||
55869 | 494 |
val cst' = mk_co_rec thy fp fpT Cs (Morphism.term phi cst); |
55864 | 495 |
val def' = Morphism.thm phi def; |
52327 | 496 |
in |
55864 | 497 |
((cst', def'), lthy') |
52327 | 498 |
end; |
499 |
||
55867 | 500 |
fun define_rec NONE _ _ _ _ _ = pair (Term.dummy, refl) |
501 |
| define_rec (SOME (_, _, fss, xssss)) mk_binding fpTs Cs reps ctor_rec = |
|
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
502 |
let |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
503 |
val nn = length fpTs; |
55867 | 504 |
val (ctor_rec_absTs, fpT) = strip_typeN nn (fastype_of ctor_rec) |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
505 |
|>> map domain_type ||> domain_type; |
55864 | 506 |
in |
55867 | 507 |
define_co_rec Least_FP fpT Cs (mk_binding recN) |
508 |
(fold_rev (fold_rev Term.lambda) fss (Term.list_comb (ctor_rec, |
|
509 |
map4 (fn ctor_rec_absT => fn rep => fn fs => fn xsss => |
|
55968 | 510 |
mk_case_absumprod ctor_rec_absT rep fs (map (map HOLogic.mk_tuple) xsss) |
511 |
(map flat_rec_arg_args xsss)) |
|
55867 | 512 |
ctor_rec_absTs reps fss xssss))) |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
513 |
end; |
51897 | 514 |
|
55869 | 515 |
fun define_corec (_, cs, cpss, ((pgss, cqgsss), f_absTs)) mk_binding fpTs Cs abss dtor_corec = |
51897 | 516 |
let |
51899 | 517 |
val nn = length fpTs; |
55867 | 518 |
val fpT = range_type (snd (strip_typeN nn (fastype_of dtor_corec))); |
51897 | 519 |
in |
55867 | 520 |
define_co_rec Greatest_FP fpT Cs (mk_binding corecN) |
55869 | 521 |
(fold_rev (fold_rev Term.lambda) pgss (Term.list_comb (dtor_corec, |
522 |
map5 mk_preds_getterss_join cs cpss f_absTs abss cqgsss))) |
|
52320 | 523 |
end; |
51897 | 524 |
|
55867 | 525 |
fun derive_induct_recs_thms_for_types pre_bnfs rec_args_typess ctor_induct ctor_rec_thms |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
526 |
nesting_bnfs nested_bnfs fpTs Cs Xs ctrXs_Tsss fp_abs_inverses fp_type_definitions abs_inverses |
55864 | 527 |
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
|
528 |
let |
51827 | 529 |
val ctr_Tsss = map (map (binder_types o fastype_of)) ctrss; |
530 |
||
51815 | 531 |
val nn = length pre_bnfs; |
51827 | 532 |
val ns = map length ctr_Tsss; |
533 |
val mss = map (map length) ctr_Tsss; |
|
51815 | 534 |
|
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
535 |
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
|
536 |
val pre_set_defss = map set_defs_of_bnf pre_bnfs; |
53329 | 537 |
val nesting_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nesting_bnfs; |
538 |
val nested_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nested_bnfs; |
|
53290 | 539 |
val nested_set_maps = maps set_map_of_bnf nested_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
|
540 |
|
51816 | 541 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 542 |
|
51832 | 543 |
val ((((ps, ps'), xsss), us'), names_lthy) = |
52315
fafab8eac3ee
avoid duplicate call to "mk_fold_rec_args_types" function
blanchet
parents:
52314
diff
changeset
|
544 |
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
|
545 |
|> mk_Frees' "P" (map mk_pred1T fpTs) |
51827 | 546 |
||>> mk_Freesss "x" ctr_Tsss |
51816 | 547 |
||>> 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
|
548 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
549 |
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
|
550 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
551 |
fun mk_sets_nested bnf = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
552 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
553 |
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
|
554 |
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
|
555 |
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
|
556 |
fun mk_set U = |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
557 |
(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
|
558 |
~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
|
559 |
| 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
|
560 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
561 |
(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
|
562 |
end; |
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 setss_nested = map mk_sets_nested nested_bnfs; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
565 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
566 |
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
|
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 |
fun mk_set Ts t = |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
569 |
let val Type (_, Ts0) = domain_type (fastype_of t) in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
570 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
571 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
572 |
|
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
|
573 |
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
|
574 |
[([], (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
|
575 |
| mk_raw_prem_prems names_lthy (x as Free (s, Type (T_name, Ts0))) (Type (_, Xs_Ts0)) = |
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
|
576 |
(case AList.lookup (op =) setss_nested T_name of |
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
|
577 |
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
|
578 |
| 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
|
579 |
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
|
580 |
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
|
581 |
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
|
582 |
|> 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
|
583 |
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
|
584 |
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
|
585 |
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
|
586 |
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
|
587 |
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
|
588 |
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
|
589 |
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
|
590 |
| 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
|
591 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
592 |
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
|
593 |
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
|
594 |
(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
|
595 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
596 |
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
|
597 |
close_prem_prem xs (Logic.list_implies (map (fn (x', (y, set)) => |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
598 |
HOLogic.mk_Trueprop (HOLogic.mk_mem (y, set $ x'))) xysets, |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
599 |
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
|
600 |
|
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
|
601 |
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
|
602 |
let |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
603 |
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
|
604 |
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
|
605 |
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
|
606 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
607 |
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
|
608 |
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
|
609 |
|
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
|
610 |
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
|
611 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
612 |
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
|
613 |
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
|
614 |
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
|
615 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
616 |
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
|
617 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
618 |
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
|
619 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
620 |
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
|
621 |
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
|
622 |
mk_induct_tac ctxt nn ns mss kksss (flat ctr_defss) ctor_induct' fp_abs_inverses |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
623 |
abs_inverses nested_set_maps pre_set_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
|
624 |
|> singleton (Proof_Context.export names_lthy lthy) |
55409
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55397
diff
changeset
|
625 |
(* for "datatype_realizer.ML": *) |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55397
diff
changeset
|
626 |
|> Thm.name_derivation (fst (dest_Type (hd fpTs)) ^ Long_Name.separator ^ |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55397
diff
changeset
|
627 |
(if nn > 1 then space_implode "_" (tl fp_b_names) ^ Long_Name.separator else "") ^ |
b74248961819
made 'ctr_sugar' more friendly to the 'datatype_realizer'
blanchet
parents:
55397
diff
changeset
|
628 |
inductN); |
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 |
in |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
630 |
`(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
|
631 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
632 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
633 |
val induct_cases = quasi_unambiguous_case_names (maps (map name_of_ctr) ctrss); |
52305 | 634 |
val induct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names induct_cases)); |
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 |
|
52305 | 636 |
val xctrss = map2 (map2 (curry Term.list_comb)) ctrss xsss; |
637 |
||
55867 | 638 |
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
|
639 |
let |
55867 | 640 |
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
|
641 |
|
55871 | 642 |
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
|
643 |
fold_rev (fold_rev Logic.all) (xs :: fss) |
55867 | 644 |
(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
|
645 |
|
52302 | 646 |
fun maybe_tick (T, U) u f = |
647 |
if try (fst o HOLogic.dest_prodT) U = SOME T then |
|
648 |
Term.lambda u (HOLogic.mk_prod (u, f $ u)) |
|
649 |
else |
|
650 |
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
|
651 |
|
55867 | 652 |
fun build_rec (x as Free (_, T)) U = |
52368 | 653 |
if T = U then |
654 |
x |
|
655 |
else |
|
52303
16d7708aba40
one less flaky "fpTs" check (flaky in the presence of duplicates in "fpTs", which we want to have in "primrec")
blanchet
parents:
52302
diff
changeset
|
656 |
build_map lthy (indexify (perhaps (try (snd o HOLogic.dest_prodT)) o snd) Cs |
55867 | 657 |
(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
|
658 |
|
55867 | 659 |
val fxsss = map2 (map2 (flat_rec_arg_args oo map2 (map o build_rec))) xsss x_Tssss; |
55871 | 660 |
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
|
661 |
|
52305 | 662 |
val tacss = |
55867 | 663 |
map4 (map ooo mk_rec_tac pre_map_defs (nested_map_idents @ nesting_map_idents) rec_defs) |
664 |
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
|
665 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
666 |
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
|
667 |
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
|
668 |
|> 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
|
669 |
in |
52305 | 670 |
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
|
671 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
672 |
|
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
673 |
val rec_thmss = |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
674 |
(case rec_args_typess of |
55867 | 675 |
SOME types => mk_rec_thmss types recs rec_defs ctor_rec_thms |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
676 |
| NONE => replicate nn []); |
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 |
52345 | 678 |
((induct_thms, induct_thm, [induct_case_names_attr]), |
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 |
|
55871 | 682 |
fun derive_coinduct_corecs_thms_for_types pre_bnfs (x, cs, cpss, ((pgss, cqgsss), _)) |
55867 | 683 |
dtor_coinduct dtor_injects dtor_ctors dtor_corec_thms nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
684 |
mss ns fp_abs_inverses abs_inverses mk_vimage2p ctr_defss (ctr_sugars : ctr_sugar list) |
55864 | 685 |
corecs corec_defs export_args lthy = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
686 |
let |
55867 | 687 |
fun mk_ctor_dtor_corec_thm dtor_inject dtor_ctor corec = |
688 |
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
|
689 |
|
55867 | 690 |
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
|
691 |
|
51815 | 692 |
val nn = length pre_bnfs; |
693 |
||
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
694 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
695 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
53329 | 696 |
val nesting_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nesting_bnfs; |
51830 | 697 |
val nesting_rel_eqs = map rel_eq_of_bnf nesting_bnfs; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
698 |
|
51816 | 699 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 700 |
|
53210
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53203
diff
changeset
|
701 |
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
|
702 |
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
|
703 |
val selsss = map #selss ctr_sugars; |
51840 | 704 |
val exhausts = map #exhaust ctr_sugars; |
705 |
val disc_thmsss = map #disc_thmss ctr_sugars; |
|
706 |
val discIss = map #discIs ctr_sugars; |
|
707 |
val sel_thmsss = map #sel_thmss ctr_sugars; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
708 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
709 |
val (((rs, us'), vs'), names_lthy) = |
52341 | 710 |
lthy |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
711 |
|> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) |
51816 | 712 |
||>> Variable.variant_fixes fp_b_names |
713 |
||>> Variable.variant_fixes (map (suffix "'") fp_b_names); |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
714 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
715 |
val us = map2 (curry Free) us' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
716 |
val udiscss = map2 (map o rapp) us discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
717 |
val uselsss = map2 (map o map o rapp) us selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
718 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
719 |
val vs = map2 (curry Free) vs' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
720 |
val vdiscss = map2 (map o rapp) vs discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
721 |
val vselsss = map2 (map o map o rapp) vs selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
722 |
|
52345 | 723 |
val coinduct_thms_pairs = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
724 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
725 |
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
|
726 |
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
727 |
val strong_rs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
728 |
map4 (fn u => fn v => fn uvr => fn uv_eq => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
729 |
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
|
730 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
731 |
fun build_the_rel rs' T Xs_T = |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
732 |
build_rel lthy (fn (_, X) => nth rs' (find_index (curry (op =) X) Xs)) (T, Xs_T) |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
733 |
|> Term.subst_atomic_types (Xs ~~ fpTs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
734 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
735 |
fun build_rel_app rs' usel vsel Xs_T = |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
736 |
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
|
737 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
738 |
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
|
739 |
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
740 |
(if null usels then |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
741 |
[] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
742 |
else |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
743 |
[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
|
744 |
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
|
745 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
746 |
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
|
747 |
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
|
748 |
(1 upto n) udiscs uselss vdiscs vselss ctrXs_Tss)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
749 |
handle List.Empty => @{term True}; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
750 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
751 |
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
|
752 |
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
|
753 |
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
|
754 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
755 |
val concl = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
756 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
757 |
(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
|
758 |
uvrs us vs)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
759 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
760 |
fun mk_goal rs' = |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
761 |
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
|
762 |
ctrXs_Tsss, concl); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
763 |
|
52345 | 764 |
val goals = map mk_goal [rs, strong_rs]; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
765 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
766 |
fun prove dtor_coinduct' goal = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
767 |
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
|
768 |
mk_coinduct_tac ctxt nesting_rel_eqs nn ns dtor_coinduct' pre_rel_defs fp_abs_inverses |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
769 |
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
|
770 |
|> singleton (Proof_Context.export names_lthy lthy) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
771 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
772 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
773 |
fun postproc nn thm = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
774 |
Thm.permute_prems 0 nn |
51828 | 775 |
(if nn = 1 then thm RS mp else funpow nn (fn thm => reassoc_conjs (thm RS mp_conj)) thm) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
776 |
|> Drule.zero_var_indexes |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
777 |
|> `(conj_dests nn); |
53106 | 778 |
|
779 |
val rel_eqs = map rel_eq_of_bnf pre_bnfs; |
|
780 |
val rel_monos = map rel_mono_of_bnf pre_bnfs; |
|
781 |
val dtor_coinducts = |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
782 |
[dtor_coinduct, mk_strong_coinduct_thm dtor_coinduct rel_eqs rel_monos mk_vimage2p lthy] |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
783 |
in |
52345 | 784 |
map2 (postproc nn oo prove) dtor_coinducts goals |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
785 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
786 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
787 |
fun mk_coinduct_concls ms discs ctrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
788 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
789 |
fun mk_disc_concl disc = [name_of_disc disc]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
790 |
fun mk_ctr_concl 0 _ = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
791 |
| mk_ctr_concl _ ctor = [name_of_ctr ctor]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
792 |
val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
793 |
val ctr_concls = map2 mk_ctr_concl ms ctrs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
794 |
in |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
795 |
flat (map2 append disc_concls ctr_concls) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
796 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
797 |
|
51816 | 798 |
val coinduct_cases = quasi_unambiguous_case_names (map (prefix EqN) fp_b_names); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
799 |
val coinduct_conclss = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
800 |
map3 (quasi_unambiguous_case_names ooo mk_coinduct_concls) mss discss ctrss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
801 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
802 |
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
803 |
|
55869 | 804 |
val gcorecs = map (lists_bmoc pgss) corecs; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
805 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
806 |
val corec_thmss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
807 |
let |
55869 | 808 |
fun mk_goal c cps gcorec n k ctr m cfs' = |
809 |
fold_rev (fold_rev Logic.all) ([c] :: pgss) |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
810 |
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, |
55869 | 811 |
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
|
812 |
|
55869 | 813 |
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
|
814 |
|
55869 | 815 |
fun tack (c, u) f = |
816 |
let val x' = Free (x, mk_sumT (fastype_of u, fastype_of c)) in |
|
817 |
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
|
818 |
end; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
819 |
|
55869 | 820 |
fun build_corec cqg = |
821 |
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
|
822 |
if exists_subtype_in Cs T then |
55869 | 823 |
let val U = mk_U T in |
824 |
build_map lthy (indexify fst (map2 (curry mk_sumT) fpTs Cs) (fn kk => fn _ => |
|
825 |
tack (nth cs kk, nth us kk) (nth gcorecs kk))) (T, U) $ cqg |
|
52368 | 826 |
end |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
827 |
else |
55869 | 828 |
cqg |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
829 |
end; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
830 |
|
55869 | 831 |
val cqgsss' = map (map (map build_corec)) cqgsss; |
832 |
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
|
833 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
834 |
val tacss = |
55867 | 835 |
map4 (map ooo mk_corec_tac corec_defs nesting_map_idents) |
836 |
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
|
837 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
838 |
fun prove goal tac = |
51815 | 839 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
840 |
|> Thm.close_derivation; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
841 |
in |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
842 |
map2 (map2 prove) goalss tacss |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
843 |
|> map (map (unfold_thms lthy @{thms case_sum_if})) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
844 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
845 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
846 |
val disc_corec_iff_thmss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
847 |
let |
55869 | 848 |
fun mk_goal c cps gcorec n k disc = |
849 |
mk_Trueprop_eq (disc $ (gcorec $ c), |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
850 |
if n = 1 then @{const True} |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
851 |
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
|
852 |
|
55869 | 853 |
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
|
854 |
|
51828 | 855 |
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
|
856 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
857 |
val case_splitss' = map (map mk_case_split') cpss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
858 |
|
55867 | 859 |
val tacss = map3 (map oo mk_disc_corec_iff_tac) case_splitss' corec_thmss disc_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
860 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
861 |
fun prove goal tac = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
862 |
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
|
863 |
|> singleton export_args |
51829 | 864 |
|> singleton (Proof_Context.export names_lthy lthy) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
865 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
866 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
867 |
fun proves [_] [_] = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
868 |
| proves goals tacs = map2 prove goals tacs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
869 |
in |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
870 |
map2 proves goalss tacss |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
871 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
872 |
|
55867 | 873 |
fun mk_disc_corec_thms corecs discIs = map (op RS) (corecs ~~ discIs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
874 |
|
55867 | 875 |
val disc_corec_thmss = map2 mk_disc_corec_thms corec_thmss discIss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
876 |
|
55867 | 877 |
fun mk_sel_corec_thm corec_thm sel sel_thm = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
878 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
879 |
val (domT, ranT) = dest_funT (fastype_of sel); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
880 |
val arg_cong' = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
881 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
882 |
[NONE, NONE, SOME (certify lthy sel)] arg_cong |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
883 |
|> Thm.varifyT_global; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
884 |
val sel_thm' = sel_thm RSN (2, trans); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
885 |
in |
55867 | 886 |
corec_thm RS arg_cong' RS sel_thm' |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
887 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
888 |
|
55867 | 889 |
fun mk_sel_corec_thms corec_thmss = |
890 |
map3 (map3 (map2 o mk_sel_corec_thm)) corec_thmss selsss sel_thmsss; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
891 |
|
55867 | 892 |
val sel_corec_thmsss = mk_sel_corec_thms corec_thmss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
893 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
894 |
val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
895 |
val coinduct_case_names_attr = Attrib.internal (K (Rule_Cases.case_names coinduct_cases)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
896 |
val coinduct_case_concl_attrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
897 |
map2 (fn casex => fn concls => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
898 |
Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls)))) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
899 |
coinduct_cases coinduct_conclss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
900 |
val coinduct_case_attrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
901 |
coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
902 |
in |
52345 | 903 |
((coinduct_thms_pairs, coinduct_case_attrs), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
904 |
(corec_thmss, code_nitpicksimp_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
905 |
(disc_corec_thmss, []), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
906 |
(disc_corec_iff_thmss, simp_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
907 |
(sel_corec_thmsss, simp_attrs)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
908 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
909 |
|
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
910 |
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp |
55410 | 911 |
(wrap_opts as (no_discs_sels, _), specs) no_defs_lthy0 = |
49112 | 912 |
let |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
913 |
(* TODO: sanity checks on arguments *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
914 |
|
52969
f2df0730f8ac
clarified option name (since case/fold/rec are also destructors)
blanchet
parents:
52968
diff
changeset
|
915 |
val _ = if fp = Greatest_FP andalso no_discs_sels then |
f2df0730f8ac
clarified option name (since case/fold/rec are also destructors)
blanchet
parents:
52968
diff
changeset
|
916 |
error "Cannot define codatatypes without discriminators and selectors" |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
917 |
else |
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
918 |
(); |
49278 | 919 |
|
49367 | 920 |
val nn = length specs; |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
921 |
val fp_bs = map type_binding_of_spec specs; |
49498 | 922 |
val fp_b_names = map Binding.name_of fp_bs; |
923 |
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
|
924 |
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
|
925 |
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
|
926 |
|
51758 | 927 |
fun prepare_type_arg (_, (ty, c)) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
928 |
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
|
929 |
TFree (s, prepare_constraint no_defs_lthy0 c) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
930 |
end; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
931 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
932 |
val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of_spec) specs; |
56254 | 933 |
val unsorted_Ass0 = map (map (resort_tfree @{sort type})) Ass0; |
55700 | 934 |
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
|
935 |
val num_As = length unsorted_As; |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
936 |
|
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
937 |
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
|
938 |
val set_bss = map (map (the_default Binding.empty)) set_boss; |
49119 | 939 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
940 |
val (((Bs0, Cs), Xs), no_defs_lthy) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
941 |
no_defs_lthy0 |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
942 |
|> 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
|
943 |
|> mk_TFrees num_As |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
944 |
||>> mk_TFrees nn |
51858
7a08fe1e19b1
added and moved library functions (used in primrec code)
blanchet
parents:
51857
diff
changeset
|
945 |
||>> variant_tfrees fp_b_names; |
49119 | 946 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
947 |
fun add_fake_type spec = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
948 |
Typedecl.basic_typedecl (type_binding_of_spec spec, num_As, mixfix_of_spec spec); |
51768 | 949 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
950 |
val (fake_T_names, fake_lthy) = fold_map add_fake_type specs no_defs_lthy0; |
49119 | 951 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
952 |
val qsoty = quote o Syntax.string_of_typ fake_lthy; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
953 |
|
54253 | 954 |
val _ = (case Library.duplicates (op =) unsorted_As of [] => () |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
955 |
| A :: _ => error ("Duplicate type parameter " ^ qsoty A ^ " in " ^ co_prefix fp ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
956 |
"datatype specification")); |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
957 |
|
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
958 |
val bad_args = |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
959 |
map (Logic.type_map (singleton (Variable.polymorphic no_defs_lthy0))) unsorted_As |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
960 |
|> filter_out Term.is_TVar; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
961 |
val _ = null bad_args orelse |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
962 |
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
|
963 |
"datatype specification"); |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
964 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
965 |
val mixfixes = map mixfix_of_spec specs; |
49119 | 966 |
|
54253 | 967 |
val _ = (case Library.duplicates Binding.eq_name fp_bs of [] => () |
49119 | 968 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
969 |
||
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
970 |
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
|
971 |
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
|
972 |
val ctr_mixfixess = map (map snd) mx_ctr_specss; |
49119 | 973 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
974 |
val disc_bindingss = map (map disc_of_ctr_spec) ctr_specss; |
49336 | 975 |
val ctr_bindingss = |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
976 |
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
|
977 |
ctr_specss; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
978 |
val ctr_argsss = map (map args_of_ctr_spec) ctr_specss; |
49119 | 979 |
|
49336 | 980 |
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
|
981 |
val fake_ctr_Tsss0 = map (map (map (prepare_typ fake_lthy o snd))) ctr_argsss; |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
982 |
val raw_sel_defaultsss = map (map sel_defaults_of_ctr_spec) ctr_specss; |
49286 | 983 |
|
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
984 |
val (As :: _) :: fake_ctr_Tsss = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
985 |
burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0); |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
986 |
val As' = map dest_TFree As; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
987 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
988 |
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
|
989 |
val _ = (case subtract (op =) As' rhs_As' of [] => () |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
990 |
| extras => error ("Extra type variables on right-hand side: " ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
991 |
commas (map (qsoty o TFree) extras))); |
49165 | 992 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
993 |
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
|
994 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
995 |
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
|
996 |
s = s' andalso (Ts = Ts' orelse |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
997 |
error ("Wrong type arguments in " ^ co_prefix fp ^ "recursive type " ^ qsoty T ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
998 |
" (expected " ^ qsoty T' ^ ")")) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
999 |
| eq_fpT_check _ _ = false; |
49146 | 1000 |
|
53222 | 1001 |
fun freeze_fp (T as Type (s, Ts)) = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1002 |
(case find_index (eq_fpT_check T) fake_Ts of |
53222 | 1003 |
~1 => Type (s, map freeze_fp Ts) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1004 |
| kk => nth Xs kk) |
49204 | 1005 |
| freeze_fp T = T; |
49121 | 1006 |
|
53222 | 1007 |
val unfreeze_fp = Term.typ_subst_atomic (Xs ~~ fake_Ts); |
1008 |
||
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
|
1009 |
val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss; |
55966 | 1010 |
val ctrXs_repTs = map mk_sumprodT_balanced ctrXs_Tsss; |
49119 | 1011 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1012 |
val fp_eqs = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1013 |
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_repTs; |
49121 | 1014 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1015 |
val rhsXs_As' = fold (fold (fold Term.add_tfreesT)) ctrXs_Tsss []; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1016 |
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
|
1017 |
| 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
|
1018 |
co_prefix fp ^ "datatype definition: " ^ qsoty (TFree extra))) extras); |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1019 |
|
55701 | 1020 |
val killed_As = |
1021 |
map_filter (fn (A, set_bos) => if exists is_none set_bos then SOME A else NONE) |
|
1022 |
(unsorted_As ~~ transpose set_boss); |
|
1023 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1024 |
val ((pre_bnfs, absT_infos), (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, |
55868 | 1025 |
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
|
1026 |
ctor_dtors, ctor_injects, dtor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms, |
55868 | 1027 |
xtor_co_rec_thms, ...}, |
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
1028 |
lthy)) = |
55701 | 1029 |
fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As) |
1030 |
(map dest_TFree killed_As) fp_eqs no_defs_lthy0 |
|
53222 | 1031 |
handle BAD_DEAD (X, X_backdrop) => |
1032 |
(case X_backdrop of |
|
1033 |
Type (bad_tc, _) => |
|
1034 |
let |
|
1035 |
val fake_T = qsoty (unfreeze_fp X); |
|
1036 |
val fake_T_backdrop = qsoty (unfreeze_fp X_backdrop); |
|
1037 |
fun register_hint () = |
|
1038 |
"\nUse the " ^ quote (fst (fst @{command_spec "bnf"})) ^ " command to register " ^ |
|
1039 |
quote bad_tc ^ " as a bounded natural functor to allow nested (co)recursion through \ |
|
1040 |
\it"; |
|
1041 |
in |
|
1042 |
if is_some (bnf_of no_defs_lthy bad_tc) orelse |
|
1043 |
is_some (fp_sugar_of no_defs_lthy bad_tc) then |
|
53256 | 1044 |
error ("Inadmissible " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
1045 |
" in type expression " ^ fake_T_backdrop) |
|
53222 | 1046 |
else if is_some (Datatype_Data.get_info (Proof_Context.theory_of no_defs_lthy) |
1047 |
bad_tc) then |
|
1048 |
error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
|
1049 |
" via the old-style datatype " ^ quote bad_tc ^ " in type expression " ^ |
|
1050 |
fake_T_backdrop ^ register_hint ()) |
|
1051 |
else |
|
1052 |
error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
|
1053 |
" via type constructor " ^ quote bad_tc ^ " in type expression " ^ fake_T_backdrop ^ |
|
1054 |
register_hint ()) |
|
1055 |
end); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1056 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1057 |
val abss = map #abs absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1058 |
val reps = map #rep absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1059 |
val absTs = map #absT absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1060 |
val repTs = map #repT absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1061 |
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
|
1062 |
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
|
1063 |
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
|
1064 |
|
53143
ba80154a1118
configuration option to control timing output for (co)datatypes
traytel
parents:
53126
diff
changeset
|
1065 |
val time = time lthy; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1066 |
val timer = time (Timer.startRealTimer ()); |
49121 | 1067 |
|
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
|
1068 |
val nesting_bnfs = nesty_bnfs lthy ctrXs_Tsss As; |
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
|
1069 |
val nested_bnfs = nesty_bnfs lthy ctrXs_Tsss Xs; |
49226 | 1070 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1071 |
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
|
1072 |
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
|
1073 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
53290 | 1074 |
val nesting_set_maps = maps set_map_of_bnf nesting_bnfs; |
1075 |
val nested_set_maps = maps set_map_of_bnf nested_bnfs; |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1076 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1077 |
val live = live_of_bnf any_fp_bnf; |
52961 | 1078 |
val _ = |
1079 |
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
|
1080 |
warning "Map function and relator names ignored" |
52961 | 1081 |
else |
1082 |
(); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1083 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1084 |
val Bs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1085 |
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
|
1086 |
(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
|
1087 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1088 |
val B_ify = Term.typ_subst_atomic (As ~~ Bs); |
49167 | 1089 |
|
49501 | 1090 |
val ctors = map (mk_ctor As) ctors0; |
1091 |
val dtors = map (mk_dtor As) dtors0; |
|
49124 | 1092 |
|
49501 | 1093 |
val fpTs = map (domain_type o fastype_of) dtors; |
56638 | 1094 |
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
|
1095 |
|
51780 | 1096 |
fun massage_simple_notes base = |
1097 |
filter_out (null o #2) |
|
1098 |
#> map (fn (thmN, thms, attrs) => |
|
55410 | 1099 |
((Binding.qualify true base (Binding.name thmN), attrs), [(thms, [])])); |
51780 | 1100 |
|
1101 |
val massage_multi_notes = |
|
1102 |
maps (fn (thmN, thmss, attrs) => |
|
53792 | 1103 |
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => |
55410 | 1104 |
((Binding.qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])])) |
53792 | 1105 |
fp_b_names fpTs thmss) |
1106 |
#> filter_out (null o fst o hd o snd); |
|
51780 | 1107 |
|
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
|
1108 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss; |
49203 | 1109 |
val ns = map length ctr_Tsss; |
49212 | 1110 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 1111 |
val mss = map (map length) ctr_Tsss; |
1112 |
||
55867 | 1113 |
val ((xtor_co_recs, recs_args_types, corecs_args_types), lthy') = |
55868 | 1114 |
mk_co_recs_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_recs0 lthy; |
49210 | 1115 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1116 |
fun define_ctrs_dtrs_for_type (((((((((((((((((((((((((((fp_bnf, fp_b), fpT), ctor), dtor), |
55867 | 1117 |
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
|
1118 |
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
|
1119 |
abs_inject), abs_inverse), type_definition), ctr_bindings), ctr_mixfixes), ctr_Tss), |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1120 |
disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = |
49176 | 1121 |
let |
49498 | 1122 |
val fp_b_name = Binding.name_of fp_b; |
1123 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1124 |
val ctr_absT = domain_type (fastype_of ctor); |
49119 | 1125 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1126 |
val ((((w, xss), yss), u'), names_lthy) = |
49204 | 1127 |
no_defs_lthy |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1128 |
|> yield_singleton (mk_Frees "w") ctr_absT |
49370 | 1129 |
||>> mk_Freess "x" ctr_Tss |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1130 |
||>> mk_Freess "y" (map (map B_ify) ctr_Tss) |
49498 | 1131 |
||>> yield_singleton Variable.variant_fixes fp_b_name; |
49370 | 1132 |
|
49498 | 1133 |
val u = Free (u', fpT); |
49121 | 1134 |
|
49129 | 1135 |
val ctr_rhss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1136 |
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
|
1137 |
ks xss; |
49121 | 1138 |
|
53569
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1139 |
val maybe_conceal_def_binding = Thm.def_binding |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1140 |
#> 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
|
1141 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1142 |
val ((raw_ctrs, raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 1143 |
|> 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
|
1144 |
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
|
1145 |
ctr_bindings ctr_mixfixes ctr_rhss |
49121 | 1146 |
||> `Local_Theory.restore; |
1147 |
||
1148 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
1149 |
||
1150 |
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
|
1151 |
val ctr_defs' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1152 |
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
|
1153 |
|
49203 | 1154 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
1155 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 1156 |
|
51897 | 1157 |
fun wrap_ctrs lthy = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1158 |
let |
50170 | 1159 |
fun exhaust_tac {context = ctxt, prems = _} = |
49135 | 1160 |
let |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1161 |
val ctor_iff_dtor_thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1162 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1163 |
val goal = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1164 |
fold_rev Logic.all [w, u] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1165 |
(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
|
1166 |
in |
51551 | 1167 |
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
|
1168 |
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
|
1169 |
(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
|
1170 |
|> Morphism.thm phi |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1171 |
|> Thm.close_derivation |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1172 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1173 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1174 |
val sumEN_thm' = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1175 |
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
|
1176 |
|> Morphism.thm phi; |
49135 | 1177 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1178 |
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' |
49135 | 1179 |
end; |
1180 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1181 |
val inject_tacss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1182 |
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
|
1183 |
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
|
1184 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1185 |
val half_distinct_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1186 |
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
|
1187 |
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
|
1188 |
(mk_half_pairss (`I ctr_defs)); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1189 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1190 |
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1191 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1192 |
val sel_defaultss = map (map (apsnd (prepare_term lthy))) raw_sel_defaultss |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1193 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1194 |
fun ctr_spec_of disc_b ctr0 sel_bs sel_defs = (((disc_b, ctr0), sel_bs), sel_defs); |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1195 |
val ctr_specs = map4 ctr_spec_of disc_bindings ctrs0 sel_bindingss sel_defaultss; |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1196 |
in |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1197 |
free_constructors tacss ((wrap_opts, standard_binding), ctr_specs) lthy |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1198 |
end; |
49121 | 1199 |
|
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
1200 |
fun derive_maps_sets_rels (ctr_sugar as {case_cong, ...} : ctr_sugar, lthy) = |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1201 |
if live = 0 then |
51840 | 1202 |
((([], [], [], []), ctr_sugar), lthy) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1203 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1204 |
let |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1205 |
val rel_flip = rel_flip_of_bnf fp_bnf; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1206 |
val nones = replicate live NONE; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1207 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1208 |
val ctor_cong = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1209 |
if fp = Least_FP then |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1210 |
Drule.dummy_thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1211 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1212 |
let val ctor' = mk_ctor Bs ctor in |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1213 |
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
|
1214 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1215 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1216 |
fun mk_cIn ctor k xs = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1217 |
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
|
1218 |
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
|
1219 |
|> fp = Greatest_FP ? curry (op $) ctor |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1220 |
|> certify lthy |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1221 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1222 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1223 |
val cxIns = map2 (mk_cIn ctor) ks xss; |
56638 | 1224 |
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
|
1225 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1226 |
fun mk_map_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1227 |
fold_thms lthy [ctr_def'] |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1228 |
(unfold_thms lthy (o_apply :: pre_map_def :: |
55966 | 1229 |
(if fp = Least_FP then [] else [ctor_dtor, dtor_ctor]) @ sumprod_thms_map @ |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1230 |
abs_inverses) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1231 |
(cterm_instantiate_pos (nones @ [SOME cxIn]) |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1232 |
(if fp = Least_FP then fp_map_thm else fp_map_thm RS ctor_cong))) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1233 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1234 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1235 |
fun mk_set_thm fp_set_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1236 |
fold_thms lthy [ctr_def'] |
53290 | 1237 |
(unfold_thms lthy (pre_set_defs @ nested_set_maps @ nesting_set_maps @ |
55966 | 1238 |
(if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_set @ |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1239 |
abs_inverses) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1240 |
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1241 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1242 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1243 |
fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns; |
49127 | 1244 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1245 |
val map_thms = map2 mk_map_thm ctr_defs' cxIns; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1246 |
val set_thmss = map mk_set_thms fp_set_thms; |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1247 |
val set_thms = flat set_thmss; |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1248 |
|
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1249 |
val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1250 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1251 |
fun mk_rel_thm postproc ctr_defs' cxIn cyIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1252 |
fold_thms lthy ctr_defs' |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1253 |
(unfold_thms lthy (pre_rel_def :: abs_inverse :: |
55966 | 1254 |
(if fp = Least_FP then [] else [dtor_ctor]) @ sumprod_thms_rel @ |
56049 | 1255 |
@{thms vimage2p_def sum.inject Inl_Inr_False}) |
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1256 |
(cterm_instantiate_pos (nones @ [SOME cxIn, SOME cyIn]) fp_rel_thm)) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1257 |
|> postproc |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1258 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1259 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1260 |
fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1261 |
mk_rel_thm (unfold_thms lthy @{thms eq_sym_Unity_conv}) [ctr_def'] cxIn cyIn; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1262 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1263 |
val rel_inject_thms = map mk_rel_inject_thm (op ~~ rel_infos); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1264 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1265 |
fun mk_half_rel_distinct_thm ((xctr_def', cxIn), (yctr_def', cyIn)) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1266 |
mk_rel_thm (fn thm => thm RS @{thm eq_False[THEN iffD1]}) [xctr_def', yctr_def'] |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1267 |
cxIn cyIn; |
49121 | 1268 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1269 |
fun mk_other_half_rel_distinct_thm thm = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1270 |
flip_rels lthy live thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1271 |
RS (rel_flip RS sym RS @{thm arg_cong[of _ _ Not]} RS iffD2); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1272 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1273 |
val half_rel_distinct_thmss = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1274 |
map (map mk_half_rel_distinct_thm) (mk_half_pairss rel_infos); |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1275 |
val other_half_rel_distinct_thmss = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1276 |
map (map mk_other_half_rel_distinct_thm) half_rel_distinct_thmss; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1277 |
val (rel_distinct_thms, _) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1278 |
join_halves n half_rel_distinct_thmss other_half_rel_distinct_thmss; |
49134
846264f80f16
optionally provide extra dead variables to the FP constructions
blanchet
parents:
49130
diff
changeset
|
1279 |
|
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1280 |
val rel_eq_thms = |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1281 |
map (fn th => th RS @{thm eq_False[THEN iffD2]}) rel_distinct_thms @ |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1282 |
map2 (fn th => fn 0 => th RS @{thm eq_True[THEN iffD2]} | _ => th) |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1283 |
rel_inject_thms ms; |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1284 |
|
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1285 |
val anonymous_notes = |
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
1286 |
[([case_cong], fundefcong_attrs), |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1287 |
(rel_eq_thms, code_nitpicksimp_attrs)] |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1288 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1289 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1290 |
val notes = |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1291 |
[(mapN, map_thms, code_nitpicksimp_attrs @ simp_attrs), |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1292 |
(rel_distinctN, rel_distinct_thms, simp_attrs), |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1293 |
(rel_injectN, rel_inject_thms, simp_attrs), |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1294 |
(setN, set_thms, code_nitpicksimp_attrs @ simp_attrs)] |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1295 |
|> massage_simple_notes fp_b_name; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1296 |
in |
51840 | 1297 |
(((map_thms, rel_inject_thms, rel_distinct_thms, set_thmss), ctr_sugar), |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1298 |
lthy |
55535
10194808430d
name derivations in 'primrec' for code extraction from proof terms
blanchet
parents:
55486
diff
changeset
|
1299 |
|> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) map_thms) |
55903
461a75d00323
register relator equations as spec rules only for datatypes -- for codatatypes they underspecify the function and are therefore dangerous (e.g. to Nitpick)
blanchet
parents:
55901
diff
changeset
|
1300 |
|> fp = Least_FP |
461a75d00323
register relator equations as spec rules only for datatypes -- for codatatypes they underspecify the function and are therefore dangerous (e.g. to Nitpick)
blanchet
parents:
55901
diff
changeset
|
1301 |
? Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) rel_eq_thms) |
55535
10194808430d
name derivations in 'primrec' for code extraction from proof terms
blanchet
parents:
55486
diff
changeset
|
1302 |
|> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) set_thms) |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1303 |
|> Local_Theory.notes (anonymous_notes @ notes) |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1304 |
|> snd) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1305 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1306 |
|
55410 | 1307 |
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
|
1308 |
|
55867 | 1309 |
fun massage_res (((maps_sets_rels, ctr_sugar), co_rec_res), lthy) = |
1310 |
(((maps_sets_rels, (ctrs, xss, ctr_defs, ctr_sugar)), co_rec_res), lthy); |
|
49119 | 1311 |
in |
51897 | 1312 |
(wrap_ctrs |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1313 |
#> derive_maps_sets_rels |
52313 | 1314 |
##>> |
55867 | 1315 |
(if fp = Least_FP then define_rec recs_args_types mk_binding fpTs Cs reps |
1316 |
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
|
1317 |
#> massage_res, lthy') |
49119 | 1318 |
end; |
49167 | 1319 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1320 |
fun wrap_types_etc (wrap_types_etcs, lthy) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1321 |
fold_map I wrap_types_etcs lthy |
52342 | 1322 |
|>> apsnd split_list o apfst (apsnd split_list4 o apfst split_list4 o split_list) |
1323 |
o split_list; |
|
49226 | 1324 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1325 |
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
|
1326 |
rel_distincts setss = |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1327 |
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
|
1328 |
|
55867 | 1329 |
fun derive_note_induct_recs_thms_for_types |
53476
eb3865c3ee58
include map theorems in datastructure for "primcorec"
blanchet
parents:
53475
diff
changeset
|
1330 |
((((mapss, rel_injects, rel_distincts, setss), (ctrss, _, ctr_defss, ctr_sugars)), |
55864 | 1331 |
(recs, rec_defs)), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1332 |
let |
55869 | 1333 |
val ((induct_thms, induct_thm, induct_attrs), (rec_thmss, rec_attrs)) = |
55868 | 1334 |
derive_induct_recs_thms_for_types pre_bnfs recs_args_types xtor_co_induct xtor_co_rec_thms |
1335 |
nesting_bnfs nested_bnfs fpTs Cs Xs ctrXs_Tsss abs_inverses type_definitions |
|
1336 |
abs_inverses ctrss ctr_defss recs rec_defs lthy; |
|
49201 | 1337 |
|
51830 | 1338 |
val induct_type_attr = Attrib.internal o K o Induct.induct_type; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1339 |
|
55864 | 1340 |
val (recs', rec_thmss') = |
55867 | 1341 |
if is_some recs_args_types then (recs, rec_thmss) |
55864 | 1342 |
else (map #casex ctr_sugars, map #case_thms ctr_sugars); |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1343 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1344 |
val simp_thmss = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1345 |
map6 mk_simp_thms ctr_sugars rec_thmss mapss rel_injects rel_distincts setss; |
49438 | 1346 |
|
49337 | 1347 |
val common_notes = |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
1348 |
(if nn > 1 then [(inductN, [induct_thm], induct_attrs)] else []) |
51780 | 1349 |
|> massage_simple_notes fp_common_name; |
49337 | 1350 |
|
49226 | 1351 |
val notes = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1352 |
[(inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]), |
55869 | 1353 |
(recN, rec_thmss, K rec_attrs), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1354 |
(simpsN, simp_thmss, K [])] |
51780 | 1355 |
|> massage_multi_notes; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1356 |
in |
51824 | 1357 |
lthy |
55867 | 1358 |
|> (if is_some recs_args_types then |
55864 | 1359 |
Spec_Rules.add Spec_Rules.Equational (recs, flat rec_thmss) |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1360 |
else |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1361 |
I) |
51824 | 1362 |
|> Local_Theory.notes (common_notes @ notes) |> snd |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
1363 |
|> register_as_fp_sugars Xs Least_FP pre_bnfs absT_infos nested_bnfs nesting_bnfs fp_res |
55864 | 1364 |
ctrXs_Tsss ctr_defss ctr_sugars recs' mapss [induct_thm] (map single induct_thms) |
56521 | 1365 |
rec_thmss' (replicate nn []) (replicate nn []) rel_injects |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1366 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1367 |
|
55867 | 1368 |
fun derive_note_coinduct_corecs_thms_for_types |
53476
eb3865c3ee58
include map theorems in datastructure for "primcorec"
blanchet
parents:
53475
diff
changeset
|
1369 |
((((mapss, rel_injects, rel_distincts, setss), (_, _, ctr_defss, ctr_sugars)), |
55867 | 1370 |
(corecs, corec_defs)), lthy) = |
49212 | 1371 |
let |
52345 | 1372 |
val (([(coinduct_thms, coinduct_thm), (strong_coinduct_thms, strong_coinduct_thm)], |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1373 |
coinduct_attrs), |
55871 | 1374 |
(corec_thmss, corec_attrs), (disc_corec_thmss, disc_corec_attrs), |
1375 |
(disc_corec_iff_thmss, disc_corec_iff_attrs), (sel_corec_thmsss, sel_corec_attrs)) = |
|
55867 | 1376 |
derive_coinduct_corecs_thms_for_types pre_bnfs (the corecs_args_types) xtor_co_induct |
55868 | 1377 |
dtor_injects dtor_ctors xtor_co_rec_thms nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss mss ns |
1378 |
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
|
1379 |
(Proof_Context.export lthy' no_defs_lthy) lthy; |
49212 | 1380 |
|
53475 | 1381 |
val sel_corec_thmss = map flat sel_corec_thmsss; |
1382 |
||
51830 | 1383 |
val coinduct_type_attr = Attrib.internal o K o Induct.coinduct_type; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1384 |
|
55867 | 1385 |
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
|
1386 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1387 |
val simp_thmss = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1388 |
map6 mk_simp_thms ctr_sugars |
55867 | 1389 |
(map3 flat_corec_thms disc_corec_thmss disc_corec_iff_thmss sel_corec_thmss) |
53476
eb3865c3ee58
include map theorems in datastructure for "primcorec"
blanchet
parents:
53475
diff
changeset
|
1390 |
mapss rel_injects rel_distincts setss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1391 |
|
49342 | 1392 |
val common_notes = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1393 |
(if nn > 1 then |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1394 |
[(coinductN, [coinduct_thm], coinduct_attrs), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1395 |
(strong_coinductN, [strong_coinduct_thm], coinduct_attrs)] |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1396 |
else |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1397 |
[]) |
51780 | 1398 |
|> massage_simple_notes fp_common_name; |
49342 | 1399 |
|
49212 | 1400 |
val notes = |
51780 | 1401 |
[(coinductN, map single coinduct_thms, |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1402 |
fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]), |
55867 | 1403 |
(corecN, corec_thmss, K corec_attrs), |
1404 |
(disc_corecN, disc_corec_thmss, K disc_corec_attrs), |
|
1405 |
(disc_corec_iffN, disc_corec_iff_thmss, K disc_corec_iff_attrs), |
|
1406 |
(sel_corecN, sel_corec_thmss, K sel_corec_attrs), |
|
51780 | 1407 |
(simpsN, simp_thmss, K []), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1408 |
(strong_coinductN, map single strong_coinduct_thms, K coinduct_attrs)] |
51780 | 1409 |
|> massage_multi_notes; |
49212 | 1410 |
in |
51824 | 1411 |
lthy |
55864 | 1412 |
(* TODO: code theorems *) |
55867 | 1413 |
|> fold (curry (Spec_Rules.add Spec_Rules.Equational) corecs) |
55864 | 1414 |
[flat sel_corec_thmss, flat corec_thmss] |
54030
732b53d9b720
don't register equations of the form 'f x = ...' as simp rules, even if they are safe (noncorecursive), because they unfold too aggresively concepts users are likely to want to stay folded
blanchet
parents:
54006
diff
changeset
|
1415 |
|> Local_Theory.notes (common_notes @ notes) |> snd |
56637
d1d55f1bbc8a
invoke 'fp_sugar' interpretation hook on mutually recursive clique
blanchet
parents:
56523
diff
changeset
|
1416 |
|> register_as_fp_sugars Xs Greatest_FP pre_bnfs absT_infos nested_bnfs nesting_bnfs fp_res |
55867 | 1417 |
ctrXs_Tsss ctr_defss ctr_sugars corecs mapss [coinduct_thm, strong_coinduct_thm] |
55864 | 1418 |
(transpose [coinduct_thms, strong_coinduct_thms]) corec_thmss disc_corec_thmss |
56521 | 1419 |
sel_corec_thmsss rel_injects |
49212 | 1420 |
end; |
1421 |
||
52367 | 1422 |
val lthy'' = lthy' |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1423 |
|> fold_map define_ctrs_dtrs_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ ctors ~~ dtors ~~ |
55867 | 1424 |
xtor_co_recs ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~ pre_set_defss ~~ |
1425 |
pre_rel_defs ~~ xtor_map_thms ~~ xtor_set_thmss ~~ xtor_rel_thms ~~ ns ~~ kss ~~ mss ~~ |
|
1426 |
abss ~~ abs_injects ~~ abs_inverses ~~ type_definitions ~~ ctr_bindingss ~~ ctr_mixfixess ~~ |
|
1427 |
ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ raw_sel_defaultsss) |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1428 |
|> wrap_types_etc |
55966 | 1429 |
|> case_fp fp derive_note_induct_recs_thms_for_types |
55867 | 1430 |
derive_note_coinduct_corecs_thms_for_types; |
49167 | 1431 |
|
1432 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
52899 | 1433 |
co_prefix fp ^ "datatype")); |
49112 | 1434 |
in |
52367 | 1435 |
timer; lthy'' |
49112 | 1436 |
end; |
1437 |
||
53974 | 1438 |
fun co_datatypes x = define_co_datatypes (K I) (K I) (K I) x; |
49297 | 1439 |
|
53974 | 1440 |
fun co_datatype_cmd x = |
1441 |
define_co_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term x; |
|
49119 | 1442 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1443 |
val parse_ctr_arg = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1444 |
@{keyword "("} |-- parse_binding_colon -- Parse.typ --| @{keyword ")"} || |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1445 |
(Parse.typ >> pair Binding.empty); |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1446 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1447 |
val parse_ctr_specs = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1448 |
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
|
1449 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1450 |
val parse_spec = |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1451 |
parse_type_args_named_constrained -- parse_binding -- parse_map_rel_bindings -- |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1452 |
Parse.opt_mixfix -- (@{keyword "="} |-- parse_ctr_specs); |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1453 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1454 |
val parse_co_datatype = parse_ctr_options -- Parse.and_list1 parse_spec; |
49278 | 1455 |
|
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1456 |
fun parse_co_datatype_cmd fp construct_fp = parse_co_datatype >> co_datatype_cmd fp construct_fp; |
49112 | 1457 |
|
56522
f54003750e7d
don't forget to init Interpretation and transfer theorems in the interpretation hook
kuncar
parents:
56521
diff
changeset
|
1458 |
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
|
1459 |
|
49112 | 1460 |
end; |