author  wenzelm 
Sat, 06 Oct 2007 16:50:04 +0200  
changeset 24867  e5b55d7be9bb 
parent 24861  cc669ca5f382 
child 24915  fc90277c0dd7 
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 
6424  24 
val quiet_mode: bool ref 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

41 
val add_inductive_i: 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

42 
{verbose: bool, kind: string, alt_name: bstring, coind: bool, no_elim: bool, no_ind: bool} > 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

43 
((string * typ) * mixfix) list > 
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

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

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

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

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

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

49 
local_theory > inductive_result * local_theory 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

50 
val add_inductive_global: 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

51 
{verbose: bool, kind: string, alt_name: bstring, coind: bool, no_elim: bool, no_ind: bool} > 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

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

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

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

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

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

57 
val unpartition_rules: thm list > (string * 'a list) list > 'a list 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

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

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

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

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

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

65 
type add_ind_def 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

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

67 
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

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

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

70 
val gen_add_inductive_i: add_ind_def > 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

71 
{verbose: bool, kind: string, alt_name: bstring, coind: bool, no_elim: bool, no_ind: bool} > 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

72 
((string * typ) * mixfix) list > 
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

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

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

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

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

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

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

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

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

81 
bool > OuterParse.token list > 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

82 
(Toplevel.transition > Toplevel.transition) * OuterParse.token list 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

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

84 

6424  85 
structure InductivePackage: INDUCTIVE_PACKAGE = 
5094  86 
struct 
87 

9598  88 

10729  89 
(** theory context references **) 
90 

11991  91 
val inductive_forall_name = "HOL.induct_forall"; 
92 
val inductive_forall_def = thm "induct_forall_def"; 

93 
val inductive_conj_name = "HOL.induct_conj"; 

94 
val inductive_conj_def = thm "induct_conj_def"; 

95 
val inductive_conj = thms "induct_conj"; 

96 
val inductive_atomize = thms "induct_atomize"; 

18463  97 
val inductive_rulify = thms "induct_rulify"; 
98 
val inductive_rulify_fallback = thms "induct_rulify_fallback"; 

10729  99 

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

100 
val notTrueE = TrueI RSN (2, notE); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

101 
val notFalseI = Seq.hd (atac 1 notI); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

102 
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

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

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

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

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

107 

10729  108 

109 

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

111 

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

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

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

114 
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

115 

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

116 
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

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

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

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

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

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

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

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

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

125 

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

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

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

128 

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

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

131 
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

132 
val empty = (Symtab.empty, []); 
16432  133 
val extend = I; 
134 
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

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

137 

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

138 
val get_inductives = InductiveData.get o Context.Proof; 
22846  139 

140 
fun print_inductives ctxt = 

141 
let 

142 
val (tab, monos) = get_inductives ctxt; 

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

144 
in 

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

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

147 
> Pretty.chunks > Pretty.writeln 

148 
end; 

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

149 

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

150 

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

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

152 

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

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

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

155 
NONE => error ("Unknown (co)inductive predicate " ^ quote name) 
15531  156 
 SOME info => info); 
9598  157 

18222  158 
fun put_inductives names info = InductiveData.map (apfst (fn tab => 
159 
fold (fn name => Symtab.update_new (name, info)) names tab 

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

160 
handle Symtab.DUP d => error ("Duplicate definition of (co)inductive predicate " ^ quote d))); 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

161 

8277  162 

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

163 

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

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

165 

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

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

167 
val map_monos = InductiveData.map o apsnd; 
8277  168 

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

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

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

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

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

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

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

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

176 
fun dest_less_concl thm = dest_less_concl (thm RS le_funD) 
22846  177 
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

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

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

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

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

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

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

185 
 _ => [thm] 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

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

187 

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

188 
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

189 
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

190 

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

191 

7107  192 

10735  193 
(** misc utilities **) 
6424  194 

