author  wenzelm 
Sat, 24 May 2008 22:04:52 +0200  
changeset 26988  742e26213212 
parent 26928  ca87aff1ad2d 
child 27252  042aebff17e1 
permissions  rwrr 
5094  1 
(* Title: HOL/Tools/inductive_package.ML 
2 
ID: $Id$ 

3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

4 
Author: Stefan Berghofer and Markus Wenzel, TU Muenchen 
5094  5 

6424  6 
(Co)Inductive Definition module for HOL. 
5094  7 

8 
Features: 

6424  9 
* least or greatest fixedpoints 
10 
* mutually recursive definitions 

11 
* definitions involving arbitrary monotone operators 

12 
* automatically proves introduction and elimination rules 

5094  13 

14 
Introduction rules have the form 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

15 
[ M Pj ti, ..., Q x, ... ] ==> Pk t 
5094  16 
where M is some monotone operator (usually the identity) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

17 
Q x is any side condition on the free variables 
5094  18 
ti, t are any terms 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

19 
Pj, Pk are two of the predicates being defined in mutual recursion 
5094  20 
*) 
21 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

22 
signature BASIC_INDUCTIVE_PACKAGE = 
5094  23 
sig 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

24 
type inductive_result 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

25 
val morph_result: morphism > inductive_result > inductive_result 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

26 
type inductive_info 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

27 
val the_inductive: Proof.context > string > inductive_info 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

28 
val print_inductives: Proof.context > unit 
18728  29 
val mono_add: attribute 
30 
val mono_del: attribute 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

31 
val get_monos: Proof.context > thm list 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

32 
val mk_cases: Proof.context > term > thm 
10910
058775a575db
export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents:
10804
diff
changeset

33 
val inductive_forall_name: string 
058775a575db
export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents:
10804
diff
changeset

34 
val inductive_forall_def: thm 
058775a575db
export inductive_forall_name, inductive_forall_def, rulify;
wenzelm
parents:
10804
diff
changeset

35 
val rulify: thm > thm 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

36 
val inductive_cases: ((bstring * Attrib.src list) * string list) list > 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

37 
Proof.context > thm list list * local_theory 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

38 
val inductive_cases_i: ((bstring * Attrib.src list) * term list) list > 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

39 
Proof.context > thm list list * local_theory 
26534  40 
type inductive_flags 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

41 
val add_inductive_i: 
26534  42 
inductive_flags > ((string * typ) * mixfix) list > 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

43 
(string * typ) list > ((bstring * Attrib.src list) * term) list > thm list > 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

44 
local_theory > inductive_result * local_theory 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

45 
val add_inductive: bool > bool > (string * string option * mixfix) list > 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

46 
(string * string option * mixfix) list > 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26128
diff
changeset

47 
((bstring * Attrib.src list) * string) list > (Facts.ref * Attrib.src list) list > 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

48 
local_theory > inductive_result * local_theory 
26534  49 
val add_inductive_global: string > inductive_flags > 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

50 
((string * typ) * mixfix) list > (string * typ) list > 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

51 
((bstring * Attrib.src list) * term) list > thm list > theory > inductive_result * theory 
22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

52 
val arities_of: thm > (string * int) list 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

53 
val params_of: thm > term list 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

54 
val partition_rules: thm > thm list > (string * thm list) list 
25822  55 
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

56 
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

57 
val infer_intro_vars: thm > int > thm list > term list list 
18708  58 
val setup: theory > theory 
5094  59 
end; 
60 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

61 
signature INDUCTIVE_PACKAGE = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

62 
sig 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

63 
include BASIC_INDUCTIVE_PACKAGE 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

64 
type add_ind_def 
26128  65 
val declare_rules: string > bstring > bool > bool > string list > 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

66 
thm list > bstring list > Attrib.src list list > (thm * string list) list > 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

67 
thm > local_theory > thm list * thm list * thm * local_theory 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

68 
val add_ind_def: add_ind_def 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

69 
val gen_add_inductive_i: add_ind_def > 
26534  70 
inductive_flags > ((string * typ) * mixfix) list > 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

71 
(string * typ) list > ((bstring * Attrib.src list) * term) list > thm list > 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

72 
local_theory > inductive_result * local_theory 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

73 
val gen_add_inductive: add_ind_def > 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

74 
bool > bool > (string * string option * mixfix) list > 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

75 
(string * string option * mixfix) list > 
26336
a0e2b706ce73
renamed datatype thmref to Facts.ref, tuned interfaces;
wenzelm
parents:
26128
diff
changeset

76 
((bstring * Attrib.src list) * string) list > (Facts.ref * Attrib.src list) list > 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

77 
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 > 
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

79 
OuterParse.token list > (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 

6424  82 
structure InductivePackage: INDUCTIVE_PACKAGE = 
5094  83 
struct 
84 

9598  85 

10729  86 
(** theory context references **) 
87 

11991  88 
val inductive_forall_name = "HOL.induct_forall"; 
89 
val inductive_forall_def = thm "induct_forall_def"; 

90 
val inductive_conj_name = "HOL.induct_conj"; 

91 
val inductive_conj_def = thm "induct_conj_def"; 

92 
val inductive_conj = thms "induct_conj"; 

93 
val inductive_atomize = thms "induct_atomize"; 

18463  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); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

99 
val simp_thms' = map (fn s => mk_meta_eq (the (find_first 
22675
acf10be7dcca
cleaned/simplified Sign.read_typ, Thm.read_cterm etc.;
wenzelm
parents:
22667
diff
changeset

100 
(equal (Sign.read_prop HOL.thy s) o prop_of) simp_thms))) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

101 
["(~True) = False", "(~False) = True", 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

102 
"(True > ?P) = ?P", "(False > ?P) = True", 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

103 
"(?P & True) = ?P", "(True & ?P) = ?P"]; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

104 

10729  105 

106 

22846  107 
(** context data **) 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

108 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

109 
type inductive_result = 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

