author  wenzelm 
Tue, 21 Mar 2006 12:18:13 +0100  
changeset 19304  15f001295a7b 
parent 19222  111ba44c66b2 
child 19357  dade85a75c9f 
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 
21 
 PThm of (string * (string * string list) list) * proof * term * typ list option 

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 

43 
val map_proof_terms : (term > term) > (typ > typ) > proof > proof 

44 
val fold_proof_terms : (term * 'a > 'a) > (typ * 'a > 'a) > 'a * proof > 'a 

45 
val add_prf_names : string list * proof > string list 

46 
val add_prf_tfree_names : string list * proof > string list 

47 
val add_prf_tvar_ixns : indexname list * proof > indexname list 

12868  48 
val maxidx_of_proof : proof > int 
13744  49 
val size_of_proof : proof > int 
12907
27e6d344d724
New function change_type for changing type assignments of theorems,
berghofe
parents:
12890
diff
changeset

50 
val change_type : typ list option > proof > proof 
11519  51 
val prf_abstract_over : term > proof > proof 
52 
val prf_incr_bv : int > int > int > int > proof > proof 

53 
val incr_pboundvars : int > int > proof > proof 

54 
val prf_loose_bvar1 : proof > int > bool 

55 
val prf_loose_Pbvar1 : proof > int > bool 

12279  56 
val prf_add_loose_bnos : int > int > proof > 
57 
int list * int list > int list * int list 

11519  58 
val norm_proof : Envir.env > proof > proof 
59 
val norm_proof' : Envir.env > proof > proof 

60 
val prf_subst_bounds : term list > proof > proof 

61 
val prf_subst_pbounds : proof list > proof > proof 

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

17017  63 
val proof_of_min_axm : string * term > proof 
64 
val proof_of_min_thm : (string * term) * proof > proof 

11519  65 

17017  66 
val thms_of_proof : proof > (term * proof) list Symtab.table > 
11519  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 

16880  78 
val instantiate : ((indexname * sort) * typ) list * ((indexname * typ) * term) list 
79 
> proof > proof 

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

18485  82 
val bicompose_proof : bool > term list > term list > term list > term option > 
11519  83 
int > proof > proof > proof 
84 
val equality_axms : (string * term) list 

85 
val reflexive_axm : proof 

86 
val symmetric_axm : proof 

87 
val transitive_axm : proof 

88 
val equal_intr_axm : proof 

89 
val equal_elim_axm : proof 

90 
val abstract_rule_axm : proof 

91 
val combination_axm : proof 

92 
val reflexive : proof 

93 
val symmetric : proof > proof 

94 
val transitive : term > typ > proof > proof > proof 

95 
val abstract_rule : term > string > proof > proof 

96 
val combination : term > term > term > term > typ > proof > proof > proof 

97 
val equal_intr : term > term > proof > proof > proof 

98 
val equal_elim : term > term > proof > proof > proof 

99 
val axm_proof : string > term > proof 

100 
val oracle_proof : string > term > proof 

16458  101 
val thm_proof : theory > string * (string * string list) list > 
11519  102 
term list > term > proof > proof 
12923  103 
val get_name_tags : term list > term > proof > string * (string * string list) list 
11519  104 

105 
(** rewriting on proof terms **) 

12233  106 
val add_prf_rrules : (proof * proof) list > theory > theory 
107 
val add_prf_rprocs : (string * (Term.typ list > proof > proof option)) list > 

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 

16536  113 
val init_data: theory > theory 
11519  114 

115 
end 

116 

117 
structure Proofterm : PROOFTERM = 

118 
struct 

119 

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

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

121 

11519  122 
datatype proof = 
123 
PBound of int 

124 
 Abst of string * typ option * proof 

125 
 AbsP of string * term option * proof 

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

11519  128 
 Hyp of term 
129 
 PThm of (string * (string * string list) list) * proof * term * typ list option 

130 
 PAxm of string * term * typ list option 

131 
 Oracle of string * term * typ list option 

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

17017  134 
fun proof_of_min_axm (s, prop) = PAxm (s, prop, NONE); 
135 
fun proof_of_min_thm ((s, prop), prf) = PThm ((s, []), prf, prop, NONE); 

136 

137 
val string_term_ord = prod_ord fast_string_ord Term.fast_term_ord; 

138 

139 
fun oracles_of_proof oras prf = 

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

143 
 oras_of (prf % _) = oras_of prf 

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

