author  wenzelm 
Wed, 27 Aug 2014 14:54:32 +0200  
changeset 58048  aa6296d09e0e 
parent 56245  84fc7dfa3cd4 
child 58318  f95754ca7082 
permissions  rwrr 
32174  1 
(* Title: Provers/splitter.ML 
4  2 
Author: Tobias Nipkow 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

3 
Copyright 1995 TU Munich 
4  4 

5 
Generic casesplitter, suitable for most logics. 

13157
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

6 
Deals with equalities of the form ?P(f args) = ... 
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

7 
where "f args" must be a firstorder term without duplicate variables. 
0  8 
*) 
9 

5304  10 
signature SPLITTER_DATA = 
11 
sig 

32177
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32174
diff
changeset

12 
val thy : theory 
5553  13 
val mk_eq : thm > thm 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

14 
val meta_eq_to_iff: thm (* "x == y ==> x = y" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

15 
val iffD : thm (* "[ P = Q; Q ] ==> P" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

16 
val disjE : thm (* "[ P  Q; P ==> R; Q ==> R ] ==> R" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

17 
val conjE : thm (* "[ P & Q; [ P; Q ] ==> R ] ==> R" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

18 
val exE : thm (* "[ EX x. P x; !!x. P x ==> Q ] ==> Q" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

19 
val contrapos : thm (* "[ ~ Q; P ==> Q ] ==> ~ P" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

20 
val contrapos2 : thm (* "[ Q; ~ P ==> ~ Q ] ==> P" *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

21 
val notnotD : thm (* "~ ~ P ==> P" *) 
5304  22 
end 
23 

24 
signature SPLITTER = 

25 
sig 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

26 
(* somewhat more internal functions *) 
33242  27 
val cmap_of_split_thms: thm list > (string * (typ * term * thm * typ * int) list) list 
28 
val split_posns: (string * (typ * term * thm * typ * int) list) list > 

29 
theory > typ list > term > (thm * (typ * typ * int list) list * int list * typ * term) list 

30 
(* first argument is a "cmap", returns a list of "split packs" *) 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

31 
(* the "real" interface, providing a number of tactics *) 
5304  32 
val split_tac : thm list > int > tactic 
33 
val split_inside_tac: thm list > int > tactic 

34 
val split_asm_tac : thm list > int > tactic 

51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
45620
diff
changeset

35 
val add_split: thm > Proof.context > Proof.context 
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
45620
diff
changeset

36 
val del_split: thm > Proof.context > Proof.context 
18728  37 
val split_add: attribute 
38 
val split_del: attribute 

30513  39 
val split_modifiers : Method.modifier parser list 
18708  40 
val setup: theory > theory 
5304  41 
end; 
42 

32177
bc02c5bfcb5b
renamed functor SplitterFun to Splitter, require explicit theory;
wenzelm
parents:
32174
diff
changeset

43 
functor Splitter(Data: SPLITTER_DATA): SPLITTER = 
17881  44 
struct 
5304  45 

18545  46 
val Const (const_not, _) $ _ = 
35625  47 
Object_Logic.drop_judgment Data.thy 
18545  48 
(#1 (Logic.dest_implies (Thm.prop_of Data.notnotD))); 
5304  49 

18545  50 
val Const (const_or , _) $ _ $ _ = 
35625  51 
Object_Logic.drop_judgment Data.thy 
18545  52 
(#1 (Logic.dest_implies (Thm.prop_of Data.disjE))); 
53 

35625  54 
val const_Trueprop = Object_Logic.judgment_name Data.thy; 
18545  55 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

56 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

57 
fun split_format_err () = error "Wrong format for split rule"; 
4668
131989b78417
Little reorganization. Loop tactics have names now.
nipkow
parents:
4519
diff
changeset

58 

5553  59 
fun split_thm_info thm = case concl_of (Data.mk_eq thm) of 
56245  60 
Const(@{const_name Pure.eq}, _) $ (Var _ $ t) $ c => (case strip_comb t of 
13855
644692eca537
addsplits / delsplits no longer ignore type of constant.
berghofe
parents:
13157
diff
changeset

61 
(Const p, _) => (p, case c of (Const (s, _) $ _) => s = const_not  _ => false) 
644692eca537
addsplits / delsplits no longer ignore type of constant.
berghofe
parents:
13157
diff
changeset

62 
 _ => split_format_err ()) 
644692eca537
addsplits / delsplits no longer ignore type of constant.
berghofe
parents:
13157
diff
changeset

63 
 _ => split_format_err (); 
5304  64 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

65 
fun cmap_of_split_thms thms = 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

66 
let 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

67 
val splits = map Data.mk_eq thms 
33242  68 
fun add_thm thm cmap = 
69 
(case concl_of thm of _ $ (t as _ $ lhs) $ _ => 

70 
(case strip_comb lhs of (Const(a,aT),args) => 

71 
let val info = (aT,lhs,thm,fastype_of t,length args) 

72 
in case AList.lookup (op =) cmap a of 

73 
SOME infos => AList.update (op =) (a, info::infos) cmap 

74 
 NONE => (a,[info])::cmap 

75 
end 

76 
 _ => split_format_err()) 

77 
 _ => split_format_err()) 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

78 
in 
33242  79 
fold add_thm splits [] 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

80 
end; 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

81 

54216
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

82 
val abss = fold (Term.abs o pair ""); 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

83 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

84 
(*  *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

85 
(* mk_case_split_tac *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

86 
(*  *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

87 

5304  88 
fun mk_case_split_tac order = 
0  89 
let 
90 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

91 
(************************************************************ 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

92 
Create lifttheorem "trlift" : 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

93 

7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

94 
[ !!x. Q x == R x; P(%x. R x) == C ] ==> P (%x. Q x) == C 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

95 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

96 
*************************************************************) 
5304  97 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

98 
val meta_iffD = Data.meta_eq_to_iff RS Data.iffD; (* (P == Q) ==> Q ==> P *) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

99 

22838  100 
val lift = Goal.prove_global Pure.thy ["P", "Q", "R"] 
24707  101 
[Syntax.read_prop_global Pure.thy "!!x :: 'b. Q(x) == R(x) :: 'c"] 
102 
(Syntax.read_prop_global Pure.thy "P(%x. Q(x)) == P(%x. R(x))") 

54742
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
wenzelm
parents:
54216
diff
changeset

103 
(fn {context = ctxt, prems} => rewrite_goals_tac ctxt prems THEN rtac reflexive_thm 1) 
4  104 

54216
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

105 
val _ $ _ $ (_ $ (_ $ abs_lift) $ _) = prop_of lift; 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

106 

0  107 
val trlift = lift RS transitive_thm; 
108 

109 

17881  110 
(************************************************************************ 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

111 
Set up term for instantiation of P in the lifttheorem 
17881  112 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

113 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

114 
the lift theorem is applied to (see select) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

115 
pos : "path" leading to abstraction, coded as a list 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

116 
T : type of body of P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

117 
*************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

118 

54216
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

119 
fun mk_cntxt t pos T = 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

120 
let 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

121 
fun down [] t = (Bound 0, t) 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

122 
 down (p :: ps) t = 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

123 
let 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

124 
val (h, ts) = strip_comb t 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

125 
val (ts1, u :: ts2) = chop p ts 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

126 
val (u1, u2) = down ps u 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

127 
in 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

128 
(list_comb (incr_boundvars 1 h, 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

129 
map (incr_boundvars 1) ts1 @ u1 :: 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

130 
map (incr_boundvars 1) ts2), 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

131 
u2) 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

132 
end; 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

133 
val (u1, u2) = down (rev pos) t 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

134 
in (Abs ("", T, u1), u2) end; 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

135 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

136 

17881  137 
(************************************************************************ 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

138 
Set up term for instantiation of P in the splittheorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

139 
P(...) == rhs 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

140 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

141 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

142 
the split theorem is applied to (see select) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

143 
T : type of body of P(...) 
4232  144 
tt : the term Const(key,..) $ ... 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

145 
*************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

146 

4232  147 
fun mk_cntxt_splitthm t tt T = 
148 
let fun repl lev t = 

52131  149 
if Envir.aeconv(incr_boundvars lev tt, t) then Bound lev 
4232  150 
else case t of 
151 
(Abs (v, T2, t)) => Abs (v, T2, repl (lev+1) t) 

152 
 (Bound i) => Bound (if i>=lev then i+1 else i) 

153 
 (t1 $ t2) => (repl lev t1) $ (repl lev t2) 

154 
 t => t 

155 
in Abs("", T, repl 0 t) end; 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

156 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

157 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

158 
(* add all loose bound variables in t to list is *) 
33245  159 
fun add_lbnos t is = add_loose_bnos (t, 0, is); 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

160 

7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

161 
(* check if the innermost abstraction that needs to be removed 
1064  162 
has a body of type T; otherwise the expansion thm will fail later on 
163 
*) 

33029  164 
fun type_test (T, lbnos, apsns) = 
42364  165 
let val (_, U: typ, _) = nth apsns (foldl1 Int.min lbnos) 
33029  166 
in T = U end; 
0  167 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

168 
(************************************************************************* 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

169 
Create a "split_pack". 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

170 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

171 
thm : the relevant splittheorem, i.e. P(...) == rhs , where P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

172 
is of the form 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

173 
P( Const(key,...) $ t_1 $ ... $ t_n ) (e.g. key = "if") 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

174 
T : type of P(...) 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

175 
T' : type of term to be scanned 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

176 
n : number of arguments expected by Const(key,...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

177 
ts : list of arguments actually found 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

178 
apsns : list of tuples of the form (T,U,pos), one tuple for each 
17881  179 
abstraction that is encountered on the way to the position where 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

180 
Const(key, ...) $ ... occurs, where 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

181 
T : type of the variable bound by the abstraction 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

182 
U : type of the abstraction's body 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

183 
pos : "path" leading to the body of the abstraction 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

184 
pos : "path" leading to the position where Const(key, ...) $ ... occurs. 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

185 
TB : type of Const(key,...) $ t_1 $ ... $ t_n 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

186 
t : the term Const(key,...) $ t_1 $ ... $ t_n 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

187 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

188 
A split pack is a tuple of the form 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

189 
(thm, apsns, pos, TB, tt) 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

190 
Note : apsns is reversed, so that the outermost quantifier's position 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

191 
comes first ! If the terms in ts don't contain variables bound 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

192 
by other than metaquantifiers, apsns is empty, because no further 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

193 
lifting is required before applying the splittheorem. 
17881  194 
******************************************************************************) 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

195 

20664  196 
fun mk_split_pack (thm, T: typ, T', n, ts, apsns, pos, TB, t) = 
1064  197 
if n > length ts then [] 
198 
else let val lev = length apsns 

33955  199 
val lbnos = fold add_lbnos (take n ts) [] 
33317  200 
val flbnos = filter (fn i => i < lev) lbnos 
4232  201 
val tt = incr_boundvars (~lev) t 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

202 
in if null flbnos then 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

203 
if T = T' then [(thm,[],pos,TB,tt)] else [] 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

204 
else if type_test(T,flbnos,apsns) then [(thm, rev apsns,pos,TB,tt)] 
2143  205 
else [] 
1064  206 
end; 
0  207 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

208 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

209 
(**************************************************************************** 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

210 
Recursively scans term for occurences of Const(key,...) $ ... 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

211 
Returns a list of "splitpacks" (one for each occurence of Const(key,...) ) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

212 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

213 
cmap : association list of splittheorems that should be tried. 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

214 
The elements have the format (key,(thm,T,n)) , where 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

215 
key : the theorem's key constant ( Const(key,...) $ ... ) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

216 
thm : the theorem itself 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

217 
T : type of P( Const(key,...) $ ... ) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

218 
n : number of arguments expected by Const(key,...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

219 
Ts : types of parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

220 
t : the term to be scanned 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

221 
******************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

222 

13157
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

223 
(* Simplified firstorder matching; 
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

224 
assumes that all Vars in the pattern are distinct; 
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

225 
see Pure/pattern.ML for the full version; 
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

226 
*) 
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

227 
local 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

228 
exception MATCH 
13157
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

229 
in 
42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

230 
fun typ_match thy (tyenv, TU) = Sign.typ_match thy TU tyenv 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

231 
handle Type.TYPE_MATCH => raise MATCH; 
33242  232 

42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

233 
fun fomatch thy args = 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

234 
let 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

235 
fun mtch tyinsts = fn 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

236 
(Ts, Var(_,T), t) => 
42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

237 
typ_match thy (tyinsts, (T, fastype_of1(Ts,t))) 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

238 
 (_, Free (a,T), Free (b,U)) => 
42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

239 
if a=b then typ_match thy (tyinsts,(T,U)) else raise MATCH 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

240 
 (_, Const (a,T), Const (b,U)) => 
42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

241 
if a=b then typ_match thy (tyinsts,(T,U)) else raise MATCH 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

242 
 (_, Bound i, Bound j) => 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

243 
if i=j then tyinsts else raise MATCH 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

244 
 (Ts, Abs(_,T,t), Abs(_,U,u)) => 
42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

245 
mtch (typ_match thy (tyinsts,(T,U))) (U::Ts,t,u) 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

246 
 (Ts, f$t, g$u) => 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

247 
mtch (mtch tyinsts (Ts,f,g)) (Ts, t, u) 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

248 
 _ => raise MATCH 
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

249 
in (mtch Vartab.empty args; true) handle MATCH => false end; 
33242  250 
end; 
13157
4a4599f78f18
allowed more general split rules to cope with div/mod 2
nipkow
parents:
10821
diff
changeset

251 

42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

252 
fun split_posns (cmap : (string * (typ * term * thm * typ * int) list) list) thy Ts t = 
6130
30b84ad2131d
Fixed old bug: selection of constant to be split should depend not just on
nipkow
parents:
5553
diff
changeset

253 
let 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

254 
val T' = fastype_of1 (Ts, t); 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

255 
fun posns Ts pos apsns (Abs (_, T, t)) = 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

256 
let val U = fastype_of1 (T::Ts,t) 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

257 
in posns (T::Ts) (0::pos) ((T, U, pos)::apsns) t end 
6130
30b84ad2131d
Fixed old bug: selection of constant to be split should depend not just on
nipkow
parents:
5553
diff
changeset

258 
 posns Ts pos apsns t = 
30b84ad2131d
Fixed old bug: selection of constant to be split should depend not just on
nipkow
parents:
5553
diff
changeset

259 
let 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

260 
val (h, ts) = strip_comb t 
33245  261 
fun iter t (i, a) = (i+1, (posns Ts (i::pos) apsns t) @ a); 
262 
val a = 

263 
case h of 

264 
Const(c, cT) => 

265 
let fun find [] = [] 

266 
 find ((gcT, pat, thm, T, n)::tups) = 

42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

267 
let val t2 = list_comb (h, take n ts) in 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

268 
if Sign.typ_instance thy (cT, gcT) andalso fomatch thy (Ts, pat, t2) 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

269 
then mk_split_pack(thm,T,T',n,ts,apsns,pos,type_of1(Ts,t2),t2) 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

270 
else find tups 
33245  271 
end 
272 
in find (these (AList.lookup (op =) cmap c)) end 

273 
 _ => [] 

274 
in snd (fold iter ts (0, a)) end 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

275 
in posns Ts [] [] t end; 
0  276 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

277 
fun shorter ((_,ps,pos,_,_), (_,qs,qos,_,_)) = 
4519  278 
prod_ord (int_ord o pairself length) (order o pairself length) 
279 
((ps, pos), (qs, qos)); 

280 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

281 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

282 
(************************************************************ 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

283 
call split_posns with appropriate parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

284 
*************************************************************) 
0  285 

1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

286 
fun select cmap state i = 
42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

287 
let 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

288 
val thy = Thm.theory_of_thm state 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

289 
val goal = term_of (Thm.cprem_of state i); 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

290 
val Ts = rev (map #2 (Logic.strip_params goal)); 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

291 
val _ $ t $ _ = Logic.strip_assums_concl goal; 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

292 
in (Ts, t, sort shorter (split_posns cmap thy Ts t)) end; 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

293 

42367
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

294 
fun exported_split_posns cmap thy Ts t = 
577d85fb5862
more direct Thm.cprem_of (with exception THM instead of Subscript);
wenzelm
parents:
42364
diff
changeset

295 
sort shorter (split_posns cmap thy Ts t); 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

296 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

297 
(************************************************************* 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

298 
instantiate lift theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

299 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

300 
if t is of the form 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

301 
... ( Const(...,...) $ Abs( .... ) ) ... 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

302 
then 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

303 
P = %a. ... ( Const(...,...) $ a ) ... 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

304 
where a has type T > U 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

305 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

306 
Ts : types of parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

307 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

308 
the split theorem is applied to (see cmap) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

309 
T,U,pos : see mk_split_pack 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

310 
state : current proof state 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

311 
i : no. of subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

312 
**************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

313 

7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

314 
fun inst_lift Ts t (T, U, pos) state i = 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

315 
let 
22578  316 
val cert = cterm_of (Thm.theory_of_thm state); 
54216
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

317 
val (cntxt, u) = mk_cntxt t pos (T > U); 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

318 
val trlift' = Thm.lift_rule (Thm.cprem_of state i) 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

319 
(Thm.rename_boundvars abs_lift u trlift); 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

320 
val (P, _) = strip_comb (fst (Logic.dest_equals 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

321 
(Logic.strip_assums_concl (Thm.prop_of trlift')))); 
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

322 
in cterm_instantiate [(cert P, cert (abss Ts cntxt))] trlift' 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

323 
end; 
0  324 

325 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

326 
(************************************************************* 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

327 
instantiate split theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

328 

c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

329 
Ts : types of parameters 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

330 
t : lefthand side of metaequality in subgoal 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

331 
the split theorem is applied to (see cmap) 
4232  332 
tt : the term Const(key,..) $ ... 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

333 
thm : the split theorem 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

334 
TB : type of body of P(...) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

335 
state : current proof state 
4232  336 
i : number of subgoal 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

337 
**************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

338 

4232  339 
fun inst_split Ts t tt thm TB state i = 
17881  340 
let 
18145  341 
val thm' = Thm.lift_rule (Thm.cprem_of state i) thm; 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

342 
val (P, _) = strip_comb (fst (Logic.dest_equals 
22596  343 
(Logic.strip_assums_concl (Thm.prop_of thm')))); 
22578  344 
val cert = cterm_of (Thm.theory_of_thm state); 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

345 
val cntxt = mk_cntxt_splitthm t tt TB; 
33245  346 
in cterm_instantiate [(cert P, cert (abss Ts cntxt))] thm' 
4232  347 
end; 
1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

348 

7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

349 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

350 
(***************************************************************************** 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

351 
The splittactic 
17881  352 

1686
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

353 
splits : list of splittheorems to be tried 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

354 
i : number of subgoal the tactic should be applied to 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

355 
*****************************************************************************) 
c67d543bc395
Added functions mk_cntxt_splitthm and inst_split which instantiate
berghofe
parents:
1064
diff
changeset

356 

0  357 
fun split_tac [] i = no_tac 
358 
 split_tac splits i = 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

359 
let val cmap = cmap_of_split_thms splits 
54216
c0c453ce70a7
inst_lift now fully instantiates context to avoid problems with loose bound variables
berghofe
parents:
52131
diff
changeset

360 
fun lift_tac Ts t p st = compose_tac (false, inst_lift Ts t p st i, 2) i st 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

361 
fun lift_split_tac state = 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

362 
let val (Ts, t, splits) = select cmap state i 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

363 
in case splits of 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

364 
[] => no_tac state 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

365 
 (thm, apsns, pos, TB, tt)::_ => 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

366 
(case apsns of 
7672
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

367 
[] => compose_tac (false, inst_split Ts t tt thm TB state i, 0) i state 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

368 
 p::_ => EVERY [lift_tac Ts t p, 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

369 
rtac reflexive_thm (i+1), 
c092e67d12f8
 Fixed bug in mk_split_pack which caused application of expansion theorem
berghofe
parents:
6130
diff
changeset

370 
lift_split_tac] state) 
1030
1d8fa2fc4b9c
Completely rewrote split_tac. The old one failed in strange circumstances.
nipkow
parents:
943
diff
changeset

371 
end 
17881  372 
in COND (has_fewer_prems i) no_tac 
5304  373 
(rtac meta_iffD i THEN lift_split_tac) 
0  374 
end; 
375 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

376 
in (split_tac, exported_split_posns) end; (* mk_case_split_tac *) 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

377 

5304  378 

33242  379 
val (split_tac, split_posns) = mk_case_split_tac int_ord; 
4189  380 

33242  381 
val (split_inside_tac, _) = mk_case_split_tac (rev_order o int_ord); 
5304  382 

4189  383 

384 
(***************************************************************************** 

385 
The splittactic for premises 

17881  386 

4189  387 
splits : list of splittheorems to be tried 
5304  388 
****************************************************************************) 
33242  389 
fun split_asm_tac [] = K no_tac 
17881  390 
 split_asm_tac splits = 
5304  391 

13855
644692eca537
addsplits / delsplits no longer ignore type of constant.
berghofe
parents:
13157
diff
changeset

392 
let val cname_list = map (fst o fst o split_thm_info) splits; 
17881  393 
fun tac (t,i) = 
20664  394 
let val n = find_index (exists_Const (member (op =) cname_list o #1)) 
17881  395 
(Logic.strip_assums_hyp t); 
56245  396 
fun first_prem_is_disj (Const (@{const_name Pure.imp}, _) $ (Const (c, _) 
18545  397 
$ (Const (s, _) $ _ $ _ )) $ _ ) = c = const_Trueprop andalso s = const_or 
56245  398 
 first_prem_is_disj (Const(@{const_name Pure.all},_)$Abs(_,_,t)) = 
17881  399 
first_prem_is_disj t 
400 
 first_prem_is_disj _ = false; 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

401 
(* does not work properly if the split variable is bound by a quantifier *) 
17881  402 
fun flat_prems_tac i = SUBGOAL (fn (t,i) => 
403 
(if first_prem_is_disj t 

404 
then EVERY[etac Data.disjE i,rotate_tac ~1 i, 

405 
rotate_tac ~1 (i+1), 

406 
flat_prems_tac (i+1)] 

407 
else all_tac) 

408 
THEN REPEAT (eresolve_tac [Data.conjE,Data.exE] i) 

409 
THEN REPEAT (dresolve_tac [Data.notnotD] i)) i; 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

410 
in if n<0 then no_tac else (DETERM (EVERY' 
17881  411 
[rotate_tac n, etac Data.contrapos2, 
412 
split_tac splits, 

413 
rotate_tac ~1, etac Data.contrapos, rotate_tac ~1, 

20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
18988
diff
changeset

414 
flat_prems_tac] i)) 
17881  415 
end; 
4189  416 
in SUBGOAL tac 
417 
end; 

418 

10652  419 
fun gen_split_tac [] = K no_tac 
420 
 gen_split_tac (split::splits) = 

421 
let val (_,asm) = split_thm_info split 

422 
in (if asm then split_asm_tac else split_tac) [split] ORELSE' 

423 
gen_split_tac splits 

424 
end; 

8468  425 

18688  426 

8468  427 
(** declare split rules **) 
428 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
42367
diff
changeset

429 
(* add_split / del_split *) 
8468  430 

33242  431 
fun string_of_typ (Type (s, Ts)) = 
432 
(if null Ts then "" else enclose "(" ")" (commas (map string_of_typ Ts))) ^ s 

13859
adf68d9e5dec
split_name no longer uses Sign.string_of_typ to encode types, since
berghofe
parents:
13855
diff
changeset

433 
 string_of_typ _ = "_"; 
adf68d9e5dec
split_name no longer uses Sign.string_of_typ to encode types, since
berghofe
parents:
13855
diff
changeset

434 

17881  435 
fun split_name (name, T) asm = "split " ^ 
13859
adf68d9e5dec
split_name no longer uses Sign.string_of_typ to encode types, since
berghofe
parents:
13855
diff
changeset

436 
(if asm then "asm " else "") ^ name ^ " :: " ^ string_of_typ T; 
4189  437 

51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
45620
diff
changeset

438 
fun add_split split ctxt = 
33242  439 
let 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
42367
diff
changeset

440 
val (name, asm) = split_thm_info split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
42367
diff
changeset

441 
val tac = (if asm then split_asm_tac else split_tac) [split] 
52037  442 
in Simplifier.addloop (ctxt, (split_name name asm, K tac)) end; 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

443 

51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
45620
diff
changeset

444 
fun del_split split ctxt = 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
42367
diff
changeset

445 
let val (name, asm) = split_thm_info split 
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
45620
diff
changeset

446 
in Simplifier.delloop (ctxt, split_name name asm) end; 
1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

447 

8468  448 

449 
(* attributes *) 

450 

451 
val splitN = "split"; 

452 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
42367
diff
changeset

453 
val split_add = Simplifier.attrib add_split; 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
42367
diff
changeset

454 
val split_del = Simplifier.attrib del_split; 
8634  455 

456 

9703  457 
(* methods *) 
8468  458 

459 
val split_modifiers = 

58048
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
56245
diff
changeset

460 
[Args.$$$ splitN  Args.colon >> K (Method.modifier split_add @{here}), 
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
56245
diff
changeset

461 
Args.$$$ splitN  Args.add  Args.colon >> K (Method.modifier split_add @{here}), 
aa6296d09e0e
more explicit Method.modifier with reported position;
wenzelm
parents:
56245
diff
changeset

462 
Args.$$$ splitN  Args.del  Args.colon >> K (Method.modifier split_del @{here})]; 
8468  463 

464 

18688  465 
(* theory setup *) 
8468  466 

9703  467 
val setup = 
33242  468 
Attrib.setup @{binding split} 
469 
(Attrib.add_del split_add split_del) "declare case split rule" #> 

30722
623d4831c8cf
simplified attribute and method setup: eliminating bottomup styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30609
diff
changeset

470 
Method.setup @{binding split} 
623d4831c8cf
simplified attribute and method setup: eliminating bottomup styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30609
diff
changeset

471 
(Attrib.thms >> (fn ths => K (SIMPLE_METHOD' (CHANGED_PROP o gen_split_tac ths)))) 
623d4831c8cf
simplified attribute and method setup: eliminating bottomup styles makes it easier to keep things in one place, and also SML/NJ happy;
wenzelm
parents:
30609
diff
changeset

472 
"apply case split rule"; 
4189  473 

1721
445654b6cb95
Rewrote mk_cntxt_splitthm. Added function mk_case_split_inside_tac.
berghofe
parents:
1686
diff
changeset

474 
end; 