5662  195 
val quiet_mode = ref false; 
10735  196 
fun message s = if ! quiet_mode then () else writeln s; 
197 
fun clean_message s = if ! quick_and_dirty then () else message s; 

5662  198 

6424  199 
fun coind_prefix true = "co" 
200 
 coind_prefix false = ""; 

201 

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

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

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

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

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

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

207 

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

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

209 
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

210 

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

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

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

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

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

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

217 

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

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

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

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

221 

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

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

223 
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

224 

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

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

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

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

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

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

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

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

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

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

235 
else NONE 
5094  236 
end; 
237 

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

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

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

240 
 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

241 

6424  242 

243 

10729  244 
(** process rules **) 
245 

246 
local 

5094  247 

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

248 
fun err_in_rule ctxt name t msg = 
16432  249 
error (cat_lines ["Illformed introduction rule " ^ quote name, 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

250 
ProofContext.string_of_term ctxt t, msg]); 
10729  251 

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

252 
fun err_in_prem ctxt name t p msg = 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

253 
error (cat_lines ["Illformed premise", ProofContext.string_of_term ctxt p, 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

254 
"in introduction rule " ^ quote name, ProofContext.string_of_term ctxt t, msg]); 
5094  255 

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

256 
val bad_concl = "Conclusion of introduction rule must be an inductive predicate"; 
10729  257 

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

258 
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

259 

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

260 
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

261 

16432  262 
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize []; 
10729  263 

264 
in 

5094  265 

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

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

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

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

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

271 
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

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

273 
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

274 
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

275 

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

276 
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

277 
NONE => err (bad_app ^ 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

278 
commas (map (ProofContext.string_of_term ctxt) params)) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

280 
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

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

282 

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

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

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

285 
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

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

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

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

289 
 _ => ()); 
5094  290 

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

292 
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

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

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

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

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

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

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

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

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

302 
((name, att), arule) 
10729  303 
end; 
5094  304 

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

305 
val rulify = 
18222  306 
hol_simplify inductive_conj 
18463  307 
#> hol_simplify inductive_rulify 
308 
#> hol_simplify inductive_rulify_fallback 

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

309 
#> MetaSimplifier.norm_hhf; 
10729  310 

311 
end; 

312 

5094  313 

6424  314 

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

315 
(** proofs for (co)inductive predicates **) 
6424  316 

10735  317 
(* prove monotonicity  NOT subject to quick_and_dirty! *) 
5094  318 

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

319 
fun prove_mono predT fp_fun monos ctxt = 
10735  320 
(message " Proving monotonicity ..."; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

321 
Goal.prove ctxt [] [] (*NO quick_and_dirty here!*) 
17985  322 
(HOLogic.mk_Trueprop 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

323 
(Const (@{const_name Orderings.mono}, (predT > predT) > HOLogic.boolT) $ fp_fun)) 
17985  324 
(fn _ => EVERY [rtac monoI 1, 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

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

328 
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

329 
etac le_funE 1, dtac le_boolD 1])])); 
5094  330 

6424  331 

10735  332 
(* prove introduction rules *) 
5094  333 

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

334 
fun prove_intrs coind mono fp_def k params intr_ts rec_preds_defs ctxt = 
5094  335 
let 
10735  336 
val _ = clean_message " Proving the introduction rules ..."; 
5094  337 

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

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

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

340 
(if coind then def_gfp_unfold else def_lfp_unfold))); 
5094  341 

342 
fun select_disj 1 1 = [] 

343 
 select_disj _ 1 = [rtac disjI1] 

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

345 

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

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

347 

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

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

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

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

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

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

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

355 
DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)]))) intr_ts 
5094  356 

357 
in (intrs, unfold) end; 

358 

6424  359 

10735  360 
(* prove elimination rules *) 
5094  361 

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

362 
fun prove_elims cs params intr_ts intr_names unfold rec_preds_defs ctxt = 
5094  363 
let 
10735  364 
val _ = clean_message " Proving the elimination rules ..."; 
5094  365 

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

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

