author | wenzelm |
Sun, 09 Nov 2014 14:08:00 +0100 | |
changeset 58956 | a816aa3ff391 |
parent 58372 | bfd497f2f4c2 |
child 58959 | 1f195ed99941 |
permissions | -rw-r--r-- |
31936 | 1 |
(* Title: HOL/Nominal/nominal_datatype.ML |
19494 | 2 |
Author: Stefan Berghofer and Christian Urban, TU Muenchen |
3 |
||
4 |
Nominal datatype package for Isabelle/HOL. |
|
5 |
*) |
|
17870 | 6 |
|
31936 | 7 |
signature NOMINAL_DATATYPE = |
17870 | 8 |
sig |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
9 |
val nominal_datatype : Old_Datatype_Aux.config -> Old_Datatype.spec list -> theory -> theory |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
10 |
val nominal_datatype_cmd : Old_Datatype_Aux.config -> Old_Datatype.spec_cmd list -> theory -> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
11 |
theory |
22433
400fa18e951f
- Changed format of descriptor contained in nominal_datatype_info
berghofe
parents:
22311
diff
changeset
|
12 |
type descr |
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
13 |
type nominal_datatype_info |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
14 |
val get_nominal_datatypes : theory -> nominal_datatype_info Symtab.table |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
15 |
val get_nominal_datatype : theory -> string -> nominal_datatype_info option |
22311 | 16 |
val mk_perm: typ list -> term -> term -> term |
22529
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
17 |
val perm_of_pair: term * term -> term |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
18 |
val mk_not_sym: thm list -> thm list |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
19 |
val perm_simproc: simproc |
25823 | 20 |
val fresh_const: typ -> typ -> term |
28373 | 21 |
val fresh_star_const: typ -> typ -> term |
17870 | 22 |
end |
23 |
||
31936 | 24 |
structure NominalDatatype : NOMINAL_DATATYPE = |
17870 | 25 |
struct |
26 |
||
39159 | 27 |
val finite_emptyI = @{thm finite.emptyI}; |
28 |
val finite_Diff = @{thm finite_Diff}; |
|
29 |
val finite_Un = @{thm finite_Un}; |
|
30 |
val Un_iff = @{thm Un_iff}; |
|
31 |
val In0_eq = @{thm In0_eq}; |
|
32 |
val In1_eq = @{thm In1_eq}; |
|
33 |
val In0_not_In1 = @{thm In0_not_In1}; |
|
34 |
val In1_not_In0 = @{thm In1_not_In0}; |
|
35 |
val Un_assoc = @{thm Un_assoc}; |
|
36 |
val Collect_disj_eq = @{thm Collect_disj_eq}; |
|
32129 | 37 |
val Collect_False_empty = @{thm empty_def [THEN sym, THEN eq_reflection]}; |
39159 | 38 |
val empty_iff = @{thm empty_iff}; |
21669 | 39 |
|
18068 | 40 |
open NominalAtoms; |
17870 | 41 |
|
18016 | 42 |
|
22846 | 43 |
(* theory data *) |
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
44 |
|
45838 | 45 |
type descr = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
46 |
(int * (string * Old_Datatype_Aux.dtyp list * |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
47 |
(string * (Old_Datatype_Aux.dtyp list * Old_Datatype_Aux.dtyp) list) list)) list; |
22433
400fa18e951f
- Changed format of descriptor contained in nominal_datatype_info
berghofe
parents:
22311
diff
changeset
|
48 |
|
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
49 |
type nominal_datatype_info = |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
50 |
{index : int, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
51 |
descr : descr, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
52 |
rec_names : string list, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
53 |
rec_rewrites : thm list, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
54 |
induction : thm, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
55 |
distinct : thm list, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
56 |
inject : thm list}; |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
57 |
|
33522 | 58 |
structure NominalDatatypesData = Theory_Data |
22846 | 59 |
( |
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
60 |
type T = nominal_datatype_info Symtab.table; |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
61 |
val empty = Symtab.empty; |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
62 |
val extend = I; |
33522 | 63 |
fun merge data = Symtab.merge (K true) data; |
22846 | 64 |
); |
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
65 |
|
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
66 |
val get_nominal_datatypes = NominalDatatypesData.get; |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
67 |
val put_nominal_datatypes = NominalDatatypesData.put; |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
68 |
val map_nominal_datatypes = NominalDatatypesData.map; |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
69 |
val get_nominal_datatype = Symtab.lookup o get_nominal_datatypes; |
22846 | 70 |
|
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
71 |
|
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
72 |
(**** make datatype info ****) |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
73 |
|
45822 | 74 |
fun make_dt_info descr induct reccomb_names rec_thms |
33063 | 75 |
(i, (((_, (tname, _, _)), distinct), inject)) = |
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
76 |
(tname, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
77 |
{index = i, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
78 |
descr = descr, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
79 |
rec_names = reccomb_names, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
80 |
rec_rewrites = rec_thms, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
81 |
induction = induct, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
82 |
distinct = distinct, |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
83 |
inject = inject}); |
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
84 |
|
18016 | 85 |
(*******************************) |
86 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
87 |
val (_ $ (_ $ (_ $ (distinct_f $ _) $ _))) = hd (prems_of Old_Datatype.distinct_lemma); |
17870 | 88 |
|
89 |
||
18658 | 90 |
(** simplification procedure for sorting permutations **) |
91 |
||
39159 | 92 |
val dj_cp = @{thm dj_cp}; |
18658 | 93 |
|
56253 | 94 |
fun dest_permT (Type (@{type_name fun}, |
95 |
[Type (@{type_name list}, [Type (@{type_name Product_Type.prod}, [T, _])]), |
|
96 |
Type (@{type_name fun}, [_, U])])) = (T, U); |
|
18658 | 97 |
|
56253 | 98 |
fun permTs_of (Const (@{const_name Nominal.perm}, T) $ t $ u) = fst (dest_permT T) :: permTs_of u |
18658 | 99 |
| permTs_of _ = []; |
100 |
||
56253 | 101 |
fun perm_simproc' ctxt (Const (@{const_name Nominal.perm}, T) $ t $ (u as Const (@{const_name Nominal.perm}, U) $ r $ s)) = |
18658 | 102 |
let |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
103 |
val thy = Proof_Context.theory_of ctxt; |
18658 | 104 |
val (aT as Type (a, []), S) = dest_permT T; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
105 |
val (bT as Type (b, []), _) = dest_permT U; |
36692
54b64d4ad524
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
haftmann
parents:
36610
diff
changeset
|
106 |
in if member (op =) (permTs_of u) aT andalso aT <> bT then |
18658 | 107 |
let |
28731 | 108 |
val cp = cp_inst_of thy a b; |
109 |
val dj = dj_thm_of thy b a; |
|
18658 | 110 |
val dj_cp' = [cp, dj] MRS dj_cp; |
111 |
val cert = SOME o cterm_of thy |
|
112 |
in |
|
113 |
SOME (mk_meta_eq (Drule.instantiate' [SOME (ctyp_of thy S)] |
|
114 |
[cert t, cert r, cert s] dj_cp')) |
|
115 |
end |
|
116 |
else NONE |
|
117 |
end |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
118 |
| perm_simproc' _ _ = NONE; |
18658 | 119 |
|
120 |
val perm_simproc = |
|
38715
6513ea67d95d
renamed Simplifier.simproc(_i) to Simplifier.simproc_global(_i) to emphasize that this is not the real thing;
wenzelm
parents:
38558
diff
changeset
|
121 |
Simplifier.simproc_global @{theory} "perm_simp" ["pi1 \<bullet> (pi2 \<bullet> x)"] perm_simproc'; |
18658 | 122 |
|
18582
4f4cc426b440
provide projections of induct_weak, induct_unsafe;
wenzelm
parents:
18579
diff
changeset
|
123 |
fun projections rule = |
42361 | 124 |
Project_Rule.projections (Proof_Context.init_global (Thm.theory_of_thm rule)) rule |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
125 |
|> map (Drule.export_without_context #> Rule_Cases.save rule); |
18582
4f4cc426b440
provide projections of induct_weak, induct_unsafe;
wenzelm
parents:
18579
diff
changeset
|
126 |
|
39159 | 127 |
val supp_prod = @{thm supp_prod}; |
128 |
val fresh_prod = @{thm fresh_prod}; |
|
129 |
val supports_fresh = @{thm supports_fresh}; |
|
44685
f5bc7d9d0d74
assert Pure equations for theorem references; avoid dynamic reference to fact
haftmann
parents:
44241
diff
changeset
|
130 |
val supports_def = Simpdata.mk_eq @{thm Nominal.supports_def}; |
f5bc7d9d0d74
assert Pure equations for theorem references; avoid dynamic reference to fact
haftmann
parents:
44241
diff
changeset
|
131 |
val fresh_def = Simpdata.mk_eq @{thm fresh_def}; |
f5bc7d9d0d74
assert Pure equations for theorem references; avoid dynamic reference to fact
haftmann
parents:
44241
diff
changeset
|
132 |
val supp_def = Simpdata.mk_eq @{thm supp_def}; |
39159 | 133 |
val rev_simps = @{thms rev.simps}; |
134 |
val app_simps = @{thms append.simps}; |
|
135 |
val at_fin_set_supp = @{thm at_fin_set_supp}; |
|
136 |
val at_fin_set_fresh = @{thm at_fin_set_fresh}; |
|
137 |
val abs_fun_eq1 = @{thm abs_fun_eq1}; |
|
20267 | 138 |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
139 |
fun collect_simp ctxt = rewrite_rule ctxt [mk_meta_eq mem_Collect_eq]; |
21021 | 140 |
|
22311 | 141 |
fun mk_perm Ts t u = |
142 |
let |
|
143 |
val T = fastype_of1 (Ts, t); |
|
144 |
val U = fastype_of1 (Ts, u) |
|
56253 | 145 |
in Const (@{const_name Nominal.perm}, T --> U --> U) $ t $ u end; |
22311 | 146 |
|
22529
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
147 |
fun perm_of_pair (x, y) = |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
148 |
let |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
149 |
val T = fastype_of x; |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
150 |
val pT = mk_permT T |
56253 | 151 |
in Const (@{const_name Cons}, HOLogic.mk_prodT (T, T) --> pT --> pT) $ |
152 |
HOLogic.mk_prod (x, y) $ Const (@{const_name Nil}, pT) |
|
22529
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
153 |
end; |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
154 |
|
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
155 |
fun mk_not_sym ths = maps (fn th => case prop_of th of |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38795
diff
changeset
|
156 |
_ $ (Const (@{const_name Not}, _) $ (Const (@{const_name HOL.eq}, _) $ _ $ _)) => [th, th RS not_sym] |
22529
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
157 |
| _ => [th]) ths; |
902ed60d53a7
Exported perm_of_pair, mk_not_sym, and perm_simproc.
berghofe
parents:
22433
diff
changeset
|
158 |
|
56253 | 159 |
fun fresh_const T U = Const (@{const_name Nominal.fresh}, T --> U --> HOLogic.boolT); |
28373 | 160 |
fun fresh_star_const T U = |
56253 | 161 |
Const (@{const_name Nominal.fresh_star}, HOLogic.mk_setT T --> U --> HOLogic.boolT); |
25823 | 162 |
|
45863 | 163 |
fun gen_nominal_datatype prep_specs config dts thy = |
17870 | 164 |
let |
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
165 |
val new_type_names = map (fn ((tname, _, _), _) => Binding.name_of tname) dts; |
45701 | 166 |
|
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
167 |
val (dts', _) = prep_specs dts thy; |
17870 | 168 |
|
169 |
val atoms = atoms_of thy; |
|
170 |
||
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
171 |
val tyvars = map (fn ((_, tvs, _), _) => tvs) dts'; |
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
172 |
val sorts = flat tyvars; |
17870 | 173 |
|
42388 | 174 |
fun inter_sort thy S S' = Sign.inter_sort thy (S, S'); |
28731 | 175 |
fun augment_sort_typ thy S = |
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
176 |
let val S = Sign.minimize_sort thy (Sign.certify_sort thy S) |
28731 | 177 |
in map_type_tfree (fn (s, S') => TFree (s, |
178 |
if member (op = o apsnd fst) sorts s then inter_sort thy S S' else S')) |
|
179 |
end; |
|
180 |
fun augment_sort thy S = map_types (augment_sort_typ thy S); |
|
181 |
||
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
182 |
val types_syntax = map (fn ((tname, tvs, mx), constrs) => (tname, mx)) dts'; |
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
183 |
val constr_syntax = map (fn (_, constrs) => |
17870 | 184 |
map (fn (cname, cargs, mx) => (cname, mx)) constrs) dts'; |
185 |
||
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
186 |
val ps = map (fn ((n, _, _), _) => |
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
187 |
(Sign.full_name thy n, Sign.full_name thy (Binding.suffix_name "_Rep" n))) dts; |
17870 | 188 |
val rps = map Library.swap ps; |
189 |
||
56253 | 190 |
fun replace_types (Type (@{type_name ABS}, [T, U])) = |
191 |
Type (@{type_name fun}, [T, Type (@{type_name noption}, [replace_types U])]) |
|
17870 | 192 |
| replace_types (Type (s, Ts)) = |
33035 | 193 |
Type (the_default s (AList.lookup op = ps s), map replace_types Ts) |
17870 | 194 |
| replace_types T = T; |
195 |
||
45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
196 |
val dts'' = map (fn ((tname, tvs, mx), constrs) => |
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45838
diff
changeset
|
197 |
((Binding.suffix_name "_Rep" tname, tvs, NoSyn), |
45701 | 198 |
map (fn (cname, cargs, mx) => (Binding.suffix_name "_Rep" cname, |
199 |
map replace_types cargs, NoSyn)) constrs)) dts'; |
|
17870 | 200 |
|
201 |
val new_type_names' = map (fn n => n ^ "_Rep") new_type_names; |
|
202 |
||
58354
04ac60da613e
support (finite values of) codatatypes in Quickcheck
blanchet
parents:
58300
diff
changeset
|
203 |
val (full_new_type_names',thy1) = BNF_LFP_Compat.add_datatype [BNF_LFP_Compat.Kill_Type_Args] dts'' thy; |
17870 | 204 |
|
58354
04ac60da613e
support (finite values of) codatatypes in Quickcheck
blanchet
parents:
58300
diff
changeset
|
205 |
val {descr, induct, ...} = BNF_LFP_Compat.the_info thy1 [] (hd full_new_type_names'); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
206 |
fun nth_dtyp i = Old_Datatype_Aux.typ_of_dtyp descr (Old_Datatype_Aux.DtRec i); |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
207 |
|
26651 | 208 |
val big_name = space_implode "_" new_type_names; |
209 |
||
210 |
||
17870 | 211 |
(**** define permutation functions ****) |
212 |
||
56253 | 213 |
val permT = mk_permT (TFree ("'x", @{sort type})); |
17870 | 214 |
val pi = Free ("pi", permT); |
215 |
val perm_types = map (fn (i, _) => |
|
216 |
let val T = nth_dtyp i |
|
217 |
in permT --> T --> T end) descr; |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
218 |
val perm_names' = Old_Datatype_Prop.indexify_names (map (fn (i, _) => |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
219 |
"perm_" ^ Old_Datatype_Aux.name_of_typ (nth_dtyp i)) descr); |
56253 | 220 |
val perm_names = replicate (length new_type_names) @{const_name Nominal.perm} @ |
28965 | 221 |
map (Sign.full_bname thy1) (List.drop (perm_names', length new_type_names)); |
17870 | 222 |
val perm_names_types = perm_names ~~ perm_types; |
26680 | 223 |
val perm_names_types' = perm_names' ~~ perm_types; |
17870 | 224 |
|
26680 | 225 |
val perm_eqs = maps (fn (i, (_, _, constrs)) => |
17870 | 226 |
let val T = nth_dtyp i |
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
227 |
in map (fn (cname, dts) => |
17870 | 228 |
let |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
229 |
val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr) dts; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
230 |
val names = Name.variant_list ["pi"] (Old_Datatype_Prop.make_tnames Ts); |
17870 | 231 |
val args = map Free (names ~~ Ts); |
232 |
val c = Const (cname, Ts ---> T); |
|
233 |
fun perm_arg (dt, x) = |
|
234 |
let val T = type_of x |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
235 |
in if Old_Datatype_Aux.is_rec_type dt then |
40844 | 236 |
let val Us = binder_types T |
46219
426ed18eba43
discontinued old-style Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
46218
diff
changeset
|
237 |
in |
426ed18eba43
discontinued old-style Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
46218
diff
changeset
|
238 |
fold_rev (Term.abs o pair "x") Us |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
239 |
(Free (nth perm_names_types' (Old_Datatype_Aux.body_index dt)) $ pi $ |
46219
426ed18eba43
discontinued old-style Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
46218
diff
changeset
|
240 |
list_comb (x, map (fn (i, U) => |
56253 | 241 |
Const (@{const_name Nominal.perm}, permT --> U --> U) $ |
242 |
(Const (@{const_name rev}, permT --> permT) $ pi) $ |
|
46219
426ed18eba43
discontinued old-style Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
46218
diff
changeset
|
243 |
Bound i) ((length Us - 1 downto 0) ~~ Us))) |
17870 | 244 |
end |
56253 | 245 |
else Const (@{const_name Nominal.perm}, permT --> T --> T) $ pi $ x |
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
246 |
end; |
17870 | 247 |
in |
28965 | 248 |
(Attrib.empty_binding, HOLogic.mk_Trueprop (HOLogic.mk_eq |
26680 | 249 |
(Free (nth perm_names_types' i) $ |
56253 | 250 |
Free ("pi", mk_permT (TFree ("'x", @{sort type}))) $ |
17870 | 251 |
list_comb (c, args), |
26680 | 252 |
list_comb (c, map perm_arg (dts ~~ args))))) |
17870 | 253 |
end) constrs |
26680 | 254 |
end) descr; |
17870 | 255 |
|
26689
105031879f4a
Auxiliary permutation functions are no longer declared using add_consts_i,
berghofe
parents:
26680
diff
changeset
|
256 |
val (perm_simps, thy2) = |
58225 | 257 |
BNF_LFP_Compat.add_primrec_overloaded |
26689
105031879f4a
Auxiliary permutation functions are no longer declared using add_consts_i,
berghofe
parents:
26680
diff
changeset
|
258 |
(map (fn (s, sT) => (s, sT, false)) |
105031879f4a
Auxiliary permutation functions are no longer declared using add_consts_i,
berghofe
parents:
26680
diff
changeset
|
259 |
(List.take (perm_names' ~~ perm_names_types, length new_type_names))) |
52788 | 260 |
(map (fn s => (Binding.name s, NONE, NoSyn)) perm_names') perm_eqs thy1; |
17870 | 261 |
|
262 |
(**** prove that permutation functions introduced by unfolding are ****) |
|
263 |
(**** equivalent to already existing permutation functions ****) |
|
264 |
||
265 |
val _ = warning ("length descr: " ^ string_of_int (length descr)); |
|
266 |
val _ = warning ("length new_type_names: " ^ string_of_int (length new_type_names)); |
|
267 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
268 |
val perm_indnames = Old_Datatype_Prop.make_tnames (map body_type perm_types); |
44685
f5bc7d9d0d74
assert Pure equations for theorem references; avoid dynamic reference to fact
haftmann
parents:
44241
diff
changeset
|
269 |
val perm_fun_def = Simpdata.mk_eq @{thm perm_fun_def}; |
17870 | 270 |
|
271 |
val unfolded_perm_eq_thms = |
|
272 |
if length descr = length new_type_names then [] |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
273 |
else map Drule.export_without_context (List.drop (Old_Datatype_Aux.split_conj_thm |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
274 |
(Goal.prove_global_future thy2 [] [] |
17870 | 275 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
276 |
(map (fn (c as (s, T), x) => |
|
277 |
let val [T1, T2] = binder_types T |
|
278 |
in HOLogic.mk_eq (Const c $ pi $ Free (x, T2), |
|
56253 | 279 |
Const (@{const_name Nominal.perm}, T) $ pi $ Free (x, T2)) |
17870 | 280 |
end) |
18010 | 281 |
(perm_names_types ~~ perm_indnames)))) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
282 |
(fn {context = ctxt, ...} => EVERY [Old_Datatype_Aux.ind_tac induct perm_indnames 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
283 |
ALLGOALS (asm_full_simp_tac (ctxt addsimps [perm_fun_def]))])), |
17870 | 284 |
length new_type_names)); |
285 |
||
286 |
(**** prove [] \<bullet> t = t ****) |
|
287 |
||
288 |
val _ = warning "perm_empty_thms"; |
|
289 |
||
32952 | 290 |
val perm_empty_thms = maps (fn a => |
17870 | 291 |
let val permT = mk_permT (Type (a, [])) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
292 |
in map Drule.export_without_context (List.take (Old_Datatype_Aux.split_conj_thm |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
293 |
(Goal.prove_global_future thy2 [] [] |
28731 | 294 |
(augment_sort thy2 [pt_class_of thy2 a] |
295 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
|
296 |
(map (fn ((s, T), x) => HOLogic.mk_eq |
|
297 |
(Const (s, permT --> T --> T) $ |
|
56253 | 298 |
Const (@{const_name Nil}, permT) $ Free (x, T), |
28731 | 299 |
Free (x, T))) |
300 |
(perm_names ~~ |
|
301 |
map body_type perm_types ~~ perm_indnames))))) |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
302 |
(fn {context = ctxt, ...} => EVERY [Old_Datatype_Aux.ind_tac induct perm_indnames 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
303 |
ALLGOALS (asm_full_simp_tac ctxt)])), |
17870 | 304 |
length new_type_names)) |
305 |
end) |
|
32952 | 306 |
atoms; |
17870 | 307 |
|
308 |
(**** prove (pi1 @ pi2) \<bullet> t = pi1 \<bullet> (pi2 \<bullet> t) ****) |
|
309 |
||
310 |
val _ = warning "perm_append_thms"; |
|
311 |
||
312 |
(*FIXME: these should be looked up statically*) |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
313 |
val at_pt_inst = Global_Theory.get_thm thy2 "at_pt_inst"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
314 |
val pt2 = Global_Theory.get_thm thy2 "pt2"; |
17870 | 315 |
|
32952 | 316 |
val perm_append_thms = maps (fn a => |
17870 | 317 |
let |
318 |
val permT = mk_permT (Type (a, [])); |
|
319 |
val pi1 = Free ("pi1", permT); |
|
320 |
val pi2 = Free ("pi2", permT); |
|
28731 | 321 |
val pt_inst = pt_inst_of thy2 a; |
17870 | 322 |
val pt2' = pt_inst RS pt2; |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
323 |
val pt2_ax = Global_Theory.get_thm thy2 (Long_Name.map_base_name (fn s => "pt_" ^ s ^ "2") a); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
324 |
in List.take (map Drule.export_without_context (Old_Datatype_Aux.split_conj_thm |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
325 |
(Goal.prove_global_future thy2 [] [] |
28731 | 326 |
(augment_sort thy2 [pt_class_of thy2 a] |
17870 | 327 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
328 |
(map (fn ((s, T), x) => |
|
329 |
let val perm = Const (s, permT --> T --> T) |
|
330 |
in HOLogic.mk_eq |
|
56253 | 331 |
(perm $ (Const (@{const_name append}, permT --> permT --> permT) $ |
17870 | 332 |
pi1 $ pi2) $ Free (x, T), |
333 |
perm $ pi1 $ (perm $ pi2 $ Free (x, T))) |
|
334 |
end) |
|
335 |
(perm_names ~~ |
|
28731 | 336 |
map body_type perm_types ~~ perm_indnames))))) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
337 |
(fn {context = ctxt, ...} => EVERY [Old_Datatype_Aux.ind_tac induct perm_indnames 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
338 |
ALLGOALS (asm_full_simp_tac (ctxt addsimps [pt2', pt2_ax]))]))), |
17870 | 339 |
length new_type_names) |
32952 | 340 |
end) atoms; |
17870 | 341 |
|
342 |
(**** prove pi1 ~ pi2 ==> pi1 \<bullet> t = pi2 \<bullet> t ****) |
|
343 |
||
344 |
val _ = warning "perm_eq_thms"; |
|
345 |
||
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
346 |
val pt3 = Global_Theory.get_thm thy2 "pt3"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
347 |
val pt3_rev = Global_Theory.get_thm thy2 "pt3_rev"; |
17870 | 348 |
|
32952 | 349 |
val perm_eq_thms = maps (fn a => |
17870 | 350 |
let |
351 |
val permT = mk_permT (Type (a, [])); |
|
352 |
val pi1 = Free ("pi1", permT); |
|
353 |
val pi2 = Free ("pi2", permT); |
|
28731 | 354 |
val at_inst = at_inst_of thy2 a; |
355 |
val pt_inst = pt_inst_of thy2 a; |
|
17870 | 356 |
val pt3' = pt_inst RS pt3; |
357 |
val pt3_rev' = at_inst RS (pt_inst RS pt3_rev); |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
358 |
val pt3_ax = Global_Theory.get_thm thy2 (Long_Name.map_base_name (fn s => "pt_" ^ s ^ "3") a); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
359 |
in List.take (map Drule.export_without_context (Old_Datatype_Aux.split_conj_thm |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
360 |
(Goal.prove_global_future thy2 [] [] |
28731 | 361 |
(augment_sort thy2 [pt_class_of thy2 a] (Logic.mk_implies |
56253 | 362 |
(HOLogic.mk_Trueprop (Const (@{const_name Nominal.prm_eq}, |
17870 | 363 |
permT --> permT --> HOLogic.boolT) $ pi1 $ pi2), |
364 |
HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
|
365 |
(map (fn ((s, T), x) => |
|
366 |
let val perm = Const (s, permT --> T --> T) |
|
367 |
in HOLogic.mk_eq |
|
368 |
(perm $ pi1 $ Free (x, T), |
|
369 |
perm $ pi2 $ Free (x, T)) |
|
370 |
end) |
|
371 |
(perm_names ~~ |
|
28731 | 372 |
map body_type perm_types ~~ perm_indnames)))))) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
373 |
(fn {context = ctxt, ...} => EVERY [Old_Datatype_Aux.ind_tac induct perm_indnames 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
374 |
ALLGOALS (asm_full_simp_tac (ctxt addsimps [pt3', pt3_rev', pt3_ax]))]))), |
17870 | 375 |
length new_type_names) |
32952 | 376 |
end) atoms; |
17870 | 377 |
|
378 |
(**** prove pi1 \<bullet> (pi2 \<bullet> t) = (pi1 \<bullet> pi2) \<bullet> (pi1 \<bullet> t) ****) |
|
379 |
||
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
380 |
val cp1 = Global_Theory.get_thm thy2 "cp1"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
381 |
val dj_cp = Global_Theory.get_thm thy2 "dj_cp"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
382 |
val pt_perm_compose = Global_Theory.get_thm thy2 "pt_perm_compose"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
383 |
val pt_perm_compose_rev = Global_Theory.get_thm thy2 "pt_perm_compose_rev"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
384 |
val dj_perm_perm_forget = Global_Theory.get_thm thy2 "dj_perm_perm_forget"; |
17870 | 385 |
|
386 |
fun composition_instance name1 name2 thy = |
|
387 |
let |
|
28731 | 388 |
val cp_class = cp_class_of thy name1 name2; |
389 |
val pt_class = |
|
390 |
if name1 = name2 then [pt_class_of thy name1] |
|
391 |
else []; |
|
17870 | 392 |
val permT1 = mk_permT (Type (name1, [])); |
393 |
val permT2 = mk_permT (Type (name2, [])); |
|
28731 | 394 |
val Ts = map body_type perm_types; |
395 |
val cp_inst = cp_inst_of thy name1 name2; |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
396 |
fun simps ctxt = ctxt addsimps (perm_fun_def :: |
17870 | 397 |
(if name1 <> name2 then |
28731 | 398 |
let val dj = dj_thm_of thy name2 name1 |
17870 | 399 |
in [dj RS (cp_inst RS dj_cp), dj RS dj_perm_perm_forget] end |
400 |
else |
|
401 |
let |
|
28731 | 402 |
val at_inst = at_inst_of thy name1; |
403 |
val pt_inst = pt_inst_of thy name1; |
|
17870 | 404 |
in |
405 |
[cp_inst RS cp1 RS sym, |
|
406 |
at_inst RS (pt_inst RS pt_perm_compose) RS sym, |
|
407 |
at_inst RS (pt_inst RS pt_perm_compose_rev) RS sym] |
|
408 |
end)) |
|
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
409 |
val sort = Sign.minimize_sort thy (Sign.certify_sort thy (cp_class :: pt_class)); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
410 |
val thms = Old_Datatype_Aux.split_conj_thm (Goal.prove_global_future thy [] [] |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
411 |
(augment_sort thy sort |
17870 | 412 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
413 |
(map (fn ((s, T), x) => |
|
414 |
let |
|
415 |
val pi1 = Free ("pi1", permT1); |
|
416 |
val pi2 = Free ("pi2", permT2); |
|
417 |
val perm1 = Const (s, permT1 --> T --> T); |
|
418 |
val perm2 = Const (s, permT2 --> T --> T); |
|
56253 | 419 |
val perm3 = Const (@{const_name Nominal.perm}, permT1 --> permT2 --> permT2) |
17870 | 420 |
in HOLogic.mk_eq |
421 |
(perm1 $ pi1 $ (perm2 $ pi2 $ Free (x, T)), |
|
422 |
perm2 $ (perm3 $ pi1 $ pi2) $ (perm1 $ pi1 $ Free (x, T))) |
|
423 |
end) |
|
28731 | 424 |
(perm_names ~~ Ts ~~ perm_indnames))))) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
425 |
(fn {context = ctxt, ...} => EVERY [Old_Datatype_Aux.ind_tac induct perm_indnames 1, |
51671 | 426 |
ALLGOALS (asm_full_simp_tac (simps ctxt))])) |
17870 | 427 |
in |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51671
diff
changeset
|
428 |
fold (fn (s, tvs) => fn thy => Axclass.prove_arity |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
429 |
(s, map (inter_sort thy sort o snd) tvs, [cp_class]) |
51671 | 430 |
(fn _ => Class.intro_classes_tac [] THEN ALLGOALS (resolve_tac thms)) thy) |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
431 |
(full_new_type_names' ~~ tyvars) thy |
17870 | 432 |
end; |
433 |
||
18381
246807ef6dfb
changed the types in accordance with Florian's changes
urbanc
parents:
18366
diff
changeset
|
434 |
val (perm_thmss,thy3) = thy2 |> |
17870 | 435 |
fold (fn name1 => fold (composition_instance name1) atoms) atoms |> |
28731 | 436 |
fold (fn atom => fn thy => |
437 |
let val pt_name = pt_class_of thy atom |
|
438 |
in |
|
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51671
diff
changeset
|
439 |
fold (fn (s, tvs) => fn thy => Axclass.prove_arity |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
440 |
(s, map (inter_sort thy [pt_name] o snd) tvs, [pt_name]) |
51671 | 441 |
(fn _ => EVERY |
28731 | 442 |
[Class.intro_classes_tac [], |
443 |
resolve_tac perm_empty_thms 1, |
|
444 |
resolve_tac perm_append_thms 1, |
|
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
445 |
resolve_tac perm_eq_thms 1, assume_tac 1]) thy) |
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
446 |
(full_new_type_names' ~~ tyvars) thy |
28731 | 447 |
end) atoms |> |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
448 |
Global_Theory.add_thmss |
29585 | 449 |
[((Binding.name (space_implode "_" new_type_names ^ "_unfolded_perm_eq"), |
18759 | 450 |
unfolded_perm_eq_thms), [Simplifier.simp_add]), |
29585 | 451 |
((Binding.name (space_implode "_" new_type_names ^ "_perm_empty"), |
18759 | 452 |
perm_empty_thms), [Simplifier.simp_add]), |
29585 | 453 |
((Binding.name (space_implode "_" new_type_names ^ "_perm_append"), |
18759 | 454 |
perm_append_thms), [Simplifier.simp_add]), |
29585 | 455 |
((Binding.name (space_implode "_" new_type_names ^ "_perm_eq"), |
52788 | 456 |
perm_eq_thms), [Simplifier.simp_add])]; |
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
457 |
|
17870 | 458 |
(**** Define representing sets ****) |
459 |
||
460 |
val _ = warning "representing sets"; |
|
461 |
||
45838 | 462 |
val rep_set_names = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
463 |
Old_Datatype_Prop.indexify_names |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
464 |
(map (fn (i, _) => Old_Datatype_Aux.name_of_typ (nth_dtyp i) ^ "_set") descr); |
17870 | 465 |
val big_rep_name = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
466 |
space_implode "_" (Old_Datatype_Prop.indexify_names (map_filter |
56253 | 467 |
(fn (i, (@{type_name noption}, _, _)) => NONE |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
468 |
| (i, _) => SOME (Old_Datatype_Aux.name_of_typ (nth_dtyp i))) descr)) ^ "_set"; |
17870 | 469 |
val _ = warning ("big_rep_name: " ^ big_rep_name); |
470 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
471 |
fun strip_option (dtf as Old_Datatype_Aux.DtType ("fun", [dt, Old_Datatype_Aux.DtRec i])) = |
17870 | 472 |
(case AList.lookup op = descr i of |
56253 | 473 |
SOME (@{type_name noption}, _, [(_, [dt']), _]) => |
17870 | 474 |
apfst (cons dt) (strip_option dt') |
475 |
| _ => ([], dtf)) |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
476 |
| strip_option (Old_Datatype_Aux.DtType ("fun", |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
477 |
[dt, Old_Datatype_Aux.DtType (@{type_name noption}, [dt'])])) = |
18261
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
478 |
apfst (cons dt) (strip_option dt') |
17870 | 479 |
| strip_option dt = ([], dt); |
480 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
481 |
val dt_atomTs = distinct op = (map (Old_Datatype_Aux.typ_of_dtyp descr) |
32952 | 482 |
(maps (fn (_, (_, _, cs)) => maps (maps (fst o strip_option) o snd) cs) descr)); |
28731 | 483 |
val dt_atoms = map (fst o dest_Type) dt_atomTs; |
18280
45e139675daf
Corrected atom class constraints in strong induction rule.
berghofe
parents:
18261
diff
changeset
|
484 |
|
17870 | 485 |
fun make_intr s T (cname, cargs) = |
486 |
let |
|
33338 | 487 |
fun mk_prem dt (j, j', prems, ts) = |
17870 | 488 |
let |
489 |
val (dts, dt') = strip_option dt; |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
490 |
val (dts', dt'') = Old_Datatype_Aux.strip_dtyp dt'; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
491 |
val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr) dts; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
492 |
val Us = map (Old_Datatype_Aux.typ_of_dtyp descr) dts'; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
493 |
val T = Old_Datatype_Aux.typ_of_dtyp descr dt''; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
494 |
val free = Old_Datatype_Aux.mk_Free "x" (Us ---> T) j; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
495 |
val free' = Old_Datatype_Aux.app_bnds free (length Us); |
33338 | 496 |
fun mk_abs_fun T (i, t) = |
17870 | 497 |
let val U = fastype_of t |
56253 | 498 |
in (i + 1, Const (@{const_name Nominal.abs_fun}, [T, U, T] ---> |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
499 |
Type (@{type_name noption}, [U])) $ Old_Datatype_Aux.mk_Free "y" T i $ t) |
17870 | 500 |
end |
501 |
in (j + 1, j' + length Ts, |
|
502 |
case dt'' of |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
503 |
Old_Datatype_Aux.DtRec k => Logic.list_all (map (pair "x") Us, |
42364 | 504 |
HOLogic.mk_Trueprop (Free (nth rep_set_names k, |
21021 | 505 |
T --> HOLogic.boolT) $ free')) :: prems |
17870 | 506 |
| _ => prems, |
33338 | 507 |
snd (fold_rev mk_abs_fun Ts (j', free)) :: ts) |
17870 | 508 |
end; |
509 |
||
33338 | 510 |
val (_, _, prems, ts) = fold_rev mk_prem cargs (1, 1, [], []); |
21021 | 511 |
val concl = HOLogic.mk_Trueprop (Free (s, T --> HOLogic.boolT) $ |
512 |
list_comb (Const (cname, map fastype_of ts ---> T), ts)) |
|
17870 | 513 |
in Logic.list_implies (prems, concl) |
514 |
end; |
|
515 |
||
21021 | 516 |
val (intr_ts, (rep_set_names', recTs')) = |
32952 | 517 |
apfst flat (apsnd ListPair.unzip (ListPair.unzip (map_filter |
56253 | 518 |
(fn ((_, (@{type_name noption}, _, _)), _) => NONE |
17870 | 519 |
| ((i, (_, _, constrs)), rep_set_name) => |
520 |
let val T = nth_dtyp i |
|
521 |
in SOME (map (make_intr rep_set_name T) constrs, |
|
21021 | 522 |
(rep_set_name, T)) |
17870 | 523 |
end) |
21021 | 524 |
(descr ~~ rep_set_names)))); |
28965 | 525 |
val rep_set_names'' = map (Sign.full_bname thy3) rep_set_names'; |
17870 | 526 |
|
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
527 |
val ({raw_induct = rep_induct, intrs = rep_intrs, ...}, thy4) = |
33278 | 528 |
thy3 |
529 |
|> Sign.map_naming Name_Space.conceal |
|
33726
0878aecbf119
eliminated slightly odd name space grouping -- now managed by Isar toplevel;
wenzelm
parents:
33669
diff
changeset
|
530 |
|> Inductive.add_inductive_global |
33669 | 531 |
{quiet_mode = false, verbose = false, alt_name = Binding.name big_rep_name, |
49170
03bee3a6a1b7
discontinued obsolete fork_mono to loosen some brakes -- NB: TTY interaction has Goal.future_proofs disabled due to missing Future.worker_task;
wenzelm
parents:
46961
diff
changeset
|
532 |
coind = false, no_elim = true, no_ind = false, skip_mono = true} |
28965 | 533 |
(map (fn (s, T) => ((Binding.name s, T --> HOLogic.boolT), NoSyn)) |
26128 | 534 |
(rep_set_names' ~~ recTs')) |
33278 | 535 |
[] (map (fn x => (Attrib.empty_binding, x)) intr_ts) [] |
52788 | 536 |
||> Sign.restore_naming thy3; |
17870 | 537 |
|
538 |
(**** Prove that representing set is closed under permutation ****) |
|
539 |
||
540 |
val _ = warning "proving closure under permutation..."; |
|
541 |
||
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
542 |
val abs_perm = Global_Theory.get_thms thy4 "abs_perm"; |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
543 |
|
32952 | 544 |
val perm_indnames' = map_filter |
56253 | 545 |
(fn (x, (_, (@{type_name noption}, _, _))) => NONE | (x, _) => SOME x) |
17870 | 546 |
(perm_indnames ~~ descr); |
547 |
||
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
548 |
fun mk_perm_closed name = map (fn th => Drule.export_without_context (th RS mp)) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
549 |
(List.take (Old_Datatype_Aux.split_conj_thm (Goal.prove_global_future thy4 [] [] |
28731 | 550 |
(augment_sort thy4 |
33040 | 551 |
(pt_class_of thy4 name :: map (cp_class_of thy4 name) (remove (op =) name dt_atoms)) |
28731 | 552 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map |
553 |
(fn ((s, T), x) => |
|
554 |
let |
|
555 |
val S = Const (s, T --> HOLogic.boolT); |
|
556 |
val permT = mk_permT (Type (name, [])) |
|
557 |
in HOLogic.mk_imp (S $ Free (x, T), |
|
56253 | 558 |
S $ (Const (@{const_name Nominal.perm}, permT --> T --> T) $ |
28731 | 559 |
Free ("pi", permT) $ Free (x, T))) |
560 |
end) (rep_set_names'' ~~ recTs' ~~ perm_indnames'))))) |
|
51671 | 561 |
(fn {context = ctxt, ...} => EVERY |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
562 |
[Old_Datatype_Aux.ind_tac rep_induct [] 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
563 |
ALLGOALS (simp_tac (ctxt addsimps |
36945 | 564 |
(Thm.symmetric perm_fun_def :: abs_perm))), |
28731 | 565 |
ALLGOALS (resolve_tac rep_intrs THEN_ALL_NEW assume_tac)])), |
17870 | 566 |
length new_type_names)); |
567 |
||
568 |
val perm_closed_thmss = map mk_perm_closed atoms; |
|
569 |
||
570 |
(**** typedef ****) |
|
571 |
||
572 |
val _ = warning "defining type..."; |
|
573 |
||
18366 | 574 |
val (typedefs, thy6) = |
26651 | 575 |
thy4 |
45701 | 576 |
|> fold_map (fn (((name, mx), tvs), (cname, U)) => fn thy => |
58239
1c5bc387bd4c
added flag to 'typedef' to allow concealed definitions
blanchet
parents:
58238
diff
changeset
|
577 |
Typedef.add_typedef_global false |
45701 | 578 |
(name, map (fn (v, _) => (v, dummyS)) tvs, mx) (* FIXME keep constraints!? *) |
37677 | 579 |
(Const (@{const_name Collect}, (U --> HOLogic.boolT) --> HOLogic.mk_setT U) $ |
21021 | 580 |
Const (cname, U --> HOLogic.boolT)) NONE |
581 |
(rtac exI 1 THEN rtac CollectI 1 THEN |
|
17870 | 582 |
QUIET_BREADTH_FIRST (has_fewer_prems 1) |
26475
3cc1e48d0ce1
eliminated quiet_mode ref of some packages (avoid CRITICAL setmp!);
wenzelm
parents:
26359
diff
changeset
|
583 |
(resolve_tac rep_intrs 1)) thy |> (fn ((_, r), thy) => |
17870 | 584 |
let |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
585 |
val permT = mk_permT |
56253 | 586 |
(TFree (singleton (Name.variant_list (map fst tvs)) "'a", @{sort type})); |
17870 | 587 |
val pi = Free ("pi", permT); |
45701 | 588 |
val T = Type (Sign.full_name thy name, map TFree tvs); |
18366 | 589 |
in apfst (pair r o hd) |
45701 | 590 |
(Global_Theory.add_defs_unchecked true |
591 |
[((Binding.map_name (fn n => "prm_" ^ n ^ "_def") name, Logic.mk_equals |
|
56253 | 592 |
(Const (@{const_name Nominal.perm}, permT --> T --> T) $ pi $ Free ("x", T), |
45701 | 593 |
Const (Sign.intern_const thy ("Abs_" ^ Binding.name_of name), U --> T) $ |
56253 | 594 |
(Const (@{const_name Nominal.perm}, permT --> U --> U) $ pi $ |
45701 | 595 |
(Const (Sign.intern_const thy ("Rep_" ^ Binding.name_of name), T --> U) $ |
596 |
Free ("x", T))))), [])] thy) |
|
17870 | 597 |
end)) |
52788 | 598 |
(types_syntax ~~ tyvars ~~ List.take (rep_set_names'' ~~ recTs', length new_type_names)); |
17870 | 599 |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
600 |
val ctxt6 = Proof_Context.init_global thy6; |
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
601 |
|
17870 | 602 |
val perm_defs = map snd typedefs; |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
603 |
val Abs_inverse_thms = map (collect_simp ctxt6 o #Abs_inverse o snd o fst) typedefs; |
35994
9cc3df9a606e
Typedef.info: separate global and local part, only the latter is transformed by morphisms;
wenzelm
parents:
35845
diff
changeset
|
604 |
val Rep_inverse_thms = map (#Rep_inverse o snd o fst) typedefs; |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
605 |
val Rep_thms = map (collect_simp ctxt6 o #Rep o snd o fst) typedefs; |
17870 | 606 |
|
18016 | 607 |
|
17870 | 608 |
(** prove that new types are in class pt_<name> **) |
609 |
||
610 |
val _ = warning "prove that new types are in class pt_<name> ..."; |
|
611 |
||
28731 | 612 |
fun pt_instance (atom, perm_closed_thms) = |
21021 | 613 |
fold (fn ((((((Abs_inverse, Rep_inverse), Rep), |
17870 | 614 |
perm_def), name), tvs), perm_closed) => fn thy => |
28731 | 615 |
let |
616 |
val pt_class = pt_class_of thy atom; |
|
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
617 |
val sort = Sign.minimize_sort thy (Sign.certify_sort thy |
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
618 |
(pt_class :: map (cp_class_of thy atom) (remove (op =) atom dt_atoms))) |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51671
diff
changeset
|
619 |
in Axclass.prove_arity |
17870 | 620 |
(Sign.intern_type thy name, |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
621 |
map (inter_sort thy sort o snd) tvs, [pt_class]) |
51671 | 622 |
(fn ctxt => EVERY [Class.intro_classes_tac [], |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
623 |
rewrite_goals_tac ctxt [perm_def], |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
624 |
asm_full_simp_tac (ctxt addsimps [Rep_inverse]) 1, |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
625 |
asm_full_simp_tac (ctxt addsimps |
17870 | 626 |
[Rep RS perm_closed RS Abs_inverse]) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
627 |
asm_full_simp_tac (put_simpset HOL_basic_ss ctxt addsimps [Global_Theory.get_thm thy |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
628 |
("pt_" ^ Long_Name.base_name atom ^ "3")]) 1]) thy |
28731 | 629 |
end) |
21021 | 630 |
(Abs_inverse_thms ~~ Rep_inverse_thms ~~ Rep_thms ~~ perm_defs ~~ |
631 |
new_type_names ~~ tyvars ~~ perm_closed_thms); |
|
17870 | 632 |
|
633 |
||
634 |
(** prove that new types are in class cp_<name1>_<name2> **) |
|
635 |
||
636 |
val _ = warning "prove that new types are in class cp_<name1>_<name2> ..."; |
|
637 |
||
638 |
fun cp_instance (atom1, perm_closed_thms1) (atom2, perm_closed_thms2) thy = |
|
639 |
let |
|
28731 | 640 |
val cp_class = cp_class_of thy atom1 atom2; |
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
641 |
val sort = Sign.minimize_sort thy (Sign.certify_sort thy |
33040 | 642 |
(pt_class_of thy atom1 :: map (cp_class_of thy atom1) (remove (op =) atom1 dt_atoms) @ |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
643 |
(if atom1 = atom2 then [cp_class_of thy atom1 atom1] else |
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
644 |
pt_class_of thy atom2 :: map (cp_class_of thy atom2) (remove (op =) atom2 dt_atoms)))); |
28731 | 645 |
val cp1' = cp_inst_of thy atom1 atom2 RS cp1 |
21021 | 646 |
in fold (fn ((((((Abs_inverse, Rep), |
17870 | 647 |
perm_def), name), tvs), perm_closed1), perm_closed2) => fn thy => |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51671
diff
changeset
|
648 |
Axclass.prove_arity |
17870 | 649 |
(Sign.intern_type thy name, |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
650 |
map (inter_sort thy sort o snd) tvs, [cp_class]) |
51671 | 651 |
(fn ctxt => EVERY [Class.intro_classes_tac [], |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
652 |
rewrite_goals_tac ctxt [perm_def], |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
653 |
asm_full_simp_tac (ctxt addsimps |
17870 | 654 |
((Rep RS perm_closed1 RS Abs_inverse) :: |
655 |
(if atom1 = atom2 then [] |
|
656 |
else [Rep RS perm_closed2 RS Abs_inverse]))) 1, |
|
58956
a816aa3ff391
proper context for compose_tac, Splitter.split_tac (relevant for unify trace options);
wenzelm
parents:
58372
diff
changeset
|
657 |
cong_tac ctxt 1, |
17870 | 658 |
rtac refl 1, |
659 |
rtac cp1' 1]) thy) |
|
21021 | 660 |
(Abs_inverse_thms ~~ Rep_thms ~~ perm_defs ~~ new_type_names ~~ |
661 |
tyvars ~~ perm_closed_thms1 ~~ perm_closed_thms2) thy |
|
17870 | 662 |
end; |
663 |
||
664 |
val thy7 = fold (fn x => fn thy => thy |> |
|
665 |
pt_instance x |> |
|
28731 | 666 |
fold (cp_instance x) (atoms ~~ perm_closed_thmss)) |
52788 | 667 |
(atoms ~~ perm_closed_thmss) thy6; |
17870 | 668 |
|
669 |
(**** constructors ****) |
|
670 |
||
33338 | 671 |
fun mk_abs_fun x t = |
17870 | 672 |
let |
673 |
val T = fastype_of x; |
|
674 |
val U = fastype_of t |
|
675 |
in |
|
56253 | 676 |
Const (@{const_name Nominal.abs_fun}, T --> U --> T --> |
677 |
Type (@{type_name noption}, [U])) $ x $ t |
|
17870 | 678 |
end; |
679 |
||
30190 | 680 |
val (ty_idxs, _) = List.foldl |
56253 | 681 |
(fn ((i, (@{type_name noption}, _, _)), p) => p |
18016 | 682 |
| ((i, _), (ty_idxs, j)) => (ty_idxs @ [(i, j)], j + 1)) ([], 0) descr; |
683 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
684 |
fun reindex (Old_Datatype_Aux.DtType (s, dts)) = Old_Datatype_Aux.DtType (s, map reindex dts) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
685 |
| reindex (Old_Datatype_Aux.DtRec i) = |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
686 |
Old_Datatype_Aux.DtRec (the (AList.lookup op = ty_idxs i)) |
18016 | 687 |
| reindex dt = dt; |
688 |
||
40627
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
39557
diff
changeset
|
689 |
fun strip_suffix i s = implode (List.take (raw_explode s, size s - i)); (* FIXME Symbol.explode (?) *) |
18016 | 690 |
|
691 |
(** strips the "_Rep" in type names *) |
|
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
692 |
fun strip_nth_name i s = |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
693 |
let val xs = Long_Name.explode s; |
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
694 |
in Long_Name.implode (Library.nth_map (length xs - i) (strip_suffix 4) xs) end; |
18016 | 695 |
|
31458 | 696 |
val (descr'', ndescr) = ListPair.unzip (map_filter |
56253 | 697 |
(fn (i, (@{type_name noption}, _, _)) => NONE |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
698 |
| (i, (s, dts, constrs)) => |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
699 |
let |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
700 |
val SOME index = AList.lookup op = ty_idxs i; |
31458 | 701 |
val (constrs2, constrs1) = |
702 |
map_split (fn (cname, cargs) => |
|
703 |
apsnd (pair (strip_nth_name 2 (strip_nth_name 1 cname))) |
|
704 |
(fold_map (fn dt => fn dts => |
|
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
705 |
let val (dts', dt') = strip_option dt |
31458 | 706 |
in ((length dts, length dts'), dts @ dts' @ [reindex dt']) end) |
707 |
cargs [])) constrs |
|
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
708 |
in SOME ((index, (strip_nth_name 1 s, map reindex dts, constrs1)), |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
709 |
(index, constrs2)) |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
710 |
end) descr); |
18045 | 711 |
|
19489 | 712 |
val (descr1, descr2) = chop (length new_type_names) descr''; |
18016 | 713 |
val descr' = [descr1, descr2]; |
714 |
||
19710 | 715 |
fun partition_cargs idxs xs = map (fn (i, j) => |
42364 | 716 |
(List.take (List.drop (xs, i), j), nth xs (i + j))) idxs; |
19710 | 717 |
|
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
718 |
val pdescr = map (fn ((i, (s, dts, constrs)), (_, idxss)) => (i, (s, dts, |
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
719 |
map (fn ((cname, cargs), idxs) => (cname, partition_cargs idxs cargs)) |
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
720 |
(constrs ~~ idxss)))) (descr'' ~~ ndescr); |
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
721 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
722 |
fun nth_dtyp' i = Old_Datatype_Aux.typ_of_dtyp descr'' (Old_Datatype_Aux.DtRec i); |
17870 | 723 |
|
724 |
val rep_names = map (fn s => |
|
725 |
Sign.intern_const thy7 ("Rep_" ^ s)) new_type_names; |
|
726 |
val abs_names = map (fn s => |
|
727 |
Sign.intern_const thy7 ("Abs_" ^ s)) new_type_names; |
|
728 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
729 |
val recTs = Old_Datatype_Aux.get_rec_types descr''; |
33957 | 730 |
val newTs' = take (length new_type_names) recTs'; |
731 |
val newTs = take (length new_type_names) recTs; |
|
17870 | 732 |
|
28965 | 733 |
val full_new_type_names = map (Sign.full_bname thy) new_type_names; |
17870 | 734 |
|
33244 | 735 |
fun make_constr_def tname T T' (((cname_rep, _), (cname, cargs)), (cname', mx)) |
736 |
(thy, defs, eqns) = |
|
17870 | 737 |
let |
33338 | 738 |
fun constr_arg (dts, dt) (j, l_args, r_args) = |
17870 | 739 |
let |
45838 | 740 |
val xs = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
741 |
map (fn (dt, i) => |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
742 |
Old_Datatype_Aux.mk_Free "x" (Old_Datatype_Aux.typ_of_dtyp descr'' dt) i) |
45838 | 743 |
(dts ~~ (j upto j + length dts - 1)) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
744 |
val x = |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
745 |
Old_Datatype_Aux.mk_Free "x" (Old_Datatype_Aux.typ_of_dtyp descr'' dt) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
746 |
(j + length dts) |
18261
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
747 |
in |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
748 |
(j + length dts + 1, |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
749 |
xs @ x :: l_args, |
33338 | 750 |
fold_rev mk_abs_fun xs |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
751 |
(case dt of |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
752 |
Old_Datatype_Aux.DtRec k => if k < length new_type_names then |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
753 |
Const (nth rep_names k, Old_Datatype_Aux.typ_of_dtyp descr'' dt --> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
754 |
Old_Datatype_Aux.typ_of_dtyp descr dt) $ x |
58372
bfd497f2f4c2
moved 'old_datatype' out of 'Main' (but put it in 'HOL-Proofs' because of the inductive realizer)
blanchet
parents:
58354
diff
changeset
|
755 |
else error "nested recursion not supported" |
33338 | 756 |
| _ => x) :: r_args) |
17870 | 757 |
end |
758 |
||
33338 | 759 |
val (_, l_args, r_args) = fold_rev constr_arg cargs (1, [], []); |
22578 | 760 |
val abs_name = Sign.intern_const thy ("Abs_" ^ tname); |
761 |
val rep_name = Sign.intern_const thy ("Rep_" ^ tname); |
|
17870 | 762 |
val constrT = map fastype_of l_args ---> T; |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
763 |
val lhs = list_comb (Const (cname, constrT), l_args); |
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
764 |
val rhs = list_comb (Const (cname_rep, map fastype_of r_args ---> T'), r_args); |
17870 | 765 |
val def = Logic.mk_equals (lhs, Const (abs_name, T' --> T) $ rhs); |
766 |
val eqn = HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
767 |
(Const (rep_name, T --> T') $ lhs, rhs)); |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
768 |
val def_name = (Long_Name.base_name cname) ^ "_def"; |
18366 | 769 |
val ([def_thm], thy') = thy |> |
56239 | 770 |
Sign.add_consts [(cname', constrT, mx)] |> |
52788 | 771 |
(Global_Theory.add_defs false o map Thm.no_attributes) [(Binding.name def_name, def)]; |
17870 | 772 |
in (thy', defs @ [def_thm], eqns @ [eqn]) end; |
773 |
||
33244 | 774 |
fun dt_constr_defs ((((((_, (_, _, constrs)), |
775 |
(_, (_, _, constrs'))), tname), T), T'), constr_syntax) (thy, defs, eqns, dist_lemmas) = |
|
17870 | 776 |
let |
777 |
val rep_const = cterm_of thy |
|
778 |
(Const (Sign.intern_const thy ("Rep_" ^ tname), T --> T')); |
|
33244 | 779 |
val dist = |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
780 |
Drule.export_without_context |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
781 |
(cterm_instantiate [(cterm_of thy distinct_f, rep_const)] Old_Datatype.distinct_lemma); |
33244 | 782 |
val (thy', defs', eqns') = fold (make_constr_def tname T T') |
783 |
(constrs ~~ constrs' ~~ constr_syntax) (Sign.add_path tname thy, defs, []) |
|
17870 | 784 |
in |
52788 | 785 |
(Sign.parent_path thy', defs', eqns @ [eqns'], dist_lemmas @ [dist]) |
17870 | 786 |
end; |
787 |
||
33244 | 788 |
val (thy8, constr_defs, constr_rep_eqns, dist_lemmas) = fold dt_constr_defs |
789 |
(List.take (descr, length new_type_names) ~~ |
|
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
790 |
List.take (pdescr, length new_type_names) ~~ |
33244 | 791 |
new_type_names ~~ newTs ~~ newTs' ~~ constr_syntax) |
792 |
(thy7, [], [], []); |
|
17870 | 793 |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
794 |
val abs_inject_thms = map (collect_simp ctxt6 o #Abs_inject o snd o fst) typedefs |
35994
9cc3df9a606e
Typedef.info: separate global and local part, only the latter is transformed by morphisms;
wenzelm
parents:
35845
diff
changeset
|
795 |
val rep_inject_thms = map (#Rep_inject o snd o fst) typedefs |
17870 | 796 |
|
797 |
(* prove theorem Rep_i (Constr_j ...) = Constr'_j ... *) |
|
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
798 |
|
17870 | 799 |
fun prove_constr_rep_thm eqn = |
800 |
let |
|
801 |
val inj_thms = map (fn r => r RS iffD1) abs_inject_thms; |
|
21021 | 802 |
val rewrites = constr_defs @ map mk_meta_eq Rep_inverse_thms |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
803 |
in Goal.prove_global_future thy8 [] [] eqn (fn {context = ctxt, ...} => EVERY |
17870 | 804 |
[resolve_tac inj_thms 1, |
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
805 |
rewrite_goals_tac ctxt rewrites, |
17870 | 806 |
rtac refl 3, |
807 |
resolve_tac rep_intrs 2, |
|
21021 | 808 |
REPEAT (resolve_tac Rep_thms 1)]) |
17870 | 809 |
end; |
810 |
||
811 |
val constr_rep_thmss = map (map prove_constr_rep_thm) constr_rep_eqns; |
|
812 |
||
813 |
(* prove theorem pi \<bullet> Rep_i x = Rep_i (pi \<bullet> x) *) |
|
814 |
||
815 |
fun prove_perm_rep_perm (atom, perm_closed_thms) = map (fn th => |
|
816 |
let |
|
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35842
diff
changeset
|
817 |
val _ $ (_ $ (Rep $ x)) = Logic.unvarify_global (prop_of th); |
17870 | 818 |
val Type ("fun", [T, U]) = fastype_of Rep; |
819 |
val permT = mk_permT (Type (atom, [])); |
|
820 |
val pi = Free ("pi", permT); |
|
821 |
in |
|
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
822 |
Goal.prove_global_future thy8 [] [] |
28731 | 823 |
(augment_sort thy8 |
33040 | 824 |
(pt_class_of thy8 atom :: map (cp_class_of thy8 atom) (remove (op =) atom dt_atoms)) |
28731 | 825 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
56253 | 826 |
(Const (@{const_name Nominal.perm}, permT --> U --> U) $ pi $ (Rep $ x), |
827 |
Rep $ (Const (@{const_name Nominal.perm}, permT --> T --> T) $ pi $ x))))) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
828 |
(fn {context = ctxt, ...} => |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
829 |
simp_tac (put_simpset HOL_basic_ss ctxt addsimps (perm_defs @ Abs_inverse_thms @ |
20046 | 830 |
perm_closed_thms @ Rep_thms)) 1) |
17870 | 831 |
end) Rep_thms; |
832 |
||
32952 | 833 |
val perm_rep_perm_thms = maps prove_perm_rep_perm (atoms ~~ perm_closed_thmss); |
17870 | 834 |
|
835 |
(* prove distinctness theorems *) |
|
836 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
837 |
val distinct_props = Old_Datatype_Prop.make_distincts descr'; |
27300
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27275
diff
changeset
|
838 |
val dist_rewrites = map2 (fn rep_thms => fn dist_lemma => |
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27275
diff
changeset
|
839 |
dist_lemma :: rep_thms @ [In0_eq, In1_eq, In0_not_In1, In1_not_In0]) |
4cb3101d2bf7
DatatypeProp.make_distincts: only one half of each symmetric pair is constructed
haftmann
parents:
27275
diff
changeset
|
840 |
constr_rep_thmss dist_lemmas; |
17870 | 841 |
|
45889 | 842 |
fun prove_distinct_thms _ [] = [] |
843 |
| prove_distinct_thms (p as (rep_thms, dist_lemma)) (t :: ts) = |
|
17870 | 844 |
let |
51671 | 845 |
val dist_thm = Goal.prove_global_future thy8 [] [] t (fn {context = ctxt, ...} => |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
846 |
simp_tac (ctxt addsimps (dist_lemma :: rep_thms)) 1) |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
847 |
in |
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
848 |
dist_thm :: Drule.export_without_context (dist_thm RS not_sym) :: |
45889 | 849 |
prove_distinct_thms p ts |
17870 | 850 |
end; |
851 |
||
26969
cf3f998d0631
moved case distinction over number of constructors for distinctness rules from DatatypeProp to DatatypeRepProofs
haftmann
parents:
26966
diff
changeset
|
852 |
val distinct_thms = map2 prove_distinct_thms |
cf3f998d0631
moved case distinction over number of constructors for distinctness rules from DatatypeProp to DatatypeRepProofs
haftmann
parents:
26966
diff
changeset
|
853 |
(constr_rep_thmss ~~ dist_lemmas) distinct_props; |
17870 | 854 |
|
855 |
(** prove equations for permutation functions **) |
|
856 |
||
857 |
val perm_simps' = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) => |
|
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
858 |
let val T = nth_dtyp' i |
32952 | 859 |
in maps (fn (atom, perm_closed_thms) => |
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
860 |
map (fn ((cname, dts), constr_rep_thm) => |
17870 | 861 |
let |
862 |
val cname = Sign.intern_const thy8 |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
863 |
(Long_Name.append tname (Long_Name.base_name cname)); |
17870 | 864 |
val permT = mk_permT (Type (atom, [])); |
865 |
val pi = Free ("pi", permT); |
|
866 |
||
867 |
fun perm t = |
|
868 |
let val T = fastype_of t |
|
56253 | 869 |
in Const (@{const_name Nominal.perm}, permT --> T --> T) $ pi $ t end; |
17870 | 870 |
|
33338 | 871 |
fun constr_arg (dts, dt) (j, l_args, r_args) = |
17870 | 872 |
let |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
873 |
val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr'') dts; |
45838 | 874 |
val xs = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
875 |
map (fn (T, i) => Old_Datatype_Aux.mk_Free "x" T i) |
45838 | 876 |
(Ts ~~ (j upto j + length dts - 1)); |
877 |
val x = |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
878 |
Old_Datatype_Aux.mk_Free "x" (Old_Datatype_Aux.typ_of_dtyp descr'' dt) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
879 |
(j + length dts); |
18261
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
880 |
in |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
881 |
(j + length dts + 1, |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
882 |
xs @ x :: l_args, |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
883 |
map perm (xs @ [x]) @ r_args) |
17870 | 884 |
end |
885 |
||
33338 | 886 |
val (_, l_args, r_args) = fold_rev constr_arg dts (1, [], []); |
17870 | 887 |
val c = Const (cname, map fastype_of l_args ---> T) |
888 |
in |
|
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
889 |
Goal.prove_global_future thy8 [] [] |
28731 | 890 |
(augment_sort thy8 |
33040 | 891 |
(pt_class_of thy8 atom :: map (cp_class_of thy8 atom) (remove (op =) atom dt_atoms)) |
28731 | 892 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
893 |
(perm (list_comb (c, l_args)), list_comb (c, r_args))))) |
|
51671 | 894 |
(fn {context = ctxt, ...} => EVERY |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
895 |
[simp_tac (ctxt addsimps (constr_rep_thm :: perm_defs)) 1, |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
896 |
simp_tac (put_simpset HOL_basic_ss ctxt addsimps (Rep_thms @ Abs_inverse_thms @ |
17870 | 897 |
constr_defs @ perm_closed_thms)) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
898 |
TRY (simp_tac (put_simpset HOL_basic_ss ctxt addsimps |
36945 | 899 |
(Thm.symmetric perm_fun_def :: abs_perm)) 1), |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
900 |
TRY (simp_tac (put_simpset HOL_basic_ss ctxt addsimps |
17870 | 901 |
(perm_fun_def :: perm_defs @ Rep_thms @ Abs_inverse_thms @ |
20046 | 902 |
perm_closed_thms)) 1)]) |
32952 | 903 |
end) (constrs ~~ constr_rep_thms)) (atoms ~~ perm_closed_thmss) |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
904 |
end) (List.take (pdescr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss); |
17870 | 905 |
|
906 |
(** prove injectivity of constructors **) |
|
907 |
||
908 |
val rep_inject_thms' = map (fn th => th RS sym) rep_inject_thms; |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
909 |
val alpha = Global_Theory.get_thms thy8 "alpha"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
910 |
val abs_fresh = Global_Theory.get_thms thy8 "abs_fresh"; |
17870 | 911 |
|
28731 | 912 |
val pt_cp_sort = |
913 |
map (pt_class_of thy8) dt_atoms @ |
|
33040 | 914 |
maps (fn s => map (cp_class_of thy8 s) (remove (op =) s dt_atoms)) dt_atoms; |
28731 | 915 |
|
17870 | 916 |
val inject_thms = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) => |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
917 |
let val T = nth_dtyp' i |
32952 | 918 |
in map_filter (fn ((cname, dts), constr_rep_thm) => |
17870 | 919 |
if null dts then NONE else SOME |
920 |
let |
|
921 |
val cname = Sign.intern_const thy8 |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
922 |
(Long_Name.append tname (Long_Name.base_name cname)); |
17870 | 923 |
|
33338 | 924 |
fun make_inj (dts, dt) (j, args1, args2, eqs) = |
17870 | 925 |
let |
45838 | 926 |
val Ts_idx = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
927 |
map (Old_Datatype_Aux.typ_of_dtyp descr'') dts ~~ (j upto j + length dts - 1); |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
928 |
val xs = map (fn (T, i) => Old_Datatype_Aux.mk_Free "x" T i) Ts_idx; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
929 |
val ys = map (fn (T, i) => Old_Datatype_Aux.mk_Free "y" T i) Ts_idx; |
45838 | 930 |
val x = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
931 |
Old_Datatype_Aux.mk_Free "x" (Old_Datatype_Aux.typ_of_dtyp descr'' dt) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
932 |
(j + length dts); |
45838 | 933 |
val y = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
934 |
Old_Datatype_Aux.mk_Free "y" (Old_Datatype_Aux.typ_of_dtyp descr'' dt) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
935 |
(j + length dts); |
18261
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
936 |
in |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
937 |
(j + length dts + 1, |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
938 |
xs @ (x :: args1), ys @ (y :: args2), |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
939 |
HOLogic.mk_eq |
33338 | 940 |
(fold_rev mk_abs_fun xs x, fold_rev mk_abs_fun ys y) :: eqs) |
17870 | 941 |
end; |
942 |
||
33338 | 943 |
val (_, args1, args2, eqs) = fold_rev make_inj dts (1, [], [], []); |
17870 | 944 |
val Ts = map fastype_of args1; |
945 |
val c = Const (cname, Ts ---> T) |
|
946 |
in |
|
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
947 |
Goal.prove_global_future thy8 [] [] |
28731 | 948 |
(augment_sort thy8 pt_cp_sort |
949 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
|
950 |
(HOLogic.mk_eq (list_comb (c, args1), list_comb (c, args2)), |
|
951 |
foldr1 HOLogic.mk_conj eqs)))) |
|
51671 | 952 |
(fn {context = ctxt, ...} => EVERY |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
953 |
[asm_full_simp_tac (ctxt addsimps (constr_rep_thm :: |
17870 | 954 |
rep_inject_thms')) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
955 |
TRY (asm_full_simp_tac (put_simpset HOL_basic_ss ctxt |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
956 |
addsimps (fresh_def :: supp_def :: |
17870 | 957 |
alpha @ abs_perm @ abs_fresh @ rep_inject_thms @ |
28731 | 958 |
perm_rep_perm_thms)) 1)]) |
17870 | 959 |
end) (constrs ~~ constr_rep_thms) |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
960 |
end) (List.take (pdescr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss); |
17870 | 961 |
|
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
962 |
(** equations for support and freshness **) |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
963 |
|
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
964 |
val (supp_thms, fresh_thms) = ListPair.unzip (map ListPair.unzip |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
965 |
(map (fn ((((i, (_, _, constrs)), tname), inject_thms'), perm_thms') => |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
966 |
let val T = nth_dtyp' i |
32952 | 967 |
in maps (fn (cname, dts) => map (fn atom => |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
968 |
let |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
969 |
val cname = Sign.intern_const thy8 |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
970 |
(Long_Name.append tname (Long_Name.base_name cname)); |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
971 |
val atomT = Type (atom, []); |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
972 |
|
33338 | 973 |
fun process_constr (dts, dt) (j, args1, args2) = |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
974 |
let |
45838 | 975 |
val Ts_idx = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
976 |
map (Old_Datatype_Aux.typ_of_dtyp descr'') dts ~~ (j upto j + length dts - 1); |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
977 |
val xs = map (fn (T, i) => Old_Datatype_Aux.mk_Free "x" T i) Ts_idx; |
45838 | 978 |
val x = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
979 |
Old_Datatype_Aux.mk_Free "x" (Old_Datatype_Aux.typ_of_dtyp descr'' dt) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
980 |
(j + length dts); |
18261
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
981 |
in |
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
982 |
(j + length dts + 1, |
33338 | 983 |
xs @ (x :: args1), fold_rev mk_abs_fun xs x :: args2) |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
984 |
end; |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
985 |
|
33338 | 986 |
val (_, args1, args2) = fold_rev process_constr dts (1, [], []); |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
987 |
val Ts = map fastype_of args1; |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
988 |
val c = list_comb (Const (cname, Ts ---> T), args1); |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
989 |
fun supp t = |
56253 | 990 |
Const (@{const_name Nominal.supp}, fastype_of t --> HOLogic.mk_setT atomT) $ t; |
25823 | 991 |
fun fresh t = fresh_const atomT (fastype_of t) $ Free ("a", atomT) $ t; |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
992 |
val supp_thm = Goal.prove_global_future thy8 [] [] |
28731 | 993 |
(augment_sort thy8 pt_cp_sort |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
994 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
995 |
(supp c, |
30450 | 996 |
if null dts then HOLogic.mk_set atomT [] |
35402 | 997 |
else foldr1 (HOLogic.mk_binop @{const_abbrev union}) (map supp args2))))) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
998 |
(fn {context = ctxt, ...} => |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
999 |
simp_tac (put_simpset HOL_basic_ss ctxt addsimps (supp_def :: |
46161 | 1000 |
Un_assoc :: @{thm de_Morgan_conj} :: Collect_disj_eq :: finite_Un :: |
45654 | 1001 |
Collect_False_empty :: finite_emptyI :: @{thms simp_thms} @ |
20046 | 1002 |
abs_perm @ abs_fresh @ inject_thms' @ perm_thms')) 1) |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
1003 |
in |
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
1004 |
(supp_thm, |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1005 |
Goal.prove_global_future thy8 [] [] (augment_sort thy8 pt_cp_sort |
28731 | 1006 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
1007 |
(fresh c, |
|
45740 | 1008 |
if null dts then @{term True} |
28731 | 1009 |
else foldr1 HOLogic.mk_conj (map fresh args2))))) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1010 |
(fn {context = ctxt, ...} => |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1011 |
simp_tac (put_simpset HOL_ss ctxt addsimps [Un_iff, empty_iff, fresh_def, supp_thm]) 1)) |
32952 | 1012 |
end) atoms) constrs |
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
1013 |
end) (List.take (pdescr, length new_type_names) ~~ new_type_names ~~ inject_thms ~~ perm_simps'))); |
17872
f08fc98a164a
Implemented proofs for support and freshness theorems.
berghofe
parents:
17870
diff
changeset
|
1014 |
|
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1015 |
(**** weak induction theorem ****) |
18016 | 1016 |
|
33244 | 1017 |
fun mk_indrule_lemma (((i, _), T), U) (prems, concls) = |
18016 | 1018 |
let |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1019 |
val Rep_t = Const (nth rep_names i, T --> U) $ Old_Datatype_Aux.mk_Free "x" T i; |
18016 | 1020 |
|
42364 | 1021 |
val Abs_t = Const (nth abs_names i, U --> T); |
18016 | 1022 |
|
45838 | 1023 |
in |
1024 |
(prems @ [HOLogic.imp $ |
|
42364 | 1025 |
(Const (nth rep_set_names'' i, U --> HOLogic.boolT) $ Rep_t) $ |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1026 |
(Old_Datatype_Aux.mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ (Abs_t $ Rep_t))], |
45838 | 1027 |
concls @ |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1028 |
[Old_Datatype_Aux.mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1029 |
Old_Datatype_Aux.mk_Free "x" T i]) |
18016 | 1030 |
end; |
1031 |
||
1032 |
val (indrule_lemma_prems, indrule_lemma_concls) = |
|
33244 | 1033 |
fold mk_indrule_lemma (descr'' ~~ recTs ~~ recTs') ([], []); |
18016 | 1034 |
|
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1035 |
val indrule_lemma = Goal.prove_global_future thy8 [] [] |
18016 | 1036 |
(Logic.mk_implies |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1037 |
(HOLogic.mk_Trueprop (Old_Datatype_Aux.mk_conj indrule_lemma_prems), |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1038 |
HOLogic.mk_Trueprop (Old_Datatype_Aux.mk_conj indrule_lemma_concls))) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1039 |
(fn {context = ctxt, ...} => EVERY |
18016 | 1040 |
[REPEAT (etac conjE 1), |
1041 |
REPEAT (EVERY |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1042 |
[TRY (rtac conjI 1), |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1043 |
full_simp_tac (put_simpset HOL_basic_ss ctxt addsimps Rep_inverse_thms) 1, |
20046 | 1044 |
etac mp 1, resolve_tac Rep_thms 1])]); |
18016 | 1045 |
|
1046 |
val Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule_lemma))); |
|
1047 |
val frees = if length Ps = 1 then [Free ("P", snd (dest_Var (hd Ps)))] else |
|
1048 |
map (Free o apfst fst o dest_Var) Ps; |
|
1049 |
val indrule_lemma' = cterm_instantiate |
|
1050 |
(map (cterm_of thy8) Ps ~~ map (cterm_of thy8) frees) indrule_lemma; |
|
1051 |
||
19833
3a3f591c838d
- Changed naming scheme: names of "internal" constructors now have
berghofe
parents:
19710
diff
changeset
|
1052 |
val Abs_inverse_thms' = map (fn r => r RS subst) Abs_inverse_thms; |
18016 | 1053 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1054 |
val dt_induct_prop = Old_Datatype_Prop.make_ind descr'; |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1055 |
val dt_induct = Goal.prove_global_future thy8 [] |
18016 | 1056 |
(Logic.strip_imp_prems dt_induct_prop) (Logic.strip_imp_concl dt_induct_prop) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1057 |
(fn {prems, context = ctxt} => EVERY |
18016 | 1058 |
[rtac indrule_lemma' 1, |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1059 |
(Old_Datatype_Aux.ind_tac rep_induct [] THEN_ALL_NEW Object_Logic.atomize_prems_tac ctxt) 1, |
18016 | 1060 |
EVERY (map (fn (prem, r) => (EVERY |
1061 |
[REPEAT (eresolve_tac Abs_inverse_thms' 1), |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1062 |
simp_tac (put_simpset HOL_basic_ss ctxt addsimps [Thm.symmetric r]) 1, |
18016 | 1063 |
DEPTH_SOLVE_1 (ares_tac [prem] 1 ORELSE etac allE 1)])) |
20046 | 1064 |
(prems ~~ constr_defs))]); |
18016 | 1065 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1066 |
val case_names_induct = Old_Datatype_Data.mk_case_names_induct descr''; |
18016 | 1067 |
|
18066
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1068 |
(**** prove that new datatypes have finite support ****) |
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1069 |
|
18246
676d2e625d98
added fsub.thy (poplmark challenge) to the examples
urbanc
parents:
18245
diff
changeset
|
1070 |
val _ = warning "proving finite support for the new datatype"; |
676d2e625d98
added fsub.thy (poplmark challenge) to the examples
urbanc
parents:
18245
diff
changeset
|
1071 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1072 |
val indnames = Old_Datatype_Prop.make_tnames recTs; |
18066
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1073 |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1074 |
val abs_supp = Global_Theory.get_thms thy8 "abs_supp"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1075 |
val supp_atm = Global_Theory.get_thms thy8 "supp_atm"; |
18066
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1076 |
|
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1077 |
val finite_supp_thms = map (fn atom => |
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1078 |
let val atomT = Type (atom, []) |
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
1079 |
in map Drule.export_without_context (List.take |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1080 |
(Old_Datatype_Aux.split_conj_thm (Goal.prove_global_future thy8 [] [] |
28731 | 1081 |
(augment_sort thy8 (fs_class_of thy8 atom :: pt_cp_sort) |
1082 |
(HOLogic.mk_Trueprop |
|
1083 |
(foldr1 HOLogic.mk_conj (map (fn (s, T) => |
|
56253 | 1084 |
Const (@{const_name finite}, HOLogic.mk_setT atomT --> HOLogic.boolT) $ |
1085 |
(Const (@{const_name Nominal.supp}, T --> HOLogic.mk_setT atomT) $ Free (s, T))) |
|
28731 | 1086 |
(indnames ~~ recTs))))) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1087 |
(fn {context = ctxt, ...} => Old_Datatype_Aux.ind_tac dt_induct indnames 1 THEN |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1088 |
ALLGOALS (asm_full_simp_tac (ctxt addsimps |
18067 | 1089 |
(abs_supp @ supp_atm @ |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1090 |
Global_Theory.get_thms thy8 ("fs_" ^ Long_Name.base_name atom ^ "1") @ |
32952 | 1091 |
flat supp_thms))))), |
18066
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1092 |
length new_type_names)) |
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1093 |
end) atoms; |
d1e47ee13070
Added code for proving that new datatype has finite support.
berghofe
parents:
18054
diff
changeset
|
1094 |
|
18759 | 1095 |
val simp_atts = replicate (length new_type_names) [Simplifier.simp_add]; |
18658 | 1096 |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32957
diff
changeset
|
1097 |
(* Function to add both the simp and eqvt attributes *) |
22245
1b8f4ef50c48
moved the infrastructure from the nominal_tags file to nominal_thmdecls
urbanc
parents:
22231
diff
changeset
|
1098 |
(* These two attributes are duplicated on all the types in the mutual nominal datatypes *) |
1b8f4ef50c48
moved the infrastructure from the nominal_tags file to nominal_thmdecls
urbanc
parents:
22231
diff
changeset
|
1099 |
|
1b8f4ef50c48
moved the infrastructure from the nominal_tags file to nominal_thmdecls
urbanc
parents:
22231
diff
changeset
|
1100 |
val simp_eqvt_atts = replicate (length new_type_names) [Simplifier.simp_add, NominalThmDecls.eqvt_add]; |
1b8f4ef50c48
moved the infrastructure from the nominal_tags file to nominal_thmdecls
urbanc
parents:
22231
diff
changeset
|
1101 |
|
18658 | 1102 |
val (_, thy9) = thy8 |> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24459
diff
changeset
|
1103 |
Sign.add_path big_name |> |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1104 |
Global_Theory.add_thms [((Binding.name "induct", dt_induct), [case_names_induct])] ||>> |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1105 |
Global_Theory.add_thmss [((Binding.name "inducts", projections dt_induct), [case_names_induct])] ||> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24459
diff
changeset
|
1106 |
Sign.parent_path ||>> |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1107 |
Old_Datatype_Aux.store_thmss_atts "distinct" new_type_names simp_atts distinct_thms ||>> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1108 |
Old_Datatype_Aux.store_thmss "constr_rep" new_type_names constr_rep_thmss ||>> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1109 |
Old_Datatype_Aux.store_thmss_atts "perm" new_type_names simp_eqvt_atts perm_simps' ||>> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1110 |
Old_Datatype_Aux.store_thmss "inject" new_type_names inject_thms ||>> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1111 |
Old_Datatype_Aux.store_thmss "supp" new_type_names supp_thms ||>> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1112 |
Old_Datatype_Aux.store_thmss_atts "fresh" new_type_names simp_atts fresh_thms ||> |
18658 | 1113 |
fold (fn (atom, ths) => fn thy => |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
1114 |
let |
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
1115 |
val class = fs_class_of thy atom; |
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
1116 |
val sort = Sign.minimize_sort thy (Sign.certify_sort thy (class :: pt_cp_sort)); |
51685
385ef6706252
more standard module name Axclass (according to file name);
wenzelm
parents:
51671
diff
changeset
|
1117 |
in fold (fn Type (s, Ts) => Axclass.prove_arity |
28736
b1fd60fee652
Some modifications in code for proving arities to make it work for datatype
berghofe
parents:
28731
diff
changeset
|
1118 |
(s, map (inter_sort thy sort o snd o dest_TFree) Ts, [class]) |
51671 | 1119 |
(fn _ => Class.intro_classes_tac [] THEN resolve_tac ths 1)) newTs thy |
52788 | 1120 |
end) (atoms ~~ finite_supp_thms); |
18658 | 1121 |
|
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1122 |
(**** strong induction theorem ****) |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1123 |
|
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1124 |
val pnames = if length descr'' = 1 then ["P"] |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1125 |
else map (fn i => "P" ^ string_of_int i) (1 upto length descr''); |
56253 | 1126 |
val ind_sort = if null dt_atomTs then @{sort type} |
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
1127 |
else Sign.minimize_sort thy9 (Sign.certify_sort thy9 (map (fs_class_of thy9) dt_atoms)); |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1128 |
val fsT = TFree ("'n", ind_sort); |
56253 | 1129 |
val fsT' = TFree ("'n", @{sort type}); |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1130 |
|
18658 | 1131 |
val fresh_fs = map (fn (s, T) => (T, Free (s, fsT' --> HOLogic.mk_setT T))) |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1132 |
(Old_Datatype_Prop.indexify_names (replicate (length dt_atomTs) "f") ~~ dt_atomTs); |
18658 | 1133 |
|
42364 | 1134 |
fun make_pred fsT i T = Free (nth pnames i, fsT --> T --> HOLogic.boolT); |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1135 |
|
19851
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1136 |
fun mk_fresh1 xs [] = [] |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1137 |
| mk_fresh1 xs ((y as (_, T)) :: ys) = map (fn x => HOLogic.mk_Trueprop |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1138 |
(HOLogic.mk_not (HOLogic.mk_eq (Free y, Free x)))) |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1139 |
(filter (fn (_, U) => T = U) (rev xs)) @ |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1140 |
mk_fresh1 (y :: xs) ys; |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1141 |
|
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1142 |
fun mk_fresh2 xss [] = [] |
32952 | 1143 |
| mk_fresh2 xss ((p as (ys, _)) :: yss) = maps (fn y as (_, T) => |
19851
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1144 |
map (fn (_, x as (_, U)) => HOLogic.mk_Trueprop |
32952 | 1145 |
(fresh_const T U $ Free y $ Free x)) (rev xss @ yss)) ys @ |
19851
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1146 |
mk_fresh2 (p :: xss) yss; |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1147 |
|
18658 | 1148 |
fun make_ind_prem fsT f k T ((cname, cargs), idxs) = |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1149 |
let |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1150 |
val recs = filter Old_Datatype_Aux.is_rec_type cargs; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1151 |
val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr'') cargs; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1152 |
val recTs' = map (Old_Datatype_Aux.typ_of_dtyp descr'') recs; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1153 |
val tnames = Name.variant_list pnames (Old_Datatype_Prop.make_tnames Ts); |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1154 |
val rec_tnames = map fst (filter (Old_Datatype_Aux.is_rec_type o snd) (tnames ~~ cargs)); |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1155 |
val frees = tnames ~~ Ts; |
19710 | 1156 |
val frees' = partition_cargs idxs frees; |
43324
2b47822868e4
discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents:
42388
diff
changeset
|
1157 |
val z = (singleton (Name.variant_list tnames) "z", fsT); |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1158 |
|
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1159 |
fun mk_prem ((dt, s), T) = |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1160 |
let |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1161 |
val (Us, U) = strip_type T; |
45838 | 1162 |
val l = length Us; |
1163 |
in |
|
46218
ecf6375e2abb
renamed Term.list_all to Logic.list_all, in accordance to HOLogic.list_all;
wenzelm
parents:
46215
diff
changeset
|
1164 |
Logic.list_all (z :: map (pair "x") Us, |
45838 | 1165 |
HOLogic.mk_Trueprop |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1166 |
(make_pred fsT (Old_Datatype_Aux.body_index dt) U $ Bound l $ |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1167 |
Old_Datatype_Aux.app_bnds (Free (s, T)) l)) |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1168 |
end; |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1169 |
|
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1170 |
val prems = map mk_prem (recs ~~ rec_tnames ~~ recTs'); |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1171 |
val prems' = map (fn p as (_, T) => HOLogic.mk_Trueprop |
32952 | 1172 |
(f T (Free p) (Free z))) (maps fst frees') @ |
1173 |
mk_fresh1 [] (maps fst frees') @ |
|
19710 | 1174 |
mk_fresh2 [] frees' |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1175 |
|
46215
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1176 |
in |
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1177 |
fold_rev (Logic.all o Free) (frees @ [z]) |
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1178 |
(Logic.list_implies (prems' @ prems, |
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1179 |
HOLogic.mk_Trueprop (make_pred fsT k T $ Free z $ |
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1180 |
list_comb (Const (cname, Ts ---> T), map Free frees)))) |
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1181 |
end; |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1182 |
|
32952 | 1183 |
val ind_prems = maps (fn (((i, (_, _, constrs)), (_, idxss)), T) => |
18658 | 1184 |
map (make_ind_prem fsT (fn T => fn t => fn u => |
25823 | 1185 |
fresh_const T fsT $ t $ u) i T) |
32952 | 1186 |
(constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1187 |
val tnames = Old_Datatype_Prop.make_tnames recTs; |
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20046
diff
changeset
|
1188 |
val zs = Name.variant_list tnames (replicate (length descr'') "z"); |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38715
diff
changeset
|
1189 |
val ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop @{const_name HOL.conj}) |
18658 | 1190 |
(map (fn ((((i, _), T), tname), z) => |
1191 |
make_pred fsT i T $ Free (z, fsT) $ Free (tname, T)) |
|
1192 |
(descr'' ~~ recTs ~~ tnames ~~ zs))); |
|
18107
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1193 |
val induct = Logic.list_implies (ind_prems, ind_concl); |
ee6b4d3af498
Added strong induction theorem (currently only axiomatized!).
berghofe
parents:
18104
diff
changeset
|
1194 |
|
18658 | 1195 |
val ind_prems' = |
46215
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1196 |
map (fn (_, f as Free (_, T)) => Logic.all (Free ("x", fsT')) |
56253 | 1197 |
(HOLogic.mk_Trueprop (Const (@{const_name finite}, |
44692
ccfc7c193d2b
modify nominal packages to better respect set/pred distinction
huffman
parents:
44241
diff
changeset
|
1198 |
Term.range_type T --> |
26806 | 1199 |
HOLogic.boolT) $ (f $ Free ("x", fsT'))))) fresh_fs @ |
32952 | 1200 |
maps (fn (((i, (_, _, constrs)), (_, idxss)), T) => |
18658 | 1201 |
map (make_ind_prem fsT' (fn T => fn t => fn u => HOLogic.Not $ |
1202 |
HOLogic.mk_mem (t, the (AList.lookup op = fresh_fs T) $ u)) i T) |
|
32952 | 1203 |
(constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs); |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38715
diff
changeset
|
1204 |
val ind_concl' = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop @{const_name HOL.conj}) |
18658 | 1205 |
(map (fn ((((i, _), T), tname), z) => |
1206 |
make_pred fsT' i T $ Free (z, fsT') $ Free (tname, T)) |
|
1207 |
(descr'' ~~ recTs ~~ tnames ~~ zs))); |
|
1208 |
val induct' = Logic.list_implies (ind_prems', ind_concl'); |
|
1209 |
||
1210 |
val aux_ind_vars = |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1211 |
(Old_Datatype_Prop.indexify_names (replicate (length dt_atomTs) "pi") ~~ |
18658 | 1212 |
map mk_permT dt_atomTs) @ [("z", fsT')]; |
1213 |
val aux_ind_Ts = rev (map snd aux_ind_vars); |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38715
diff
changeset
|
1214 |
val aux_ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop @{const_name HOL.conj}) |
18658 | 1215 |
(map (fn (((i, _), T), tname) => |
1216 |
HOLogic.list_all (aux_ind_vars, make_pred fsT' i T $ Bound 0 $ |
|
22311 | 1217 |
fold_rev (mk_perm aux_ind_Ts) (map Bound (length dt_atomTs downto 1)) |
1218 |
(Free (tname, T)))) |
|
18658 | 1219 |
(descr'' ~~ recTs ~~ tnames))); |
1220 |
||
28731 | 1221 |
val fin_set_supp = map (fn s => |
1222 |
at_inst_of thy9 s RS at_fin_set_supp) dt_atoms; |
|
1223 |
val fin_set_fresh = map (fn s => |
|
1224 |
at_inst_of thy9 s RS at_fin_set_fresh) dt_atoms; |
|
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1225 |
val pt1_atoms = map (fn Type (s, _) => |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1226 |
Global_Theory.get_thm thy9 ("pt_" ^ Long_Name.base_name s ^ "1")) dt_atomTs; |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1227 |
val pt2_atoms = map (fn Type (s, _) => |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1228 |
Global_Theory.get_thm thy9 ("pt_" ^ Long_Name.base_name s ^ "2") RS sym) dt_atomTs; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1229 |
val exists_fresh' = Global_Theory.get_thms thy9 "exists_fresh'"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1230 |
val fs_atoms = Global_Theory.get_thms thy9 "fin_supp"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1231 |
val abs_supp = Global_Theory.get_thms thy9 "abs_supp"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1232 |
val perm_fresh_fresh = Global_Theory.get_thms thy9 "perm_fresh_fresh"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1233 |
val calc_atm = Global_Theory.get_thms thy9 "calc_atm"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1234 |
val fresh_atm = Global_Theory.get_thms thy9 "fresh_atm"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1235 |
val fresh_left = Global_Theory.get_thms thy9 "fresh_left"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1236 |
val perm_swap = Global_Theory.get_thms thy9 "perm_swap"; |
18658 | 1237 |
|
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1238 |
fun obtain_fresh_name' ths ts T (freshs1, freshs2, ctxt) = |
18658 | 1239 |
let |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1240 |
val p = foldr1 HOLogic.mk_prod (ts @ freshs1); |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1241 |
val ex = Goal.prove ctxt [] [] (HOLogic.mk_Trueprop |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1242 |
(HOLogic.exists_const T $ Abs ("x", T, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1243 |
fresh_const T (fastype_of p) $ |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1244 |
Bound 0 $ p))) |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1245 |
(fn _ => EVERY |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1246 |
[resolve_tac exists_fresh' 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1247 |
simp_tac (put_simpset HOL_ss ctxt addsimps (supp_prod :: finite_Un :: fs_atoms @ |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1248 |
fin_set_supp @ ths)) 1]); |
32202 | 1249 |
val (([(_, cx)], ths), ctxt') = Obtain.result |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1250 |
(fn ctxt' => EVERY |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1251 |
[etac exE 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1252 |
full_simp_tac (put_simpset HOL_ss ctxt' addsimps (fresh_prod :: fresh_atm)) 1, |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1253 |
REPEAT (etac conjE 1)]) |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1254 |
[ex] ctxt |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1255 |
in (freshs1 @ [term_of cx], freshs2 @ ths, ctxt') end; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1256 |
|
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1257 |
fun fresh_fresh_inst thy a b = |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1258 |
let |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1259 |
val T = fastype_of a; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1260 |
val SOME th = find_first (fn th => case prop_of th of |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1261 |
_ $ (_ $ (Const (_, Type (_, [U, _])) $ _ $ _)) $ _ => U = T |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1262 |
| _ => false) perm_fresh_fresh |
18658 | 1263 |
in |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1264 |
Drule.instantiate' [] |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1265 |
[SOME (cterm_of thy a), NONE, SOME (cterm_of thy b)] th |
18658 | 1266 |
end; |
18104
dbe58b104cb9
added thms perm, distinct and fresh to the simplifier.
urbanc
parents:
18068
diff
changeset
|
1267 |
|
28731 | 1268 |
val fs_cp_sort = |
1269 |
map (fs_class_of thy9) dt_atoms @ |
|
33040 | 1270 |
maps (fn s => map (cp_class_of thy9 s) (remove (op =) s dt_atoms)) dt_atoms; |
28731 | 1271 |
|
19710 | 1272 |
(********************************************************************** |
1273 |
The subgoals occurring in the proof of induct_aux have the |
|
1274 |
following parameters: |
|
1275 |
||
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1276 |
x_1 ... x_k p_1 ... p_m z |
19710 | 1277 |
|
1278 |
where |
|
1279 |
||
1280 |
x_i : constructor arguments (introduced by weak induction rule) |
|
1281 |
p_i : permutations (one for each atom type in the data type) |
|
1282 |
z : freshness context |
|
1283 |
***********************************************************************) |
|
1284 |
||
1285 |
val _ = warning "proving strong induction theorem ..."; |
|
1286 |
||
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1287 |
val induct_aux = Goal.prove_global_future thy9 [] |
28731 | 1288 |
(map (augment_sort thy9 fs_cp_sort) ind_prems') |
1289 |
(augment_sort thy9 fs_cp_sort ind_concl') (fn {prems, context} => |
|
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1290 |
let |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1291 |
val (prems1, prems2) = chop (length dt_atomTs) prems; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1292 |
val ind_ss2 = put_simpset HOL_ss context addsimps |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1293 |
finite_Diff :: abs_fresh @ abs_supp @ fs_atoms; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1294 |
val ind_ss1 = ind_ss2 addsimps fresh_left @ calc_atm @ |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1295 |
fresh_atm @ rev_simps @ app_simps; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1296 |
val ind_ss3 = put_simpset HOL_ss context addsimps abs_fun_eq1 :: |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1297 |
abs_perm @ calc_atm @ perm_swap; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1298 |
val ind_ss4 = put_simpset HOL_basic_ss context addsimps fresh_left @ prems1 @ |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1299 |
fin_set_fresh @ calc_atm; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1300 |
val ind_ss5 = put_simpset HOL_basic_ss context addsimps pt1_atoms; |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1301 |
val ind_ss6 = put_simpset HOL_basic_ss context addsimps flat perm_simps'; |
28731 | 1302 |
val th = Goal.prove context [] [] |
1303 |
(augment_sort thy9 fs_cp_sort aux_ind_concl) |
|
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1304 |
(fn {context = context1, ...} => |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1305 |
EVERY (Old_Datatype_Aux.ind_tac dt_induct tnames 1 :: |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1306 |
maps (fn ((_, (_, _, constrs)), (_, constrs')) => |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1307 |
map (fn ((cname, cargs), is) => |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1308 |
REPEAT (rtac allI 1) THEN |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1309 |
SUBPROOF (fn {prems = iprems, params, concl, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1310 |
context = context2, ...} => |
18658 | 1311 |
let |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1312 |
val concl' = term_of concl; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1313 |
val _ $ (_ $ _ $ u) = concl'; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1314 |
val U = fastype_of u; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1315 |
val (xs, params') = |
32202 | 1316 |
chop (length cargs) (map (term_of o #2) params); |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1317 |
val Ts = map fastype_of xs; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1318 |
val cnstr = Const (cname, Ts ---> U); |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1319 |
val (pis, z) = split_last params'; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1320 |
val mk_pi = fold_rev (mk_perm []) pis; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1321 |
val xs' = partition_cargs is xs; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1322 |
val xs'' = map (fn (ts, u) => (map mk_pi ts, mk_pi u)) xs'; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1323 |
val ts = maps (fn (ts, u) => ts @ [u]) xs''; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1324 |
val (freshs1, freshs2, context3) = fold (fn t => |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1325 |
let val T = fastype_of t |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1326 |
in obtain_fresh_name' prems1 |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1327 |
(the (AList.lookup op = fresh_fs T) $ z :: ts) T |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1328 |
end) (maps fst xs') ([], [], context2); |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1329 |
val freshs1' = unflat (map fst xs') freshs1; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1330 |
val freshs2' = map (Simplifier.simplify ind_ss4) |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1331 |
(mk_not_sym freshs2); |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1332 |
val ind_ss1' = ind_ss1 addsimps freshs2'; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1333 |
val ind_ss3' = ind_ss3 addsimps freshs2'; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1334 |
val rename_eq = |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1335 |
if forall (null o fst) xs' then [] |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1336 |
else [Goal.prove context3 [] [] |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1337 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1338 |
(list_comb (cnstr, ts), |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1339 |
list_comb (cnstr, maps (fn ((bs, t), cs) => |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1340 |
cs @ [fold_rev (mk_perm []) (map perm_of_pair |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1341 |
(bs ~~ cs)) t]) (xs'' ~~ freshs1'))))) |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1342 |
(fn _ => EVERY |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1343 |
(simp_tac (put_simpset HOL_ss context3 addsimps flat inject_thms) 1 :: |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1344 |
REPEAT (FIRSTGOAL (rtac conjI)) :: |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1345 |
maps (fn ((bs, t), cs) => |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1346 |
if null bs then [] |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1347 |
else rtac sym 1 :: maps (fn (b, c) => |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1348 |
[rtac trans 1, rtac sym 1, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1349 |
rtac (fresh_fresh_inst thy9 b c) 1, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1350 |
simp_tac ind_ss1' 1, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1351 |
simp_tac ind_ss2 1, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1352 |
simp_tac ind_ss3' 1]) (bs ~~ cs)) |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1353 |
(xs'' ~~ freshs1')))]; |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1354 |
val th = Goal.prove context3 [] [] concl' (fn _ => EVERY |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1355 |
[simp_tac (ind_ss6 addsimps rename_eq) 1, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1356 |
cut_facts_tac iprems 1, |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1357 |
(resolve_tac prems THEN_ALL_NEW |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1358 |
SUBGOAL (fn (t, i) => case Logic.strip_assums_concl t of |
56253 | 1359 |
_ $ (Const (@{const_name Nominal.fresh}, _) $ _ $ _) => |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1360 |
simp_tac ind_ss1' i |
38558 | 1361 |
| _ $ (Const (@{const_name Not}, _) $ _) => |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1362 |
resolve_tac freshs2' i |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1363 |
| _ => asm_simp_tac (put_simpset HOL_basic_ss context3 addsimps |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1364 |
pt2_atoms addsimprocs [perm_simproc]) i)) 1]) |
42361 | 1365 |
val final = Proof_Context.export context3 context2 [th] |
18658 | 1366 |
in |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1367 |
resolve_tac final 1 |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1368 |
end) context1 1) (constrs ~~ constrs')) (descr'' ~~ ndescr))) |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1369 |
in |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1370 |
EVERY |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1371 |
[cut_facts_tac [th] 1, |
27228
4f7976a6ffc3
allE_Nil: only one copy, proven in regular theory source;
wenzelm
parents:
27153
diff
changeset
|
1372 |
REPEAT (eresolve_tac [conjE, @{thm allE_Nil}] 1), |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1373 |
REPEAT (etac allE 1), |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1374 |
REPEAT (TRY (rtac conjI 1) THEN asm_full_simp_tac ind_ss5 1)] |
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1375 |
end); |
18658 | 1376 |
|
1377 |
val induct_aux' = Thm.instantiate ([], |
|
28731 | 1378 |
map (fn (s, v as Var (_, T)) => |
1379 |
(cterm_of thy9 v, cterm_of thy9 (Free (s, T)))) |
|
1380 |
(pnames ~~ map head_of (HOLogic.dest_conj |
|
1381 |
(HOLogic.dest_Trueprop (concl_of induct_aux)))) @ |
|
18658 | 1382 |
map (fn (_, f) => |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35842
diff
changeset
|
1383 |
let val f' = Logic.varify_global f |
18658 | 1384 |
in (cterm_of thy9 f', |
56253 | 1385 |
cterm_of thy9 (Const (@{const_name Nominal.supp}, fastype_of f'))) |
18658 | 1386 |
end) fresh_fs) induct_aux; |
1387 |
||
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1388 |
val induct = Goal.prove_global_future thy9 [] |
28731 | 1389 |
(map (augment_sort thy9 fs_cp_sort) ind_prems) |
1390 |
(augment_sort thy9 fs_cp_sort ind_concl) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1391 |
(fn {prems, context = ctxt} => EVERY |
18658 | 1392 |
[rtac induct_aux' 1, |
25951
6ebe26bfed18
Reimplemented proof of strong induction theorem.
berghofe
parents:
25823
diff
changeset
|
1393 |
REPEAT (resolve_tac fs_atoms 1), |
18658 | 1394 |
REPEAT ((resolve_tac prems THEN_ALL_NEW |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1395 |
(etac @{thm meta_spec} ORELSE' |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1396 |
full_simp_tac (put_simpset HOL_basic_ss ctxt addsimps [fresh_def]))) 1)]) |
18658 | 1397 |
|
1398 |
val (_, thy10) = thy9 |> |
|
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24459
diff
changeset
|
1399 |
Sign.add_path big_name |> |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1400 |
Global_Theory.add_thms [((Binding.name "strong_induct'", induct_aux), [])] ||>> |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1401 |
Global_Theory.add_thms [((Binding.name "strong_induct", induct), [case_names_induct])] ||>> |
52788 | 1402 |
Global_Theory.add_thmss [((Binding.name "strong_inducts", projections induct), [case_names_induct])]; |
18658 | 1403 |
|
19322
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1404 |
(**** recursion combinator ****) |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1405 |
|
19322
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1406 |
val _ = warning "defining recursion combinator ..."; |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1407 |
|
45741 | 1408 |
val used = fold Term.add_tfree_namesT recTs []; |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1409 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1410 |
val (rec_result_Ts', rec_fn_Ts') = Old_Datatype_Prop.make_primrec_Ts descr' used; |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1411 |
|
56253 | 1412 |
val rec_sort = if null dt_atomTs then @{sort type} else |
36428
874843c1e96e
really minimize sorts after certification -- looks like this is intended here;
wenzelm
parents:
35994
diff
changeset
|
1413 |
Sign.minimize_sort thy10 (Sign.certify_sort thy10 pt_cp_sort); |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1414 |
|
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1415 |
val rec_result_Ts = map (fn TFree (s, _) => TFree (s, rec_sort)) rec_result_Ts'; |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1416 |
val rec_fn_Ts = map (typ_subst_atomic (rec_result_Ts' ~~ rec_result_Ts)) rec_fn_Ts'; |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1417 |
|
21021 | 1418 |
val rec_set_Ts = map (fn (T1, T2) => |
1419 |
rec_fn_Ts @ [T1, T2] ---> HOLogic.boolT) (recTs ~~ rec_result_Ts); |
|
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1420 |
|
19322
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1421 |
val big_rec_name = big_name ^ "_rec_set"; |
21021 | 1422 |
val rec_set_names' = |
1423 |
if length descr'' = 1 then [big_rec_name] else |
|
1424 |
map ((curry (op ^) (big_rec_name ^ "_")) o string_of_int) |
|
1425 |
(1 upto (length descr'')); |
|
28965 | 1426 |
val rec_set_names = map (Sign.full_bname thy10) rec_set_names'; |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1427 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1428 |
val rec_fns = map (uncurry (Old_Datatype_Aux.mk_Free "f")) |
19322
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1429 |
(rec_fn_Ts ~~ (1 upto (length rec_fn_Ts))); |
21021 | 1430 |
val rec_sets' = map (fn c => list_comb (Free c, rec_fns)) |
1431 |
(rec_set_names' ~~ rec_set_Ts); |
|
19322
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1432 |
val rec_sets = map (fn c => list_comb (Const c, rec_fns)) |
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1433 |
(rec_set_names ~~ rec_set_Ts); |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1434 |
|
19322
bf84bdf05f14
Replaced iteration combinator by recursion combinator.
berghofe
parents:
19275
diff
changeset
|
1435 |
(* introduction rules for graph of recursion function *) |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1436 |
|
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1437 |
val rec_preds = map (fn (a, T) => |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1438 |
Free (a, T --> HOLogic.boolT)) (pnames ~~ rec_result_Ts); |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1439 |
|
20267 | 1440 |
fun mk_fresh3 rs [] = [] |
32952 | 1441 |
| mk_fresh3 rs ((p as (ys, z)) :: yss) = maps (fn y as (_, T) => |
1442 |
map_filter (fn ((_, (_, x)), r as (_, U)) => if z = x then NONE |
|
20267 | 1443 |
else SOME (HOLogic.mk_Trueprop |
32952 | 1444 |
(fresh_const T U $ Free y $ Free r))) rs) ys @ |
20267 | 1445 |
mk_fresh3 rs yss; |
1446 |
||
21088 | 1447 |
(* FIXME: avoid collisions with other variable names? *) |
1448 |
val rec_ctxt = Free ("z", fsT'); |
|
1449 |
||
33244 | 1450 |
fun make_rec_intr T p rec_set ((cname, cargs), idxs) |
1451 |
(rec_intr_ts, rec_prems, rec_prems', rec_eq_prems, l) = |
|
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1452 |
let |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1453 |
val Ts = map (Old_Datatype_Aux.typ_of_dtyp descr'') cargs; |
19851
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1454 |
val frees = map (fn i => "x" ^ string_of_int i) (1 upto length Ts) ~~ Ts; |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1455 |
val frees' = partition_cargs idxs frees; |
32952 | 1456 |
val binders = maps fst frees'; |
20411
dd8a1cda2eaf
Added premises concerning finite support of recursion results to FCBs.
berghofe
parents:
20397
diff
changeset
|
1457 |
val atomTs = distinct op = (maps (map snd o fst) frees'); |
32952 | 1458 |
val recs = map_filter |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1459 |
(fn ((_, Old_Datatype_Aux.DtRec i), p) => SOME (i, p) | _ => NONE) |
19851
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1460 |
(partition_cargs idxs cargs ~~ frees'); |
10162c01bd78
Completely rewrote code for defining graph of recursion combinator.
berghofe
parents:
19833
diff
changeset
|
1461 |
val frees'' = map (fn i => "y" ^ string_of_int i) (1 upto length recs) ~~ |
42364 | 1462 |
map (fn (i, _) => nth rec_result_Ts i) recs; |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1463 |
val prems1 = map (fn ((i, (_, x)), y) => HOLogic.mk_Trueprop |
42364 | 1464 |
(nth rec_sets' i $ Free x $ Free y)) (recs ~~ frees''); |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1465 |
val prems2 = |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1466 |
map (fn f => map (fn p as (_, T) => HOLogic.mk_Trueprop |
25823 | 1467 |
(fresh_const T (fastype_of f) $ Free p $ f)) binders) rec_fns; |
21088 | 1468 |
val prems3 = mk_fresh1 [] binders @ mk_fresh2 [] frees'; |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1469 |
val prems4 = map (fn ((i, _), y) => |
42364 | 1470 |
HOLogic.mk_Trueprop (nth rec_preds i $ Free y)) (recs ~~ frees''); |
20267 | 1471 |
val prems5 = mk_fresh3 (recs ~~ frees'') frees'; |
20411
dd8a1cda2eaf
Added premises concerning finite support of recursion results to FCBs.
berghofe
parents:
20397
diff
changeset
|
1472 |
val prems6 = maps (fn aT => map (fn y as (_, T) => HOLogic.mk_Trueprop |
56253 | 1473 |
(Const (@{const_name finite}, HOLogic.mk_setT aT --> HOLogic.boolT) $ |
1474 |
(Const (@{const_name Nominal.supp}, T --> HOLogic.mk_setT aT) $ Free y))) |
|
20411
dd8a1cda2eaf
Added premises concerning finite support of recursion results to FCBs.
berghofe
parents:
20397
diff
changeset
|
1475 |
frees'') atomTs; |
21088 | 1476 |
val prems7 = map (fn x as (_, T) => HOLogic.mk_Trueprop |
25823 | 1477 |
(fresh_const T fsT' $ Free x $ rec_ctxt)) binders; |
42364 | 1478 |
val result = list_comb (nth rec_fns l, map Free (frees @ frees'')); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1479 |
val result_freshs = map (fn p as (_, T) => |
25823 | 1480 |
fresh_const T (fastype_of result) $ Free p $ result) binders; |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1481 |
val P = HOLogic.mk_Trueprop (p $ result) |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1482 |
in |
32952 | 1483 |
(rec_intr_ts @ [Logic.list_implies (flat prems2 @ prems3 @ prems1, |
21021 | 1484 |
HOLogic.mk_Trueprop (rec_set $ |
1485 |
list_comb (Const (cname, Ts ---> T), map Free frees) $ result))], |
|
46215
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1486 |
rec_prems @ [fold_rev (Logic.all o Free) (frees @ frees'') (Logic.list_implies (prems4, P))], |
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1487 |
rec_prems' @ map (fn fr => fold_rev (Logic.all o Free) (frees @ frees'') |
0da9433f959e
discontinued old-style Term.list_all_free in favour of plain Logic.all;
wenzelm
parents:
46161
diff
changeset
|
1488 |
(Logic.list_implies (nth prems2 l @ prems3 @ prems5 @ prems7 @ prems6 @ [P], |
21054
6048c085c3ae
Split up FCBs into separate formulae for each binder.
berghofe
parents:
21021
diff
changeset
|
1489 |
HOLogic.mk_Trueprop fr))) result_freshs, |
32952 | 1490 |
rec_eq_prems @ [flat prems2 @ prems3], |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1491 |
l + 1) |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1492 |
end; |
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1493 |
|
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1494 |
val (rec_intr_ts, rec_prems, rec_prems', rec_eq_prems, _) = |
33244 | 1495 |
fold (fn ((((d, d'), T), p), rec_set) => |
1496 |
fold (make_rec_intr T p rec_set) (#3 (snd d) ~~ snd d')) |
|
1497 |
(descr'' ~~ ndescr ~~ recTs ~~ rec_preds ~~ rec_sets') |
|
1498 |
([], [], [], [], 0); |
|
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1499 |
|
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
1500 |
val ({intrs = rec_intrs, elims = rec_elims, raw_induct = rec_induct, ...}, thy11) = |
33278 | 1501 |
thy10 |
1502 |
|> Sign.map_naming Name_Space.conceal |
|
33726
0878aecbf119
eliminated slightly odd name space grouping -- now managed by Isar toplevel;
wenzelm
parents:
33669
diff
changeset
|
1503 |
|> Inductive.add_inductive_global |
33669 | 1504 |
{quiet_mode = #quiet config, verbose = false, alt_name = Binding.name big_rec_name, |
49170
03bee3a6a1b7
discontinued obsolete fork_mono to loosen some brakes -- NB: TTY interaction has Goal.future_proofs disabled due to missing Future.worker_task;
wenzelm
parents:
46961
diff
changeset
|
1505 |
coind = false, no_elim = false, no_ind = false, skip_mono = true} |
28965 | 1506 |
(map (fn (s, T) => ((Binding.name s, T), NoSyn)) (rec_set_names' ~~ rec_set_Ts)) |
26128 | 1507 |
(map dest_Free rec_fns) |
33278 | 1508 |
(map (fn x => (Attrib.empty_binding, x)) rec_intr_ts) [] |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1509 |
||> Global_Theory.hide_fact true (Long_Name.append (Sign.full_bname thy10 big_rec_name) "induct") |
52788 | 1510 |
||> Sign.restore_naming thy10; |
19251
6bc0dda66f32
First version of function for defining graph of iteration combinator.
berghofe
parents:
19134
diff
changeset
|
1511 |
|
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1512 |
(** equivariance **) |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1513 |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1514 |
val fresh_bij = Global_Theory.get_thms thy11 "fresh_bij"; |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1515 |
val perm_bij = Global_Theory.get_thms thy11 "perm_bij"; |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1516 |
|
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1517 |
val (rec_equiv_thms, rec_equiv_thms') = ListPair.unzip (map (fn aT => |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1518 |
let |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1519 |
val permT = mk_permT aT; |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1520 |
val pi = Free ("pi", permT); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1521 |
val rec_fns_pi = map (mk_perm [] pi o uncurry (Old_Datatype_Aux.mk_Free "f")) |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1522 |
(rec_fn_Ts ~~ (1 upto (length rec_fn_Ts))); |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1523 |
val rec_sets_pi = map (fn c => list_comb (Const c, rec_fns_pi)) |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1524 |
(rec_set_names ~~ rec_set_Ts); |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1525 |
val ps = map (fn ((((T, U), R), R'), i) => |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1526 |
let |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1527 |
val x = Free ("x" ^ string_of_int i, T); |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1528 |
val y = Free ("y" ^ string_of_int i, U) |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1529 |
in |
22311 | 1530 |
(R $ x $ y, R' $ mk_perm [] pi x $ mk_perm [] pi y) |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1531 |
end) (recTs ~~ rec_result_Ts ~~ rec_sets ~~ rec_sets_pi ~~ (1 upto length recTs)); |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1532 |
val ths = map (fn th => Drule.export_without_context (th RS mp)) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1533 |
(Old_Datatype_Aux.split_conj_thm |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1534 |
(Goal.prove_global_future thy11 [] [] |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1535 |
(augment_sort thy1 pt_cp_sort |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1536 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map HOLogic.mk_imp ps)))) |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1537 |
(fn {context = ctxt, ...} => rtac rec_induct 1 THEN REPEAT |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1538 |
(simp_tac (put_simpset HOL_basic_ss ctxt |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1539 |
addsimps flat perm_simps' |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1540 |
addsimprocs [NominalPermeq.perm_simproc_app]) 1 THEN |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1541 |
(resolve_tac rec_intrs THEN_ALL_NEW |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1542 |
asm_simp_tac (put_simpset HOL_ss ctxt addsimps (fresh_bij @ perm_bij))) 1)))) |
20046 | 1543 |
val ths' = map (fn ((P, Q), th) => |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1544 |
Goal.prove_global_future thy11 [] [] |
28731 | 1545 |
(augment_sort thy1 pt_cp_sort |
1546 |
(Logic.mk_implies (HOLogic.mk_Trueprop Q, HOLogic.mk_Trueprop P))) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1547 |
(fn {context = ctxt, ...} => dtac (Thm.instantiate ([], |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1548 |
[(cterm_of thy11 (Var (("pi", 0), permT)), |
56253 | 1549 |
cterm_of thy11 (Const (@{const_name rev}, permT --> permT) $ pi))]) th) 1 THEN |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1550 |
NominalPermeq.perm_simp_tac (put_simpset HOL_ss ctxt) 1)) (ps ~~ ths) |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1551 |
in (ths, ths') end) dt_atomTs); |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1552 |
|
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1553 |
(** finite support **) |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1554 |
|
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1555 |
val rec_fin_supp_thms = map (fn aT => |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1556 |
let |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
1557 |
val name = Long_Name.base_name (fst (dest_Type aT)); |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1558 |
val fs_name = Global_Theory.get_thm thy11 ("fs_" ^ name ^ "1"); |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1559 |
val aset = HOLogic.mk_setT aT; |
56253 | 1560 |
val finite = Const (@{const_name finite}, aset --> HOLogic.boolT); |
22274 | 1561 |
val fins = map (fn (f, T) => HOLogic.mk_Trueprop |
56253 | 1562 |
(finite $ (Const (@{const_name Nominal.supp}, T --> aset) $ f))) |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1563 |
(rec_fns ~~ rec_fn_Ts) |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1564 |
in |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1565 |
map (fn th => Drule.export_without_context (th RS mp)) (Old_Datatype_Aux.split_conj_thm |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
1566 |
(Goal.prove_global_future thy11 [] |
28731 | 1567 |
(map (augment_sort thy11 fs_cp_sort) fins) |
1568 |
(augment_sort thy11 fs_cp_sort |
|
1569 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
|
1570 |
(map (fn (((T, U), R), i) => |
|
1571 |
let |
|
1572 |
val x = Free ("x" ^ string_of_int i, T); |
|
1573 |
val y = Free ("y" ^ string_of_int i, U) |
|
1574 |
in |
|
1575 |
HOLogic.mk_imp (R $ x $ y, |
|
56253 | 1576 |
finite $ (Const (@{const_name Nominal.supp}, U --> aset) $ y)) |
28731 | 1577 |
end) (recTs ~~ rec_result_Ts ~~ rec_sets ~~ |
1578 |
(1 upto length recTs)))))) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1579 |
(fn {prems = fins, context = ctxt} => |
26711 | 1580 |
(rtac rec_induct THEN_ALL_NEW cut_facts_tac fins) 1 THEN REPEAT |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1581 |
(NominalPermeq.finite_guess_tac (put_simpset HOL_ss ctxt addsimps [fs_name]) 1)))) |
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1582 |
end) dt_atomTs; |
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
1583 |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1584 |
(** freshness **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1585 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1586 |
val finite_premss = map (fn aT => |
22274 | 1587 |
map (fn (f, T) => HOLogic.mk_Trueprop |
56253 | 1588 |
(Const (@{const_name finite}, HOLogic.mk_setT aT --> HOLogic.boolT) $ |
1589 |
(Const (@{const_name Nominal.supp}, T --> HOLogic.mk_setT aT) $ f))) |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1590 |
(rec_fns ~~ rec_fn_Ts)) dt_atomTs; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1591 |
|
28731 | 1592 |
val rec_fns' = map (augment_sort thy11 fs_cp_sort) rec_fns; |
1593 |
||
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1594 |
val rec_fresh_thms = map (fn ((aT, eqvt_ths), finite_prems) => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1595 |
let |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
1596 |
val name = Long_Name.base_name (fst (dest_Type aT)); |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
1597 |
val fs_name = Global_Theory.get_thm thy11 ("fs_" ^ name ^ "1"); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1598 |
val a = Free ("a", aT); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1599 |
val freshs = map (fn (f, fT) => HOLogic.mk_Trueprop |
25823 | 1600 |
(fresh_const aT fT $ a $ f)) (rec_fns ~~ rec_fn_Ts) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1601 |
in |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1602 |
map (fn (((T, U), R), eqvt_th) => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1603 |
let |
28731 | 1604 |
val x = Free ("x", augment_sort_typ thy11 fs_cp_sort T); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1605 |
val y = Free ("y", U); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1606 |
val y' = Free ("y'", U) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1607 |
in |
42361 | 1608 |
Drule.export_without_context (Goal.prove (Proof_Context.init_global thy11) [] |
28731 | 1609 |
(map (augment_sort thy11 fs_cp_sort) |
1610 |
(finite_prems @ |
|
1611 |
[HOLogic.mk_Trueprop (R $ x $ y), |
|
1612 |
HOLogic.mk_Trueprop (HOLogic.mk_all ("y'", U, |
|
1613 |
HOLogic.mk_imp (R $ x $ y', HOLogic.mk_eq (y', y)))), |
|
1614 |
HOLogic.mk_Trueprop (fresh_const aT T $ a $ x)] @ |
|
1615 |
freshs)) |
|
25823 | 1616 |
(HOLogic.mk_Trueprop (fresh_const aT U $ a $ y)) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1617 |
(fn {prems, context} => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1618 |
let |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1619 |
val (finite_prems, rec_prem :: unique_prem :: |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1620 |
fresh_prems) = chop (length finite_prems) prems; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1621 |
val unique_prem' = unique_prem RS spec RS mp; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1622 |
val unique = [unique_prem', unique_prem' RS sym] MRS trans; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1623 |
val _ $ (_ $ (_ $ S $ _)) $ _ = prop_of supports_fresh; |
28731 | 1624 |
val tuple = foldr1 HOLogic.mk_prod (x :: rec_fns') |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1625 |
in EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1626 |
[rtac (Drule.cterm_instantiate |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1627 |
[(cterm_of thy11 S, |
56253 | 1628 |
cterm_of thy11 (Const (@{const_name Nominal.supp}, |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1629 |
fastype_of tuple --> HOLogic.mk_setT aT) $ tuple))] |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1630 |
supports_fresh) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1631 |
simp_tac (put_simpset HOL_basic_ss context addsimps |
36945 | 1632 |
[supports_def, Thm.symmetric fresh_def, fresh_prod]) 1, |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1633 |
REPEAT_DETERM (resolve_tac [allI, impI] 1), |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1634 |
REPEAT_DETERM (etac conjE 1), |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1635 |
rtac unique 1, |
32202 | 1636 |
SUBPROOF (fn {prems = prems', params = [(_, a), (_, b)], ...} => EVERY |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1637 |
[cut_facts_tac [rec_prem] 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1638 |
rtac (Thm.instantiate ([], |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1639 |
[(cterm_of thy11 (Var (("pi", 0), mk_permT aT)), |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1640 |
cterm_of thy11 (perm_of_pair (term_of a, term_of b)))]) eqvt_th) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1641 |
asm_simp_tac (put_simpset HOL_ss context addsimps |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1642 |
(prems' @ perm_swap @ perm_fresh_fresh)) 1]) context 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1643 |
rtac rec_prem 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1644 |
simp_tac (put_simpset HOL_ss context addsimps (fs_name :: |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1645 |
supp_prod :: finite_Un :: finite_prems)) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1646 |
simp_tac (put_simpset HOL_ss context addsimps (Thm.symmetric fresh_def :: |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1647 |
fresh_prod :: fresh_prems)) 1] |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1648 |
end)) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1649 |
end) (recTs ~~ rec_result_Ts ~~ rec_sets ~~ eqvt_ths) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1650 |
end) (dt_atomTs ~~ rec_equiv_thms' ~~ finite_premss); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1651 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1652 |
(** uniqueness **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1653 |
|
21088 | 1654 |
val fun_tuple = foldr1 HOLogic.mk_prod (rec_ctxt :: rec_fns); |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1655 |
val fun_tupleT = fastype_of fun_tuple; |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1656 |
val rec_unique_frees = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1657 |
Old_Datatype_Prop.indexify_names (replicate (length recTs) "x") ~~ recTs; |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1658 |
val rec_unique_frees'' = map (fn (s, T) => (s ^ "'", T)) rec_unique_frees; |
20267 | 1659 |
val rec_unique_frees' = |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1660 |
Old_Datatype_Prop.indexify_names (replicate (length recTs) "y") ~~ rec_result_Ts; |
21021 | 1661 |
val rec_unique_concls = map (fn ((x, U), R) => |
38558 | 1662 |
Const (@{const_name Ex1}, (U --> HOLogic.boolT) --> HOLogic.boolT) $ |
21021 | 1663 |
Abs ("y", U, R $ Free x $ Bound 0)) |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1664 |
(rec_unique_frees ~~ rec_result_Ts ~~ rec_sets); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1665 |
|
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1666 |
val induct_aux_rec = Drule.cterm_instantiate |
28731 | 1667 |
(map (pairself (cterm_of thy11) o apsnd (augment_sort thy11 fs_cp_sort)) |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35842
diff
changeset
|
1668 |
(map (fn (aT, f) => (Logic.varify_global f, Abs ("z", HOLogic.unitT, |
56253 | 1669 |
Const (@{const_name Nominal.supp}, fun_tupleT --> HOLogic.mk_setT aT) $ fun_tuple))) |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1670 |
fresh_fs @ |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1671 |
map (fn (((P, T), (x, U)), Q) => |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35842
diff
changeset
|
1672 |
(Var ((P, 0), Logic.varifyT_global (fsT' --> T --> HOLogic.boolT)), |
44241 | 1673 |
Abs ("z", HOLogic.unitT, absfree (x, U) Q))) |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1674 |
(pnames ~~ recTs ~~ rec_unique_frees ~~ rec_unique_concls) @ |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35842
diff
changeset
|
1675 |
map (fn (s, T) => (Var ((s, 0), Logic.varifyT_global T), Free (s, T))) |
20145
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1676 |
rec_unique_frees)) induct_aux; |
922b4e7b8efd
Started implementing uniqueness proof for recursion
berghofe
parents:
20071
diff
changeset
|
1677 |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1678 |
fun obtain_fresh_name vs ths rec_fin_supp T (freshs1, freshs2, ctxt) = |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1679 |
let |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1680 |
val p = foldr1 HOLogic.mk_prod (vs @ freshs1); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1681 |
val ex = Goal.prove ctxt [] [] (HOLogic.mk_Trueprop |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1682 |
(HOLogic.exists_const T $ Abs ("x", T, |
25823 | 1683 |
fresh_const T (fastype_of p) $ Bound 0 $ p))) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1684 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1685 |
[cut_facts_tac ths 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1686 |
REPEAT_DETERM (dresolve_tac (the (AList.lookup op = rec_fin_supp T)) 1), |
21377
c29146dc14f1
replaced exists_fresh lemma with a version formulated with obtains;
urbanc
parents:
21365
diff
changeset
|
1687 |
resolve_tac exists_fresh' 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1688 |
asm_simp_tac (put_simpset HOL_ss ctxt addsimps (supp_prod :: finite_Un :: fs_atoms)) 1]); |
32202 | 1689 |
val (([(_, cx)], ths), ctxt') = Obtain.result |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1690 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1691 |
[etac exE 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1692 |
full_simp_tac (put_simpset HOL_ss ctxt addsimps (fresh_prod :: fresh_atm)) 1, |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1693 |
REPEAT (etac conjE 1)]) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1694 |
[ex] ctxt |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1695 |
in (freshs1 @ [term_of cx], freshs2 @ ths, ctxt') end; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1696 |
|
21088 | 1697 |
val finite_ctxt_prems = map (fn aT => |
22274 | 1698 |
HOLogic.mk_Trueprop |
56253 | 1699 |
(Const (@{const_name finite}, HOLogic.mk_setT aT --> HOLogic.boolT) $ |
1700 |
(Const (@{const_name Nominal.supp}, fsT' --> HOLogic.mk_setT aT) $ rec_ctxt))) dt_atomTs; |
|
21088 | 1701 |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1702 |
val rec_unique_thms = Old_Datatype_Aux.split_conj_thm (Goal.prove |
42361 | 1703 |
(Proof_Context.init_global thy11) (map fst rec_unique_frees) |
28731 | 1704 |
(map (augment_sort thy11 fs_cp_sort) |
32952 | 1705 |
(flat finite_premss @ finite_ctxt_prems @ rec_prems @ rec_prems')) |
28731 | 1706 |
(augment_sort thy11 fs_cp_sort |
1707 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj rec_unique_concls))) |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1708 |
(fn {prems, context} => |
20267 | 1709 |
let |
1710 |
val k = length rec_fns; |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1711 |
val (finite_thss, ths1) = fold_map (fn T => fn xs => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1712 |
apfst (pair T) (chop k xs)) dt_atomTs prems; |
21088 | 1713 |
val (finite_ctxt_ths, ths2) = chop (length dt_atomTs) ths1; |
1714 |
val (P_ind_ths, fcbs) = chop k ths2; |
|
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
1715 |
val P_ths = map (fn th => th RS mp) (Old_Datatype_Aux.split_conj_thm |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1716 |
(Goal.prove context |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1717 |
(map fst (rec_unique_frees'' @ rec_unique_frees')) [] |
28731 | 1718 |
(augment_sort thy11 fs_cp_sort |
1719 |
(HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
|
1720 |
(map (fn (((x, y), S), P) => HOLogic.mk_imp |
|
1721 |
(S $ Free x $ Free y, P $ (Free y))) |
|
1722 |
(rec_unique_frees'' ~~ rec_unique_frees' ~~ |
|
1723 |
rec_sets ~~ rec_preds))))) |
|
20267 | 1724 |
(fn _ => |
1725 |
rtac rec_induct 1 THEN |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1726 |
REPEAT ((resolve_tac P_ind_ths THEN_ALL_NEW assume_tac) 1)))); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1727 |
val rec_fin_supp_thms' = map |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1728 |
(fn (ths, (T, fin_ths)) => (T, map (curry op MRS fin_ths) ths)) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1729 |
(rec_fin_supp_thms ~~ finite_thss); |
20267 | 1730 |
in EVERY |
1731 |
([rtac induct_aux_rec 1] @ |
|
21088 | 1732 |
maps (fn ((_, finite_ths), finite_th) => |
1733 |
[cut_facts_tac (finite_th :: finite_ths) 1, |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1734 |
asm_simp_tac (put_simpset HOL_ss context addsimps [supp_prod, finite_Un]) 1]) |
21088 | 1735 |
(finite_thss ~~ finite_ctxt_ths) @ |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1736 |
maps (fn ((_, idxss), elim) => maps (fn idxs => |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1737 |
[full_simp_tac (put_simpset HOL_ss context addsimps [Thm.symmetric fresh_def, supp_prod, Un_iff]) 1, |
55990 | 1738 |
REPEAT_DETERM (eresolve_tac @{thms conjE ex1E} 1), |
1739 |
rtac @{thm ex1I} 1, |
|
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1740 |
(resolve_tac rec_intrs THEN_ALL_NEW atac) 1, |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1741 |
rotate_tac ~1 1, |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1742 |
((DETERM o etac elim) THEN_ALL_NEW full_simp_tac |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1743 |
(put_simpset HOL_ss context addsimps flat distinct_thms)) 1] @ |
51798 | 1744 |
(if null idxs then [] else [hyp_subst_tac context 1, |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1745 |
SUBPROOF (fn {asms, concl, prems = prems', params, context = context', ...} => |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1746 |
let |
21021 | 1747 |
val SOME prem = find_first (can (HOLogic.dest_eq o |
1748 |
HOLogic.dest_Trueprop o prop_of)) prems'; |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1749 |
val _ $ (_ $ lhs $ rhs) = prop_of prem; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1750 |
val _ $ (_ $ lhs' $ rhs') = term_of concl; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1751 |
val rT = fastype_of lhs'; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1752 |
val (c, cargsl) = strip_comb lhs; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1753 |
val cargsl' = partition_cargs idxs cargsl; |
32952 | 1754 |
val boundsl = maps fst cargsl'; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1755 |
val (_, cargsr) = strip_comb rhs; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1756 |
val cargsr' = partition_cargs idxs cargsr; |
32952 | 1757 |
val boundsr = maps fst cargsr'; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1758 |
val (params1, _ :: params2) = |
32202 | 1759 |
chop (length params div 2) (map (term_of o #2) params); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1760 |
val params' = params1 @ params2; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1761 |
val rec_prems = filter (fn th => case prop_of th of |
28731 | 1762 |
_ $ p => (case head_of p of |
36692
54b64d4ad524
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
haftmann
parents:
36610
diff
changeset
|
1763 |
Const (s, _) => member (op =) rec_set_names s |
28731 | 1764 |
| _ => false) |
1765 |
| _ => false) prems'; |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1766 |
val fresh_prems = filter (fn th => case prop_of th of |
56253 | 1767 |
_ $ (Const (@{const_name Nominal.fresh}, _) $ _ $ _) => true |
38558 | 1768 |
| _ $ (Const (@{const_name Not}, _) $ _) => true |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1769 |
| _ => false) prems'; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1770 |
val Ts = map fastype_of boundsl; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1771 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1772 |
val _ = warning "step 1: obtaining fresh names"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1773 |
val (freshs1, freshs2, context'') = fold |
28731 | 1774 |
(obtain_fresh_name (rec_ctxt :: rec_fns' @ params') |
32952 | 1775 |
(maps snd finite_thss @ finite_ctxt_ths @ rec_prems) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1776 |
rec_fin_supp_thms') |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1777 |
Ts ([], [], context'); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1778 |
val pi1 = map perm_of_pair (boundsl ~~ freshs1); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1779 |
val rpi1 = rev pi1; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1780 |
val pi2 = map perm_of_pair (boundsr ~~ freshs1); |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1781 |
val rpi2 = rev pi2; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1782 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1783 |
val fresh_prems' = mk_not_sym fresh_prems; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1784 |
val freshs2' = mk_not_sym freshs2; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1785 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1786 |
(** as, bs, cs # K as ts, K bs us **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1787 |
val _ = warning "step 2: as, bs, cs # K as ts, K bs us"; |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1788 |
val prove_fresh_simpset = put_simpset HOL_ss context'' addsimps |
32952 | 1789 |
(finite_Diff :: flat fresh_thms @ |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1790 |
fs_atoms @ abs_fresh @ abs_supp @ fresh_atm); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1791 |
(* FIXME: avoid asm_full_simp_tac ? *) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1792 |
fun prove_fresh ths y x = Goal.prove context'' [] [] |
25823 | 1793 |
(HOLogic.mk_Trueprop (fresh_const |
1794 |
(fastype_of x) (fastype_of y) $ x $ y)) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1795 |
(fn _ => cut_facts_tac ths 1 THEN asm_full_simp_tac prove_fresh_simpset 1); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1796 |
val constr_fresh_thms = |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1797 |
map (prove_fresh fresh_prems lhs) boundsl @ |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1798 |
map (prove_fresh fresh_prems rhs) boundsr @ |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1799 |
map (prove_fresh freshs2 lhs) freshs1 @ |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1800 |
map (prove_fresh freshs2 rhs) freshs1; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1801 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1802 |
(** pi1 o (K as ts) = pi2 o (K bs us) **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1803 |
val _ = warning "step 3: pi1 o (K as ts) = pi2 o (K bs us)"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1804 |
val pi1_pi2_eq = Goal.prove context'' [] [] |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1805 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
22311 | 1806 |
(fold_rev (mk_perm []) pi1 lhs, fold_rev (mk_perm []) pi2 rhs))) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1807 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1808 |
[cut_facts_tac constr_fresh_thms 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1809 |
asm_simp_tac (put_simpset HOL_basic_ss context'' addsimps perm_fresh_fresh) 1, |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1810 |
rtac prem 1]); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1811 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1812 |
(** pi1 o ts = pi2 o us **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1813 |
val _ = warning "step 4: pi1 o ts = pi2 o us"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1814 |
val pi1_pi2_eqs = map (fn (t, u) => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1815 |
Goal.prove context'' [] [] |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1816 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
22311 | 1817 |
(fold_rev (mk_perm []) pi1 t, fold_rev (mk_perm []) pi2 u))) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1818 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1819 |
[cut_facts_tac [pi1_pi2_eq] 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1820 |
asm_full_simp_tac (put_simpset HOL_ss context'' addsimps |
32952 | 1821 |
(calc_atm @ flat perm_simps' @ |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1822 |
fresh_prems' @ freshs2' @ abs_perm @ |
32952 | 1823 |
alpha @ flat inject_thms)) 1])) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1824 |
(map snd cargsl' ~~ map snd cargsr'); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1825 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1826 |
(** pi1^-1 o pi2 o us = ts **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1827 |
val _ = warning "step 5: pi1^-1 o pi2 o us = ts"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1828 |
val rpi1_pi2_eqs = map (fn ((t, u), eq) => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1829 |
Goal.prove context'' [] [] |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1830 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
22311 | 1831 |
(fold_rev (mk_perm []) (rpi1 @ pi2) u, t))) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1832 |
(fn _ => simp_tac (put_simpset HOL_ss context'' addsimps |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1833 |
((eq RS sym) :: perm_swap)) 1)) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1834 |
(map snd cargsl' ~~ map snd cargsr' ~~ pi1_pi2_eqs); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1835 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1836 |
val (rec_prems1, rec_prems2) = |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1837 |
chop (length rec_prems div 2) rec_prems; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1838 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1839 |
(** (ts, pi1^-1 o pi2 o vs) in rec_set **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1840 |
val _ = warning "step 6: (ts, pi1^-1 o pi2 o vs) in rec_set"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1841 |
val rec_prems' = map (fn th => |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1842 |
let |
21021 | 1843 |
val _ $ (S $ x $ y) = prop_of th; |
28731 | 1844 |
val Const (s, _) = head_of S; |
1845 |
val k = find_index (equal s) rec_set_names; |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1846 |
val pi = rpi1 @ pi2; |
22311 | 1847 |
fun mk_pi z = fold_rev (mk_perm []) pi z; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1848 |
fun eqvt_tac p = |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1849 |
let |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1850 |
val U as Type (_, [Type (_, [T, _])]) = fastype_of p; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1851 |
val l = find_index (equal T) dt_atomTs; |
42364 | 1852 |
val th = nth (nth rec_equiv_thms' l) k; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1853 |
val th' = Thm.instantiate ([], |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1854 |
[(cterm_of thy11 (Var (("pi", 0), U)), |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1855 |
cterm_of thy11 p)]) th; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1856 |
in rtac th' 1 end; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1857 |
val th' = Goal.prove context'' [] [] |
21021 | 1858 |
(HOLogic.mk_Trueprop (S $ mk_pi x $ mk_pi y)) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1859 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1860 |
(map eqvt_tac pi @ |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1861 |
[simp_tac (put_simpset HOL_ss context'' addsimps (fresh_prems' @ freshs2' @ |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1862 |
perm_swap @ perm_fresh_fresh)) 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1863 |
rtac th 1])) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1864 |
in |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1865 |
Simplifier.simplify |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1866 |
(put_simpset HOL_basic_ss context'' addsimps rpi1_pi2_eqs) th' |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1867 |
end) rec_prems2; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1868 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1869 |
val ihs = filter (fn th => case prop_of th of |
38558 | 1870 |
_ $ (Const (@{const_name All}, _) $ _) => true | _ => false) prems'; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1871 |
|
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1872 |
(** pi1 o rs = pi2 o vs , rs = pi1^-1 o pi2 o vs **) |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1873 |
val _ = warning "step 7: pi1 o rs = pi2 o vs , rs = pi1^-1 o pi2 o vs"; |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1874 |
val rec_eqns = map (fn (th, ih) => |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1875 |
let |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1876 |
val th' = th RS (ih RS spec RS mp) RS sym; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1877 |
val _ $ (_ $ lhs $ rhs) = prop_of th'; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1878 |
fun strip_perm (_ $ _ $ t) = strip_perm t |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1879 |
| strip_perm t = t; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1880 |
in |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1881 |
Goal.prove context'' [] [] |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1882 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
22311 | 1883 |
(fold_rev (mk_perm []) pi1 lhs, |
1884 |
fold_rev (mk_perm []) pi2 (strip_perm rhs)))) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1885 |
(fn _ => simp_tac (put_simpset HOL_basic_ss context'' addsimps |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1886 |
(th' :: perm_swap)) 1) |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1887 |
end) (rec_prems' ~~ ihs); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1888 |
|
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1889 |
(** as # rs **) |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1890 |
val _ = warning "step 8: as # rs"; |
32952 | 1891 |
val rec_freshs = |
1892 |
maps (fn (rec_prem, ih) => |
|
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1893 |
let |
21021 | 1894 |
val _ $ (S $ x $ (y as Free (_, T))) = |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1895 |
prop_of rec_prem; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1896 |
val k = find_index (equal S) rec_sets; |
32952 | 1897 |
val atoms = flat (map_filter (fn (bs, z) => |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1898 |
if z = x then NONE else SOME bs) cargsl') |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1899 |
in |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1900 |
map (fn a as Free (_, aT) => |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1901 |
let val l = find_index (equal aT) dt_atomTs; |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1902 |
in |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1903 |
Goal.prove context'' [] [] |
25823 | 1904 |
(HOLogic.mk_Trueprop (fresh_const aT T $ a $ y)) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1905 |
(fn _ => EVERY |
42364 | 1906 |
(rtac (nth (nth rec_fresh_thms l) k) 1 :: |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1907 |
map (fn th => rtac th 1) |
42364 | 1908 |
(snd (nth finite_thss l)) @ |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1909 |
[rtac rec_prem 1, rtac ih 1, |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1910 |
REPEAT_DETERM (resolve_tac fresh_prems 1)])) |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1911 |
end) atoms |
32952 | 1912 |
end) (rec_prems1 ~~ ihs); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1913 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1914 |
(** as # fK as ts rs , bs # fK bs us vs **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1915 |
val _ = warning "step 9: as # fK as ts rs , bs # fK bs us vs"; |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1916 |
fun prove_fresh_result (a as Free (_, aT)) = |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1917 |
Goal.prove context'' [] [] |
25823 | 1918 |
(HOLogic.mk_Trueprop (fresh_const aT rT $ a $ rhs')) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1919 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1920 |
[resolve_tac fcbs 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1921 |
REPEAT_DETERM (resolve_tac |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1922 |
(fresh_prems @ rec_freshs) 1), |
20411
dd8a1cda2eaf
Added premises concerning finite support of recursion results to FCBs.
berghofe
parents:
20397
diff
changeset
|
1923 |
REPEAT_DETERM (resolve_tac (maps snd rec_fin_supp_thms') 1 |
dd8a1cda2eaf
Added premises concerning finite support of recursion results to FCBs.
berghofe
parents:
20397
diff
changeset
|
1924 |
THEN resolve_tac rec_prems 1), |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1925 |
resolve_tac P_ind_ths 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1926 |
REPEAT_DETERM (resolve_tac (P_ths @ rec_prems) 1)]); |
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
1927 |
|
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1928 |
val fresh_results'' = map prove_fresh_result boundsl; |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1929 |
|
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1930 |
fun prove_fresh_result'' ((a as Free (_, aT), b), th) = |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1931 |
let val th' = Goal.prove context'' [] [] |
25823 | 1932 |
(HOLogic.mk_Trueprop (fresh_const aT rT $ |
22311 | 1933 |
fold_rev (mk_perm []) (rpi2 @ pi1) a $ |
1934 |
fold_rev (mk_perm []) (rpi2 @ pi1) rhs')) |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1935 |
(fn _ => simp_tac (put_simpset HOL_ss context'' addsimps fresh_bij) 1 THEN |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1936 |
rtac th 1) |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1937 |
in |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1938 |
Goal.prove context'' [] [] |
25823 | 1939 |
(HOLogic.mk_Trueprop (fresh_const aT rT $ b $ lhs')) |
54895 | 1940 |
(fn {context = ctxt, ...} => EVERY |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1941 |
[cut_facts_tac [th'] 1, |
54895 | 1942 |
full_simp_tac (put_simpset HOL_ss ctxt |
25998
f38dc602a926
Tuned uniqueness proof for recursion combinator.
berghofe
parents:
25985
diff
changeset
|
1943 |
addsimps rec_eqns @ pi1_pi2_eqs @ perm_swap |
f38dc602a926
Tuned uniqueness proof for recursion combinator.
berghofe
parents:
25985
diff
changeset
|
1944 |
addsimprocs [NominalPermeq.perm_simproc_app]) 1, |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1945 |
full_simp_tac (put_simpset HOL_ss context'' addsimps (calc_atm @ |
21073
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1946 |
fresh_prems' @ freshs2' @ perm_fresh_fresh)) 1]) |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1947 |
end; |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1948 |
|
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1949 |
val fresh_results = fresh_results'' @ map prove_fresh_result'' |
be0a17371ba6
Proof of "bs # fK bs us vs" no longer depends on FCBs.
berghofe
parents:
21055
diff
changeset
|
1950 |
(boundsl ~~ boundsr ~~ fresh_results''); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1951 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1952 |
(** cs # fK as ts rs , cs # fK bs us vs **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1953 |
val _ = warning "step 10: cs # fK as ts rs , cs # fK bs us vs"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1954 |
fun prove_fresh_result' recs t (a as Free (_, aT)) = |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1955 |
Goal.prove context'' [] [] |
25823 | 1956 |
(HOLogic.mk_Trueprop (fresh_const aT rT $ a $ t)) |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1957 |
(fn _ => EVERY |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1958 |
[cut_facts_tac recs 1, |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1959 |
REPEAT_DETERM (dresolve_tac |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1960 |
(the (AList.lookup op = rec_fin_supp_thms' aT)) 1), |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1961 |
NominalPermeq.fresh_guess_tac |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1962 |
(put_simpset HOL_ss context'' addsimps (freshs2 @ |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1963 |
fs_atoms @ fresh_atm @ |
32952 | 1964 |
maps snd finite_thss)) 1]); |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1965 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1966 |
val fresh_results' = |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1967 |
map (prove_fresh_result' rec_prems1 rhs') freshs1 @ |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1968 |
map (prove_fresh_result' rec_prems2 lhs') freshs1; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1969 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1970 |
(** pi1 o (fK as ts rs) = pi2 o (fK bs us vs) **) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1971 |
val _ = warning "step 11: pi1 o (fK as ts rs) = pi2 o (fK bs us vs)"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1972 |
val pi1_pi2_result = Goal.prove context'' [] [] |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1973 |
(HOLogic.mk_Trueprop (HOLogic.mk_eq |
22311 | 1974 |
(fold_rev (mk_perm []) pi1 rhs', fold_rev (mk_perm []) pi2 lhs'))) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1975 |
(fn _ => simp_tac (put_simpset HOL_ss context'' |
27450
d45d2850aaed
Replaced all but one occurrence of perm_simp_tac by perm_simproc_app,
berghofe
parents:
27300
diff
changeset
|
1976 |
addsimps pi1_pi2_eqs @ rec_eqns |
d45d2850aaed
Replaced all but one occurrence of perm_simp_tac by perm_simproc_app,
berghofe
parents:
27300
diff
changeset
|
1977 |
addsimprocs [NominalPermeq.perm_simproc_app]) 1 THEN |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1978 |
TRY (simp_tac (put_simpset HOL_ss context'' addsimps |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1979 |
(fresh_prems' @ freshs2' @ calc_atm @ perm_fresh_fresh)) 1)); |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1980 |
|
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1981 |
val _ = warning "final result"; |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1982 |
val final = Goal.prove context'' [] [] (term_of concl) |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1983 |
(fn _ => cut_facts_tac [pi1_pi2_result RS sym] 1 THEN |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51685
diff
changeset
|
1984 |
full_simp_tac (put_simpset HOL_basic_ss context'' addsimps perm_fresh_fresh @ |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1985 |
fresh_results @ fresh_results') 1); |
42361 | 1986 |
val final' = Proof_Context.export context'' context' [final]; |
20376
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1987 |
val _ = warning "finished!" |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1988 |
in |
53b31f7c1d87
Finished implementation of uniqueness proof for recursion combinator.
berghofe
parents:
20267
diff
changeset
|
1989 |
resolve_tac final' 1 |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1990 |
end) context 1])) idxss) (ndescr ~~ rec_elims)) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1991 |
end)); |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1992 |
|
46161 | 1993 |
val rec_total_thms = map (fn r => r RS @{thm theI'}) rec_unique_thms; |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1994 |
|
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1995 |
(* define primrec combinators *) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1996 |
|
45701 | 1997 |
val big_reccomb_name = space_implode "_" new_type_names ^ "_rec"; |
28965 | 1998 |
val reccomb_names = map (Sign.full_bname thy11) |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
1999 |
(if length descr'' = 1 then [big_reccomb_name] else |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2000 |
(map ((curry (op ^) (big_reccomb_name ^ "_")) o string_of_int) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2001 |
(1 upto (length descr'')))); |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2002 |
val reccombs = map (fn ((name, T), T') => list_comb |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2003 |
(Const (name, rec_fn_Ts @ [T] ---> T'), rec_fns)) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2004 |
(reccomb_names ~~ recTs ~~ rec_result_Ts); |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2005 |
|
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2006 |
val (reccomb_defs, thy12) = |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2007 |
thy11 |
56239 | 2008 |
|> Sign.add_consts (map (fn ((name, T), T') => |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30345
diff
changeset
|
2009 |
(Binding.name (Long_Name.base_name name), rec_fn_Ts @ [T] ---> T', NoSyn)) |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2010 |
(reccomb_names ~~ recTs ~~ rec_result_Ts)) |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
2011 |
|> (Global_Theory.add_defs false o map Thm.no_attributes) (map (fn ((((name, comb), set), T), T') => |
44241 | 2012 |
(Binding.name (Long_Name.base_name name ^ "_def"), Logic.mk_equals (comb, absfree ("x", T) |
2013 |
(Const (@{const_name The}, (T' --> HOLogic.boolT) --> T') $ absfree ("y", T') |
|
2014 |
(set $ Free ("x", T) $ Free ("y", T')))))) |
|
52788 | 2015 |
(reccomb_names ~~ reccombs ~~ rec_sets ~~ recTs ~~ rec_result_Ts)); |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2016 |
|
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2017 |
(* prove characteristic equations for primrec combinators *) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2018 |
|
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2019 |
val rec_thms = map (fn (prems, concl) => |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2020 |
let |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2021 |
val _ $ (_ $ (_ $ x) $ _) = concl; |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2022 |
val (_, cargs) = strip_comb x; |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2023 |
val ps = map (fn (x as Free (_, T), i) => |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2024 |
(Free ("x" ^ string_of_int i, T), x)) (cargs ~~ (1 upto length cargs)); |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2025 |
val concl' = subst_atomic_types (rec_result_Ts' ~~ rec_result_Ts) concl; |
32952 | 2026 |
val prems' = flat finite_premss @ finite_ctxt_prems @ |
21088 | 2027 |
rec_prems @ rec_prems' @ map (subst_atomic ps) prems; |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2028 |
fun solve rules prems = resolve_tac rules THEN_ALL_NEW |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2029 |
(resolve_tac prems THEN_ALL_NEW atac) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2030 |
in |
51122
386a117925db
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm
parents:
49835
diff
changeset
|
2031 |
Goal.prove_global_future thy12 [] |
28731 | 2032 |
(map (augment_sort thy12 fs_cp_sort) prems') |
2033 |
(augment_sort thy12 fs_cp_sort concl') |
|
54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
2034 |
(fn {context = ctxt, prems} => EVERY |
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
52788
diff
changeset
|
2035 |
[rewrite_goals_tac ctxt reccomb_defs, |
46161 | 2036 |
rtac @{thm the1_equality} 1, |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2037 |
solve rec_unique_thms prems 1, |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2038 |
resolve_tac rec_intrs 1, |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2039 |
REPEAT (solve (prems @ rec_total_thms) prems 1)]) |
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2040 |
end) (rec_eq_prems ~~ |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
2041 |
Old_Datatype_Prop.make_primrecs reccomb_names descr' thy12); |
21365
4ee8e2702241
InductivePackage.add_inductive_i: canonical argument order;
wenzelm
parents:
21291
diff
changeset
|
2042 |
|
45822 | 2043 |
val dt_infos = map_index (make_dt_info pdescr induct reccomb_names rec_thms) |
33063 | 2044 |
(descr1 ~~ distinct_thms ~~ inject_thms); |
21540
f3faed8276e6
Additional information about nominal datatypes (descriptor,
berghofe
parents:
21516
diff
changeset
|
2045 |
|
19985
d39c554cf750
Implemented proofs of equivariance and finite support
berghofe
parents:
19874
diff
changeset
|
2046 |
(* FIXME: theorems are stored in database for testing only *) |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2047 |
val (_, thy13) = thy12 |> |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39159
diff
changeset
|
2048 |
Global_Theory.add_thmss |
32952 | 2049 |
[((Binding.name "rec_equiv", flat rec_equiv_thms), []), |
2050 |
((Binding.name "rec_equiv'", flat rec_equiv_thms'), []), |
|
2051 |
((Binding.name "rec_fin_supp", flat rec_fin_supp_thms), []), |
|
2052 |
((Binding.name "rec_fresh", flat rec_fresh_thms), []), |
|
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
33968
diff
changeset
|
2053 |
((Binding.name "rec_unique", map Drule.export_without_context rec_unique_thms), []), |
29585 | 2054 |
((Binding.name "recs", rec_thms), [])] ||> |
24712
64ed05609568
proper Sign operations instead of Theory aliases;
wenzelm
parents:
24459
diff
changeset
|
2055 |
Sign.parent_path ||> |
52788 | 2056 |
map_nominal_datatypes (fold Symtab.update dt_infos); |
17870 | 2057 |
in |
20397
243293620225
- Fixed bug that caused uniqueness proof for recursion
berghofe
parents:
20376
diff
changeset
|
2058 |
thy13 |
17870 | 2059 |
end; |
2060 |
||
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
2061 |
val nominal_datatype = gen_nominal_datatype Old_Datatype.check_specs; |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
2062 |
val nominal_datatype_cmd = gen_nominal_datatype Old_Datatype.read_specs; |
17870 | 2063 |
|
24867 | 2064 |
val _ = |
46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46219
diff
changeset
|
2065 |
Outer_Syntax.command @{command_spec "nominal_datatype"} "define nominal datatypes" |
58112
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
2066 |
(Parse.and_list1 Old_Datatype.spec_cmd >> |
8081087096ad
renamed modules defining old datatypes, as a step towards having 'datatype_new' take 'datatype's place
blanchet
parents:
58111
diff
changeset
|
2067 |
(Toplevel.theory o nominal_datatype_cmd Old_Datatype_Aux.default_config)); |
17870 | 2068 |
|
18261
1318955d57ac
Corrected treatment of non-recursive abstraction types.
berghofe
parents:
18246
diff
changeset
|
2069 |
end |