author | paulson |
Thu, 21 Mar 1996 11:06:59 +0100 | |
changeset 1597 | 54ece585bf62 |
parent 1580 | e3fd931e6095 |
child 1634 | 9b9cdef70669 |
permissions | -rw-r--r-- |
250 | 1 |
(* Title: Pure/thm.ML |
0 | 2 |
ID: $Id$ |
250 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
4 |
Copyright 1994 University of Cambridge |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
5 |
|
1160 | 6 |
The core of Isabelle's Meta Logic: certified types and terms, meta |
1529 | 7 |
theorems, meta rules (including resolution and simplification). |
0 | 8 |
*) |
9 |
||
250 | 10 |
signature THM = |
1503 | 11 |
sig |
1160 | 12 |
(*certified types*) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
13 |
type ctyp |
1238 | 14 |
val rep_ctyp : ctyp -> {sign: Sign.sg, T: typ} |
15 |
val typ_of : ctyp -> typ |
|
16 |
val ctyp_of : Sign.sg -> typ -> ctyp |
|
17 |
val read_ctyp : Sign.sg -> string -> ctyp |
|
1160 | 18 |
|
19 |
(*certified terms*) |
|
20 |
type cterm |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
21 |
exception CTERM of string |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
22 |
val rep_cterm : cterm -> {sign: Sign.sg, t: term, T: typ, |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
23 |
maxidx: int} |
1238 | 24 |
val term_of : cterm -> term |
25 |
val cterm_of : Sign.sg -> term -> cterm |
|
26 |
val read_cterm : Sign.sg -> string * typ -> cterm |
|
1394
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
27 |
val read_cterms : Sign.sg -> string list * typ list -> cterm list |
1238 | 28 |
val cterm_fun : (term -> term) -> (cterm -> cterm) |
29 |
val dest_cimplies : cterm -> cterm * cterm |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
30 |
val dest_comb : cterm -> cterm * cterm |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
31 |
val dest_abs : cterm -> cterm * cterm |
1516
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
32 |
val capply : cterm -> cterm -> cterm |
1517 | 33 |
val cabs : cterm -> cterm -> cterm |
1238 | 34 |
val read_def_cterm : |
1160 | 35 |
Sign.sg * (indexname -> typ option) * (indexname -> sort option) -> |
36 |
string list -> bool -> string * typ -> cterm * (indexname * typ) list |
|
37 |
||
1529 | 38 |
(*theories*) |
39 |
||
40 |
(*proof terms [must duplicate declaration as a specification]*) |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
41 |
datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv; |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
42 |
val keep_derivs : deriv_kind ref |
1529 | 43 |
datatype rule = |
44 |
MinProof |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
45 |
| Oracle of theory * Sign.sg * exn |
1529 | 46 |
| Axiom of theory * string |
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
47 |
| Theorem of string |
1529 | 48 |
| Assume of cterm |
49 |
| Implies_intr of cterm |
|
50 |
| Implies_intr_shyps |
|
51 |
| Implies_intr_hyps |
|
52 |
| Implies_elim |
|
53 |
| Forall_intr of cterm |
|
54 |
| Forall_elim of cterm |
|
55 |
| Reflexive of cterm |
|
56 |
| Symmetric |
|
57 |
| Transitive |
|
58 |
| Beta_conversion of cterm |
|
59 |
| Extensional |
|
60 |
| Abstract_rule of string * cterm |
|
61 |
| Combination |
|
62 |
| Equal_intr |
|
63 |
| Equal_elim |
|
64 |
| Trivial of cterm |
|
65 |
| Lift_rule of cterm * int |
|
66 |
| Assumption of int * Envir.env option |
|
67 |
| Instantiate of (indexname * ctyp) list * (cterm * cterm) list |
|
68 |
| Bicompose of bool * bool * int * int * Envir.env |
|
69 |
| Flexflex_rule of Envir.env |
|
70 |
| Class_triv of theory * class |
|
71 |
| VarifyT |
|
72 |
| FreezeT |
|
73 |
| RewriteC of cterm |
|
74 |
| CongC of cterm |
|
75 |
| Rewrite_cterm of cterm |
|
76 |
| Rename_params_rule of string list * int; |
|
77 |
||
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
78 |
type deriv (* = rule mtree *) |
1529 | 79 |
|
1160 | 80 |
(*meta theorems*) |
81 |
type thm |
|
82 |
exception THM of string * int * thm list |
|
1529 | 83 |
val rep_thm : thm -> {sign: Sign.sg, der: deriv, maxidx: int, |
84 |
shyps: sort list, hyps: term list, |
|
85 |
prop: term} |
|
86 |
val crep_thm : thm -> {sign: Sign.sg, der: deriv, maxidx: int, |
|
87 |
shyps: sort list, hyps: cterm list, |
|
88 |
prop: cterm} |
|
1238 | 89 |
val stamps_of_thm : thm -> string ref list |
90 |
val tpairs_of : thm -> (term * term) list |
|
91 |
val prems_of : thm -> term list |
|
92 |
val nprems_of : thm -> int |
|
93 |
val concl_of : thm -> term |
|
94 |
val cprop_of : thm -> cterm |
|
95 |
val extra_shyps : thm -> sort list |
|
96 |
val force_strip_shyps : bool ref (* FIXME tmp *) |
|
97 |
val strip_shyps : thm -> thm |
|
98 |
val implies_intr_shyps: thm -> thm |
|
99 |
val get_axiom : theory -> string -> thm |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
100 |
val name_thm : string * thm -> thm |
1238 | 101 |
val axioms_of : theory -> (string * thm) list |
1160 | 102 |
|
103 |
(*meta rules*) |
|
1238 | 104 |
val assume : cterm -> thm |
1416 | 105 |
val compress : thm -> thm |
1238 | 106 |
val implies_intr : cterm -> thm -> thm |
107 |
val implies_elim : thm -> thm -> thm |
|
108 |
val forall_intr : cterm -> thm -> thm |
|
109 |
val forall_elim : cterm -> thm -> thm |
|
110 |
val flexpair_def : thm |
|
111 |
val reflexive : cterm -> thm |
|
112 |
val symmetric : thm -> thm |
|
113 |
val transitive : thm -> thm -> thm |
|
114 |
val beta_conversion : cterm -> thm |
|
115 |
val extensional : thm -> thm |
|
116 |
val abstract_rule : string -> cterm -> thm -> thm |
|
117 |
val combination : thm -> thm -> thm |
|
118 |
val equal_intr : thm -> thm -> thm |
|
119 |
val equal_elim : thm -> thm -> thm |
|
120 |
val implies_intr_hyps : thm -> thm |
|
121 |
val flexflex_rule : thm -> thm Sequence.seq |
|
122 |
val instantiate : |
|
1160 | 123 |
(indexname * ctyp) list * (cterm * cterm) list -> thm -> thm |
1238 | 124 |
val trivial : cterm -> thm |
125 |
val class_triv : theory -> class -> thm |
|
126 |
val varifyT : thm -> thm |
|
127 |
val freezeT : thm -> thm |
|
128 |
val dest_state : thm * int -> |
|
1160 | 129 |
(term * term) list * term list * term * term |
1238 | 130 |
val lift_rule : (thm * int) -> thm -> thm |
131 |
val assumption : int -> thm -> thm Sequence.seq |
|
132 |
val eq_assumption : int -> thm -> thm |
|
1160 | 133 |
val rename_params_rule: string list * int -> thm -> thm |
1238 | 134 |
val bicompose : bool -> bool * thm * int -> |
1160 | 135 |
int -> thm -> thm Sequence.seq |
1238 | 136 |
val biresolution : bool -> (bool * thm) list -> |
1160 | 137 |
int -> thm -> thm Sequence.seq |
138 |
||
139 |
(*meta simplification*) |
|
140 |
type meta_simpset |
|
141 |
exception SIMPLIFIER of string * thm |
|
1238 | 142 |
val empty_mss : meta_simpset |
143 |
val add_simps : meta_simpset * thm list -> meta_simpset |
|
144 |
val del_simps : meta_simpset * thm list -> meta_simpset |
|
145 |
val mss_of : thm list -> meta_simpset |
|
146 |
val add_congs : meta_simpset * thm list -> meta_simpset |
|
147 |
val add_prems : meta_simpset * thm list -> meta_simpset |
|
148 |
val prems_of_mss : meta_simpset -> thm list |
|
149 |
val set_mk_rews : meta_simpset * (thm -> thm list) -> meta_simpset |
|
150 |
val mk_rews_of_mss : meta_simpset -> thm -> thm list |
|
151 |
val trace_simp : bool ref |
|
152 |
val rewrite_cterm : bool * bool -> meta_simpset -> |
|
1529 | 153 |
(meta_simpset -> thm -> thm option) -> cterm -> thm |
1539 | 154 |
|
155 |
val invoke_oracle : theory * Sign.sg * exn -> thm |
|
250 | 156 |
end; |
0 | 157 |
|
1503 | 158 |
structure Thm : THM = |
0 | 159 |
struct |
250 | 160 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
161 |
(*** Certified terms and types ***) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
162 |
|
250 | 163 |
(** certified types **) |
164 |
||
165 |
(*certified typs under a signature*) |
|
166 |
||
167 |
datatype ctyp = Ctyp of {sign: Sign.sg, T: typ}; |
|
168 |
||
169 |
fun rep_ctyp (Ctyp args) = args; |
|
170 |
fun typ_of (Ctyp {T, ...}) = T; |
|
171 |
||
172 |
fun ctyp_of sign T = |
|
173 |
Ctyp {sign = sign, T = Sign.certify_typ sign T}; |
|
174 |
||
175 |
fun read_ctyp sign s = |
|
176 |
Ctyp {sign = sign, T = Sign.read_typ (sign, K None) s}; |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
177 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
178 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
179 |
|
250 | 180 |
(** certified terms **) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
181 |
|
250 | 182 |
(*certified terms under a signature, with checked typ and maxidx of Vars*) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
183 |
|
250 | 184 |
datatype cterm = Cterm of {sign: Sign.sg, t: term, T: typ, maxidx: int}; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
185 |
|
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
186 |
fun rep_cterm (Cterm args) = args; |
250 | 187 |
fun term_of (Cterm {t, ...}) = t; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
188 |
|
250 | 189 |
(*create a cterm by checking a "raw" term with respect to a signature*) |
190 |
fun cterm_of sign tm = |
|
191 |
let val (t, T, maxidx) = Sign.certify_term sign tm |
|
1394
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
192 |
in Cterm {sign = sign, t = t, T = T, maxidx = maxidx} |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
193 |
end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
194 |
|
250 | 195 |
fun cterm_fun f (Cterm {sign, t, ...}) = cterm_of sign (f t); |
196 |
||
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
197 |
|
250 | 198 |
(*dest_implies for cterms. Note T=prop below*) |
199 |
fun dest_cimplies (Cterm{sign, T, maxidx, t=Const("==>", _) $ A $ B}) = |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
200 |
(Cterm{sign=sign, T=T, maxidx=maxidx, t=A}, |
250 | 201 |
Cterm{sign=sign, T=T, maxidx=maxidx, t=B}) |
202 |
| dest_cimplies ct = raise TERM ("dest_cimplies", [term_of ct]); |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
203 |
|
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
204 |
exception CTERM of string; |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
205 |
|
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
206 |
(*Destruct application in cterms*) |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
207 |
fun dest_comb (Cterm{sign, T, maxidx, t = A $ B}) = |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
208 |
let val typeA = fastype_of A; |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
209 |
val typeB = |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
210 |
case typeA of Type("fun",[S,T]) => S |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
211 |
| _ => error "Function type expected in dest_comb"; |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
212 |
in |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
213 |
(Cterm {sign=sign, maxidx=maxidx, t=A, T=typeA}, |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
214 |
Cterm {sign=sign, maxidx=maxidx, t=B, T=typeB}) |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
215 |
end |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
216 |
| dest_comb _ = raise CTERM "dest_comb"; |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
217 |
|
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
218 |
(*Destruct abstraction in cterms*) |
1516
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
219 |
fun dest_abs (Cterm {sign, T as Type("fun",[_,S]), maxidx, t=Abs(x,ty,M)}) = |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
220 |
let val (y,N) = variant_abs (x,ty,M) |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
221 |
in (Cterm {sign = sign, T = ty, maxidx = 0, t = Free(y,ty)}, |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
222 |
Cterm {sign = sign, T = S, maxidx = maxidx, t = N}) |
1493
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
223 |
end |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
224 |
| dest_abs _ = raise CTERM "dest_abs"; |
e936723cb94d
added dest_comb, dest_abs and mk_prop for manipulating cterms
clasohm
parents:
1460
diff
changeset
|
225 |
|
1516
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
226 |
(*Form cterm out of a function and an argument*) |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
227 |
fun capply (Cterm {t=f, sign=sign1, T=Type("fun",[dty,rty]), maxidx=maxidx1}) |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
228 |
(Cterm {t=x, sign=sign2, T, maxidx=maxidx2}) = |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
229 |
if T = dty then Cterm{t=f$x, sign=Sign.merge(sign1,sign2), T=rty, |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
230 |
maxidx=max[maxidx1, maxidx2]} |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
231 |
else raise CTERM "capply: types don't agree" |
96286c4e32de
removed mk_prop; added capply; simplified dest_abs
clasohm
parents:
1503
diff
changeset
|
232 |
| capply _ _ = raise CTERM "capply: first arg is not a function" |
250 | 233 |
|
1517 | 234 |
fun cabs (Cterm {t=Free(a,ty), sign=sign1, T=T1, maxidx=maxidx1}) |
235 |
(Cterm {t=t2, sign=sign2, T=T2, maxidx=maxidx2}) = |
|
236 |
Cterm {t=absfree(a,ty,t2), sign=Sign.merge(sign1,sign2), |
|
237 |
T = ty --> T2, maxidx=max[maxidx1, maxidx2]} |
|
238 |
| cabs _ _ = raise CTERM "cabs: first arg is not a free variable"; |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
239 |
|
574 | 240 |
(** read cterms **) (*exception ERROR*) |
250 | 241 |
|
242 |
(*read term, infer types, certify term*) |
|
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
243 |
fun read_def_cterm (sign, types, sorts) used freeze (a, T) = |
250 | 244 |
let |
574 | 245 |
val T' = Sign.certify_typ sign T |
246 |
handle TYPE (msg, _, _) => error msg; |
|
623 | 247 |
val ts = Syntax.read (#syn (Sign.rep_sg sign)) T' a; |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
248 |
val (_, t', tye) = |
959 | 249 |
Sign.infer_types sign types sorts used freeze (ts, T'); |
574 | 250 |
val ct = cterm_of sign t' |
1394
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
251 |
handle TYPE arg => error (Sign.exn_type_msg sign arg) |
1460 | 252 |
| TERM (msg, _) => error msg; |
250 | 253 |
in (ct, tye) end; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
254 |
|
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
255 |
fun read_cterm sign = #1 o read_def_cterm (sign, K None, K None) [] true; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
256 |
|
1394
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
257 |
(*read a list of terms, matching them against a list of expected types. |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
258 |
NO disambiguation of alternative parses via type-checking -- it is just |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
259 |
not practical.*) |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
260 |
fun read_cterms sign (bs, Ts) = |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
261 |
let |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
262 |
val {tsig, syn, ...} = Sign.rep_sg sign |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
263 |
fun read (b,T) = |
1460 | 264 |
case Syntax.read syn T b of |
265 |
[t] => t |
|
266 |
| _ => error("Error or ambiguity in parsing of " ^ b) |
|
1394
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
267 |
val (us,_) = Type.infer_types(tsig, Sign.const_type sign, |
1460 | 268 |
K None, K None, |
269 |
[], true, |
|
270 |
map (Sign.certify_typ sign) Ts, |
|
271 |
map read (bs~~Ts)) |
|
1394
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
272 |
in map (cterm_of sign) us end |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
273 |
handle TYPE arg => error (Sign.exn_type_msg sign arg) |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
274 |
| TERM (msg, _) => error msg; |
a1d2735f5ade
New function read_cterms is a combination of read_def_cterm and
paulson
parents:
1258
diff
changeset
|
275 |
|
250 | 276 |
|
277 |
||
1529 | 278 |
(*** Derivations ***) |
279 |
||
280 |
(*Names of rules in derivations. Includes logically trivial rules, if |
|
281 |
executed in ML.*) |
|
282 |
datatype rule = |
|
283 |
MinProof (*for building minimal proof terms*) |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
284 |
| Oracle of theory * Sign.sg * exn (*oracles*) |
1529 | 285 |
(*Axioms/theorems*) |
286 |
| Axiom of theory * string |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
287 |
| Theorem of string |
1529 | 288 |
(*primitive inferences and compound versions of them*) |
289 |
| Assume of cterm |
|
290 |
| Implies_intr of cterm |
|
291 |
| Implies_intr_shyps |
|
292 |
| Implies_intr_hyps |
|
293 |
| Implies_elim |
|
294 |
| Forall_intr of cterm |
|
295 |
| Forall_elim of cterm |
|
296 |
| Reflexive of cterm |
|
297 |
| Symmetric |
|
298 |
| Transitive |
|
299 |
| Beta_conversion of cterm |
|
300 |
| Extensional |
|
301 |
| Abstract_rule of string * cterm |
|
302 |
| Combination |
|
303 |
| Equal_intr |
|
304 |
| Equal_elim |
|
305 |
(*derived rules for tactical proof*) |
|
306 |
| Trivial of cterm |
|
307 |
(*For lift_rule, the proof state is not a premise. |
|
308 |
Use cterm instead of thm to avoid mutual recursion.*) |
|
309 |
| Lift_rule of cterm * int |
|
310 |
| Assumption of int * Envir.env option (*includes eq_assumption*) |
|
311 |
| Instantiate of (indexname * ctyp) list * (cterm * cterm) list |
|
312 |
| Bicompose of bool * bool * int * int * Envir.env |
|
313 |
| Flexflex_rule of Envir.env (*identifies unifier chosen*) |
|
314 |
(*other derived rules*) |
|
315 |
| Class_triv of theory * class (*derived rule????*) |
|
316 |
| VarifyT |
|
317 |
| FreezeT |
|
318 |
(*for the simplifier*) |
|
319 |
| RewriteC of cterm |
|
320 |
| CongC of cterm |
|
321 |
| Rewrite_cterm of cterm |
|
322 |
(*Logical identities, recorded since they are part of the proof process*) |
|
323 |
| Rename_params_rule of string list * int; |
|
324 |
||
325 |
||
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
326 |
type deriv = rule mtree; |
1529 | 327 |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
328 |
datatype deriv_kind = MinDeriv | ThmDeriv | FullDeriv; |
1529 | 329 |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
330 |
val keep_derivs = ref MinDeriv; |
1529 | 331 |
|
332 |
||
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
333 |
(*Build a minimal derivation. Keep oracles; suppress atomic inferences; |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
334 |
retain Theorems or their underlying links; keep anything else*) |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
335 |
fun squash_derivs [] = [] |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
336 |
| squash_derivs (der::ders) = |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
337 |
(case der of |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
338 |
Join (Oracle _, _) => der :: squash_derivs ders |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
339 |
| Join (Theorem _, [der']) => if !keep_derivs=ThmDeriv |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
340 |
then der :: squash_derivs ders |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
341 |
else squash_derivs (der'::ders) |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
342 |
| Join (Axiom _, _) => if !keep_derivs=ThmDeriv |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
343 |
then der :: squash_derivs ders |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
344 |
else squash_derivs ders |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
345 |
| Join (_, []) => squash_derivs ders |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
346 |
| _ => der :: squash_derivs ders); |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
347 |
|
1529 | 348 |
|
349 |
(*Ensure sharing of the most likely derivation, the empty one!*) |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
350 |
val min_infer = Join (MinProof, []); |
1529 | 351 |
|
352 |
(*Make a minimal inference*) |
|
353 |
fun make_min_infer [] = min_infer |
|
354 |
| make_min_infer [der] = der |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
355 |
| make_min_infer ders = Join (MinProof, ders); |
1529 | 356 |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
357 |
fun infer_derivs (rl, []) = Join (rl, []) |
1529 | 358 |
| infer_derivs (rl, ders) = |
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
359 |
if !keep_derivs=FullDeriv then Join (rl, ders) |
1529 | 360 |
else make_min_infer (squash_derivs ders); |
361 |
||
362 |
||
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
363 |
(*** Meta theorems ***) |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
364 |
|
0 | 365 |
datatype thm = Thm of |
1460 | 366 |
{sign: Sign.sg, (*signature for hyps and prop*) |
1529 | 367 |
der: deriv, (*derivation*) |
1460 | 368 |
maxidx: int, (*maximum index of any Var or TVar*) |
369 |
shyps: sort list, (* FIXME comment *) |
|
370 |
hyps: term list, (*hypotheses*) |
|
371 |
prop: term}; (*conclusion*) |
|
0 | 372 |
|
250 | 373 |
fun rep_thm (Thm args) = args; |
0 | 374 |
|
1529 | 375 |
(*Version of rep_thm returning cterms instead of terms*) |
376 |
fun crep_thm (Thm {sign, der, maxidx, shyps, hyps, prop}) = |
|
377 |
let fun ctermf max t = Cterm{sign=sign, t=t, T=propT, maxidx=max}; |
|
378 |
in {sign=sign, der=der, maxidx=maxidx, shyps=shyps, |
|
379 |
hyps = map (ctermf ~1) hyps, |
|
380 |
prop = ctermf maxidx prop} |
|
1517 | 381 |
end; |
382 |
||
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
383 |
(*errors involving theorems*) |
0 | 384 |
exception THM of string * int * thm list; |
385 |
||
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
386 |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
387 |
val stamps_of_thm = #stamps o Sign.rep_sg o #sign o rep_thm; |
0 | 388 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
389 |
(*merge signatures of two theorems; raise exception if incompatible*) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
390 |
fun merge_thm_sgs (th1, th2) = |
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
391 |
Sign.merge (pairself (#sign o rep_thm) (th1, th2)) |
574 | 392 |
handle TERM (msg, _) => raise THM (msg, 0, [th1, th2]); |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
393 |
|
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
394 |
|
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
395 |
(*maps object-rule to tpairs*) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
396 |
fun tpairs_of (Thm {prop, ...}) = #1 (Logic.strip_flexpairs prop); |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
397 |
|
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
398 |
(*maps object-rule to premises*) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
399 |
fun prems_of (Thm {prop, ...}) = |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
400 |
Logic.strip_imp_prems (Logic.skip_flexpairs prop); |
0 | 401 |
|
402 |
(*counts premises in a rule*) |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
403 |
fun nprems_of (Thm {prop, ...}) = |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
404 |
Logic.count_prems (Logic.skip_flexpairs prop, 0); |
0 | 405 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
406 |
(*maps object-rule to conclusion*) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
407 |
fun concl_of (Thm {prop, ...}) = Logic.strip_imp_concl prop; |
0 | 408 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
409 |
(*the statement of any thm is a cterm*) |
1160 | 410 |
fun cprop_of (Thm {sign, maxidx, prop, ...}) = |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
411 |
Cterm {sign = sign, maxidx = maxidx, T = propT, t = prop}; |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
412 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
413 |
|
0 | 414 |
|
1238 | 415 |
(** sort contexts of theorems **) |
416 |
||
417 |
(* basic utils *) |
|
418 |
||
419 |
(*accumulate sorts suppressing duplicates; these are coded low level |
|
420 |
to improve efficiency a bit*) |
|
421 |
||
422 |
fun add_typ_sorts (Type (_, Ts), Ss) = add_typs_sorts (Ts, Ss) |
|
423 |
| add_typ_sorts (TFree (_, S), Ss) = S ins Ss |
|
424 |
| add_typ_sorts (TVar (_, S), Ss) = S ins Ss |
|
425 |
and add_typs_sorts ([], Ss) = Ss |
|
426 |
| add_typs_sorts (T :: Ts, Ss) = add_typs_sorts (Ts, add_typ_sorts (T, Ss)); |
|
427 |
||
428 |
fun add_term_sorts (Const (_, T), Ss) = add_typ_sorts (T, Ss) |
|
429 |
| add_term_sorts (Free (_, T), Ss) = add_typ_sorts (T, Ss) |
|
430 |
| add_term_sorts (Var (_, T), Ss) = add_typ_sorts (T, Ss) |
|
431 |
| add_term_sorts (Bound _, Ss) = Ss |
|
432 |
| add_term_sorts (Abs (_, T, t), Ss) = add_term_sorts (t, add_typ_sorts (T, Ss)) |
|
433 |
| add_term_sorts (t $ u, Ss) = add_term_sorts (t, add_term_sorts (u, Ss)); |
|
434 |
||
435 |
fun add_terms_sorts ([], Ss) = Ss |
|
436 |
| add_terms_sorts (t :: ts, Ss) = add_terms_sorts (ts, add_term_sorts (t, Ss)); |
|
437 |
||
1258 | 438 |
fun env_codT (Envir.Envir {iTs, ...}) = map snd iTs; |
439 |
||
440 |
fun add_env_sorts (env, Ss) = |
|
441 |
add_terms_sorts (map snd (Envir.alist_of env), |
|
442 |
add_typs_sorts (env_codT env, Ss)); |
|
443 |
||
1238 | 444 |
fun add_thm_sorts (Thm {hyps, prop, ...}, Ss) = |
445 |
add_terms_sorts (hyps, add_term_sorts (prop, Ss)); |
|
446 |
||
447 |
fun add_thms_shyps ([], Ss) = Ss |
|
448 |
| add_thms_shyps (Thm {shyps, ...} :: ths, Ss) = |
|
449 |
add_thms_shyps (ths, shyps union Ss); |
|
450 |
||
451 |
||
452 |
(*get 'dangling' sort constraints of a thm*) |
|
453 |
fun extra_shyps (th as Thm {shyps, ...}) = |
|
454 |
shyps \\ add_thm_sorts (th, []); |
|
455 |
||
456 |
||
457 |
(* fix_shyps *) |
|
458 |
||
459 |
(*preserve sort contexts of rule premises and substituted types*) |
|
460 |
fun fix_shyps thms Ts thm = |
|
461 |
let |
|
1529 | 462 |
val Thm {sign, der, maxidx, hyps, prop, ...} = thm; |
1238 | 463 |
val shyps = |
464 |
add_thm_sorts (thm, add_typs_sorts (Ts, add_thms_shyps (thms, []))); |
|
465 |
in |
|
1529 | 466 |
Thm {sign = sign, |
467 |
der = der, (*No new derivation, as other rules call this*) |
|
468 |
maxidx = maxidx, |
|
469 |
shyps = shyps, hyps = hyps, prop = prop} |
|
1238 | 470 |
end; |
471 |
||
472 |
||
473 |
(* strip_shyps *) (* FIXME improve? (e.g. only minimal extra sorts) *) |
|
474 |
||
475 |
val force_strip_shyps = ref true; (* FIXME tmp *) |
|
476 |
||
477 |
(*remove extra sorts that are known to be syntactically non-empty*) |
|
478 |
fun strip_shyps thm = |
|
479 |
let |
|
1529 | 480 |
val Thm {sign, der, maxidx, shyps, hyps, prop} = thm; |
1238 | 481 |
val sorts = add_thm_sorts (thm, []); |
482 |
val maybe_empty = not o Sign.nonempty_sort sign sorts; |
|
483 |
val shyps' = filter (fn S => S mem sorts orelse maybe_empty S) shyps; |
|
484 |
in |
|
1529 | 485 |
Thm {sign = sign, der = der, maxidx = maxidx, |
486 |
shyps = |
|
487 |
(if eq_set (shyps',sorts) orelse not (!force_strip_shyps) then shyps' |
|
488 |
else (* FIXME tmp *) |
|
489 |
(writeln ("WARNING Removed sort hypotheses: " ^ |
|
490 |
commas (map Type.str_of_sort (shyps' \\ sorts))); |
|
491 |
writeln "WARNING Let's hope these sorts are non-empty!"; |
|
1238 | 492 |
sorts)), |
1529 | 493 |
hyps = hyps, |
494 |
prop = prop} |
|
1238 | 495 |
end; |
496 |
||
497 |
||
498 |
(* implies_intr_shyps *) |
|
499 |
||
500 |
(*discharge all extra sort hypotheses*) |
|
501 |
fun implies_intr_shyps thm = |
|
502 |
(case extra_shyps thm of |
|
503 |
[] => thm |
|
504 |
| xshyps => |
|
505 |
let |
|
1529 | 506 |
val Thm {sign, der, maxidx, shyps, hyps, prop} = thm; |
1238 | 507 |
val shyps' = logicS ins (shyps \\ xshyps); |
508 |
val used_names = foldr add_term_tfree_names (prop :: hyps, []); |
|
509 |
val names = |
|
510 |
tl (variantlist (replicate (length xshyps + 1) "'", used_names)); |
|
511 |
val tfrees = map (TFree o rpair logicS) names; |
|
512 |
||
513 |
fun mk_insort (T, S) = map (Logic.mk_inclass o pair T) S; |
|
514 |
val sort_hyps = flat (map2 mk_insort (tfrees, xshyps)); |
|
515 |
in |
|
1529 | 516 |
Thm {sign = sign, |
517 |
der = infer_derivs (Implies_intr_shyps, [der]), |
|
518 |
maxidx = maxidx, |
|
519 |
shyps = shyps', |
|
520 |
hyps = hyps, |
|
521 |
prop = Logic.list_implies (sort_hyps, prop)} |
|
1238 | 522 |
end); |
523 |
||
524 |
||
1529 | 525 |
(** Axioms **) |
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
526 |
|
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
527 |
(*look up the named axiom in the theory*) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
528 |
fun get_axiom theory name = |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
529 |
let |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
530 |
fun get_ax [] = raise Match |
1529 | 531 |
| get_ax (thy :: thys) = |
1539 | 532 |
let val {sign, new_axioms, parents, ...} = rep_theory thy |
1529 | 533 |
in case Symtab.lookup (new_axioms, name) of |
534 |
Some t => fix_shyps [] [] |
|
535 |
(Thm {sign = sign, |
|
536 |
der = infer_derivs (Axiom(theory,name), []), |
|
537 |
maxidx = maxidx_of_term t, |
|
538 |
shyps = [], |
|
539 |
hyps = [], |
|
540 |
prop = t}) |
|
541 |
| None => get_ax parents handle Match => get_ax thys |
|
542 |
end; |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
543 |
in |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
544 |
get_ax [theory] handle Match |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
545 |
=> raise THEORY ("get_axiom: no axiom " ^ quote name, [theory]) |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
546 |
end; |
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
547 |
|
1529 | 548 |
|
776
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
549 |
(*return additional axioms of this theory node*) |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
550 |
fun axioms_of thy = |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
551 |
map (fn (s, _) => (s, get_axiom thy s)) |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
552 |
(Symtab.dest (#new_axioms (rep_theory thy))); |
df8f91c0e57c
improved axioms_of: returns thms as the manual says;
wenzelm
parents:
721
diff
changeset
|
553 |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
554 |
(*Attach a label to a theorem to make proof objects more readable*) |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
555 |
fun name_thm (name, th as Thm {sign, der, maxidx, shyps, hyps, prop}) = |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
556 |
Thm {sign = sign, |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
557 |
der = Join (Theorem name, [der]), |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
558 |
maxidx = maxidx, |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
559 |
shyps = shyps, |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
560 |
hyps = hyps, |
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
561 |
prop = prop}; |
0 | 562 |
|
563 |
||
1529 | 564 |
(*Compression of theorems -- a separate rule, not integrated with the others, |
565 |
as it could be slow.*) |
|
566 |
fun compress (Thm {sign, der, maxidx, shyps, hyps, prop}) = |
|
567 |
Thm {sign = sign, |
|
568 |
der = der, (*No derivation recorded!*) |
|
569 |
maxidx = maxidx, |
|
570 |
shyps = shyps, |
|
571 |
hyps = map Term.compress_term hyps, |
|
572 |
prop = Term.compress_term prop}; |
|
564 | 573 |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
574 |
|
1529 | 575 |
(*** Meta rules ***) |
0 | 576 |
|
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
577 |
(* check that term does not contain same var with different typing/sorting *) |
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
578 |
fun nodup_Vars(thm as Thm{prop,...}) s = |
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
579 |
Sign.nodup_Vars prop handle TYPE(msg,_,_) => raise THM(s^": "^msg,0,[thm]); |
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
580 |
|
1220 | 581 |
(** 'primitive' rules **) |
582 |
||
583 |
(*discharge all assumptions t from ts*) |
|
0 | 584 |
val disch = gen_rem (op aconv); |
585 |
||
1220 | 586 |
(*The assumption rule A|-A in a theory*) |
250 | 587 |
fun assume ct : thm = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
588 |
let val {sign, t=prop, T, maxidx} = rep_cterm ct |
250 | 589 |
in if T<>propT then |
590 |
raise THM("assume: assumptions must have type prop", 0, []) |
|
0 | 591 |
else if maxidx <> ~1 then |
250 | 592 |
raise THM("assume: assumptions may not contain scheme variables", |
593 |
maxidx, []) |
|
1529 | 594 |
else Thm{sign = sign, |
595 |
der = infer_derivs (Assume ct, []), |
|
596 |
maxidx = ~1, |
|
597 |
shyps = add_term_sorts(prop,[]), |
|
598 |
hyps = [prop], |
|
599 |
prop = prop} |
|
0 | 600 |
end; |
601 |
||
1220 | 602 |
(*Implication introduction |
603 |
A |- B |
|
604 |
------- |
|
605 |
A ==> B |
|
606 |
*) |
|
1529 | 607 |
fun implies_intr cA (thB as Thm{sign,der,maxidx,hyps,prop,...}) : thm = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
608 |
let val {sign=signA, t=A, T, maxidx=maxidxA} = rep_cterm cA |
0 | 609 |
in if T<>propT then |
250 | 610 |
raise THM("implies_intr: assumptions must have type prop", 0, [thB]) |
1238 | 611 |
else fix_shyps [thB] [] |
1529 | 612 |
(Thm{sign = Sign.merge (sign,signA), |
613 |
der = infer_derivs (Implies_intr cA, [der]), |
|
614 |
maxidx = max[maxidxA, maxidx], |
|
615 |
shyps = [], |
|
616 |
hyps = disch(hyps,A), |
|
617 |
prop = implies$A$prop}) |
|
0 | 618 |
handle TERM _ => |
619 |
raise THM("implies_intr: incompatible signatures", 0, [thB]) |
|
620 |
end; |
|
621 |
||
1529 | 622 |
|
1220 | 623 |
(*Implication elimination |
624 |
A ==> B A |
|
625 |
------------ |
|
626 |
B |
|
627 |
*) |
|
0 | 628 |
fun implies_elim thAB thA : thm = |
1529 | 629 |
let val Thm{maxidx=maxA, der=derA, hyps=hypsA, prop=propA,...} = thA |
630 |
and Thm{sign, der, maxidx, hyps, prop,...} = thAB; |
|
250 | 631 |
fun err(a) = raise THM("implies_elim: "^a, 0, [thAB,thA]) |
0 | 632 |
in case prop of |
250 | 633 |
imp$A$B => |
634 |
if imp=implies andalso A aconv propA |
|
1220 | 635 |
then fix_shyps [thAB, thA] [] |
636 |
(Thm{sign= merge_thm_sgs(thAB,thA), |
|
1529 | 637 |
der = infer_derivs (Implies_elim, [der,derA]), |
638 |
maxidx = max[maxA,maxidx], |
|
639 |
shyps = [], |
|
640 |
hyps = hypsA union hyps, (*dups suppressed*) |
|
641 |
prop = B}) |
|
250 | 642 |
else err("major premise") |
643 |
| _ => err("major premise") |
|
0 | 644 |
end; |
250 | 645 |
|
1220 | 646 |
(*Forall introduction. The Free or Var x must not be free in the hypotheses. |
647 |
A |
|
648 |
----- |
|
649 |
!!x.A |
|
650 |
*) |
|
1529 | 651 |
fun forall_intr cx (th as Thm{sign,der,maxidx,hyps,prop,...}) = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
652 |
let val x = term_of cx; |
1238 | 653 |
fun result(a,T) = fix_shyps [th] [] |
1529 | 654 |
(Thm{sign = sign, |
655 |
der = infer_derivs (Forall_intr cx, [der]), |
|
656 |
maxidx = maxidx, |
|
657 |
shyps = [], |
|
658 |
hyps = hyps, |
|
659 |
prop = all(T) $ Abs(a, T, abstract_over (x,prop))}) |
|
0 | 660 |
in case x of |
250 | 661 |
Free(a,T) => |
662 |
if exists (apl(x, Logic.occs)) hyps |
|
663 |
then raise THM("forall_intr: variable free in assumptions", 0, [th]) |
|
664 |
else result(a,T) |
|
0 | 665 |
| Var((a,_),T) => result(a,T) |
666 |
| _ => raise THM("forall_intr: not a variable", 0, [th]) |
|
667 |
end; |
|
668 |
||
1220 | 669 |
(*Forall elimination |
670 |
!!x.A |
|
671 |
------ |
|
672 |
A[t/x] |
|
673 |
*) |
|
1529 | 674 |
fun forall_elim ct (th as Thm{sign,der,maxidx,hyps,prop,...}) : thm = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
675 |
let val {sign=signt, t, T, maxidx=maxt} = rep_cterm ct |
0 | 676 |
in case prop of |
250 | 677 |
Const("all",Type("fun",[Type("fun",[qary,_]),_])) $ A => |
678 |
if T<>qary then |
|
679 |
raise THM("forall_elim: type mismatch", 0, [th]) |
|
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
680 |
else let val thm = fix_shyps [th] [] |
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
681 |
(Thm{sign= Sign.merge(sign,signt), |
1529 | 682 |
der = infer_derivs (Forall_elim ct, [der]), |
683 |
maxidx = max[maxidx, maxt], |
|
684 |
shyps = [], |
|
685 |
hyps = hyps, |
|
686 |
prop = betapply(A,t)}) |
|
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
687 |
in nodup_Vars thm "forall_elim"; thm end |
250 | 688 |
| _ => raise THM("forall_elim: not quantified", 0, [th]) |
0 | 689 |
end |
690 |
handle TERM _ => |
|
250 | 691 |
raise THM("forall_elim: incompatible signatures", 0, [th]); |
0 | 692 |
|
693 |
||
1220 | 694 |
(* Equality *) |
0 | 695 |
|
1220 | 696 |
(* Definition of the relation =?= *) |
1238 | 697 |
val flexpair_def = fix_shyps [] [] |
1529 | 698 |
(Thm{sign= Sign.proto_pure, |
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
699 |
der = Join(Axiom(pure_thy, "flexpair_def"), []), |
1529 | 700 |
shyps = [], |
701 |
hyps = [], |
|
702 |
maxidx = 0, |
|
703 |
prop = term_of (read_cterm Sign.proto_pure |
|
704 |
("(?t =?= ?u) == (?t == ?u::?'a::{})", propT))}); |
|
0 | 705 |
|
706 |
(*The reflexivity rule: maps t to the theorem t==t *) |
|
250 | 707 |
fun reflexive ct = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
708 |
let val {sign, t, T, maxidx} = rep_cterm ct |
1238 | 709 |
in fix_shyps [] [] |
1529 | 710 |
(Thm{sign= sign, |
711 |
der = infer_derivs (Reflexive ct, []), |
|
712 |
shyps = [], |
|
713 |
hyps = [], |
|
714 |
maxidx = maxidx, |
|
715 |
prop = Logic.mk_equals(t,t)}) |
|
0 | 716 |
end; |
717 |
||
718 |
(*The symmetry rule |
|
1220 | 719 |
t==u |
720 |
---- |
|
721 |
u==t |
|
722 |
*) |
|
1529 | 723 |
fun symmetric (th as Thm{sign,der,maxidx,shyps,hyps,prop}) = |
0 | 724 |
case prop of |
725 |
(eq as Const("==",_)) $ t $ u => |
|
1238 | 726 |
(*no fix_shyps*) |
1529 | 727 |
Thm{sign = sign, |
728 |
der = infer_derivs (Symmetric, [der]), |
|
729 |
maxidx = maxidx, |
|
730 |
shyps = shyps, |
|
731 |
hyps = hyps, |
|
732 |
prop = eq$u$t} |
|
0 | 733 |
| _ => raise THM("symmetric", 0, [th]); |
734 |
||
735 |
(*The transitive rule |
|
1220 | 736 |
t1==u u==t2 |
737 |
-------------- |
|
738 |
t1==t2 |
|
739 |
*) |
|
0 | 740 |
fun transitive th1 th2 = |
1529 | 741 |
let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1 |
742 |
and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2; |
|
0 | 743 |
fun err(msg) = raise THM("transitive: "^msg, 0, [th1,th2]) |
744 |
in case (prop1,prop2) of |
|
745 |
((eq as Const("==",_)) $ t1 $ u, Const("==",_) $ u' $ t2) => |
|
250 | 746 |
if not (u aconv u') then err"middle term" else |
1220 | 747 |
fix_shyps [th1, th2] [] |
1529 | 748 |
(Thm{sign= merge_thm_sgs(th1,th2), |
749 |
der = infer_derivs (Transitive, [der1, der2]), |
|
750 |
maxidx = max[max1,max2], |
|
751 |
shyps = [], |
|
752 |
hyps = hyps1 union hyps2, |
|
753 |
prop = eq$t1$t2}) |
|
0 | 754 |
| _ => err"premises" |
755 |
end; |
|
756 |
||
1160 | 757 |
(*Beta-conversion: maps (%x.t)(u) to the theorem (%x.t)(u) == t[u/x] *) |
250 | 758 |
fun beta_conversion ct = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
759 |
let val {sign, t, T, maxidx} = rep_cterm ct |
0 | 760 |
in case t of |
1238 | 761 |
Abs(_,_,bodt) $ u => fix_shyps [] [] |
1529 | 762 |
(Thm{sign = sign, |
763 |
der = infer_derivs (Beta_conversion ct, []), |
|
764 |
maxidx = maxidx_of_term t, |
|
765 |
shyps = [], |
|
766 |
hyps = [], |
|
767 |
prop = Logic.mk_equals(t, subst_bounds([u],bodt))}) |
|
250 | 768 |
| _ => raise THM("beta_conversion: not a redex", 0, []) |
0 | 769 |
end; |
770 |
||
771 |
(*The extensionality rule (proviso: x not free in f, g, or hypotheses) |
|
1220 | 772 |
f(x) == g(x) |
773 |
------------ |
|
774 |
f == g |
|
775 |
*) |
|
1529 | 776 |
fun extensional (th as Thm{sign, der, maxidx,shyps,hyps,prop}) = |
0 | 777 |
case prop of |
778 |
(Const("==",_)) $ (f$x) $ (g$y) => |
|
250 | 779 |
let fun err(msg) = raise THM("extensional: "^msg, 0, [th]) |
0 | 780 |
in (if x<>y then err"different variables" else |
781 |
case y of |
|
250 | 782 |
Free _ => |
783 |
if exists (apl(y, Logic.occs)) (f::g::hyps) |
|
784 |
then err"variable free in hyps or functions" else () |
|
785 |
| Var _ => |
|
786 |
if Logic.occs(y,f) orelse Logic.occs(y,g) |
|
787 |
then err"variable free in functions" else () |
|
788 |
| _ => err"not a variable"); |
|
1238 | 789 |
(*no fix_shyps*) |
1529 | 790 |
Thm{sign = sign, |
791 |
der = infer_derivs (Extensional, [der]), |
|
792 |
maxidx = maxidx, |
|
793 |
shyps = shyps, |
|
794 |
hyps = hyps, |
|
795 |
prop = Logic.mk_equals(f,g)} |
|
0 | 796 |
end |
797 |
| _ => raise THM("extensional: premise", 0, [th]); |
|
798 |
||
799 |
(*The abstraction rule. The Free or Var x must not be free in the hypotheses. |
|
800 |
The bound variable will be named "a" (since x will be something like x320) |
|
1220 | 801 |
t == u |
802 |
------------ |
|
803 |
%x.t == %x.u |
|
804 |
*) |
|
1529 | 805 |
fun abstract_rule a cx (th as Thm{sign,der,maxidx,hyps,prop,...}) = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
806 |
let val x = term_of cx; |
250 | 807 |
val (t,u) = Logic.dest_equals prop |
808 |
handle TERM _ => |
|
809 |
raise THM("abstract_rule: premise not an equality", 0, [th]) |
|
1238 | 810 |
fun result T = fix_shyps [th] [] |
1529 | 811 |
(Thm{sign = sign, |
812 |
der = infer_derivs (Abstract_rule (a,cx), [der]), |
|
813 |
maxidx = maxidx, |
|
814 |
shyps = [], |
|
815 |
hyps = hyps, |
|
816 |
prop = Logic.mk_equals(Abs(a, T, abstract_over (x,t)), |
|
817 |
Abs(a, T, abstract_over (x,u)))}) |
|
0 | 818 |
in case x of |
250 | 819 |
Free(_,T) => |
820 |
if exists (apl(x, Logic.occs)) hyps |
|
821 |
then raise THM("abstract_rule: variable free in assumptions", 0, [th]) |
|
822 |
else result T |
|
0 | 823 |
| Var(_,T) => result T |
824 |
| _ => raise THM("abstract_rule: not a variable", 0, [th]) |
|
825 |
end; |
|
826 |
||
827 |
(*The combination rule |
|
1220 | 828 |
f==g t==u |
829 |
------------ |
|
830 |
f(t)==g(u) |
|
831 |
*) |
|
0 | 832 |
fun combination th1 th2 = |
1529 | 833 |
let val Thm{der=der1, maxidx=max1, shyps=shyps1, hyps=hyps1, |
834 |
prop=prop1,...} = th1 |
|
835 |
and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, |
|
836 |
prop=prop2,...} = th2 |
|
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
837 |
in case (prop1,prop2) of |
0 | 838 |
(Const("==",_) $ f $ g, Const("==",_) $ t $ u) => |
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
839 |
let val thm = (*no fix_shyps*) |
1529 | 840 |
Thm{sign = merge_thm_sgs(th1,th2), |
841 |
der = infer_derivs (Combination, [der1, der2]), |
|
842 |
maxidx = max[max1,max2], |
|
843 |
shyps = shyps1 union shyps2, |
|
844 |
hyps = hyps1 union hyps2, |
|
845 |
prop = Logic.mk_equals(f$t, g$u)} |
|
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
846 |
in nodup_Vars thm "combination"; thm end |
0 | 847 |
| _ => raise THM("combination: premises", 0, [th1,th2]) |
848 |
end; |
|
849 |
||
850 |
||
851 |
(* Equality introduction |
|
1220 | 852 |
A==>B B==>A |
853 |
-------------- |
|
854 |
A==B |
|
855 |
*) |
|
0 | 856 |
fun equal_intr th1 th2 = |
1529 | 857 |
let val Thm{der=der1,maxidx=max1, shyps=shyps1, hyps=hyps1, |
858 |
prop=prop1,...} = th1 |
|
859 |
and Thm{der=der2, maxidx=max2, shyps=shyps2, hyps=hyps2, |
|
860 |
prop=prop2,...} = th2; |
|
861 |
fun err(msg) = raise THM("equal_intr: "^msg, 0, [th1,th2]) |
|
862 |
in case (prop1,prop2) of |
|
863 |
(Const("==>",_) $ A $ B, Const("==>",_) $ B' $ A') => |
|
864 |
if A aconv A' andalso B aconv B' |
|
865 |
then |
|
866 |
(*no fix_shyps*) |
|
867 |
Thm{sign = merge_thm_sgs(th1,th2), |
|
868 |
der = infer_derivs (Equal_intr, [der1, der2]), |
|
869 |
maxidx = max[max1,max2], |
|
870 |
shyps = shyps1 union shyps2, |
|
871 |
hyps = hyps1 union hyps2, |
|
872 |
prop = Logic.mk_equals(A,B)} |
|
873 |
else err"not equal" |
|
874 |
| _ => err"premises" |
|
875 |
end; |
|
876 |
||
877 |
||
878 |
(*The equal propositions rule |
|
879 |
A==B A |
|
880 |
--------- |
|
881 |
B |
|
882 |
*) |
|
883 |
fun equal_elim th1 th2 = |
|
884 |
let val Thm{der=der1, maxidx=max1, hyps=hyps1, prop=prop1,...} = th1 |
|
885 |
and Thm{der=der2, maxidx=max2, hyps=hyps2, prop=prop2,...} = th2; |
|
886 |
fun err(msg) = raise THM("equal_elim: "^msg, 0, [th1,th2]) |
|
887 |
in case prop1 of |
|
888 |
Const("==",_) $ A $ B => |
|
889 |
if not (prop2 aconv A) then err"not equal" else |
|
890 |
fix_shyps [th1, th2] [] |
|
891 |
(Thm{sign= merge_thm_sgs(th1,th2), |
|
892 |
der = infer_derivs (Equal_elim, [der1, der2]), |
|
893 |
maxidx = max[max1,max2], |
|
894 |
shyps = [], |
|
895 |
hyps = hyps1 union hyps2, |
|
896 |
prop = B}) |
|
897 |
| _ => err"major premise" |
|
898 |
end; |
|
0 | 899 |
|
1220 | 900 |
|
901 |
||
0 | 902 |
(**** Derived rules ****) |
903 |
||
1503 | 904 |
(*Discharge all hypotheses. Need not verify cterms or call fix_shyps. |
0 | 905 |
Repeated hypotheses are discharged only once; fold cannot do this*) |
1529 | 906 |
fun implies_intr_hyps (Thm{sign, der, maxidx, shyps, hyps=A::As, prop}) = |
1238 | 907 |
implies_intr_hyps (*no fix_shyps*) |
1529 | 908 |
(Thm{sign = sign, |
909 |
der = infer_derivs (Implies_intr_hyps, [der]), |
|
910 |
maxidx = maxidx, |
|
911 |
shyps = shyps, |
|
912 |
hyps = disch(As,A), |
|
913 |
prop = implies$A$prop}) |
|
0 | 914 |
| implies_intr_hyps th = th; |
915 |
||
916 |
(*Smash" unifies the list of term pairs leaving no flex-flex pairs. |
|
250 | 917 |
Instantiates the theorem and deletes trivial tpairs. |
0 | 918 |
Resulting sequence may contain multiple elements if the tpairs are |
919 |
not all flex-flex. *) |
|
1529 | 920 |
fun flexflex_rule (th as Thm{sign, der, maxidx, hyps, prop,...}) = |
250 | 921 |
let fun newthm env = |
1529 | 922 |
if Envir.is_empty env then th |
923 |
else |
|
250 | 924 |
let val (tpairs,horn) = |
925 |
Logic.strip_flexpairs (Envir.norm_term env prop) |
|
926 |
(*Remove trivial tpairs, of the form t=t*) |
|
927 |
val distpairs = filter (not o op aconv) tpairs |
|
928 |
val newprop = Logic.list_flexpairs(distpairs, horn) |
|
1220 | 929 |
in fix_shyps [th] (env_codT env) |
1529 | 930 |
(Thm{sign = sign, |
931 |
der = infer_derivs (Flexflex_rule env, [der]), |
|
932 |
maxidx = maxidx_of_term newprop, |
|
933 |
shyps = [], |
|
934 |
hyps = hyps, |
|
935 |
prop = newprop}) |
|
250 | 936 |
end; |
0 | 937 |
val (tpairs,_) = Logic.strip_flexpairs prop |
938 |
in Sequence.maps newthm |
|
250 | 939 |
(Unify.smash_unifiers(sign, Envir.empty maxidx, tpairs)) |
0 | 940 |
end; |
941 |
||
942 |
(*Instantiation of Vars |
|
1220 | 943 |
A |
944 |
------------------- |
|
945 |
A[t1/v1,....,tn/vn] |
|
946 |
*) |
|
0 | 947 |
|
948 |
(*Check that all the terms are Vars and are distinct*) |
|
949 |
fun instl_ok ts = forall is_Var ts andalso null(findrep ts); |
|
950 |
||
951 |
(*For instantiate: process pair of cterms, merge theories*) |
|
952 |
fun add_ctpair ((ct,cu), (sign,tpairs)) = |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
953 |
let val {sign=signt, t=t, T= T, ...} = rep_cterm ct |
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
954 |
and {sign=signu, t=u, T= U, ...} = rep_cterm cu |
0 | 955 |
in if T=U then (Sign.merge(sign, Sign.merge(signt, signu)), (t,u)::tpairs) |
956 |
else raise TYPE("add_ctpair", [T,U], [t,u]) |
|
957 |
end; |
|
958 |
||
959 |
fun add_ctyp ((v,ctyp), (sign',vTs)) = |
|
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
960 |
let val {T,sign} = rep_ctyp ctyp |
0 | 961 |
in (Sign.merge(sign,sign'), (v,T)::vTs) end; |
962 |
||
963 |
(*Left-to-right replacements: ctpairs = [...,(vi,ti),...]. |
|
964 |
Instantiates distinct Vars by terms of same type. |
|
965 |
Normalizes the new theorem! *) |
|
1529 | 966 |
fun instantiate ([], []) th = th |
967 |
| instantiate (vcTs,ctpairs) (th as Thm{sign,der,maxidx,hyps,prop,...}) = |
|
0 | 968 |
let val (newsign,tpairs) = foldr add_ctpair (ctpairs, (sign,[])); |
969 |
val (newsign,vTs) = foldr add_ctyp (vcTs, (newsign,[])); |
|
250 | 970 |
val newprop = |
971 |
Envir.norm_term (Envir.empty 0) |
|
972 |
(subst_atomic tpairs |
|
973 |
(Type.inst_term_tvars(#tsig(Sign.rep_sg newsign),vTs) prop)) |
|
1220 | 974 |
val newth = |
975 |
fix_shyps [th] (map snd vTs) |
|
1529 | 976 |
(Thm{sign = newsign, |
977 |
der = infer_derivs (Instantiate(vcTs,ctpairs), [der]), |
|
978 |
maxidx = maxidx_of_term newprop, |
|
979 |
shyps = [], |
|
980 |
hyps = hyps, |
|
981 |
prop = newprop}) |
|
250 | 982 |
in if not(instl_ok(map #1 tpairs)) |
193 | 983 |
then raise THM("instantiate: variables not distinct", 0, [th]) |
984 |
else if not(null(findrep(map #1 vTs))) |
|
985 |
then raise THM("instantiate: type variables not distinct", 0, [th]) |
|
1495
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
986 |
else nodup_Vars newth "instantiate"; |
b8b54847c77f
Added check for duplicate vars with distinct types/sorts (nodup_Vars)
nipkow
parents:
1493
diff
changeset
|
987 |
newth |
0 | 988 |
end |
250 | 989 |
handle TERM _ => |
0 | 990 |
raise THM("instantiate: incompatible signatures",0,[th]) |
193 | 991 |
| TYPE _ => raise THM("instantiate: type conflict", 0, [th]); |
0 | 992 |
|
993 |
(*The trivial implication A==>A, justified by assume and forall rules. |
|
994 |
A can contain Vars, not so for assume! *) |
|
250 | 995 |
fun trivial ct : thm = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
996 |
let val {sign, t=A, T, maxidx} = rep_cterm ct |
250 | 997 |
in if T<>propT then |
998 |
raise THM("trivial: the term must have type prop", 0, []) |
|
1238 | 999 |
else fix_shyps [] [] |
1529 | 1000 |
(Thm{sign = sign, |
1001 |
der = infer_derivs (Trivial ct, []), |
|
1002 |
maxidx = maxidx, |
|
1003 |
shyps = [], |
|
1004 |
hyps = [], |
|
1005 |
prop = implies$A$A}) |
|
0 | 1006 |
end; |
1007 |
||
1503 | 1008 |
(*Axiom-scheme reflecting signature contents: "OFCLASS(?'a::c, c_class)" *) |
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1009 |
fun class_triv thy c = |
1529 | 1010 |
let val sign = sign_of thy; |
1011 |
val Cterm {t, maxidx, ...} = |
|
1012 |
cterm_of sign (Logic.mk_inclass (TVar (("'a", 0), [c]), c)) |
|
1013 |
handle TERM (msg, _) => raise THM ("class_triv: " ^ msg, 0, []); |
|
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1014 |
in |
1238 | 1015 |
fix_shyps [] [] |
1529 | 1016 |
(Thm {sign = sign, |
1017 |
der = infer_derivs (Class_triv(thy,c), []), |
|
1018 |
maxidx = maxidx, |
|
1019 |
shyps = [], |
|
1020 |
hyps = [], |
|
1021 |
prop = t}) |
|
399
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1022 |
end; |
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1023 |
|
86cc2b98f9e0
added class_triv: theory -> class -> thm (for axclasses);
wenzelm
parents:
387
diff
changeset
|
1024 |
|
0 | 1025 |
(* Replace all TFrees not in the hyps by new TVars *) |
1529 | 1026 |
fun varifyT(Thm{sign,der,maxidx,shyps,hyps,prop}) = |
0 | 1027 |
let val tfrees = foldr add_term_tfree_names (hyps,[]) |
1238 | 1028 |
in (*no fix_shyps*) |
1529 | 1029 |
Thm{sign = sign, |
1030 |
der = infer_derivs (VarifyT, [der]), |
|
1031 |
maxidx = max[0,maxidx], |
|
1032 |
shyps = shyps, |
|
1033 |
hyps = hyps, |
|
1034 |
prop = Type.varify(prop,tfrees)} |
|
0 | 1035 |
end; |
1036 |
||
1037 |
(* Replace all TVars by new TFrees *) |
|
1529 | 1038 |
fun freezeT(Thm{sign,der,maxidx,shyps,hyps,prop}) = |
949
83c588d6fee9
Changed treatment of during type inference internally generated type
nipkow
parents:
922
diff
changeset
|
1039 |
let val prop' = Type.freeze prop |
1238 | 1040 |
in (*no fix_shyps*) |
1529 | 1041 |
Thm{sign = sign, |
1042 |
der = infer_derivs (FreezeT, [der]), |
|
1043 |
maxidx = maxidx_of_term prop', |
|
1044 |
shyps = shyps, |
|
1045 |
hyps = hyps, |
|
1046 |
prop = prop'} |
|
1220 | 1047 |
end; |
0 | 1048 |
|
1049 |
||
1050 |
(*** Inference rules for tactics ***) |
|
1051 |
||
1052 |
(*Destruct proof state into constraints, other goals, goal(i), rest *) |
|
1053 |
fun dest_state (state as Thm{prop,...}, i) = |
|
1054 |
let val (tpairs,horn) = Logic.strip_flexpairs prop |
|
1055 |
in case Logic.strip_prems(i, [], horn) of |
|
1056 |
(B::rBs, C) => (tpairs, rev rBs, B, C) |
|
1057 |
| _ => raise THM("dest_state", i, [state]) |
|
1058 |
end |
|
1059 |
handle TERM _ => raise THM("dest_state", i, [state]); |
|
1060 |
||
309 | 1061 |
(*Increment variables and parameters of orule as required for |
0 | 1062 |
resolution with goal i of state. *) |
1063 |
fun lift_rule (state, i) orule = |
|
1529 | 1064 |
let val Thm{shyps=sshyps, prop=sprop, maxidx=smax, sign=ssign,...} = state |
0 | 1065 |
val (Bi::_, _) = Logic.strip_prems(i, [], Logic.skip_flexpairs sprop) |
1529 | 1066 |
handle TERM _ => raise THM("lift_rule", i, [orule,state]) |
1067 |
val ct_Bi = Cterm {sign=ssign, maxidx=smax, T=propT, t=Bi} |
|
1068 |
val (lift_abs,lift_all) = Logic.lift_fns(Bi,smax+1) |
|
1069 |
val (Thm{sign, der, maxidx,shyps,hyps,prop}) = orule |
|
0 | 1070 |
val (tpairs,As,B) = Logic.strip_horn prop |
1238 | 1071 |
in (*no fix_shyps*) |
1529 | 1072 |
Thm{sign = merge_thm_sgs(state,orule), |
1073 |
der = infer_derivs (Lift_rule(ct_Bi, i), [der]), |
|
1074 |
maxidx = maxidx+smax+1, |
|
1075 |
shyps=sshyps union shyps, |
|
1076 |
hyps=hyps, |
|
1077 |
prop = Logic.rule_of (map (pairself lift_abs) tpairs, |
|
1078 |
map lift_all As, |
|
1079 |
lift_all B)} |
|
0 | 1080 |
end; |
1081 |
||
1082 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. *) |
|
1083 |
fun assumption i state = |
|
1529 | 1084 |
let val Thm{sign,der,maxidx,hyps,prop,...} = state; |
0 | 1085 |
val (tpairs, Bs, Bi, C) = dest_state(state,i) |
250 | 1086 |
fun newth (env as Envir.Envir{maxidx, ...}, tpairs) = |
1220 | 1087 |
fix_shyps [state] (env_codT env) |
1529 | 1088 |
(Thm{sign = sign, |
1089 |
der = infer_derivs (Assumption (i, Some env), [der]), |
|
1090 |
maxidx = maxidx, |
|
1091 |
shyps = [], |
|
1092 |
hyps = hyps, |
|
1093 |
prop = |
|
1094 |
if Envir.is_empty env then (*avoid wasted normalizations*) |
|
1095 |
Logic.rule_of (tpairs, Bs, C) |
|
1096 |
else (*normalize the new rule fully*) |
|
1097 |
Envir.norm_term env (Logic.rule_of (tpairs, Bs, C))}); |
|
0 | 1098 |
fun addprfs [] = Sequence.null |
1099 |
| addprfs ((t,u)::apairs) = Sequence.seqof (fn()=> Sequence.pull |
|
1100 |
(Sequence.mapp newth |
|
250 | 1101 |
(Unify.unifiers(sign,Envir.empty maxidx, (t,u)::tpairs)) |
1102 |
(addprfs apairs))) |
|
0 | 1103 |
in addprfs (Logic.assum_pairs Bi) end; |
1104 |
||
250 | 1105 |
(*Solve subgoal Bi of proof state B1...Bn/C by assumption. |
0 | 1106 |
Checks if Bi's conclusion is alpha-convertible to one of its assumptions*) |
1107 |
fun eq_assumption i state = |
|
1529 | 1108 |
let val Thm{sign,der,maxidx,hyps,prop,...} = state; |
0 | 1109 |
val (tpairs, Bs, Bi, C) = dest_state(state,i) |
1110 |
in if exists (op aconv) (Logic.assum_pairs Bi) |
|
1220 | 1111 |
then fix_shyps [state] [] |
1529 | 1112 |
(Thm{sign = sign, |
1113 |
der = infer_derivs (Assumption (i,None), [der]), |
|
1114 |
maxidx = maxidx, |
|
1115 |
shyps = [], |
|
1116 |
hyps = hyps, |
|
1117 |
prop = Logic.rule_of(tpairs, Bs, C)}) |
|
0 | 1118 |
else raise THM("eq_assumption", 0, [state]) |
1119 |
end; |
|
1120 |
||
1121 |
||
1122 |
(** User renaming of parameters in a subgoal **) |
|
1123 |
||
1124 |
(*Calls error rather than raising an exception because it is intended |
|
1125 |
for top-level use -- exception handling would not make sense here. |
|
1126 |
The names in cs, if distinct, are used for the innermost parameters; |
|
1127 |
preceding parameters may be renamed to make all params distinct.*) |
|
1128 |
fun rename_params_rule (cs, i) state = |
|
1529 | 1129 |
let val Thm{sign,der,maxidx,hyps,prop,...} = state |
0 | 1130 |
val (tpairs, Bs, Bi, C) = dest_state(state,i) |
1131 |
val iparams = map #1 (Logic.strip_params Bi) |
|
1132 |
val short = length iparams - length cs |
|
250 | 1133 |
val newnames = |
1134 |
if short<0 then error"More names than abstractions!" |
|
1135 |
else variantlist(take (short,iparams), cs) @ cs |
|
0 | 1136 |
val freenames = map (#1 o dest_Free) (term_frees prop) |
1137 |
val newBi = Logic.list_rename_params (newnames, Bi) |
|
250 | 1138 |
in |
0 | 1139 |
case findrep cs of |
1140 |
c::_ => error ("Bound variables not distinct: " ^ c) |
|
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1569
diff
changeset
|
1141 |
| [] => (case cs inter_string freenames of |
0 | 1142 |
a::_ => error ("Bound/Free variable clash: " ^ a) |
1220 | 1143 |
| [] => fix_shyps [state] [] |
1529 | 1144 |
(Thm{sign = sign, |
1145 |
der = infer_derivs (Rename_params_rule(cs,i), [der]), |
|
1146 |
maxidx = maxidx, |
|
1147 |
shyps = [], |
|
1148 |
hyps = hyps, |
|
1149 |
prop = Logic.rule_of(tpairs, Bs@[newBi], C)})) |
|
0 | 1150 |
end; |
1151 |
||
1152 |
(*** Preservation of bound variable names ***) |
|
1153 |
||
250 | 1154 |
(*Scan a pair of terms; while they are similar, |
0 | 1155 |
accumulate corresponding bound vars in "al"*) |
1238 | 1156 |
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) = |
1195
686e3eb613b9
match_bvs no longer puts a name in the alist if it is null ("")
lcp
parents:
1160
diff
changeset
|
1157 |
match_bvs(s, t, if x="" orelse y="" then al |
1238 | 1158 |
else (x,y)::al) |
0 | 1159 |
| match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al)) |
1160 |
| match_bvs(_,_,al) = al; |
|
1161 |
||
1162 |
(* strip abstractions created by parameters *) |
|
1163 |
fun match_bvars((s,t),al) = match_bvs(strip_abs_body s, strip_abs_body t, al); |
|
1164 |
||
1165 |
||
250 | 1166 |
(* strip_apply f A(,B) strips off all assumptions/parameters from A |
0 | 1167 |
introduced by lifting over B, and applies f to remaining part of A*) |
1168 |
fun strip_apply f = |
|
1169 |
let fun strip(Const("==>",_)$ A1 $ B1, |
|
250 | 1170 |
Const("==>",_)$ _ $ B2) = implies $ A1 $ strip(B1,B2) |
1171 |
| strip((c as Const("all",_)) $ Abs(a,T,t1), |
|
1172 |
Const("all",_) $ Abs(_,_,t2)) = c$Abs(a,T,strip(t1,t2)) |
|
1173 |
| strip(A,_) = f A |
|
0 | 1174 |
in strip end; |
1175 |
||
1176 |
(*Use the alist to rename all bound variables and some unknowns in a term |
|
1177 |
dpairs = current disagreement pairs; tpairs = permanent ones (flexflex); |
|
1178 |
Preserves unknowns in tpairs and on lhs of dpairs. *) |
|
1179 |
fun rename_bvs([],_,_,_) = I |
|
1180 |
| rename_bvs(al,dpairs,tpairs,B) = |
|
250 | 1181 |
let val vars = foldr add_term_vars |
1182 |
(map fst dpairs @ map fst tpairs @ map snd tpairs, []) |
|
1183 |
(*unknowns appearing elsewhere be preserved!*) |
|
1184 |
val vids = map (#1 o #1 o dest_Var) vars; |
|
1185 |
fun rename(t as Var((x,i),T)) = |
|
1186 |
(case assoc(al,x) of |
|
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1569
diff
changeset
|
1187 |
Some(y) => if x mem_string vids orelse y mem_string vids then t |
250 | 1188 |
else Var((y,i),T) |
1189 |
| None=> t) |
|
0 | 1190 |
| rename(Abs(x,T,t)) = |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1569
diff
changeset
|
1191 |
Abs(case assoc_string(al,x) of Some(y) => y | None => x, |
250 | 1192 |
T, rename t) |
0 | 1193 |
| rename(f$t) = rename f $ rename t |
1194 |
| rename(t) = t; |
|
250 | 1195 |
fun strip_ren Ai = strip_apply rename (Ai,B) |
0 | 1196 |
in strip_ren end; |
1197 |
||
1198 |
(*Function to rename bounds/unknowns in the argument, lifted over B*) |
|
1199 |
fun rename_bvars(dpairs, tpairs, B) = |
|
250 | 1200 |
rename_bvs(foldr match_bvars (dpairs,[]), dpairs, tpairs, B); |
0 | 1201 |
|
1202 |
||
1203 |
(*** RESOLUTION ***) |
|
1204 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1205 |
(** Lifting optimizations **) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1206 |
|
0 | 1207 |
(*strip off pairs of assumptions/parameters in parallel -- they are |
1208 |
identical because of lifting*) |
|
250 | 1209 |
fun strip_assums2 (Const("==>", _) $ _ $ B1, |
1210 |
Const("==>", _) $ _ $ B2) = strip_assums2 (B1,B2) |
|
0 | 1211 |
| strip_assums2 (Const("all",_)$Abs(a,T,t1), |
250 | 1212 |
Const("all",_)$Abs(_,_,t2)) = |
0 | 1213 |
let val (B1,B2) = strip_assums2 (t1,t2) |
1214 |
in (Abs(a,T,B1), Abs(a,T,B2)) end |
|
1215 |
| strip_assums2 BB = BB; |
|
1216 |
||
1217 |
||
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1218 |
(*Faster normalization: skip assumptions that were lifted over*) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1219 |
fun norm_term_skip env 0 t = Envir.norm_term env t |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1220 |
| norm_term_skip env n (Const("all",_)$Abs(a,T,t)) = |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1221 |
let val Envir.Envir{iTs, ...} = env |
1238 | 1222 |
val T' = typ_subst_TVars iTs T |
1223 |
(*Must instantiate types of parameters because they are flattened; |
|
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1224 |
this could be a NEW parameter*) |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1225 |
in all T' $ Abs(a, T', norm_term_skip env n t) end |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1226 |
| norm_term_skip env n (Const("==>", _) $ A $ B) = |
1238 | 1227 |
implies $ A $ norm_term_skip env (n-1) B |
721
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1228 |
| norm_term_skip env n t = error"norm_term_skip: too few assumptions??"; |
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1229 |
|
479832ff2d29
Pure/thm/norm_term_skip: new, for skipping normalization of the context
lcp
parents:
678
diff
changeset
|
1230 |
|
0 | 1231 |
(*Composition of object rule r=(A1...Am/B) with proof state s=(B1...Bn/C) |
250 | 1232 |
Unifies B with Bi, replacing subgoal i (1 <= i <= n) |
0 | 1233 |
If match then forbid instantiations in proof state |
1234 |
If lifted then shorten the dpair using strip_assums2. |
|
1235 |
If eres_flg then simultaneously proves A1 by assumption. |
|
250 | 1236 |
nsubgoal is the number of new subgoals (written m above). |
0 | 1237 |
Curried so that resolution calls dest_state only once. |
1238 |
*) |
|
1529 | 1239 |
local open Sequence; exception COMPOSE |
0 | 1240 |
in |
250 | 1241 |
fun bicompose_aux match (state, (stpairs, Bs, Bi, C), lifted) |
0 | 1242 |
(eres_flg, orule, nsubgoal) = |
1529 | 1243 |
let val Thm{der=sder, maxidx=smax, shyps=sshyps, hyps=shyps, ...} = state |
1244 |
and Thm{der=rder, maxidx=rmax, shyps=rshyps, hyps=rhyps, |
|
1245 |
prop=rprop,...} = orule |
|
1246 |
(*How many hyps to skip over during normalization*) |
|
1238 | 1247 |
and nlift = Logic.count_prems(strip_all_body Bi, |
1248 |
if eres_flg then ~1 else 0) |
|
387
69f4356d915d
new datatype theory, supports 'draft theories' and incremental extension:
wenzelm
parents:
309
diff
changeset
|
1249 |
val sign = merge_thm_sgs(state,orule); |
0 | 1250 |
(** Add new theorem with prop = '[| Bs; As |] ==> C' to thq **) |
250 | 1251 |
fun addth As ((env as Envir.Envir {maxidx, ...}, tpairs), thq) = |
1252 |
let val normt = Envir.norm_term env; |
|
1253 |
(*perform minimal copying here by examining env*) |
|
1254 |
val normp = |
|
1255 |
if Envir.is_empty env then (tpairs, Bs @ As, C) |
|
1256 |
else |
|
1257 |
let val ntps = map (pairself normt) tpairs |
|
1238 | 1258 |
in if the (Envir.minidx env) > smax then |
1259 |
(*no assignments in state; normalize the rule only*) |
|
1260 |
if lifted |
|
1261 |
then (ntps, Bs @ map (norm_term_skip env nlift) As, C) |
|
1262 |
else (ntps, Bs @ map normt As, C) |
|
1529 | 1263 |
else if match then raise COMPOSE |
250 | 1264 |
else (*normalize the new rule fully*) |
1265 |
(ntps, map normt (Bs @ As), normt C) |
|
1266 |
end |
|
1258 | 1267 |
val th = (*tuned fix_shyps*) |
1529 | 1268 |
Thm{sign = sign, |
1269 |
der = infer_derivs (Bicompose(match, eres_flg, |
|
1270 |
1 + length Bs, nsubgoal, env), |
|
1271 |
[rder,sder]), |
|
1272 |
maxidx = maxidx, |
|
1273 |
shyps = add_env_sorts (env, rshyps union sshyps), |
|
1274 |
hyps = rhyps union shyps, |
|
1275 |
prop = Logic.rule_of normp} |
|
1276 |
in cons(th, thq) end handle COMPOSE => thq |
|
0 | 1277 |
val (rtpairs,rhorn) = Logic.strip_flexpairs(rprop); |
1278 |
val (rAs,B) = Logic.strip_prems(nsubgoal, [], rhorn) |
|
1279 |
handle TERM _ => raise THM("bicompose: rule", 0, [orule,state]); |
|
1280 |
(*Modify assumptions, deleting n-th if n>0 for e-resolution*) |
|
1281 |
fun newAs(As0, n, dpairs, tpairs) = |
|
1282 |
let val As1 = if !Logic.auto_rename orelse not lifted then As0 |
|
250 | 1283 |
else map (rename_bvars(dpairs,tpairs,B)) As0 |
0 | 1284 |
in (map (Logic.flatten_params n) As1) |
250 | 1285 |
handle TERM _ => |
1286 |
raise THM("bicompose: 1st premise", 0, [orule]) |
|
0 | 1287 |
end; |
1288 |
val env = Envir.empty(max[rmax,smax]); |
|
1289 |
val BBi = if lifted then strip_assums2(B,Bi) else (B,Bi); |
|
1290 |
val dpairs = BBi :: (rtpairs@stpairs); |
|
1291 |
(*elim-resolution: try each assumption in turn. Initially n=1*) |
|
1292 |
fun tryasms (_, _, []) = null |
|
1293 |
| tryasms (As, n, (t,u)::apairs) = |
|
250 | 1294 |
(case pull(Unify.unifiers(sign, env, (t,u)::dpairs)) of |
1295 |
None => tryasms (As, n+1, apairs) |
|
1296 |
| cell as Some((_,tpairs),_) => |
|
1297 |
its_right (addth (newAs(As, n, [BBi,(u,t)], tpairs))) |
|
1298 |
(seqof (fn()=> cell), |
|
1299 |
seqof (fn()=> pull (tryasms (As, n+1, apairs))))); |
|
0 | 1300 |
fun eres [] = raise THM("bicompose: no premises", 0, [orule,state]) |
1301 |
| eres (A1::As) = tryasms (As, 1, Logic.assum_pairs A1); |
|
1302 |
(*ordinary resolution*) |
|
1303 |
fun res(None) = null |
|
250 | 1304 |
| res(cell as Some((_,tpairs),_)) = |
1305 |
its_right (addth(newAs(rev rAs, 0, [BBi], tpairs))) |
|
1306 |
(seqof (fn()=> cell), null) |
|
0 | 1307 |
in if eres_flg then eres(rev rAs) |
1308 |
else res(pull(Unify.unifiers(sign, env, dpairs))) |
|
1309 |
end; |
|
1310 |
end; (*open Sequence*) |
|
1311 |
||
1312 |
||
1313 |
fun bicompose match arg i state = |
|
1314 |
bicompose_aux match (state, dest_state(state,i), false) arg; |
|
1315 |
||
1316 |
(*Quick test whether rule is resolvable with the subgoal with hyps Hs |
|
1317 |
and conclusion B. If eres_flg then checks 1st premise of rule also*) |
|
1318 |
fun could_bires (Hs, B, eres_flg, rule) = |
|
1319 |
let fun could_reshyp (A1::_) = exists (apl(A1,could_unify)) Hs |
|
250 | 1320 |
| could_reshyp [] = false; (*no premise -- illegal*) |
1321 |
in could_unify(concl_of rule, B) andalso |
|
1322 |
(not eres_flg orelse could_reshyp (prems_of rule)) |
|
0 | 1323 |
end; |
1324 |
||
1325 |
(*Bi-resolution of a state with a list of (flag,rule) pairs. |
|
1326 |
Puts the rule above: rule/state. Renames vars in the rules. *) |
|
250 | 1327 |
fun biresolution match brules i state = |
0 | 1328 |
let val lift = lift_rule(state, i); |
250 | 1329 |
val (stpairs, Bs, Bi, C) = dest_state(state,i) |
1330 |
val B = Logic.strip_assums_concl Bi; |
|
1331 |
val Hs = Logic.strip_assums_hyp Bi; |
|
1332 |
val comp = bicompose_aux match (state, (stpairs, Bs, Bi, C), true); |
|
1333 |
fun res [] = Sequence.null |
|
1334 |
| res ((eres_flg, rule)::brules) = |
|
1335 |
if could_bires (Hs, B, eres_flg, rule) |
|
1160 | 1336 |
then Sequence.seqof (*delay processing remainder till needed*) |
250 | 1337 |
(fn()=> Some(comp (eres_flg, lift rule, nprems_of rule), |
1338 |
res brules)) |
|
1339 |
else res brules |
|
0 | 1340 |
in Sequence.flats (res brules) end; |
1341 |
||
1342 |
||
1343 |
||
1344 |
(*** Meta simp sets ***) |
|
1345 |
||
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1346 |
type rrule = {thm:thm, lhs:term, perm:bool}; |
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1347 |
type cong = {thm:thm, lhs:term}; |
0 | 1348 |
datatype meta_simpset = |
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1349 |
Mss of {net:rrule Net.net, congs:(string * cong)list, bounds:string list, |
0 | 1350 |
prems: thm list, mk_rews: thm -> thm list}; |
1351 |
||
1352 |
(*A "mss" contains data needed during conversion: |
|
1353 |
net: discrimination net of rewrite rules |
|
1354 |
congs: association list of congruence rules |
|
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1355 |
bounds: names of bound variables already used; |
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1356 |
for generating new names when rewriting under lambda abstractions |
0 | 1357 |
mk_rews: used when local assumptions are added |
1358 |
*) |
|
1359 |
||
1529 | 1360 |
val empty_mss = Mss{net = Net.empty, congs = [], bounds=[], prems = [], |
0 | 1361 |
mk_rews = K[]}; |
1362 |
||
1363 |
exception SIMPLIFIER of string * thm; |
|
1364 |
||
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
1365 |
fun prtm a sign t = (writeln a; writeln(Sign.string_of_term sign t)); |
0 | 1366 |
|
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1367 |
fun prtm_warning a sign t = warning (a ^ "\n" ^ (Sign.string_of_term sign t)); |
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1368 |
|
209 | 1369 |
val trace_simp = ref false; |
1370 |
||
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
1371 |
fun trace_term a sign t = if !trace_simp then prtm a sign t else (); |
209 | 1372 |
|
1373 |
fun trace_thm a (Thm{sign,prop,...}) = trace_term a sign prop; |
|
1374 |
||
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1375 |
fun trace_term_warning a sign t = if !trace_simp then prtm_warning a sign t else (); |
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1376 |
|
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1377 |
fun trace_thm_warning a (Thm{sign,prop,...}) = trace_term_warning a sign prop; |
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1378 |
|
427
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1379 |
fun vperm(Var _, Var _) = true |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1380 |
| vperm(Abs(_,_,s), Abs(_,_,t)) = vperm(s,t) |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1381 |
| vperm(t1$t2, u1$u2) = vperm(t1,u1) andalso vperm(t2,u2) |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1382 |
| vperm(t,u) = (t=u); |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1383 |
|
427
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1384 |
fun var_perm(t,u) = vperm(t,u) andalso |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1385 |
eq_set(add_term_vars(t,[]), add_term_vars(u,[])) |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1386 |
|
0 | 1387 |
(*simple test for looping rewrite*) |
1388 |
fun loops sign prems (lhs,rhs) = |
|
1023
f5f36bdc8003
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow
parents:
979
diff
changeset
|
1389 |
is_Var(lhs) |
f5f36bdc8003
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow
parents:
979
diff
changeset
|
1390 |
orelse |
f5f36bdc8003
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow
parents:
979
diff
changeset
|
1391 |
(exists (apl(lhs, Logic.occs)) (rhs::prems)) |
f5f36bdc8003
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow
parents:
979
diff
changeset
|
1392 |
orelse |
f5f36bdc8003
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow
parents:
979
diff
changeset
|
1393 |
(null(prems) andalso |
f5f36bdc8003
Fixed bug in the simplifier: added uses of maxidx_of_term to make sure that
nipkow
parents:
979
diff
changeset
|
1394 |
Pattern.matches (#tsig(Sign.rep_sg sign)) (lhs,rhs)); |
1028 | 1395 |
(* the condition "null(prems)" in the last case is necessary because |
1396 |
conditional rewrites with extra variables in the conditions may terminate |
|
1397 |
although the rhs is an instance of the lhs. Example: |
|
1398 |
?m < ?n ==> f(?n) == f(?m) |
|
1399 |
*) |
|
0 | 1400 |
|
1238 | 1401 |
fun mk_rrule raw_thm = |
1402 |
let |
|
1258 | 1403 |
val thm = strip_shyps raw_thm; |
1238 | 1404 |
val Thm{sign,prop,maxidx,...} = thm; |
1405 |
val prems = Logic.strip_imp_prems prop |
|
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1406 |
val concl = Logic.strip_imp_concl prop |
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1407 |
val (lhs,_) = Logic.dest_equals concl handle TERM _ => |
0 | 1408 |
raise SIMPLIFIER("Rewrite rule not a meta-equality",thm) |
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1409 |
val econcl = Pattern.eta_contract concl |
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1410 |
val (elhs,erhs) = Logic.dest_equals econcl |
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1411 |
val perm = var_perm(elhs,erhs) andalso not(elhs aconv erhs) |
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1412 |
andalso not(is_Var(elhs)) |
1220 | 1413 |
in |
1258 | 1414 |
if not perm andalso loops sign prems (elhs,erhs) then |
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1415 |
(prtm_warning "ignoring looping rewrite rule" sign prop; None) |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1416 |
else Some{thm=thm,lhs=lhs,perm=perm} |
0 | 1417 |
end; |
1418 |
||
87 | 1419 |
local |
1420 |
fun eq({thm=Thm{prop=p1,...},...}:rrule, |
|
1421 |
{thm=Thm{prop=p2,...},...}:rrule) = p1 aconv p2 |
|
1422 |
in |
|
1423 |
||
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1424 |
fun add_simp(mss as Mss{net,congs,bounds,prems,mk_rews}, |
0 | 1425 |
thm as Thm{sign,prop,...}) = |
87 | 1426 |
case mk_rrule thm of |
1427 |
None => mss |
|
1428 |
| Some(rrule as {lhs,...}) => |
|
209 | 1429 |
(trace_thm "Adding rewrite rule:" thm; |
1529 | 1430 |
Mss{net = (Net.insert_term((lhs,rrule),net,eq) |
209 | 1431 |
handle Net.INSERT => |
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1432 |
(prtm_warning "ignoring duplicate rewrite rule" sign prop; |
87 | 1433 |
net)), |
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1434 |
congs=congs, bounds=bounds, prems=prems,mk_rews=mk_rews}); |
87 | 1435 |
|
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1436 |
fun del_simp(mss as Mss{net,congs,bounds,prems,mk_rews}, |
87 | 1437 |
thm as Thm{sign,prop,...}) = |
1438 |
case mk_rrule thm of |
|
1439 |
None => mss |
|
1440 |
| Some(rrule as {lhs,...}) => |
|
1529 | 1441 |
Mss{net = (Net.delete_term((lhs,rrule),net,eq) |
87 | 1442 |
handle Net.INSERT => |
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1443 |
(prtm_warning "rewrite rule not in simpset" sign prop; |
87 | 1444 |
net)), |
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1445 |
congs=congs, bounds=bounds, prems=prems,mk_rews=mk_rews} |
87 | 1446 |
|
1447 |
end; |
|
0 | 1448 |
|
1449 |
val add_simps = foldl add_simp; |
|
87 | 1450 |
val del_simps = foldl del_simp; |
0 | 1451 |
|
1452 |
fun mss_of thms = add_simps(empty_mss,thms); |
|
1453 |
||
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1454 |
fun add_cong(Mss{net,congs,bounds,prems,mk_rews},thm) = |
0 | 1455 |
let val (lhs,_) = Logic.dest_equals(concl_of thm) handle TERM _ => |
1456 |
raise SIMPLIFIER("Congruence not a meta-equality",thm) |
|
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1457 |
(* val lhs = Pattern.eta_contract lhs*) |
0 | 1458 |
val (a,_) = dest_Const (head_of lhs) handle TERM _ => |
1459 |
raise SIMPLIFIER("Congruence must start with a constant",thm) |
|
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1460 |
in Mss{net=net, congs=(a,{lhs=lhs,thm=thm})::congs, bounds=bounds, |
0 | 1461 |
prems=prems, mk_rews=mk_rews} |
1462 |
end; |
|
1463 |
||
1464 |
val (op add_congs) = foldl add_cong; |
|
1465 |
||
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1466 |
fun add_prems(Mss{net,congs,bounds,prems,mk_rews},thms) = |
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1467 |
Mss{net=net, congs=congs, bounds=bounds, prems=thms@prems, mk_rews=mk_rews}; |
0 | 1468 |
|
1469 |
fun prems_of_mss(Mss{prems,...}) = prems; |
|
1470 |
||
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1471 |
fun set_mk_rews(Mss{net,congs,bounds,prems,...},mk_rews) = |
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1472 |
Mss{net=net, congs=congs, bounds=bounds, prems=prems, mk_rews=mk_rews}; |
0 | 1473 |
fun mk_rews_of_mss(Mss{mk_rews,...}) = mk_rews; |
1474 |
||
1475 |
||
250 | 1476 |
(*** Meta-level rewriting |
0 | 1477 |
uses conversions, omitting proofs for efficiency. See |
250 | 1478 |
L C Paulson, A higher-order implementation of rewriting, |
1479 |
Science of Computer Programming 3 (1983), pages 119-149. ***) |
|
0 | 1480 |
|
1481 |
type prover = meta_simpset -> thm -> thm option; |
|
1482 |
type termrec = (Sign.sg * term list) * term; |
|
1483 |
type conv = meta_simpset -> termrec -> termrec; |
|
1484 |
||
305
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1485 |
datatype order = LESS | EQUAL | GREATER; |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1486 |
|
305
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1487 |
fun stringord(a,b:string) = if a<b then LESS else |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1488 |
if a=b then EQUAL else GREATER; |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1489 |
|
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1490 |
fun intord(i,j:int) = if i<j then LESS else |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1491 |
if i=j then EQUAL else GREATER; |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1492 |
|
427
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1493 |
(* NB: non-linearity of the ordering is not a soundness problem *) |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1494 |
|
305
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1495 |
(* FIXME: "***ABSTRACTION***" is a hack and makes the ordering non-linear *) |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1496 |
fun string_of_hd(Const(a,_)) = a |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1497 |
| string_of_hd(Free(a,_)) = a |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1498 |
| string_of_hd(Var(v,_)) = Syntax.string_of_vname v |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1499 |
| string_of_hd(Bound i) = string_of_int i |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1500 |
| string_of_hd(Abs _) = "***ABSTRACTION***"; |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1501 |
|
305
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1502 |
(* a strict (not reflexive) linear well-founded AC-compatible ordering |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1503 |
* for terms: |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1504 |
* s < t <=> 1. size(s) < size(t) or |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1505 |
2. size(s) = size(t) and s=f(...) and t = g(...) and f<g or |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1506 |
3. size(s) = size(t) and s=f(s1..sn) and t=f(t1..tn) and |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1507 |
(s1..sn) < (t1..tn) (lexicographically) |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1508 |
*) |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1509 |
|
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1510 |
(* FIXME: should really take types into account as well. |
427
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1511 |
* Otherwise non-linear *) |
622
bf9821f58781
Modified termord to take account of the Abs-Abs case.
nipkow
parents:
574
diff
changeset
|
1512 |
fun termord(Abs(_,_,t),Abs(_,_,u)) = termord(t,u) |
bf9821f58781
Modified termord to take account of the Abs-Abs case.
nipkow
parents:
574
diff
changeset
|
1513 |
| termord(t,u) = |
305
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1514 |
(case intord(size_of_term t,size_of_term u) of |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1515 |
EQUAL => let val (f,ts) = strip_comb t and (g,us) = strip_comb u |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1516 |
in case stringord(string_of_hd f, string_of_hd g) of |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1517 |
EQUAL => lextermord(ts,us) |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1518 |
| ord => ord |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1519 |
end |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1520 |
| ord => ord) |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1521 |
and lextermord(t::ts,u::us) = |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1522 |
(case termord(t,u) of |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1523 |
EQUAL => lextermord(ts,us) |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1524 |
| ord => ord) |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1525 |
| lextermord([],[]) = EQUAL |
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1526 |
| lextermord _ = error("lextermord"); |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1527 |
|
305
4c2bbb5de471
Changed term ordering for permutative rewrites to be AC-compatible.
nipkow
parents:
288
diff
changeset
|
1528 |
fun termless tu = (termord tu = LESS); |
288
b00ce6a1fe27
Implemented "ordered rewriting": rules which merely permute variables, such
nipkow
parents:
274
diff
changeset
|
1529 |
|
1529 | 1530 |
fun check_conv (thm as Thm{shyps,hyps,prop,sign,der,maxidx,...}, prop0, ders) = |
432 | 1531 |
let fun err() = (trace_thm "Proved wrong thm (Check subgoaler?)" thm; |
1532 |
trace_term "Should have proved" sign prop0; |
|
1533 |
None) |
|
0 | 1534 |
val (lhs0,_) = Logic.dest_equals(Logic.strip_imp_concl prop0) |
1535 |
in case prop of |
|
1536 |
Const("==",_) $ lhs $ rhs => |
|
1537 |
if (lhs = lhs0) orelse |
|
427
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1538 |
(lhs aconv Envir.norm_term (Envir.empty 0) lhs0) |
1529 | 1539 |
then (trace_thm "SUCCEEDED" thm; |
1540 |
Some(shyps, hyps, maxidx, rhs, der::ders)) |
|
0 | 1541 |
else err() |
1542 |
| _ => err() |
|
1543 |
end; |
|
1544 |
||
659
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1545 |
fun ren_inst(insts,prop,pat,obj) = |
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1546 |
let val ren = match_bvs(pat,obj,[]) |
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1547 |
fun renAbs(Abs(x,T,b)) = |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1569
diff
changeset
|
1548 |
Abs(case assoc_string(ren,x) of None => x | Some(y) => y, T, renAbs(b)) |
659
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1549 |
| renAbs(f$t) = renAbs(f) $ renAbs(t) |
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1550 |
| renAbs(t) = t |
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1551 |
in subst_vars insts (if null(ren) then prop else renAbs(prop)) end; |
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1552 |
|
1258 | 1553 |
fun add_insts_sorts ((iTs, is), Ss) = |
1554 |
add_typs_sorts (map snd iTs, add_terms_sorts (map snd is, Ss)); |
|
1555 |
||
659
95ed2ccb4438
Prepared the code for preservation of bound var names during rewriting. Still
nipkow
parents:
623
diff
changeset
|
1556 |
|
0 | 1557 |
(*Conversion to apply the meta simpset to a term*) |
1529 | 1558 |
fun rewritec (prover,signt) (mss as Mss{net,...}) |
1559 |
(shypst,hypst,maxidxt,t,ders) = |
|
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1560 |
let val etat = Pattern.eta_contract t; |
1529 | 1561 |
fun rew {thm as Thm{sign,der,maxidx,shyps,hyps,prop,...}, lhs, perm} = |
250 | 1562 |
let val unit = if Sign.subsig(sign,signt) then () |
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset
|
1563 |
else (trace_thm_warning "rewrite rule from different theory" |
446
3ee5c9314efe
rewritec now uses trace_thm for it's "rewrite rule from different theory"
clasohm
parents:
432
diff
changeset
|
1564 |
thm; |
208
342f88d2e8ab
optimized simplifier - signature of rewritten term stays constant
nipkow
parents:
200
diff
changeset
|
1565 |
raise Pattern.MATCH) |
1065
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1566 |
val rprop = if maxidxt = ~1 then prop |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1567 |
else Logic.incr_indexes([],maxidxt+1) prop; |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1568 |
val rlhs = if maxidxt = ~1 then lhs |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1569 |
else fst(Logic.dest_equals(Logic.strip_imp_concl rprop)) |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1570 |
val insts = Pattern.match (#tsig(Sign.rep_sg signt)) (rlhs,etat) |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1571 |
val prop' = ren_inst(insts,rprop,rlhs,t); |
0 | 1572 |
val hyps' = hyps union hypst; |
1258 | 1573 |
val shyps' = add_insts_sorts (insts, shyps union shypst); |
1065
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1574 |
val maxidx' = maxidx_of_term prop' |
1529 | 1575 |
val ct' = Cterm{sign = signt, (*used for deriv only*) |
1576 |
t = prop', |
|
1577 |
T = propT, |
|
1578 |
maxidx = maxidx'} |
|
1579 |
val der' = infer_derivs (RewriteC ct', [der]) |
|
1580 |
val thm' = Thm{sign = signt, |
|
1581 |
der = der', |
|
1582 |
shyps = shyps', |
|
1583 |
hyps = hyps', |
|
1584 |
prop = prop', |
|
1585 |
maxidx = maxidx'} |
|
427
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1586 |
val (lhs',rhs') = Logic.dest_equals(Logic.strip_imp_concl prop') |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1587 |
in if perm andalso not(termless(rhs',lhs')) then None else |
4ce2ce940faf
ordered rewriting applies to conditional rules as well now
nipkow
parents:
421
diff
changeset
|
1588 |
if Logic.count_prems(prop',0) = 0 |
1529 | 1589 |
then (trace_thm "Rewriting:" thm'; |
1590 |
Some(shyps', hyps', maxidx', rhs', der'::ders)) |
|
0 | 1591 |
else (trace_thm "Trying to rewrite:" thm'; |
1592 |
case prover mss thm' of |
|
1593 |
None => (trace_thm "FAILED" thm'; None) |
|
1529 | 1594 |
| Some(thm2) => check_conv(thm2,prop',ders)) |
0 | 1595 |
end |
1596 |
||
225
76f60e6400e8
optimized net for matching of abstractions to speed up simplifier
nipkow
parents:
222
diff
changeset
|
1597 |
fun rews [] = None |
76f60e6400e8
optimized net for matching of abstractions to speed up simplifier
nipkow
parents:
222
diff
changeset
|
1598 |
| rews (rrule::rrules) = |
76f60e6400e8
optimized net for matching of abstractions to speed up simplifier
nipkow
parents:
222
diff
changeset
|
1599 |
let val opt = rew rrule handle Pattern.MATCH => None |
76f60e6400e8
optimized net for matching of abstractions to speed up simplifier
nipkow
parents:
222
diff
changeset
|
1600 |
in case opt of None => rews rrules | some => some end; |
0 | 1601 |
|
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1602 |
in case etat of |
1529 | 1603 |
Abs(_,_,body) $ u => Some(shypst, hypst, maxidxt, |
1604 |
subst_bounds([u], body), |
|
1605 |
ders) |
|
678
6151b7f3b606
Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents:
659
diff
changeset
|
1606 |
| _ => rews(Net.match_term net etat) |
0 | 1607 |
end; |
1608 |
||
1609 |
(*Conversion to apply a congruence rule to a term*) |
|
1529 | 1610 |
fun congc (prover,signt) {thm=cong,lhs=lhs} (shypst,hypst,maxidxt,t,ders) = |
1611 |
let val Thm{sign,der,shyps,hyps,maxidx,prop,...} = cong |
|
208
342f88d2e8ab
optimized simplifier - signature of rewritten term stays constant
nipkow
parents:
200
diff
changeset
|
1612 |
val unit = if Sign.subsig(sign,signt) then () |
342f88d2e8ab
optimized simplifier - signature of rewritten term stays constant
nipkow
parents:
200
diff
changeset
|
1613 |
else error("Congruence rule from different theory") |
342f88d2e8ab
optimized simplifier - signature of rewritten term stays constant
nipkow
parents:
200
diff
changeset
|
1614 |
val tsig = #tsig(Sign.rep_sg signt) |
1065
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1615 |
val rprop = if maxidxt = ~1 then prop |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1616 |
else Logic.incr_indexes([],maxidxt+1) prop; |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1617 |
val rlhs = if maxidxt = ~1 then lhs |
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1618 |
else fst(Logic.dest_equals(Logic.strip_imp_concl rprop)) |
1569
a89f246dee0e
Non-matching congruence rule in rewriter is simply ignored.
nipkow
parents:
1566
diff
changeset
|
1619 |
val insts = Pattern.match tsig (rlhs,t) |
a89f246dee0e
Non-matching congruence rule in rewriter is simply ignored.
nipkow
parents:
1566
diff
changeset
|
1620 |
(* Pattern.match can raise Pattern.MATCH; |
a89f246dee0e
Non-matching congruence rule in rewriter is simply ignored.
nipkow
parents:
1566
diff
changeset
|
1621 |
is handled when congc is called *) |
1065
8425cb5acb77
Fixed old bug in the simplifier. Term to be simplified now carries around its
nipkow
parents:
1028
diff
changeset
|
1622 |
val prop' = ren_inst(insts,rprop,rlhs,t); |
1529 | 1623 |
val shyps' = add_insts_sorts (insts, shyps union shypst) |
1624 |
val maxidx' = maxidx_of_term prop' |
|
1625 |
val ct' = Cterm{sign = signt, (*used for deriv only*) |
|
1626 |
t = prop', |
|
1627 |
T = propT, |
|
1628 |
maxidx = maxidx'} |
|
1629 |
val thm' = Thm{sign = signt, |
|
1630 |
der = infer_derivs (CongC ct', [der]), |
|
1631 |
shyps = shyps', |
|
1632 |
hyps = hyps union hypst, |
|
1633 |
prop = prop', |
|
1634 |
maxidx = maxidx'}; |
|
0 | 1635 |
val unit = trace_thm "Applying congruence rule" thm'; |
112
009ae5c85ae9
Changed the simplifier: if the subgoaler proves an unexpected thm, chances
nipkow
parents:
87
diff
changeset
|
1636 |
fun err() = error("Failed congruence proof!") |
0 | 1637 |
|
1638 |
in case prover thm' of |
|
112
009ae5c85ae9
Changed the simplifier: if the subgoaler proves an unexpected thm, chances
nipkow
parents:
87
diff
changeset
|
1639 |
None => err() |
1529 | 1640 |
| Some(thm2) => (case check_conv(thm2,prop',ders) of |
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1641 |
None => err() | some => some) |
0 | 1642 |
end; |
1643 |
||
1644 |
||
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1645 |
|
214
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
209
diff
changeset
|
1646 |
fun bottomc ((simprem,useprem),prover,sign) = |
1529 | 1647 |
let fun botc fail mss trec = |
1648 |
(case subc mss trec of |
|
1649 |
some as Some(trec1) => |
|
1650 |
(case rewritec (prover,sign) mss trec1 of |
|
1651 |
Some(trec2) => botc false mss trec2 |
|
1652 |
| None => some) |
|
1653 |
| None => |
|
1654 |
(case rewritec (prover,sign) mss trec of |
|
1655 |
Some(trec2) => botc false mss trec2 |
|
1656 |
| None => if fail then None else Some(trec))) |
|
0 | 1657 |
|
1529 | 1658 |
and try_botc mss trec = (case botc true mss trec of |
1659 |
Some(trec1) => trec1 |
|
1660 |
| None => trec) |
|
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1661 |
|
1529 | 1662 |
and subc (mss as Mss{net,congs,bounds,prems,mk_rews}) |
1663 |
(trec as (shyps,hyps,maxidx,t0,ders)) = |
|
1664 |
(case t0 of |
|
1665 |
Abs(a,T,t) => |
|
1666 |
let val b = variant bounds a |
|
1667 |
val v = Free("." ^ b,T) |
|
1668 |
val mss' = Mss{net=net, congs=congs, bounds=b::bounds, |
|
1669 |
prems=prems,mk_rews=mk_rews} |
|
1670 |
in case botc true mss' |
|
1671 |
(shyps,hyps,maxidx,subst_bounds([v],t),ders) of |
|
1672 |
Some(shyps',hyps',maxidx',t',ders') => |
|
1673 |
Some(shyps', hyps', maxidx', |
|
1674 |
Abs(a, T, abstract_over(v,t')), |
|
1675 |
ders') |
|
1676 |
| None => None |
|
1677 |
end |
|
1678 |
| t$u => (case t of |
|
1679 |
Const("==>",_)$s => Some(impc(shyps,hyps,maxidx,s,u,mss,ders)) |
|
1680 |
| Abs(_,_,body) => |
|
1681 |
let val trec = (shyps,hyps,maxidx,subst_bounds([u],body),ders) |
|
1682 |
in case subc mss trec of |
|
1683 |
None => Some(trec) |
|
1684 |
| trec => trec |
|
1685 |
end |
|
1686 |
| _ => |
|
1687 |
let fun appc() = |
|
1688 |
(case botc true mss (shyps,hyps,maxidx,t,ders) of |
|
1689 |
Some(shyps1,hyps1,maxidx1,t1,ders1) => |
|
1690 |
(case botc true mss (shyps1,hyps1,maxidx,u,ders1) of |
|
1691 |
Some(shyps2,hyps2,maxidx2,u1,ders2) => |
|
1692 |
Some(shyps2, hyps2, max[maxidx1,maxidx2], |
|
1693 |
t1$u1, ders2) |
|
1694 |
| None => |
|
1695 |
Some(shyps1, hyps1, max[maxidx1,maxidx], t1$u, |
|
1696 |
ders1)) |
|
1697 |
| None => |
|
1698 |
(case botc true mss (shyps,hyps,maxidx,u,ders) of |
|
1699 |
Some(shyps1,hyps1,maxidx1,u1,ders1) => |
|
1700 |
Some(shyps1, hyps1, max[maxidx,maxidx1], |
|
1701 |
t$u1, ders1) |
|
1702 |
| None => None)) |
|
1703 |
val (h,ts) = strip_comb t |
|
1704 |
in case h of |
|
1705 |
Const(a,_) => |
|
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1569
diff
changeset
|
1706 |
(case assoc_string(congs,a) of |
1529 | 1707 |
None => appc() |
1569
a89f246dee0e
Non-matching congruence rule in rewriter is simply ignored.
nipkow
parents:
1566
diff
changeset
|
1708 |
| Some(cong) => (congc (prover mss,sign) cong trec |
a89f246dee0e
Non-matching congruence rule in rewriter is simply ignored.
nipkow
parents:
1566
diff
changeset
|
1709 |
handle Pattern.MATCH => appc() ) ) |
1529 | 1710 |
| _ => appc() |
1711 |
end) |
|
1712 |
| _ => None) |
|
0 | 1713 |
|
1529 | 1714 |
and impc(shyps, hyps, maxidx, s, u, mss as Mss{mk_rews,...}, ders) = |
1715 |
let val (shyps1,hyps1,_,s1,ders1) = |
|
1716 |
if simprem then try_botc mss (shyps,hyps,maxidx,s,ders) |
|
1717 |
else (shyps,hyps,0,s,ders); |
|
1718 |
val maxidx1 = maxidx_of_term s1 |
|
1719 |
val mss1 = |
|
1720 |
if not useprem orelse maxidx1 <> ~1 then mss |
|
1721 |
else let val thm = assume (Cterm{sign=sign, t=s1, |
|
1722 |
T=propT, maxidx=maxidx1}) |
|
1723 |
in add_simps(add_prems(mss,[thm]), mk_rews thm) end |
|
1724 |
val (shyps2,hyps2,maxidx2,u1,ders2) = |
|
1725 |
try_botc mss1 (shyps1,hyps1,maxidx,u,ders1) |
|
1726 |
val hyps3 = if s1 mem hyps1 then hyps2 else hyps2\s1 |
|
1727 |
in (shyps2, hyps3, max[maxidx1,maxidx2], |
|
1728 |
Logic.mk_implies(s1,u1), ders2) |
|
1729 |
end |
|
0 | 1730 |
|
1529 | 1731 |
in try_botc end; |
0 | 1732 |
|
1733 |
||
1734 |
(*** Meta-rewriting: rewrites t to u and returns the theorem t==u ***) |
|
1735 |
(* Parameters: |
|
250 | 1736 |
mode = (simplify A, use A in simplifying B) when simplifying A ==> B |
0 | 1737 |
mss: contains equality theorems of the form [|p1,...|] ==> t==u |
1738 |
prover: how to solve premises in conditional rewrites and congruences |
|
1739 |
*) |
|
405
c97514f63633
Internale optimization of the simplifier: in case a subterm stays unchanged,
nipkow
parents:
399
diff
changeset
|
1740 |
(*** FIXME: check that #bounds(mss) does not "occur" in ct alread ***) |
214
ed6a3e2b1a33
added new parameter to the simplification tactics which indicates if
nipkow
parents:
209
diff
changeset
|
1741 |
fun rewrite_cterm mode mss prover ct = |
229
4002c4cd450c
Pure: MAJOR CHANGE. Moved ML types ctyp and cterm and their associated
lcp
parents:
225
diff
changeset
|
1742 |
let val {sign, t, T, maxidx} = rep_cterm ct; |
1529 | 1743 |
val (shyps,hyps,maxidxu,u,ders) = |
1744 |
bottomc (mode,prover,sign) mss |
|
1745 |
(add_term_sorts(t,[]), [], maxidx, t, []); |
|
0 | 1746 |
val prop = Logic.mk_equals(t,u) |
1258 | 1747 |
in |
1529 | 1748 |
Thm{sign = sign, |
1749 |
der = infer_derivs (Rewrite_cterm ct, ders), |
|
1750 |
maxidx = max[maxidx,maxidxu], |
|
1751 |
shyps = shyps, |
|
1752 |
hyps = hyps, |
|
1753 |
prop = prop} |
|
0 | 1754 |
end |
1755 |
||
1539 | 1756 |
|
1757 |
fun invoke_oracle (thy, sign, exn) = |
|
1758 |
case #oraopt(rep_theory thy) of |
|
1759 |
None => raise THM ("No oracle in supplied theory", 0, []) |
|
1760 |
| Some oracle => |
|
1761 |
let val sign' = Sign.merge(sign_of thy, sign) |
|
1762 |
val (prop, T, maxidx) = |
|
1763 |
Sign.certify_term sign' (oracle (sign', exn)) |
|
1764 |
in if T<>propT then |
|
1765 |
raise THM("Oracle's result must have type prop", 0, []) |
|
1766 |
else fix_shyps [] [] |
|
1767 |
(Thm {sign = sign', |
|
1597
54ece585bf62
name_thm no longer takes a theory argument, as the
paulson
parents:
1580
diff
changeset
|
1768 |
der = Join (Oracle(thy,sign,exn), []), |
1539 | 1769 |
maxidx = maxidx, |
1770 |
shyps = [], |
|
1771 |
hyps = [], |
|
1772 |
prop = prop}) |
|
1773 |
end; |
|
1774 |
||
0 | 1775 |
end; |
1503 | 1776 |
|
1777 |
open Thm; |