author | wenzelm |
Wed, 02 Jun 2010 21:39:35 +0200 | |
changeset 37297 | a1acd424645a |
parent 37228 | 4bbda9fc26db |
child 37310 | 96e2b9a6f074 |
permissions | -rw-r--r-- |
11522 | 1 |
(* Title: Pure/Proof/reconstruct.ML |
11539 | 2 |
Author: Stefan Berghofer, TU Muenchen |
11522 | 3 |
|
4 |
Reconstruction of partial proof terms. |
|
5 |
*) |
|
6 |
||
7 |
signature RECONSTRUCT = |
|
8 |
sig |
|
32738 | 9 |
val quiet_mode : bool Unsynchronized.ref |
16862 | 10 |
val reconstruct_proof : theory -> term -> Proofterm.proof -> Proofterm.proof |
13256
cf85c4f7dcf2
Added function prop_of' taking assumption context as an argument.
berghofe
parents:
13138
diff
changeset
|
11 |
val prop_of' : term list -> Proofterm.proof -> term |
13138 | 12 |
val prop_of : Proofterm.proof -> term |
16862 | 13 |
val expand_proof : theory -> (string * term option) list -> |
13342
915d4d004643
expand_proof now also takes an optional term describing the proposition
berghofe
parents:
13256
diff
changeset
|
14 |
Proofterm.proof -> Proofterm.proof |
11522 | 15 |
end; |
16 |
||
17 |
structure Reconstruct : RECONSTRUCT = |
|
18 |
struct |
|
19 |
||
20 |
open Proofterm; |
|
21 |
||
32738 | 22 |
val quiet_mode = Unsynchronized.ref true; |
11522 | 23 |
fun message s = if !quiet_mode then () else writeln s; |
24 |
||
28813 | 25 |
fun vars_of t = map Var (rev (Term.add_vars t [])); |
26 |
fun frees_of t = map Free (rev (Term.add_frees t [])); |
|
11522 | 27 |
|
27330 | 28 |
fun forall_intr_vfs prop = fold_rev Logic.all |
28813 | 29 |
(vars_of prop @ frees_of prop) prop; |
11522 | 30 |
|
37228
4bbda9fc26db
Use Proofterm.forall_intr_proof' instead of locally defined forall_intr_prf.
berghofe
parents:
36620
diff
changeset
|
31 |
fun forall_intr_vfs_prf prop prf = fold_rev forall_intr_proof' |
28813 | 32 |
(vars_of prop @ frees_of prop) prf; |
12001 | 33 |
|
11522 | 34 |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
35 |
(**** generate constraints for proof term ****) |
11522 | 36 |
|
23178 | 37 |
fun mk_var env Ts T = |
11522 | 38 |
let val (env', v) = Envir.genvar "a" (env, rev Ts ---> T) |
33245 | 39 |
in (list_comb (v, map Bound (length Ts - 1 downto 0)), env') end; |
11522 | 40 |
|
33245 | 41 |
fun mk_tvar S (Envir.Envir {maxidx, tenv, tyenv}) = |
42 |
(TVar (("'t", maxidx + 1), S), |
|
43 |
Envir.Envir {maxidx = maxidx + 1, tenv = tenv, tyenv = tyenv}); |
|
11522 | 44 |
|
19473 | 45 |
val mk_abs = fold (fn T => fn u => Abs ("", T, u)); |
11522 | 46 |
|
20312 | 47 |
fun unifyT thy env T U = |
11522 | 48 |
let |
32032 | 49 |
val Envir.Envir {maxidx, tenv, tyenv} = env; |
50 |
val (tyenv', maxidx') = Sign.typ_unify thy (T, U) (tyenv, maxidx); |
|
51 |
in Envir.Envir {maxidx = maxidx', tenv = tenv, tyenv = tyenv'} end; |
|
11522 | 52 |
|
32032 | 53 |
fun chaseT env (T as TVar v) = |
54 |
(case Type.lookup (Envir.type_env env) v of |
|
55 |
NONE => T |
|
56 |
| SOME T' => chaseT env T') |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
57 |
| chaseT _ T = T; |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
58 |
|
32032 | 59 |
fun infer_type thy (env as Envir.Envir {maxidx, tenv, tyenv}) Ts vTs |
60 |
(t as Const (s, T)) = if T = dummyT then |
|
61 |
(case Sign.const_type thy s of |
|
15531 | 62 |
NONE => error ("reconstruct_proof: No such constant: " ^ quote s) |
23178 | 63 |
| SOME T => |
19419 | 64 |
let val T' = Type.strip_sorts (Logic.incr_tvar (maxidx + 1) T) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
65 |
in (Const (s, T'), T', vTs, |
32032 | 66 |
Envir.Envir {maxidx = maxidx + 1, tenv = tenv, tyenv = tyenv}) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
67 |
end) |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
68 |
else (t, T, vTs, env) |
20312 | 69 |
| infer_type thy env Ts vTs (t as Free (s, T)) = |
17412 | 70 |
if T = dummyT then (case Symtab.lookup vTs s of |
15531 | 71 |
NONE => |
33245 | 72 |
let val (T, env') = mk_tvar [] env |
17412 | 73 |
in (Free (s, T), T, Symtab.update_new (s, T) vTs, env') end |
15531 | 74 |
| SOME T => (Free (s, T), T, vTs, env)) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
75 |
else (t, T, vTs, env) |
20312 | 76 |
| infer_type thy env Ts vTs (Var _) = error "reconstruct_proof: internal error" |
77 |
| infer_type thy env Ts vTs (Abs (s, T, t)) = |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
78 |
let |
33245 | 79 |
val (T', env') = if T = dummyT then mk_tvar [] env else (T, env); |
20312 | 80 |
val (t', U, vTs', env'') = infer_type thy env' (T' :: Ts) vTs t |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
81 |
in (Abs (s, T', t'), T' --> U, vTs', env'') end |
20312 | 82 |
| infer_type thy env Ts vTs (t $ u) = |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
83 |
let |
20312 | 84 |
val (t', T, vTs1, env1) = infer_type thy env Ts vTs t; |
85 |
val (u', U, vTs2, env2) = infer_type thy env1 Ts vTs1 u; |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
86 |
in (case chaseT env2 T of |
20312 | 87 |
Type ("fun", [U', V]) => (t' $ u', V, vTs2, unifyT thy env2 U U') |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
88 |
| _ => |
33245 | 89 |
let val (V, env3) = mk_tvar [] env2 |
20312 | 90 |
in (t' $ u', V, vTs2, unifyT thy env3 T (U --> V)) end) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
91 |
end |
30146 | 92 |
| infer_type thy env Ts vTs (t as Bound i) = ((t, nth Ts i, vTs, env) |
25246
584d8f2e1fc9
Handle Subscript exception when looking up bound variables.
berghofe
parents:
23178
diff
changeset
|
93 |
handle Subscript => error ("infer_type: bad variable index " ^ string_of_int i)); |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
94 |
|
20312 | 95 |
fun cantunify thy (t, u) = error ("Non-unifiable terms:\n" ^ |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26328
diff
changeset
|
96 |
Syntax.string_of_term_global thy t ^ "\n\n" ^ Syntax.string_of_term_global thy u); |
11522 | 97 |
|
33245 | 98 |
fun decompose thy Ts (p as (t, u)) env = |
99 |
let |
|
100 |
fun rigrig (a, T) (b, U) uT ts us = |
|
101 |
if a <> b then cantunify thy p |
|
102 |
else apfst flat (fold_map (decompose thy Ts) (ts ~~ us) (uT env T U)) |
|
103 |
in |
|
104 |
case pairself (strip_comb o Envir.head_norm env) p of |
|
20312 | 105 |
((Const c, ts), (Const d, us)) => rigrig c d (unifyT thy) ts us |
106 |
| ((Free c, ts), (Free d, us)) => rigrig c d (unifyT thy) ts us |
|
13715 | 107 |
| ((Bound i, ts), (Bound j, us)) => |
108 |
rigrig (i, dummyT) (j, dummyT) (K o K) ts us |
|
109 |
| ((Abs (_, T, t), []), (Abs (_, U, u), [])) => |
|
33245 | 110 |
decompose thy (T::Ts) (t, u) (unifyT thy env T U) |
13715 | 111 |
| ((Abs (_, T, t), []), _) => |
33245 | 112 |
decompose thy (T::Ts) (t, incr_boundvars 1 u $ Bound 0) env |
13715 | 113 |
| (_, (Abs (_, T, u), [])) => |
33245 | 114 |
decompose thy (T::Ts) (incr_boundvars 1 t $ Bound 0, u) env |
115 |
| _ => ([(mk_abs Ts t, mk_abs Ts u)], env) |
|
13715 | 116 |
end; |
11522 | 117 |
|
20312 | 118 |
fun make_constraints_cprf thy env cprf = |
11522 | 119 |
let |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
120 |
fun add_cnstrt Ts prop prf cs env vTs (t, u) = |
11522 | 121 |
let |
122 |
val t' = mk_abs Ts t; |
|
12236 | 123 |
val u' = mk_abs Ts u |
11522 | 124 |
in |
20312 | 125 |
(prop, prf, cs, Pattern.unify thy (t', u') env, vTs) |
12236 | 126 |
handle Pattern.Pattern => |
33245 | 127 |
let val (cs', env') = decompose thy [] (t', u') env |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
128 |
in (prop, prf, cs @ cs', env', vTs) end |
12236 | 129 |
| Pattern.Unif => |
20312 | 130 |
cantunify thy (Envir.norm_term env t', Envir.norm_term env u') |
11522 | 131 |
end; |
132 |
||
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
133 |
fun mk_cnstrts_atom env vTs prop opTs prf = |
11522 | 134 |
let |
36042
85efdadee8ae
switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
krauss
parents:
33245
diff
changeset
|
135 |
val tvars = Term.add_tvars prop [] |> rev; |
85efdadee8ae
switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
krauss
parents:
33245
diff
changeset
|
136 |
val tfrees = Term.add_tfrees prop [] |> rev; |
33245 | 137 |
val (Ts, env') = |
31903 | 138 |
(case opTs of |
33245 | 139 |
NONE => fold_map mk_tvar (map snd tvars @ map snd tfrees) env |
140 |
| SOME Ts => (Ts, env)); |
|
28813 | 141 |
val prop' = subst_atomic_types (map TVar tvars @ map TFree tfrees ~~ Ts) |
142 |
(forall_intr_vfs prop) handle Library.UnequalLengths => |
|
37297 | 143 |
error ("Wrong number of type arguments for " ^ quote (guess_name prf)) |
28813 | 144 |
in (prop', change_type (SOME Ts) prf, [], env', vTs) end; |
11522 | 145 |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
146 |
fun head_norm (prop, prf, cnstrts, env, vTs) = |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
147 |
(Envir.head_norm env prop, prf, cnstrts, env, vTs); |
23178 | 148 |
|
30146 | 149 |
fun mk_cnstrts env _ Hs vTs (PBound i) = ((nth Hs i, PBound i, [], env, vTs) |
25246
584d8f2e1fc9
Handle Subscript exception when looking up bound variables.
berghofe
parents:
23178
diff
changeset
|
150 |
handle Subscript => error ("mk_cnstrts: bad variable index " ^ string_of_int i)) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
151 |
| mk_cnstrts env Ts Hs vTs (Abst (s, opT, cprf)) = |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
152 |
let |
33245 | 153 |
val (T, env') = |
154 |
(case opT of |
|
155 |
NONE => mk_tvar [] env |
|
156 |
| SOME T => (T, env)); |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
157 |
val (t, prf, cnstrts, env'', vTs') = |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
158 |
mk_cnstrts env' (T::Ts) (map (incr_boundvars 1) Hs) vTs cprf; |
15531 | 159 |
in (Const ("all", (T --> propT) --> propT) $ Abs (s, T, t), Abst (s, SOME T, prf), |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
160 |
cnstrts, env'', vTs') |
11522 | 161 |
end |
15531 | 162 |
| mk_cnstrts env Ts Hs vTs (AbsP (s, SOME t, cprf)) = |
11522 | 163 |
let |
20312 | 164 |
val (t', _, vTs', env') = infer_type thy env Ts vTs t; |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
165 |
val (u, prf, cnstrts, env'', vTs'') = mk_cnstrts env' Ts (t'::Hs) vTs' cprf; |
15531 | 166 |
in (Logic.mk_implies (t', u), AbsP (s, SOME t', prf), cnstrts, env'', vTs'') |
11522 | 167 |
end |
15531 | 168 |
| mk_cnstrts env Ts Hs vTs (AbsP (s, NONE, cprf)) = |
11522 | 169 |
let |
33245 | 170 |
val (t, env') = mk_var env Ts propT; |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
171 |
val (u, prf, cnstrts, env'', vTs') = mk_cnstrts env' Ts (t::Hs) vTs cprf; |
15531 | 172 |
in (Logic.mk_implies (t, u), AbsP (s, SOME t, prf), cnstrts, env'', vTs') |
11522 | 173 |
end |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
174 |
| mk_cnstrts env Ts Hs vTs (cprf1 %% cprf2) = |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
175 |
let val (u, prf2, cnstrts, env', vTs') = mk_cnstrts env Ts Hs vTs cprf2 |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
176 |
in (case head_norm (mk_cnstrts env' Ts Hs vTs' cprf1) of |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
177 |
(Const ("==>", _) $ u' $ t', prf1, cnstrts', env'', vTs'') => |
11613 | 178 |
add_cnstrt Ts t' (prf1 %% prf2) (cnstrts' @ cnstrts) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
179 |
env'' vTs'' (u, u') |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
180 |
| (t, prf1, cnstrts', env'', vTs'') => |
33245 | 181 |
let val (v, env''') = mk_var env'' Ts propT |
11613 | 182 |
in add_cnstrt Ts v (prf1 %% prf2) (cnstrts' @ cnstrts) |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
183 |
env''' vTs'' (t, Logic.mk_implies (u, v)) |
11522 | 184 |
end) |
185 |
end |
|
15531 | 186 |
| mk_cnstrts env Ts Hs vTs (cprf % SOME t) = |
20312 | 187 |
let val (t', U, vTs1, env1) = infer_type thy env Ts vTs t |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
188 |
in (case head_norm (mk_cnstrts env1 Ts Hs vTs1 cprf) of |
11522 | 189 |
(Const ("all", Type ("fun", [Type ("fun", [T, _]), _])) $ f, |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
190 |
prf, cnstrts, env2, vTs2) => |
20312 | 191 |
let val env3 = unifyT thy env2 T U |
15531 | 192 |
in (betapply (f, t'), prf % SOME t', cnstrts, env3, vTs2) |
11522 | 193 |
end |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
194 |
| (u, prf, cnstrts, env2, vTs2) => |
33245 | 195 |
let val (v, env3) = mk_var env2 Ts (U --> propT); |
11522 | 196 |
in |
15531 | 197 |
add_cnstrt Ts (v $ t') (prf % SOME t') cnstrts env3 vTs2 |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
198 |
(u, Const ("all", (U --> propT) --> propT) $ v) |
11522 | 199 |
end) |
200 |
end |
|
15531 | 201 |
| mk_cnstrts env Ts Hs vTs (cprf % NONE) = |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
202 |
(case head_norm (mk_cnstrts env Ts Hs vTs cprf) of |
11522 | 203 |
(Const ("all", Type ("fun", [Type ("fun", [T, _]), _])) $ f, |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
204 |
prf, cnstrts, env', vTs') => |
33245 | 205 |
let val (t, env'') = mk_var env' Ts T |
15531 | 206 |
in (betapply (f, t), prf % SOME t, cnstrts, env'', vTs') |
11522 | 207 |
end |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
208 |
| (u, prf, cnstrts, env', vTs') => |
11522 | 209 |
let |
33245 | 210 |
val (T, env1) = mk_tvar [] env'; |
211 |
val (v, env2) = mk_var env1 Ts (T --> propT); |
|
212 |
val (t, env3) = mk_var env2 Ts T |
|
11522 | 213 |
in |
15531 | 214 |
add_cnstrt Ts (v $ t) (prf % SOME t) cnstrts env3 vTs' |
11522 | 215 |
(u, Const ("all", (T --> propT) --> propT) $ v) |
216 |
end) |
|
28808 | 217 |
| mk_cnstrts env _ _ vTs (prf as PThm (_, ((_, prop, opTs), _))) = |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
218 |
mk_cnstrts_atom env vTs prop opTs prf |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
219 |
| mk_cnstrts env _ _ vTs (prf as PAxm (_, prop, opTs)) = |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
220 |
mk_cnstrts_atom env vTs prop opTs prf |
31943
5e960a0780a2
renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents:
31903
diff
changeset
|
221 |
| mk_cnstrts env _ _ vTs (prf as OfClass (T, c)) = |
5e960a0780a2
renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents:
31903
diff
changeset
|
222 |
mk_cnstrts_atom env vTs (Logic.mk_of_class (T, c)) NONE prf |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
223 |
| mk_cnstrts env _ _ vTs (prf as Oracle (_, prop, opTs)) = |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
224 |
mk_cnstrts_atom env vTs prop opTs prf |
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
225 |
| mk_cnstrts env _ _ vTs (Hyp t) = (t, Hyp t, [], env, vTs) |
11613 | 226 |
| mk_cnstrts _ _ _ _ _ = error "reconstruct_proof: minimal proof object" |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
227 |
in mk_cnstrts env [] [] Symtab.empty cprf end; |
11522 | 228 |
|
229 |
||
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
230 |
(**** update list of free variables of constraints ****) |
11522 | 231 |
|
232 |
fun upd_constrs env cs = |
|
233 |
let |
|
32032 | 234 |
val tenv = Envir.term_env env; |
235 |
val tyenv = Envir.type_env env; |
|
20675 | 236 |
val dom = [] |
32032 | 237 |
|> Vartab.fold (cons o #1) tenv |
238 |
|> Vartab.fold (cons o #1) tyenv; |
|
20675 | 239 |
val vran = [] |
32032 | 240 |
|> Vartab.fold (Term.add_var_names o #2 o #2) tenv |
241 |
|> Vartab.fold (Term.add_tvar_namesT o #2 o #2) tyenv; |
|
11522 | 242 |
fun check_cs [] = [] |
32032 | 243 |
| check_cs ((u, p, vs) :: ps) = |
244 |
let val vs' = subtract (op =) dom vs in |
|
245 |
if vs = vs' then (u, p, vs) :: check_cs ps |
|
246 |
else (true, p, fold (insert op =) vs' vran) :: check_cs ps |
|
247 |
end; |
|
11522 | 248 |
in check_cs cs end; |
249 |
||
32032 | 250 |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
251 |
(**** solution of constraints ****) |
11522 | 252 |
|
253 |
fun solve _ [] bigenv = bigenv |
|
20312 | 254 |
| solve thy cs bigenv = |
11522 | 255 |
let |
11660 | 256 |
fun search env [] = error ("Unsolvable constraints:\n" ^ |
257 |
Pretty.string_of (Pretty.chunks (map (fn (_, p, _) => |
|
32187 | 258 |
Goal_Display.pretty_flexpair (Syntax.init_pretty_global thy) (pairself |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
259 |
(Envir.norm_term bigenv) p)) cs))) |
11522 | 260 |
| search env ((u, p as (t1, t2), vs)::ps) = |
261 |
if u then |
|
262 |
let |
|
263 |
val tn1 = Envir.norm_term bigenv t1; |
|
264 |
val tn2 = Envir.norm_term bigenv t2 |
|
265 |
in |
|
266 |
if Pattern.pattern tn1 andalso Pattern.pattern tn2 then |
|
20312 | 267 |
(Pattern.unify thy (tn1, tn2) env, ps) handle Pattern.Unif => |
268 |
cantunify thy (tn1, tn2) |
|
11522 | 269 |
else |
33245 | 270 |
let val (cs', env') = decompose thy [] (tn1, tn2) env |
11522 | 271 |
in if cs' = [(tn1, tn2)] then |
272 |
apsnd (cons (false, (tn1, tn2), vs)) (search env ps) |
|
273 |
else search env' (map (fn q => (true, q, vs)) cs' @ ps) |
|
274 |
end |
|
275 |
end |
|
276 |
else apsnd (cons (false, p, vs)) (search env ps); |
|
277 |
val Envir.Envir {maxidx, ...} = bigenv; |
|
278 |
val (env, cs') = search (Envir.empty maxidx) cs; |
|
279 |
in |
|
32032 | 280 |
solve thy (upd_constrs env cs') (Envir.merge (bigenv, env)) |
11522 | 281 |
end; |
282 |
||
283 |
||
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
284 |
(**** reconstruction of proofs ****) |
11522 | 285 |
|
20312 | 286 |
fun reconstruct_proof thy prop cprf = |
11522 | 287 |
let |
15531 | 288 |
val (cprf' % SOME prop', thawf) = freeze_thaw_prf (cprf % SOME prop); |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
289 |
val _ = message "Collecting constraints..."; |
20312 | 290 |
val (t, prf, cs, env, _) = make_constraints_cprf thy |
291 |
(Envir.empty (maxidx_proof cprf ~1)) cprf'; |
|
33042 | 292 |
val cs' = map (fn p => (true, p, uncurry (union (op =)) |
29265
5b4247055bd7
moved old add_term_vars, add_term_frees etc. to structure OldTerm;
wenzelm
parents:
29259
diff
changeset
|
293 |
(pairself (map (fst o dest_Var) o OldTerm.term_vars) p))) |
20312 | 294 |
(map (pairself (Envir.norm_term env)) ((t, prop')::cs)); |
11522 | 295 |
val _ = message ("Solving remaining constraints (" ^ string_of_int (length cs') ^ ") ..."); |
20312 | 296 |
val env' = solve thy cs' env |
11522 | 297 |
in |
298 |
thawf (norm_proof env' prf) |
|
299 |
end; |
|
300 |
||
28813 | 301 |
fun prop_of_atom prop Ts = subst_atomic_types |
36042
85efdadee8ae
switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
krauss
parents:
33245
diff
changeset
|
302 |
(map TVar (Term.add_tvars prop [] |> rev) @ map TFree (Term.add_tfrees prop [] |> rev) ~~ Ts) |
28813 | 303 |
(forall_intr_vfs prop); |
13138 | 304 |
|
13734
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
305 |
val head_norm = Envir.head_norm (Envir.empty 0); |
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
306 |
|
30146 | 307 |
fun prop_of0 Hs (PBound i) = nth Hs i |
15531 | 308 |
| prop_of0 Hs (Abst (s, SOME T, prf)) = |
27330 | 309 |
Term.all T $ (Abs (s, T, prop_of0 Hs prf)) |
15531 | 310 |
| prop_of0 Hs (AbsP (s, SOME t, prf)) = |
13734
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
311 |
Logic.mk_implies (t, prop_of0 (t :: Hs) prf) |
15531 | 312 |
| prop_of0 Hs (prf % SOME t) = (case head_norm (prop_of0 Hs prf) of |
13734
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
313 |
Const ("all", _) $ f => f $ t |
13256
cf85c4f7dcf2
Added function prop_of' taking assumption context as an argument.
berghofe
parents:
13138
diff
changeset
|
314 |
| _ => error "prop_of: all expected") |
13734
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
315 |
| prop_of0 Hs (prf1 %% prf2) = (case head_norm (prop_of0 Hs prf1) of |
13256
cf85c4f7dcf2
Added function prop_of' taking assumption context as an argument.
berghofe
parents:
13138
diff
changeset
|
316 |
Const ("==>", _) $ P $ Q => Q |
cf85c4f7dcf2
Added function prop_of' taking assumption context as an argument.
berghofe
parents:
13138
diff
changeset
|
317 |
| _ => error "prop_of: ==> expected") |
13734
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
318 |
| prop_of0 Hs (Hyp t) = t |
28808 | 319 |
| prop_of0 Hs (PThm (_, ((_, prop, SOME Ts), _))) = prop_of_atom prop Ts |
15531 | 320 |
| prop_of0 Hs (PAxm (_, prop, SOME Ts)) = prop_of_atom prop Ts |
31943
5e960a0780a2
renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents:
31903
diff
changeset
|
321 |
| prop_of0 Hs (OfClass (T, c)) = Logic.mk_of_class (T, c) |
15531 | 322 |
| prop_of0 Hs (Oracle (_, prop, SOME Ts)) = prop_of_atom prop Ts |
13734
50dcee1c509e
prop_of now returns proposition in beta-eta normal form.
berghofe
parents:
13715
diff
changeset
|
323 |
| prop_of0 _ _ = error "prop_of: partial proof object"; |
13138 | 324 |
|
18929 | 325 |
val prop_of' = Envir.beta_eta_contract oo prop_of0; |
13256
cf85c4f7dcf2
Added function prop_of' taking assumption context as an argument.
berghofe
parents:
13138
diff
changeset
|
326 |
val prop_of = prop_of' []; |
13138 | 327 |
|
11522 | 328 |
|
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
329 |
(**** expand and reconstruct subproofs ****) |
11522 | 330 |
|
20312 | 331 |
fun expand_proof thy thms prf = |
11522 | 332 |
let |
23178 | 333 |
fun expand maxidx prfs (AbsP (s, t, prf)) = |
12870
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
334 |
let val (maxidx', prfs', prf') = expand maxidx prfs prf |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
335 |
in (maxidx', prfs', AbsP (s, t, prf')) end |
23178 | 336 |
| expand maxidx prfs (Abst (s, T, prf)) = |
12870
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
337 |
let val (maxidx', prfs', prf') = expand maxidx prfs prf |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
338 |
in (maxidx', prfs', Abst (s, T, prf')) end |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
339 |
| expand maxidx prfs (prf1 %% prf2) = |
11522 | 340 |
let |
12870
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
341 |
val (maxidx', prfs', prf1') = expand maxidx prfs prf1; |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
342 |
val (maxidx'', prfs'', prf2') = expand maxidx' prfs' prf2; |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
343 |
in (maxidx'', prfs'', prf1' %% prf2') end |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
344 |
| expand maxidx prfs (prf % t) = |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
345 |
let val (maxidx', prfs', prf') = expand maxidx prfs prf |
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
346 |
in (maxidx', prfs', prf' % t) end |
28808 | 347 |
| expand maxidx prfs (prf as PThm (_, ((a, prop, SOME Ts), body))) = |
13342
915d4d004643
expand_proof now also takes an optional term describing the proposition
berghofe
parents:
13256
diff
changeset
|
348 |
if not (exists |
15531 | 349 |
(fn (b, NONE) => a = b |
350 |
| (b, SOME prop') => a = b andalso prop = prop') thms) |
|
13342
915d4d004643
expand_proof now also takes an optional term describing the proposition
berghofe
parents:
13256
diff
changeset
|
351 |
then (maxidx, prfs, prf) else |
11522 | 352 |
let |
16862 | 353 |
val (maxidx', prf, prfs') = |
17232 | 354 |
(case AList.lookup (op =) prfs (a, prop) of |
15531 | 355 |
NONE => |
11522 | 356 |
let |
357 |
val _ = message ("Reconstructing proof of " ^ a); |
|
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26328
diff
changeset
|
358 |
val _ = message (Syntax.string_of_term_global thy prop); |
13610
d4a2ac255447
Fixed bug in expand_proof which caused indexes to be incremented incorrectly.
berghofe
parents:
13342
diff
changeset
|
359 |
val prf' = forall_intr_vfs_prf prop |
29635
31d14e9fa0da
proof_body: turned lazy into future -- ensures that body is fulfilled eventually, without explicit force;
wenzelm
parents:
29270
diff
changeset
|
360 |
(reconstruct_proof thy prop (join_proof body)); |
12870
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
361 |
val (maxidx', prfs', prf) = expand |
20312 | 362 |
(maxidx_proof prf' ~1) prfs prf' |
32028 | 363 |
in (maxidx' + maxidx + 1, incr_indexes (maxidx + 1) prf, |
13610
d4a2ac255447
Fixed bug in expand_proof which caused indexes to be incremented incorrectly.
berghofe
parents:
13342
diff
changeset
|
364 |
((a, prop), (maxidx', prf)) :: prfs') |
d4a2ac255447
Fixed bug in expand_proof which caused indexes to be incremented incorrectly.
berghofe
parents:
13342
diff
changeset
|
365 |
end |
15531 | 366 |
| SOME (maxidx', prf) => (maxidx' + maxidx + 1, |
32028 | 367 |
incr_indexes (maxidx + 1) prf, prfs)); |
36042
85efdadee8ae
switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
krauss
parents:
33245
diff
changeset
|
368 |
val tfrees = Term.add_tfrees prop [] |> rev; |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
369 |
val tye = map (fn ((s, j), _) => (s, maxidx + 1 + j)) |
36042
85efdadee8ae
switched PThm/PAxm etc. to use canonical order of type variables (term variables unchanged)
krauss
parents:
33245
diff
changeset
|
370 |
(Term.add_tvars prop [] |> rev) @ map (rpair ~1 o fst) tfrees ~~ Ts; |
13669
a9f229eafba7
- reconstruct_proof no longer relies on TypeInfer.infer_types
berghofe
parents:
13610
diff
changeset
|
371 |
val varify = map_type_tfree (fn p as (a, S) => |
20675 | 372 |
if member (op =) tfrees p then TVar ((a, ~1), S) else TFree p) |
11522 | 373 |
in |
36620
e6bb250402b5
simplified/unified fundamental operations on types/terms/proofterms -- prefer Same.operation over "option" variant;
wenzelm
parents:
36042
diff
changeset
|
374 |
(maxidx', prfs', map_proof_types (typ_subst_TVars tye o varify) prf) |
11522 | 375 |
end |
12870
3905bc0e9002
Indexes of variables in expanded proofs are now incremented to avoid clashes.
berghofe
parents:
12527
diff
changeset
|
376 |
| expand maxidx prfs prf = (maxidx, prfs, prf); |
11522 | 377 |
|
20312 | 378 |
in #3 (expand (maxidx_proof prf ~1) [] prf) end; |
11522 | 379 |
|
380 |
end; |