145 
 oras_of (PThm ((name, _), prf, prop, _)) = (fn tabs as (thms, oras) => 

17412  146 
case Symtab.lookup thms name of 
147 
NONE => oras_of prf (Symtab.update (name, [prop]) thms, oras) 

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

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

153 
apsnd (OrdList.union string_term_ord oras) #> 

154 
fold (oras_of o proof_of_min_thm) thms 

155 
 oras_of _ = I 

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

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

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

163 
 thms_of_proof (prf % _) = thms_of_proof prf 

164 
 thms_of_proof (prf' as PThm ((s, _), prf, prop, _)) = (fn tab => 

17412  165 
case Symtab.lookup tab s of 
166 
NONE => thms_of_proof prf (Symtab.update (s, [(prop, prf')]) tab) 

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

11519  171 

17017  172 
fun axms_of_proof (Abst (_, _, prf)) = axms_of_proof prf 
173 
 axms_of_proof (AbsP (_, _, prf)) = axms_of_proof prf 

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

175 
 axms_of_proof (prf % _) = axms_of_proof prf 

17412  176 
 axms_of_proof (prf as PAxm (s, _, _)) = Symtab.update (s, prf) 
17017  177 
 axms_of_proof (MinProof (_, prfs, _)) = fold (axms_of_proof o proof_of_min_axm) prfs 
178 
 axms_of_proof _ = I; 

11519  179 

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

181 

17017  182 
fun map3 f g h (thms, axms, oras) = (f thms, g axms, h oras); 
183 

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

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

186 
 mk_min_proof (prf % _) = mk_min_proof prf 

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

188 
 mk_min_proof (PThm ((s, _), prf, prop, _)) = 

189 
map3 (OrdList.insert (string_term_ord o pairself fst) ((s, prop), prf)) I I 

190 
 mk_min_proof (PAxm (s, prop, _)) = 

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

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

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

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

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

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

197 
 mk_min_proof _ = I; 

11519  198 

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

200 

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

201 
val proofs = ref 2; 
11519  202 

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

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

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

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

19222  207 
val min_proof = MinProof ([], [], []); 
11519  208 

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

19222  210 
let val ora = ora1 orelse ora2 in 
211 
(ora, 

212 
case !proofs of 

213 
2 => f prf1 prf2 

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

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

216 
 i => err_illegal_level i) 

217 
end; 

11519  218 

19222  219 
fun infer_derivs' f = infer_derivs (K f) (false, min_proof); 
11519  220 

15531  221 
fun (prf %> t) = prf % SOME t; 
11519  222 

15570  223 
val proof_combt = Library.foldl (op %>); 
224 
val proof_combt' = Library.foldl (op %); 

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

11519  226 

227 
fun strip_combt prf = 

11615  228 
let fun stripc (prf % t, ts) = stripc (prf, t::ts) 
11519  229 
 stripc x = x 
230 
in stripc (prf, []) end; 

231 

232 
fun strip_combP prf = 

11615  233 
let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs) 
11519  234 
 stripc x = x 
235 
in stripc (prf, []) end; 

236 

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

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

239 
 _ => prf); 

240 

15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

241 
val mk_Abst = foldr (fn ((s, T:typ), prf) => Abst (s, NONE, prf)); 
15531  242 
fun mk_AbsP (i, prf) = funpow i (fn prf => AbsP ("H", NONE, prf)) prf; 
11519  243 

15531  244 
fun apsome' f NONE = raise SAME 
245 
 apsome' f (SOME x) = SOME (f x); 

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

246 

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

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

248 
let val x' = f x 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

249 
in if x = x' then raise SAME else x' end; 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

250 

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

251 
fun map_proof_terms f g = 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

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

253 
fun mapp (Abst (s, T, prf)) = (Abst (s, apsome' (same g) T, mapph prf) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

254 
handle SAME => Abst (s, T, mapp prf)) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

255 
 mapp (AbsP (s, t, prf)) = (AbsP (s, apsome' (same f) t, mapph prf) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

256 
handle SAME => AbsP (s, t, mapp prf)) 
15570  257 
 mapp (prf % t) = (mapp prf % Option.map f t 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

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

259 
 mapp (prf1 %% prf2) = (mapp prf1 %% mapph prf2 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

260 
handle SAME => prf1 %% mapp prf2) 
15531  261 
 mapp (PThm (a, prf, prop, SOME Ts)) = 
262 
PThm (a, prf, prop, SOME (same (map g) Ts)) 

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

264 
PAxm (a, prop, SOME (same (map g) Ts)) 

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

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

266 
and mapph prf = (mapp prf handle SAME => prf) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

267 

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

268 
in mapph end; 
11519  269 

15531  270 
fun fold_proof_terms f g (a, Abst (_, SOME T, prf)) = fold_proof_terms f g (g (T, a), prf) 
271 
 fold_proof_terms f g (a, Abst (_, NONE, prf)) = fold_proof_terms f g (a, prf) 

272 
 fold_proof_terms f g (a, AbsP (_, SOME t, prf)) = fold_proof_terms f g (f (t, a), prf) 

273 
 fold_proof_terms f g (a, AbsP (_, NONE, prf)) = fold_proof_terms f g (a, prf) 

274 
 fold_proof_terms f g (a, prf % SOME t) = f (t, fold_proof_terms f g (a, prf)) 

275 
 fold_proof_terms f g (a, prf % NONE) = fold_proof_terms f g (a, prf) 

11615  276 
 fold_proof_terms f g (a, prf1 %% prf2) = fold_proof_terms f g 
11519  277 
(fold_proof_terms f g (a, prf1), prf2) 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

278 
 fold_proof_terms _ g (a, PThm (_, _, _, SOME Ts)) = foldr g a Ts 
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

279 
 fold_proof_terms _ g (a, PAxm (_, prop, SOME Ts)) = foldr g a Ts 
11519  280 
 fold_proof_terms _ _ (a, _) = a; 
281 

282 
val add_prf_names = fold_proof_terms add_term_names ((uncurry K) o swap); 

283 
val add_prf_tfree_names = fold_proof_terms add_term_tfree_names add_typ_tfree_names; 

284 
val add_prf_tvar_ixns = fold_proof_terms add_term_tvar_ixns (add_typ_ixns o swap); 

285 

12868  286 
fun maxidx_of_proof prf = fold_proof_terms 
287 
(Int.max o apfst maxidx_of_term) (Int.max o apfst maxidx_of_typ) (~1, prf); 

288 

13744  289 
fun size_of_proof (Abst (_, _, prf)) = 1 + size_of_proof prf 
13749  290 
 size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf 
13744  291 
 size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2 
13749  292 
 size_of_proof (prf % _) = 1 + size_of_proof prf 
13744  293 
 size_of_proof _ = 1; 
294 

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

295 
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

296 
 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

297 
 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

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

299 

11519  300 

301 
(***** utilities *****) 

302 

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

304 
 strip_abs _ t = t; 

305 

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

308 

309 
(*Abstraction of a proof term over its occurrences of v, 

310 
which must contain no loose bound variables. 

311 
The resulting proof term is ready to become the body of an Abst.*) 

312 

313 
fun prf_abstract_over v = 

314 
let 

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

315 
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

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

317 
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

318 
 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

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

320 
and absth' lev t = (abst' lev t handle SAME => t); 
11519  321 

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

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

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

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

325 
 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

326 
 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

327 
handle SAME => prf1 %% abst lev prf2) 
15570  328 
 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

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

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

331 
and absth lev prf = (abst lev prf handle SAME => prf) 
11519  332 

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

333 
in absth 0 end; 
11519  334 

335 

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

337 
required when moving a proof term within abstractions 

338 
inc is increment for bound variables 

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

340 

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

342 

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

343 
fun prf_incr_bv' incP inct Plev tlev (PBound i) = 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

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

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

346 
(AbsP (a, apsome' (same (incr_bv' inct tlev)) t, 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

347 
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

348 
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

349 
 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

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

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

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

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

354 
 prf_incr_bv' incP inct Plev tlev (prf % t) = 
15570  355 
(prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t 
11715
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

356 
handle SAME => prf % apsome' (same (incr_bv' inct tlev)) t) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

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

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

359 
(prf_incr_bv' incP inct Plev tlev prf handle SAME => prf); 
11519  360 

361 
fun incr_pboundvars 0 0 prf = prf 

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

363 

364 

11615  365 
fun prf_loose_bvar1 (prf1 %% prf2) k = prf_loose_bvar1 prf1 k orelse prf_loose_bvar1 prf2 k 
15531  366 
 prf_loose_bvar1 (prf % SOME t) k = prf_loose_bvar1 prf k orelse loose_bvar1 (t, k) 
367 
 prf_loose_bvar1 (_ % NONE) _ = true 

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

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

11519  370 
 prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1) 
371 
 prf_loose_bvar1 _ _ = false; 

372 

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

11615  374 
 prf_loose_Pbvar1 (prf1 %% prf2) k = prf_loose_Pbvar1 prf1 k orelse prf_loose_Pbvar1 prf2 k 
375 
 prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k 

11519  376 
 prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1) 
377 
 prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k 

378 
 prf_loose_Pbvar1 _ _ = false; 

379 

12279  380 
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) = 
17492  381 
if i < plev then (is, js) else (insert (op =) (iplev) is, js) 
12279  382 
 prf_add_loose_bnos plev tlev (prf1 %% prf2) p = 
383 
prf_add_loose_bnos plev tlev prf2 

384 
(prf_add_loose_bnos plev tlev prf1 p) 

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

386 
prf_add_loose_bnos plev tlev prf (case opt of 

17492  387 
NONE => (is, insert (op =) ~1 js) 
15531  388 
 SOME t => (is, add_loose_bnos (t, tlev, js))) 
12279  389 
 prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) = 
