author  wenzelm 
Sat, 10 Mar 2012 19:49:32 +0100  
changeset 46857  628b4a3fbf6e 
parent 46219  426ed18eba43 
child 51700  c8f2bad67dbb 
permissions  rwrr 
12784  1 
(* Title: Pure/pattern.ML 
29269
5c25a2012975
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
wenzelm
parents:
28348
diff
changeset

2 
Author: Tobias Nipkow, Christine Heinzelmann, and Stefan Berghofer, TU Muenchen 
0  3 

4 
Unification of HigherOrder Patterns. 

5 

6 
See also: 

7 
Tobias Nipkow. Functional Unification of HigherOrder Patterns. 

8 
In Proceedings of the 8th IEEE Symposium Logic in Computer Science, 1993. 

678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

9 

6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

10 
TODO: optimize red by specialcasing it 
0  11 
*) 
12 

2751  13 
infix aeconv; 
14 

0  15 
signature PATTERN = 
14787  16 
sig 
32738  17 
val trace_unify_fail: bool Unsynchronized.ref 
17203  18 
val aeconv: term * term > bool 
19 
val eta_long: typ list > term > term 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

20 
val match: theory > term * term > Type.tyenv * Envir.tenv > Type.tyenv * Envir.tenv 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

21 
val first_order_match: theory > term * term 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

22 
> Type.tyenv * Envir.tenv > Type.tyenv * Envir.tenv 
17203  23 
val matches: theory > term * term > bool 
28348  24 
val matchess: theory > term list * term list > bool 
19880  25 
val equiv: theory > term * term > bool 
17203  26 
val matches_subterm: theory > term * term > bool 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

27 
val unify: theory > term * term > Envir.env > Envir.env 
17203  28 
val first_order: term > bool 
29 
val pattern: term > bool 

30565
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

30 
val match_rew: theory > term > term * term > (term * term) option 
17203  31 
val rewrite_term: theory > (term * term) list > (term > term option) list > term > term 
35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

32 
val rewrite_term_top: theory > (term * term) list > (term > term option) list > term > term 
0  33 
exception Unif 
34 
exception MATCH 

35 
exception Pattern 

14787  36 
end; 
0  37 

17203  38 
structure Pattern: PATTERN = 
0  39 
struct 
40 

41 
exception Unif; 

42 
exception Pattern; 

43 

32738  44 
val trace_unify_fail = Unsynchronized.ref false; 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

45 

26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26831
diff
changeset

46 
fun string_of_term thy env binders t = 
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26831
diff
changeset

47 
Syntax.string_of_term_global thy 
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26831
diff
changeset

48 
(Envir.norm_term env (subst_bounds (map Free binders, t))); 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

49 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17756
diff
changeset

50 
fun bname binders i = fst (nth binders i); 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

51 
fun bnames binders is = space_implode " " (map (bname binders) is); 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

52 

17203  53 
fun typ_clash thy (tye,T,U) = 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

54 
if !trace_unify_fail 
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26831
diff
changeset

55 
then let val t = Syntax.string_of_typ_global thy (Envir.norm_type tye T) 
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26831
diff
changeset

56 
and u = Syntax.string_of_typ_global thy (Envir.norm_type tye U) 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

57 
in tracing("The following types do not unify:\n" ^ t ^ "\n" ^ u) end 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

58 
else () 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

59 

a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

60 
fun clash a b = 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

61 
if !trace_unify_fail then tracing("Clash: " ^ a ^ " =/= " ^ b) else () 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

62 

a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

63 
fun boundVar binders i = 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

64 
"bound variable " ^ bname binders i ^ " (depth " ^ string_of_int i ^ ")"; 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

65 

a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

66 
fun clashBB binders i j = 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

67 
if !trace_unify_fail then clash (boundVar binders i) (boundVar binders j) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

68 
else () 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

69 

a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

70 
fun clashB binders i s = 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

71 
if !trace_unify_fail then clash (boundVar binders i) s 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

72 
else () 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

73 

17203  74 
fun proj_fail thy (env,binders,F,_,is,t) = 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

