author  haftmann 
Sun, 06 May 2007 21:49:23 +0200  
changeset 22838  466599ecf610 
parent 22789  4d03dc1cad04 
child 22846  fb79144af9a3 
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 

22 
signature INDUCTIVE_PACKAGE = 

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 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

41 
val add_inductive_i: bool > bstring > bool > bool > bool > 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

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

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

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

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

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

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

48 
local_theory > inductive_result * local_theory 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

49 
val add_inductive_global: bool > bstring > bool > bool > bool > 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

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

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

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

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

55 
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

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

6424  60 
structure InductivePackage: INDUCTIVE_PACKAGE = 
5094  61 
struct 
62 

9598  63 

10729  64 
(** theory context references **) 
65 

15525  66 
val mono_name = "Orderings.mono"; 
17010
5abc26872268
changed reference to Lfp.lfp to FixedPint.lfp, ditto for gfp
avigad
parents:
16975
diff
changeset

67 
val gfp_name = "FixedPoint.gfp"; 
5abc26872268
changed reference to Lfp.lfp to FixedPint.lfp, ditto for gfp
avigad
parents:
16975
diff
changeset

68 
val lfp_name = "FixedPoint.lfp"; 
10735  69 

11991  70 
val inductive_forall_name = "HOL.induct_forall"; 
71 
val inductive_forall_def = thm "induct_forall_def"; 

72 
val inductive_conj_name = "HOL.induct_conj"; 

73 
val inductive_conj_def = thm "induct_conj_def"; 

74 
val inductive_conj = thms "induct_conj"; 

75 
val inductive_atomize = thms "induct_atomize"; 

18463  76 
val inductive_rulify = thms "induct_rulify"; 
77 
val inductive_rulify_fallback = thms "induct_rulify_fallback"; 

10729  78 

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

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

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

81 
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

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

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

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

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

86 

10729  87 

88 

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

90 

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

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

92 
{preds: term list, defs: thm list, elims: thm list, raw_induct: thm, 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

93 
induct: thm, intrs: thm list, mono: thm, unfold: thm}; 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

94 

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

95 
fun morph_result phi {preds, defs, elims, raw_induct: thm, induct, intrs, mono, unfold} = 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

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

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

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

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