110 
{preds: term list, elims: thm list, raw_induct: thm, 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

111 
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

112 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

113 
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

114 
let 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

115 
val term = Morphism.term phi; 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

116 
val thm = Morphism.thm phi; 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

117 
val fact = Morphism.fact phi; 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

118 
in 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

119 
{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

120 
induct = thm induct, intrs = fact intrs} 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

121 
end; 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

122 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

123 
type inductive_info = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

124 
{names: string list, coind: bool} * inductive_result; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

125 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

126 
structure InductiveData = GenericDataFun 
22846  127 
( 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

128 
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

129 
val empty = (Symtab.empty, []); 
16432  130 
val extend = I; 
131 
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

132 
(Symtab.merge (K true) (tab1, tab2), Thm.merge_thms (monos1, monos2)); 
22846  133 
); 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

134 

21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

135 
val get_inductives = InductiveData.get o Context.Proof; 
22846  136 

137 
fun print_inductives ctxt = 

138 
let 

139 
val (tab, monos) = get_inductives ctxt; 

140 
val space = Consts.space_of (ProofContext.consts_of ctxt); 

141 
in 

142 
[Pretty.strs ("(co)inductives:" :: map #1 (NameSpace.extern_table (space, tab))), 

143 
Pretty.big_list "monotonicity rules:" (map (ProofContext.pretty_thm ctxt) monos)] 

144 
> Pretty.chunks > Pretty.writeln 

145 
end; 

7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

146 

bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

147 

bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

148 
(* get and put data *) 
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

149 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

150 
fun the_inductive ctxt name = 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

151 
(case Symtab.lookup (#1 (get_inductives ctxt)) name of 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

152 
NONE => error ("Unknown (co)inductive predicate " ^ quote name) 
15531  153 
 SOME info => info); 
9598  154 

25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

155 
fun put_inductives names info = InductiveData.map 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

156 
(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

157 

8277  158 

7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

159 

bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

160 
(** monotonicity rules **) 
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

161 

21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

162 
val get_monos = #2 o get_inductives; 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

163 
val map_monos = InductiveData.map o apsnd; 
8277  164 

7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

165 
fun mk_mono thm = 
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

166 
let 
22275
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

167 
val concl = concl_of thm; 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

168 
fun eq2mono thm' = [thm' RS (thm' RS eq_to_mono)] @ 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

169 
(case concl of 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

170 
(_ $ (_ $ (Const ("Not", _) $ _) $ _)) => [] 
22275
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

171 
 _ => [thm' RS (thm' RS eq_to_mono2)]); 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

172 
fun dest_less_concl thm = dest_less_concl (thm RS le_funD) 
22846  173 
handle THM _ => thm RS le_boolD 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

174 
in 
22275
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

175 
case concl of 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

176 
Const ("==", _) $ _ $ _ => eq2mono (thm RS meta_eq_to_obj_eq) 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

177 
 _ $ (Const ("op =", _) $ _ $ _) => eq2mono thm 
23881  178 
 _ $ (Const ("HOL.ord_class.less_eq", _) $ _ $ _) => 
22275
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

179 
[dest_less_concl (Seq.hd (REPEAT (FIRSTGOAL 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

180 
(resolve_tac [le_funI, le_boolI'])) thm))] 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

181 
 _ => [thm] 
26928  182 
end handle THM _ => error ("Bad monotonicity theorem:\n" ^ Display.string_of_thm thm); 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

183 

24039
273698405054
renamed Drule.add/del/merge_rules to Thm.add/del/merge_thms;
wenzelm
parents:
23881
diff
changeset

184 
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

185 
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

186 

bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

187 

7107  188 

10735  189 
(** misc utilities **) 
6424  190 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

191 
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

192 
fun clean_message quiet_mode s = if ! quick_and_dirty then () else message quiet_mode s; 
5662  193 

6424  194 
fun coind_prefix true = "co" 
195 
 coind_prefix false = ""; 

196 

24133
75063f96618f
added int type constraints to accomodate hacked SML/NJ;
wenzelm
parents:
24039
diff
changeset

197 
fun log (b:int) m n = if m >= n then 0 else 1 + log b (b * m) n; 
6424  198 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

199 
fun make_bool_args f g [] i = [] 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

200 
 make_bool_args f g (x :: xs) i = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

201 
(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

202 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

203 
fun make_bool_args' xs = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

204 
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

205 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

206 
fun find_arg T x [] = sys_error "find_arg" 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

207 
 find_arg T x ((p as (_, (SOME _, _))) :: ps) = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

208 
apsnd (cons p) (find_arg T x ps) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

209 
 find_arg T x ((p as (U, (NONE, y))) :: ps) = 
23577  210 
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

211 
else apsnd (cons p) (find_arg T x ps); 
7020
75ff179df7b7
Exported function unify_consts (workaround to avoid inconsistently
berghofe
parents:
6851
diff
changeset

212 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

213 
fun make_args Ts xs = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

214 
map (fn (T, (NONE, ())) => Const ("arbitrary", T)  (_, (SOME t, ())) => t) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

215 
(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

216 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

217 
fun make_args' Ts xs Us = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

218 
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

219 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

220 
fun dest_predicate cs params t = 
5094  221 
let 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

222 
val k = length params; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

223 
val (c, ts) = strip_comb t; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

224 
val (xs, ys) = chop k ts; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

225 
val i = find_index_eq c cs; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

226 
in 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

227 
if xs = params andalso i >= 0 then 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

228 
SOME (c, i, ys, chop (length ys) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

229 
(List.drop (binder_types (fastype_of c), k))) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

230 
else NONE 
5094  231 
end; 
232 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

233 
fun mk_names a 0 = [] 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

234 
 mk_names a 1 = [a] 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

235 
 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

236 

6424  237 

238 

10729  239 
(** process rules **) 
240 

241 
local 

5094  242 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

243 
fun err_in_rule ctxt name t msg = 
16432  244 
error (cat_lines ["Illformed introduction rule " ^ quote name, 
24920  245 
Syntax.string_of_term ctxt t, msg]); 
10729  246 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

247 
fun err_in_prem ctxt name t p msg = 
24920  248 
error (cat_lines ["Illformed premise", Syntax.string_of_term ctxt p, 
249 
"in introduction rule " ^ quote name, Syntax.string_of_term ctxt t, msg]); 

5094  250 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

251 
val bad_concl = "Conclusion of introduction rule must be an inductive predicate"; 
10729  252 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

253 
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

254 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

255 
val bad_app = "Inductive predicate must be applied to parameter(s) "; 
11358
416ea5c009f5
now checks for leading metaquantifiers and complains, instead of
paulson
parents:
11036
diff
changeset

256 

16432  257 
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize []; 
10729  258 

259 
in 

5094  260 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

261 
fun check_rule ctxt cs params ((name, att), rule) = 
10729  262 
let 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

263 
val params' = Term.variant_frees rule (Logic.strip_params rule); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

264 
val frees = rev (map Free params'); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

265 
val concl = subst_bounds (frees, Logic.strip_assums_concl rule); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

266 
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

267 
val rule' = Logic.list_implies (prems, concl); 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

268 
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

269 
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

270 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

271 
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

272 
NONE => err (bad_app ^ 
24920  273 
commas (map (Syntax.string_of_term ctxt) params)) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

274 
 SOME (_, _, ys, _) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

275 
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

276 
then err bad_ind_occ else (); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

277 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

278 
fun check_prem' prem t = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

279 
if head_of t mem cs then 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

280 
check_ind (err_in_prem ctxt name rule prem) t 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

281 
else (case t of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

282 
Abs (_, _, t) => check_prem' prem t 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

283 
 t $ u => (check_prem' prem t; check_prem' prem u) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

284 
 _ => ()); 
5094  285 

10729  286 
fun check_prem (prem, aprem) = 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

287 
if can HOLogic.dest_Trueprop aprem then check_prem' prem prem 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

288 
else err_in_prem ctxt name rule prem "Nonatomic premise"; 
10729  289 
in 
11358
416ea5c009f5
now checks for leading metaquantifiers and complains, instead of
paulson
parents:
11036
diff
changeset

290 
(case concl of 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

291 
Const ("Trueprop", _) $ t => 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

292 
if head_of t mem cs then 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

293 
(check_ind (err_in_rule ctxt name rule') t; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

294 
List.app check_prem (prems ~~ aprems)) 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

295 
else err_in_rule ctxt name rule' bad_concl 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

296 
 _ => err_in_rule ctxt name rule' bad_concl); 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

297 
((name, att), arule) 
10729  298 
end; 
5094  299 

24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

300 
val rulify = 
18222  301 
hol_simplify inductive_conj 
18463  302 
#> hol_simplify inductive_rulify 
303 
#> hol_simplify inductive_rulify_fallback 

24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

304 
#> MetaSimplifier.norm_hhf; 
10729  305 

306 
end; 

307 

5094  308 

6424  309 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

310 
(** proofs for (co)inductive predicates **) 
6424  311 

26534  312 
(* prove monotonicity *) 
5094  313 

26534  314 
fun prove_mono quiet_mode skip_mono predT fp_fun monos ctxt = 
315 
(message (quiet_mode orelse skip_mono andalso !quick_and_dirty) 

316 
" Proving monotonicity ..."; 

317 
(if skip_mono then SkipProof.prove else Goal.prove) ctxt [] [] 

17985  318 
(HOLogic.mk_Trueprop 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

319 
(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

320 
(fn _ => EVERY [rtac @{thm monoI} 1, 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

321 
REPEAT (resolve_tac [le_funI, le_boolI'] 1), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

322 
REPEAT (FIRST 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

323 
[atac 1, 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

324 
resolve_tac (List.concat (map mk_mono monos) @ get_monos ctxt) 1, 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

325 
etac le_funE 1, dtac le_boolD 1])])); 
5094  326 

6424  327 

10735  328 
(* prove introduction rules *) 
5094  329 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

330 
fun prove_intrs quiet_mode coind mono fp_def k params intr_ts rec_preds_defs ctxt = 
5094  331 
let 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

332 
val _ = clean_message quiet_mode " Proving the introduction rules ..."; 
5094  333 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

334 
val unfold = funpow k (fn th => th RS fun_cong) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

335 
(mono RS (fp_def RS 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

336 
(if coind then def_gfp_unfold else def_lfp_unfold))); 
5094  337 

338 
fun select_disj 1 1 = [] 

339 
 select_disj _ 1 = [rtac disjI1] 

340 
 select_disj n i = (rtac disjI2)::(select_disj (n  1) (i  1)); 

341 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

342 
val rules = [refl, TrueI, notFalseI, exI, conjI]; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

343 

22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

344 
val intrs = map_index (fn (i, intr) => rulify 
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

345 
(SkipProof.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

346 
[rewrite_goals_tac rec_preds_defs, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

347 
rtac (unfold RS iffD2) 1, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

348 
EVERY1 (select_disj (length intr_ts) (i + 1)), 
17985  349 
(*Not ares_tac, since refl must be tried before any equality assumptions; 
350 
backtracking may occur if the premises have extra variables!*) 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

351 
DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)]))) intr_ts 
5094  352 

353 
in (intrs, unfold) end; 

354 

6424  355 

10735  356 
(* prove elimination rules *) 
5094  357 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

358 
fun prove_elims quiet_mode cs params intr_ts intr_names unfold rec_preds_defs ctxt = 
5094  359 
let 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

360 
val _ = clean_message quiet_mode " Proving the elimination rules ..."; 
5094  361 

22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

362 
val ([pname], ctxt') = ctxt > 
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

363 
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

364 
Variable.variant_fixes ["P"]; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

365 
val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT)); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

366 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

367 
fun dest_intr r = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

368 
(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

369 
Logic.strip_assums_hyp r, Logic.strip_params r); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

370 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

371 
val intrs = map dest_intr intr_ts ~~ intr_names; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

372 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

373 
val rules1 = [disjE, exE, FalseE]; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

374 
val rules2 = [conjE, FalseE, notTrueE]; 
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 prove_elim c = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

377 
let 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

378 
val Ts = List.drop (binder_types (fastype_of c), length params); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

379 
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

380 
val frees = map Free (anames ~~ Ts); 
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 
fun mk_elim_prem ((_, _, us, _), ts, params') = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

383 
list_all (params', 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

384 
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

385 
(frees ~~ us) @ ts, P)); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

386 
val c_intrs = (List.filter (equal c o #1 o #1 o #1) intrs); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

387 
val prems = HOLogic.mk_Trueprop (list_comb (c, params @ frees)) :: 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

388 
map mk_elim_prem (map #1 c_intrs) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

389 
in 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

390 
(SkipProof.prove ctxt'' [] prems P 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

391 
(fn {prems, ...} => EVERY 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

392 
[cut_facts_tac [hd prems] 1, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

393 
rewrite_goals_tac rec_preds_defs, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

394 
dtac (unfold RS iffD1) 1, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

395 
REPEAT (FIRSTGOAL (eresolve_tac rules1)), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

396 
REPEAT (FIRSTGOAL (eresolve_tac rules2)), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

397 
EVERY (map (fn prem => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

398 
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

399 
> rulify 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

400 
> singleton (ProofContext.export ctxt'' ctxt), 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

401 
map #2 c_intrs) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

402 
end 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

403 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

404 
in map prove_elim cs end; 
5094  405 

6424  406 

10735  407 
(* derivation of simplified elimination rules *) 
5094  408 

11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

409 
local 
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

410 

d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

411 
(*delete needless equality assumptions*) 
25365  412 
val refl_thin = Goal.prove_global HOL.thy [] [] @{prop "!!P. a = a ==> P ==> P"} 
22838  413 
(fn _ => assume_tac 1); 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

414 
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

415 
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

416 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

417 
fun simp_case_tac ss i = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

418 
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

419 

11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

420 
in 
9598  421 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

422 
fun mk_cases ctxt prop = 
7107  423 
let 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

424 
val thy = ProofContext.theory_of ctxt; 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

425 
val ss = Simplifier.local_simpset_of ctxt; 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

426 

21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

427 
fun err msg = 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

428 
error (Pretty.string_of (Pretty.block 
24920  429 
[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

430 

24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset

431 
val elims = Induct.find_casesP ctxt prop; 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

432 

7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

433 
val cprop = Thm.cterm_of thy prop; 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

434 
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

435 
fun mk_elim rl = 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

436 
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

437 
> singleton (Variable.export (Variable.auto_fixes prop ctxt) ctxt); 
7107  438 
in 
439 
(case get_first (try mk_elim) elims of 

15531  440 
SOME r => r 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

441 
 NONE => err "Proposition not an inductive predicate:") 
7107  442 
end; 
443 

11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

444 
end; 
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

445 

7107  446 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

447 
(* inductive_cases *) 
7107  448 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

449 
fun gen_inductive_cases prep_att prep_prop args lthy = 
9598  450 
let 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

451 
val thy = ProofContext.theory_of lthy; 
12876
a70df1e5bf10
got rid of explicit marginal comments (now stripped earlier from input);
wenzelm
parents:
12798
diff
changeset

452 
val facts = args > map (fn ((a, atts), props) => 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

453 
((a, map (prep_att thy) atts), 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

454 
map (Thm.no_attributes o single o mk_cases lthy o prep_prop lthy) props)); 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

455 
in lthy > LocalTheory.notes Thm.theoremK facts >> map snd end; 
5094  456 

24509
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24133
diff
changeset

457 
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

458 
val inductive_cases_i = gen_inductive_cases (K I) Syntax.check_prop; 
7107  459 

6424  460 

22275
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

461 
fun ind_cases src = Method.syntax (Scan.lift (Scan.repeat1 Args.name  
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

462 
Scan.optional (Args.$$$ "for"  Scan.repeat1 Args.name) [])) src 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

463 
#> (fn ((raw_props, fixes), ctxt) => 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

464 
let 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

465 
val (_, ctxt') = Variable.add_fixes fixes ctxt; 
24509
23ee6b7788c2
replaced ProofContext.read_term/prop by general Syntax.read_term/prop;
wenzelm
parents:
24133
diff
changeset

466 
val props = Syntax.read_props ctxt' raw_props; 
22275
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

467 
val ctxt'' = fold Variable.declare_term props ctxt'; 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

468 
val rules = ProofContext.export ctxt'' ctxt (map (mk_cases ctxt'') props) 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

469 
in Method.erule 0 rules end); 
9598  470 

471 

472 

10735  473 
(* prove induction rule *) 
5094  474 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

475 
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

476 
fp_def rec_preds_defs ctxt = 
5094  477 
let 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

478 
val _ = clean_message quiet_mode " Proving the induction rule ..."; 
20047  479 
val thy = ProofContext.theory_of ctxt; 
5094  480 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

481 
(* predicates for induction rule *) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

482 

22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

483 
val (pnames, ctxt') = ctxt > 
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

484 
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

485 
Variable.variant_fixes (mk_names "P" (length cs)); 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

486 
val preds = map Free (pnames ~~ 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

487 
map (fn c => List.drop (binder_types (fastype_of c), length params) > 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

488 
HOLogic.boolT) cs); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

489 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

490 
(* transform an introduction rule into a premise for induction rule *) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

491 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

492 
fun mk_ind_prem r = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

493 
let 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

494 
fun subst s = (case dest_predicate cs params s of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

495 
SOME (_, i, ys, (_, Ts)) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

496 
let 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

497 
val k = length Ts; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

498 
val bs = map Bound (k  1 downto 0); 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

499 
val P = list_comb (List.nth (preds, i), 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

500 
map (incr_boundvars k) ys @ bs); 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

501 
val Q = list_abs (mk_names "x" k ~~ Ts, 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

502 
HOLogic.mk_binop inductive_conj_name 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

503 
(list_comb (incr_boundvars k s, bs), P)) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

504 
in (Q, case Ts of [] => SOME (s, P)  _ => NONE) end 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

505 
 NONE => (case s of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

506 
(t $ u) => (fst (subst t) $ fst (subst u), NONE) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

507 
 (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

508 
 _ => (s, NONE))); 
7293  509 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

510 
fun mk_prem (s, prems) = (case subst s of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

511 
(_, SOME (t, u)) => t :: u :: prems 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

512 
 (t, _) => t :: prems); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

513 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

514 
val SOME (_, i, ys, _) = dest_predicate cs params 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

515 
(HOLogic.dest_Trueprop (Logic.strip_assums_concl r)) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

516 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

517 
in list_all_free (Logic.strip_params r, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

518 
Logic.list_implies (map HOLogic.mk_Trueprop (foldr mk_prem 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

519 
[] (map HOLogic.dest_Trueprop (Logic.strip_assums_hyp r))), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

520 
HOLogic.mk_Trueprop (list_comb (List.nth (preds, i), ys)))) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

521 
end; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

522 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

523 
val ind_prems = map mk_ind_prem intr_ts; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

524 

21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

525 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

526 
(* make conclusions for induction rules *) 
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 
val Tss = map (binder_types o fastype_of) preds; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

529 
val (xnames, ctxt'') = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

530 
Variable.variant_fixes (mk_names "x" (length (flat Tss))) ctxt'; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

531 
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

532 
(map (fn (((xnames, Ts), c), P) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

533 
let val frees = map Free (xnames ~~ Ts) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

534 
in HOLogic.mk_imp 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

535 
(list_comb (c, params @ frees), list_comb (P, frees)) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

536 
end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds))); 
5094  537 

13626
282fbabec862
Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents:
13197
diff
changeset

538 

5094  539 
(* make predicate for instantiation of abstract induction rule *) 
540 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

541 
val ind_pred = fold_rev lambda (bs @ xs) (foldr1 HOLogic.mk_conj 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

542 
(map_index (fn (i, P) => foldr HOLogic.mk_imp 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

543 
(list_comb (P, make_args' argTs xs (binder_types (fastype_of P)))) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

544 
(make_bool_args HOLogic.mk_not I bs i)) preds)); 
5094  545 

546 
val ind_concl = HOLogic.mk_Trueprop 

23881  547 
(HOLogic.mk_binrel "HOL.ord_class.less_eq" (rec_const, ind_pred)); 
5094  548 

13626
282fbabec862
Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents:
13197
diff
changeset

549 
val raw_fp_induct = (mono RS (fp_def RS def_lfp_induct)); 
282fbabec862
Fixed bug involving inductive definitions having equalities in the premises,
paulson
parents:
13197
diff
changeset

550 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

551 
val induct = SkipProof.prove ctxt'' [] ind_prems ind_concl 
20248  552 
(fn {prems, ...} => EVERY 
17985  553 
[rewrite_goals_tac [inductive_conj_def], 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

554 
DETERM (rtac raw_fp_induct 1), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

555 
REPEAT (resolve_tac [le_funI, le_boolI] 1), 
22460
b4f96f343d6c
inf_fun_eq and inf_bool_eq now with meta equality
haftmann
parents:
22422
diff
changeset

556 
rewrite_goals_tac (inf_fun_eq :: inf_bool_eq :: simp_thms'), 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

557 
(*This disjE separates out the introduction rules*) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

558 
REPEAT (FIRSTGOAL (eresolve_tac [disjE, exE, FalseE])), 
5094  559 
(*Now break down the individual cases. No disjE here in case 
560 
some premise involves disjunction.*) 

13747
bf308fcfd08e
Better treatment of equality in premises of inductive definitions. Less
paulson
parents:
13709
diff
changeset

561 
REPEAT (FIRSTGOAL (etac conjE ORELSE' bound_hyp_subst_tac)), 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

562 
REPEAT (FIRSTGOAL 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

563 
(resolve_tac [conjI, impI] ORELSE' (etac notE THEN' atac))), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

564 
EVERY (map (fn prem => DEPTH_SOLVE_1 (ares_tac [rewrite_rule 
22980
1226d861eefb
Fixed bug that caused proof of induction theorem to fail if
berghofe
parents:
22846
diff
changeset

565 
(inductive_conj_def :: rec_preds_defs @ simp_thms') prem, 
1226d861eefb
Fixed bug that caused proof of induction theorem to fail if
berghofe
parents:
22846
diff
changeset

566 
conjI, refl] 1)) prems)]); 
5094  567 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

568 
val lemma = SkipProof.prove ctxt'' [] [] 
17985  569 
(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

570 
[rewrite_goals_tac rec_preds_defs, 
5094  571 
REPEAT (EVERY 
572 
[REPEAT (resolve_tac [conjI, impI] 1), 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

573 
REPEAT (eresolve_tac [le_funE, le_boolE] 1), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

574 
atac 1, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

575 
rewrite_goals_tac simp_thms', 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

576 
atac 1])]) 
5094  577 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

578 
in singleton (ProofContext.export ctxt'' ctxt) (induct RS lemma) end; 
5094  579 

6424  580 

581 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

582 
(** specification of (co)inductive predicates **) 
10729  583 

26534  584 
fun mk_ind_def quiet_mode skip_mono alt_name coind cs intr_ts monos params cnames_syn ctxt = 
5094  585 
let 
24915  586 
val fp_name = if coind then @{const_name Inductive.gfp} else @{const_name Inductive.lfp}; 
5094  587 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

588 
val argTs = fold (fn c => fn Ts => Ts @ 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

589 
(List.drop (binder_types (fastype_of c), length params) \\ Ts)) cs []; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

590 
val k = log 2 1 (length cs); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

591 
val predT = replicate k HOLogic.boolT > argTs > HOLogic.boolT; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

592 
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

593 
(("p", predT) :: (mk_names "x" (length argTs) ~~ argTs))); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

594 
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

595 
(map (rpair HOLogic.boolT) (mk_names "b" k))); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

596 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

597 
fun subst t = (case dest_predicate cs params t of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

598 
SOME (_, i, ts, (Ts, Us)) => 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

599 
let 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

600 
val l = length Us; 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

601 
val zs = map Bound (l  1 downto 0) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

602 
in 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

603 
list_abs (map (pair "z") Us, list_comb (p, 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

604 
make_bool_args' bs i @ make_args argTs 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

605 
((map (incr_boundvars l) ts ~~ Ts) @ (zs ~~ Us)))) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

606 
end 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

607 
 NONE => (case t of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

608 
t1 $ t2 => subst t1 $ subst t2 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

609 
 Abs (x, T, u) => Abs (x, T, subst u) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

610 
 _ => t)); 
5149  611 

5094  612 
(* transform an introduction rule into a conjunction *) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

613 
(* [ p_i t; ... ] ==> p_j u *) 
5094  614 
(* is transformed into *) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

615 
(* b_j & x_j = u & p b_j t & ... *) 
5094  616 

617 
fun transform_rule r = 

618 
let 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

619 
val SOME (_, i, ts, (Ts, _)) = dest_predicate cs params 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

620 
(HOLogic.dest_Trueprop (Logic.strip_assums_concl r)); 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

621 
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

622 
map HOLogic.mk_eq (make_args' argTs xs Ts ~~ ts) @ 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

623 
map (subst o HOLogic.dest_Trueprop) 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

624 
(Logic.strip_assums_hyp r) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

625 
in foldr (fn ((x, T), P) => HOLogic.exists_const T $ (Abs (x, T, P))) 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

626 
(if null ps then HOLogic.true_const else foldr1 HOLogic.mk_conj ps) 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

627 
(Logic.strip_params r) 
5094  628 
end 
629 

630 
(* make a disjunction of all introduction rules *) 

631 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

632 
val fp_fun = fold_rev lambda (p :: bs @ xs) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

633 
(if null intr_ts then HOLogic.false_const 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

634 
else foldr1 HOLogic.mk_disj (map transform_rule intr_ts)); 
5094  635 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

636 
(* add definiton of recursive predicates to theory *) 
5094  637 

14235
281295a1bbaa
Fixed bug in mk_ind_def that caused the inductive definition package to
berghofe
parents:
13747
diff
changeset

638 
val rec_name = if alt_name = "" then 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

639 
space_implode "_" (map fst cnames_syn) else alt_name; 
5094  640 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

641 
val ((rec_const, (_, fp_def)), ctxt') = ctxt > 
26128  642 
LocalTheory.define Thm.internalK 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

643 
((rec_name, case cnames_syn of [(_, syn)] => syn  _ => NoSyn), 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

644 
(("", []), fold_rev lambda params 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

645 
(Const (fp_name, (predT > predT) > predT) $ fp_fun))); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

646 
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

647 
(cterm_of (ProofContext.theory_of ctxt') (list_comb (rec_const, params))); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

648 
val specs = if length cs < 2 then [] else 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

649 
map_index (fn (i, (name_mx, c)) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

650 
let 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

651 
val Ts = List.drop (binder_types (fastype_of c), length params); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

652 
val xs = map Free (Variable.variant_frees ctxt intr_ts 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

653 
(mk_names "x" (length Ts) ~~ Ts)) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

654 
in 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

655 
(name_mx, (("", []), fold_rev lambda (params @ xs) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

656 
(list_comb (rec_const, params @ make_bool_args' bs i @ 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

657 
make_args argTs (xs ~~ Ts))))) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

658 
end) (cnames_syn ~~ cs); 
26128  659 
val (consts_defs, ctxt'') = fold_map (LocalTheory.define Thm.internalK) specs ctxt'; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

660 
val preds = (case cs of [_] => [rec_const]  _ => map #1 consts_defs); 
5094  661 

26534  662 
val mono = prove_mono quiet_mode skip_mono predT fp_fun monos ctxt'' 
5094  663 

21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

664 
in (ctxt'', rec_name, mono, fp_def', map (#2 o #2) consts_defs, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

665 
list_comb (rec_const, params), preds, argTs, bs, xs) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

666 
end; 
5094  667 

26128  668 
fun declare_rules kind rec_name coind no_ind cnames intrs intr_names intr_atts 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

669 
elims raw_induct ctxt = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

670 
let 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

671 
val ind_case_names = RuleCases.case_names intr_names; 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

672 
val induct = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

673 
if coind then 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

674 
(raw_induct, [RuleCases.case_names [rec_name], 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

675 
RuleCases.case_conclusion (rec_name, intr_names), 
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset

676 
RuleCases.consumes 1, Induct.coinduct_pred (hd cnames)]) 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

677 
else if no_ind orelse length cnames > 1 then 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

678 
(raw_induct, [ind_case_names, RuleCases.consumes 0]) 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

679 
else (raw_induct RSN (2, rev_mp), [ind_case_names, RuleCases.consumes 1]); 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

680 

24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

681 
val (intrs', ctxt1) = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

682 
ctxt > 
26128  683 
LocalTheory.notes kind 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

684 
(map (NameSpace.qualified rec_name) intr_names ~~ 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

685 
intr_atts ~~ map (fn th => [([th], 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

686 
[Attrib.internal (K (ContextRules.intro_query NONE))])]) intrs) >> 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

687 
map (hd o snd); 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

688 
val (((_, elims'), (_, [induct'])), ctxt2) = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

689 
ctxt1 > 
26128  690 
LocalTheory.note kind ((NameSpace.qualified rec_name "intros", []), intrs') >> 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

691 
fold_map (fn (name, (elim, cases)) => 
26128  692 
LocalTheory.note kind ((NameSpace.qualified (Sign.base_name name) "cases", 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

693 
[Attrib.internal (K (RuleCases.case_names cases)), 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

694 
Attrib.internal (K (RuleCases.consumes 1)), 
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset

695 
Attrib.internal (K (Induct.cases_pred name)), 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

696 
Attrib.internal (K (ContextRules.elim_query NONE))]), [elim]) #> 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

697 
apfst (hd o snd)) (if null elims then [] else cnames ~~ elims) >> 
26128  698 
LocalTheory.note kind ((NameSpace.qualified rec_name (coind_prefix coind ^ "induct"), 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

699 
map (Attrib.internal o K) (#2 induct)), [rulify (#1 induct)]); 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

700 

24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

701 
val ctxt3 = if no_ind orelse coind then ctxt2 else 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

702 
let val inducts = cnames ~~ ProjectRule.projects ctxt2 (1 upto length cnames) induct' 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

703 
in 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

704 
ctxt2 > 
26128  705 
LocalTheory.notes kind [((NameSpace.qualified rec_name "inducts", []), 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

706 
inducts > map (fn (name, th) => ([th], 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

707 
[Attrib.internal (K ind_case_names), 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

708 
Attrib.internal (K (RuleCases.consumes 1)), 
24861
cc669ca5f382
tuned Induct interface: prefer pred'' over set'';
wenzelm
parents:
24830
diff
changeset

709 
Attrib.internal (K (Induct.induct_pred name))])))] > snd 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

710 
end 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

711 
in (intrs', elims', induct', ctxt3) end; 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

712 

26534  713 
type inductive_flags = 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

714 
{quiet_mode: bool, verbose: bool, kind: string, alt_name: bstring, 
26534  715 
coind: bool, no_elim: bool, no_ind: bool, skip_mono: bool} 
716 

717 
type add_ind_def = 

718 
inductive_flags > 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

719 
term list > ((string * Attrib.src list) * term) list > thm list > 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

720 
term list > (string * mixfix) list > 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

721 
local_theory > inductive_result * local_theory 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

722 

26534  723 
fun add_ind_def {quiet_mode, verbose, kind, alt_name, coind, no_elim, no_ind, skip_mono} 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

724 
cs intros monos params cnames_syn ctxt = 
9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset

725 
let 
25288  726 
val _ = null cnames_syn andalso error "No inductive predicates given"; 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

727 
val _ = message (quiet_mode andalso not verbose) 
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

728 
("Proofs for " ^ coind_prefix coind ^ "inductive predicate(s) " ^ 
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

729 
commas_quote (map fst cnames_syn)); 
9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset

730 

21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

731 
val cnames = map (Sign.full_name (ProofContext.theory_of ctxt) o #1) cnames_syn; (* FIXME *) 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

732 
val ((intr_names, intr_atts), intr_ts) = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

733 
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

734 

63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

735 
val (ctxt1, rec_name, mono, fp_def, rec_preds_defs, rec_const, preds, 
26534  736 
argTs, bs, xs) = mk_ind_def quiet_mode skip_mono alt_name coind cs intr_ts 
737 
monos params cnames_syn ctxt; 

9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset

738 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

739 
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

740 
params intr_ts rec_preds_defs ctxt1; 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

741 
val elims = if no_elim then [] else 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

742 
prove_elims quiet_mode cs params intr_ts intr_names unfold rec_preds_defs ctxt1; 
22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

743 
val raw_induct = zero_var_indexes 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

744 
(if no_ind then Drule.asm_rl else 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

745 
if coind then 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

746 
singleton (ProofContext.export 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

747 
(snd (Variable.add_fixes (map (fst o dest_Free) params) ctxt1)) ctxt1) 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

748 
(rotate_prems ~1 (ObjectLogic.rulify (rule_by_tactic 
25510  749 
(rewrite_tac [le_fun_def, le_bool_def, sup_fun_eq, sup_bool_eq] THEN 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

750 
fold_tac rec_preds_defs) (mono RS (fp_def RS def_coinduct))))) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

751 
else 
26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

752 
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

753 
rec_preds_defs ctxt1); 
5094  754 

26128  755 
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

756 
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

757 

21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

758 
val names = map #1 cnames_syn; 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

759 
val result = 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

760 
{preds = preds, 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

761 
intrs = intrs', 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

762 
elims = elims', 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

763 
raw_induct = rulify raw_induct, 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

764 
induct = induct}; 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

765 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

766 
val ctxt3 = ctxt2 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

767 
> LocalTheory.declaration (fn phi => 
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

768 
let val result' = morph_result phi result; 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

769 
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

770 
in (result, ctxt3) end; 
5094  771 

6424  772 

10735  773 
(* external interfaces *) 
5094  774 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

775 
fun gen_add_inductive_i mk_def 
26534  776 
(flags as {quiet_mode, verbose, kind, alt_name, coind, no_elim, no_ind, skip_mono}) 
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

777 
cnames_syn pnames spec monos lthy = 
5094  778 
let 
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

779 
val thy = ProofContext.theory_of lthy; 
6424  780 
val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions"); 
5094  781 

21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

782 

25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

783 
(* abbrevs *) 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

784 

3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

785 
val (_, ctxt1) = Variable.add_fixes (map (fst o fst) cnames_syn) lthy; 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

786 

25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

787 
fun get_abbrev ((name, atts), t) = 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

788 
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

789 
let 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

790 
val _ = name = "" andalso null atts orelse 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

791 
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

792 
val ((x, T), rhs) = LocalDefs.abs_def (snd (LocalDefs.cert_def ctxt1 t)); 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

793 
val mx = 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

794 
(case find_first (fn ((c, _), _) => c = x) cnames_syn of 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

795 
NONE => error ("Undeclared head of abbreviation " ^ quote x) 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

796 
 SOME ((_, T'), mx) => 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

797 
if T <> T' then error ("Bad type specification for abbreviation " ^ quote x) 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

798 
else mx); 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

799 
in SOME ((x, mx), rhs) end 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

800 
else NONE; 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

801 

25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

802 
val abbrevs = map_filter get_abbrev spec; 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

803 
val bs = map (fst o fst) abbrevs; 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

804 

21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

805 

25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

806 
(* predicates *) 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

807 

25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

808 
val pre_intros = filter_out (is_some o get_abbrev) spec; 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

809 
val cnames_syn' = filter_out (member (op =) bs o fst o fst) cnames_syn; 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

810 
val cs = map (Free o fst) cnames_syn'; 
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

811 
val ps = map Free pnames; 
5094  812 

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

813 
val (_, ctxt2) = lthy > Variable.add_fixes (map (fst o fst) cnames_syn'); 
2a1acc88a180
abbrevs within inductive definitions may no longer depend on each other (reflects in internal organization, particularly for output);
wenzelm
parents:
25114
diff
changeset

814 
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

815 
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

816 
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

817 

3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

818 
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

819 
(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

820 
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

821 
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

822 
 _ => I) r []), r); 
5094  823 

26736
e6091328718f
added explicit check phase after reading of specification
haftmann
parents:
26534
diff
changeset

824 
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

825 
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

826 
in 
25029
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

827 
lthy 
3a72718c5ddd
gen_add_inductive_i: treat abbrevs as local defs, expand by export;
wenzelm
parents:
25016
diff
changeset

828 
> 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

829 
> fold (snd oo LocalTheory.abbrev Syntax.mode_default) abbrevs 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

830 
end; 
5094  831 

24721  832 
fun gen_add_inductive mk_def verbose coind cnames_syn pnames_syn intro_srcs raw_monos lthy = 
5094  833 
let 
25114
7aa178165ee4
add_inductive: more careful handling of abbrevs  do not expand prematurely;
wenzelm
parents:
25035
diff
changeset

834 
val ((vars, specs), _) = lthy > ProofContext.set_mode ProofContext.mode_abbrev 
7aa178165ee4
add_inductive: more careful handling of abbrevs  do not expand prematurely;
wenzelm
parents:
25035
diff
changeset

835 
> Specification.read_specification 
7aa178165ee4
add_inductive: more careful handling of abbrevs  do not expand prematurely;
wenzelm
parents:
25035
diff
changeset

836 
(cnames_syn @ pnames_syn) (map (fn (a, s) => [(a, [s])]) intro_srcs); 
24721  837 
val (cs, ps) = chop (length cnames_syn) vars; 
838 
val intrs = map (apsnd the_single) specs; 

839 
val monos = Attrib.eval_thms lthy raw_monos; 

26477
ecf06644f6cb
eliminated quiete_mode ref (turned into proper argument);
wenzelm
parents:
26336
diff
changeset

840 
val flags = {quiet_mode = false, verbose = verbose, kind = Thm.theoremK, alt_name = "", 
26534  841 
coind = coind, no_elim = false, no_ind = false, skip_mono = false}; 
26128  842 
in 
843 
lthy 

844 
> LocalTheory.set_group (serial_string ()) 

845 
> gen_add_inductive_i mk_def flags cs (map fst ps) intrs monos 

846 
end; 

5094  847 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

848 
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

849 
val add_inductive = gen_add_inductive add_ind_def; 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

850 

26128  851 
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

852 
let 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

853 
val name = Sign.full_name thy (fst (fst (hd cnames_syn))); 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

854 
val ctxt' = thy 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

855 
> TheoryTarget.init NONE 
26128  856 
> LocalTheory.set_group group 
25380
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

857 
> add_inductive_i flags cnames_syn pnames pre_intros monos > snd 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

858 
> LocalTheory.exit; 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

859 
val info = #2 (the_inductive ctxt' name); 
03201004c77e
put_inductives: be permissive about multiple versions
wenzelm
parents:
25365
diff
changeset

860 
in (info, ProofContext.theory_of ctxt') end; 
6424  861 

862 

22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

863 
(* 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

864 
fun arities_of induct = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

865 
map (fn (_ $ t $ u) => 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

866 
(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

867 
(HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct))); 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

868 

4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

869 
(* 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

870 
fun params_of induct = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

871 
let 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

872 
val (_ $ t $ u :: _) = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

873 
HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of induct)); 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

874 
val (_, ts) = strip_comb t; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

875 
val (_, us) = strip_comb u 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

876 
in 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

877 
List.take (ts, length ts  length us) 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

878 
end; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

879 

4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

880 
val pname_of_intr = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

881 
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

882 

4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

883 
(* partition introduction rules according to predicate name *) 
25822  884 
fun gen_partition_rules f induct intros = 
885 
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

886 
(map (rpair [] o fst) (arities_of induct)); 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

887 

25822  888 
val partition_rules = gen_partition_rules I; 
889 
fun partition_rules' induct = gen_partition_rules fst induct; 

890 

22789
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

891 
fun unpartition_rules intros xs = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

892 
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

893 
(fn x :: xs => (x, xs)) #>> the) intros xs > fst; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

894 

4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

895 
(* 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

896 
fun infer_intro_vars elim arity intros = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

897 
let 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

898 
val thy = theory_of_thm elim; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

899 
val _ :: cases = prems_of elim; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

900 
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

901 
fun mtch (t, u) = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

902 
let 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

903 
val params = Logic.strip_params t; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

904 
val vars = map (Var o apfst (rpair 0)) 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

905 
(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

906 
val ts = map (curry subst_bounds (rev vars)) 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

907 
(List.drop (Logic.strip_assums_hyp t, arity)); 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

908 
val us = Logic.strip_imp_prems u; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

909 
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

910 
(Vartab.empty, Vartab.empty); 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

911 
in 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

912 
map (Envir.subst_vars tab) vars 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

913 
end 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

914 
in 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

915 
map (mtch o apsnd prop_of) (cases ~~ intros) 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

916 
end; 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

917 

4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

918 

25978  919 

6437  920 
(** package setup **) 
921 

922 
(* setup theory *) 

923 

8634  924 
val setup = 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

925 
Method.add_methods [("ind_cases", ind_cases, 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

926 
"dynamic case analysis on predicates")] #> 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

927 
Attrib.add_attributes [("mono", Attrib.add_del_args mono_add mono_del, 
18728  928 
"declaration of monotonicity rule")]; 
6437  929 

930 

931 
(* outer syntax *) 

6424  932 

17057  933 
local structure P = OuterParse and K = OuterKeyword in 
6424  934 

24867  935 
val _ = OuterSyntax.keywords ["monos"]; 
936 

21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

937 
fun flatten_specification specs = specs > maps 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

938 
(fn (a, (concl, [])) => concl > map 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

939 
(fn ((b, atts), [B]) => 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

940 
if a = "" then ((b, atts), B) 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

941 
else if b = "" then ((a, atts), B) 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

942 
else error ("Illegal nested case names " ^ quote (NameSpace.append a b)) 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

943 
 ((b, _), _) => error ("Illegal simultaneous specification " ^ quote b)) 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

944 
 (a, _) => error ("Illegal local specification parameters for " ^ quote a)); 
6424  945 

23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

946 
fun gen_ind_decl mk_def coind = 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

947 
P.fixes  P.for_fixes  
22102  948 
Scan.optional (P.$$$ "where"  P.!!! SpecParse.specification) []  
949 
Scan.optional (P.$$$ "monos"  P.!!! SpecParse.xthms1) [] 

26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

950 
>> (fn (((preds, params), specs), monos) => 
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

951 
(snd o gen_add_inductive mk_def true coind preds params (flatten_specification specs) monos)); 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

952 

24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

953 
val ind_decl = gen_ind_decl add_ind_def; 
6424  954 

26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

955 
val _ = OuterSyntax.local_theory "inductive" "define inductive predicates" K.thy_decl (ind_decl false); 
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

956 
val _ = OuterSyntax.local_theory "coinductive" "define coinductive predicates" K.thy_decl (ind_decl true); 
6723  957 

24867  958 
val _ = 
26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

959 
OuterSyntax.local_theory "inductive_cases" 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

960 
"create simplified instances of elimination rules (improper)" K.thy_script 
26988
742e26213212
more uniform treatment of OuterSyntax.local_theory commands;
wenzelm
parents:
26928
diff
changeset

961 
(P.and_list1 SpecParse.spec >> (fn specs => snd o inductive_cases specs)); 
7107  962 

5094  963 
end; 
6424  964 

965 
end; 