author | blanchet |
Mon, 03 Mar 2014 12:48:20 +0100 | |
changeset 55864 | 516ab2906e7e |
parent 55863 | fa3a1ec69a1b |
child 55865 | 3be27c07e36d |
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, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
12 |
X: typ, |
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
13 |
fp: BNF_Util.fp_kind, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
14 |
fp_res_index: int, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
15 |
fp_res: BNF_FP_Util.fp_result, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
16 |
pre_bnf: BNF_Def.bnf, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
17 |
absT_info: BNF_Comp.absT_info, |
52356 | 18 |
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
|
19 |
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
|
20 |
ctrXs_Tss: typ list list, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
21 |
ctr_defs: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
22 |
ctr_sugar: Ctr_Sugar.ctr_sugar, |
55863 | 23 |
co_rec: term, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
24 |
maps: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
25 |
common_co_inducts: thm list, |
52343 | 26 |
co_inducts: thm list, |
55863 | 27 |
co_rec_thms: thm list, |
28 |
disc_co_recs: thm list, |
|
29 |
sel_co_recss: thm list list}; |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
30 |
|
51896 | 31 |
val morph_fp_sugar: morphism -> fp_sugar -> fp_sugar |
54256 | 32 |
val transfer_fp_sugar: Proof.context -> fp_sugar -> fp_sugar |
51896 | 33 |
val fp_sugar_of: Proof.context -> string -> fp_sugar option |
53907 | 34 |
val fp_sugars_of: Proof.context -> fp_sugar list |
51852 | 35 |
|
53106 | 36 |
val co_induct_of: 'a list -> 'a |
37 |
val strong_co_induct_of: 'a list -> 'a |
|
38 |
||
52868 | 39 |
val flat_corec_preds_predsss_gettersss: 'a list -> 'a list list list -> 'a list list list -> |
40 |
'a list |
|
51907 | 41 |
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
|
42 |
|
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
43 |
type lfp_sugar_thms = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
44 |
(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
|
45 |
|
54256 | 46 |
val morph_lfp_sugar_thms: morphism -> lfp_sugar_thms -> lfp_sugar_thms |
47 |
val transfer_lfp_sugar_thms: Proof.context -> lfp_sugar_thms -> lfp_sugar_thms |
|
48 |
||
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
49 |
type gfp_sugar_thms = |
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
50 |
((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
|
51 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
52 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
53 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
54 |
* (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
|
55 |
|
54256 | 56 |
val morph_gfp_sugar_thms: morphism -> gfp_sugar_thms -> gfp_sugar_thms |
57 |
val transfer_gfp_sugar_thms: Proof.context -> gfp_sugar_thms -> gfp_sugar_thms |
|
58 |
||
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
59 |
val mk_co_iters_prelims: BNF_Util.fp_kind -> typ list list list -> typ list -> typ list -> |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
60 |
typ list -> typ list -> int list -> int list list -> term list list -> Proof.context -> |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
61 |
(term list list * (typ list list * typ list list list list * term list list |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
62 |
* term list list list list) option |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
63 |
* (string * term list * term list list |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
64 |
* ((term list list * term list list list) * typ list)) option) |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
65 |
* Proof.context |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
66 |
val repair_nullary_single_ctr: typ list list -> typ list list |
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
67 |
val mk_coiter_p_pred_types: typ list -> int list -> typ list list |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
68 |
val mk_coiter_fun_arg_types: typ list list list -> typ list -> typ list -> typ list -> int list -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
69 |
int list list -> term -> |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
70 |
typ list list |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
71 |
* (typ list list list list * typ list list list * typ list list list list * typ list) |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
72 |
val define_iter: |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
73 |
(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
|
74 |
(string -> binding) -> typ list -> typ list -> term list -> term -> Proof.context -> |
55864 | 75 |
(term * thm) * Proof.context |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
76 |
val define_coiter: 'a * term list * term list list |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
77 |
* ((term list list * term list list list) * typ list) -> (string -> binding) -> 'b list -> |
55864 | 78 |
typ list -> term list -> term -> Proof.context -> (term * thm) * local_theory |
52346 | 79 |
val derive_induct_iters_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
|
80 |
('a * typ list list list list * term list list * 'b) option -> thm -> thm list list -> |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
81 |
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
|
82 |
typ list list list -> thm list -> thm list -> thm list -> term list list -> thm list list -> |
55864 | 83 |
term list -> thm list -> Proof.context -> lfp_sugar_thms |
52346 | 84 |
val derive_coinduct_coiters_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
|
85 |
string * term list * term list list * ((term list list * term list list list) * typ list) -> |
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
86 |
thm -> thm list -> thm list -> thm list 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
|
87 |
typ list -> typ list list list -> int list list -> int list list -> int list -> thm list -> |
55864 | 88 |
thm list -> (thm -> thm) -> thm list list -> Ctr_Sugar.ctr_sugar list -> term list -> |
89 |
thm list -> (thm list -> thm list) -> local_theory -> gfp_sugar_thms |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
90 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
91 |
type co_datatype_spec = |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
92 |
((((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
|
93 |
* ((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
|
94 |
|
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
95 |
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
|
96 |
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
|
97 |
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
|
98 |
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
|
99 |
(bool * bool) * co_datatype_spec list -> |
49297 | 100 |
local_theory -> local_theory |
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
101 |
val parse_co_datatype_cmd: BNF_Util.fp_kind -> (mixfix list -> binding list -> binding list -> |
51867 | 102 |
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
|
103 |
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
|
104 |
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
|
105 |
(local_theory -> local_theory) parser |
49112 | 106 |
end; |
107 |
||
49636 | 108 |
structure BNF_FP_Def_Sugar : BNF_FP_DEF_SUGAR = |
49112 | 109 |
struct |
110 |
||
54006 | 111 |
open Ctr_Sugar |
55571 | 112 |
open BNF_FP_Rec_Sugar_Util |
49119 | 113 |
open BNF_Util |
53222 | 114 |
open BNF_Comp |
49214
2a3cb4c71b87
construct the right iterator theorem in the recursive case
blanchet
parents:
49213
diff
changeset
|
115 |
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
|
116 |
open BNF_FP_Util |
49636 | 117 |
open BNF_FP_Def_Sugar_Tactics |
49119 | 118 |
|
51788 | 119 |
val EqN = "Eq_"; |
51777
48a0ae342ea0
generate proper attributes for coinduction rules
blanchet
parents:
51769
diff
changeset
|
120 |
|
51840 | 121 |
type fp_sugar = |
51859 | 122 |
{T: typ, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
123 |
X: typ, |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
124 |
fp: fp_kind, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
125 |
fp_res_index: int, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
126 |
fp_res: fp_result, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
127 |
pre_bnf: bnf, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
128 |
absT_info: absT_info, |
52356 | 129 |
nested_bnfs: bnf list, |
53267
aad7d276b849
store nesting_bnfs in fp_sugar (required in "nested to mutual" reduction)
traytel
parents:
53266
diff
changeset
|
130 |
nesting_bnfs: bnf list, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
131 |
ctrXs_Tss: typ list list, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
132 |
ctr_defs: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
133 |
ctr_sugar: Ctr_Sugar.ctr_sugar, |
55863 | 134 |
co_rec: term, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
135 |
maps: thm list, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
136 |
common_co_inducts: thm list, |
52343 | 137 |
co_inducts: thm list, |
55863 | 138 |
co_rec_thms: thm list, |
139 |
disc_co_recs: thm list, |
|
140 |
sel_co_recss: thm list list}; |
|
52295 | 141 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
142 |
fun morph_fp_sugar phi ({T, X, fp, fp_res, fp_res_index, pre_bnf, absT_info, nested_bnfs, |
55863 | 143 |
nesting_bnfs, ctrXs_Tss, ctr_defs, ctr_sugar, co_rec, maps, common_co_inducts, co_inducts, |
144 |
co_rec_thms, disc_co_recs, sel_co_recss} : fp_sugar) = |
|
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
145 |
{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
|
146 |
X = Morphism.typ phi X, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
147 |
fp = fp, |
53267
aad7d276b849
store nesting_bnfs in fp_sugar (required in "nested to mutual" reduction)
traytel
parents:
53266
diff
changeset
|
148 |
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
|
149 |
fp_res_index = fp_res_index, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
150 |
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
|
151 |
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
|
152 |
nested_bnfs = map (morph_bnf phi) nested_bnfs, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
153 |
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
|
154 |
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
|
155 |
ctr_defs = map (Morphism.thm phi) ctr_defs, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
156 |
ctr_sugar = morph_ctr_sugar phi ctr_sugar, |
55863 | 157 |
co_rec = Morphism.term phi co_rec, |
55539
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
158 |
maps = map (Morphism.thm phi) maps, |
0819931d652d
simplified data structure by reducing the incidence of clumsy indices
blanchet
parents:
55535
diff
changeset
|
159 |
common_co_inducts = map (Morphism.thm phi) common_co_inducts, |
52343 | 160 |
co_inducts = map (Morphism.thm phi) co_inducts, |
55863 | 161 |
co_rec_thms = map (Morphism.thm phi) co_rec_thms, |
162 |
disc_co_recs = map (Morphism.thm phi) disc_co_recs, |
|
163 |
sel_co_recss = map (map (Morphism.thm phi)) sel_co_recss}; |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
164 |
|
53907 | 165 |
val transfer_fp_sugar = |
54740 | 166 |
morph_fp_sugar o Morphism.transfer_morphism o Proof_Context.theory_of; |
53907 | 167 |
|
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
168 |
structure Data = Generic_Data |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
169 |
( |
51840 | 170 |
type T = fp_sugar Symtab.table; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
171 |
val empty = Symtab.empty; |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
172 |
val extend = I; |
55394
d5ebe055b599
more liberal merging of BNFs and constructor sugar
blanchet
parents:
55356
diff
changeset
|
173 |
fun merge data : T = Symtab.merge (K true) data; |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
174 |
); |
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
175 |
|
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
|
176 |
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
|
177 |
Symtab.lookup (Data.get (Context.Proof ctxt)) |
53907 | 178 |
#> Option.map (transfer_fp_sugar ctxt); |
179 |
||
180 |
fun fp_sugars_of ctxt = |
|
181 |
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
|
182 |
|
53106 | 183 |
fun co_induct_of (i :: _) = i; |
184 |
fun strong_co_induct_of [_, s] = s; |
|
185 |
||
53259 | 186 |
(* TODO: register "sum" and "prod" as datatypes to enable N2M reduction for them *) |
187 |
||
51840 | 188 |
fun register_fp_sugar key fp_sugar = |
54285
578371ba74cc
reverted 3e1d230f1c00 -- pervasiveness is useful, cf. Coinductive_Nat in the AFP
blanchet
parents:
54265
diff
changeset
|
189 |
Local_Theory.declaration {syntax = false, pervasive = true} |
55444
ec73f81e49e7
iteration n in the 'default' vs. 'update_new' vs. 'update' saga -- 'update' makes sense now that we honor the canonical order on 'merge' (as opposed to raising 'DUP')
blanchet
parents:
55414
diff
changeset
|
190 |
(fn phi => Data.map (Symtab.update (key, morph_fp_sugar phi fp_sugar))); |
51823
38996458bc5c
create data structure for storing (co)datatype information
blanchet
parents:
51819
diff
changeset
|
191 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
192 |
fun register_fp_sugars Xs fp pre_bnfs absT_infos nested_bnfs nesting_bnfs (fp_res as {Ts, ...}) |
55863 | 193 |
ctrXs_Tsss ctr_defss ctr_sugars co_recs mapss common_co_inducts co_inductss co_rec_thmss |
194 |
disc_co_recss sel_co_recsss lthy = |
|
51844 | 195 |
(0, lthy) |
51859 | 196 |
|> fold (fn T as Type (s, _) => fn (kk, lthy) => (kk + 1, |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
197 |
register_fp_sugar s {T = T, X = nth Xs kk, fp = fp, fp_res = fp_res, fp_res_index = kk, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
198 |
pre_bnf = nth pre_bnfs kk, absT_info = nth absT_infos kk, nested_bnfs = nested_bnfs, |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
199 |
nesting_bnfs = nesting_bnfs, ctrXs_Tss = nth ctrXs_Tsss kk, ctr_defs = nth ctr_defss kk, |
55863 | 200 |
ctr_sugar = nth ctr_sugars kk, co_rec = nth co_recs kk, maps = nth mapss kk, |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
201 |
common_co_inducts = common_co_inducts, co_inducts = nth co_inductss kk, |
55863 | 202 |
co_rec_thms = nth co_rec_thmss kk, disc_co_recs = nth disc_co_recss kk, |
203 |
sel_co_recss = nth sel_co_recsss kk} |
|
52337 | 204 |
lthy)) Ts |
51824 | 205 |
|> snd; |
206 |
||
55342 | 207 |
(* This function could produce (fairly harmless) clashes in contrived examples (e.g., "x.A", |
208 |
"x.x_A", "y.A"). *) |
|
49622 | 209 |
fun quasi_unambiguous_case_names names = |
210 |
let |
|
211 |
val ps = map (`Long_Name.base_name) names; |
|
212 |
val dups = Library.duplicates (op =) (map fst ps); |
|
213 |
fun underscore s = |
|
214 |
let val ss = space_explode Long_Name.separator s in |
|
215 |
space_implode "_" (drop (length ss - 2) ss) |
|
216 |
end; |
|
217 |
in |
|
218 |
map (fn (base, full) => if member (op =) dups base then underscore full else base) ps |
|
219 |
end; |
|
220 |
||
52355 | 221 |
val id_def = @{thm id_def}; |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
222 |
val mp_conj = @{thm mp_conj}; |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
223 |
|
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
224 |
val fundefcong_attrs = @{attributes [fundef_cong]}; |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
225 |
val nitpicksimp_attrs = @{attributes [nitpick_simp]}; |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
226 |
val code_nitpicksimp_attrs = Code.add_default_eqn_attrib :: nitpicksimp_attrs; |
49300 | 227 |
val simp_attrs = @{attributes [simp]}; |
228 |
||
49297 | 229 |
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
|
230 |
|
52868 | 231 |
fun flat_corec_predss_getterss qss fss = maps (op @) (qss ~~ fss); |
51829 | 232 |
|
52868 | 233 |
fun flat_corec_preds_predsss_gettersss [] [qss] [fss] = flat_corec_predss_getterss qss fss |
234 |
| flat_corec_preds_predsss_gettersss (p :: ps) (qss :: qsss) (fss :: fsss) = |
|
235 |
p :: flat_corec_predss_getterss qss fss @ flat_corec_preds_predsss_gettersss ps qsss fsss; |
|
51829 | 236 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
237 |
fun mk_flip (x, Type (_, [T1, Type (_, [T2, T3])])) = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
238 |
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
|
239 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
240 |
fun flip_rels lthy n thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
241 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
242 |
val Rs = Term.add_vars (prop_of thm) []; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
243 |
val Rs' = rev (drop (length Rs - n) Rs); |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
244 |
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
|
245 |
in |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
246 |
Drule.cterm_instantiate cRs thm |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
247 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
248 |
|
49536 | 249 |
fun mk_ctor_or_dtor get_T Ts t = |
250 |
let val Type (_, Ts0) = get_T (fastype_of t) in |
|
251 |
Term.subst_atomic_types (Ts0 ~~ Ts) t |
|
252 |
end; |
|
253 |
||
254 |
val mk_ctor = mk_ctor_or_dtor range_type; |
|
255 |
val mk_dtor = mk_ctor_or_dtor domain_type; |
|
256 |
||
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
257 |
fun mk_co_iters thy fp fpTs Cs ts0 = |
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
258 |
let |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
259 |
val nn = length fpTs; |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
260 |
val (fpTs0, Cs0) = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
261 |
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
|
262 |
|> split_list; |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
263 |
val rho = tvar_subst thy (fpTs0 @ Cs0) (fpTs @ Cs); |
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
264 |
in |
52170
564be617ae84
generalized "mk_co_iter" to handle mutualized (co)iterators
blanchet
parents:
52169
diff
changeset
|
265 |
map (Term.subst_TVars rho) ts0 |
51911
6c425d450a8c
more robust iterator construction (needed for mutualized FPs)
blanchet
parents:
51910
diff
changeset
|
266 |
end; |
51827 | 267 |
|
55575
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
268 |
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
|
269 |
| 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
|
270 |
| unzip_recT _ T = [T]; |
a5e33e18fb5c
moved 'primrec' up (for real this time) and removed temporary 'old_primrec'
blanchet
parents:
55573
diff
changeset
|
271 |
|
53591 | 272 |
fun unzip_corecT (Type (@{type_name sum}, _)) T = [T] |
53901 | 273 |
| unzip_corecT _ (Type (@{type_name sum}, Ts)) = Ts |
52871 | 274 |
| unzip_corecT _ T = [T]; |
275 |
||
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
276 |
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
|
277 |
(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
|
278 |
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
|
279 |
| _ => replicate n false); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
280 |
|
55700 | 281 |
fun cannot_merge_types fp = |
282 |
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
|
283 |
|
55700 | 284 |
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
|
285 |
|
55700 | 286 |
fun merge_type_args fp (As, As') = |
287 |
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
|
288 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
289 |
fun reassoc_conjs thm = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
290 |
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
|
291 |
handle THM _ => thm; |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
292 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
293 |
type co_datatype_spec = |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
294 |
((((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
|
295 |
* ((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
|
296 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
297 |
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
|
298 |
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
|
299 |
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
|
300 |
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
|
301 |
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
|
302 |
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
|
303 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
304 |
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
|
305 |
let |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
306 |
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
|
307 |
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
|
308 |
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
|
309 |
end |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
310 |
| 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
|
311 |
in snd oo add end; |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
312 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
313 |
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
|
314 |
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
|
315 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
316 |
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
|
317 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
318 |
type lfp_sugar_thms = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
319 |
(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
|
320 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
321 |
fun morph_lfp_sugar_thms phi ((inducts, induct, induct_attrs), (recss, iter_attrs)) = |
54256 | 322 |
((map (Morphism.thm phi) inducts, Morphism.thm phi induct, induct_attrs), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
323 |
(map (map (Morphism.thm phi)) recss, iter_attrs)) |
55095 | 324 |
: lfp_sugar_thms; |
54256 | 325 |
|
326 |
val transfer_lfp_sugar_thms = |
|
54740 | 327 |
morph_lfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of; |
54256 | 328 |
|
53746
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
329 |
type gfp_sugar_thms = |
bd038e48526d
have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet
parents:
53741
diff
changeset
|
330 |
((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
|
331 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
332 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
333 |
* (thm list list * Args.src list) |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
334 |
* (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
|
335 |
|
54256 | 336 |
fun morph_gfp_sugar_thms phi ((coinducts_pairs, coinduct_attrs), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
337 |
(corecss, coiter_attrs), (disc_corecss, disc_iter_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
338 |
(disc_corec_iffss, disc_iter_iff_attrs), (sel_corecsss, sel_iter_attrs)) = |
54256 | 339 |
((map (apfst (map (Morphism.thm phi)) o apsnd (Morphism.thm phi)) coinducts_pairs, |
340 |
coinduct_attrs), |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
341 |
(map (map (Morphism.thm phi)) corecss, coiter_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
342 |
(map (map (Morphism.thm phi)) disc_corecss, disc_iter_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
343 |
(map (map (Morphism.thm phi)) disc_corec_iffss, disc_iter_iff_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
344 |
(map (map (map (Morphism.thm phi))) sel_corecsss, sel_iter_attrs)) : gfp_sugar_thms; |
54256 | 345 |
|
346 |
val transfer_gfp_sugar_thms = |
|
54740 | 347 |
morph_gfp_sugar_thms o Morphism.transfer_morphism o Proof_Context.theory_of; |
54256 | 348 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
349 |
fun mk_iters_args_types ctr_Tsss Cs absTs repTs ns mss ctor_iter_fun_Tss lthy = |
51832 | 350 |
let |
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
351 |
val Css = map2 replicate ns Cs; |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
352 |
val y_Tsss = map5 (fn absT => fn repT => fn n => fn ms => |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
353 |
dest_absumprodT absT repT n ms o domain_type) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
354 |
absTs repTs ns mss (map un_fold_of ctor_iter_fun_Tss); |
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
355 |
val g_Tss = map2 (fn C => map (fn y_Ts => y_Ts ---> C)) Cs y_Tsss; |
51832 | 356 |
|
357 |
val ((gss, ysss), lthy) = |
|
358 |
lthy |
|
359 |
|> mk_Freess "f" g_Tss |
|
360 |
||>> mk_Freesss "x" y_Tsss; |
|
52301
7935e82a4ae4
simpler, more robust iterator goal construction code
blanchet
parents:
52300
diff
changeset
|
361 |
|
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
362 |
val z_Tssss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
363 |
map6 (fn absT => fn repT => fn n => fn ms => fn ctr_Tss => fn ctor_iter_fun_Ts => |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
364 |
map2 (map2 unzip_recT) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
365 |
ctr_Tss (dest_absumprodT absT repT n ms (domain_type (co_rec_of ctor_iter_fun_Ts)))) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
366 |
absTs repTs ns mss ctr_Tsss ctor_iter_fun_Tss; |
51832 | 367 |
|
52868 | 368 |
val z_Tsss' = map (map flat_rec_arg_args) z_Tssss; |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
369 |
val h_Tss = map2 (map2 (curry (op --->))) z_Tsss' Css; |
51832 | 370 |
|
371 |
val hss = map2 (map2 retype_free) h_Tss gss; |
|
52214
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
372 |
val zssss_hd = map2 (map2 (map2 (retype_free o hd))) z_Tssss ysss; |
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
373 |
val (zssss_tl, lthy) = |
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
374 |
lthy |
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
375 |
|> mk_Freessss "y" (map (map (map tl)) z_Tssss); |
4cc5a80bba80
generalized recursors, effectively reverting inductive half of c7a034d01936
blanchet
parents:
52213
diff
changeset
|
376 |
val zssss = map2 (map2 (map2 cons)) zssss_hd zssss_tl; |
51832 | 377 |
in |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
378 |
((h_Tss, z_Tssss, hss, zssss), lthy) |
51832 | 379 |
end; |
380 |
||
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
381 |
(*avoid "'a itself" arguments in coiterators*) |
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
382 |
fun repair_nullary_single_ctr [[]] = [[@{typ unit}]] |
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
383 |
| 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
|
384 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
385 |
fun mk_coiter_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss fun_Ts = |
51829 | 386 |
let |
55772
367ec44763fd
correct most general type for mutual recursion when several identical types are involved
blanchet
parents:
55701
diff
changeset
|
387 |
val ctr_Tsss' = map repair_nullary_single_ctr ctr_Tsss; |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
388 |
val f_absTs = map range_type fun_Ts; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
389 |
val f_Tsss = map repair_nullary_single_ctr (map5 dest_absumprodT absTs repTs ns mss f_absTs); |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
390 |
val f_Tssss = map3 (fn C => map2 (map2 (map (curry (op -->) C) oo unzip_corecT))) |
53591 | 391 |
Cs ctr_Tsss' f_Tsss; |
52871 | 392 |
val q_Tssss = map (map (map (fn [_] => [] | [_, T] => [mk_pred1T (domain_type T)]))) f_Tssss; |
52870 | 393 |
in |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
394 |
(q_Tssss, f_Tsss, f_Tssss, f_absTs) |
52870 | 395 |
end; |
51829 | 396 |
|
52898 | 397 |
fun mk_coiter_p_pred_types Cs ns = map2 (fn n => replicate (Int.max (0, n - 1)) o mk_pred1T) ns Cs; |
398 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
399 |
fun mk_coiter_fun_arg_types ctr_Tsss Cs absTs repTs ns mss dtor_coiter = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
400 |
(mk_coiter_p_pred_types Cs ns, |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
401 |
mk_coiter_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
402 |
(binder_fun_types (fastype_of dtor_coiter))); |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
403 |
|
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
404 |
fun mk_coiters_args_types ctr_Tsss Cs absTs repTs ns mss dtor_coiter_fun_Tss lthy = |
52870 | 405 |
let |
52898 | 406 |
val p_Tss = mk_coiter_p_pred_types Cs ns; |
51829 | 407 |
|
52871 | 408 |
fun mk_types get_Ts = |
51829 | 409 |
let |
52335 | 410 |
val fun_Ts = map get_Ts dtor_coiter_fun_Tss; |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
411 |
val (q_Tssss, f_Tsss, f_Tssss, f_repTs) = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
412 |
mk_coiter_fun_arg_types0 ctr_Tsss Cs absTs repTs ns mss fun_Ts; |
52870 | 413 |
in |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
414 |
(q_Tssss, f_Tsss, f_Tssss, f_repTs) |
52870 | 415 |
end; |
51829 | 416 |
|
52871 | 417 |
val (s_Tssss, h_Tsss, h_Tssss, corec_types) = mk_types co_rec_of; |
51831 | 418 |
|
55858 | 419 |
val (((((Free (z, _), cs), pss), sssss), hssss), lthy) = |
51829 | 420 |
lthy |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
421 |
|> yield_singleton (mk_Frees "z") dummyT |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
422 |
||>> mk_Frees "a" Cs |
51829 | 423 |
||>> mk_Freess "p" p_Tss |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
424 |
||>> mk_Freessss "q" s_Tssss |
55858 | 425 |
||>> mk_Freessss "g" h_Tssss; |
51831 | 426 |
|
427 |
val cpss = map2 (map o rapp) cs pss; |
|
51829 | 428 |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
429 |
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
|
430 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
431 |
fun build_dtor_coiter_arg _ [] [cf] = cf |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
432 |
| build_dtor_coiter_arg T [cq] [cf, cf'] = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
433 |
mk_If cq (build_sum_inj Inl_const (fastype_of cf, T) $ cf) |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
434 |
(build_sum_inj Inr_const (fastype_of cf', T) $ cf'); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
435 |
|
52349 | 436 |
fun mk_args qssss fssss f_Tsss = |
51831 | 437 |
let |
52868 | 438 |
val pfss = map3 flat_corec_preds_predsss_gettersss pss qssss fssss; |
51831 | 439 |
val cqssss = map2 (map o map o map o rapp) cs qssss; |
440 |
val cfssss = map2 (map o map o map o rapp) cs fssss; |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
441 |
val cqfsss = map3 (map3 (map3 build_dtor_coiter_arg)) f_Tsss cqssss cfssss; |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
442 |
in (pfss, cqfsss) end; |
51831 | 443 |
|
52349 | 444 |
val corec_args = mk_args sssss hssss h_Tsss; |
51831 | 445 |
in |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
446 |
((z, cs, cpss, (corec_args, corec_types)), lthy) |
51831 | 447 |
end; |
51829 | 448 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
449 |
fun mk_co_iters_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_iterss0 lthy = |
51903 | 450 |
let |
52169 | 451 |
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
|
452 |
val nn = length fpTs; |
52169 | 453 |
|
52335 | 454 |
val (xtor_co_iter_fun_Tss, xtor_co_iterss) = |
55570 | 455 |
map (mk_co_iters thy fp fpTs Cs #> `(binder_fun_types o fastype_of o hd)) |
456 |
(transpose xtor_co_iterss0) |
|
52335 | 457 |
|> apsnd transpose o apfst transpose o split_list; |
51903 | 458 |
|
52329 | 459 |
val ((iters_args_types, coiters_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 |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
464 |
mk_iters_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_iter_fun_Tss lthy |
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 |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
467 |
mk_coiters_args_types ctr_Tsss Cs absTs repTs ns mss xtor_co_iter_fun_Tss lthy |
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 |
52335 | 470 |
((xtor_co_iterss, iters_args_types, coiters_args_types), lthy') |
51903 | 471 |
end; |
472 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
473 |
fun mk_preds_getterss_join c cps absT abs cqfss = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
474 |
let |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
475 |
val n = length cqfss; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
476 |
val ts = map2 (mk_absumprod absT abs n) (1 upto n) cqfss; |
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 |
|
55864 | 481 |
fun define_co_iter 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 |
||
55864 | 494 |
val cst' = mk_co_iter thy fp fpT Cs (Morphism.term phi cst); |
495 |
val def' = Morphism.thm phi def; |
|
52327 | 496 |
in |
55864 | 497 |
((cst', def'), lthy') |
52327 | 498 |
end; |
499 |
||
55864 | 500 |
fun define_iter NONE _ _ _ _ _ = pair (Term.dummy, refl) |
501 |
| define_iter (SOME (_, _, fss, xssss)) mk_binding fpTs Cs reps ctor_iter = |
|
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; |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
504 |
val (ctor_iter_absTs, fpT) = strip_typeN nn (fastype_of ctor_iter) |
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 |
507 |
define_co_iter Least_FP fpT Cs (mk_binding recN) |
|
508 |
(fold_rev (fold_rev Term.lambda) fss (Term.list_comb (ctor_iter, |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
509 |
map4 (fn ctor_iter_absT => fn rep => fn fs => fn xsss => |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
510 |
mk_case_absumprod ctor_iter_absT rep fs |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
511 |
(map (HOLogic.mk_tuple o map HOLogic.mk_tuple) xsss) (map flat_rec_arg_args xsss)) |
55864 | 512 |
ctor_iter_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 |
|
55864 | 515 |
fun define_coiter (_, cs, cpss, ((pfss, cqfsss), f_absTs)) mk_binding fpTs Cs abss dtor_coiter = |
51897 | 516 |
let |
51899 | 517 |
val nn = length fpTs; |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
518 |
val fpT = range_type (snd (strip_typeN nn (fastype_of dtor_coiter))); |
51897 | 519 |
in |
55864 | 520 |
define_co_iter Greatest_FP fpT Cs (mk_binding corecN) |
521 |
(fold_rev (fold_rev Term.lambda) pfss (Term.list_comb (dtor_coiter, |
|
522 |
map5 mk_preds_getterss_join cs cpss f_absTs abss cqfsss))) |
|
52320 | 523 |
end; |
51897 | 524 |
|
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
525 |
fun derive_induct_iters_thms_for_types pre_bnfs rec_args_typess ctor_induct ctor_iter_thmss |
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 |
||
52306 | 638 |
fun mk_iter_thmss (_, x_Tssss, fss, _) iters iter_defs ctor_iter_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 |
52305 | 640 |
val fiters = map (lists_bmoc fss) iters; |
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 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
642 |
fun mk_goal fss fiter 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) |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
644 |
(mk_Trueprop_eq (fiter $ 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 |
|
52368 | 652 |
fun build_iter (x as Free (_, T)) U = |
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 |
52368 | 657 |
(fn kk => fn TU => maybe_tick TU (nth us kk) (nth fiters kk))) (T, U) $ x; |
52301
7935e82a4ae4
simpler, more robust iterator goal construction code
blanchet
parents:
52300
diff
changeset
|
658 |
|
52868 | 659 |
val fxsss = map2 (map2 (flat_rec_arg_args oo map2 (map o build_iter))) xsss x_Tssss; |
51808
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
660 |
|
52306 | 661 |
val goalss = map5 (map4 o mk_goal fss) fiters 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
|
662 |
|
52305 | 663 |
val tacss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
664 |
map4 (map ooo mk_iter_tac pre_map_defs (nested_map_idents @ nesting_map_idents) iter_defs) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
665 |
ctor_iter_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
|
666 |
|
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
667 |
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
|
668 |
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
|
669 |
|> 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
|
670 |
in |
52305 | 671 |
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
|
672 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
673 |
|
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
674 |
val rec_thmss = |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
675 |
(case rec_args_typess of |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
676 |
SOME types => |
55864 | 677 |
mk_iter_thmss types recs rec_defs (map co_rec_of ctor_iter_thmss) |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
678 |
| 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
|
679 |
in |
52345 | 680 |
((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
|
681 |
(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
|
682 |
end; |
355dcd6a9b3c
factored out derivation of induction principles, folds and recs, in preparation for reduction of nested to mutual
blanchet
parents:
51805
diff
changeset
|
683 |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
684 |
fun derive_coinduct_coiters_thms_for_types pre_bnfs (z, cs, cpss, |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
685 |
coiters_args_types as ((phss, cshsss), _)) |
54235 | 686 |
dtor_coinduct dtor_injects dtor_ctors dtor_coiter_thmss 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
|
687 |
mss ns fp_abs_inverses abs_inverses mk_vimage2p ctr_defss (ctr_sugars : ctr_sugar list) |
55864 | 688 |
corecs corec_defs export_args lthy = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
689 |
let |
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
690 |
fun mk_ctor_dtor_coiter_thm dtor_inject dtor_ctor coiter = |
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
691 |
iffD1 OF [dtor_inject, trans OF [coiter, dtor_ctor RS sym]]; |
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
692 |
|
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
693 |
val ctor_dtor_coiter_thmss = |
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
694 |
map3 (map oo mk_ctor_dtor_coiter_thm) dtor_injects dtor_ctors dtor_coiter_thmss; |
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
695 |
|
51815 | 696 |
val nn = length pre_bnfs; |
697 |
||
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
698 |
val pre_map_defs = map map_def_of_bnf pre_bnfs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
699 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
53329 | 700 |
val nesting_map_idents = map (unfold_thms lthy [id_def] o map_id0_of_bnf) nesting_bnfs; |
51830 | 701 |
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
|
702 |
|
51816 | 703 |
val fp_b_names = map base_name_of_typ fpTs; |
51811 | 704 |
|
53210
7219c61796c0
simplify code (now that ctr_sugar uses the same type variables as fp_sugar)
blanchet
parents:
53203
diff
changeset
|
705 |
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
|
706 |
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
|
707 |
val selsss = map #selss ctr_sugars; |
51840 | 708 |
val exhausts = map #exhaust ctr_sugars; |
709 |
val disc_thmsss = map #disc_thmss ctr_sugars; |
|
710 |
val discIss = map #discIs ctr_sugars; |
|
711 |
val sel_thmsss = map #sel_thmss ctr_sugars; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
712 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
713 |
val (((rs, us'), vs'), names_lthy) = |
52341 | 714 |
lthy |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
715 |
|> mk_Frees "R" (map (fn T => mk_pred2T T T) fpTs) |
51816 | 716 |
||>> Variable.variant_fixes fp_b_names |
717 |
||>> Variable.variant_fixes (map (suffix "'") fp_b_names); |
|
51810
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 us = map2 (curry Free) us' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
720 |
val udiscss = map2 (map o rapp) us discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
721 |
val uselsss = map2 (map o map o rapp) us selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
722 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
723 |
val vs = map2 (curry Free) vs' fpTs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
724 |
val vdiscss = map2 (map o rapp) vs discss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
725 |
val vselsss = map2 (map o map o rapp) vs selsss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
726 |
|
52345 | 727 |
val coinduct_thms_pairs = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
728 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
729 |
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
|
730 |
val uv_eqs = map2 (curry HOLogic.mk_eq) us vs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
731 |
val strong_rs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
732 |
map4 (fn u => fn v => fn uvr => fn uv_eq => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
733 |
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
|
734 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
735 |
fun build_the_rel rs' T Xs_T = |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
736 |
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
|
737 |
|> Term.subst_atomic_types (Xs ~~ fpTs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
738 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
739 |
fun build_rel_app rs' usel vsel Xs_T = |
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
740 |
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
|
741 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
742 |
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
|
743 |
(if k = n then [] else [HOLogic.mk_eq (udisc, vdisc)]) @ |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
744 |
(if null usels then |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
745 |
[] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
746 |
else |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
747 |
[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
|
748 |
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
|
749 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
750 |
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
|
751 |
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
|
752 |
(1 upto n) udiscs uselss vdiscs vselss ctrXs_Tss)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
753 |
handle List.Empty => @{term True}; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
754 |
|
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
755 |
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
|
756 |
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
|
757 |
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
|
758 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
759 |
val concl = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
760 |
HOLogic.mk_Trueprop (Library.foldr1 HOLogic.mk_conj |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
761 |
(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
|
762 |
uvrs us vs)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
763 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
764 |
fun mk_goal rs' = |
54237
7cc6e286fe28
made sugared 'coinduct' theorem construction n2m-proof
blanchet
parents:
54236
diff
changeset
|
765 |
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
|
766 |
ctrXs_Tsss, concl); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
767 |
|
52345 | 768 |
val goals = map mk_goal [rs, strong_rs]; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
769 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
770 |
fun prove dtor_coinduct' goal = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
771 |
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
|
772 |
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
|
773 |
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
|
774 |
|> singleton (Proof_Context.export names_lthy lthy) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
775 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
776 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
777 |
fun postproc nn thm = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
778 |
Thm.permute_prems 0 nn |
51828 | 779 |
(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
|
780 |
|> Drule.zero_var_indexes |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
781 |
|> `(conj_dests nn); |
53106 | 782 |
|
783 |
val rel_eqs = map rel_eq_of_bnf pre_bnfs; |
|
784 |
val rel_monos = map rel_mono_of_bnf pre_bnfs; |
|
785 |
val dtor_coinducts = |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
786 |
[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
|
787 |
in |
52345 | 788 |
map2 (postproc nn oo prove) dtor_coinducts goals |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
789 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
790 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
791 |
fun mk_coinduct_concls ms discs ctrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
792 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
793 |
fun mk_disc_concl disc = [name_of_disc disc]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
794 |
fun mk_ctr_concl 0 _ = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
795 |
| mk_ctr_concl _ ctor = [name_of_ctr ctor]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
796 |
val disc_concls = map mk_disc_concl (fst (split_last discs)) @ [[]]; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
797 |
val ctr_concls = map2 mk_ctr_concl ms ctrs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
798 |
in |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
799 |
flat (map2 append disc_concls ctr_concls) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
800 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
801 |
|
51816 | 802 |
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
|
803 |
val coinduct_conclss = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
804 |
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
|
805 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
806 |
fun mk_maybe_not pos = not pos ? HOLogic.mk_not; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
807 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
808 |
val fcoiterss' as [hcorecs] = |
55864 | 809 |
map2 (fn (pfss, _) => map (lists_bmoc pfss)) [fst coiters_args_types] [corecs]; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
810 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
811 |
val corec_thmss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
812 |
let |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
813 |
fun mk_goal pfss c cps fcoiter n k ctr m cfs' = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
814 |
fold_rev (fold_rev Logic.all) ([c] :: pfss) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
815 |
(Logic.list_implies (seq_conds (HOLogic.mk_Trueprop oo mk_maybe_not) n k cps, |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
816 |
mk_Trueprop_eq (fcoiter $ c, Term.list_comb (ctr, take m cfs')))); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
817 |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
818 |
fun mk_U maybe_mk_sumT = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
819 |
typ_subst_nonatomic (map2 (fn C => fn fpT => (maybe_mk_sumT fpT C, fpT)) Cs fpTs); |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
820 |
|
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
821 |
fun tack z_name (c, u) f = |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
822 |
let val z = Free (z_name, mk_sumT (fastype_of u, fastype_of c)) in |
55414
eab03e9cee8a
renamed '{prod,sum,bool,unit}_case' to 'case_...'
blanchet
parents:
55410
diff
changeset
|
823 |
Term.lambda z (mk_case_sum (Term.lambda u u, Term.lambda c (f $ c)) $ z) |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
824 |
end; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
825 |
|
52368 | 826 |
fun build_coiter fcoiters maybe_mk_sumT maybe_tack cqf = |
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
827 |
let val T = fastype_of cqf in |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
828 |
if exists_subtype_in Cs T then |
52368 | 829 |
let val U = mk_U maybe_mk_sumT T in |
55483
f223445a4d0c
tuned code to allow mutualized corecursion through different functions with the same target type
blanchet
parents:
55480
diff
changeset
|
830 |
build_map lthy (indexify fst (map2 maybe_mk_sumT fpTs Cs) (fn kk => fn _ => |
52368 | 831 |
maybe_tack (nth cs kk, nth us kk) (nth fcoiters kk))) (T, U) $ cqf |
832 |
end |
|
52347
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
833 |
else |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
834 |
cqf |
ead18e3b2c1b
changed back type of corecursor for nested case, effectively reverting aa66ea552357 and 78a3d5006cf1
blanchet
parents:
52346
diff
changeset
|
835 |
end; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
836 |
|
52368 | 837 |
val cshsss' = map (map (map (build_coiter (co_rec_of fcoiterss') (curry mk_sumT) (tack z)))) |
52351 | 838 |
cshsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
839 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
840 |
val goalss = map8 (map4 oooo mk_goal phss) cs cpss hcorecs ns kss ctrss mss cshsss'; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
841 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
842 |
val tacss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
843 |
map4 (map ooo mk_coiter_tac corec_defs nesting_map_idents) |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
844 |
(map co_rec_of ctor_dtor_coiter_thmss) pre_map_defs abs_inverses ctr_defss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
845 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
846 |
fun prove goal tac = |
51815 | 847 |
Goal.prove_sorry lthy [] [] goal (tac o #context) |
848 |
|> Thm.close_derivation; |
|
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
849 |
in |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
850 |
map2 (map2 prove) goalss tacss |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
851 |
|> map (map (unfold_thms lthy @{thms case_sum_if})) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
852 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
853 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
854 |
val disc_corec_iff_thmss = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
855 |
let |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
856 |
fun mk_goal c cps fcoiter n k disc = |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
857 |
mk_Trueprop_eq (disc $ (fcoiter $ c), |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
858 |
if n = 1 then @{const True} |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
859 |
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
|
860 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
861 |
val goalss = map6 (map2 oooo mk_goal) cs cpss hcorecs ns kss discss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
862 |
|
51828 | 863 |
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
|
864 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
865 |
val case_splitss' = map (map mk_case_split') cpss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
866 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
867 |
val tacss = map3 (map oo mk_disc_coiter_iff_tac) case_splitss' corec_thmss disc_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
868 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
869 |
fun prove goal tac = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
870 |
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
|
871 |
|> singleton export_args |
51829 | 872 |
|> singleton (Proof_Context.export names_lthy lthy) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
873 |
|> Thm.close_derivation; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
874 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
875 |
fun proves [_] [_] = [] |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
876 |
| proves goals tacs = map2 prove goals tacs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
877 |
in |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
878 |
map2 proves goalss tacss |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
879 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
880 |
|
53741
c9068aade859
killed exceptional code that is anyway no longer needed, now that the 'simp' attribute has been taken away -- this solves issues in 'primcorec'
blanchet
parents:
53701
diff
changeset
|
881 |
fun mk_disc_coiter_thms coiters discIs = map (op RS) (coiters ~~ discIs); |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
882 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
883 |
val disc_corec_thmss = map2 mk_disc_coiter_thms corec_thmss discIss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
884 |
|
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
885 |
fun mk_sel_coiter_thm coiter_thm sel sel_thm = |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
886 |
let |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
887 |
val (domT, ranT) = dest_funT (fastype_of sel); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
888 |
val arg_cong' = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
889 |
Drule.instantiate' (map (SOME o certifyT lthy) [domT, ranT]) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
890 |
[NONE, NONE, SOME (certify lthy sel)] arg_cong |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
891 |
|> Thm.varifyT_global; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
892 |
val sel_thm' = sel_thm RSN (2, trans); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
893 |
in |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
894 |
coiter_thm RS arg_cong' RS sel_thm' |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
895 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
896 |
|
52321 | 897 |
fun mk_sel_coiter_thms coiter_thmss = |
53475 | 898 |
map3 (map3 (map2 o mk_sel_coiter_thm)) coiter_thmss selsss sel_thmsss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
899 |
|
53475 | 900 |
val sel_corec_thmsss = mk_sel_coiter_thms corec_thmss; |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
901 |
|
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
902 |
val coinduct_consumes_attr = Attrib.internal (K (Rule_Cases.consumes nn)); |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
903 |
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
|
904 |
val coinduct_case_concl_attrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
905 |
map2 (fn casex => fn concls => |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
906 |
Attrib.internal (K (Rule_Cases.case_conclusion (casex, concls)))) |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
907 |
coinduct_cases coinduct_conclss; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
908 |
val coinduct_case_attrs = |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
909 |
coinduct_consumes_attr :: coinduct_case_names_attr :: coinduct_case_concl_attrs; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
910 |
in |
52345 | 911 |
((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
|
912 |
(corec_thmss, code_nitpicksimp_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
913 |
(disc_corec_thmss, []), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
914 |
(disc_corec_iff_thmss, simp_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
915 |
(sel_corec_thmsss, simp_attrs)) |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
916 |
end; |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
917 |
|
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
918 |
fun define_co_datatypes prepare_constraint prepare_typ prepare_term fp construct_fp |
55410 | 919 |
(wrap_opts as (no_discs_sels, _), specs) no_defs_lthy0 = |
49112 | 920 |
let |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
921 |
(* TODO: sanity checks on arguments *) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
922 |
|
52969
f2df0730f8ac
clarified option name (since case/fold/rec are also destructors)
blanchet
parents:
52968
diff
changeset
|
923 |
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
|
924 |
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
|
925 |
else |
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
926 |
(); |
49278 | 927 |
|
49367 | 928 |
val nn = length specs; |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
929 |
val fp_bs = map type_binding_of_spec specs; |
49498 | 930 |
val fp_b_names = map Binding.name_of fp_bs; |
931 |
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
|
932 |
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
|
933 |
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
|
934 |
|
51758 | 935 |
fun prepare_type_arg (_, (ty, c)) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
936 |
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
|
937 |
TFree (s, prepare_constraint no_defs_lthy0 c) |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
938 |
end; |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
939 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
940 |
val Ass0 = map (map prepare_type_arg o type_args_named_constrained_of_spec) specs; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
941 |
val unsorted_Ass0 = map (map (resort_tfree HOLogic.typeS)) Ass0; |
55700 | 942 |
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
|
943 |
val num_As = length unsorted_As; |
55699
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
944 |
|
1f9cc432ecd4
reuse same parser for '(co)datatype(_new)' as for 'bnf_decl'
blanchet
parents:
55575
diff
changeset
|
945 |
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
|
946 |
val set_bss = map (map (the_default Binding.empty)) set_boss; |
49119 | 947 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
948 |
val (((Bs0, Cs), Xs), no_defs_lthy) = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
949 |
no_defs_lthy0 |
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
950 |
|> 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
|
951 |
|> mk_TFrees num_As |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
952 |
||>> mk_TFrees nn |
51858
7a08fe1e19b1
added and moved library functions (used in primrec code)
blanchet
parents:
51857
diff
changeset
|
953 |
||>> variant_tfrees fp_b_names; |
49119 | 954 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
955 |
fun add_fake_type spec = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
956 |
Typedecl.basic_typedecl (type_binding_of_spec spec, num_As, mixfix_of_spec spec); |
51768 | 957 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
958 |
val (fake_T_names, fake_lthy) = fold_map add_fake_type specs no_defs_lthy0; |
49119 | 959 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
960 |
val qsoty = quote o Syntax.string_of_typ fake_lthy; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
961 |
|
54253 | 962 |
val _ = (case Library.duplicates (op =) unsorted_As of [] => () |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
963 |
| A :: _ => error ("Duplicate type parameter " ^ qsoty A ^ " in " ^ co_prefix fp ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
964 |
"datatype specification")); |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
965 |
|
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
966 |
val bad_args = |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
967 |
map (Logic.type_map (singleton (Variable.polymorphic no_defs_lthy0))) unsorted_As |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
968 |
|> filter_out Term.is_TVar; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
969 |
val _ = null bad_args orelse |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
970 |
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
|
971 |
"datatype specification"); |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
972 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
973 |
val mixfixes = map mixfix_of_spec specs; |
49119 | 974 |
|
54253 | 975 |
val _ = (case Library.duplicates Binding.eq_name fp_bs of [] => () |
49119 | 976 |
| b :: _ => error ("Duplicate type name declaration " ^ quote (Binding.name_of b))); |
977 |
||
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
978 |
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
|
979 |
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
|
980 |
val ctr_mixfixess = map (map snd) mx_ctr_specss; |
49119 | 981 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
982 |
val disc_bindingss = map (map disc_of_ctr_spec) ctr_specss; |
49336 | 983 |
val ctr_bindingss = |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
984 |
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
|
985 |
ctr_specss; |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
986 |
val ctr_argsss = map (map args_of_ctr_spec) ctr_specss; |
49119 | 987 |
|
49336 | 988 |
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
|
989 |
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
|
990 |
val raw_sel_defaultsss = map (map sel_defaults_of_ctr_spec) ctr_specss; |
49286 | 991 |
|
49308
6190b701e4f4
reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping
blanchet
parents:
49302
diff
changeset
|
992 |
val (As :: _) :: fake_ctr_Tsss = |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
993 |
burrow (burrow (Syntax.check_typs fake_lthy)) (Ass0 :: fake_ctr_Tsss0); |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
994 |
val As' = map dest_TFree As; |
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
995 |
|
49183
0cc46e2dee7e
careful about constructor types w.r.t. fake context (third step of localization)
blanchet
parents:
49182
diff
changeset
|
996 |
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
|
997 |
val _ = (case subtract (op =) As' rhs_As' of [] => () |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
998 |
| extras => error ("Extra type variables on right-hand side: " ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
999 |
commas (map (qsoty o TFree) extras))); |
49165 | 1000 |
|
53268
de1dc709f9d4
handle type class annotations on (co)datatype parameters gracefully
blanchet
parents:
53266
diff
changeset
|
1001 |
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
|
1002 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1003 |
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
|
1004 |
s = s' andalso (Ts = Ts' orelse |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1005 |
error ("Wrong type arguments in " ^ co_prefix fp ^ "recursive type " ^ qsoty T ^ |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1006 |
" (expected " ^ qsoty T' ^ ")")) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1007 |
| eq_fpT_check _ _ = false; |
49146 | 1008 |
|
53222 | 1009 |
fun freeze_fp (T as Type (s, Ts)) = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1010 |
(case find_index (eq_fpT_check T) fake_Ts of |
53222 | 1011 |
~1 => Type (s, map freeze_fp Ts) |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1012 |
| kk => nth Xs kk) |
49204 | 1013 |
| freeze_fp T = T; |
49121 | 1014 |
|
53222 | 1015 |
val unfreeze_fp = Term.typ_subst_atomic (Xs ~~ fake_Ts); |
1016 |
||
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
|
1017 |
val ctrXs_Tsss = map (map (map freeze_fp)) fake_ctr_Tsss; |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1018 |
val ctrXs_repTs = map (mk_sumTN_balanced o map HOLogic.mk_tupleT) ctrXs_Tsss; |
49119 | 1019 |
|
49298
36e551d3af3b
support for sort constraints in new (co)data commands
blanchet
parents:
49297
diff
changeset
|
1020 |
val fp_eqs = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1021 |
map dest_TFree Xs ~~ map (Term.typ_subst_atomic (As ~~ unsorted_As)) ctrXs_repTs; |
49121 | 1022 |
|
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1023 |
val rhsXs_As' = fold (fold (fold Term.add_tfreesT)) ctrXs_Tsss []; |
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1024 |
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
|
1025 |
| 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
|
1026 |
co_prefix fp ^ "datatype definition: " ^ qsoty (TFree extra))) extras); |
53262
23927b18dce2
rationalize message generation + added a warning
blanchet
parents:
53260
diff
changeset
|
1027 |
|
55701 | 1028 |
val killed_As = |
1029 |
map_filter (fn (A, set_bos) => if exists is_none set_bos then SOME A else NONE) |
|
1030 |
(unsorted_As ~~ transpose set_boss); |
|
1031 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1032 |
val ((pre_bnfs, absT_infos), (fp_res as {bnfs = fp_bnfs as any_fp_bnf :: _, ctors = ctors0, |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1033 |
dtors = dtors0, xtor_co_iterss = xtor_co_iterss0, xtor_co_induct, dtor_ctors, |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1034 |
ctor_dtors, ctor_injects, dtor_injects, xtor_map_thms, xtor_set_thmss, xtor_rel_thms, |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1035 |
xtor_co_iter_thmss, ...}, |
53203
222ea6acbdd6
moved derivation of ctor_dtor_unfold to sugar (streamlines fp_result interface)
traytel
parents:
53143
diff
changeset
|
1036 |
lthy)) = |
55701 | 1037 |
fp_bnf (construct_fp mixfixes map_bs rel_bs set_bss) fp_bs (map dest_TFree unsorted_As) |
1038 |
(map dest_TFree killed_As) fp_eqs no_defs_lthy0 |
|
53222 | 1039 |
handle BAD_DEAD (X, X_backdrop) => |
1040 |
(case X_backdrop of |
|
1041 |
Type (bad_tc, _) => |
|
1042 |
let |
|
1043 |
val fake_T = qsoty (unfreeze_fp X); |
|
1044 |
val fake_T_backdrop = qsoty (unfreeze_fp X_backdrop); |
|
1045 |
fun register_hint () = |
|
1046 |
"\nUse the " ^ quote (fst (fst @{command_spec "bnf"})) ^ " command to register " ^ |
|
1047 |
quote bad_tc ^ " as a bounded natural functor to allow nested (co)recursion through \ |
|
1048 |
\it"; |
|
1049 |
in |
|
1050 |
if is_some (bnf_of no_defs_lthy bad_tc) orelse |
|
1051 |
is_some (fp_sugar_of no_defs_lthy bad_tc) then |
|
53256 | 1052 |
error ("Inadmissible " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
1053 |
" in type expression " ^ fake_T_backdrop) |
|
53222 | 1054 |
else if is_some (Datatype_Data.get_info (Proof_Context.theory_of no_defs_lthy) |
1055 |
bad_tc) then |
|
1056 |
error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
|
1057 |
" via the old-style datatype " ^ quote bad_tc ^ " in type expression " ^ |
|
1058 |
fake_T_backdrop ^ register_hint ()) |
|
1059 |
else |
|
1060 |
error ("Unsupported " ^ co_prefix fp ^ "recursive occurrence of type " ^ fake_T ^ |
|
1061 |
" via type constructor " ^ quote bad_tc ^ " in type expression " ^ fake_T_backdrop ^ |
|
1062 |
register_hint ()) |
|
1063 |
end); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1064 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1065 |
val abss = map #abs absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1066 |
val reps = map #rep absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1067 |
val absTs = map #absT absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1068 |
val repTs = map #repT absT_infos; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1069 |
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
|
1070 |
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
|
1071 |
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
|
1072 |
|
53143
ba80154a1118
configuration option to control timing output for (co)datatypes
traytel
parents:
53126
diff
changeset
|
1073 |
val time = time lthy; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1074 |
val timer = time (Timer.startRealTimer ()); |
49121 | 1075 |
|
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
|
1076 |
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
|
1077 |
val nested_bnfs = nesty_bnfs lthy ctrXs_Tsss Xs; |
49226 | 1078 |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1079 |
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
|
1080 |
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
|
1081 |
val pre_rel_defs = map rel_def_of_bnf pre_bnfs; |
53290 | 1082 |
val nesting_set_maps = maps set_map_of_bnf nesting_bnfs; |
1083 |
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
|
1084 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1085 |
val live = live_of_bnf any_fp_bnf; |
52961 | 1086 |
val _ = |
1087 |
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
|
1088 |
warning "Map function and relator names ignored" |
52961 | 1089 |
else |
1090 |
(); |
|
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1091 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1092 |
val Bs = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1093 |
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
|
1094 |
(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
|
1095 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1096 |
val B_ify = Term.typ_subst_atomic (As ~~ Bs); |
49167 | 1097 |
|
49501 | 1098 |
val ctors = map (mk_ctor As) ctors0; |
1099 |
val dtors = map (mk_dtor As) dtors0; |
|
49124 | 1100 |
|
49501 | 1101 |
val fpTs = map (domain_type o fastype_of) dtors; |
49362
1271aca16aed
make tactic more robust in the case where "asm_simp_tac" already finishes the job
blanchet
parents:
49361
diff
changeset
|
1102 |
|
51780 | 1103 |
fun massage_simple_notes base = |
1104 |
filter_out (null o #2) |
|
1105 |
#> map (fn (thmN, thms, attrs) => |
|
55410 | 1106 |
((Binding.qualify true base (Binding.name thmN), attrs), [(thms, [])])); |
51780 | 1107 |
|
1108 |
val massage_multi_notes = |
|
1109 |
maps (fn (thmN, thmss, attrs) => |
|
53792 | 1110 |
map3 (fn fp_b_name => fn Type (T_name, _) => fn thms => |
55410 | 1111 |
((Binding.qualify true fp_b_name (Binding.name thmN), attrs T_name), [(thms, [])])) |
53792 | 1112 |
fp_b_names fpTs thmss) |
1113 |
#> filter_out (null o fst o hd o snd); |
|
51780 | 1114 |
|
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
|
1115 |
val ctr_Tsss = map (map (map (Term.typ_subst_atomic (Xs ~~ fpTs)))) ctrXs_Tsss; |
49203 | 1116 |
val ns = map length ctr_Tsss; |
49212 | 1117 |
val kss = map (fn n => 1 upto n) ns; |
49203 | 1118 |
val mss = map (map length) ctr_Tsss; |
1119 |
||
52367 | 1120 |
val ((xtor_co_iterss, iters_args_types, coiters_args_types), lthy') = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1121 |
mk_co_iters_prelims fp ctr_Tsss fpTs Cs absTs repTs ns mss xtor_co_iterss0 lthy; |
49210 | 1122 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1123 |
fun define_ctrs_dtrs_for_type (((((((((((((((((((((((((((fp_bnf, fp_b), fpT), ctor), dtor), |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1124 |
xtor_co_iters), ctor_dtor), dtor_ctor), ctor_inject), pre_map_def), pre_set_defs), |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1125 |
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
|
1126 |
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
|
1127 |
disc_bindings), sel_bindingss), raw_sel_defaultss) no_defs_lthy = |
49176 | 1128 |
let |
49498 | 1129 |
val fp_b_name = Binding.name_of fp_b; |
1130 |
||
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1131 |
val ctr_absT = domain_type (fastype_of ctor); |
49119 | 1132 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1133 |
val ((((w, xss), yss), u'), names_lthy) = |
49204 | 1134 |
no_defs_lthy |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1135 |
|> yield_singleton (mk_Frees "w") ctr_absT |
49370 | 1136 |
||>> mk_Freess "x" ctr_Tss |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1137 |
||>> mk_Freess "y" (map (map B_ify) ctr_Tss) |
49498 | 1138 |
||>> yield_singleton Variable.variant_fixes fp_b_name; |
49370 | 1139 |
|
49498 | 1140 |
val u = Free (u', fpT); |
49121 | 1141 |
|
49129 | 1142 |
val ctr_rhss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1143 |
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
|
1144 |
ks xss; |
49121 | 1145 |
|
53569
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1146 |
val maybe_conceal_def_binding = Thm.def_binding |
b4db0ade27bd
conceal definitions of high-level constructors and (co)iterators
traytel
parents:
53553
diff
changeset
|
1147 |
#> 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
|
1148 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1149 |
val ((raw_ctrs, raw_ctr_defs), (lthy', lthy)) = no_defs_lthy |
49169 | 1150 |
|> 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
|
1151 |
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
|
1152 |
ctr_bindings ctr_mixfixes ctr_rhss |
49121 | 1153 |
||> `Local_Theory.restore; |
1154 |
||
1155 |
val phi = Proof_Context.export_morphism lthy lthy'; |
|
1156 |
||
1157 |
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
|
1158 |
val ctr_defs' = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1159 |
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
|
1160 |
|
49203 | 1161 |
val ctrs0 = map (Morphism.term phi) raw_ctrs; |
1162 |
val ctrs = map (mk_ctr As) ctrs0; |
|
49121 | 1163 |
|
51897 | 1164 |
fun wrap_ctrs lthy = |
49123
263b0e330d8b
more work on sugar + simplify Trueprop + eq idiom everywhere
blanchet
parents:
49121
diff
changeset
|
1165 |
let |
50170 | 1166 |
fun exhaust_tac {context = ctxt, prems = _} = |
49135 | 1167 |
let |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1168 |
val ctor_iff_dtor_thm = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1169 |
let |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1170 |
val goal = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1171 |
fold_rev Logic.all [w, u] |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1172 |
(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
|
1173 |
in |
51551 | 1174 |
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
|
1175 |
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
|
1176 |
(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
|
1177 |
|> Morphism.thm phi |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1178 |
|> Thm.close_derivation |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1179 |
end; |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1180 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1181 |
val sumEN_thm' = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1182 |
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
|
1183 |
|> Morphism.thm phi; |
49135 | 1184 |
in |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1185 |
mk_exhaust_tac ctxt n ctr_defs ctor_iff_dtor_thm sumEN_thm' |
49135 | 1186 |
end; |
1187 |
||
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1188 |
val inject_tacss = |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1189 |
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
|
1190 |
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
|
1191 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1192 |
val half_distinct_tacss = |
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1193 |
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
|
1194 |
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
|
1195 |
(mk_half_pairss (`I ctr_defs)); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1196 |
|
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1197 |
val tacss = [exhaust_tac] :: inject_tacss @ half_distinct_tacss; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1198 |
|
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1199 |
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
|
1200 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1201 |
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
|
1202 |
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
|
1203 |
in |
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1204 |
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
|
1205 |
end; |
49121 | 1206 |
|
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
1207 |
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
|
1208 |
if live = 0 then |
51840 | 1209 |
((([], [], [], []), ctr_sugar), lthy) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1210 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1211 |
let |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1212 |
val rel_flip = rel_flip_of_bnf fp_bnf; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1213 |
val nones = replicate live NONE; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1214 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1215 |
val ctor_cong = |
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1216 |
if fp = Least_FP then |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1217 |
Drule.dummy_thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1218 |
else |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1219 |
let val ctor' = mk_ctor Bs ctor in |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1220 |
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
|
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 |
fun mk_cIn ctor k xs = |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1224 |
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
|
1225 |
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
|
1226 |
|> fp = Greatest_FP ? curry (op $) ctor |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1227 |
|> certify lthy |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1228 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1229 |
|
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1230 |
val cxIns = map2 (mk_cIn ctor) ks xss; |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1231 |
val cyIns = map2 (mk_cIn (map_types B_ify ctor)) ks yss; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1232 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1233 |
fun mk_map_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1234 |
fold_thms lthy [ctr_def'] |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1235 |
(unfold_thms lthy (o_apply :: pre_map_def :: |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1236 |
(if fp = Least_FP then [] else [ctor_dtor, dtor_ctor]) @ sum_prod_thms_map @ |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1237 |
abs_inverses) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1238 |
(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
|
1239 |
(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
|
1240 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1241 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1242 |
fun mk_set_thm fp_set_thm ctr_def' cxIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1243 |
fold_thms lthy [ctr_def'] |
53290 | 1244 |
(unfold_thms lthy (pre_set_defs @ nested_set_maps @ nesting_set_maps @ |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1245 |
(if fp = Least_FP then [] else [dtor_ctor]) @ sum_prod_thms_set @ |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1246 |
abs_inverses) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1247 |
(cterm_instantiate_pos [SOME cxIn] fp_set_thm)) |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1248 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1249 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1250 |
fun mk_set_thms fp_set_thm = map2 (mk_set_thm fp_set_thm) ctr_defs' cxIns; |
49127 | 1251 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1252 |
val map_thms = map2 mk_map_thm ctr_defs' cxIns; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1253 |
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
|
1254 |
val set_thms = flat set_thmss; |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1255 |
|
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1256 |
val rel_infos = (ctr_defs' ~~ cxIns, ctr_defs' ~~ cyIns); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1257 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1258 |
fun mk_rel_thm postproc ctr_defs' cxIn cyIn = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1259 |
fold_thms lthy ctr_defs' |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1260 |
(unfold_thms lthy (pre_rel_def :: abs_inverse :: |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1261 |
(if fp = Least_FP then [] else [dtor_ctor]) @ sum_prod_thms_rel @ |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1262 |
@{thms vimage2p_def Inl_Inr_False}) |
53266
89f7f1cc9ae3
cleaner handling of bootstrapping "fake" context, with fewer (no?) obscure bugs
blanchet
parents:
53264
diff
changeset
|
1263 |
(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
|
1264 |
|> postproc |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1265 |
|> singleton (Proof_Context.export names_lthy no_defs_lthy); |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1266 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1267 |
fun mk_rel_inject_thm ((ctr_def', cxIn), (_, cyIn)) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1268 |
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
|
1269 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1270 |
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
|
1271 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1272 |
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
|
1273 |
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
|
1274 |
cxIn cyIn; |
49121 | 1275 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1276 |
fun mk_other_half_rel_distinct_thm thm = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1277 |
flip_rels lthy live thm |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1278 |
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
|
1279 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1280 |
val half_rel_distinct_thmss = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1281 |
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
|
1282 |
val other_half_rel_distinct_thmss = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1283 |
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
|
1284 |
val (rel_distinct_thms, _) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1285 |
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
|
1286 |
|
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1287 |
val rel_eq_thms = |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1288 |
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
|
1289 |
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
|
1290 |
rel_inject_thms ms; |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1291 |
|
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1292 |
val anonymous_notes = |
55397
c2506f61fd26
generate 'fundec_cong' attribute for new-style (co)datatypes
blanchet
parents:
55394
diff
changeset
|
1293 |
[([case_cong], fundefcong_attrs), |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1294 |
(rel_eq_thms, code_nitpicksimp_attrs)] |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1295 |
|> map (fn (thms, attrs) => ((Binding.empty, attrs), [(thms, [])])); |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1296 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1297 |
val notes = |
54145
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1298 |
[(mapN, map_thms, code_nitpicksimp_attrs @ simp_attrs), |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1299 |
(rel_distinctN, rel_distinct_thms, simp_attrs), |
297d1c603999
make sure that registered code equations are actually equations
blanchet
parents:
54107
diff
changeset
|
1300 |
(rel_injectN, rel_inject_thms, simp_attrs), |
55463
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1301 |
(setN, set_thms, code_nitpicksimp_attrs @ simp_attrs)] |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1302 |
|> massage_simple_notes fp_b_name; |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1303 |
in |
51840 | 1304 |
(((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
|
1305 |
lthy |
55535
10194808430d
name derivations in 'primrec' for code extraction from proof terms
blanchet
parents:
55486
diff
changeset
|
1306 |
|> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) map_thms) |
10194808430d
name derivations in 'primrec' for code extraction from proof terms
blanchet
parents:
55486
diff
changeset
|
1307 |
|> Spec_Rules.add Spec_Rules.Equational (`(single o lhs_head_of o hd) rel_eq_thms) |
10194808430d
name derivations in 'primrec' for code extraction from proof terms
blanchet
parents:
55486
diff
changeset
|
1308 |
|> 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
|
1309 |
|> Local_Theory.notes (anonymous_notes @ notes) |
942c2153b5b4
register 'Spec_Rules' for new-style (co)datatypes
blanchet
parents:
55444
diff
changeset
|
1310 |
|> snd) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1311 |
end; |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1312 |
|
55410 | 1313 |
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
|
1314 |
|
51883 | 1315 |
fun massage_res (((maps_sets_rels, ctr_sugar), co_iter_res), lthy) = |
1316 |
(((maps_sets_rels, (ctrs, xss, ctr_defs, ctr_sugar)), co_iter_res), lthy); |
|
49119 | 1317 |
in |
51897 | 1318 |
(wrap_ctrs |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1319 |
#> derive_maps_sets_rels |
52313 | 1320 |
##>> |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1321 |
(if fp = Least_FP then define_iter iters_args_types mk_binding fpTs Cs reps |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1322 |
else define_coiter (the coiters_args_types) mk_binding fpTs Cs abss) |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1323 |
(co_rec_of xtor_co_iters) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1324 |
#> massage_res, lthy') |
49119 | 1325 |
end; |
49167 | 1326 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1327 |
fun wrap_types_etc (wrap_types_etcs, lthy) = |
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1328 |
fold_map I wrap_types_etcs lthy |
52342 | 1329 |
|>> apsnd split_list o apfst (apsnd split_list4 o apfst split_list4 o split_list) |
1330 |
o split_list; |
|
49226 | 1331 |
|
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1332 |
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
|
1333 |
rel_distincts setss = |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1334 |
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
|
1335 |
|
53807 | 1336 |
fun derive_note_induct_iters_thms_for_types |
53476
eb3865c3ee58
include map theorems in datastructure for "primcorec"
blanchet
parents:
53475
diff
changeset
|
1337 |
((((mapss, rel_injects, rel_distincts, setss), (ctrss, _, ctr_defss, ctr_sugars)), |
55864 | 1338 |
(recs, rec_defs)), lthy) = |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1339 |
let |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1340 |
val ((induct_thms, induct_thm, induct_attrs), (rec_thmss, iter_attrs)) = |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1341 |
derive_induct_iters_thms_for_types pre_bnfs iters_args_types xtor_co_induct |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1342 |
xtor_co_iter_thmss nesting_bnfs nested_bnfs fpTs Cs Xs ctrXs_Tsss abs_inverses |
55864 | 1343 |
type_definitions abs_inverses ctrss ctr_defss recs rec_defs lthy; |
49201 | 1344 |
|
51830 | 1345 |
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
|
1346 |
|
55864 | 1347 |
val (recs', rec_thmss') = |
1348 |
if is_some iters_args_types then (recs, rec_thmss) |
|
1349 |
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
|
1350 |
|
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1351 |
val simp_thmss = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1352 |
map6 mk_simp_thms ctr_sugars rec_thmss mapss rel_injects rel_distincts setss; |
49438 | 1353 |
|
49337 | 1354 |
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
|
1355 |
(if nn > 1 then [(inductN, [induct_thm], induct_attrs)] else []) |
51780 | 1356 |
|> massage_simple_notes fp_common_name; |
49337 | 1357 |
|
49226 | 1358 |
val notes = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1359 |
[(inductN, map single induct_thms, fn T_name => induct_attrs @ [induct_type_attr T_name]), |
53808 | 1360 |
(recN, rec_thmss, K iter_attrs), |
49585
5c4a12550491
generate high-level "maps", "sets", and "rels" properties
blanchet
parents:
49583
diff
changeset
|
1361 |
(simpsN, simp_thmss, K [])] |
51780 | 1362 |
|> massage_multi_notes; |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1363 |
in |
51824 | 1364 |
lthy |
55862
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1365 |
|> (if is_some iters_args_types then |
55864 | 1366 |
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
|
1367 |
else |
b458558cbcc2
optimized simple non-recursive datatypes by reusing 'case' for 'rec' constant
blanchet
parents:
55861
diff
changeset
|
1368 |
I) |
51824 | 1369 |
|> Local_Theory.notes (common_notes @ notes) |> snd |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1370 |
|> register_fp_sugars Xs Least_FP pre_bnfs absT_infos nested_bnfs nesting_bnfs fp_res |
55864 | 1371 |
ctrXs_Tsss ctr_defss ctr_sugars recs' mapss [induct_thm] (map single induct_thms) |
55863 | 1372 |
rec_thmss' (replicate nn []) (replicate nn []) |
49202
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1373 |
end; |
f493cd25737f
some work towards iterator and recursor properties
blanchet
parents:
49201
diff
changeset
|
1374 |
|
53807 | 1375 |
fun derive_note_coinduct_coiters_thms_for_types |
53476
eb3865c3ee58
include map theorems in datastructure for "primcorec"
blanchet
parents:
53475
diff
changeset
|
1376 |
((((mapss, rel_injects, rel_distincts, setss), (_, _, ctr_defss, ctr_sugars)), |
55864 | 1377 |
(coiters, corec_defs)), lthy) = |
49212 | 1378 |
let |
52345 | 1379 |
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
|
1380 |
coinduct_attrs), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1381 |
(corec_thmss, coiter_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1382 |
(disc_corec_thmss, disc_coiter_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1383 |
(disc_corec_iff_thmss, disc_coiter_iff_attrs), |
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1384 |
(sel_corec_thmsss, sel_coiter_attrs)) = |
53106 | 1385 |
derive_coinduct_coiters_thms_for_types pre_bnfs (the coiters_args_types) xtor_co_induct |
54235 | 1386 |
dtor_injects dtor_ctors xtor_co_iter_thmss nesting_bnfs fpTs Cs Xs ctrXs_Tsss kss mss ns |
55864 | 1387 |
abs_inverses abs_inverses I ctr_defss ctr_sugars coiters corec_defs |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1388 |
(Proof_Context.export lthy' no_defs_lthy) lthy; |
49212 | 1389 |
|
53475 | 1390 |
val sel_corec_thmss = map flat sel_corec_thmsss; |
1391 |
||
51830 | 1392 |
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
|
1393 |
|
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
|
1394 |
val flat_coiter_thms = append oo append; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1395 |
|
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1396 |
val simp_thmss = |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1397 |
map6 mk_simp_thms ctr_sugars |
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
|
1398 |
(map3 flat_coiter_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
|
1399 |
mapss rel_injects rel_distincts setss; |
49479
504f0a38f608
added "simp"s to coiter/corec theorems + export under "simps" name
blanchet
parents:
49478
diff
changeset
|
1400 |
|
49342 | 1401 |
val common_notes = |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1402 |
(if nn > 1 then |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1403 |
[(coinductN, [coinduct_thm], coinduct_attrs), |
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1404 |
(strong_coinductN, [strong_coinduct_thm], coinduct_attrs)] |
49591
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1405 |
else |
91b228e26348
generate high-level "coinduct" and "strong_coinduct" properties
blanchet
parents:
49590
diff
changeset
|
1406 |
[]) |
51780 | 1407 |
|> massage_simple_notes fp_common_name; |
49342 | 1408 |
|
49212 | 1409 |
val notes = |
51780 | 1410 |
[(coinductN, map single coinduct_thms, |
51810
7b75fab5ebf5
factored out derivation of coinduction, unfold, corec
blanchet
parents:
51808
diff
changeset
|
1411 |
fn T_name => coinduct_attrs @ [coinduct_type_attr T_name]), |
51843
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1412 |
(corecN, corec_thmss, K coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1413 |
(disc_corecN, disc_corec_thmss, K disc_coiter_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1414 |
(disc_corec_iffN, disc_corec_iff_thmss, K disc_coiter_iff_attrs), |
899663644482
rationalized terminology (iterator = fold or rec, xxfoo = (co)foo or (un)foo)
blanchet
parents:
51842
diff
changeset
|
1415 |
(sel_corecN, sel_corec_thmss, K sel_coiter_attrs), |
51780 | 1416 |
(simpsN, simp_thmss, K []), |
55856
bddaada24074
got rid of automatically generated fold constant and theorems (to reduce overhead)
blanchet
parents:
55803
diff
changeset
|
1417 |
(strong_coinductN, map single strong_coinduct_thms, K coinduct_attrs)] |
51780 | 1418 |
|> massage_multi_notes; |
49212 | 1419 |
in |
51824 | 1420 |
lthy |
55864 | 1421 |
(* TODO: code theorems *) |
1422 |
|> fold (curry (Spec_Rules.add Spec_Rules.Equational) coiters) |
|
1423 |
[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
|
1424 |
|> Local_Theory.notes (common_notes @ notes) |> snd |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1425 |
|> register_fp_sugars Xs Greatest_FP pre_bnfs absT_infos nested_bnfs nesting_bnfs fp_res |
55864 | 1426 |
ctrXs_Tsss ctr_defss ctr_sugars coiters mapss [coinduct_thm, strong_coinduct_thm] |
1427 |
(transpose [coinduct_thms, strong_coinduct_thms]) corec_thmss disc_corec_thmss |
|
1428 |
sel_corec_thmsss |
|
49212 | 1429 |
end; |
1430 |
||
52367 | 1431 |
val lthy'' = lthy' |
52968
2b430bbb5a1a
define case constant from other 'free constructor' axioms
blanchet
parents:
52964
diff
changeset
|
1432 |
|> fold_map define_ctrs_dtrs_for_type (fp_bnfs ~~ fp_bs ~~ fpTs ~~ ctors ~~ dtors ~~ |
52330 | 1433 |
xtor_co_iterss ~~ ctor_dtors ~~ dtor_ctors ~~ ctor_injects ~~ pre_map_defs ~~ |
52314 | 1434 |
pre_set_defss ~~ pre_rel_defs ~~ xtor_map_thms ~~ xtor_set_thmss ~~ xtor_rel_thms ~~ ns ~~ |
55803
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1435 |
kss ~~ mss ~~ abss ~~ abs_injects ~~ abs_inverses ~~ type_definitions ~~ |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1436 |
ctr_bindingss ~~ ctr_mixfixess ~~ ctr_Tsss ~~ disc_bindingss ~~ sel_bindingsss ~~ |
74d3fe9031d8
joint work with blanchet: intermediate typedef for the input to fp-operations
traytel
parents:
55772
diff
changeset
|
1437 |
raw_sel_defaultsss) |
51835
56523caf372f
Added maps, sets, rels to "simps" thm collection
blanchet
parents:
51833
diff
changeset
|
1438 |
|> wrap_types_etc |
53807 | 1439 |
|> fp_case fp derive_note_induct_iters_thms_for_types |
1440 |
derive_note_coinduct_coiters_thms_for_types; |
|
49167 | 1441 |
|
1442 |
val timer = time (timer ("Constructors, discriminators, selectors, etc., for the new " ^ |
|
52899 | 1443 |
co_prefix fp ^ "datatype")); |
49112 | 1444 |
in |
52367 | 1445 |
timer; lthy'' |
49112 | 1446 |
end; |
1447 |
||
53974 | 1448 |
fun co_datatypes x = define_co_datatypes (K I) (K I) (K I) x; |
49297 | 1449 |
|
53974 | 1450 |
fun co_datatype_cmd x = |
1451 |
define_co_datatypes Typedecl.read_constraint Syntax.parse_typ Syntax.parse_term x; |
|
49119 | 1452 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1453 |
val parse_ctr_arg = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1454 |
@{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
|
1455 |
(Parse.typ >> pair Binding.empty); |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1456 |
|
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1457 |
val parse_ctr_specs = |
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1458 |
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
|
1459 |
|
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1460 |
val parse_spec = |
51790
22517d04d20b
more intuitive syntax for equality-style discriminators of nullary constructors
blanchet
parents:
51788
diff
changeset
|
1461 |
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
|
1462 |
Parse.opt_mixfix -- (@{keyword "="} |-- parse_ctr_specs); |
51767
bbcdd8519253
honor user-specified name for relator + generalize syntax
blanchet
parents:
51766
diff
changeset
|
1463 |
|
55469
b19dd108f0c2
aligned the syntax for 'free_constructors' on the 'datatype_new' and 'codatatype' syntax
blanchet
parents:
55468
diff
changeset
|
1464 |
val parse_co_datatype = parse_ctr_options -- Parse.and_list1 parse_spec; |
49278 | 1465 |
|
52207
21026c312cc3
tuning -- avoided unreadable true/false all over the place for LFP/GFP
blanchet
parents:
52197
diff
changeset
|
1466 |
fun parse_co_datatype_cmd fp construct_fp = parse_co_datatype >> co_datatype_cmd fp construct_fp; |
49112 | 1467 |
|
1468 |
end; |