101 
{preds = map term preds, defs = fact defs, elims = fact elims, raw_induct = thm raw_induct, 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

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

104 

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

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

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

107 

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

108 
structure InductiveData = GenericDataFun 
16432  109 
(struct 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

110 
val name = "HOL/inductive"; 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

111 
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

112 

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

113 
val empty = (Symtab.empty, []); 
16432  114 
val extend = I; 
115 
fun merge _ ((tab1, monos1), (tab2, monos2)) = 

11502  116 
(Symtab.merge (K true) (tab1, tab2), Drule.merge_rules (monos1, monos2)); 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

117 

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

118 
fun print context (tab, monos) = 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

120 
val ctxt = Context.proof_of context; 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

121 
val space = Consts.space_of (ProofContext.consts_of ctxt); 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

123 
[Pretty.strs ("(co)inductives:" :: map #1 (NameSpace.extern_table (space, tab))), 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

124 
Pretty.big_list "monotonicity rules:" (map (ProofContext.pretty_thm ctxt) monos)] 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

125 
> Pretty.chunks > Pretty.writeln 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

126 
end; 
16432  127 
end); 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

128 

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

129 
val get_inductives = InductiveData.get o Context.Proof; 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

130 
val print_inductives = InductiveData.print o Context.Proof; 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

131 

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

132 

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

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

134 

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

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

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

137 
NONE => error ("Unknown (co)inductive predicate " ^ quote name) 
15531  138 
 SOME info => info); 
9598  139 

18222  140 
fun put_inductives names info = InductiveData.map (apfst (fn tab => 
141 
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

142 
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

143 

8277  144 

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

145 

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

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

147 

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

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

149 
val map_monos = InductiveData.map o apsnd; 
8277  150 

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

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

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

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

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

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

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

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

158 
fun dest_less_concl thm = dest_less_concl (thm RS le_funD) 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

159 
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

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

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

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

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

164 
 _ $ (Const ("Orderings.less_eq", _) $ _ $ _) => 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

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

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

167 
 _ => [thm] 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

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

169 

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

170 
val mono_add = Thm.declaration_attribute (map_monos o fold Drule.add_rule o mk_mono); 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

171 
val mono_del = Thm.declaration_attribute (map_monos o fold Drule.del_rule o mk_mono); 
7710
bf8cb3fc5d64
Monotonicity rules for inductive definitions can now be added to a theory via
berghofe
parents:
7349
diff
changeset

172 

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

173 

7107  174 

10735  175 
(** misc utilities **) 
6424  176 

5662  177 
val quiet_mode = ref false; 
10735  178 
fun message s = if ! quiet_mode then () else writeln s; 
179 
fun clean_message s = if ! quick_and_dirty then () else message s; 

5662  180 

21433  181 
val note_theorems = LocalTheory.notes Thm.theoremK; 
182 
val note_theorem = LocalTheory.note Thm.theoremK; 

183 

6424  184 
fun coind_prefix true = "co" 
185 
 coind_prefix false = ""; 

186 

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

187 
fun log b m n = if m >= n then 0 else 1 + log b (b * m) n; 
6424  188 

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

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

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

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

192 

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

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

194 
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

195 

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

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

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

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

199 
 find_arg T x ((p as (U, (NONE, y))) :: ps) = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

200 
if T = U then (y, (U, (SOME x, y)) :: ps) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

202 

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

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

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

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

206 

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

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

208 
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

209 

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

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

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

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

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

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

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

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

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

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

220 
else NONE 
5094  221 
end; 
222 

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

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

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

225 
 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

226 

6424  227 

228 

10729  229 
(** process rules **) 
230 

231 
local 

5094  232 

16432  233 
fun err_in_rule thy name t msg = 
234 
error (cat_lines ["Illformed introduction rule " ^ quote name, 

235 
Sign.string_of_term thy t, msg]); 

10729  236 

16432  237 
fun err_in_prem thy name t p msg = 
238 
error (cat_lines ["Illformed premise", Sign.string_of_term thy p, 

239 
"in introduction rule " ^ quote name, Sign.string_of_term thy t, msg]); 

5094  240 

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

241 
val bad_concl = "Conclusion of introduction rule must be an inductive predicate"; 
10729  242 

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

243 
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

244 

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

245 
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

246 

16432  247 
fun atomize_term thy = MetaSimplifier.rewrite_term thy inductive_atomize []; 
10729  248 

249 
in 

5094  250 

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

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

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

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

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

256 
val prems = map (curry subst_bounds frees) (Logic.strip_assums_hyp rule); 
16432  257 
val aprems = map (atomize_term thy) prems; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

258 
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

259 

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

260 
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

261 
NONE => err (bad_app ^ 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

262 
commas (map (Sign.string_of_term thy) params)) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

264 
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

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

266 

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

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

268 
if head_of t mem cs then 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

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

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

273 
 _ => ()); 
5094  274 

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

276 
if can HOLogic.dest_Trueprop aprem then check_prem' prem prem 
16432  277 
else err_in_prem thy name rule prem "Nonatomic premise"; 
10729  278 
in 
11358
416ea5c009f5
now checks for leading metaquantifiers and complains, instead of
paulson
parents:
11036
diff
changeset

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

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

281 
if head_of t mem cs then 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

283 
List.app check_prem (prems ~~ aprems)) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

284 
else err_in_rule thy name rule bad_concl 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

286 
((name, att), arule) 
10729  287 
end; 
5094  288 

18222  289 
val rulify = (* FIXME norm_hhf *) 
290 
hol_simplify inductive_conj 

18463  291 
#> hol_simplify inductive_rulify 
292 
#> hol_simplify inductive_rulify_fallback 

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

293 
(*#> standard*); 
10729  294 

295 
end; 

296 

5094  297 

6424  298 

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

299 
(** proofs for (co)inductive predicates **) 
6424  300 

10735  301 
(* prove monotonicity  NOT subject to quick_and_dirty! *) 
5094  302 

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

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

305 
Goal.prove ctxt [] [] (*NO quick_and_dirty here!*) 
17985  306 
(HOLogic.mk_Trueprop 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

307 
(Const (mono_name, (predT > predT) > HOLogic.boolT) $ fp_fun)) 
17985  308 
(fn _ => EVERY [rtac monoI 1, 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

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

312 
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

313 
etac le_funE 1, dtac le_boolD 1])])); 
5094  314 