367 
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

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

369 
val P = HOLogic.mk_Trueprop (Free (pname, HOLogic.boolT)); 
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 
fun dest_intr r = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

374 

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

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

376 

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

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

378 
val rules2 = [conjE, FalseE, notTrueE]; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

379 

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

380 
fun prove_elim c = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

382 
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

383 
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

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

385 

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

386 
fun mk_elim_prem ((_, _, us, _), ts, params') = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

388 
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

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

390 
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

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

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

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

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

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

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

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

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

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

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

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

402 
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

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

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

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

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

407 

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

408 
in map prove_elim cs end; 
5094  409 

6424  410 

10735  411 
(* derivation of simplified elimination rules *) 
5094  412 

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

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

414 

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

415 
(*delete needless equality assumptions*) 
22838  416 
val refl_thin = Goal.prove_global HOL.thy [] [] 
417 
(Sign.read_prop HOL.thy "!!P. a = a ==> P ==> P") 

418 
(fn _ => assume_tac 1); 

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

419 
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

420 
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

421 

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

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

423 
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

424 

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

425 
in 
9598  426 

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

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

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

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

431 

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

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

433 
error (Pretty.string_of (Pretty.block 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

434 
[Pretty.str msg, Pretty.fbrk, ProofContext.pretty_term ctxt prop])); 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

435 

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

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

437 

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

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

439 
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

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

441 
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

442 
> singleton (Variable.export (Variable.auto_fixes prop ctxt) ctxt); 
7107  443 
in 
444 
(case get_first (try mk_elim) elims of 

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

446 
 NONE => err "Proposition not an inductive predicate:") 
7107  447 
end; 
448 

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

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

450 

7107  451 

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

452 
(* inductive_cases *) 
7107  453 

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

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

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

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

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

459 
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

460 
in lthy > LocalTheory.notes Thm.theoremK facts >> map snd end; 
5094  461 

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

462 
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

463 
val inductive_cases_i = gen_inductive_cases (K I) Syntax.check_prop; 
7107  464 

6424  465 

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

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

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

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

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

470 
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

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

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

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

474 
in Method.erule 0 rules end); 
9598  475 

476 

477 

10735  478 
(* prove induction rule *) 
5094  479 

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

480 
fun prove_indrule cs argTs bs xs rec_const params intr_ts mono 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

481 
fp_def rec_preds_defs ctxt = 
5094  482 
let 
10735  483 
val _ = clean_message " Proving the induction rule ..."; 
20047  484 
val thy = ProofContext.theory_of ctxt; 
5094  485 

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

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

487 

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

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

489 
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

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

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

492 
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

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

494 

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

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

496 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

513 
 _ => (s, NONE))); 
7293  514 

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

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

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

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

518 

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

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

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

521 

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

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

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

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

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

526 
end; 
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 ind_prems = map mk_ind_prem intr_ts; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

529 

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

530 

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

531 
(* make conclusions for induction rules *) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

532 

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

533 
val Tss = map (binder_types o fastype_of) preds; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

536 
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

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

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

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

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

541 
end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds))); 
5094  542 

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

543 

5094  544 
(* make predicate for instantiation of abstract induction rule *) 
545 

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

546 
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

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

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

549 
(make_bool_args HOLogic.mk_not I bs i)) preds)); 
5094  550 

551 
val ind_concl = HOLogic.mk_Trueprop 

23881  552 
(HOLogic.mk_binrel "HOL.ord_class.less_eq" (rec_const, ind_pred)); 
5094  553 

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

554 
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

555 

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

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

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

560 
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

561 
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

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

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

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

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

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

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

569 
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

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

571 
conjI, refl] 1)) prems)]); 
5094  572 

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

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

575 
[rewrite_goals_tac rec_preds_defs, 
5094  576 
REPEAT (EVERY 
577 
[REPEAT (resolve_tac [conjI, impI] 1), 

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

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

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

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

581 
atac 1])]) 
5094  582 

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