390 
prf_add_loose_bnos (plev+1) tlev prf (case opt of 

17492  391 
NONE => (is, insert (op =) ~1 js) 
15531  392 
 SOME t => (is, add_loose_bnos (t, tlev, js))) 
12279  393 
 prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p = 
394 
prf_add_loose_bnos plev (tlev+1) prf p 

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

396 

11519  397 

398 
(**** substitutions ****) 

399 

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

400 
fun del_conflicting_tvars envT T = Term.instantiateT 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

401 
(List.mapPartial (fn ixnS as (_, S) => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

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

403 
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

404 

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

405 
fun del_conflicting_vars env t = Term.instantiate 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

406 
(List.mapPartial (fn ixnS as (_, S) => 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

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

408 
SOME (ixnS, TFree ("'dummy", S))) (term_tvars t), 
4b62e0cb3aa8
Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents:
18030
diff
changeset

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

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

411 
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

412 

11519  413 
fun norm_proof env = 
414 
let 

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

416 
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

417 
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

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

419 
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

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

421 
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

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

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

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

427 
 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

428 
handle SAME => prf % apsome' (htype norm_term_same) t) 
11615  429 
 norm (prf1 %% prf2) = (norm prf1 %% normh prf2 
430 
handle SAME => prf1 %% norm prf2) 

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

431 
 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

432 
 norm (PAxm (s, prop, Ts)) = PAxm (s, prop, apsome' (htypeTs norm_types_same) Ts) 
11519  433 
 norm _ = raise SAME 
434 
and normh prf = (norm prf handle SAME => prf); 

435 
in normh end; 

436 

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

438 

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

440 
 remove_types (t $ u) = remove_types t $ remove_types u 

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

442 
 remove_types t = t; 

443 

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

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

11519  447 

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

449 

450 
(**** substitution of bound variables ****) 

451 

452 
fun prf_subst_bounds args prf = 

453 
let 

454 
val n = length args; 

455 
fun subst' lev (Bound i) = 

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

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

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

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

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

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

462 
 subst' _ _ = raise SAME 

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

464 

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

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

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

11615  468 
 subst lev (prf %% prf') = (subst lev prf %% substh lev prf' 
469 
handle SAME => prf %% subst lev prf') 

15570  470 
 subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t 
11615  471 
handle SAME => prf % apsome' (subst' lev) t) 
11519  472 
 subst _ _ = raise SAME 
473 
and substh lev prf = (subst lev prf handle SAME => prf) 

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

475 

476 
fun prf_subst_pbounds args prf = 

477 
let 

478 
val n = length args; 

479 
fun subst (PBound i) Plev tlev = 

480 
(if i < Plev then raise SAME (*var is locally bound*) 

481 
else incr_pboundvars Plev tlev (List.nth (args, iPlev)) 

482 
handle Subscript => PBound (in) (*loose: change it*)) 

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

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

11615  485 
 subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev 
486 
handle SAME => prf %% subst prf' Plev tlev) 

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

11519  488 
 subst prf _ _ = raise SAME 
489 
and substh prf Plev tlev = (subst prf Plev tlev handle SAME => prf) 

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

491 

492 

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

494 

495 
fun frzT names = 

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

498 
fun thawT names = 

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

11519  502 

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

504 
freeze names names' t $ freeze names names' u 

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

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

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

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

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

17325  510 
Free ((the o AList.lookup (op =) names) ixn, frzT names' T) 
11519  511 
 freeze names names' t = t; 
512 

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

514 
thaw names names' t $ thaw names names' u 

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

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

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

518 
 thaw names names' (Free (s, T)) = 

519 
let val T' = thawT names' T 

17325  520 
in case AList.lookup (op =) names s of 
15531  521 
NONE => Free (s, T') 
522 
 SOME ixn => Var (ixn, T') 

11519  523 
end 
524 
 thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T) 

525 
 thaw names names' t = t; 

526 

527 
fun freeze_thaw_prf prf = 

528 
let 

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

530 
(fn (t, (fs, Tfs, vs, Tvs)) => 

531 
(add_term_frees (t, fs), add_term_tfree_names (t, Tfs), 

532 
add_term_vars (t, vs), add_term_tvar_ixns (t, Tvs))) 

533 
(fn (T, (fs, Tfs, vs, Tvs)) => 

534 
(fs, add_typ_tfree_names (T, Tfs), 

535 
vs, add_typ_ixns (Tvs, T))) 

536 
(([], [], [], []), prf); 

537 
val fs' = map (fst o dest_Free) fs; 

538 
val vs' = map (fst o dest_Var) vs; 

539 
val names = vs' ~~ variantlist (map fst vs', fs'); 

540 
val names' = Tvs ~~ variantlist (map fst Tvs, Tfs); 

541 
val rnames = map swap names; 

542 
val rnames' = map swap names'; 

543 
in 

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

545 
map_proof_terms (thaw rnames rnames') (thawT rnames')) 

546 
end; 

547 

548 

549 
(***** implication introduction *****) 

550 

551 
fun implies_intr_proof h prf = 

552 
let 

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

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

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

557 
 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

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

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

560 
and abshyph i prf = (abshyp i prf handle SAME => prf) 
11519  561 
in 
15531  562 
AbsP ("H", NONE (*h*), abshyph 0 prf) 
11519  563 
end; 
564 

565 

566 
(***** forall introduction *****) 

567 

15531  568 
fun forall_intr_proof x a prf = Abst (a, NONE, prf_abstract_over x prf); 
11519  569 

570 

571 
(***** varify *****) 

572 

573 
fun varify_proof t fixed prf = 

574 
let 

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

11519  577 
val ixns = add_term_tvar_ixns (t, []); 
15797  578 
val fmap = fs ~~ variantlist (map fst fs, map #1 ixns) 
11519  579 
fun thaw (f as (a, S)) = 
17314  580 
(case AList.lookup (op =) fmap f of 
15531  581 
NONE => TFree f 
582 
 SOME b => TVar ((b, 0), S)); 

11519  583 
in map_proof_terms (map_term_types (map_type_tfree thaw)) (map_type_tfree thaw) prf 
584 
end; 

585 

586 

587 
local 

588 

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

590 
let val v = variant used (string_of_indexname ix) 

591 
in ((ix, v) :: pairs, v :: used) end; 

592 

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

11519  596 

597 
in 

598 

599 
fun freezeT t prf = 

600 
let 

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

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

15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

603 
val (alist, _) = foldr new_name ([], used) tvars; 
11519  604 
in 
605 
(case alist of 

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

607 
 _ => 

608 
let val frzT = map_type_tvar (freeze_one alist) 

609 
in map_proof_terms (map_term_types frzT) frzT prf end) 

610 
end; 

611 

612 
end; 

613 

614 

615 
(***** rotate assumptions *****) 

616 

617 
fun rotate_proof Bs Bi m prf = 

618 
let 

619 
val params = Term.strip_all_vars Bi; 

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

621 
val i = length asms; 

622 
val j = length Bs; 

623 
in 

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

15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

625 
(j downto 1) @ [mk_Abst (mk_AbsP (i, 
11519  626 
proof_combP (proof_combt (PBound i, map Bound ((length params  1) downto 0)), 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

627 
map PBound (((im1) downto 0) @ ((i1) downto (im)))))) params])) 
11519  628 
end; 
629 

630 

631 
(***** permute premises *****) 

632 

633 
fun permute_prems_prf prems j k prf = 

634 
let val n = length prems 

635 
in mk_AbsP (n, proof_combP (prf, 

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

637 
end; 

638 

639 

640 
(***** instantiation *****) 

641 

16880  642 
fun instantiate (instT, inst) prf = 
643 
map_proof_terms (Term.instantiate (instT, map (apsnd remove_types) inst)) 

644 
(Term.instantiateT instT) prf; 

11519  645 

646 

647 
(***** lifting *****) 

648 

649 
fun lift_proof Bi inc prop prf = 

650 
let 

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

652 

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

653 
fun lift' Us Ts (Abst (s, T, prf)) = 
16880  654 
(Abst (s, apsome' (same (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

655 
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

656 
 lift' Us Ts (AbsP (s, t, prf)) = 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

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

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

660 
handle SAME => prf % apsome' (same (lift'' Us Ts)) t) 
592923615f77
Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents:
11652
diff
changeset

661 
 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

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

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

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

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

668 
and lifth' Us Ts prf = (lift' Us Ts prf handle SAME => prf); 
11519  669 

18030  670 
val ps = map (Logic.lift_all inc Bi) (Logic.strip_imp_prems prop); 
11519  671 
val k = length ps; 
672 

673 
fun mk_app (b, (i, j, prf)) = 

11615  674 
if b then (i1, j, prf %% PBound i) else (i, j1, prf %> Bound j); 
11519  675 

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

15531  677 
AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B) 
11519  678 
 lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) = 
15531  679 
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

680 
 lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf, 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

681 
map (fn k => (#3 (foldr mk_app (i1, j1, PBound k) bs))) 
11519  682 
(i + k  1 downto i)); 
683 
in 

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

685 
end; 

686 

687 

688 
(***** proof by assumption *****) 

689 

15531  690 
fun mk_asm_prf (Const ("==>", _) $ A $ B) i = AbsP ("H", NONE (*A*), mk_asm_prf B (i+1)) 
691 
 mk_asm_prf (Const ("all", _) $ Abs (a, T, t)) i = Abst (a, NONE (*T*), mk_asm_prf t i) 

11519  692 
 mk_asm_prf _ i = PBound i; 
693 

694 
fun assumption_proof Bs Bi n prf = 

695 
mk_AbsP (length Bs, proof_combP (prf, 

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

697 

698 

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

700 

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

15531  702 
AbsP ("H", NONE (*A*), flatten_params_proof (i+1) j n (B, k)) 
11519  703 
 flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) = 
15531  704 
Abst (a, NONE (*T*), flatten_params_proof i (j+1) n (t, k)) 
11519  705 
 flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i), 
19304  706 
map Bound (j1 downto 0)), map PBound (remove (op =) (in) (i1 downto 0))); 
11519  707 

18485  708 
fun bicompose_proof flatten Bs oldAs newAs A n rprf sprf = 
11519  709 
let 
710 
val la = length newAs; 

711 
val lb = length Bs; 

712 
in 

713 
mk_AbsP (lb+la, proof_combP (sprf, 

11615  714 
map PBound (lb + la  1 downto la)) %% 
18485  715 
proof_combP (rprf, (if n>0 then [mk_asm_prf (the A) (~n)] else []) @ 
716 
map (if flatten then flatten_params_proof 0 0 n else PBound o snd) 

717 
(oldAs ~~ (la  1 downto 0)))) 

11519  718 
end; 
719 

720 

721 
(***** axioms for equality *****) 

722 

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

11519  725 
val x = Free ("x", aT); 
726 
val y = Free ("y", aT); 

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

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

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

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

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

732 

733 
local open Logic in 

734 

735 
val equality_axms = 

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

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

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

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

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

741 
("abstract_rule", Logic.mk_implies 

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

743 
equals (aT > bT) $ 

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

745 
("combination", Logic.list_implies 

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

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

748 

749 
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm, 

750 
equal_elim_axm, abstract_rule_axm, combination_axm] = 

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

753 
end; 

754 

15531  755 
val reflexive = reflexive_axm % NONE; 
11519  756 

11615  757 
fun symmetric (prf as PAxm ("ProtoPure.reflexive", _, _) % _) = prf 
15531  758 
 symmetric prf = symmetric_axm % NONE % NONE %% prf; 
11519  759 

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

11519  762 
 transitive u (Type ("prop", [])) prf1 prf2 = 
15531  763 
transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2 
11519  764 
 transitive u T prf1 prf2 = 
15531  765 
transitive_axm % NONE % NONE % NONE %% prf1 %% prf2; 
11519  766 

767 
fun abstract_rule x a prf = 

15531  768 
abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf; 
11519  769 

11615  770 
fun check_comb (PAxm ("ProtoPure.combination", _, _) % f % g % _ % _ %% prf %% _) = 
15570  771 
isSome f orelse check_comb prf 
11615  772 
 check_comb (PAxm ("ProtoPure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) = 
11519  773 
check_comb prf1 andalso check_comb prf2 
11615  774 
 check_comb (PAxm ("ProtoPure.symmetric", _, _) % _ % _ %% prf) = check_comb prf 
11519  775 
 check_comb _ = false; 
776 

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

778 
let 

779 
val f = Envir.beta_norm f; 

780 
val g = Envir.beta_norm g; 

781 
val prf = if check_comb prf1 then 

15531  782 
combination_axm % NONE % NONE 
11519  783 
else (case prf1 of 
11615  784 
PAxm ("ProtoPure.reflexive", _, _) % _ => 
15531  785 
combination_axm %> remove_types f % NONE 
11615  786 
 _ => combination_axm %> remove_types f %> remove_types g) 
11519  787 
in 
788 
(case T of 

11615  789 
Type ("fun", _) => prf % 
11519  790 
(case head_of f of 
15531  791 
Abs _ => SOME (remove_types t) 
792 
 Var _ => SOME (remove_types t) 

793 
 _ => NONE) % 

11519  794 
(case head_of g of 
15531  795 
Abs _ => SOME (remove_types u) 
796 
 Var _ => SOME (remove_types u) 

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

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

11519  799 
end; 
800 

801 
fun equal_intr A B prf1 prf2 = 

11615  802 
equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2; 
11519  803 

804 
fun equal_elim A B prf1 prf2 = 

11615  805 
equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2; 
11519  806 

807 

808 
(***** axioms and theorems *****) 

809 

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

812 
fun test_args _ [] = true 

813 
 test_args is (Bound i :: ts) = 

17492  814 
not (member (op =) is i) andalso test_args (i :: is) ts 
11519  815 
 test_args _ _ = false; 
816 

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

818 
 is_fun (TVar _) = true 

819 
 is_fun _ = false; 

820 

821 
fun add_funvars Ts (vs, t) = 

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

15570  823 
vs union List.mapPartial (fn Var (ixn, T) => 
15531  824 
if is_fun T then SOME ixn else NONE  _ => NONE) (vars_of t) 
11519  825 
else vs; 
826 

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

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

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

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

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

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

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

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

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

11519  840 

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

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

843 
 prop_vars t = (case strip_comb t of 

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

845 

846 
fun is_proj t = 

847 
let 

848 
fun is_p i t = (case strip_comb t of 

849 
(Bound j, []) => false 

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

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

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

853 
in (case strip_abs_body t of 

854 
Bound _ => true 

855 
 t' => is_p 0 t') 

856 
end; 

857 

858 
fun needed_vars prop = 

15570  859 
Library.foldl op union ([], map op ins (add_npvars true true [] ([], prop))) union 
11519  860 
prop_vars prop; 
861 

862 
fun gen_axm_proof c name prop = 

863 
let 

864 
val nvs = needed_vars prop; 

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

17492  866 
if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @ 
16983  867 
map SOME (sort Term.term_ord (term_frees prop)); 
11519  868 
in 
15531  869 
proof_combt' (c (name, prop, NONE), args) 
11519  870 
end; 
871 

872 
val axm_proof = gen_axm_proof PAxm; 

17017  873 

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

875 

876 
fun oracle_proof name prop = 

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

878 
else gen_axm_proof Oracle name prop; 

11519  879 

17492  880 
fun shrink_proof thy = 
881 
let 

882 
val compress_typ = Compress.typ thy; 

883 
val compress_term = Compress.term thy; 

884 

885 
fun shrink ls lev (prf as Abst (a, T, body)) = 

886 
let val (b, is, ch, body') = shrink ls (lev+1) body 

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

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

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

890 
in (b orelse member (op =) is 0, List.mapPartial (fn 0 => NONE  i => SOME (i1)) is, 

891 
ch, if ch then AbsP (a, Option.map compress_term t, body') else prf) 

892 
end 

893 
 shrink ls lev prf = 

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

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

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

897 
let 

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

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

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

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

902 
end 

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

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

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

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

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

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

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

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

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

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

915 
 shrink' ls lev ts prfs prf = 

916 
let 

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

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

919 
val vs = vars_of prop; 

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

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

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

925 
 _ => ixns union ixns')) 

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

927 
val insts' = map 

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

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

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

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

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

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

934 
 needed _ _ _ = []; 

935 
in shrink end; 

11519  936 

937 

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

939 

940 
exception PMatch; 

941 

942 
(** see pattern.ML **) 

943 

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

946 
fun fomatch Ts tymatch j = 

11519  947 
let 
948 
fun mtch (instsp as (tyinsts, insts)) = fn 

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

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

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

953 
(ixn, t) :: insts) 

11519  954 
 (Free (a, T), Free (b, U)) => 
12279  955 
if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch 
11519  956 
 (Const (a, T), Const (b, U)) => 
12279  957 
if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch 
11519  958 
 (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u) 
12279  959 
 (Bound i, Bound j) => if i=j then instsp else raise PMatch 
11519  960 
 _ => raise PMatch 
961 
in mtch end; 

962 

12279  963 
fun match_proof Ts tymatch = 
11519  964 
let 
15531  965 
fun optmatch _ inst (NONE, _) = inst 
966 
 optmatch _ _ (SOME _, NONE) = raise PMatch 

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

12279  968 

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

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

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

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

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

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

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

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

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

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

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

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

982 
else raise PMatch 

983 
 _ => raise PMatch) 

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

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

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

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

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

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

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

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

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

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

998 
 mtch Ts i j inst (PThm ((name1, _), _, prop1, opTs), 

999 
PThm ((name2, _), _, prop2, opUs)) = 

11519  1000 
if name1=name2 andalso prop1=prop2 then 
12279  1001 
optmatch matchTs inst (opTs, opUs) 
11519  1002 
else raise PMatch 
12279  1003 
 mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) = 
1004 
if s1=s2 then optmatch matchTs inst (opTs, opUs) 

11519  1005 
else raise PMatch 
12279  1006 
 mtch _ _ _ inst (PBound i, PBound j) = if i = j then inst else raise PMatch 
1007 
 mtch _ _ _ _ _ = raise PMatch 

1008 
in mtch Ts 0 0 end; 

11519  1009 

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

1011 
let 

15797  1012 
val substT = Envir.typ_subst_TVars tyinsts; 
11519  1013 

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

11519  1017 
 subst' lev (Const (s, T)) = Const (s, substT T) 
1018 
 subst' lev (Free (s, T)) = Free (s, substT T) 

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

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

1021 
 subst' _ t = t; 

1022 

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

15570  1024 
AbsP (a, Option.map (subst' tlev) t, subst (plev+1) tlev body) 
11519  1025 
 subst plev tlev (Abst (a, T, body)) = 
15570  1026 
Abst (a, Option.map substT T, subst plev (tlev+1) body) 
11615  1027 
 subst plev tlev (prf %% prf') = subst plev tlev prf %% subst plev tlev prf' 
15570  1028 
 subst plev tlev (prf % t) = subst plev tlev prf % Option.map (subst' tlev) t 
17325  1029 
 subst plev tlev (prf as Hyp (Var (ixn, _))) = (case AList.lookup (op =) pinst ixn of 
15531  1030 
NONE => prf 
1031 
 SOME prf' => incr_pboundvars plev tlev prf') 

11519  1032 
 subst _ _ (PThm (id, prf, prop, Ts)) = 
15570  1033 
PThm (id, prf, prop, Option.map (map substT) Ts) 
11519  1034 
 subst _ _ (PAxm (id, prop, Ts)) = 
15570  1035 
PAxm (id, prop, Option.map (map substT) Ts) 
11519  1036 
 subst _ _ t = t 
1037 
in subst 0 0 end; 

1038 

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

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

1040 
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

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

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

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

1044 
could_unify prf2 prf2' andalso matchrands prf1 prf1' 
15531  1045 
 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

1046 
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

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

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

1049 

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

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

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

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

1053 

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

1054 
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

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

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

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

1058 
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

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

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

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

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

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

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

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

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

1067 

11519  1068 
(**** rewriting on proof terms ****) 
1069 

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

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

1071 

12279  1072 
fun rewrite_prf tymatch (rules, procs) prf = 
11519  1073 
let 
15531  1074 
fun rew _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, skel0) 
1075 
 rew _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, skel0) 

11519  1076 
 rew Ts prf = (case get_first (fn (_, r) => r Ts prf) procs of 
15531  1077 
SOME prf' => SOME (prf', skel0) 
1078 
 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

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

11615  1082 
fun rew0 Ts (prf as AbsP (_, _, prf' %% PBound 0)) = 
11519  1083 
if prf_loose_Pbvar1 prf' 0 then rew Ts prf 
1084 
else 

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

15570  1086 
in SOME (getOpt (rew Ts prf'', (prf'', skel0))) end 
15531  1087 
 rew0 Ts (prf as Abst (_, _, prf' % SOME (Bound 0))) = 
11519  1088 
if prf_loose_bvar1 prf' 0 then rew Ts prf 
1089 
else 

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

15570  1091 
in SOME (getOpt (rew Ts prf'', (prf'', skel0))) end 
11519  1092 
 rew0 Ts prf = rew Ts prf; 
1093 

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

1095 
 rew1 Ts skel prf = (case rew2 Ts skel prf of 
15531  1096 
SOME prf1 => (case rew0 Ts prf1 of 
15570  1097 
SOME (prf2, skel') => SOME (getOpt (rew1 Ts skel' prf2, prf2)) 
15531  1098 
 NONE => SOME prf1) 
1099 
 NONE => (case rew0 Ts prf of 

15570  1100 
SOME (prf1, skel') => SOME (getOpt (rew1 Ts skel' prf1, prf1)) 
15531  1101 
 NONE => NONE)) 
11519  1102 

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

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

1107 
 _ => (case rew1 Ts (case skel of skel' % _ => skel'  _ => skel0) prf of 
15531  1108 
SOME prf' => SOME (prf' % SOME t) 
1109 
 NONE => NONE)) 

15570  1110 
 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

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

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

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

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

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

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

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

1120 
in case rew1 Ts skel1 prf1 of 
15531  1121 
SOME prf1' => (case rew1 Ts skel2 prf2 of 
1122 
SOME prf2' => SOME (prf1' %% prf2') 

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

1124 
 NONE => (case rew1 Ts skel2 prf2 of 

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

1126 
 NONE => NONE) 

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

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

1129 
(case skel of Abst (_, _, skel') => skel'  _ => skel0) prf of 
15531  1130 
SOME prf' => SOME (Abst (s, T, prf')) 
1131 
 NONE => NONE) 

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

1132 
 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

1133 
(case skel of AbsP (_, _, skel') => skel'  _ => skel0) prf of 
15531  1134 
SOME prf' => SOME (AbsP (s, t, prf')) 
1135 
 NONE => NONE) 

1136 
 rew2 _ _ _ = NONE 

11519  1137 

15570  1138 
in getOpt (rew1 [] skel0 prf, prf) end; 
11519  1139 

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

11519  1142 

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

1143 
fun rewrite_proof_notypes rews = rewrite_prf fst rews; 
11615  1144 

16940  1145 

11519  1146 
(**** theory data ****) 
1147 

16458  1148 
structure ProofData = TheoryDataFun 
1149 
(struct 

11519  1150 
val name = "Pure/proof"; 
1151 
type T = ((proof * proof) list * 

12233  1152 
(string * (typ list > proof > proof option)) list); 
11519  1153 

12233  1154 
val empty = ([], []); 
1155 
val copy = I; 

16458  1156 
val extend = I; 
1157 
fun merge _ ((rules1, procs1), (rules2, procs2)) = 

12293  1158 
(merge_lists rules1 rules2, merge_alists procs1 procs2); 
11519  1159 
fun print _ _ = (); 
16458  1160 
end); 
11519  1161 

16536  1162 
val init_data = ProofData.init; 
11519  1163 

12233  1164 
fun add_prf_rrules rs thy = 
11519  1165 
let val r = ProofData.get thy 
12233  1166 
in ProofData.put (rs @ fst r, snd r) thy end; 
11519  1167 

12233  1168 
fun add_prf_rprocs ps thy = 
11519  1169 
let val r = ProofData.get thy 
12233  1170 
in ProofData.put (fst r, ps @ snd r) thy end; 
11519  1171 

16458  1172 
fun thm_proof thy (name, tags) hyps prop prf = 
11519  1173 
let 
12923  1174 
val prop = Logic.list_implies (hyps, prop); 
11519  1175 
val nvs = needed_vars prop; 
1176 
val args = map (fn (v as Var (ixn, _)) => 

17492  1177 
if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @ 
16983  1178 
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

1179 
val opt_prf = if ! proofs = 2 then 
17492  1180 
#4 (shrink_proof thy [] 0 (rewrite_prf fst (ProofData.get thy) 
15574
b1d1b5bfc464
Removed practically all references to Library.foldr.
skalberg
parents:
15570
diff
changeset

1181 
(foldr (uncurry implies_intr_proof) prf hyps))) 
17017  1182 
else MinProof (mk_min_proof prf ([], [], [])); 
12233  1183 
val head = (case strip_combt (fst (strip_combP prf)) of 
15531  1184 
(PThm ((old_name, _), prf', prop', NONE), args') => 
11519  1185 
if (old_name="" orelse old_name=name) andalso 
1186 
prop = prop' andalso args = args' then 

15531  1187 
PThm ((name, tags), prf', prop, NONE) 
11519  1188 
else 
15531  1189 
PThm ((name, tags), opt_prf, prop, NONE) 
1190 
 _ => PThm ((name, tags), opt_prf, prop, NONE)) 

11519  1191 
in 
12923  1192 
proof_combP (proof_combt' (head, args), map Hyp hyps) 
11519  1193 
end; 
1194 

12923  1195 
fun get_name_tags hyps prop prf = 
1196 
let val prop = Logic.list_implies (hyps, prop) in 

1197 
(case strip_combt (fst (strip_combP prf)) of 

11519  1198 
(PThm ((name, tags), _, prop', _), _) => 
1199 
if prop=prop' then (name, tags) else ("", []) 

1200 
 (PAxm (name, prop', _), _) => 

1201 
if prop=prop' then (name, []) else ("", []) 

12923  1202 
 _ => ("", [])) 
1203 
end; 

11519  1204 

1205 
end; 

1206 

1207 
structure BasicProofterm : BASIC_PROOFTERM = Proofterm; 

1208 
open BasicProofterm; 