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