author  paulson 
Fri, 05 Oct 2007 09:59:03 +0200  
changeset 24854  0ebcd575d3c6 
parent 23780  a0e7305dd0cb 
child 26328  b2d6f520172c 
permissions  rwrr 
11519  1 
(* Title: Pure/proofterm.ML 
2 
ID: $Id$ 

11540  3 
Author: Stefan Berghofer, TU Muenchen 
11519  4 

11540  5 
LF style proof terms. 
11519  6 
*) 
7 

11615  8 
infix 8 % %% %>; 
11519  9 

10 
signature BASIC_PROOFTERM = 

11 
sig 

11543
d61b913431c5
renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents:
11540
diff
changeset

12 
val proofs: int ref 
11519  13 

14 
datatype proof = 

15 
PBound of int 

16 
 Abst of string * typ option * proof 

17 
 AbsP of string * term option * proof 

17756  18 
 % of proof * term option 
19 
 %% of proof * proof 

11519  20 
 Hyp of term 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

21 
 PThm of string * proof * term * typ list option 
11519  22 
 PAxm of string * term * typ list option 
23 
 Oracle of string * term * typ list option 

17017  24 
 MinProof of ((string * term) * proof) list * (string * term) list * (string * term) list; 
11519  25 

11615  26 
val %> : proof * term > proof 
11519  27 
end; 
28 

29 
signature PROOFTERM = 

30 
sig 

31 
include BASIC_PROOFTERM 

32 

33 
val infer_derivs : (proof > proof > proof) > bool * proof > bool * proof > bool * proof 

34 
val infer_derivs' : (proof > proof) > (bool * proof > bool * proof) 

35 

36 
(** primitive operations **) 

37 
val proof_combt : proof * term list > proof 

38 
val proof_combt' : proof * term option list > proof 

39 
val proof_combP : proof * proof list > proof 

40 
val strip_combt : proof > proof * term option list 

41 
val strip_combP : proof > proof * proof list 

42 
val strip_thm : proof > proof 

20000  43 
val map_proof_terms_option : (term > term option) > (typ > typ option) > proof > proof 
11519  44 
val map_proof_terms : (term > term) > (typ > typ) > proof > proof 
20147  45 
val fold_proof_terms : (term > 'a > 'a) > (typ > 'a > 'a) > proof > 'a > 'a 
20300  46 
val maxidx_proof : proof > int > int 
13744  47 
val size_of_proof : proof > int 
12907
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

48 
val change_type : typ list option > proof > proof 
11519  49 
val prf_abstract_over : term > proof > proof 
50 
val prf_incr_bv : int > int > int > int > proof > proof 

51 
val incr_pboundvars : int > int > proof > proof 

52 
val prf_loose_bvar1 : proof > int > bool 

53 
val prf_loose_Pbvar1 : proof > int > bool 

12279  54 
val prf_add_loose_bnos : int > int > proof > 
55 
int list * int list > int list * int list 

11519  56 
val norm_proof : Envir.env > proof > proof 
57 
val norm_proof' : Envir.env > proof > proof 

58 
val prf_subst_bounds : term list > proof > proof 

59 
val prf_subst_pbounds : proof list > proof > proof 

60 
val freeze_thaw_prf : proof > proof * (proof > proof) 

17017  61 
val proof_of_min_axm : string * term > proof 
62 
val proof_of_min_thm : (string * term) * proof > proof 

11519  63 

17017  64 
val thms_of_proof : proof > (term * proof) list Symtab.table > 
11519  65 
(term * proof) list Symtab.table 
19357
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

66 
val thms_of_proof' : proof > (term * proof) list Symtab.table > 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

67 
(term * proof) list Symtab.table 
17017  68 
val axms_of_proof : proof > proof Symtab.table > proof Symtab.table 
69 
val oracles_of_proof : (string * term) list > proof > (string * term) list 

11519  70 

71 
(** proof terms for specific inference rules **) 

72 
val implies_intr_proof : term > proof > proof 

73 
val forall_intr_proof : term > string > proof > proof 

15797  74 
val varify_proof : term > (string * sort) list > proof > proof 
11519  75 
val freezeT : term > proof > proof 
76 
val rotate_proof : term list > term > int > proof > proof 

77 
val permute_prems_prf : term list > int > int > proof > proof 

19908  78 
val generalize: string list * string list > int > proof > proof 
16880  79 
val instantiate : ((indexname * sort) * typ) list * ((indexname * typ) * term) list 
80 
> proof > proof 

11519  81 
val lift_proof : term > int > term > proof > proof 
82 
val assumption_proof : term list > term > int > proof > proof 

18485  83 
val bicompose_proof : bool > term list > term list > term list > term option > 
23296
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

84 
int > int > proof > proof > proof 
11519  85 
val equality_axms : (string * term) list 
86 
val reflexive_axm : proof 

87 
val symmetric_axm : proof 

88 
val transitive_axm : proof 

89 
val equal_intr_axm : proof 

90 
val equal_elim_axm : proof 

91 
val abstract_rule_axm : proof 

92 
val combination_axm : proof 

93 
val reflexive : proof 

94 
val symmetric : proof > proof 

95 
val transitive : term > typ > proof > proof > proof 

96 
val abstract_rule : term > string > proof > proof 

97 
val combination : term > term > term > term > typ > proof > proof > proof 

98 
val equal_intr : term > term > proof > proof > proof 

99 
val equal_elim : term > term > proof > proof > proof 

100 
val axm_proof : string > term > proof 

101 
val oracle_proof : string > term > proof 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

102 
val thm_proof : theory > string > term list > term > proof > proof 
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

103 
val get_name : term list > term > proof > string 
11519  104 

105 
(** rewriting on proof terms **) 

22662  106 
val add_prf_rrule : proof * proof > theory > theory 
107 
val add_prf_rproc : string * (Term.typ list > proof > proof option) > 

12233  108 
theory > theory 
17203  109 
val rewrite_proof : theory > (proof * proof) list * 
11519  110 
(string * (typ list > proof > proof option)) list > proof > proof 
11615  111 
val rewrite_proof_notypes : (proof * proof) list * 
112 
(string * (typ list > proof > proof option)) list > proof > proof 

23780
a0e7305dd0cb
Added function rew_proof (for prenormalizing proofs).
berghofe
parents:
23296
diff
changeset

113 
val rew_proof : theory > proof > proof 
11519  114 
end 
115 

116 
structure Proofterm : PROOFTERM = 

117 
struct 

118 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

119 
open Envir; 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

120 

11519  121 
datatype proof = 
122 
PBound of int 

123 
 Abst of string * typ option * proof 

124 
 AbsP of string * term option * proof 

12497  125 
 op % of proof * term option 
126 
 op %% of proof * proof 

11519  127 
 Hyp of term 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

128 
 PThm of string * proof * term * typ list option 
11519  129 
 PAxm of string * term * typ list option 
130 
 Oracle of string * term * typ list option 

17017  131 
 MinProof of ((string * term) * proof) list * (string * term) list * (string * term) list; 
11519  132 

17017  133 
fun proof_of_min_axm (s, prop) = PAxm (s, prop, NONE); 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

134 
fun proof_of_min_thm ((s, prop), prf) = PThm (s, prf, prop, NONE); 
17017  135 

136 
val string_term_ord = prod_ord fast_string_ord Term.fast_term_ord; 

137 

138 
fun oracles_of_proof oras prf = 

11519  139 
let 
17017  140 
fun oras_of (Abst (_, _, prf)) = oras_of prf 
141 
 oras_of (AbsP (_, _, prf)) = oras_of prf 

142 
 oras_of (prf % _) = oras_of prf 

143 
 oras_of (prf1 %% prf2) = oras_of prf1 #> oras_of prf2 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

144 
 oras_of (PThm (name, prf, prop, _)) = (fn tabs as (thms, oras) => 
17412  145 
case Symtab.lookup thms name of 
146 
NONE => oras_of prf (Symtab.update (name, [prop]) thms, oras) 

17492  147 
 SOME ps => if member (op =) ps prop then tabs else 
17412  148 
oras_of prf (Symtab.update (name, prop::ps) thms, oras)) 
17017  149 
 oras_of (Oracle (s, prop, _)) = 
150 
apsnd (OrdList.insert string_term_ord (s, prop)) 

151 
 oras_of (MinProof (thms, _, oras)) = 

152 
apsnd (OrdList.union string_term_ord oras) #> 

153 
fold (oras_of o proof_of_min_thm) thms 

154 
 oras_of _ = I 

11519  155 
in 
17017  156 
snd (oras_of prf (Symtab.empty, oras)) 
11519  157 
end; 
158 

17017  159 
fun thms_of_proof (Abst (_, _, prf)) = thms_of_proof prf 
160 
 thms_of_proof (AbsP (_, _, prf)) = thms_of_proof prf 

161 
 thms_of_proof (prf1 %% prf2) = thms_of_proof prf1 #> thms_of_proof prf2 

162 
 thms_of_proof (prf % _) = thms_of_proof prf 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