75 
if !trace_unify_fail 
22678  76 
then let val f = Term.string_of_vname F 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

77 
val xs = bnames binders is 
17203  78 
val u = string_of_term thy env binders t 
19300  79 
val ys = bnames binders (subtract (op =) is (loose_bnos t)) 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

80 
in tracing("Cannot unify variable " ^ f ^ 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

81 
" (depending on bound variables " ^ xs ^ ")\nwith term " ^ u ^ 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

82 
"\nTerm contains additional bound variable(s) " ^ ys) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

83 
end 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

84 
else () 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

85 

17203  86 
fun ocheck_fail thy (F,t,binders,env) = 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

87 
if !trace_unify_fail 
22678  88 
then let val f = Term.string_of_vname F 
17203  89 
val u = string_of_term thy env binders t 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

90 
in tracing("Variable " ^ f ^ " occurs in term\n" ^ u ^ 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

91 
"\nCannot unify!\n") 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

92 
end 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

93 
else () 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

94 

12784  95 
fun occurs(F,t,env) = 
15797  96 
let fun occ(Var (G, T)) = (case Envir.lookup (env, (G, T)) of 
15531  97 
SOME(t) => occ t 
98 
 NONE => F=G) 

0  99 
 occ(t1$t2) = occ t1 orelse occ t2 
100 
 occ(Abs(_,_,t)) = occ t 

101 
 occ _ = false 

102 
in occ t end; 

103 

104 

105 
fun mapbnd f = 

106 
let fun mpb d (Bound(i)) = if i < d then Bound(i) else Bound(f(id)+d) 

107 
 mpb d (Abs(s,T,t)) = Abs(s,T,mpb(d+1) t) 

678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

108 
 mpb d ((u1 $ u2)) = (mpb d u1)$(mpb d u2) 
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

109 
 mpb _ atom = atom 
0  110 
in mpb 0 end; 
111 

14861
ca5cae7fb65a
Removed ~10000 hack in function idx that can lead to inconsistencies
berghofe
parents:
14787
diff
changeset

112 
fun idx [] j = raise Unif 
16668  113 
 idx(i::is) j = if (i:int) =j then length is else idx is j; 
0  114 

115 
fun mkabs (binders,is,t) = 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17756
diff
changeset

116 
let fun mk(i::is) = let val (x,T) = nth binders i 
12784  117 
in Abs(x,T,mk is) end 
0  118 
 mk [] = t 
119 
in mk is end; 

120 

121 
val incr = mapbnd (fn i => i+1); 

122 

123 
fun ints_of [] = [] 

12784  124 
 ints_of (Bound i ::bs) = 
0  125 
let val is = ints_of bs 
20672  126 
in if member (op =) is i then raise Pattern else i::is end 
0  127 
 ints_of _ = raise Pattern; 
128 

12232  129 
fun ints_of' env ts = ints_of (map (Envir.head_norm env) ts); 
130 

0  131 

132 
fun app (s,(i::is)) = app (s$Bound(i),is) 

133 
 app (s,[]) = s; 

134 

135 
fun red (Abs(_,_,s)) (i::is) js = red s is (i::js) 

678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

136 
 red t [] [] = t 
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17756
diff
changeset

137 
 red t is jn = app (mapbnd (nth jn) t,is); 
678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

138 

0  139 

140 
(* split_type ([T1,....,Tn]> T,n,[]) = ([Tn,...,T1],T) *) 

141 
fun split_type (T,0,Ts) = (Ts,T) 

142 
 split_type (Type ("fun",[T1,T2]),n,Ts) = split_type (T2,n1,T1::Ts) 

678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

143 
 split_type _ = error("split_type"); 
0  144 

32032  145 
fun type_of_G env (T, n, is) = 
146 
let 

147 
val tyenv = Envir.type_env env; 

148 
val (Ts, U) = split_type (Envir.norm_type tyenv T, n, []); 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17756
diff
changeset

149 
in map (nth Ts) is > U end; 
0  150 

151 
fun mkhnf (binders,is,G,js) = mkabs (binders, is, app(G,js)); 

152 

153 
fun mknewhnf(env,binders,is,F as (a,_),T,js) = 