583 
in singleton (ProofContext.export ctxt'' ctxt) (induct RS lemma) end; 
5094  584 

6424  585 

586 

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

587 
(** specification of (co)inductive predicates **) 
10729  588 

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

589 
fun mk_ind_def alt_name coind cs intr_ts monos 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

590 
params cnames_syn ctxt = 
5094  591 
let 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

592 
val fp_name = if coind then @{const_name FixedPoint.gfp} else @{const_name FixedPoint.lfp}; 
5094  593 

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

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

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

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

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

598 
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

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

600 
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

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

602 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

616 
 _ => t)); 
5149  617 

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

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

621 
(* b_j & x_j = u & p b_j t & ... *) 
5094  622 

623 
fun transform_rule r = 

624 
let 

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

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

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

627 
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

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

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

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

631 
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

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

633 
(Logic.strip_params r) 
5094  634 
end 
635 

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

637 

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

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

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

640 
else foldr1 HOLogic.mk_disj (map transform_rule intr_ts)); 
5094  641 

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

642 
(* add definiton of recursive predicates to theory *) 
5094  643 

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

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

645 
space_implode "_" (map fst cnames_syn) else alt_name; 
5094  646 

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

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

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

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

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

652 
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

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

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

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

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

657 
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

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

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

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

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

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

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

664 
end) (cnames_syn ~~ cs); 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

665 
val (consts_defs, ctxt'') = LocalTheory.defs Thm.internalK specs ctxt'; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

668 
val mono = prove_mono predT fp_fun monos ctxt'' 
5094  669 

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

670 
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

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

672 
end; 
5094  673 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

674 
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

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

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

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

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

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

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

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

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

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

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

685 
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

686 

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

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

688 
ctxt > 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

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

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

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