163 
 thms_of_proof (prf' as PThm (s, prf, prop, _)) = (fn tab => 
17412  164 
case Symtab.lookup tab s of 
165 
NONE => thms_of_proof prf (Symtab.update (s, [(prop, prf')]) tab) 

19304  166 
 SOME ps => if exists (fn (p, _) => p = prop) ps then tab else 
17412  167 
thms_of_proof prf (Symtab.update (s, (prop, prf')::ps) tab)) 
17017  168 
 thms_of_proof (MinProof (prfs, _, _)) = fold (thms_of_proof o proof_of_min_thm) prfs 
169 
 thms_of_proof _ = I; 

11519  170 

19357
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

171 
(* this version does not recursively descend into proofs of (named) theorems *) 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

172 
fun thms_of_proof' (Abst (_, _, prf)) = thms_of_proof' prf 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

173 
 thms_of_proof' (AbsP (_, _, prf)) = thms_of_proof' prf 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

174 
 thms_of_proof' (prf1 %% prf2) = thms_of_proof' prf1 #> thms_of_proof' prf2 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

175 
 thms_of_proof' (prf % _) = thms_of_proof' prf 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

176 
 thms_of_proof' (PThm ("", prf, prop, _)) = thms_of_proof' prf 
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

177 
 thms_of_proof' (prf' as PThm (s, _, prop, _)) = (fn tab => 
19357
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

178 
case Symtab.lookup tab s of 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

179 
NONE => Symtab.update (s, [(prop, prf')]) tab 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

180 
 SOME ps => if exists (fn (p, _) => p = prop) ps then tab else 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

181 
Symtab.update (s, (prop, prf')::ps) tab) 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

182 
 thms_of_proof' (MinProof (prfs, _, _)) = fold (thms_of_proof' o proof_of_min_thm) prfs 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

183 
 thms_of_proof' _ = I; 
dade85a75c9f
Added alternative version of thms_of_proof that does not recursively
berghofe
parents:
19304
diff
changeset

184 

17017  185 
fun axms_of_proof (Abst (_, _, prf)) = axms_of_proof prf 
186 
 axms_of_proof (AbsP (_, _, prf)) = axms_of_proof prf 

187 
 axms_of_proof (prf1 %% prf2) = axms_of_proof prf1 #> axms_of_proof prf2 

188 
 axms_of_proof (prf % _) = axms_of_proof prf 

17412  189 
 axms_of_proof (prf as PAxm (s, _, _)) = Symtab.update (s, prf) 
17017  190 
 axms_of_proof (MinProof (_, prfs, _)) = fold (axms_of_proof o proof_of_min_axm) prfs 
191 
 axms_of_proof _ = I; 

11519  192 

193 
(** collect all theorems, axioms and oracles **) 

194 

17017  195 
fun map3 f g h (thms, axms, oras) = (f thms, g axms, h oras); 
196 

197 
fun mk_min_proof (Abst (_, _, prf)) = mk_min_proof prf 

198 
 mk_min_proof (AbsP (_, _, prf)) = mk_min_proof prf 

199 
 mk_min_proof (prf % _) = mk_min_proof prf 

200 
 mk_min_proof (prf1 %% prf2) = mk_min_proof prf1 #> mk_min_proof prf2 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

201 
 mk_min_proof (PThm (s, prf, prop, _)) = 
17017  202 
map3 (OrdList.insert (string_term_ord o pairself fst) ((s, prop), prf)) I I 
203 
 mk_min_proof (PAxm (s, prop, _)) = 

204 
map3 I (OrdList.insert string_term_ord (s, prop)) I 

205 
 mk_min_proof (Oracle (s, prop, _)) = 

206 
map3 I I (OrdList.insert string_term_ord (s, prop)) 

207 
 mk_min_proof (MinProof (thms, axms, oras)) = 

208 
map3 (OrdList.union (string_term_ord o pairself fst) thms) 

209 
(OrdList.union string_term_ord axms) (OrdList.union string_term_ord oras) 

210 
 mk_min_proof _ = I; 

11519  211 

212 
(** proof objects with different levels of detail **) 

213 

11543
d61b913431c5
renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents:
11540
diff
changeset

214 
val proofs = ref 2; 
11519  215 

11543
d61b913431c5
renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents:
11540
diff
changeset

216 
fun err_illegal_level i = 
d61b913431c5
renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents:
11540
diff
changeset

217 
error ("Illegal level of detail for proof objects: " ^ string_of_int i); 
11519  218 

219 
fun if_ora b = if b then oracles_of_proof else K; 

19222  220 
val min_proof = MinProof ([], [], []); 
11519  221 

222 
fun infer_derivs f (ora1, prf1) (ora2, prf2) = 

19222  223 
let val ora = ora1 orelse ora2 in 
224 
(ora, 

225 
case !proofs of 

226 
2 => f prf1 prf2 

227 
 1 => MinProof (([], [], []) > mk_min_proof prf1 > mk_min_proof prf2) 

228 
 0 => if ora then MinProof ([], [], if_ora ora2 (if_ora ora1 [] prf1) prf2) else min_proof 

229 
 i => err_illegal_level i) 

230 
end; 

11519  231 

19222  232 
fun infer_derivs' f = infer_derivs (K f) (false, min_proof); 
11519  233 

15531  234 
fun (prf %> t) = prf % SOME t; 
11519  235 

15570  236 
val proof_combt = Library.foldl (op %>); 
237 
val proof_combt' = Library.foldl (op %); 

238 
val proof_combP = Library.foldl (op %%); 

11519  239 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

240 
fun strip_combt prf = 
11615  241 
let fun stripc (prf % t, ts) = stripc (prf, t::ts) 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

242 
 stripc x = x 
11519  243 
in stripc (prf, []) end; 
244 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

245 
fun strip_combP prf = 
11615  246 
let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs) 
11519  247 
 stripc x = x 
248 
in stripc (prf, []) end; 

249 

250 
fun strip_thm prf = (case strip_combt (fst (strip_combP prf)) of 

251 
(PThm (_, prf', _, _), _) => prf' 

252 
 _ => prf); 

253 

23178  254 
val mk_Abst = fold_rev (fn (s, T:typ) => fn prf => Abst (s, NONE, prf)); 
15531  255 
fun mk_AbsP (i, prf) = funpow i (fn prf => AbsP ("H", NONE, prf)) prf; 
11519  256 

20000  257 
fun apsome f NONE = raise SAME 
258 
 apsome f (SOME x) = (case f x of NONE => raise SAME  some => some); 

259 

15531  260 
fun apsome' f NONE = raise SAME 
261 
 apsome' f (SOME x) = SOME (f x); 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

262 

20000  263 
fun map_proof_terms_option f g = 
264 
let 

265 
fun map_typs (T :: Ts) = 

266 
(case g T of 

267 
NONE => T :: map_typs Ts 

268 
 SOME T' => T' :: (map_typs Ts handle SAME => Ts)) 

269 
 map_typs [] = raise SAME; 

270 

271 
fun mapp (Abst (s, T, prf)) = (Abst (s, apsome g T, mapph prf) 

272 
handle SAME => Abst (s, T, mapp prf)) 

273 
 mapp (AbsP (s, t, prf)) = (AbsP (s, apsome f t, mapph prf) 

274 
handle SAME => AbsP (s, t, mapp prf)) 

275 
 mapp (prf % t) = (mapp prf % (apsome f t handle SAME => t) 

276 
handle SAME => prf % apsome f t) 

277 
 mapp (prf1 %% prf2) = (mapp prf1 %% mapph prf2 

278 
handle SAME => prf1 %% mapp prf2) 

279 
 mapp (PThm (a, prf, prop, SOME Ts)) = 

280 
PThm (a, prf, prop, SOME (map_typs Ts)) 

281 
 mapp (PAxm (a, prop, SOME Ts)) = 

282 
PAxm (a, prop, SOME (map_typs Ts)) 

283 
 mapp _ = raise SAME 

284 
and mapph prf = (mapp prf handle SAME => prf) 

285 

286 
in mapph end; 

287 

22662  288 
fun same eq f x = 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

289 
let val x' = f x 
22662  290 
in if eq (x, x') then raise SAME else x' end; 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

291 

592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

292 
fun map_proof_terms f g = 
20000  293 
map_proof_terms_option 
22662  294 
(fn t => SOME (same (op =) f t) handle SAME => NONE) 
295 
(fn T => SOME (same (op =) g T) handle SAME => NONE); 

11519  296 

20147  297 
fun fold_proof_terms f g (Abst (_, SOME T, prf)) = g T #> fold_proof_terms f g prf 
298 
 fold_proof_terms f g (Abst (_, NONE, prf)) = fold_proof_terms f g prf 

299 
 fold_proof_terms f g (AbsP (_, SOME t, prf)) = f t #> fold_proof_terms f g prf 

300 
 fold_proof_terms f g (AbsP (_, NONE, prf)) = fold_proof_terms f g prf 

301 
 fold_proof_terms f g (prf % SOME t) = fold_proof_terms f g prf #> f t 

302 
 fold_proof_terms f g (prf % NONE) = fold_proof_terms f g prf 

303 
 fold_proof_terms f g (prf1 %% prf2) = 

304 
fold_proof_terms f g prf1 #> fold_proof_terms f g prf2 

20159  305 
 fold_proof_terms _ g (PThm (_, _, _, SOME Ts)) = fold g Ts 
306 
 fold_proof_terms _ g (PAxm (_, _, SOME Ts)) = fold g Ts 

20147  307 
 fold_proof_terms _ _ _ = I; 
11519  308 

20300  309 
fun maxidx_proof prf = fold_proof_terms Term.maxidx_term Term.maxidx_typ prf; 
12868  310 

13744  311 
fun size_of_proof (Abst (_, _, prf)) = 1 + size_of_proof prf 
13749  312 
 size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf 
13744  313 
 size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2 
13749  314 
 size_of_proof (prf % _) = 1 + size_of_proof prf 
13744  315 
 size_of_proof _ = 1; 
316 

12907
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

317 
fun change_type opTs (PThm (name, prf, prop, _)) = PThm (name, prf, prop, opTs) 
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

318 
 change_type opTs (PAxm (name, prop, _)) = PAxm (name, prop, opTs) 
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

319 
 change_type opTs (Oracle (name, prop, _)) = Oracle (name, prop, opTs) 
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

320 
 change_type _ prf = prf; 
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

321 

11519  322 

323 
(***** utilities *****) 

324 

325 
fun strip_abs (_::Ts) (Abs (_, _, t)) = strip_abs Ts t 

326 
 strip_abs _ t = t; 

327 

15570  328 
fun mk_abs Ts t = Library.foldl (fn (t', T) => Abs ("", T, t')) (t, Ts); 
11519  329 

330 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

331 
(*Abstraction of a proof term over its occurrences of v, 
11519  332 
which must contain no loose bound variables. 
333 
The resulting proof term is ready to become the body of an Abst.*) 

334 

335 
fun prf_abstract_over v = 

336 
let 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

337 
fun abst' lev u = if v aconv u then Bound lev else 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

338 
(case u of 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

339 
Abs (a, T, t) => Abs (a, T, abst' (lev + 1) t) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

340 
 f $ t => (abst' lev f $ absth' lev t handle SAME => f $ abst' lev t) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

341 
 _ => raise SAME) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

342 
and absth' lev t = (abst' lev t handle SAME => t); 
11519  343 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

344 
fun abst lev (AbsP (a, t, prf)) = 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

345 
(AbsP (a, apsome' (abst' lev) t, absth lev prf) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

346 
handle SAME => AbsP (a, t, abst lev prf)) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

347 
 abst lev (Abst (a, T, prf)) = Abst (a, T, abst (lev + 1) prf) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

348 
 abst lev (prf1 %% prf2) = (abst lev prf1 %% absth lev prf2 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

349 
handle SAME => prf1 %% abst lev prf2) 
15570  350 
 abst lev (prf % t) = (abst lev prf % Option.map (absth' lev) t 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

351 
handle SAME => prf % apsome' (abst' lev) t) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

352 
 abst _ _ = raise SAME 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

353 
and absth lev prf = (abst lev prf handle SAME => prf) 
11519  354 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

355 
in absth 0 end; 
11519  356 

357 

358 
(*increments a proof term's nonlocal bound variables 

359 
required when moving a proof term within abstractions 

360 
inc is increment for bound variables 

361 
lev is level at which a bound variable is considered 'loose'*) 

362 

363 
fun incr_bv' inct tlev t = incr_bv (inct, tlev, t); 

364 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

365 
fun prf_incr_bv' incP inct Plev tlev (PBound i) = 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

366 
if i >= Plev then PBound (i+incP) else raise SAME 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

367 
 prf_incr_bv' incP inct Plev tlev (AbsP (a, t, body)) = 
22662  368 
(AbsP (a, apsome' (same (op =) (incr_bv' inct tlev)) t, 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

369 
prf_incr_bv incP inct (Plev+1) tlev body) handle SAME => 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

370 
AbsP (a, t, prf_incr_bv' incP inct (Plev+1) tlev body)) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

371 
 prf_incr_bv' incP inct Plev tlev (Abst (a, T, body)) = 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

372 
Abst (a, T, prf_incr_bv' incP inct Plev (tlev+1) body) 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

373 
 prf_incr_bv' incP inct Plev tlev (prf %% prf') = 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

374 
(prf_incr_bv' incP inct Plev tlev prf %% prf_incr_bv incP inct Plev tlev prf' 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

375 
handle SAME => prf %% prf_incr_bv' incP inct Plev tlev prf') 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

376 
 prf_incr_bv' incP inct Plev tlev (prf % t) = 
15570  377 
(prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t 
22662  378 
handle SAME => prf % apsome' (same (op =) (incr_bv' inct tlev)) t) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

379 
 prf_incr_bv' _ _ _ _ _ = raise SAME 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

380 
and prf_incr_bv incP inct Plev tlev prf = 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

381 
(prf_incr_bv' incP inct Plev tlev prf handle SAME => prf); 
11519  382 

383 
fun incr_pboundvars 0 0 prf = prf 

384 
 incr_pboundvars incP inct prf = prf_incr_bv incP inct 0 0 prf; 

385 

386 

11615  387 
fun prf_loose_bvar1 (prf1 %% prf2) k = prf_loose_bvar1 prf1 k orelse prf_loose_bvar1 prf2 k 
15531  388 
 prf_loose_bvar1 (prf % SOME t) k = prf_loose_bvar1 prf k orelse loose_bvar1 (t, k) 
389 
 prf_loose_bvar1 (_ % NONE) _ = true 

390 
 prf_loose_bvar1 (AbsP (_, SOME t, prf)) k = loose_bvar1 (t, k) orelse prf_loose_bvar1 prf k 

391 
 prf_loose_bvar1 (AbsP (_, NONE, _)) k = true 

11519  392 
 prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1) 
393 
 prf_loose_bvar1 _ _ = false; 

394 

395 
fun prf_loose_Pbvar1 (PBound i) k = i = k 

11615  396 
 prf_loose_Pbvar1 (prf1 %% prf2) k = prf_loose_Pbvar1 prf1 k orelse prf_loose_Pbvar1 prf2 k 
397 
 prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k 

11519  398 
 prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1) 
399 
 prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k 

400 
 prf_loose_Pbvar1 _ _ = false; 

401 

12279  402 
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) = 
17492  403 
if i < plev then (is, js) else (insert (op =) (iplev) is, js) 
12279  404 
 prf_add_loose_bnos plev tlev (prf1 %% prf2) p = 
405 
prf_add_loose_bnos plev tlev prf2 

406 
(prf_add_loose_bnos plev tlev prf1 p) 

407 
 prf_add_loose_bnos plev tlev (prf % opt) (is, js) = 

408 
prf_add_loose_bnos plev tlev prf (case opt of 

17492  409 
NONE => (is, insert (op =) ~1 js) 
15531  410 
 SOME t => (is, add_loose_bnos (t, tlev, js))) 
12279  411 
 prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) = 
412 
prf_add_loose_bnos (plev+1) tlev prf (case opt of 

17492  413 
NONE => (is, insert (op =) ~1 js) 
15531  414 
 SOME t => (is, add_loose_bnos (t, tlev, js))) 
12279  415 
 prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p = 
416 
prf_add_loose_bnos plev (tlev+1) prf p 

417 
 prf_add_loose_bnos _ _ _ _ = ([], []); 

418 

11519  419 

420 
(**** substitutions ****) 

421 

20509  422 
fun del_conflicting_tvars envT T = TermSubst.instantiateT 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19357
diff
changeset

423 
(map_filter (fn ixnS as (_, S) => 
18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

424 
(Type.lookup (envT, ixnS); NONE) handle TYPE _ => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

425 
SOME (ixnS, TFree ("'dummy", S))) (typ_tvars T)) T; 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

426 

20509  427 
fun del_conflicting_vars env t = TermSubst.instantiate 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19357
diff
changeset

428 
(map_filter (fn ixnS as (_, S) => 
18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

429 
(Type.lookup (type_env env, ixnS); NONE) handle TYPE _ => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

430 
SOME (ixnS, TFree ("'dummy", S))) (term_tvars t), 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19357
diff
changeset

431 
map_filter (fn Var (ixnT as (_, T)) => 
18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

432 
(Envir.lookup (env, ixnT); NONE) handle TYPE _ => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

433 
SOME (ixnT, Free ("dummy", T))) (term_vars t)) t; 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

434 

11519  435 
fun norm_proof env = 
436 
let 

12497  437 
val envT = type_env env; 
18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

438 
fun msg s = warning ("type conflict in norm_proof:\n" ^ s); 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

439 
fun htype f t = f env t handle TYPE (s, _, _) => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

440 
(msg s; f env (del_conflicting_vars env t)); 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

441 
fun htypeT f T = f envT T handle TYPE (s, _, _) => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

442 
(msg s; f envT (del_conflicting_tvars envT T)); 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

443 
fun htypeTs f Ts = f envT Ts handle TYPE (s, _, _) => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

444 
(msg s; f envT (map (del_conflicting_tvars envT) Ts)); 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

445 
fun norm (Abst (s, T, prf)) = (Abst (s, apsome' (htypeT norm_type_same) T, normh prf) 
11519  446 
handle SAME => Abst (s, T, norm prf)) 
18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

447 
 norm (AbsP (s, t, prf)) = (AbsP (s, apsome' (htype norm_term_same) t, normh prf) 
11519  448 
handle SAME => AbsP (s, t, norm prf)) 
18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

449 
 norm (prf % t) = (norm prf % Option.map (htype norm_term) t 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

450 
handle SAME => prf % apsome' (htype norm_term_same) t) 
11615  451 
 norm (prf1 %% prf2) = (norm prf1 %% normh prf2 
452 
handle SAME => prf1 %% norm prf2) 

18316
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

453 
 norm (PThm (s, prf, t, Ts)) = PThm (s, prf, t, apsome' (htypeTs norm_types_same) Ts) 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

454 
 norm (PAxm (s, prop, Ts)) = PAxm (s, prop, apsome' (htypeTs norm_types_same) Ts) 
11519  455 
 norm _ = raise SAME 
456 
and normh prf = (norm prf handle SAME => prf); 

457 
in normh end; 

458 

459 
(***** Remove some types in proof term (to save space) *****) 

460 

461 
fun remove_types (Abs (s, _, t)) = Abs (s, dummyT, remove_types t) 

462 
 remove_types (t $ u) = remove_types t $ remove_types u 

463 
 remove_types (Const (s, _)) = Const (s, dummyT) 

464 
 remove_types t = t; 

465 

466 
fun remove_types_env (Envir.Envir {iTs, asol, maxidx}) = 

15797  467 
Envir.Envir {iTs = iTs, asol = Vartab.map (apsnd remove_types) asol, 
468 
maxidx = maxidx}; 

11519  469 

470 
fun norm_proof' env prf = norm_proof (remove_types_env env) prf; 

471 

472 
(**** substitution of bound variables ****) 

473 

474 
fun prf_subst_bounds args prf = 

475 
let 

476 
val n = length args; 

477 
fun subst' lev (Bound i) = 

478 
(if i<lev then raise SAME (*var is locally bound*) 

479 
else incr_boundvars lev (List.nth (args, ilev)) 

480 
handle Subscript => Bound (in) (*loose: change it*)) 

481 
 subst' lev (Abs (a, T, body)) = Abs (a, T, subst' (lev+1) body) 

482 
 subst' lev (f $ t) = (subst' lev f $ substh' lev t 

483 
handle SAME => f $ subst' lev t) 

484 
 subst' _ _ = raise SAME 

485 
and substh' lev t = (subst' lev t handle SAME => t); 

486 

487 
fun subst lev (AbsP (a, t, body)) = (AbsP (a, apsome' (subst' lev) t, substh lev body) 

488 
handle SAME => AbsP (a, t, subst lev body)) 

489 
 subst lev (Abst (a, T, body)) = Abst (a, T, subst (lev+1) body) 

11615  490 
 subst lev (prf %% prf') = (subst lev prf %% substh lev prf' 
491 
handle SAME => prf %% subst lev prf') 

15570  492 
 subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t 
11615  493 
handle SAME => prf % apsome' (subst' lev) t) 
11519  494 
 subst _ _ = raise SAME 
495 
and substh lev prf = (subst lev prf handle SAME => prf) 

496 
in case args of [] => prf  _ => substh 0 prf end; 

497 

498 
fun prf_subst_pbounds args prf = 

499 
let 

500 
val n = length args; 

501 
fun subst (PBound i) Plev tlev = 

20147  502 
(if i < Plev then raise SAME (*var is locally bound*) 
11519  503 
else incr_pboundvars Plev tlev (List.nth (args, iPlev)) 
504 
handle Subscript => PBound (in) (*loose: change it*)) 

505 
 subst (AbsP (a, t, body)) Plev tlev = AbsP (a, t, subst body (Plev+1) tlev) 

506 
 subst (Abst (a, T, body)) Plev tlev = Abst (a, T, subst body Plev (tlev+1)) 

11615  507 
 subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev 
508 
handle SAME => prf %% subst prf' Plev tlev) 

509 
 subst (prf % t) Plev tlev = subst prf Plev tlev % t 

11519  510 
 subst prf _ _ = raise SAME 
511 
and substh prf Plev tlev = (subst prf Plev tlev handle SAME => prf) 

512 
in case args of [] => prf  _ => substh prf 0 0 end; 

513 

514 

515 
(**** Freezing and thawing of variables in proof terms ****) 

516 

517 
fun frzT names = 

17325  518 
map_type_tvar (fn (ixn, xs) => TFree ((the o AList.lookup (op =) names) ixn, xs)); 
11519  519 

520 
fun thawT names = 

17325  521 
map_type_tfree (fn (s, xs) => case AList.lookup (op =) names s of 
15531  522 
NONE => TFree (s, xs) 
523 
 SOME ixn => TVar (ixn, xs)); 

11519  524 

525 
fun freeze names names' (t $ u) = 

526 
freeze names names' t $ freeze names names' u 

527 
 freeze names names' (Abs (s, T, t)) = 

528 
Abs (s, frzT names' T, freeze names names' t) 

529 
 freeze names names' (Const (s, T)) = Const (s, frzT names' T) 

530 
 freeze names names' (Free (s, T)) = Free (s, frzT names' T) 

531 
 freeze names names' (Var (ixn, T)) = 

17325  532 
Free ((the o AList.lookup (op =) names) ixn, frzT names' T) 
11519  533 
 freeze names names' t = t; 
534 

535 
fun thaw names names' (t $ u) = 

536 
thaw names names' t $ thaw names names' u 

537 
 thaw names names' (Abs (s, T, t)) = 

538 
Abs (s, thawT names' T, thaw names names' t) 

539 
 thaw names names' (Const (s, T)) = Const (s, thawT names' T) 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

540 
 thaw names names' (Free (s, T)) = 
11519  541 
let val T' = thawT names' T 
17325  542 
in case AList.lookup (op =) names s of 
15531  543 
NONE => Free (s, T') 
544 
 SOME ixn => Var (ixn, T') 

11519  545 
end 
546 
 thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T) 

547 
 thaw names names' t = t; 

548 

549 
fun freeze_thaw_prf prf = 

550 
let 

551 
val (fs, Tfs, vs, Tvs) = fold_proof_terms 

20147  552 
(fn t => fn (fs, Tfs, vs, Tvs) => 
11519  553 
(add_term_frees (t, fs), add_term_tfree_names (t, Tfs), 
554 
add_term_vars (t, vs), add_term_tvar_ixns (t, Tvs))) 

20147  555 
(fn T => fn (fs, Tfs, vs, Tvs) => 
11519  556 
(fs, add_typ_tfree_names (T, Tfs), 
557 
vs, add_typ_ixns (Tvs, T))) 

20147  558 
prf ([], [], [], []); 
11519  559 
val fs' = map (fst o dest_Free) fs; 
560 
val vs' = map (fst o dest_Var) vs; 

20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20000
diff
changeset

561 
val names = vs' ~~ Name.variant_list fs' (map fst vs'); 
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20000
diff
changeset

562 
val names' = Tvs ~~ Name.variant_list Tfs (map fst Tvs); 
11519  563 
val rnames = map swap names; 
564 
val rnames' = map swap names'; 

565 
in 

566 
(map_proof_terms (freeze names names') (frzT names') prf, 

567 
map_proof_terms (thaw rnames rnames') (thawT rnames')) 

568 
end; 

569 

570 

571 
(***** implication introduction *****) 

572 

573 
fun implies_intr_proof h prf = 

574 
let 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

575 
fun abshyp i (Hyp t) = if h aconv t then PBound i else raise SAME 
11519  576 
 abshyp i (Abst (s, T, prf)) = Abst (s, T, abshyp i prf) 
577 
 abshyp i (AbsP (s, t, prf)) = AbsP (s, t, abshyp (i+1) prf) 

11615  578 
 abshyp i (prf % t) = abshyp i prf % t 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

579 
 abshyp i (prf1 %% prf2) = (abshyp i prf1 %% abshyph i prf2 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

580 
handle SAME => prf1 %% abshyp i prf2) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

581 
 abshyp _ _ = raise SAME 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

582 
and abshyph i prf = (abshyp i prf handle SAME => prf) 
11519  583 
in 
15531  584 
AbsP ("H", NONE (*h*), abshyph 0 prf) 
11519  585 
end; 
586 

587 

588 
(***** forall introduction *****) 

589 

15531  590 
fun forall_intr_proof x a prf = Abst (a, NONE, prf_abstract_over x prf); 
11519  591 

592 

593 
(***** varify *****) 

594 

595 
fun varify_proof t fixed prf = 

596 
let 

19304  597 
val fs = Term.fold_types (Term.fold_atyps 
598 
(fn TFree v => if member (op =) fixed v then I else insert (op =) v  _ => I)) t []; 

11519  599 
val ixns = add_term_tvar_ixns (t, []); 
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20000
diff
changeset

600 
val fmap = fs ~~ Name.variant_list (map #1 ixns) (map fst fs) 
11519  601 
fun thaw (f as (a, S)) = 
17314  602 
(case AList.lookup (op =) fmap f of 
15531  603 
NONE => TFree f 
604 
 SOME b => TVar ((b, 0), S)); 

20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20509
diff
changeset

605 
in map_proof_terms (map_types (map_type_tfree thaw)) (map_type_tfree thaw) prf 
11519  606 
end; 
607 

608 

609 
local 

610 

611 
fun new_name (ix, (pairs,used)) = 

20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20000
diff
changeset

612 
let val v = Name.variant used (string_of_indexname ix) 
11519  613 
in ((ix, v) :: pairs, v :: used) end; 
614 

17325  615 
fun freeze_one alist (ix, sort) = (case AList.lookup (op =) alist ix of 
15531  616 
NONE => TVar (ix, sort) 
617 
 SOME name => TFree (name, sort)); 

11519  618 

619 
in 

620 

621 
fun freezeT t prf = 

622 
let 

623 
val used = it_term_types add_typ_tfree_names (t, []) 

624 
and tvars = map #1 (it_term_types add_typ_tvars (t, [])); 

23178  625 
val (alist, _) = List.foldr new_name ([], used) tvars; 
11519  626 
in 
627 
(case alist of 

628 
[] => prf (*nothing to do!*) 

629 
 _ => 

630 
let val frzT = map_type_tvar (freeze_one alist) 

20548
8ef25fe585a8
renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents:
20509
diff
changeset

631 
in map_proof_terms (map_types frzT) frzT prf end) 
11519  632 
end; 
633 

634 
end; 

635 

636 

637 
(***** rotate assumptions *****) 

638 

639 
fun rotate_proof Bs Bi m prf = 

640 
let 

641 
val params = Term.strip_all_vars Bi; 

642 
val asms = Logic.strip_imp_prems (Term.strip_all_body Bi); 

643 
val i = length asms; 

644 
val j = length Bs; 

645 
in 

646 
mk_AbsP (j+1, proof_combP (prf, map PBound 

23178  647 
(j downto 1) @ [mk_Abst params (mk_AbsP (i, 
11519  648 
proof_combP (proof_combt (PBound i, map Bound ((length params  1) downto 0)), 
23178  649 
map PBound (((im1) downto 0) @ ((i1) downto (im))))))])) 
11519  650 
end; 
651 

652 

653 
(***** permute premises *****) 

654 

655 
fun permute_prems_prf prems j k prf = 

656 
let val n = length prems 

657 
in mk_AbsP (n, proof_combP (prf, 

658 
map PBound ((n1 downto nj) @ (k1 downto 0) @ (nj1 downto k)))) 

659 
end; 

660 

661 

19908  662 
(***** generalization *****) 
663 

20000  664 
fun generalize (tfrees, frees) idx = 
665 
map_proof_terms_option 

20509  666 
(TermSubst.generalize_option (tfrees, frees) idx) 
667 
(TermSubst.generalizeT_option tfrees idx); 

19908  668 

669 

11519  670 
(***** instantiation *****) 
671 

20000  672 
fun instantiate (instT, inst) = 
673 
map_proof_terms_option 

20509  674 
(TermSubst.instantiate_option (instT, map (apsnd remove_types) inst)) 
675 
(TermSubst.instantiateT_option instT); 

11519  676 

677 

678 
(***** lifting *****) 

679 

680 
fun lift_proof Bi inc prop prf = 

681 
let 

682 
fun lift'' Us Ts t = strip_abs Ts (Logic.incr_indexes (Us, inc) (mk_abs Ts t)); 

683 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

684 
fun lift' Us Ts (Abst (s, T, prf)) = 
22662  685 
(Abst (s, apsome' (same (op =) (Logic.incr_tvar inc)) T, lifth' Us (dummyT::Ts) prf) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

686 
handle SAME => Abst (s, T, lift' Us (dummyT::Ts) prf)) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

687 
 lift' Us Ts (AbsP (s, t, prf)) = 
22662  688 
(AbsP (s, apsome' (same (op =) (lift'' Us Ts)) t, lifth' Us Ts prf) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

689 
handle SAME => AbsP (s, t, lift' Us Ts prf)) 
15570  690 
 lift' Us Ts (prf % t) = (lift' Us Ts prf % Option.map (lift'' Us Ts) t 
22662  691 
handle SAME => prf % apsome' (same (op =) (lift'' Us Ts)) t) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

692 
 lift' Us Ts (prf1 %% prf2) = (lift' Us Ts prf1 %% lifth' Us Ts prf2 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

693 
handle SAME => prf1 %% lift' Us Ts prf2) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

694 
 lift' _ _ (PThm (s, prf, prop, Ts)) = 
22662  695 
PThm (s, prf, prop, apsome' (same (op =) (map (Logic.incr_tvar inc))) Ts) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

696 
 lift' _ _ (PAxm (s, prop, Ts)) = 
22662  697 
PAxm (s, prop, apsome' (same (op =) (map (Logic.incr_tvar inc))) Ts) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

698 
 lift' _ _ _ = raise SAME 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

699 
and lifth' Us Ts prf = (lift' Us Ts prf handle SAME => prf); 
11519  700 

18030  701 
val ps = map (Logic.lift_all inc Bi) (Logic.strip_imp_prems prop); 
11519  702 
val k = length ps; 
703 

23178  704 
fun mk_app b (i, j, prf) = 
11615  705 
if b then (i1, j, prf %% PBound i) else (i, j1, prf %> Bound j); 
11519  706 

707 
fun lift Us bs i j (Const ("==>", _) $ A $ B) = 

20147  708 
AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B) 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

709 
 lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) = 
20147  710 
Abst (a, NONE (*T*), lift (T::Us) (false::bs) i (j+1) t) 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

711 
 lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf, 
23178  712 
map (fn k => (#3 (fold_rev mk_app bs (i1, j1, PBound k)))) 
11519  713 
(i + k  1 downto i)); 
714 
in 

715 
mk_AbsP (k, lift [] [] 0 0 Bi) 

716 
end; 

717 

718 

719 
(***** proof by assumption *****) 

720 

23296
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

721 
fun mk_asm_prf t i m = 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

722 
let 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

723 
fun imp_prf _ i 0 = PBound i 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

724 
 imp_prf (Const ("==>", _) $ A $ B) i m = AbsP ("H", NONE (*A*), imp_prf B (i+1) (m1)) 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

725 
 imp_prf _ i _ = PBound i; 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

726 
fun all_prf (Const ("all", _) $ Abs (a, T, t)) = Abst (a, NONE (*T*), all_prf t) 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

727 
 all_prf t = imp_prf t (~i) m 
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

728 
in all_prf t end; 
11519  729 

730 
fun assumption_proof Bs Bi n prf = 

731 
mk_AbsP (length Bs, proof_combP (prf, 

23296
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

732 
map PBound (length Bs  1 downto 0) @ [mk_asm_prf Bi n ~1])); 
11519  733 

734 

735 
(***** Composition of object rule with proof state *****) 

736 

737 
fun flatten_params_proof i j n (Const ("==>", _) $ A $ B, k) = 

15531  738 
AbsP ("H", NONE (*A*), flatten_params_proof (i+1) j n (B, k)) 
11519  739 
 flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) = 
15531  740 
Abst (a, NONE (*T*), flatten_params_proof i (j+1) n (t, k)) 
11519  741 
 flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i), 
19304  742 
map Bound (j1 downto 0)), map PBound (remove (op =) (in) (i1 downto 0))); 
11519  743 

23296
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

744 
fun bicompose_proof flatten Bs oldAs newAs A n m rprf sprf = 
11519  745 
let 
746 
val la = length newAs; 

747 
val lb = length Bs; 

748 
in 

749 
mk_AbsP (lb+la, proof_combP (sprf, 

11615  750 
map PBound (lb + la  1 downto la)) %% 
23296
25f28f9c28a3
Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents:
23178
diff
changeset

751 
proof_combP (rprf, (if n>0 then [mk_asm_prf (the A) n m] else []) @ 
18485  752 
map (if flatten then flatten_params_proof 0 0 n else PBound o snd) 
753 
(oldAs ~~ (la  1 downto 0)))) 

11519  754 
end; 
755 

756 

757 
(***** axioms for equality *****) 

758 

14854  759 
val aT = TFree ("'a", []); 
760 
val bT = TFree ("'b", []); 

11519  761 
val x = Free ("x", aT); 
762 
val y = Free ("y", aT); 

763 
val z = Free ("z", aT); 

764 
val A = Free ("A", propT); 

765 
val B = Free ("B", propT); 

766 
val f = Free ("f", aT > bT); 

767 
val g = Free ("g", aT > bT); 

768 

769 
local open Logic in 

770 

771 
val equality_axms = 

772 
[("reflexive", mk_equals (x, x)), 

773 
("symmetric", mk_implies (mk_equals (x, y), mk_equals (y, x))), 

774 
("transitive", list_implies ([mk_equals (x, y), mk_equals (y, z)], mk_equals (x, z))), 

775 
("equal_intr", list_implies ([mk_implies (A, B), mk_implies (B, A)], mk_equals (A, B))), 

776 
("equal_elim", list_implies ([mk_equals (A, B), A], B)), 

777 
("abstract_rule", Logic.mk_implies 

778 
(all aT $ Abs ("x", aT, equals bT $ (f $ Bound 0) $ (g $ Bound 0)), 

779 
equals (aT > bT) $ 

780 
Abs ("x", aT, f $ Bound 0) $ Abs ("x", aT, g $ Bound 0))), 

781 
("combination", Logic.list_implies 

782 
([Logic.mk_equals (f, g), Logic.mk_equals (x, y)], 

783 
Logic.mk_equals (f $ x, g $ y)))]; 

784 

785 
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm, 

786 
equal_elim_axm, abstract_rule_axm, combination_axm] = 

15531  787 
map (fn (s, t) => PAxm ("ProtoPure." ^ s, varify t, NONE)) equality_axms; 
11519  788 

789 
end; 

790 

15531  791 
val reflexive = reflexive_axm % NONE; 
11519  792 

11615  793 
fun symmetric (prf as PAxm ("ProtoPure.reflexive", _, _) % _) = prf 
15531  794 
 symmetric prf = symmetric_axm % NONE % NONE %% prf; 
11519  795 

11615  796 
fun transitive _ _ (PAxm ("ProtoPure.reflexive", _, _) % _) prf2 = prf2 
797 
 transitive _ _ prf1 (PAxm ("ProtoPure.reflexive", _, _) % _) = prf1 

11519  798 
 transitive u (Type ("prop", [])) prf1 prf2 = 
15531  799 
transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2 
11519  800 
 transitive u T prf1 prf2 = 
15531  801 
transitive_axm % NONE % NONE % NONE %% prf1 %% prf2; 
11519  802 

803 
fun abstract_rule x a prf = 

15531  804 
abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf; 
11519  805 

11615  806 
fun check_comb (PAxm ("ProtoPure.combination", _, _) % f % g % _ % _ %% prf %% _) = 
19502  807 
is_some f orelse check_comb prf 
11615  808 
 check_comb (PAxm ("ProtoPure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) = 
11519  809 
check_comb prf1 andalso check_comb prf2 
11615  810 
 check_comb (PAxm ("ProtoPure.symmetric", _, _) % _ % _ %% prf) = check_comb prf 
11519  811 
 check_comb _ = false; 
812 

813 
fun combination f g t u (Type (_, [T, U])) prf1 prf2 = 

814 
let 

815 
val f = Envir.beta_norm f; 

816 
val g = Envir.beta_norm g; 

817 
val prf = if check_comb prf1 then 

15531  818 
combination_axm % NONE % NONE 
11519  819 
else (case prf1 of 
11615  820 
PAxm ("ProtoPure.reflexive", _, _) % _ => 
15531  821 
combination_axm %> remove_types f % NONE 
11615  822 
 _ => combination_axm %> remove_types f %> remove_types g) 
11519  823 
in 
824 
(case T of 

11615  825 
Type ("fun", _) => prf % 
11519  826 
(case head_of f of 
15531  827 
Abs _ => SOME (remove_types t) 
828 
 Var _ => SOME (remove_types t) 

829 
 _ => NONE) % 

11519  830 
(case head_of g of 
15531  831 
Abs _ => SOME (remove_types u) 
832 
 Var _ => SOME (remove_types u) 

833 
 _ => NONE) %% prf1 %% prf2 

834 
 _ => prf % NONE % NONE %% prf1 %% prf2) 

11519  835 
end; 
836 

837 
fun equal_intr A B prf1 prf2 = 

11615  838 
equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2; 
11519  839 

840 
fun equal_elim A B prf1 prf2 = 

11615  841 
equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2; 
11519  842 

843 

844 
(***** axioms and theorems *****) 

845 

17492  846 
fun vars_of t = rev (fold_aterms (fn v as Var _ => insert (op =) v  _ => I) t []); 
11519  847 

848 
fun test_args _ [] = true 

849 
 test_args is (Bound i :: ts) = 

17492  850 
not (member (op =) is i) andalso test_args (i :: is) ts 
11519  851 
 test_args _ _ = false; 
852 

853 
fun is_fun (Type ("fun", _)) = true 

854 
 is_fun (TVar _) = true 

855 
 is_fun _ = false; 

856 

857 
fun add_funvars Ts (vs, t) = 

858 
if is_fun (fastype_of1 (Ts, t)) then 

19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19357
diff
changeset

859 
vs union map_filter (fn Var (ixn, T) => 
15531  860 
if is_fun T then SOME ixn else NONE  _ => NONE) (vars_of t) 
11519  861 
else vs; 
862 

863 
fun add_npvars q p Ts (vs, Const ("==>", _) $ t $ u) = 

864 
add_npvars q p Ts (add_npvars q (not p) Ts (vs, t), u) 

865 
 add_npvars q p Ts (vs, Const ("all", Type (_, [Type (_, [T, _]), _])) $ t) = 

866 
add_npvars q p Ts (vs, if p andalso q then betapply (t, Var (("",0), T)) else t) 

12041  867 
 add_npvars q p Ts (vs, Abs (_, T, t)) = add_npvars q p (T::Ts) (vs, t) 
868 
 add_npvars _ _ Ts (vs, t) = add_npvars' Ts (vs, t) 

869 
and add_npvars' Ts (vs, t) = (case strip_comb t of 

11519  870 
(Var (ixn, _), ts) => if test_args [] ts then vs 
17314  871 
else Library.foldl (add_npvars' Ts) 
872 
(AList.update (op =) (ixn, 

873 
Library.foldl (add_funvars Ts) ((these ooo AList.lookup) (op =) vs ixn, ts)) vs, ts) 

15570  874 
 (Abs (_, T, u), ts) => Library.foldl (add_npvars' (T::Ts)) (vs, u :: ts) 
875 
 (_, ts) => Library.foldl (add_npvars' Ts) (vs, ts)); 

11519  876 

877 
fun prop_vars (Const ("==>", _) $ P $ Q) = prop_vars P union prop_vars Q 

878 
 prop_vars (Const ("all", _) $ Abs (_, _, t)) = prop_vars t 

879 
 prop_vars t = (case strip_comb t of 

880 
(Var (ixn, _), _) => [ixn]  _ => []); 

881 

882 
fun is_proj t = 

883 
let 

884 
fun is_p i t = (case strip_comb t of 

885 
(Bound j, []) => false 

886 
 (Bound j, ts) => j >= i orelse exists (is_p i) ts 

887 
 (Abs (_, _, u), _) => is_p (i+1) u 

888 
 (_, ts) => exists (is_p i) ts) 

889 
in (case strip_abs_body t of 

890 
Bound _ => true 

891 
 t' => is_p 0 t') 

892 
end; 

893 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

894 
fun needed_vars prop = 
20853  895 
Library.foldl (op union) 
896 
([], map (uncurry (insert (op =))) (add_npvars true true [] ([], prop))) union 

11519  897 
prop_vars prop; 
898 

899 
fun gen_axm_proof c name prop = 

900 
let 

901 
val nvs = needed_vars prop; 

902 
val args = map (fn (v as Var (ixn, _)) => 

17492  903 
if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @ 
16983  904 
map SOME (sort Term.term_ord (term_frees prop)); 
11519  905 
in 
15531  906 
proof_combt' (c (name, prop, NONE), args) 
11519  907 
end; 
908 

909 
val axm_proof = gen_axm_proof PAxm; 

17017  910 

911 
val dummy = Const (Term.dummy_patternN, dummyT); 

912 

913 
fun oracle_proof name prop = 

914 
if !proofs = 0 then Oracle (name, dummy, NONE) 

915 
else gen_axm_proof Oracle name prop; 

11519  916 

17492  917 
fun shrink_proof thy = 
918 
let 

919 
val compress_typ = Compress.typ thy; 

920 
val compress_term = Compress.term thy; 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

921 

17492  922 
fun shrink ls lev (prf as Abst (a, T, body)) = 
923 
let val (b, is, ch, body') = shrink ls (lev+1) body 

924 
in (b, is, ch, if ch then Abst (a, Option.map compress_typ T, body') else prf) end 

925 
 shrink ls lev (prf as AbsP (a, t, body)) = 

926 
let val (b, is, ch, body') = shrink (lev::ls) lev body 

19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19357
diff
changeset

927 
in (b orelse member (op =) is 0, map_filter (fn 0 => NONE  i => SOME (i1)) is, 
17492  928 
ch, if ch then AbsP (a, Option.map compress_term t, body') else prf) 
929 
end 

930 
 shrink ls lev prf = 

931 
let val (is, ch, _, prf') = shrink' ls lev [] [] prf 

932 
in (false, is, ch, prf') end 

933 
and shrink' ls lev ts prfs (prf as prf1 %% prf2) = 

934 
let 

935 
val p as (_, is', ch', prf') = shrink ls lev prf2; 

936 
val (is, ch, ts', prf'') = shrink' ls lev ts (p::prfs) prf1 

937 
in (is union is', ch orelse ch', ts', 

938 
if ch orelse ch' then prf'' %% prf' else prf) 

939 
end 

940 
 shrink' ls lev ts prfs (prf as prf1 % t) = 

941 
let val (is, ch, (ch', t')::ts', prf') = shrink' ls lev (t::ts) prfs prf1 

942 
in (is, ch orelse ch', ts', 

943 
if ch orelse ch' then prf' % Option.map compress_term t' else prf) end 

944 
 shrink' ls lev ts prfs (prf as PBound i) = 

945 
(if exists (fn SOME (Bound j) => levj <= List.nth (ls, i)  _ => true) ts 

18928
042608ffa2ec
subsituted gen_duplicates / has_duplicates for duplicates whenever appropriate
haftmann
parents:
18485
diff
changeset

946 
orelse has_duplicates (op =) 
042608ffa2ec
subsituted gen_duplicates / has_duplicates for duplicates whenever appropriate
haftmann
parents:
18485
diff
changeset

947 
(Library.foldl (fn (js, SOME (Bound j)) => j :: js  (js, _) => js) ([], ts)) 
17492  948 
orelse exists #1 prfs then [i] else [], false, map (pair false) ts, prf) 
949 
 shrink' ls lev ts prfs (Hyp t) = ([], false, map (pair false) ts, Hyp (compress_term t)) 

950 
 shrink' ls lev ts prfs (prf as MinProof _) = 

951 
([], false, map (pair false) ts, prf) 

952 
 shrink' ls lev ts prfs prf = 

953 
let 

954 
val prop = (case prf of PThm (_, _, prop, _) => prop  PAxm (_, prop, _) => prop 

955 
 Oracle (_, prop, _) => prop  _ => error "shrink: proof not in normal form"); 

956 
val vs = vars_of prop; 

19012  957 
val (ts', ts'') = chop (length vs) ts; 
17492  958 
val insts = Library.take (length ts', map (fst o dest_Var) vs) ~~ ts'; 
959 
val nvs = Library.foldl (fn (ixns', (ixn, ixns)) => 

960 
insert (op =) ixn (case AList.lookup (op =) insts ixn of 

961 
SOME (SOME t) => if is_proj t then ixns union ixns' else ixns' 

962 
 _ => ixns union ixns')) 

963 
(needed prop ts'' prfs, add_npvars false true [] ([], prop)); 

964 
val insts' = map 

965 
(fn (ixn, x as SOME _) => if member (op =) nvs ixn then (false, x) else (true, NONE) 

966 
 (_, x) => (false, x)) insts 

967 
in ([], false, insts' @ map (pair false) ts'', prf) end 

968 
and needed (Const ("==>", _) $ t $ u) ts ((b, _, _, _)::prfs) = 

969 
(if b then map (fst o dest_Var) (vars_of t) else []) union needed u ts prfs 

970 
 needed (Var (ixn, _)) (_::_) _ = [ixn] 

971 
 needed _ _ _ = []; 

972 
in shrink end; 

11519  973 

974 

975 
(**** Simple first order matching functions for terms and proofs ****) 

976 

977 
exception PMatch; 

978 

979 
(** see pattern.ML **) 

980 

15570  981 
fun flt (i: int) = List.filter (fn n => n < i); 
12279  982 

983 
fun fomatch Ts tymatch j = 

11519  984 
let 
985 
fun mtch (instsp as (tyinsts, insts)) = fn 

986 
(Var (ixn, T), t) => 

12279  987 
if j>0 andalso not (null (flt j (loose_bnos t))) 
988 
then raise PMatch 

989 
else (tymatch (tyinsts, fn () => (T, fastype_of1 (Ts, t))), 

990 
(ixn, t) :: insts) 

11519  991 
 (Free (a, T), Free (b, U)) => 
20147  992 
if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch 
11519  993 
 (Const (a, T), Const (b, U)) => 
20147  994 
if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch 
11519  995 
 (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u) 
12279  996 
 (Bound i, Bound j) => if i=j then instsp else raise PMatch 
11519  997 
 _ => raise PMatch 
998 
in mtch end; 

999 

12279  1000 
fun match_proof Ts tymatch = 
11519  1001 
let 
15531  1002 
fun optmatch _ inst (NONE, _) = inst 
1003 
 optmatch _ _ (SOME _, NONE) = raise PMatch 

1004 
 optmatch mtch inst (SOME x, SOME y) = mtch inst (x, y) 

12279  1005 

1006 
fun matcht Ts j (pinst, tinst) (t, u) = 

1007 
(pinst, fomatch Ts tymatch j tinst (t, Envir.beta_norm u)); 

1008 
fun matchT (pinst, (tyinsts, insts)) p = 

1009 
(pinst, (tymatch (tyinsts, K p), insts)); 

15570  1010 
fun matchTs inst (Ts, Us) = Library.foldl (uncurry matchT) (inst, Ts ~~ Us); 
12279  1011 

1012 
fun mtch Ts i j (pinst, tinst) (Hyp (Var (ixn, _)), prf) = 

1013 
if i = 0 andalso j = 0 then ((ixn, prf) :: pinst, tinst) 

1014 
else (case apfst (flt i) (apsnd (flt j) 

1015 
(prf_add_loose_bnos 0 0 prf ([], []))) of 

1016 
([], []) => ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst) 

1017 
 ([], _) => if j = 0 then 

1018 
((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst) 

1019 
else raise PMatch 

1020 
 _ => raise PMatch) 

1021 
 mtch Ts i j inst (prf1 % opt1, prf2 % opt2) = 

1022 
optmatch (matcht Ts j) (mtch Ts i j inst (prf1, prf2)) (opt1, opt2) 

1023 
 mtch Ts i j inst (prf1 %% prf2, prf1' %% prf2') = 

1024 
mtch Ts i j (mtch Ts i j inst (prf1, prf1')) (prf2, prf2') 

1025 
 mtch Ts i j inst (Abst (_, opT, prf1), Abst (_, opU, prf2)) = 

18485  1026 
mtch (the_default dummyT opU :: Ts) i (j+1) 
12279  1027 
(optmatch matchT inst (opT, opU)) (prf1, prf2) 
1028 
 mtch Ts i j inst (prf1, Abst (_, opU, prf2)) = 

18485  1029 
mtch (the_default dummyT opU :: Ts) i (j+1) inst 
12279  1030 
(incr_pboundvars 0 1 prf1 %> Bound 0, prf2) 
1031 
 mtch Ts i j inst (AbsP (_, opt, prf1), AbsP (_, opu, prf2)) = 

1032 
mtch Ts (i+1) j (optmatch (matcht Ts j) inst (opt, opu)) (prf1, prf2) 

1033 
 mtch Ts i j inst (prf1, AbsP (_, _, prf2)) = 

1034 
mtch Ts (i+1) j inst (incr_pboundvars 1 0 prf1 %% PBound 0, prf2) 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1035 
 mtch Ts i j inst (PThm (name1, _, prop1, opTs), PThm (name2, _, prop2, opUs)) = 
11519  1036 
if name1=name2 andalso prop1=prop2 then 
12279  1037 
optmatch matchTs inst (opTs, opUs) 
11519  1038 
else raise PMatch 
12279  1039 
 mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) = 
1040 
if s1=s2 then optmatch matchTs inst (opTs, opUs) 

11519  1041 
else raise PMatch 
12279  1042 
 mtch _ _ _ inst (PBound i, PBound j) = if i = j then inst else raise PMatch 
1043 
 mtch _ _ _ _ _ = raise PMatch 

1044 
in mtch Ts 0 0 end; 

11519  1045 

1046 
fun prf_subst (pinst, (tyinsts, insts)) = 

1047 
let 

15797  1048 
val substT = Envir.typ_subst_TVars tyinsts; 
11519  1049 

17325  1050 
fun subst' lev (t as Var (ixn, _)) = (case AList.lookup (op =) insts ixn of 
15531  1051 
NONE => t 
1052 
 SOME u => incr_boundvars lev u) 

11519  1053 
 subst' lev (Const (s, T)) = Const (s, substT T) 
1054 
 subst' lev (Free (s, T)) = Free (s, substT T) 

1055 
 subst' lev (Abs (a, T, body)) = Abs (a, substT T, subst' (lev+1) body) 

1056 
 subst' lev (f $ t) = subst' lev f $ subst' lev t 

1057 
 subst' _ t = t; 

1058 

1059 
fun subst plev tlev (AbsP (a, t, body)) = 

15570  1060 
AbsP (a, Option.map (subst' tlev) t, subst (plev+1) tlev body) 
11519  1061 
 subst plev tlev (Abst (a, T, body)) = 
15570  1062 
Abst (a, Option.map substT T, subst plev (tlev+1) body) 
11615  1063 
 subst plev tlev (prf %% prf') = subst plev tlev prf %% subst plev tlev prf' 
15570  1064 
 subst plev tlev (prf % t) = subst plev tlev prf % Option.map (subst' tlev) t 
17325  1065 
 subst plev tlev (prf as Hyp (Var (ixn, _))) = (case AList.lookup (op =) pinst ixn of 
15531  1066 
NONE => prf 
1067 
 SOME prf' => incr_pboundvars plev tlev prf') 

11519  1068 
 subst _ _ (PThm (id, prf, prop, Ts)) = 
15570  1069 
PThm (id, prf, prop, Option.map (map substT) Ts) 
11519  1070 
 subst _ _ (PAxm (id, prop, Ts)) = 
15570  1071 
PAxm (id, prop, Option.map (map substT) Ts) 
11519  1072 
 subst _ _ t = t 
1073 
in subst 0 0 end; 

1074 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1075 
(*A fast unification filter: true unless the two terms cannot be unified. 
12871
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1076 
Terms must be NORMAL. Treats all Vars as distinct. *) 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1077 
fun could_unify prf1 prf2 = 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1078 
let 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1079 
fun matchrands (prf1 %% prf2) (prf1' %% prf2') = 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1080 
could_unify prf2 prf2' andalso matchrands prf1 prf1' 
15531  1081 
 matchrands (prf % SOME t) (prf' % SOME t') = 
12871
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1082 
Term.could_unify (t, t') andalso matchrands prf prf' 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1083 
 matchrands (prf % _) (prf' % _) = matchrands prf prf' 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1084 
 matchrands _ _ = true 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1085 

21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1086 
fun head_of (prf %% _) = head_of prf 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1087 
 head_of (prf % _) = head_of prf 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1088 
 head_of prf = prf 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1089 

21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1090 
in case (head_of prf1, head_of prf2) of 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1091 
(_, Hyp (Var _)) => true 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1092 
 (Hyp (Var _), _) => true 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1093 
 (PThm (a, _, propa, _), PThm (b, _, propb, _)) => 
12871
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1094 
a = b andalso propa = propb andalso matchrands prf1 prf2 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1095 
 (PAxm (a, _, _), PAxm (b, _, _)) => a = b andalso matchrands prf1 prf2 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1096 
 (PBound i, PBound j) => i = j andalso matchrands prf1 prf2 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1097 
 (AbsP _, _) => true (*because of possible eta equality*) 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1098 
 (Abst _, _) => true 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1099 
 (_, AbsP _) => true 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1100 
 (_, Abst _) => true 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1101 
 _ => false 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1102 
end; 
21486a0557d1
Added function could_unify to speed up rewriting of proof terms.
berghofe
parents:
12868
diff
changeset

1103 

11519  1104 
(**** rewriting on proof terms ****) 
1105 

13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1106 
val skel0 = PBound 0; 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1107 

12279  1108 
fun rewrite_prf tymatch (rules, procs) prf = 
11519  1109 
let 
15531  1110 
fun rew _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, skel0) 
1111 
 rew _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, skel0) 

11519  1112 
 rew Ts prf = (case get_first (fn (_, r) => r Ts prf) procs of 
15531  1113 
SOME prf' => SOME (prf', skel0) 
1114 
 NONE => get_first (fn (prf1, prf2) => SOME (prf_subst 

13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1115 
(match_proof Ts tymatch ([], (Vartab.empty, [])) (prf1, prf)) prf2, prf2) 
15570  1116 
handle PMatch => NONE) (List.filter (could_unify prf o fst) rules)); 
11519  1117 

11615  1118 
fun rew0 Ts (prf as AbsP (_, _, prf' %% PBound 0)) = 
11519  1119 
if prf_loose_Pbvar1 prf' 0 then rew Ts prf 
1120 
else 

1121 
let val prf'' = incr_pboundvars (~1) 0 prf' 

19502  1122 
in SOME (the_default (prf'', skel0) (rew Ts prf'')) end 
15531  1123 
 rew0 Ts (prf as Abst (_, _, prf' % SOME (Bound 0))) = 
11519  1124 
if prf_loose_bvar1 prf' 0 then rew Ts prf 
1125 
else 

1126 
let val prf'' = incr_pboundvars 0 (~1) prf' 

19502  1127 
in SOME (the_default (prf'', skel0) (rew Ts prf'')) end 
11519  1128 
 rew0 Ts prf = rew Ts prf; 
1129 

15531  1130 
fun rew1 _ (Hyp (Var _)) _ = NONE 
13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1131 
 rew1 Ts skel prf = (case rew2 Ts skel prf of 
15531  1132 
SOME prf1 => (case rew0 Ts prf1 of 
19502  1133 
SOME (prf2, skel') => SOME (the_default prf2 (rew1 Ts skel' prf2)) 
15531  1134 
 NONE => SOME prf1) 
1135 
 NONE => (case rew0 Ts prf of 

19502  1136 
SOME (prf1, skel') => SOME (the_default prf1 (rew1 Ts skel' prf1)) 
15531  1137 
 NONE => NONE)) 
11519  1138 

15531  1139 
and rew2 Ts skel (prf % SOME t) = (case prf of 
11519  1140 
Abst (_, _, body) => 
1141 
let val prf' = prf_subst_bounds [t] body 

19502  1142 
in SOME (the_default prf' (rew2 Ts skel0 prf')) end 
13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1143 
 _ => (case rew1 Ts (case skel of skel' % _ => skel'  _ => skel0) prf of 
15531  1144 
SOME prf' => SOME (prf' % SOME t) 
1145 
 NONE => NONE)) 

15570  1146 
 rew2 Ts skel (prf % NONE) = Option.map (fn prf' => prf' % NONE) 
13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1147 
(rew1 Ts (case skel of skel' % _ => skel'  _ => skel0) prf) 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1148 
 rew2 Ts skel (prf1 %% prf2) = (case prf1 of 
11519  1149 
AbsP (_, _, body) => 
1150 
let val prf' = prf_subst_pbounds [prf2] body 

19502  1151 
in SOME (the_default prf' (rew2 Ts skel0 prf')) end 
13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1152 
 _ => 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1153 
let val (skel1, skel2) = (case skel of 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1154 
skel1 %% skel2 => (skel1, skel2) 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1155 
 _ => (skel0, skel0)) 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1156 
in case rew1 Ts skel1 prf1 of 
15531  1157 
SOME prf1' => (case rew1 Ts skel2 prf2 of 
1158 
SOME prf2' => SOME (prf1' %% prf2') 

1159 
 NONE => SOME (prf1' %% prf2)) 

1160 
 NONE => (case rew1 Ts skel2 prf2 of 

1161 
SOME prf2' => SOME (prf1 %% prf2') 

1162 
 NONE => NONE) 

13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1163 
end) 
19502  1164 
 rew2 Ts skel (Abst (s, T, prf)) = (case rew1 (the_default dummyT T :: Ts) 
13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1165 
(case skel of Abst (_, _, skel') => skel'  _ => skel0) prf of 
15531  1166 
SOME prf' => SOME (Abst (s, T, prf')) 
1167 
 NONE => NONE) 

13102
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1168 
 rew2 Ts skel (AbsP (s, t, prf)) = (case rew1 Ts 
b6f8aae5f152
Added skeletons to speed up rewriting on proof terms.
berghofe
parents:
12923
diff
changeset

1169 
(case skel of AbsP (_, _, skel') => skel'  _ => skel0) prf of 
15531  1170 
SOME prf' => SOME (AbsP (s, t, prf')) 
1171 
 NONE => NONE) 

1172 
 rew2 _ _ _ = NONE 

11519  1173 

19502  1174 
in the_default prf (rew1 [] skel0 prf) end; 
11519  1175 

17203  1176 
fun rewrite_proof thy = rewrite_prf (fn (tyenv, f) => 
1177 
Sign.typ_match thy (f ()) tyenv handle Type.TYPE_MATCH => raise PMatch); 

11519  1178 

11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

1179 
fun rewrite_proof_notypes rews = rewrite_prf fst rews; 
11615  1180 

16940  1181 

11519  1182 
(**** theory data ****) 
1183 

16458  1184 
structure ProofData = TheoryDataFun 
22846  1185 
( 
1186 
type T = (proof * proof) list * (string * (typ list > proof > proof option)) list; 

11519  1187 

12233  1188 
val empty = ([], []); 
1189 
val copy = I; 

16458  1190 
val extend = I; 
22662  1191 
fun merge _ ((rules1, procs1) : T, (rules2, procs2)) = 
1192 
(Library.merge (op =) (rules1, rules2), 

1193 
AList.merge (op =) (K true) (procs1, procs2)); 

22846  1194 
); 
11519  1195 

23780
a0e7305dd0cb
Added function rew_proof (for prenormalizing proofs).
berghofe
parents:
23296
diff
changeset

1196 
fun rew_proof thy = rewrite_prf fst (ProofData.get thy); 
a0e7305dd0cb
Added function rew_proof (for prenormalizing proofs).
berghofe
parents:
23296
diff
changeset

1197 

22662  1198 
fun add_prf_rrule r = (ProofData.map o apfst) (insert (op =) r); 
11519  1199 

22662  1200 
fun add_prf_rproc p = (ProofData.map o apsnd) (AList.update (op =) p); 
11519  1201 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1202 
fun thm_proof thy name hyps prop prf = 
11519  1203 
let 
12923  1204 
val prop = Logic.list_implies (hyps, prop); 
11519  1205 
val nvs = needed_vars prop; 
1206 
val args = map (fn (v as Var (ixn, _)) => 

17492  1207 
if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @ 
16983  1208 
map SOME (sort Term.term_ord (term_frees prop)); 
11543
d61b913431c5
renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents:
11540
diff
changeset

1209 
val opt_prf = if ! proofs = 2 then 
17492  1210 
#4 (shrink_proof thy [] 0 (rewrite_prf fst (ProofData.get thy) 
23178  1211 
(fold_rev implies_intr_proof hyps prf))) 
17017  1212 
else MinProof (mk_min_proof prf ([], [], [])); 
12233  1213 
val head = (case strip_combt (fst (strip_combP prf)) of 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1214 
(PThm (old_name, prf', prop', NONE), args') => 
11519  1215 
if (old_name="" orelse old_name=name) andalso 
1216 
prop = prop' andalso args = args' then 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1217 
PThm (name, prf', prop, NONE) 
11519  1218 
else 
21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1219 
PThm (name, opt_prf, prop, NONE) 
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1220 
 _ => PThm (name, opt_prf, prop, NONE)) 
11519  1221 
in 
12923  1222 
proof_combP (proof_combt' (head, args), map Hyp hyps) 
11519  1223 
end; 
1224 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1225 
fun get_name hyps prop prf = 
12923  1226 
let val prop = Logic.list_implies (hyps, prop) in 
1227 
(case strip_combt (fst (strip_combP prf)) of 

21646
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1228 
(PThm (name, _, prop', _), _) => if prop=prop' then name else "" 
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1229 
 (PAxm (name, prop', _), _) => if prop=prop' then name else "" 
c07b5b0e8492
thm/prf: separate official name vs. additional tags;
wenzelm
parents:
20853
diff
changeset

1230 
 _ => "") 
12923  1231 
end; 
11519  1232 

1233 
end; 

1234 

1235 
structure BasicProofterm : BASIC_PROOFTERM = Proofterm; 

1236 
open BasicProofterm; 