author | paulson |
Fri, 12 May 2000 15:02:57 +0200 | |
changeset 8861 | 8341f24e09b5 |
parent 6498 | 1ebbe18fe236 |
child 8882 | 9df44a4f1bf7 |
permissions | -rw-r--r-- |
3302 | 1 |
(* Title: TFL/usyntax |
2 |
ID: $Id$ |
|
3 |
Author: Konrad Slind, Cambridge University Computer Laboratory |
|
4 |
Copyright 1997 University of Cambridge |
|
5 |
||
6 |
Emulation of HOL's abstract syntax functions |
|
7 |
*) |
|
8 |
||
2112 | 9 |
structure USyntax : USyntax_sig = |
10 |
struct |
|
11 |
||
12 |
structure Utils = Utils; |
|
13 |
open Utils; |
|
14 |
||
15 |
infix 4 ##; |
|
16 |
||
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
17 |
fun USYN_ERR{func,mesg} = Utils.ERR{module = "USyntax", func = func, mesg = mesg}; |
2112 | 18 |
|
19 |
||
20 |
(*--------------------------------------------------------------------------- |
|
21 |
* |
|
22 |
* Types |
|
23 |
* |
|
24 |
*---------------------------------------------------------------------------*) |
|
25 |
val mk_prim_vartype = TVar; |
|
26 |
fun mk_vartype s = mk_prim_vartype((s,0),["term"]); |
|
27 |
||
28 |
(* But internally, it's useful *) |
|
29 |
fun dest_vtype (TVar x) = x |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
30 |
| dest_vtype _ = raise USYN_ERR{func = "dest_vtype", |
2112 | 31 |
mesg = "not a flexible type variable"}; |
32 |
||
33 |
val is_vartype = Utils.can dest_vtype; |
|
34 |
||
35 |
val type_vars = map mk_prim_vartype o typ_tvars |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
36 |
fun type_varsl L = distinct (Utils.rev_itlist (curry op @ o type_vars) L []); |
2112 | 37 |
|
38 |
val alpha = mk_vartype "'a" |
|
39 |
val beta = mk_vartype "'b" |
|
40 |
||
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
41 |
fun strip_prod_type (Type("*", [ty1,ty2])) = |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
42 |
strip_prod_type ty1 @ strip_prod_type ty2 |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
43 |
| strip_prod_type ty = [ty]; |
2112 | 44 |
|
45 |
||
46 |
||
47 |
(*--------------------------------------------------------------------------- |
|
48 |
* |
|
49 |
* Terms |
|
50 |
* |
|
51 |
*---------------------------------------------------------------------------*) |
|
52 |
||
53 |
(* Free variables, in order of occurrence, from left to right in the |
|
54 |
* syntax tree. *) |
|
55 |
fun free_vars_lr tm = |
|
56 |
let fun memb x = let fun m[] = false | m(y::rst) = (x=y)orelse m rst in m end |
|
57 |
fun add (t, frees) = case t of |
|
58 |
Free _ => if (memb t frees) then frees else t::frees |
|
59 |
| Abs (_,_,body) => add(body,frees) |
|
60 |
| f$t => add(t, add(f, frees)) |
|
61 |
| _ => frees |
|
62 |
in rev(add(tm,[])) |
|
63 |
end; |
|
64 |
||
65 |
||
66 |
||
67 |
val type_vars_in_term = map mk_prim_vartype o term_tvars; |
|
68 |
||
69 |
||
70 |
||
71 |
(* Prelogic *) |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
72 |
fun dest_tybinding (v,ty) = (#1(dest_vtype v),ty) |
2112 | 73 |
fun inst theta = subst_vars (map dest_tybinding theta,[]) |
74 |
||
75 |
||
76 |
(* Construction routines *) |
|
77 |
||
78 |
fun mk_abs{Bvar as Var((s,_),ty),Body} = Abs(s,ty,abstract_over(Bvar,Body)) |
|
79 |
| mk_abs{Bvar as Free(s,ty),Body} = Abs(s,ty,abstract_over(Bvar,Body)) |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
80 |
| mk_abs _ = raise USYN_ERR{func = "mk_abs", mesg = "Bvar is not a variable"}; |
2112 | 81 |
|
82 |
||
83 |
fun mk_imp{ant,conseq} = |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
84 |
let val c = Const("op -->",HOLogic.boolT --> HOLogic.boolT --> HOLogic.boolT) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
85 |
in list_comb(c,[ant,conseq]) |
2112 | 86 |
end; |
87 |
||
88 |
fun mk_select (r as {Bvar,Body}) = |
|
89 |
let val ty = type_of Bvar |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
90 |
val c = Const("Eps",(ty --> HOLogic.boolT) --> ty) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
91 |
in list_comb(c,[mk_abs r]) |
2112 | 92 |
end; |
93 |
||
94 |
fun mk_forall (r as {Bvar,Body}) = |
|
95 |
let val ty = type_of Bvar |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
96 |
val c = Const("All",(ty --> HOLogic.boolT) --> HOLogic.boolT) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
97 |
in list_comb(c,[mk_abs r]) |
2112 | 98 |
end; |
99 |
||
100 |
fun mk_exists (r as {Bvar,Body}) = |
|
101 |
let val ty = type_of Bvar |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
102 |
val c = Const("Ex",(ty --> HOLogic.boolT) --> HOLogic.boolT) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
103 |
in list_comb(c,[mk_abs r]) |
2112 | 104 |
end; |
105 |
||
106 |
||
107 |
fun mk_conj{conj1,conj2} = |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
108 |
let val c = Const("op &",HOLogic.boolT --> HOLogic.boolT --> HOLogic.boolT) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
109 |
in list_comb(c,[conj1,conj2]) |
2112 | 110 |
end; |
111 |
||
112 |
fun mk_disj{disj1,disj2} = |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
113 |
let val c = Const("op |",HOLogic.boolT --> HOLogic.boolT --> HOLogic.boolT) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
114 |
in list_comb(c,[disj1,disj2]) |
2112 | 115 |
end; |
116 |
||
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
117 |
fun prod_ty ty1 ty2 = Type("*", [ty1,ty2]); |
2112 | 118 |
|
119 |
local |
|
120 |
fun mk_uncurry(xt,yt,zt) = |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
121 |
Const("split",(xt --> yt --> zt) --> prod_ty xt yt --> zt) |
2112 | 122 |
fun dest_pair(Const("Pair",_) $ M $ N) = {fst=M, snd=N} |
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
123 |
| dest_pair _ = raise USYN_ERR{func = "dest_pair", mesg = "not a pair"} |
2112 | 124 |
fun is_var(Var(_)) = true | is_var (Free _) = true | is_var _ = false |
125 |
in |
|
126 |
fun mk_pabs{varstruct,body} = |
|
127 |
let fun mpa(varstruct,body) = |
|
128 |
if (is_var varstruct) |
|
129 |
then mk_abs{Bvar = varstruct, Body = body} |
|
130 |
else let val {fst,snd} = dest_pair varstruct |
|
3405 | 131 |
in mk_uncurry(type_of fst,type_of snd,type_of body) $ |
132 |
mpa(fst,mpa(snd,body)) |
|
2112 | 133 |
end |
134 |
in mpa(varstruct,body) |
|
135 |
end |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
136 |
handle _ => raise USYN_ERR{func = "mk_pabs", mesg = ""}; |
2112 | 137 |
end; |
138 |
||
139 |
(* Destruction routines *) |
|
140 |
||
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
141 |
datatype lambda = VAR of {Name : string, Ty : typ} |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
142 |
| CONST of {Name : string, Ty : typ} |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
143 |
| COMB of {Rator: term, Rand : term} |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
144 |
| LAMB of {Bvar : term, Body : term}; |
2112 | 145 |
|
146 |
||
147 |
fun dest_term(Var((s,i),ty)) = VAR{Name = s, Ty = ty} |
|
148 |
| dest_term(Free(s,ty)) = VAR{Name = s, Ty = ty} |
|
149 |
| dest_term(Const(s,ty)) = CONST{Name = s, Ty = ty} |
|
150 |
| dest_term(M$N) = COMB{Rator=M,Rand=N} |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
151 |
| dest_term(Abs(s,ty,M)) = let val v = Free(s,ty) |
2112 | 152 |
in LAMB{Bvar = v, Body = betapply (M,v)} |
153 |
end |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
154 |
| dest_term(Bound _) = raise USYN_ERR{func = "dest_term",mesg = "Bound"}; |
2112 | 155 |
|
156 |
fun dest_const(Const(s,ty)) = {Name = s, Ty = ty} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
157 |
| dest_const _ = raise USYN_ERR{func = "dest_const", mesg = "not a constant"}; |
2112 | 158 |
|
159 |
fun dest_comb(t1 $ t2) = {Rator = t1, Rand = t2} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
160 |
| dest_comb _ = raise USYN_ERR{func = "dest_comb", mesg = "not a comb"}; |
2112 | 161 |
|
162 |
fun dest_abs(a as Abs(s,ty,M)) = |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
163 |
let val v = Free(s,ty) |
2112 | 164 |
in {Bvar = v, Body = betapply (a,v)} |
165 |
end |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
166 |
| dest_abs _ = raise USYN_ERR{func = "dest_abs", mesg = "not an abstraction"}; |
2112 | 167 |
|
168 |
fun dest_eq(Const("op =",_) $ M $ N) = {lhs=M, rhs=N} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
169 |
| dest_eq _ = raise USYN_ERR{func = "dest_eq", mesg = "not an equality"}; |
2112 | 170 |
|
171 |
fun dest_imp(Const("op -->",_) $ M $ N) = {ant=M, conseq=N} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
172 |
| dest_imp _ = raise USYN_ERR{func = "dest_imp", mesg = "not an implication"}; |
2112 | 173 |
|
174 |
fun dest_forall(Const("All",_) $ (a as Abs _)) = dest_abs a |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
175 |
| dest_forall _ = raise USYN_ERR{func = "dest_forall", mesg = "not a forall"}; |
2112 | 176 |
|
177 |
fun dest_exists(Const("Ex",_) $ (a as Abs _)) = dest_abs a |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
178 |
| dest_exists _ = raise USYN_ERR{func = "dest_exists", mesg="not an existential"}; |
2112 | 179 |
|
180 |
fun dest_neg(Const("not",_) $ M) = M |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
181 |
| dest_neg _ = raise USYN_ERR{func = "dest_neg", mesg = "not a negation"}; |
2112 | 182 |
|
183 |
fun dest_conj(Const("op &",_) $ M $ N) = {conj1=M, conj2=N} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
184 |
| dest_conj _ = raise USYN_ERR{func = "dest_conj", mesg = "not a conjunction"}; |
2112 | 185 |
|
186 |
fun dest_disj(Const("op |",_) $ M $ N) = {disj1=M, disj2=N} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
187 |
| dest_disj _ = raise USYN_ERR{func = "dest_disj", mesg = "not a disjunction"}; |
2112 | 188 |
|
189 |
fun mk_pair{fst,snd} = |
|
190 |
let val ty1 = type_of fst |
|
191 |
val ty2 = type_of snd |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
192 |
val c = Const("Pair",ty1 --> ty2 --> prod_ty ty1 ty2) |
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
193 |
in list_comb(c,[fst,snd]) |
2112 | 194 |
end; |
195 |
||
196 |
fun dest_pair(Const("Pair",_) $ M $ N) = {fst=M, snd=N} |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
197 |
| dest_pair _ = raise USYN_ERR{func = "dest_pair", mesg = "not a pair"}; |
2112 | 198 |
|
199 |
||
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
200 |
local fun ucheck t = (if #Name(dest_const t) = "split" then t |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
201 |
else raise Match) |
2112 | 202 |
in |
203 |
fun dest_pabs tm = |
|
204 |
let val {Bvar,Body} = dest_abs tm |
|
205 |
in {varstruct = Bvar, body = Body} |
|
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
206 |
end |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
207 |
handle |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
208 |
_ => let val {Rator,Rand} = dest_comb tm |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
209 |
val _ = ucheck Rator |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
210 |
val {varstruct = lv,body} = dest_pabs Rand |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
211 |
val {varstruct = rv,body} = dest_pabs body |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
212 |
in {varstruct = mk_pair{fst = lv, snd = rv}, body = body} |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
213 |
end |
2112 | 214 |
end; |
215 |
||
216 |
||
217 |
val lhs = #lhs o dest_eq |
|
218 |
val rhs = #rhs o dest_eq |
|
219 |
val rand = #Rand o dest_comb |
|
220 |
||
221 |
||
222 |
(* Query routines *) |
|
223 |
val is_imp = can dest_imp |
|
224 |
val is_forall = can dest_forall |
|
225 |
val is_exists = can dest_exists |
|
226 |
val is_neg = can dest_neg |
|
227 |
val is_conj = can dest_conj |
|
228 |
val is_disj = can dest_disj |
|
229 |
val is_pair = can dest_pair |
|
230 |
val is_pabs = can dest_pabs |
|
231 |
||
232 |
||
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
233 |
(* Construction of a cterm from a list of Terms *) |
2112 | 234 |
|
235 |
fun list_mk_abs(L,tm) = itlist (fn v => fn M => mk_abs{Bvar=v, Body=M}) L tm; |
|
236 |
||
237 |
(* These others are almost never used *) |
|
238 |
fun list_mk_imp(A,c) = itlist(fn a => fn tm => mk_imp{ant=a,conseq=tm}) A c; |
|
239 |
fun list_mk_forall(V,t) = itlist(fn v => fn b => mk_forall{Bvar=v, Body=b})V t; |
|
240 |
val list_mk_conj = end_itlist(fn c1 => fn tm => mk_conj{conj1=c1, conj2=tm}) |
|
241 |
||
242 |
||
243 |
(* Need to reverse? *) |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
244 |
fun gen_all tm = list_mk_forall(term_frees tm, tm); |
2112 | 245 |
|
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
246 |
(* Destructing a cterm to a list of Terms *) |
2112 | 247 |
fun strip_comb tm = |
248 |
let fun dest(M$N, A) = dest(M, N::A) |
|
249 |
| dest x = x |
|
250 |
in dest(tm,[]) |
|
251 |
end; |
|
252 |
||
253 |
fun strip_abs(tm as Abs _) = |
|
254 |
let val {Bvar,Body} = dest_abs tm |
|
255 |
val (bvs, core) = strip_abs Body |
|
256 |
in (Bvar::bvs, core) |
|
257 |
end |
|
258 |
| strip_abs M = ([],M); |
|
259 |
||
260 |
||
261 |
fun strip_imp fm = |
|
262 |
if (is_imp fm) |
|
263 |
then let val {ant,conseq} = dest_imp fm |
|
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
264 |
val (was,wb) = strip_imp conseq |
2112 | 265 |
in ((ant::was), wb) |
266 |
end |
|
267 |
else ([],fm); |
|
268 |
||
269 |
fun strip_forall fm = |
|
270 |
if (is_forall fm) |
|
271 |
then let val {Bvar,Body} = dest_forall fm |
|
272 |
val (bvs,core) = strip_forall Body |
|
273 |
in ((Bvar::bvs), core) |
|
274 |
end |
|
275 |
else ([],fm); |
|
276 |
||
277 |
||
278 |
fun strip_exists fm = |
|
279 |
if (is_exists fm) |
|
280 |
then let val {Bvar, Body} = dest_exists fm |
|
281 |
val (bvs,core) = strip_exists Body |
|
282 |
in (Bvar::bvs, core) |
|
283 |
end |
|
284 |
else ([],fm); |
|
285 |
||
286 |
fun strip_disj w = |
|
287 |
if (is_disj w) |
|
288 |
then let val {disj1,disj2} = dest_disj w |
|
289 |
in (strip_disj disj1@strip_disj disj2) |
|
290 |
end |
|
291 |
else [w]; |
|
292 |
||
293 |
||
294 |
(* Miscellaneous *) |
|
295 |
||
296 |
fun mk_vstruct ty V = |
|
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
297 |
let fun follow_prod_type (Type("*",[ty1,ty2])) vs = |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
298 |
let val (ltm,vs1) = follow_prod_type ty1 vs |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
299 |
val (rtm,vs2) = follow_prod_type ty2 vs1 |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
300 |
in (mk_pair{fst=ltm, snd=rtm}, vs2) end |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
301 |
| follow_prod_type _ (v::vs) = (v,vs) |
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
302 |
in #1 (follow_prod_type ty V) end; |
2112 | 303 |
|
304 |
||
305 |
(* Search a term for a sub-term satisfying the predicate p. *) |
|
306 |
fun find_term p = |
|
307 |
let fun find tm = |
|
3405 | 308 |
if (p tm) then Some tm |
309 |
else case tm of |
|
310 |
Abs(_,_,body) => find body |
|
311 |
| (t$u) => (Some (the (find t)) handle _ => find u) |
|
312 |
| _ => None |
|
2112 | 313 |
in find |
314 |
end; |
|
315 |
||
316 |
fun dest_relation tm = |
|
3245
241838c01caf
Removal of redundant code (unused or already present in Isabelle.
paulson
parents:
2112
diff
changeset
|
317 |
if (type_of tm = HOLogic.boolT) |
2112 | 318 |
then let val (Const("op :",_) $ (Const("Pair",_)$y$x) $ R) = tm |
319 |
in (R,y,x) |
|
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
320 |
end handle _ => raise USYN_ERR{func="dest_relation", |
2112 | 321 |
mesg="unexpected term structure"} |
3353
9112a2efb9a3
Removal of module Mask and datatype binding with its constructor |->
paulson
parents:
3330
diff
changeset
|
322 |
else raise USYN_ERR{func="dest_relation",mesg="not a boolean term"}; |
2112 | 323 |
|
3405 | 324 |
fun is_WFR (Const("wf",_)$_) = true |
325 |
| is_WFR _ = false; |
|
2112 | 326 |
|
3391
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
327 |
fun ARB ty = mk_select{Bvar=Free("v",ty), |
5e45dd3b64e9
More de-HOLification: using Free, Const, etc. instead of mk_var, mk_const
paulson
parents:
3353
diff
changeset
|
328 |
Body=Const("True",HOLogic.boolT)}; |
2112 | 329 |
|
330 |
end; (* Syntax *) |