692 
[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

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

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

695 
ctxt1 > 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

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

697 
fold_map (fn (name, (elim, cases)) => 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

698 
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

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

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

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

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

703 
apfst (hd o snd)) (if null elims then [] else cnames ~~ elims) >> 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

704 
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

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

706 

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

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

708 
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

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

710 
ctxt2 > 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

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

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

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

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

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

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

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

718 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

719 
type add_ind_def = 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

720 
{verbose: bool, kind: string, alt_name: bstring, coind: bool, no_elim: bool, no_ind: bool} > 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

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

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

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

724 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

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

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

727 
let 
10735  728 
val _ = 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

729 
if verbose then message ("Proofs for " ^ coind_prefix coind ^ "inductive predicate(s) " ^ 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

731 

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

732 
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

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

734 
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

735 

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

736 
val (ctxt1, rec_name, mono, fp_def, rec_preds_defs, rec_const, preds, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

737 
argTs, bs, xs) = mk_ind_def alt_name coind cs intr_ts 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

738 
monos params cnames_syn ctxt; 
9072
a4896cf23638
Now also proves monotonicity when in quick_and_dirty mode.
berghofe
parents:
8720
diff
changeset

739 

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

740 
val (intrs, unfold) = prove_intrs 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

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

742 
val elims = if no_elim then [] else 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

743 
prove_elims 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

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

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

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

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

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

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

751 
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

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

753 
prove_indrule 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

754 
rec_preds_defs ctxt1); 
5094  755 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

756 
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

757 
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

758 

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

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

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

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

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

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

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

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

766 

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

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

768 
> Context.proof_map (put_inductives names ({names = names, coind = coind}, result)) 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

769 
> LocalTheory.declaration (fn phi => 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

771 
val names' = map (LocalTheory.target_name ctxt2 o Morphism.name phi) names; 
22667
cbfb899dd674
data declaration: removed obsolete target_morphism;
wenzelm
parents:
22605
diff
changeset

772 
val result' = morph_result phi result; 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

773 
in put_inductives names' ({names = names', coind = coind}, result') end); 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

774 
in (result, ctxt3) end; 
5094  775 

6424  776 

10735  777 
(* external interfaces *) 
5094  778 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

779 
fun gen_add_inductive_i mk_def (flags as {verbose, kind, alt_name, coind, no_elim, no_ind}) 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

780 
cnames_syn pnames pre_intros monos ctxt = 
5094  781 
let 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

782 
val thy = ProofContext.theory_of ctxt; 
6424  783 
val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions"); 
5094  784 

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

785 
fun is_abbrev ((name, atts), t) = 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

786 
can (Logic.strip_assums_concl #> Logic.dest_equals) t andalso 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

787 
(name = "" andalso null atts orelse 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

788 
error "Abbreviations may not have names or attributes"); 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

789 

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

790 
fun expand_atom tab (t as Free xT) = 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

791 
the_default t (AList.lookup op = tab xT) 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

792 
 expand_atom tab t = t; 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

793 
fun expand [] r = r 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

794 
 expand tab r = Envir.beta_norm (Term.map_aterms (expand_atom tab) r); 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

795 

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

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

797 

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

798 
fun prep_abbrevs [] abbrevs' abbrevs'' = (rev abbrevs', rev abbrevs'') 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

799 
 prep_abbrevs ((_, abbrev) :: abbrevs) abbrevs' abbrevs'' = 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

800 
let val ((s, T), t) = 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

801 
LocalDefs.abs_def (snd (LocalDefs.cert_def ctxt' abbrev)) 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

802 
in case find_first (equal s o fst o fst) cnames_syn of 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

803 
NONE => error ("Head of abbreviation " ^ quote s ^ " undeclared") 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

804 
 SOME (_, mx) => prep_abbrevs abbrevs 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

805 
(((s, T), expand abbrevs' t) :: abbrevs') 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

806 
(((s, mx), expand abbrevs' t) :: abbrevs'') (* FIXME: do not expand *) 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

807 
end; 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

808 

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

809 
val (abbrevs, pre_intros') = List.partition is_abbrev pre_intros; 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

810 
val (abbrevs', abbrevs'') = prep_abbrevs abbrevs [] []; 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

811 
val _ = (case gen_inter (op = o apsnd fst) 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

812 
(fold (Term.add_frees o snd) abbrevs' [], abbrevs') of 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

813 
[] => () 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

814 
 xs => error ("Bad abbreviation(s): " ^ commas (map fst xs))); 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

815 

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

816 
val params = map Free pnames; 
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

817 
val cnames_syn' = filter_out (fn ((s, _), _) => 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

818 
exists (equal s o fst o fst) abbrevs') cnames_syn; 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

819 
val cs = map (Free o fst) cnames_syn'; 
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

820 
val cnames_syn'' = map (fn ((s, _), mx) => (s, mx)) cnames_syn'; 
5094  821 

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

822 
fun close_rule (x, r) = (x, list_all_free (rev (fold_aterms 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

823 
(fn t as Free (v as (s, _)) => 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

824 
if Variable.is_fixed ctxt' s orelse 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

825 
member op = params t then I else insert op = v 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

826 
 _ => I) r []), r)); 
5094  827 

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

828 
val intros = map (close_rule ##> expand abbrevs') pre_intros'; 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

829 
in 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

830 
ctxt 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

831 
> mk_def flags cs intros monos params cnames_syn'' 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

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

833 
end; 
5094  834 

24721  835 
fun gen_add_inductive mk_def verbose coind cnames_syn pnames_syn intro_srcs raw_monos lthy = 
5094  836 
let 
24721  837 
val ((vars, specs), _) = lthy > Specification.read_specification 
838 
(cnames_syn @ pnames_syn) (map (fn (a, s) => [(a, [s])]) intro_srcs); 

839 
val (cs, ps) = chop (length cnames_syn) vars; 

840 
val intrs = map (apsnd the_single) specs; 

841 
val monos = Attrib.eval_thms lthy raw_monos; 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

842 
val flags = {verbose = verbose, kind = Thm.theoremK, alt_name = "", 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

843 
coind = coind, no_elim = false, no_ind = false}; 
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

844 
in gen_add_inductive_i mk_def flags cs (map fst ps) intrs monos lthy end; 
5094  845 

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

846 
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

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

848 

24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

849 
fun add_inductive_global flags cnames_syn pnames pre_intros monos = 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

850 
TheoryTarget.init NONE #> 
24815
f7093e90f36c
tuned internal interfaces: flags record, added kind for results;
wenzelm
parents:
24744
diff
changeset

851 
add_inductive_i flags cnames_syn pnames pre_intros monos #> 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

852 
(fn (_, lthy) => 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

853 
(#2 (the_inductive (LocalTheory.target_of lthy) 
24744
dcb8cf5fc99c
 add_inductive_i now takes typ instead of typ option as argument
berghofe
parents:
24721
diff
changeset

854 
(LocalTheory.target_name lthy (fst (fst (hd cnames_syn))))), 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

855 
ProofContext.theory_of (LocalTheory.exit lthy))); 
6424  856 

857 

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

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

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

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

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

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

863 

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

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

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

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

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

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

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

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

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

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

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

874 

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

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

876 
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

877 

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

878 
(* partition introduction rules according to predicate name *) 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

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

880 
fold_rev (fn r => AList.map_entry op = (pname_of_intr r) (cons r)) intros 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

881 
(map (rpair [] o fst) (arities_of induct)); 
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 
fun unpartition_rules intros xs = 
4d03dc1cad04
Added functions arities_of, params_of, partition_rules, and
berghofe
parents:
22675
diff
changeset

884 
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

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

886 

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

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

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

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

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

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

892 
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

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

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

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

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

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

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

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

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

901 
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

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

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

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

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

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

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

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

909 

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

910 

6437  911 
(** package setup **) 
912 

913 
(* setup theory *) 

914 

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

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

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

918 
Attrib.add_attributes [("mono", Attrib.add_del_args mono_add mono_del, 
18728  919 
"declaration of monotonicity rule")]; 
6437  920 

921 

922 
(* outer syntax *) 

6424  923 

17057  924 
local structure P = OuterParse and K = OuterKeyword in 
6424  925 

24867  926 
val _ = OuterSyntax.keywords ["monos"]; 
927 

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

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

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

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

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

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

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

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

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

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

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

938 
fun gen_ind_decl mk_def coind = 
22102  939 
P.opt_target  
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

940 
P.fixes  P.for_fixes  
22102  941 
Scan.optional (P.$$$ "where"  P.!!! SpecParse.specification) []  
942 
Scan.optional (P.$$$ "monos"  P.!!! SpecParse.xthms1) [] 

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

943 
>> (fn ((((loc, preds), params), specs), monos) => 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

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

945 
(fn lthy => lthy > gen_add_inductive mk_def true coind preds params 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

946 
(flatten_specification specs) monos > snd)); 
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

947 

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

948 
val ind_decl = gen_ind_decl add_ind_def; 
6424  949 

24867  950 
val _ = OuterSyntax.command "inductive" "define inductive predicates" K.thy_decl (ind_decl false); 
951 
val _ = OuterSyntax.command "coinductive" "define coinductive predicates" K.thy_decl (ind_decl true); 

6723  952 

24867  953 
val _ = 
23762
24eef53a9ad3
Reorganization due to introduction of inductive_set wrapper.
berghofe
parents:
23577
diff
changeset

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

955 
"create simplified instances of elimination rules (improper)" K.thy_script 
22102  956 
(P.opt_target  P.and_list1 SpecParse.spec 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

957 
>> (fn (loc, specs) => Toplevel.local_theory loc (snd o inductive_cases specs))); 
7107  958 

5094  959 
end; 
6424  960 

961 
end; 