6424  315 

10735  316 
(* prove introduction rules *) 
5094  317 

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

318 
fun prove_intrs coind mono fp_def k params intr_ts rec_preds_defs ctxt = 
5094  319 
let 
10735  320 
val _ = clean_message " Proving the introduction rules ..."; 
5094  321 

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

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

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

324 
(if coind then def_gfp_unfold else def_lfp_unfold))); 
5094  325 

326 
fun select_disj 1 1 = [] 

327 
 select_disj _ 1 = [rtac disjI1] 

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

329 

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

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

331 

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

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

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

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

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

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

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

339 
DEPTH_SOLVE_1 (resolve_tac rules 1 APPEND assume_tac 1)]))) intr_ts 
5094  340 

341 
in (intrs, unfold) end; 

342 

6424  343 

10735  344 
(* prove elimination rules *) 
5094  345 

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

346 
fun prove_elims cs params intr_ts intr_names unfold rec_preds_defs ctxt = 
5094  347 
let 
10735  348 
val _ = clean_message " Proving the elimination rules ..."; 
5094  349 

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

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

351 
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

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

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

354 

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

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

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

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

358 

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

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

360 

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

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

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

363 

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

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

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

366 
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

367 
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

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

369 

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

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

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

372 
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

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

374 
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

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

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

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

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

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

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

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

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

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

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

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

386 
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

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

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

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

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

391 

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

392 
in map prove_elim cs end; 
5094  393 

6424  394 

10735  395 
(* derivation of simplified elimination rules *) 
5094  396 

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

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

398 

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

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

402 
(fn _ => assume_tac 1); 

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

403 
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

404 
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

405 

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

406 
fun simp_case_tac solved ss i = 
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

407 
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

408 
THEN_MAYBE (if solved then no_tac else all_tac); (* FIXME !? *) 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

409 

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

410 
in 
9598  411 

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

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

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

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

416 

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

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

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

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

420 

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

421 
val P = HOLogic.dest_Trueprop (Logic.strip_imp_concl prop) handle TERM _ => 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

422 
err "Objectlogic proposition expected"; 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

423 
val c = Term.head_name_of P; 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

424 
val (_, {elims, ...}) = the_inductive ctxt c; 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

425 

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

426 
val cprop = Thm.cterm_of thy prop; 
11682
d9063229b4a1
simp_case_tac is back again from induct_method.ML;
wenzelm
parents:
11628
diff
changeset

427 
val tac = ALLGOALS (simp_case_tac false ss) THEN prune_params_tac; 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

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

429 
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

430 
> singleton (Variable.export (Variable.auto_fixes prop ctxt) ctxt); 
7107  431 
in 
432 
(case get_first (try mk_elim) elims of 

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

434 
 NONE => err "Proposition not an inductive predicate:") 
7107  435 
end; 
436 

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

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

438 

7107  439 

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

440 
(* inductive_cases *) 
7107  441 

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

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

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

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

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

447 
map (Thm.no_attributes o single o mk_cases lthy o prep_prop lthy) props)); 
21433  448 
in lthy > note_theorems facts >> map snd end; 
5094  449 

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