13891
ae9a2a433388
type_of_G now applies type substitution before decomposing type.
berghofe
parents:
13645
diff
changeset

154 
let val (env',G) = Envir.genvar a (env,type_of_G env (T,length is,js)) 
15797  155 
in Envir.update (((F, T), mkhnf (binders, is, G, js)), env') end; 
0  156 

157 

23222  158 
(*predicate: downto0 (is, n) <=> is = [n, n  1, ..., 0]*) 
159 
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n  1) 

160 
 downto0 ([], n) = n = ~1; 

161 

162 
(*mk_proj_list(is) = [ is  k  1 <= k <= is and is[k] >= 0 ]*) 

0  163 
fun mk_proj_list is = 
19502  164 
let fun mk(i::is,j) = if is_some i then j :: mk(is,j1) else mk(is,j1) 
0  165 
 mk([],_) = [] 
166 
in mk(is,length is  1) end; 

167 

168 
fun proj(s,env,binders,is) = 

169 
let fun trans d i = if i<d then i else (idx is (id))+d; 

12232  170 
fun pr(s,env,d,binders) = (case Envir.head_norm env s of 
0  171 
Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders)) 
172 
in (Abs(a,T,t'),env') end 

173 
 t => (case strip_comb t of 

174 
(c as Const _,ts) => 

175 
let val (ts',env') = prs(ts,env,d,binders) 

176 
in (list_comb(c,ts'),env') end 

177 
 (f as Free _,ts) => 

178 
let val (ts',env') = prs(ts,env,d,binders) 

179 
in (list_comb(f,ts'),env') end 

180 
 (Bound(i),ts) => 

181 
let val j = trans d i 

14861
ca5cae7fb65a
Removed ~10000 hack in function idx that can lead to inconsistencies
berghofe
parents:
14787
diff
changeset

182 
val (ts',env') = prs(ts,env,d,binders) 
ca5cae7fb65a
Removed ~10000 hack in function idx that can lead to inconsistencies
berghofe
parents:
14787
diff
changeset

183 
in (list_comb(Bound j,ts'),env') end 
0  184 
 (Var(F as (a,_),Fty),ts) => 
12232  185 
let val js = ints_of' env ts; 
14861
ca5cae7fb65a
Removed ~10000 hack in function idx that can lead to inconsistencies
berghofe
parents:
14787
diff
changeset

186 
val js' = map (try (trans d)) js; 
0  187 
val ks = mk_proj_list js'; 
19482
9f11af8f7ef9
tuned basic list operators (flat, maps, map_filter);
wenzelm
parents:
19300
diff
changeset

188 
val ls = map_filter I js' 
13891
ae9a2a433388
type_of_G now applies type substitution before decomposing type.
berghofe
parents:
13645
diff
changeset

189 
val Hty = type_of_G env (Fty,length js,ks) 
0  190 
val (env',H) = Envir.genvar a (env,Hty) 
191 
val env'' = 

15797  192 
Envir.update (((F, Fty), mkhnf (binders, js, H, ks)), env') 
0  193 
in (app(H,ls),env'') end 
194 
 _ => raise Pattern)) 

195 
and prs(s::ss,env,d,binders) = 

196 
let val (s',env1) = pr(s,env,d,binders) 

197 
val (ss',env2) = prs(ss,env1,d,binders) 

198 
in (s'::ss',env2) end 

199 
 prs([],env,_,_) = ([],env) 

200 
in if downto0(is,length binders  1) then (s,env) 

201 
else pr(s,env,0,binders) 

202 
end; 

203 

204 

205 
(* mk_ff_list(is,js) = [ length(is)  k  1 <= k <= is and is[k] = js[k] ] *) 

12784  206 
fun mk_ff_list(is,js) = 
207 
let fun mk([],[],_) = [] 

16668  208 
 mk(i::is,j::js, k) = if (i:int) = j then k :: mk(is,js,k1) 
0  209 
else mk(is,js,k1) 
678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

210 
 mk _ = error"mk_ff_list" 
0  211 
in mk(is,js,length is1) end; 
212 

213 
fun flexflex1(env,binders,F,Fty,is,js) = 

214 
if is=js then env 

215 
else let val ks = mk_ff_list(is,js) 

216 
in mknewhnf(env,binders,is,F,Fty,ks) end; 

217 

218 
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) = 

219 
let fun ff(F,Fty,is,G as (a,_),Gty,js) = 

33038  220 
if subset (op =) (js, is) 
0  221 
then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js)) 
15797  222 
in Envir.update (((F, Fty), t), env) end 
33049
c38f02fdf35d
curried inter as canonical list operation (beware of argument order)
haftmann
parents:
33038
diff
changeset

223 
else let val ks = inter (op =) js is 
13891
ae9a2a433388
type_of_G now applies type substitution before decomposing type.
berghofe
parents:
13645
diff
changeset

224 
val Hty = type_of_G env (Fty,length is,map (idx is) ks) 
0  225 
val (env',H) = Envir.genvar a (env,Hty) 
226 
fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks)); 

15797  227 
in Envir.update (((G, Gty), lam js), Envir.update (((F, Fty), lam is), env')) 
0  228 
end; 
35408  229 
in if Term_Ord.indexname_ord (G,F) = LESS then ff(F,Fty,is,G,Gty,js) else ff(G,Gty,js,F,Fty,is) end 
0  230 

32032  231 
fun unify_types thy (T, U) (env as Envir.Envir {maxidx, tenv, tyenv}) = 
232 
if T = U then env 

233 
else 

234 
let val (tyenv', maxidx') = Sign.typ_unify thy (U, T) (tyenv, maxidx) 

235 
in Envir.Envir {maxidx = maxidx', tenv = tenv, tyenv = tyenv'} end 

236 
handle Type.TUNIFY => (typ_clash thy (tyenv, T, U); raise Unif); 

0  237 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

238 
fun unif thy binders (s,t) env = case (Envir.head_norm env s, Envir.head_norm env t) of 
0  239 
(Abs(ns,Ts,ts),Abs(nt,Tt,tt)) => 
240 
let val name = if ns = "" then nt else ns 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

241 
in unif thy ((name,Ts)::binders) (ts,tt) env end 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

242 
 (Abs(ns,Ts,ts),t) => unif thy ((ns,Ts)::binders) (ts,(incr t)$Bound(0)) env 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

243 
 (t,Abs(nt,Tt,tt)) => unif thy ((nt,Tt)::binders) ((incr t)$Bound(0),tt) env 
17203  244 
 p => cases thy (binders,env,p) 
0  245 

17203  246 
and cases thy (binders,env,(s,t)) = case (strip_comb s,strip_comb t) of 
12784  247 
((Var(F,Fty),ss),(Var(G,Gty),ts)) => 
12232  248 
if F = G then flexflex1(env,binders,F,Fty,ints_of' env ss,ints_of' env ts) 
249 
else flexflex2(env,binders,F,Fty,ints_of' env ss,G,Gty,ints_of' env ts) 

17203  250 
 ((Var(F,Fty),ss),_) => flexrigid thy (env,binders,F,Fty,ints_of' env ss,t) 
251 
 (_,(Var(F,Fty),ts)) => flexrigid thy (env,binders,F,Fty,ints_of' env ts,s) 

252 
 ((Const c,ss),(Const d,ts)) => rigidrigid thy (env,binders,c,d,ss,ts) 

253 
 ((Free(f),ss),(Free(g),ts)) => rigidrigid thy (env,binders,f,g,ss,ts) 

254 
 ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB thy (env,binders,i,j,ss,ts) 

0  255 
 ((Abs(_),_),_) => raise Pattern 
256 
 (_,(Abs(_),_)) => raise Pattern 

13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

257 
 ((Const(c,_),_),(Free(f,_),_)) => (clash c f; raise Unif) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

258 
 ((Const(c,_),_),(Bound i,_)) => (clashB binders i c; raise Unif) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

259 
 ((Free(f,_),_),(Const(c,_),_)) => (clash f c; raise Unif) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

260 
 ((Free(f,_),_),(Bound i,_)) => (clashB binders i f; raise Unif) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

261 
 ((Bound i,_),(Const(c,_),_)) => (clashB binders i c; raise Unif) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

262 
 ((Bound i,_),(Free(f,_),_)) => (clashB binders i f; raise Unif) 
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

263 

0  264 

17203  265 
and rigidrigid thy (env,binders,(a,Ta),(b,Tb),ss,ts) = 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

266 
if a<>b then (clash a b; raise Unif) 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

267 
else env > unify_types thy (Ta,Tb) > fold (unif thy binders) (ss~~ts) 
0  268 

17203  269 
and rigidrigidB thy (env,binders,i,j,ss,ts) = 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

270 
if i <> j then (clashBB binders i j; raise Unif) 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

271 
else fold (unif thy binders) (ss~~ts) env 
0  272 

17203  273 
and flexrigid thy (params as (env,binders,F,Fty,is,t)) = 
274 
if occurs(F,t,env) then (ocheck_fail thy (F,t,binders,env); raise Unif) 

13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

275 
else (let val (u,env') = proj(t,env,binders,is) 
15797  276 
in Envir.update (((F, Fty), mkabs (binders, is, u)), env') end 
17203  277 
handle Unif => (proj_fail thy params; raise Unif)); 
0  278 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

279 
fun unify thy = unif thy []; 
0  280 

281 

13998  282 
(* put a term into eta long beta normal form *) 
283 
fun eta_long Ts (Abs (s, T, t)) = Abs (s, T, eta_long (T :: Ts) t) 

46219
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

284 
 eta_long Ts t = 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

285 
(case strip_comb t of 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

286 
(Abs _, _) => eta_long Ts (Envir.beta_norm t) 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

287 
 (u, ts) => 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

288 
let 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

289 
val Us = binder_types (fastype_of1 (Ts, t)); 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

290 
val i = length Us; 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

291 
in 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

292 
fold_rev (Term.abs o pair "x") Us 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

293 
(list_comb (incr_boundvars i u, map (eta_long (rev Us @ Ts)) 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

294 
(map (incr_boundvars i) ts @ map Bound (i  1 downto 0)))) 
426ed18eba43
discontinued oldstyle Term.list_abs in favour of plain Term.abs;
wenzelm
parents:
42083
diff
changeset

295 
end); 
13998  296 

2725
9453616d4b80
Declares eta_contract_atom; fixed comment; some tidying
paulson
parents:
2616
diff
changeset

297 

678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

298 
(*Tests whether 2 terms are alpha/etaconvertible and have same type. 
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

299 
Note that Consts and Vars may have more than one type.*) 
30555
5925cd6671d5
tuned aeconv: test plain aconv before expensive eta_contract;
wenzelm
parents:
29269
diff
changeset

300 
fun t aeconv u = t aconv u orelse 
5925cd6671d5
tuned aeconv: test plain aconv before expensive eta_contract;
wenzelm
parents:
29269
diff
changeset

301 
Envir.eta_contract t aconv Envir.eta_contract u; 
678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

302 

6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

303 

4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

304 
(*** Matching ***) 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

305 

8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

306 
exception MATCH; 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

307 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

308 
fun typ_match thy TU tyenv = Sign.typ_match thy TU tyenv 
16939  309 
handle Type.TYPE_MATCH => raise MATCH; 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

310 

8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

311 
(*Firstorder matching; 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

312 
The pattern and object may have variables in common. 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

313 
Instantiation does not affect the object, so matching ?a with ?a+1 works. 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

314 
Object is etacontracted on the fly (by etaexpanding the pattern). 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

315 
Precondition: the pattern is already etacontracted! 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

316 
Types are matched on the fly*) 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

317 
fun first_order_match thy = 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

318 
let 
25473
812db0f215b3
first_order_match now only calls loose_bvar when inside an abstraction.
berghofe
parents:
23222
diff
changeset

319 
fun mtch k (instsp as (tyinsts,insts)) = fn 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

320 
(Var(ixn,T), t) => 
42083
e1209fc7ecdc
added Term.is_open and Term.is_dependent convenience, to cover common situations of loose bounds;
wenzelm
parents:
41067
diff
changeset

321 
if k > 0 andalso Term.is_open t then raise MATCH 
16651  322 
else (case Envir.lookup' (insts, (ixn, T)) of 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

323 
NONE => (typ_match thy (T, fastype_of t) tyinsts, 
17412  324 
Vartab.update_new (ixn, (T, t)) insts) 
15531  325 
 SOME u => if t aeconv u then instsp else raise MATCH) 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

326 
 (Free (a,T), Free (b,U)) => 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

327 
if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

328 
 (Const (a,T), Const (b,U)) => 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

329 
if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

330 
 (Bound i, Bound j) => if i=j then instsp else raise MATCH 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

331 
 (Abs(_,T,t), Abs(_,U,u)) => 
25473
812db0f215b3
first_order_match now only calls loose_bvar when inside an abstraction.
berghofe
parents:
23222
diff
changeset

332 
mtch (k + 1) (typ_match thy (T,U) tyinsts, insts) (t,u) 
812db0f215b3
first_order_match now only calls loose_bvar when inside an abstraction.
berghofe
parents:
23222
diff
changeset

333 
 (f$t, g$u) => mtch k (mtch k instsp (f,g)) (t, u) 
812db0f215b3
first_order_match now only calls loose_bvar when inside an abstraction.
berghofe
parents:
23222
diff
changeset

334 
 (t, Abs(_,U,u)) => mtch (k + 1) instsp ((incr t)$(Bound 0), u) 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

335 
 _ => raise MATCH 
25473
812db0f215b3
first_order_match now only calls loose_bvar when inside an abstraction.
berghofe
parents:
23222
diff
changeset

336 
in fn tu => fn env => mtch 0 env tu end; 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

337 

8406
a217b0cd304d
Type.unify and Type.typ_match now use Vartab instead of association lists.
berghofe
parents:
6539
diff
changeset

338 

4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

339 
(* Matching of higherorder patterns *) 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

340 

15797  341 
fun match_bind(itms,binders,ixn,T,is,t) = 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

342 
let val js = loose_bnos t 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

343 
in if null is 
17412  344 
then if null js then Vartab.update_new (ixn, (T, t)) itms else raise MATCH 
33038  345 
else if subset (op =) (js, is) 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

346 
then let val t' = if downto0(is,length binders  1) then t 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

347 
else mapbnd (idx is) t 
17412  348 
in Vartab.update_new (ixn, (T, mkabs (binders, is, t'))) itms end 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

349 
else raise MATCH 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

350 
end; 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

351 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

352 
fun match thy (po as (pat,obj)) envir = 
678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

353 
let 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

354 
(* Pre: pat and obj have same type *) 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

355 
fun mtch binders (pat,obj) (env as (iTs,itms)) = 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

356 
case pat of 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

357 
Abs(ns,Ts,ts) => 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

358 
(case obj of 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

359 
Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (ts,tt) env 
32035  360 
 _ => let val Tt = Envir.subst_type iTs Ts 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

361 
in mtch((ns,Tt)::binders) (ts,(incr obj)$Bound(0)) env end) 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

362 
 _ => (case obj of 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

363 
Abs(nt,Tt,tt) => 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

364 
mtch((nt,Tt)::binders) ((incr pat)$Bound(0),tt) env 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

365 
 _ => cases(binders,env,pat,obj)) 
678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

366 

4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

367 
and cases(binders,env as (iTs,itms),pat,obj) = 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

368 
let val (ph,pargs) = strip_comb pat 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

369 
fun rigrig1(iTs,oargs) = fold (mtch binders) (pargs~~oargs) (iTs,itms) 
41067  370 
handle ListPair.UnequalLengths => raise MATCH 
16668  371 
fun rigrig2((a:string,Ta),(b,Tb),oargs) = 
372 
if a <> b then raise MATCH 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

373 
else rigrig1(typ_match thy (Ta,Tb) iTs, oargs) 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

374 
in case ph of 
15797  375 
Var(ixn,T) => 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

376 
let val is = ints_of pargs 
16651  377 
in case Envir.lookup' (itms, (ixn, T)) of 
15797  378 
NONE => (iTs,match_bind(itms,binders,ixn,T,is,obj)) 
15531  379 
 SOME u => if obj aeconv (red u is []) then env 
4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

380 
else raise MATCH 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

381 
end 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

382 
 _ => 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

383 
let val (oh,oargs) = strip_comb obj 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

384 
in case (ph,oh) of 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

385 
(Const c,Const d) => rigrig2(c,d,oargs) 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

386 
 (Free f,Free g) => rigrig2(f,g,oargs) 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

387 
 (Bound i,Bound j) => if i<>j then raise MATCH 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

388 
else rigrig1(iTs,oargs) 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

389 
 (Abs _, _) => raise Pattern 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

390 
 (_, Abs _) => raise Pattern 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

391 
 _ => raise MATCH 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

392 
end 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

393 
end; 
678
6151b7f3b606
Modified pattern.ML to perform proper matching of HigherOrder Patterns.
nipkow
parents:
63
diff
changeset

394 

4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

395 
val pT = fastype_of pat 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

396 
and oT = fastype_of obj 
18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

397 
val envir' = apfst (typ_match thy (pT, oT)) envir; 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

398 
in mtch [] po envir' handle Pattern => first_order_match thy po envir' end; 
0  399 

18182
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

400 
fun matches thy po = (match thy po (Vartab.empty, Vartab.empty); true) handle MATCH => false; 
786d83044780
tuned interfaces to support incremental match/unify (cf. versions in type.ML);
wenzelm
parents:
18011
diff
changeset

401 

46857  402 
fun matchess thy (ps, os) = 
403 
length ps = length os andalso 

404 
((fold (match thy) (ps ~~ os) (Vartab.empty, Vartab.empty); true) handle MATCH => false); 

28348  405 

19880  406 
fun equiv thy (t, u) = matches thy (t, u) andalso matches thy (u, t); 
407 

0  408 

4667
6328d427a339
Tried to reorganize rewriter a little. More to be done.
nipkow
parents:
2792
diff
changeset

409 
(* Does pat match a subterm of obj? *) 
22255  410 
fun matches_subterm thy (pat, obj) = 
411 
let 

412 
fun msub bounds obj = matches thy (pat, obj) orelse 

413 
(case obj of 

414 
Abs (x, T, t) => msub (bounds + 1) (snd (Term.dest_abs (Name.bound bounds, T, t))) 

415 
 t $ u => msub bounds t orelse msub bounds u 

416 
 _ => false) 

417 
in msub 0 obj end; 

4667
6328d427a339
Tried to reorganize rewriter a little. More to be done.
nipkow
parents:
2792
diff
changeset

418 

4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

419 
fun first_order(Abs(_,_,t)) = first_order t 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

420 
 first_order(t $ u) = first_order t andalso first_order u andalso 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

421 
not(is_Var t) 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

422 
 first_order _ = true; 
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

423 

20672  424 
fun pattern (Abs (_, _, t)) = pattern t 
425 
 pattern t = 

426 
let val (head, args) = strip_comb t in 

427 
if is_Var head then 

428 
forall is_Bound args andalso not (has_duplicates (op aconv) args) 

429 
else forall pattern args 

430 
end; 

4820
8f6dbbd8d497
Tried to speed up the rewriter by etacontracting all patterns beforehand and
nipkow
parents:
4667
diff
changeset

431 

12784  432 

433 
(* rewriting  simple but fast *) 

434 

30565
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

435 
fun match_rew thy tm (tm1, tm2) = 
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

436 
let val rtm = the_default tm2 (Term.rename_abs tm1 tm tm2) in 
32035  437 
SOME (Envir.subst_term (match thy (tm1, tm) (Vartab.empty, Vartab.empty)) rtm, rtm) 
30565
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

438 
handle MATCH => NONE 
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

439 
end; 
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

440 

35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

441 
fun gen_rewrite_term bot thy rules procs tm = 
12784  442 
let 
13195  443 
val skel0 = Bound 0; 
444 

16939  445 
fun variant_absfree bounds (x, T, t) = 
12797  446 
let 
20079
ec5c8584487c
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
19880
diff
changeset

447 
val (x', t') = Term.dest_abs (Name.bound bounds, T, t); 
16939  448 
fun abs u = Abs (x, T, abstract_over (Free (x', T), u)); 
449 
in (abs, t') end; 

12797  450 

15531  451 
fun rew (Abs (_, _, body) $ t) = SOME (subst_bound (t, body), skel0) 
30565
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

452 
 rew tm = 
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

453 
(case get_first (match_rew thy tm) rules of 
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

454 
NONE => Option.map (rpair skel0) (get_first (fn p => p tm) procs) 
784be11cb70e
export match_rew  useful for implementing "procs" for rewrite_term;
wenzelm
parents:
30555
diff
changeset

455 
 x => x); 
13195  456 

35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

457 
fun rew_sub r bounds skel (tm1 $ tm2) = (case tm1 of 
12784  458 
Abs (_, _, body) => 
459 
let val tm' = subst_bound (tm2, body) 

35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

460 
in SOME (the_default tm' (rew_sub r bounds skel0 tm')) end 
14787  461 
 _ => 
13195  462 
let val (skel1, skel2) = (case skel of 
463 
skel1 $ skel2 => (skel1, skel2) 

464 
 _ => (skel0, skel0)) 

35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

465 
in case r bounds skel1 tm1 of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

466 
SOME tm1' => (case r bounds skel2 tm2 of 
15531  467 
SOME tm2' => SOME (tm1' $ tm2') 
468 
 NONE => SOME (tm1' $ tm2)) 

35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

469 
 NONE => (case r bounds skel2 tm2 of 
15531  470 
SOME tm2' => SOME (tm1 $ tm2') 
471 
 NONE => NONE) 

13195  472 
end) 
35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

473 
 rew_sub r bounds skel (Abs body) = 
13195  474 
let 
16939  475 
val (abs, tm') = variant_absfree bounds body; 
13195  476 
val skel' = (case skel of Abs (_, _, skel') => skel'  _ => skel0) 
35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

477 
in case r (bounds + 1) skel' tm' of 
15531  478 
SOME tm'' => SOME (abs tm'') 
479 
 NONE => NONE 

12797  480 
end 
35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

481 
 rew_sub _ _ _ _ = NONE; 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

482 

6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

483 
fun rew_bot bounds (Var _) _ = NONE 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

484 
 rew_bot bounds skel tm = (case rew_sub rew_bot bounds skel tm of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

485 
SOME tm1 => (case rew tm1 of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

486 
SOME (tm2, skel') => SOME (the_default tm2 (rew_bot bounds skel' tm2)) 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

487 
 NONE => SOME tm1) 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

488 
 NONE => (case rew tm of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

489 
SOME (tm1, skel') => SOME (the_default tm1 (rew_bot bounds skel' tm1)) 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

490 
 NONE => NONE)); 
12784  491 

35210
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

492 
fun rew_top bounds _ tm = (case rew tm of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

493 
SOME (tm1, _) => (case rew_sub rew_top bounds skel0 tm1 of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

494 
SOME tm2 => SOME (the_default tm2 (rew_top bounds skel0 tm2)) 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

495 
 NONE => SOME tm1) 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

496 
 NONE => (case rew_sub rew_top bounds skel0 tm of 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

497 
SOME tm1 => SOME (the_default tm1 (rew_top bounds skel0 tm1)) 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

498 
 NONE => NONE)); 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

499 

6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

500 
in the_default tm ((if bot then rew_bot else rew_top) 0 skel0 tm) end; 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

501 

6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

502 
val rewrite_term = gen_rewrite_term true; 
6e45e4c94751
Added function rewrite_term_top for topdown rewriting.
berghofe
parents:
33049
diff
changeset

503 
val rewrite_term_top = gen_rewrite_term false; 
12784  504 

0  505 
end; 
13642
a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

506 

a3d97348ceb6
added failure trace information to pattern unification
nipkow
parents:
13195
diff
changeset

507 
val trace_unify_fail = Pattern.trace_unify_fail; 