author | wenzelm |
Sun, 01 Nov 2009 15:24:45 +0100 | |
changeset 33368 | b1cf34f1855c |
parent 33338 | de76079f973a |
child 33369 | 470a7b233ee5 |
permissions | -rw-r--r-- |
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31177
diff
changeset
|
1 |
(* Title: HOL/Tools/inductive.ML |
5094 | 2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
3 |
Author: Stefan Berghofer and Markus Wenzel, TU Muenchen |
5094 | 4 |
|
6424 | 5 |
(Co)Inductive Definition module for HOL. |
5094 | 6 |
|
7 |
Features: |
|
6424 | 8 |
* least or greatest fixedpoints |
9 |
* mutually recursive definitions |
|
10 |
* definitions involving arbitrary monotone operators |
|
11 |
* automatically proves introduction and elimination rules |
|
5094 | 12 |
|
13 |
Introduction rules have the form |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
14 |
[| M Pj ti, ..., Q x, ... |] ==> Pk t |
5094 | 15 |
where M is some monotone operator (usually the identity) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
16 |
Q x is any side condition on the free variables |
5094 | 17 |
ti, t are any terms |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
18 |
Pj, Pk are two of the predicates being defined in mutual recursion |
5094 | 19 |
*) |
20 |
||
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31177
diff
changeset
|
21 |
signature BASIC_INDUCTIVE = |
5094 | 22 |
sig |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
23 |
type inductive_result |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
24 |
val morph_result: morphism -> inductive_result -> inductive_result |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
25 |
type inductive_info |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
26 |
val the_inductive: Proof.context -> string -> inductive_info |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
27 |
val print_inductives: Proof.context -> unit |
18728 | 28 |
val mono_add: attribute |
29 |
val mono_del: attribute |
|
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
30 |
val get_monos: Proof.context -> thm list |
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
31 |
val mk_cases: Proof.context -> term -> thm |
10910
058775a575db
export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents:
10804
diff
changeset
|
32 |
val inductive_forall_name: string |
058775a575db
export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents:
10804
diff
changeset
|
33 |
val inductive_forall_def: thm |
058775a575db
export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents:
10804
diff
changeset
|
34 |
val rulify: thm -> thm |
28839
32d498cf7595
eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents:
28791
diff
changeset
|
35 |
val inductive_cases: (Attrib.binding * string list) list -> local_theory -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
36 |
thm list list * local_theory |
28839
32d498cf7595
eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents:
28791
diff
changeset
|
37 |
val inductive_cases_i: (Attrib.binding * term list) list -> local_theory -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
38 |
thm list list * local_theory |
26534 | 39 |
type inductive_flags |
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset
|
40 |
val add_inductive_i: |
29581 | 41 |
inductive_flags -> ((binding * typ) * mixfix) list -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
42 |
(string * typ) list -> (Attrib.binding * term) list -> thm list -> local_theory -> |
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
43 |
inductive_result * local_theory |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
44 |
val add_inductive: bool -> bool -> |
29581 | 45 |
(binding * string option * mixfix) list -> |
46 |
(binding * string option * mixfix) list -> |
|
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
47 |
(Attrib.binding * string) list -> |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
48 |
(Facts.ref * Attrib.src list) list -> |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
49 |
bool -> local_theory -> inductive_result * local_theory |
33171
292970b42770
name space groups are identified by serial, not serial_string;
wenzelm
parents:
33095
diff
changeset
|
50 |
val add_inductive_global: serial -> inductive_flags -> |
29581 | 51 |
((binding * typ) * mixfix) list -> (string * typ) list -> (Attrib.binding * term) list -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
52 |
thm list -> theory -> inductive_result * theory |
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
53 |
val arities_of: thm -> (string * int) list |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
54 |
val params_of: thm -> term list |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
55 |
val partition_rules: thm -> thm list -> (string * thm list) list |
25822 | 56 |
val partition_rules': thm -> (thm * 'a) list -> (string * (thm * 'a) list) list |
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
57 |
val unpartition_rules: thm list -> (string * 'a list) list -> 'a list |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
58 |
val infer_intro_vars: thm -> int -> thm list -> term list list |
18708 | 59 |
val setup: theory -> theory |
5094 | 60 |
end; |
61 |
||
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31177
diff
changeset
|
62 |
signature INDUCTIVE = |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
63 |
sig |
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31177
diff
changeset
|
64 |
include BASIC_INDUCTIVE |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
65 |
type add_ind_def |
29581 | 66 |
val declare_rules: string -> binding -> bool -> bool -> string list -> |
67 |
thm list -> binding list -> Attrib.src list list -> (thm * string list) list -> |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
68 |
thm -> local_theory -> thm list * thm list * thm * local_theory |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
69 |
val add_ind_def: add_ind_def |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
70 |
val gen_add_inductive_i: add_ind_def -> inductive_flags -> |
29581 | 71 |
((binding * typ) * mixfix) list -> (string * typ) list -> (Attrib.binding * term) list -> |
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
72 |
thm list -> local_theory -> inductive_result * local_theory |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
73 |
val gen_add_inductive: add_ind_def -> bool -> bool -> |
29581 | 74 |
(binding * string option * mixfix) list -> |
75 |
(binding * string option * mixfix) list -> |
|
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
76 |
(Attrib.binding * string) list -> (Facts.ref * Attrib.src list) list -> |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
77 |
bool -> local_theory -> inductive_result * local_theory |
26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset
|
78 |
val gen_ind_decl: add_ind_def -> bool -> |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
79 |
OuterParse.token list -> (bool -> local_theory -> local_theory) * OuterParse.token list |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
80 |
end; |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
81 |
|
31723
f5cafe803b55
discontinued ancient tradition to suffix certain ML module names with "_package"
haftmann
parents:
31177
diff
changeset
|
82 |
structure Inductive: INDUCTIVE = |
5094 | 83 |
struct |
84 |
||
9598 | 85 |
|
10729 | 86 |
(** theory context references **) |
87 |
||
11991 | 88 |
val inductive_forall_name = "HOL.induct_forall"; |
32602 | 89 |
val inductive_forall_def = @{thm induct_forall_def}; |
11991 | 90 |
val inductive_conj_name = "HOL.induct_conj"; |
32602 | 91 |
val inductive_conj_def = @{thm induct_conj_def}; |
92 |
val inductive_conj = @{thms induct_conj}; |
|
93 |
val inductive_atomize = @{thms induct_atomize}; |
|
94 |
val inductive_rulify = @{thms induct_rulify}; |
|
95 |
val inductive_rulify_fallback = @{thms induct_rulify_fallback}; |
|
10729 | 96 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
97 |
val notTrueE = TrueI RSN (2, notE); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
98 |
val notFalseI = Seq.hd (atac 1 notI); |
32181 | 99 |
|
100 |
val simp_thms' = map mk_meta_eq |
|
101 |
@{lemma "(~True) = False" "(~False) = True" |
|
102 |
"(True --> P) = P" "(False --> P) = True" |
|
103 |
"(P & True) = P" "(True & P) = P" |
|
104 |
by (fact simp_thms)+}; |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
105 |
|
32652 | 106 |
val simp_thms'' = map mk_meta_eq [@{thm inf_fun_eq}, @{thm inf_bool_eq}] @ simp_thms'; |
107 |
||
108 |
val simp_thms''' = map mk_meta_eq |
|
109 |
[@{thm le_fun_def}, @{thm le_bool_def}, @{thm sup_fun_eq}, @{thm sup_bool_eq}]; |
|
10729 | 110 |
|
111 |
||
22846 | 112 |
(** context data **) |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
113 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
114 |
type inductive_result = |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
115 |
{preds: term list, elims: thm list, raw_induct: thm, |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
116 |
induct: thm, intrs: thm list}; |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
117 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
118 |
fun morph_result phi {preds, elims, raw_induct: thm, induct, intrs} = |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
119 |
let |
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
120 |
val term = Morphism.term phi; |
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
121 |
val thm = Morphism.thm phi; |
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
122 |
val fact = Morphism.fact phi; |
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
123 |
in |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
124 |
{preds = map term preds, elims = fact elims, raw_induct = thm raw_induct, |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
125 |
induct = thm induct, intrs = fact intrs} |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
126 |
end; |
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
127 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
128 |
type inductive_info = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
129 |
{names: string list, coind: bool} * inductive_result; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
130 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
131 |
structure InductiveData = GenericDataFun |
22846 | 132 |
( |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
133 |
type T = inductive_info Symtab.table * thm list; |
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
134 |
val empty = (Symtab.empty, []); |
16432 | 135 |
val extend = I; |
136 |
fun merge _ ((tab1, monos1), (tab2, monos2)) = |
|
24039
273698405054
renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents:
23881
diff
changeset
|
137 |
(Symtab.merge (K true) (tab1, tab2), Thm.merge_thms (monos1, monos2)); |
22846 | 138 |
); |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
139 |
|
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
140 |
val get_inductives = InductiveData.get o Context.Proof; |
22846 | 141 |
|
142 |
fun print_inductives ctxt = |
|
143 |
let |
|
144 |
val (tab, monos) = get_inductives ctxt; |
|
145 |
val space = Consts.space_of (ProofContext.consts_of ctxt); |
|
146 |
in |
|
33095
bbd52d2f8696
renamed NameSpace to Name_Space -- also to emphasize its subtle change in semantics;
wenzelm
parents:
33077
diff
changeset
|
147 |
[Pretty.strs ("(co)inductives:" :: map #1 (Name_Space.extern_table (space, tab))), |
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32035
diff
changeset
|
148 |
Pretty.big_list "monotonicity rules:" (map (Display.pretty_thm ctxt) monos)] |
22846 | 149 |
|> Pretty.chunks |> Pretty.writeln |
150 |
end; |
|
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
151 |
|
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
152 |
|
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
153 |
(* get and put data *) |
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
154 |
|
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
155 |
fun the_inductive ctxt name = |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
156 |
(case Symtab.lookup (#1 (get_inductives ctxt)) name of |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
157 |
NONE => error ("Unknown (co)inductive predicate " ^ quote name) |
15531 | 158 |
| SOME info => info); |
9598 | 159 |
|
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
160 |
fun put_inductives names info = InductiveData.map |
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
161 |
(apfst (fold (fn name => Symtab.update (name, info)) names)); |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
162 |
|
8277 | 163 |
|
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
164 |
|
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
165 |
(** monotonicity rules **) |
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
166 |
|
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
167 |
val get_monos = #2 o get_inductives; |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
168 |
val map_monos = InductiveData.map o apsnd; |
8277 | 169 |
|
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
170 |
fun mk_mono thm = |
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
171 |
let |
22275
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
172 |
val concl = concl_of thm; |
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
173 |
fun eq2mono thm' = [thm' RS (thm' RS eq_to_mono)] @ |
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
174 |
(case concl of |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
175 |
(_ $ (_ $ (Const ("Not", _) $ _) $ _)) => [] |
22275
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
176 |
| _ => [thm' RS (thm' RS eq_to_mono2)]); |
32652 | 177 |
fun dest_less_concl thm = dest_less_concl (thm RS @{thm le_funD}) |
178 |
handle THM _ => thm RS @{thm le_boolD} |
|
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
179 |
in |
22275
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
180 |
case concl of |
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
181 |
Const ("==", _) $ _ $ _ => eq2mono (thm RS meta_eq_to_obj_eq) |
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
182 |
| _ $ (Const ("op =", _) $ _ $ _) => eq2mono thm |
32602 | 183 |
| _ $ (Const (@{const_name HOL.less_eq}, _) $ _ $ _) => |
22275
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
184 |
[dest_less_concl (Seq.hd (REPEAT (FIRSTGOAL |
32652 | 185 |
(resolve_tac [@{thm le_funI}, @{thm le_boolI'}])) thm))] |
22275
51411098e49b
- Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset
|
186 |
| _ => [thm] |
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32035
diff
changeset
|
187 |
end handle THM _ => |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32035
diff
changeset
|
188 |
error ("Bad monotonicity theorem:\n" ^ Display.string_of_thm_without_context thm); |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
189 |
|
24039
273698405054
renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents:
23881
diff
changeset
|
190 |
val mono_add = Thm.declaration_attribute (map_monos o fold Thm.add_thm o mk_mono); |
273698405054
renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents:
23881
diff
changeset
|
191 |
val mono_del = Thm.declaration_attribute (map_monos o fold Thm.del_thm o mk_mono); |
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
192 |
|
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset
|
193 |
|
7107 | 194 |
|
10735 | 195 |
(** misc utilities **) |
6424 | 196 |
|
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
197 |
fun message quiet_mode s = if quiet_mode then () else writeln s; |
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
198 |
fun clean_message quiet_mode s = if ! quick_and_dirty then () else message quiet_mode s; |
5662 | 199 |
|
6424 | 200 |
fun coind_prefix true = "co" |
201 |
| coind_prefix false = ""; |
|
202 |
||
24133
75063f96618f
added int type constraints to accomodate hacked SML/NJ;
wenzelm
parents:
24039
diff
changeset
|
203 |
fun log (b:int) m n = if m >= n then 0 else 1 + log b (b * m) n; |
6424 | 204 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
205 |
fun make_bool_args f g [] i = [] |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
206 |
| make_bool_args f g (x :: xs) i = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
207 |
(if i mod 2 = 0 then f x else g x) :: make_bool_args f g xs (i div 2); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
208 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
209 |
fun make_bool_args' xs = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
210 |
make_bool_args (K HOLogic.false_const) (K HOLogic.true_const) xs; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
211 |
|
33077
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
212 |
fun arg_types_of k c = Library.drop (k, binder_types (fastype_of c)); |
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
213 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
214 |
fun find_arg T x [] = sys_error "find_arg" |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
215 |
| find_arg T x ((p as (_, (SOME _, _))) :: ps) = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
216 |
apsnd (cons p) (find_arg T x ps) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
217 |
| find_arg T x ((p as (U, (NONE, y))) :: ps) = |
23577 | 218 |
if (T: typ) = U then (y, (U, (SOME x, y)) :: ps) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
219 |
else apsnd (cons p) (find_arg T x ps); |
7020
75ff179df7b7
Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents:
6851
diff
changeset
|
220 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
221 |
fun make_args Ts xs = |
28524 | 222 |
map (fn (T, (NONE, ())) => Const (@{const_name undefined}, T) | (_, (SOME t, ())) => t) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
223 |
(fold (fn (t, T) => snd o find_arg T t) xs (map (rpair (NONE, ())) Ts)); |
7020
75ff179df7b7
Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents:
6851
diff
changeset
|
224 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
225 |
fun make_args' Ts xs Us = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
226 |
fst (fold_map (fn T => find_arg T ()) Us (Ts ~~ map (pair NONE) xs)); |
7020
75ff179df7b7
Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents:
6851
diff
changeset
|
227 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
228 |
fun dest_predicate cs params t = |
5094 | 229 |
let |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
230 |
val k = length params; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
231 |
val (c, ts) = strip_comb t; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
232 |
val (xs, ys) = chop k ts; |
31986 | 233 |
val i = find_index (fn c' => c' = c) cs; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
234 |
in |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
235 |
if xs = params andalso i >= 0 then |
33077
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
236 |
SOME (c, i, ys, chop (length ys) (arg_types_of k c)) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
237 |
else NONE |
5094 | 238 |
end; |
239 |
||
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
240 |
fun mk_names a 0 = [] |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
241 |
| mk_names a 1 = [a] |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
242 |
| mk_names a n = map (fn i => a ^ string_of_int i) (1 upto n); |
10988
e0016a009c17
Splitting of arguments of product types in induction rules is now less
berghofe
parents:
10910
diff
changeset
|
243 |
|
6424 | 244 |
|
245 |
||
10729 | 246 |
(** process rules **) |
247 |
||
248 |
local |
|
5094 | 249 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
250 |
fun err_in_rule ctxt name t msg = |
16432 | 251 |
error (cat_lines ["Ill-formed introduction rule " ^ quote name, |
24920 | 252 |
Syntax.string_of_term ctxt t, msg]); |
10729 | 253 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
254 |
fun err_in_prem ctxt name t p msg = |
24920 | 255 |
error (cat_lines ["Ill-formed premise", Syntax.string_of_term ctxt p, |
256 |
"in introduction rule " ^ quote name, Syntax.string_of_term ctxt t, msg]); |
|
5094 | 257 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
258 |
val bad_concl = "Conclusion of introduction rule must be an inductive predicate"; |
10729 | 259 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
260 |
val bad_ind_occ = "Inductive predicate occurs in argument of inductive predicate"; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
261 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
262 |
val bad_app = "Inductive predicate must be applied to parameter(s) "; |
11358
416ea5c009f5
now checks for leading meta-quantifiers and complains, instead of
paulson
parents:
11036
diff
changeset
|
263 |
|
16432 | 264 |
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize []; |
10729 | 265 |
|
266 |
in |
|
5094 | 267 |
|
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
268 |
fun check_rule ctxt cs params ((binding, att), rule) = |
10729 | 269 |
let |
30218 | 270 |
val err_name = Binding.str_of binding; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
271 |
val params' = Term.variant_frees rule (Logic.strip_params rule); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
272 |
val frees = rev (map Free params'); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
273 |
val concl = subst_bounds (frees, Logic.strip_assums_concl rule); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
274 |
val prems = map (curry subst_bounds frees) (Logic.strip_assums_hyp rule); |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
275 |
val rule' = Logic.list_implies (prems, concl); |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
276 |
val aprems = map (atomize_term (ProofContext.theory_of ctxt)) prems; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
277 |
val arule = list_all_free (params', Logic.list_implies (aprems, concl)); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
278 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
279 |
fun check_ind err t = case dest_predicate cs params t of |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
280 |
NONE => err (bad_app ^ |
24920 | 281 |
commas (map (Syntax.string_of_term ctxt) params)) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
282 |
| SOME (_, _, ys, _) => |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
283 |
if exists (fn c => exists (fn t => Logic.occs (c, t)) ys) cs |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
284 |
then err bad_ind_occ else (); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
285 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
286 |
fun check_prem' prem t = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
287 |
if head_of t mem cs then |
29006 | 288 |
check_ind (err_in_prem ctxt err_name rule prem) t |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
289 |
else (case t of |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
290 |
Abs (_, _, t) => check_prem' prem t |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
291 |
| t $ u => (check_prem' prem t; check_prem' prem u) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
292 |
| _ => ()); |
5094 | 293 |
|
10729 | 294 |
fun check_prem (prem, aprem) = |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
295 |
if can HOLogic.dest_Trueprop aprem then check_prem' prem prem |
29006 | 296 |
else err_in_prem ctxt err_name rule prem "Non-atomic premise"; |
10729 | 297 |
in |
11358
416ea5c009f5
now checks for leading meta-quantifiers and complains, instead of
paulson
parents:
11036
diff
changeset
|
298 |
(case concl of |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
299 |
Const ("Trueprop", _) $ t => |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
300 |
if head_of t mem cs then |
29006 | 301 |
(check_ind (err_in_rule ctxt err_name rule') t; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
302 |
List.app check_prem (prems ~~ aprems)) |
29006 | 303 |
else err_in_rule ctxt err_name rule' bad_concl |
304 |
| _ => err_in_rule ctxt err_name rule' bad_concl); |
|
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
305 |
((binding, att), arule) |
10729 | 306 |
end; |
5094 | 307 |
|
24744
dcb8cf5fc99c
- add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset
|
308 |
val rulify = |
18222 | 309 |
hol_simplify inductive_conj |
18463 | 310 |
#> hol_simplify inductive_rulify |
311 |
#> hol_simplify inductive_rulify_fallback |
|
30552
58db56278478
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm
parents:
30528
diff
changeset
|
312 |
#> Simplifier.norm_hhf; |
10729 | 313 |
|
314 |
end; |
|
315 |
||
5094 | 316 |
|
6424 | 317 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
318 |
(** proofs for (co)inductive predicates **) |
6424 | 319 |
|
26534 | 320 |
(* prove monotonicity *) |
5094 | 321 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
322 |
fun prove_mono quiet_mode skip_mono fork_mono predT fp_fun monos ctxt = |
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
323 |
(message (quiet_mode orelse skip_mono andalso !quick_and_dirty orelse fork_mono) |
26534 | 324 |
" Proving monotonicity ..."; |
32970
fbd2bb2489a8
operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents:
32952
diff
changeset
|
325 |
(if skip_mono then Skip_Proof.prove else if fork_mono then Goal.prove_future else Goal.prove) ctxt |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
326 |
[] [] |
17985 | 327 |
(HOLogic.mk_Trueprop |
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset
|
328 |
(Const (@{const_name Orderings.mono}, (predT --> predT) --> HOLogic.boolT) $ fp_fun)) |
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
329 |
(fn _ => EVERY [rtac @{thm monoI} 1, |
32652 | 330 |
REPEAT (resolve_tac [@{thm le_funI}, @{thm le_boolI'}] 1), |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
331 |
REPEAT (FIRST |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
332 |
[atac 1, |
32952 | 333 |
resolve_tac (maps mk_mono monos @ get_monos ctxt) 1, |
32652 | 334 |
etac @{thm le_funE} 1, dtac @{thm le_boolD} 1])])); |
5094 | 335 |
|
6424 | 336 |
|
10735 | 337 |
(* prove introduction rules *) |
5094 | 338 |
|
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
339 |
fun prove_intrs quiet_mode coind mono fp_def k params intr_ts rec_preds_defs ctxt = |
5094 | 340 |
let |
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
341 |
val _ = clean_message quiet_mode " Proving the introduction rules ..."; |
5094 | 342 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
343 |
val unfold = funpow k (fn th => th RS fun_cong) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
344 |
(mono RS (fp_def RS |
32652 | 345 |
(if coind then @{thm def_gfp_unfold} else @{thm def_lfp_unfold}))); |
5094 | 346 |
|
347 |
fun select_disj 1 1 = [] |
|
348 |
| select_disj _ 1 = [rtac disjI1] |
|
349 |
| select_disj n i = (rtac disjI2)::(select_disj (n - 1) (i - 1)); |
|
350 |
||
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
351 |
val rules = [refl, TrueI, notFalseI, exI, conjI]; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
352 |
|
22605
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
353 |
val intrs = map_index (fn (i, intr) => rulify |
32970
fbd2bb2489a8
operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents:
32952
diff
changeset
|
354 |
(Skip_Proof.prove ctxt (map (fst o dest_Free) params) [] intr (fn _ => EVERY |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
355 |
[rewrite_goals_tac rec_preds_defs, |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
356 |
rtac (unfold RS iffD2) 1, |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
357 |
EVERY1 (select_disj (length intr_ts) (i + 1)), |
17985 | 358 |
(*Not ares_tac, since refl must be tried before any equality assumptions; |
359 |
backtracking may occur if the premises have extra variables!*) |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
360 |
DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)]))) intr_ts |
5094 | 361 |
|
362 |
in (intrs, unfold) end; |
|
363 |
||
6424 | 364 |
|
10735 | 365 |
(* prove elimination rules *) |
5094 | 366 |
|
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
367 |
fun prove_elims quiet_mode cs params intr_ts intr_names unfold rec_preds_defs ctxt = |
5094 | 368 |
let |
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
369 |
val _ = clean_message quiet_mode " Proving the elimination rules ..."; |
5094 | 370 |
|
22605
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
371 |
val ([pname], ctxt') = ctxt |> |
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
372 |
Variable.add_fixes (map (fst o dest_Free) params) |> snd |> |
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
373 |
Variable.variant_fixes ["P"]; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
374 |
val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT)); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
375 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
376 |
fun dest_intr r = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
377 |
(the (dest_predicate cs params (HOLogic.dest_Trueprop (Logic.strip_assums_concl r))), |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
378 |
Logic.strip_assums_hyp r, Logic.strip_params r); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
379 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
380 |
val intrs = map dest_intr intr_ts ~~ intr_names; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
381 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
382 |
val rules1 = [disjE, exE, FalseE]; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
383 |
val rules2 = [conjE, FalseE, notTrueE]; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
384 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
385 |
fun prove_elim c = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
386 |
let |
33077
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
387 |
val Ts = arg_types_of (length params) c; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
388 |
val (anames, ctxt'') = Variable.variant_fixes (mk_names "a" (length Ts)) ctxt'; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
389 |
val frees = map Free (anames ~~ Ts); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
390 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
391 |
fun mk_elim_prem ((_, _, us, _), ts, params') = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
392 |
list_all (params', |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
393 |
Logic.list_implies (map (HOLogic.mk_Trueprop o HOLogic.mk_eq) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
394 |
(frees ~~ us) @ ts, P)); |
33317 | 395 |
val c_intrs = filter (equal c o #1 o #1 o #1) intrs; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
396 |
val prems = HOLogic.mk_Trueprop (list_comb (c, params @ frees)) :: |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
397 |
map mk_elim_prem (map #1 c_intrs) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
398 |
in |
32970
fbd2bb2489a8
operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents:
32952
diff
changeset
|
399 |
(Skip_Proof.prove ctxt'' [] prems P |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
400 |
(fn {prems, ...} => EVERY |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
401 |
[cut_facts_tac [hd prems] 1, |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
402 |
rewrite_goals_tac rec_preds_defs, |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
403 |
dtac (unfold RS iffD1) 1, |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
404 |
REPEAT (FIRSTGOAL (eresolve_tac rules1)), |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
405 |
REPEAT (FIRSTGOAL (eresolve_tac rules2)), |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
406 |
EVERY (map (fn prem => |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
407 |
DEPTH_SOLVE_1 (ares_tac [rewrite_rule rec_preds_defs prem, conjI] 1)) (tl prems))]) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
408 |
|> rulify |
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
409 |
|> singleton (ProofContext.export ctxt'' ctxt), |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
410 |
map #2 c_intrs) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
411 |
end |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
412 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
413 |
in map prove_elim cs end; |
5094 | 414 |
|
6424 | 415 |
|
10735 | 416 |
(* derivation of simplified elimination rules *) |
5094 | 417 |
|
11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
418 |
local |
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
419 |
|
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
420 |
(*delete needless equality assumptions*) |
29064 | 421 |
val refl_thin = Goal.prove_global @{theory HOL} [] [] @{prop "!!P. a = a ==> P ==> P"} |
22838 | 422 |
(fn _ => assume_tac 1); |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
423 |
val elim_rls = [asm_rl, FalseE, refl_thin, conjE, exE]; |
11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
424 |
val elim_tac = REPEAT o Tactic.eresolve_tac elim_rls; |
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
425 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
426 |
fun simp_case_tac ss i = |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
427 |
EVERY' [elim_tac, asm_full_simp_tac ss, elim_tac, REPEAT o bound_hyp_subst_tac] i; |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
428 |
|
11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
429 |
in |
9598 | 430 |
|
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
431 |
fun mk_cases ctxt prop = |
7107 | 432 |
let |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
433 |
val thy = ProofContext.theory_of ctxt; |
32149
ef59550a55d3
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32091
diff
changeset
|
434 |
val ss = simpset_of ctxt; |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
435 |
|
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
436 |
fun err msg = |
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
437 |
error (Pretty.string_of (Pretty.block |
24920 | 438 |
[Pretty.str msg, Pretty.fbrk, Syntax.pretty_term ctxt prop])); |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
439 |
|
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset
|
440 |
val elims = Induct.find_casesP ctxt prop; |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
441 |
|
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
442 |
val cprop = Thm.cterm_of thy prop; |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
443 |
val tac = ALLGOALS (simp_case_tac ss) THEN prune_params_tac; |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
444 |
fun mk_elim rl = |
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
445 |
Thm.implies_intr cprop (Tactic.rule_by_tactic tac (Thm.assume cprop RS rl)) |
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
446 |
|> singleton (Variable.export (Variable.auto_fixes prop ctxt) ctxt); |
7107 | 447 |
in |
448 |
(case get_first (try mk_elim) elims of |
|
15531 | 449 |
SOME r => r |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
450 |
| NONE => err "Proposition not an inductive predicate:") |
7107 | 451 |
end; |
452 |
||
11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
453 |
end; |
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset
|
454 |
|
7107 | 455 |
|
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
456 |
(* inductive_cases *) |
7107 | 457 |
|
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
458 |
fun gen_inductive_cases prep_att prep_prop args lthy = |
9598 | 459 |
let |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
460 |
val thy = ProofContext.theory_of lthy; |
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12798
diff
changeset
|
461 |
val facts = args |> map (fn ((a, atts), props) => |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
462 |
((a, map (prep_att thy) atts), |
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
463 |
map (Thm.no_attributes o single o mk_cases lthy o prep_prop lthy) props)); |
31177 | 464 |
in lthy |> LocalTheory.notes Thm.generatedK facts |>> map snd end; |
5094 | 465 |
|
24509
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24133
diff
changeset
|
466 |
val inductive_cases = gen_inductive_cases Attrib.intern_src Syntax.read_prop; |
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24133
diff
changeset
|
467 |
val inductive_cases_i = gen_inductive_cases (K I) Syntax.check_prop; |
7107 | 468 |
|
6424 | 469 |
|
30722
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
470 |
val ind_cases_setup = |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
471 |
Method.setup @{binding ind_cases} |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
472 |
(Scan.lift (Scan.repeat1 Args.name_source -- |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
473 |
Scan.optional (Args.$$$ "for" |-- Scan.repeat1 Args.name) []) >> |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
474 |
(fn (raw_props, fixes) => fn ctxt => |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
475 |
let |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
476 |
val (_, ctxt') = Variable.add_fixes fixes ctxt; |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
477 |
val props = Syntax.read_props ctxt' raw_props; |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
478 |
val ctxt'' = fold Variable.declare_term props ctxt'; |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
479 |
val rules = ProofContext.export ctxt'' ctxt (map (mk_cases ctxt'') props) |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
480 |
in Method.erule 0 rules end)) |
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
481 |
"dynamic case analysis on predicates"; |
9598 | 482 |
|
483 |
||
10735 | 484 |
(* prove induction rule *) |
5094 | 485 |
|
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
486 |
fun prove_indrule quiet_mode cs argTs bs xs rec_const params intr_ts mono |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
487 |
fp_def rec_preds_defs ctxt = |
5094 | 488 |
let |
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
489 |
val _ = clean_message quiet_mode " Proving the induction rule ..."; |
20047 | 490 |
val thy = ProofContext.theory_of ctxt; |
5094 | 491 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
492 |
(* predicates for induction rule *) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
493 |
|
22605
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
494 |
val (pnames, ctxt') = ctxt |> |
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
495 |
Variable.add_fixes (map (fst o dest_Free) params) |> snd |> |
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
496 |
Variable.variant_fixes (mk_names "P" (length cs)); |
33077
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
497 |
val preds = map2 (curry Free) pnames |
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
498 |
(map (fn c => arg_types_of (length params) c ---> HOLogic.boolT) cs); |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
499 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
500 |
(* transform an introduction rule into a premise for induction rule *) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
501 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
502 |
fun mk_ind_prem r = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
503 |
let |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
504 |
fun subst s = (case dest_predicate cs params s of |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
505 |
SOME (_, i, ys, (_, Ts)) => |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
506 |
let |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
507 |
val k = length Ts; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
508 |
val bs = map Bound (k - 1 downto 0); |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
509 |
val P = list_comb (List.nth (preds, i), |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
510 |
map (incr_boundvars k) ys @ bs); |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
511 |
val Q = list_abs (mk_names "x" k ~~ Ts, |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
512 |
HOLogic.mk_binop inductive_conj_name |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
513 |
(list_comb (incr_boundvars k s, bs), P)) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
514 |
in (Q, case Ts of [] => SOME (s, P) | _ => NONE) end |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
515 |
| NONE => (case s of |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
516 |
(t $ u) => (fst (subst t) $ fst (subst u), NONE) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
517 |
| (Abs (a, T, t)) => (Abs (a, T, fst (subst t)), NONE) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
518 |
| _ => (s, NONE))); |
7293 | 519 |
|
33338 | 520 |
fun mk_prem s prems = |
521 |
(case subst s of |
|
522 |
(_, SOME (t, u)) => t :: u :: prems |
|
523 |
| (t, _) => t :: prems); |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
524 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
525 |
val SOME (_, i, ys, _) = dest_predicate cs params |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
526 |
(HOLogic.dest_Trueprop (Logic.strip_assums_concl r)) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
527 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
528 |
in list_all_free (Logic.strip_params r, |
33338 | 529 |
Logic.list_implies (map HOLogic.mk_Trueprop (fold_rev mk_prem |
530 |
(map HOLogic.dest_Trueprop (Logic.strip_assums_hyp r)) []), |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
531 |
HOLogic.mk_Trueprop (list_comb (List.nth (preds, i), ys)))) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
532 |
end; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
533 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
534 |
val ind_prems = map mk_ind_prem intr_ts; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
535 |
|
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
536 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
537 |
(* make conclusions for induction rules *) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
538 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
539 |
val Tss = map (binder_types o fastype_of) preds; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
540 |
val (xnames, ctxt'') = |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
541 |
Variable.variant_fixes (mk_names "x" (length (flat Tss))) ctxt'; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
542 |
val mutual_ind_concl = HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
543 |
(map (fn (((xnames, Ts), c), P) => |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
544 |
let val frees = map Free (xnames ~~ Ts) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
545 |
in HOLogic.mk_imp |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
546 |
(list_comb (c, params @ frees), list_comb (P, frees)) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
547 |
end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds))); |
5094 | 548 |
|
13626
282fbabec862
Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents:
13197
diff
changeset
|
549 |
|
5094 | 550 |
(* make predicate for instantiation of abstract induction rule *) |
551 |
||
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
552 |
val ind_pred = fold_rev lambda (bs @ xs) (foldr1 HOLogic.mk_conj |
33338 | 553 |
(map_index (fn (i, P) => fold_rev (curry HOLogic.mk_imp) |
554 |
(make_bool_args HOLogic.mk_not I bs i) |
|
555 |
(list_comb (P, make_args' argTs xs (binder_types (fastype_of P))))) preds)); |
|
5094 | 556 |
|
557 |
val ind_concl = HOLogic.mk_Trueprop |
|
23881 | 558 |
(HOLogic.mk_binrel "HOL.ord_class.less_eq" (rec_const, ind_pred)); |
5094 | 559 |
|
32652 | 560 |
val raw_fp_induct = (mono RS (fp_def RS @{thm def_lfp_induct})); |
13626
282fbabec862
Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents:
13197
diff
changeset
|
561 |
|
32970
fbd2bb2489a8
operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents:
32952
diff
changeset
|
562 |
val induct = Skip_Proof.prove ctxt'' [] ind_prems ind_concl |
20248 | 563 |
(fn {prems, ...} => EVERY |
17985 | 564 |
[rewrite_goals_tac [inductive_conj_def], |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
565 |
DETERM (rtac raw_fp_induct 1), |
32652 | 566 |
REPEAT (resolve_tac [@{thm le_funI}, @{thm le_boolI}] 1), |
32610
c477b0a62ce9
rewrite premises in tactical proof also with inf_fun_eq and inf_bool_eq: attempt to allow user to use inf [=>] and inf [bool] in his specs
haftmann
parents:
32602
diff
changeset
|
567 |
rewrite_goals_tac simp_thms'', |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
568 |
(*This disjE separates out the introduction rules*) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
569 |
REPEAT (FIRSTGOAL (eresolve_tac [disjE, exE, FalseE])), |
5094 | 570 |
(*Now break down the individual cases. No disjE here in case |
571 |
some premise involves disjunction.*) |
|
13747
bf308fcfd08e
Better treatment of equality in premises of inductive definitions. Less
paulson
parents:
13709
diff
changeset
|
572 |
REPEAT (FIRSTGOAL (etac conjE ORELSE' bound_hyp_subst_tac)), |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
573 |
REPEAT (FIRSTGOAL |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
574 |
(resolve_tac [conjI, impI] ORELSE' (etac notE THEN' atac))), |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
575 |
EVERY (map (fn prem => DEPTH_SOLVE_1 (ares_tac [rewrite_rule |
32610
c477b0a62ce9
rewrite premises in tactical proof also with inf_fun_eq and inf_bool_eq: attempt to allow user to use inf [=>] and inf [bool] in his specs
haftmann
parents:
32602
diff
changeset
|
576 |
(inductive_conj_def :: rec_preds_defs @ simp_thms'') prem, |
22980
1226d861eefb
Fixed bug that caused proof of induction theorem to fail if
berghofe
parents:
22846
diff
changeset
|
577 |
conjI, refl] 1)) prems)]); |
5094 | 578 |
|
32970
fbd2bb2489a8
operations of structure Skip_Proof (formerly SkipProof) no longer require quick_and_dirty mode;
wenzelm
parents:
32952
diff
changeset
|
579 |
val lemma = Skip_Proof.prove ctxt'' [] [] |
17985 | 580 |
(Logic.mk_implies (ind_concl, mutual_ind_concl)) (fn _ => EVERY |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
581 |
[rewrite_goals_tac rec_preds_defs, |
5094 | 582 |
REPEAT (EVERY |
583 |
[REPEAT (resolve_tac [conjI, impI] 1), |
|
32652 | 584 |
REPEAT (eresolve_tac [@{thm le_funE}, @{thm le_boolE}] 1), |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
585 |
atac 1, |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
586 |
rewrite_goals_tac simp_thms', |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
587 |
atac 1])]) |
5094 | 588 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
589 |
in singleton (ProofContext.export ctxt'' ctxt) (induct RS lemma) end; |
5094 | 590 |
|
6424 | 591 |
|
592 |
||
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
593 |
(** specification of (co)inductive predicates **) |
10729 | 594 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
595 |
fun mk_ind_def quiet_mode skip_mono fork_mono alt_name coind cs intr_ts monos params cnames_syn ctxt = |
33278 | 596 |
let (* FIXME proper naming convention: lthy *) |
24915 | 597 |
val fp_name = if coind then @{const_name Inductive.gfp} else @{const_name Inductive.lfp}; |
5094 | 598 |
|
33077
3c9cf88ec841
arg_types_of auxiliary function; using multiset operations
haftmann
parents:
33056
diff
changeset
|
599 |
val argTs = fold (combine (op =) o arg_types_of (length params)) cs []; |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
600 |
val k = log 2 1 (length cs); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
601 |
val predT = replicate k HOLogic.boolT ---> argTs ---> HOLogic.boolT; |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
602 |
val p :: xs = map Free (Variable.variant_frees ctxt intr_ts |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
603 |
(("p", predT) :: (mk_names "x" (length argTs) ~~ argTs))); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
604 |
val bs = map Free (Variable.variant_frees ctxt (p :: xs @ intr_ts) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
605 |
(map (rpair HOLogic.boolT) (mk_names "b" k))); |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
606 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
607 |
fun subst t = (case dest_predicate cs params t of |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
608 |
SOME (_, i, ts, (Ts, Us)) => |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
609 |
let |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
610 |
val l = length Us; |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
611 |
val zs = map Bound (l - 1 downto 0) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
612 |
in |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
613 |
list_abs (map (pair "z") Us, list_comb (p, |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
614 |
make_bool_args' bs i @ make_args argTs |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
615 |
((map (incr_boundvars l) ts ~~ Ts) @ (zs ~~ Us)))) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
616 |
end |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
617 |
| NONE => (case t of |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
618 |
t1 $ t2 => subst t1 $ subst t2 |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
619 |
| Abs (x, T, u) => Abs (x, T, subst u) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
620 |
| _ => t)); |
5149 | 621 |
|
5094 | 622 |
(* transform an introduction rule into a conjunction *) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
623 |
(* [| p_i t; ... |] ==> p_j u *) |
5094 | 624 |
(* is transformed into *) |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
625 |
(* b_j & x_j = u & p b_j t & ... *) |
5094 | 626 |
|
627 |
fun transform_rule r = |
|
628 |
let |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
629 |
val SOME (_, i, ts, (Ts, _)) = dest_predicate cs params |
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
630 |
(HOLogic.dest_Trueprop (Logic.strip_assums_concl r)); |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
631 |
val ps = make_bool_args HOLogic.mk_not I bs i @ |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
632 |
map HOLogic.mk_eq (make_args' argTs xs Ts ~~ ts) @ |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
633 |
map (subst o HOLogic.dest_Trueprop) |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
634 |
(Logic.strip_assums_hyp r) |
33338 | 635 |
in |
636 |
fold_rev (fn (x, T) => fn P => HOLogic.exists_const T $ Abs (x, T, P)) |
|
637 |
(Logic.strip_params r) |
|
638 |
(if null ps then HOLogic.true_const else foldr1 HOLogic.mk_conj ps) |
|
5094 | 639 |
end |
640 |
||
641 |
(* make a disjunction of all introduction rules *) |
|
642 |
||
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
643 |
val fp_fun = fold_rev lambda (p :: bs @ xs) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
644 |
(if null intr_ts then HOLogic.false_const |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
645 |
else foldr1 HOLogic.mk_disj (map transform_rule intr_ts)); |
5094 | 646 |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
647 |
(* add definiton of recursive predicates to theory *) |
5094 | 648 |
|
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
649 |
val rec_name = |
28965 | 650 |
if Binding.is_empty alt_name then |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
651 |
Binding.name (space_implode "_" (map (Binding.name_of o fst) cnames_syn)) |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
652 |
else alt_name; |
5094 | 653 |
|
33278 | 654 |
val ((rec_const, (_, fp_def)), ctxt') = ctxt |
655 |
|> LocalTheory.conceal |
|
656 |
|> LocalTheory.define Thm.internalK |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
657 |
((rec_name, case cnames_syn of [(_, syn)] => syn | _ => NoSyn), |
28965 | 658 |
(Attrib.empty_binding, fold_rev lambda params |
33278 | 659 |
(Const (fp_name, (predT --> predT) --> predT) $ fp_fun))) |
660 |
||> LocalTheory.restore_naming ctxt; |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
661 |
val fp_def' = Simplifier.rewrite (HOL_basic_ss addsimps [fp_def]) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
662 |
(cterm_of (ProofContext.theory_of ctxt') (list_comb (rec_const, params))); |
33278 | 663 |
val specs = |
664 |
if length cs < 2 then [] |
|
665 |
else |
|
666 |
map_index (fn (i, (name_mx, c)) => |
|
667 |
let |
|
668 |
val Ts = arg_types_of (length params) c; |
|
669 |
val xs = map Free (Variable.variant_frees ctxt intr_ts |
|
670 |
(mk_names "x" (length Ts) ~~ Ts)) |
|
671 |
in |
|
672 |
(name_mx, (Attrib.empty_binding, fold_rev lambda (params @ xs) |
|
673 |
(list_comb (rec_const, params @ make_bool_args' bs i @ |
|
674 |
make_args argTs (xs ~~ Ts))))) |
|
675 |
end) (cnames_syn ~~ cs); |
|
676 |
val (consts_defs, ctxt'') = ctxt' |
|
677 |
|> LocalTheory.conceal |
|
678 |
|> fold_map (LocalTheory.define Thm.internalK) specs |
|
679 |
||> LocalTheory.restore_naming ctxt'; |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
680 |
val preds = (case cs of [_] => [rec_const] | _ => map #1 consts_defs); |
5094 | 681 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
682 |
val mono = prove_mono quiet_mode skip_mono fork_mono predT fp_fun monos ctxt''; |
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
683 |
val ((_, [mono']), ctxt''') = |
33278 | 684 |
LocalTheory.note Thm.internalK (apfst Binding.conceal Attrib.empty_binding, [mono]) ctxt''; |
5094 | 685 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
686 |
in (ctxt''', rec_name, mono', fp_def', map (#2 o #2) consts_defs, |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
687 |
list_comb (rec_const, params), preds, argTs, bs, xs) |
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
688 |
end; |
5094 | 689 |
|
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
690 |
fun declare_rules kind rec_binding coind no_ind cnames intrs intr_bindings intr_atts |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
691 |
elims raw_induct ctxt = |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
692 |
let |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
693 |
val rec_name = Binding.name_of rec_binding; |
32773 | 694 |
fun rec_qualified qualified = Binding.qualify qualified rec_name; |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
695 |
val intr_names = map Binding.name_of intr_bindings; |
33368 | 696 |
val ind_case_names = Rule_Cases.case_names intr_names; |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
697 |
val induct = |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
698 |
if coind then |
33368 | 699 |
(raw_induct, [Rule_Cases.case_names [rec_name], |
700 |
Rule_Cases.case_conclusion (rec_name, intr_names), |
|
701 |
Rule_Cases.consumes 1, Induct.coinduct_pred (hd cnames)]) |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
702 |
else if no_ind orelse length cnames > 1 then |
33368 | 703 |
(raw_induct, [ind_case_names, Rule_Cases.consumes 0]) |
704 |
else (raw_induct RSN (2, rev_mp), [ind_case_names, Rule_Cases.consumes 1]); |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
705 |
|
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
706 |
val (intrs', ctxt1) = |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
707 |
ctxt |> |
26128 | 708 |
LocalTheory.notes kind |
33278 | 709 |
(map (rec_qualified false) intr_bindings ~~ intr_atts ~~ |
710 |
map (fn th => [([th], |
|
29868 | 711 |
[Attrib.internal (K (ContextRules.intro_query NONE)), |
33056
791a4655cae3
renamed "nitpick_const_xxx" attributes to "nitpick_xxx" and "nitpick_ind_intros" to "nitpick_intros"
blanchet
parents:
33051
diff
changeset
|
712 |
Attrib.internal (K Nitpick_Intros.add)])]) intrs) |>> |
24744
dcb8cf5fc99c
- add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset
|
713 |
map (hd o snd); |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
714 |
val (((_, elims'), (_, [induct'])), ctxt2) = |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
715 |
ctxt1 |> |
32773 | 716 |
LocalTheory.note kind ((rec_qualified true (Binding.name "intros"), []), intrs') ||>> |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
717 |
fold_map (fn (name, (elim, cases)) => |
32773 | 718 |
LocalTheory.note kind ((Binding.qualify true (Long_Name.base_name name) (Binding.name "cases"), |
33368 | 719 |
[Attrib.internal (K (Rule_Cases.case_names cases)), |
720 |
Attrib.internal (K (Rule_Cases.consumes 1)), |
|
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset
|
721 |
Attrib.internal (K (Induct.cases_pred name)), |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
722 |
Attrib.internal (K (ContextRules.elim_query NONE))]), [elim]) #> |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
723 |
apfst (hd o snd)) (if null elims then [] else cnames ~~ elims) ||>> |
28107 | 724 |
LocalTheory.note kind |
32773 | 725 |
((rec_qualified true (Binding.name (coind_prefix coind ^ "induct")), |
28107 | 726 |
map (Attrib.internal o K) (#2 induct)), [rulify (#1 induct)]); |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
727 |
|
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
728 |
val ctxt3 = if no_ind orelse coind then ctxt2 else |
32172 | 729 |
let val inducts = cnames ~~ Project_Rule.projects ctxt2 (1 upto length cnames) induct' |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
730 |
in |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
731 |
ctxt2 |> |
32773 | 732 |
LocalTheory.notes kind [((rec_qualified true (Binding.name "inducts"), []), |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
733 |
inducts |> map (fn (name, th) => ([th], |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
734 |
[Attrib.internal (K ind_case_names), |
33368 | 735 |
Attrib.internal (K (Rule_Cases.consumes 1)), |
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset
|
736 |
Attrib.internal (K (Induct.induct_pred name))])))] |> snd |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
737 |
end |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
738 |
in (intrs', elims', induct', ctxt3) end; |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
739 |
|
26534 | 740 |
type inductive_flags = |
29581 | 741 |
{quiet_mode: bool, verbose: bool, kind: string, alt_name: binding, |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
742 |
coind: bool, no_elim: bool, no_ind: bool, skip_mono: bool, fork_mono: bool} |
26534 | 743 |
|
744 |
type add_ind_def = |
|
745 |
inductive_flags -> |
|
28084
a05ca48ef263
type Attrib.binding abbreviates Name.binding without attributes;
wenzelm
parents:
28083
diff
changeset
|
746 |
term list -> (Attrib.binding * term) list -> thm list -> |
29581 | 747 |
term list -> (binding * mixfix) list -> |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
748 |
local_theory -> inductive_result * local_theory |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
749 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
750 |
fun add_ind_def {quiet_mode, verbose, kind, alt_name, coind, no_elim, no_ind, skip_mono, fork_mono} |
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset
|
751 |
cs intros monos params cnames_syn ctxt = |
9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset
|
752 |
let |
25288 | 753 |
val _ = null cnames_syn andalso error "No inductive predicates given"; |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
754 |
val names = map (Binding.name_of o fst) cnames_syn; |
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
755 |
val _ = message (quiet_mode andalso not verbose) |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
756 |
("Proofs for " ^ coind_prefix coind ^ "inductive predicate(s) " ^ commas_quote names); |
9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset
|
757 |
|
30089
f631fb528277
Use LocalTheory.full_name instead of Sign.full_name, because the latter does
berghofe
parents:
29868
diff
changeset
|
758 |
val cnames = map (LocalTheory.full_name ctxt o #1) cnames_syn; (* FIXME *) |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
759 |
val ((intr_names, intr_atts), intr_ts) = |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
760 |
apfst split_list (split_list (map (check_rule ctxt cs params) intros)); |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
761 |
|
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
762 |
val (ctxt1, rec_name, mono, fp_def, rec_preds_defs, rec_const, preds, |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
763 |
argTs, bs, xs) = mk_ind_def quiet_mode skip_mono fork_mono alt_name coind cs intr_ts |
26534 | 764 |
monos params cnames_syn ctxt; |
9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset
|
765 |
|
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
766 |
val (intrs, unfold) = prove_intrs quiet_mode coind mono fp_def (length bs + length xs) |
22605
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
767 |
params intr_ts rec_preds_defs ctxt1; |
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
768 |
val elims = if no_elim then [] else |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
769 |
prove_elims quiet_mode cs params intr_ts (map Binding.name_of intr_names) |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
770 |
unfold rec_preds_defs ctxt1; |
22605
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
771 |
val raw_induct = zero_var_indexes |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
772 |
(if no_ind then Drule.asm_rl else |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
773 |
if coind then |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
774 |
singleton (ProofContext.export |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
775 |
(snd (Variable.add_fixes (map (fst o dest_Free) params) ctxt1)) ctxt1) |
28839
32d498cf7595
eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents:
28791
diff
changeset
|
776 |
(rotate_prems ~1 (ObjectLogic.rulify |
32d498cf7595
eliminated rewrite_tac/fold_tac, which are not well-formed tactics due to change of main conclusion;
wenzelm
parents:
28791
diff
changeset
|
777 |
(fold_rule rec_preds_defs |
32652 | 778 |
(rewrite_rule simp_thms''' |
779 |
(mono RS (fp_def RS @{thm def_coinduct})))))) |
|
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
780 |
else |
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
781 |
prove_indrule quiet_mode cs argTs bs xs rec_const params intr_ts mono fp_def |
22605
41b092e7d89a
- Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset
|
782 |
rec_preds_defs ctxt1); |
5094 | 783 |
|
26128 | 784 |
val (intrs', elims', induct, ctxt2) = declare_rules kind rec_name coind no_ind |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
785 |
cnames intrs intr_names intr_atts elims raw_induct ctxt1; |
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
786 |
|
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
787 |
val result = |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
788 |
{preds = preds, |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
789 |
intrs = intrs', |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
790 |
elims = elims', |
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
791 |
raw_induct = rulify raw_induct, |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
792 |
induct = induct}; |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
793 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
794 |
val ctxt3 = ctxt2 |
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset
|
795 |
|> LocalTheory.declaration (fn phi => |
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
796 |
let val result' = morph_result phi result; |
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
797 |
in put_inductives cnames (*global names!?*) ({names = cnames, coind = coind}, result') end); |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
798 |
in (result, ctxt3) end; |
5094 | 799 |
|
6424 | 800 |
|
10735 | 801 |
(* external interfaces *) |
5094 | 802 |
|
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset
|
803 |
fun gen_add_inductive_i mk_def |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
804 |
(flags as {quiet_mode, verbose, kind, alt_name, coind, no_elim, no_ind, skip_mono, fork_mono}) |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
805 |
cnames_syn pnames spec monos lthy = |
5094 | 806 |
let |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
807 |
val thy = ProofContext.theory_of lthy; |
6424 | 808 |
val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions"); |
5094 | 809 |
|
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset
|
810 |
|
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
811 |
(* abbrevs *) |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
812 |
|
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
813 |
val (_, ctxt1) = Variable.add_fixes (map (Binding.name_of o fst o fst) cnames_syn) lthy; |
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset
|
814 |
|
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
815 |
fun get_abbrev ((name, atts), t) = |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
816 |
if can (Logic.strip_assums_concl #> Logic.dest_equals) t then |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
817 |
let |
29006 | 818 |
val _ = Binding.is_empty name andalso null atts orelse |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
819 |
error "Abbreviations may not have names or attributes"; |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
820 |
val ((x, T), rhs) = LocalDefs.abs_def (snd (LocalDefs.cert_def ctxt1 t)); |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
821 |
val var = |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
822 |
(case find_first (fn ((c, _), _) => Binding.name_of c = x) cnames_syn of |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
823 |
NONE => error ("Undeclared head of abbreviation " ^ quote x) |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
824 |
| SOME ((b, T'), mx) => |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
825 |
if T <> T' then error ("Bad type specification for abbreviation " ^ quote x) |
28083
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
826 |
else (b, mx)); |
103d9282a946
explicit type Name.binding for higher-specification elements;
wenzelm
parents:
27882
diff
changeset
|
827 |
in SOME (var, rhs) end |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
828 |
else NONE; |
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset
|
829 |
|
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
830 |
val abbrevs = map_filter get_abbrev spec; |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
831 |
val bs = map (Binding.name_of o fst o fst) abbrevs; |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
832 |
|
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset
|
833 |
|
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
834 |
(* predicates *) |
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset
|
835 |
|
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
836 |
val pre_intros = filter_out (is_some o get_abbrev) spec; |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
837 |
val cnames_syn' = filter_out (member (op =) bs o Binding.name_of o fst o fst) cnames_syn; |
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
838 |
val cs = map (Free o apfst Binding.name_of o fst) cnames_syn'; |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
839 |
val ps = map Free pnames; |
5094 | 840 |
|
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
841 |
val (_, ctxt2) = lthy |> Variable.add_fixes (map (Binding.name_of o fst o fst) cnames_syn'); |
25143
2a1acc88a180
abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents:
25114
diff
changeset
|
842 |
val _ = map (fn abbr => LocalDefs.fixed_abbrev abbr ctxt2) abbrevs; |
2a1acc88a180
abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents:
25114
diff
changeset
|
843 |
val ctxt3 = ctxt2 |> fold (snd oo LocalDefs.fixed_abbrev) abbrevs; |
2a1acc88a180
abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents:
25114
diff
changeset
|
844 |
val expand = Assumption.export_term ctxt3 lthy #> ProofContext.cert_term lthy; |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
845 |
|
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
846 |
fun close_rule r = list_all_free (rev (fold_aterms |
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset
|
847 |
(fn t as Free (v as (s, _)) => |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
848 |
if Variable.is_fixed ctxt1 s orelse |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
849 |
member (op =) ps t then I else insert (op =) v |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
850 |
| _ => I) r []), r); |
5094 | 851 |
|
26736
e6091328718f
added explicit check phase after reading of specification
haftmann
parents:
26534
diff
changeset
|
852 |
val intros = map (apsnd (Syntax.check_term lthy #> close_rule #> expand)) pre_intros; |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
853 |
val preds = map (fn ((c, _), mx) => (c, mx)) cnames_syn'; |
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
854 |
in |
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
855 |
lthy |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
856 |
|> mk_def flags cs intros monos ps preds |
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset
|
857 |
||> fold (snd oo LocalTheory.abbrev Syntax.mode_default) abbrevs |
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset
|
858 |
end; |
5094 | 859 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
860 |
fun gen_add_inductive mk_def verbose coind cnames_syn pnames_syn intro_srcs raw_monos int lthy = |
5094 | 861 |
let |
30486
9cdc7ce0e389
simplified preparation and outer parsing of specification;
wenzelm
parents:
30435
diff
changeset
|
862 |
val ((vars, intrs), _) = lthy |
9cdc7ce0e389
simplified preparation and outer parsing of specification;
wenzelm
parents:
30435
diff
changeset
|
863 |
|> ProofContext.set_mode ProofContext.mode_abbrev |
9cdc7ce0e389
simplified preparation and outer parsing of specification;
wenzelm
parents:
30435
diff
changeset
|
864 |
|> Specification.read_spec (cnames_syn @ pnames_syn) intro_srcs; |
24721 | 865 |
val (cs, ps) = chop (length cnames_syn) vars; |
866 |
val monos = Attrib.eval_thms lthy raw_monos; |
|
31177 | 867 |
val flags = {quiet_mode = false, verbose = verbose, kind = Thm.generatedK, |
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
868 |
alt_name = Binding.empty, coind = coind, no_elim = false, no_ind = false, |
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
869 |
skip_mono = false, fork_mono = not int}; |
26128 | 870 |
in |
871 |
lthy |
|
33171
292970b42770
name space groups are identified by serial, not serial_string;
wenzelm
parents:
33095
diff
changeset
|
872 |
|> LocalTheory.set_group (serial ()) |
30223
24d975352879
renamed Binding.name_pos to Binding.make, renamed Binding.base_name to Binding.name_of, renamed Binding.map_base to Binding.map_name, added mandatory flag to Binding.qualify;
wenzelm
parents:
30218
diff
changeset
|
873 |
|> gen_add_inductive_i mk_def flags cs (map (apfst Binding.name_of o fst) ps) intrs monos |
26128 | 874 |
end; |
5094 | 875 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
876 |
val add_inductive_i = gen_add_inductive_i add_ind_def; |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
877 |
val add_inductive = gen_add_inductive add_ind_def; |
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
878 |
|
26128 | 879 |
fun add_inductive_global group flags cnames_syn pnames pre_intros monos thy = |
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
880 |
let |
29006 | 881 |
val name = Sign.full_name thy (fst (fst (hd cnames_syn))); |
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
882 |
val ctxt' = thy |
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
883 |
|> TheoryTarget.init NONE |
26128 | 884 |
|> LocalTheory.set_group group |
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
885 |
|> add_inductive_i flags cnames_syn pnames pre_intros monos |> snd |
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
886 |
|> LocalTheory.exit; |
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
887 |
val info = #2 (the_inductive ctxt' name); |
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset
|
888 |
in (info, ProofContext.theory_of ctxt') end; |
6424 | 889 |
|
890 |
||
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
891 |
(* read off arities of inductive predicates from raw induction rule *) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
892 |
fun arities_of induct = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
893 |
map (fn (_ $ t $ u) => |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
894 |
(fst (dest_Const (head_of t)), length (snd (strip_comb u)))) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
895 |
(HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct))); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
896 |
|
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
897 |
(* read off parameters of inductive predicate from raw induction rule *) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
898 |
fun params_of induct = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
899 |
let |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
900 |
val (_ $ t $ u :: _) = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
901 |
HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
902 |
val (_, ts) = strip_comb t; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
903 |
val (_, us) = strip_comb u |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
904 |
in |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
905 |
List.take (ts, length ts - length us) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
906 |
end; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
907 |
|
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
908 |
val pname_of_intr = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
909 |
concl_of #> HOLogic.dest_Trueprop #> head_of #> dest_Const #> fst; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
910 |
|
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
911 |
(* partition introduction rules according to predicate name *) |
25822 | 912 |
fun gen_partition_rules f induct intros = |
913 |
fold_rev (fn r => AList.map_entry op = (pname_of_intr (f r)) (cons r)) intros |
|
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
914 |
(map (rpair [] o fst) (arities_of induct)); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
915 |
|
25822 | 916 |
val partition_rules = gen_partition_rules I; |
917 |
fun partition_rules' induct = gen_partition_rules fst induct; |
|
918 |
||
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
919 |
fun unpartition_rules intros xs = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
920 |
fold_map (fn r => AList.map_entry_yield op = (pname_of_intr r) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
921 |
(fn x :: xs => (x, xs)) #>> the) intros xs |> fst; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
922 |
|
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
923 |
(* infer order of variables in intro rules from order of quantifiers in elim rule *) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
924 |
fun infer_intro_vars elim arity intros = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
925 |
let |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
926 |
val thy = theory_of_thm elim; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
927 |
val _ :: cases = prems_of elim; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
928 |
val used = map (fst o fst) (Term.add_vars (prop_of elim) []); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
929 |
fun mtch (t, u) = |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
930 |
let |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
931 |
val params = Logic.strip_params t; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
932 |
val vars = map (Var o apfst (rpair 0)) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
933 |
(Name.variant_list used (map fst params) ~~ map snd params); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
934 |
val ts = map (curry subst_bounds (rev vars)) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
935 |
(List.drop (Logic.strip_assums_hyp t, arity)); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
936 |
val us = Logic.strip_imp_prems u; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
937 |
val tab = fold (Pattern.first_order_match thy) (ts ~~ us) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
938 |
(Vartab.empty, Vartab.empty); |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
939 |
in |
32035 | 940 |
map (Envir.subst_term tab) vars |
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
941 |
end |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
942 |
in |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
943 |
map (mtch o apsnd prop_of) (cases ~~ intros) |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
944 |
end; |
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
945 |
|
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset
|
946 |
|
25978 | 947 |
|
6437 | 948 |
(** package setup **) |
949 |
||
950 |
(* setup theory *) |
|
951 |
||
8634 | 952 |
val setup = |
30722
623d4831c8cf
simplified attribute and method setup: eliminating bottom-up styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30552
diff
changeset
|
953 |
ind_cases_setup #> |
30528 | 954 |
Attrib.setup @{binding mono} (Attrib.add_del mono_add mono_del) |
955 |
"declaration of monotonicity rule"; |
|
6437 | 956 |
|
957 |
||
958 |
(* outer syntax *) |
|
6424 | 959 |
|
17057 | 960 |
local structure P = OuterParse and K = OuterKeyword in |
6424 | 961 |
|
27353
71c4dd53d4cb
moved global keywords from OuterSyntax to OuterKeyword, tuned interfaces;
wenzelm
parents:
27252
diff
changeset
|
962 |
val _ = OuterKeyword.keyword "monos"; |
24867 | 963 |
|
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
964 |
fun gen_ind_decl mk_def coind = |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
965 |
P.fixes -- P.for_fixes -- |
30486
9cdc7ce0e389
simplified preparation and outer parsing of specification;
wenzelm
parents:
30435
diff
changeset
|
966 |
Scan.optional SpecParse.where_alt_specs [] -- |
22102 | 967 |
Scan.optional (P.$$$ "monos" |-- P.!!! SpecParse.xthms1) [] |
26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset
|
968 |
>> (fn (((preds, params), specs), monos) => |
30486
9cdc7ce0e389
simplified preparation and outer parsing of specification;
wenzelm
parents:
30435
diff
changeset
|
969 |
(snd oo gen_add_inductive mk_def true coind preds params specs monos)); |
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
970 |
|
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset
|
971 |
val ind_decl = gen_ind_decl add_ind_def; |
6424 | 972 |
|
29388
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
973 |
val _ = OuterSyntax.local_theory' "inductive" "define inductive predicates" K.thy_decl (ind_decl false); |
79eb3649ca9e
added fork_mono flag, which is usually enabled in batch-mode only;
wenzelm
parents:
29064
diff
changeset
|
974 |
val _ = OuterSyntax.local_theory' "coinductive" "define coinductive predicates" K.thy_decl (ind_decl true); |
6723 | 975 |
|
24867 | 976 |
val _ = |
26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset
|
977 |
OuterSyntax.local_theory "inductive_cases" |
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset
|
978 |
"create simplified instances of elimination rules (improper)" K.thy_script |
30486
9cdc7ce0e389
simplified preparation and outer parsing of specification;
wenzelm
parents:
30435
diff
changeset
|
979 |
(P.and_list1 SpecParse.specs >> (snd oo inductive_cases)); |
7107 | 980 |
|
5094 | 981 |
end; |
6424 | 982 |
|
983 |
end; |