450 
val inductive_cases = gen_inductive_cases Attrib.intern_src ProofContext.read_prop; 
12172  451 
val inductive_cases_i = gen_inductive_cases (K I) ProofContext.cert_prop; 
7107  452 

6424  453 

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

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

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

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

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

458 
val (_, ctxt') = Variable.add_fixes fixes ctxt; 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

459 
val props = map (ProofContext.read_prop ctxt') raw_props; 
51411098e49b
 Improved handling of monotonicity rules involving <=
berghofe
parents:
22102
diff
changeset

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

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

462 
in Method.erule 0 rules end); 
9598  463 

464 

465 

10735  466 
(* prove induction rule *) 
5094  467 

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

468 
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

469 
fp_def rec_preds_defs ctxt = 
5094  470 
let 
10735  471 
val _ = clean_message " Proving the induction rule ..."; 
20047  472 
val thy = ProofContext.theory_of ctxt; 
5094  473 

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

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

475 

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

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

477 
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

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

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

480 
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

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

482 

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

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

484 

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

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

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

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

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

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

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

491 
val bs = map Bound (k  1 downto 0); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

492 
val P = list_comb (List.nth (preds, i), ys @ bs); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

493 
val Q = list_abs (mk_names "x" k ~~ Ts, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

494 
HOLogic.mk_binop inductive_conj_name (list_comb (s, bs), P)) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

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

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

499 
 _ => (s, NONE))); 
7293  500 

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

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

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

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

504 

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

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

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

507 

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

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

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

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

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

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

513 

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

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

515 

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

516 

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

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

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

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

522 
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

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

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

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

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

527 
end) (unflat Tss xnames ~~ Tss ~~ cs ~~ preds))); 
5094  528 

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

529 

5094  530 
(* make predicate for instantiation of abstract induction rule *) 
531 

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

532 
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

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

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

535 
(make_bool_args HOLogic.mk_not I bs i)) preds)); 
5094  536 

537 
val ind_concl = HOLogic.mk_Trueprop 

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

538 
(HOLogic.mk_binrel "Orderings.less_eq" (rec_const, ind_pred)); 
5094  539 

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

540 
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

541 

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

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

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

546 
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

547 
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

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

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

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

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

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

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

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

556 
(inductive_conj_def :: rec_preds_defs) prem, conjI, refl] 1)) prems)]); 
5094  557 

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

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

560 
[rewrite_goals_tac rec_preds_defs, 
5094  561 
REPEAT (EVERY 
562 
[REPEAT (resolve_tac [conjI, impI] 1), 

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

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

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

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

566 
atac 1])]) 
5094  567 

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

568 
in singleton (ProofContext.export ctxt'' ctxt) (induct RS lemma) end; 
5094  569 

6424  570 

571 

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

572 
(** specification of (co)inductive predicates **) 
10729  573 

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

574 
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

575 
params cnames_syn ctxt = 
5094  576 
let 
10735  577 
val fp_name = if coind then gfp_name else lfp_name; 
5094  578 

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

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

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

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

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

583 
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

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

585 
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

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

587 

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

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

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

590 
let val zs = map Bound (length Us  1 downto 0) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

592 
list_abs (map (pair "z") Us, list_comb (p, 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

593 
make_bool_args' bs i @ make_args argTs ((ts ~~ Ts) @ (zs ~~ Us)))) 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

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

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

598 
 _ => t)); 
5149  599 

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

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

603 
(* b_j & x_j = u & p b_j t & ... *) 
5094  604 

605 
fun transform_rule r = 

606 
let 

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

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

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

609 
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

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

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

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

613 
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

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

615 
(Logic.strip_params r) 
5094  616 
end 
617 

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

619 

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

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

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

622 
else foldr1 HOLogic.mk_disj (map transform_rule intr_ts)); 
5094  623 

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

624 
(* add definiton of recursive predicates to theory *) 
5094  625 

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

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

627 
space_implode "_" (map fst cnames_syn) else alt_name; 
5094  628 

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

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

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

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

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

634 
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

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

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

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

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

639 
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

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

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

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

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

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

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

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

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

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

650 
val mono = prove_mono predT fp_fun monos ctxt'' 
5094  651 

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

652 
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

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

654 
end; 
5094  655 

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

656 
fun add_ind_def verbose alt_name coind no_elim no_ind cs 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

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

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

660 
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

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

662 

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

663 
val cnames = map (Sign.full_name (ProofContext.theory_of ctxt) o #1) cnames_syn; (* FIXME *) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

664 
val ((intr_names, intr_atts), intr_ts) = apfst split_list (split_list intros); 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

665 

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

666 
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

667 
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

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

669 

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

670 
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

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

672 
val elims = if no_elim then [] else 
22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

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

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

675 
(if no_ind then Drule.asm_rl else 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

676 
if coind then ObjectLogic.rulify (rule_by_tactic 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

677 
(rewrite_tac [le_fun_def, le_bool_def] THEN 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

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

680 
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

681 
rec_preds_defs ctxt1); 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

682 
val induct_cases = map (#1 o #1) intros; 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

683 
val ind_case_names = RuleCases.case_names induct_cases; 
12165  684 
val induct = 
18222  685 
if coind then 
686 
(raw_induct, [RuleCases.case_names [rec_name], 

18234  687 
RuleCases.case_conclusion (rec_name, induct_cases), 
18222  688 
RuleCases.consumes 1]) 
689 
else if no_ind orelse length cs > 1 then 

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

690 
(raw_induct, [ind_case_names, RuleCases.consumes 0]) 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

691 
else (raw_induct RSN (2, rev_mp), [ind_case_names, RuleCases.consumes 1]); 
5094  692 

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

693 
val (intrs', ctxt2) = 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

694 
ctxt1 > 
21433  695 
note_theorems 
21390
b3a9d8a83dea
replaced NameSpace.append by NameSpace.qualified, which handles empty names as expected;
wenzelm
parents:
21367
diff
changeset

696 
(map (NameSpace.qualified rec_name) intr_names ~~ 
22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

697 
intr_atts ~~ map (fn th => [([th], 
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

698 
[Attrib.internal (K (ContextRules.intro_query NONE))])]) intrs) >> 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

699 
map (hd o snd); (* FIXME? *) 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

700 
val (((_, elims'), (_, [induct'])), ctxt3) = 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

701 
ctxt2 > 
21465
2d3f477118c2
more careful declaration of "intros" as Pure.intro;
wenzelm
parents:
21433
diff
changeset

702 
note_theorem ((NameSpace.qualified rec_name "intros", []), intrs') >> 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

703 
fold_map (fn (name, (elim, cases)) => 
21433  704 
note_theorem ((NameSpace.qualified (Sign.base_name name) "cases", 
21658  705 
[Attrib.internal (K (RuleCases.case_names cases)), 
706 
Attrib.internal (K (RuleCases.consumes 1)), 

707 
Attrib.internal (K (InductAttrib.cases_set name)), 

708 
Attrib.internal (K (ContextRules.elim_query NONE))]), [elim]) #> 

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

709 
apfst (hd o snd)) elims >> 
21433  710 
note_theorem ((NameSpace.qualified rec_name (coind_prefix coind ^ "induct"), 
21658  711 
map (Attrib.internal o K) (#2 induct)), [rulify (#1 induct)]); 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

712 

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

713 
val induct_att = if coind then InductAttrib.coinduct_set else InductAttrib.induct_set; 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

714 
val ctxt4 = if no_ind then ctxt3 else 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

715 
let val inducts = cnames ~~ ProjectRule.projects ctxt (1 upto length cnames) induct' 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

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

717 
ctxt3 > 
21508  718 
note_theorems [((NameSpace.qualified rec_name (coind_prefix coind ^ "inducts"), []), 
719 
inducts > map (fn (name, th) => ([th], 

21658  720 
[Attrib.internal (K ind_case_names), 
721 
Attrib.internal (K (RuleCases.consumes 1)), 

722 
Attrib.internal (K (induct_att name))])))] > snd 

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

723 
end; 
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

724 

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

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

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

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

728 
defs = fp_def :: rec_preds_defs, 
22605
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

729 
mono = mono, 
41b092e7d89a
 Removed occurrences of ProofContext.export in add_ind_def that
berghofe
parents:
22460
diff
changeset

730 
unfold = unfold, 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

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

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

733 
raw_induct = rulify raw_induct, 
21526
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

735 

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

736 
val ctxt5 = ctxt4 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

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

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

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

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

742 
in put_inductives names' ({names = names', coind = coind}, result') end); 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

743 
in (result, ctxt5) end; 
5094  744 

6424  745 

10735  746 
(* external interfaces *) 
5094  747 

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

748 
fun add_inductive_i verbose alt_name coind no_elim no_ind cnames_syn pnames pre_intros monos ctxt = 
5094  749 
let 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

750 
val thy = ProofContext.theory_of ctxt; 
6424  751 
val _ = Theory.requires thy "Inductive" (coind_prefix coind ^ "inductive definitions"); 
5094  752 

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

753 
val frees = fold (Term.add_frees o snd) pre_intros []; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

754 
fun type_of s = (case AList.lookup op = frees s of 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

755 
NONE => error ("No such variable: " ^ s)  SOME T => T); 
5094  756 

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

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

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

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

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

761 

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

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

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

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

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

766 
 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

767 

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

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

769 

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

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

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

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

773 
LocalDefs.abs_def (snd (LocalDefs.cert_def ctxt' abbrev)) 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

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

775 
NONE => error ("Head of abbreviation " ^ quote s ^ " undeclared") 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

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

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

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

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

780 

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

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

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

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

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

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

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

787 

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

788 
val params = map 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

789 
(fn (s, SOME T) => Free (s, T)  (s, NONE) => Free (s, type_of s)) pnames; 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

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

791 
exists (equal s o fst o fst) abbrevs') cnames_syn; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

792 
val cs = map 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

793 
(fn (s, SOME T, _) => Free (s, T)  (s, NONE, _) => Free (s, type_of s)) cnames_syn'; 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

794 
val cnames_syn'' = map (fn (s, _, mx) => (s, mx)) cnames_syn'; 
5094  795 

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

796 
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

797 
(fn t as Free (v as (s, _)) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

798 
if Variable.is_fixed ctxt s orelse member op = cs t orelse 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

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

800 
 _ => I) r []), r)); 
5094  801 

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

802 
val intros = map (apsnd (expand abbrevs') #> 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

803 
check_rule thy cs params #> close_rule) pre_intros'; 
21048
e57e91f72831
Restructured and repaired code dealing with case names
berghofe
parents:
21024
diff
changeset

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

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

806 
add_ind_def verbose alt_name coind no_elim no_ind cs intros monos 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

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

809 
end; 
5094  810 

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

811 
fun add_inductive verbose coind cnames_syn pnames_syn intro_srcs raw_monos ctxt = 
5094  812 
let 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

813 
val (_, ctxt') = Specification.read_specification (cnames_syn @ pnames_syn) [] ctxt; 
21766
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

814 
val intrs = map (fn ((name, att), s) => apsnd hd (hd (snd (fst 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

815 
(Specification.read_specification [] [((name, att), [s])] ctxt')))) 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

816 
handle ERROR msg => 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

817 
cat_error msg ("The error(s) above occurred for\n" ^ 
3eb48154388e
Abbreviations can now be specified simultaneously
berghofe
parents:
21658
diff
changeset

818 
(if name = "" then "" else name ^ ": ") ^ s)) intro_srcs; 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

819 
val pnames = map (fn (s, _, _) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

820 
(s, SOME (ProofContext.infer_type ctxt' s))) pnames_syn; 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

821 
val cnames_syn' = map (fn (s, _, mx) => 
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

822 
(s, SOME (ProofContext.infer_type ctxt' s), mx)) cnames_syn; 
21350  823 
val (monos, ctxt'') = LocalTheory.theory_result (IsarCmd.apply_theorems raw_monos) ctxt; 
6424  824 
in 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

825 
add_inductive_i verbose "" coind false false cnames_syn' pnames intrs monos ctxt'' 
5094  826 
end; 
827 

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

828 
fun add_inductive_global verbose alt_name coind no_elim no_ind cnames_syn pnames pre_intros monos = 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

829 
TheoryTarget.init NONE #> 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

830 
add_inductive_i verbose alt_name coind no_elim no_ind cnames_syn pnames pre_intros monos #> 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

832 
(#2 (the_inductive (LocalTheory.target_of lthy) 
1e6bd5ed7abc
added morh_result, the_inductive, add_inductive_global;
wenzelm
parents:
21508
diff
changeset

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

834 
ProofContext.theory_of (LocalTheory.exit lthy))); 
6424  835 

836 

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

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

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

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

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

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

842 

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

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

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

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

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

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

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

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

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

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

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

853 

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

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

855 
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

856 

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

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

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

859 
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

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

861 

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

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

863 
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

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

865 

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

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

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

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

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

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

871 
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

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

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

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

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

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

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

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

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

880 
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

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

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

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

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

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

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

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

888 

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

889 

6437  890 
(** package setup **) 
891 

892 
(* setup theory *) 

893 

8634  894 
val setup = 
18708  895 
InductiveData.init #> 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

896 
Method.add_methods [("ind_cases2", ind_cases, (* FIXME "ind_cases" (?) *) 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

897 
"dynamic case analysis on predicates")] #> 
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

898 
Attrib.add_attributes [("mono2", Attrib.add_del_args mono_add mono_del, (* FIXME "mono" *) 
18728  899 
"declaration of monotonicity rule")]; 
6437  900 

901 

902 
(* outer syntax *) 

6424  903 

17057  904 
local structure P = OuterParse and K = OuterKeyword in 
6424  905 

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

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

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

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

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

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

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

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

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

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

916 
fun ind_decl coind = 

22102  917 
P.opt_target  
21367
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

918 
P.fixes  P.for_fixes  
22102  919 
Scan.optional (P.$$$ "where"  P.!!! SpecParse.specification) []  
920 
Scan.optional (P.$$$ "monos"  P.!!! SpecParse.xthms1) [] 

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

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

922 
Toplevel.local_theory loc 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

923 
(fn lthy => lthy 
7a0cc1bb4dcc
inductive: canonical specification syntax (flattened result only);
wenzelm
parents:
21350
diff
changeset

924 
> add_inductive true coind preds params (flatten_specification specs) monos > snd)); 
6424  925 

6723  926 
val inductiveP = 
21024
63ab84bb64d1
Completely rewrote inductive definition package. Now allows to
berghofe
parents:
20901
diff
changeset

927 
OuterSyntax.command "inductive2" "define inductive predicates" K.thy_decl (ind_decl false); 
6723  928 

929 
val coinductiveP = 

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

930 
OuterSyntax.command "coinductive2" "define coinductive predicates" K.thy_decl (ind_decl true); 
6424  931 

7107  932 

933 
val inductive_casesP = 

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

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

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

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

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

939 
val _ = OuterSyntax.add_keywords ["monos"]; 
7107  940 
val _ = OuterSyntax.add_parsers [inductiveP, coinductiveP, inductive_casesP]; 
6424  941 

5094  942 
end; 
6424  943 

944 
end; 