src/Pure/pattern.ML
author berghofe
Wed Oct 31 19:37:04 2001 +0100 (2001-10-31)
changeset 11998 b14e7686ce84
parent 8406 a217b0cd304d
child 12232 ff75ed08b3fb
permissions -rw-r--r--
- enter_thmx -> enter_thms
- improved naming of theorems: enter_thms now takes functions pre_name and post_name
as arguments
clasohm@1460
     1
(*  Title: 	pattern
clasohm@0
     2
    ID:         $Id$
clasohm@1460
     3
    Author: 	Tobias Nipkow and Christine Heinzelmann, TU Muenchen
clasohm@0
     4
    Copyright   1993  TU Muenchen
clasohm@0
     5
clasohm@0
     6
Unification of Higher-Order Patterns.
clasohm@0
     7
clasohm@0
     8
See also:
clasohm@0
     9
Tobias Nipkow. Functional Unification of Higher-Order Patterns.
clasohm@0
    10
In Proceedings of the 8th IEEE Symposium Logic in Computer Science, 1993.
nipkow@678
    11
nipkow@678
    12
TODO: optimize red by special-casing it
clasohm@0
    13
*)
clasohm@0
    14
paulson@2751
    15
infix aeconv;
paulson@2751
    16
clasohm@0
    17
signature PATTERN =
paulson@1501
    18
  sig
clasohm@0
    19
  type type_sig
clasohm@0
    20
  type sg
clasohm@0
    21
  type env
paulson@2751
    22
  val aeconv            : term * term -> bool
paulson@2725
    23
  val eta_contract      : term -> term
paulson@2725
    24
  val eta_contract_atom : term -> term
paulson@2725
    25
  val match             : type_sig -> term * term
paulson@2725
    26
                          -> (indexname*typ)list * (indexname*term)list
nipkow@4820
    27
  val first_order_match : type_sig -> term * term
nipkow@4820
    28
                          -> (indexname*typ)list * (indexname*term)list
paulson@2725
    29
  val matches           : type_sig -> term * term -> bool
nipkow@4667
    30
  val matches_subterm   : type_sig -> term * term -> bool
paulson@2725
    31
  val unify             : sg * env * (term * term)list -> env
nipkow@4820
    32
  val first_order       : term -> bool
nipkow@4820
    33
  val pattern           : term -> bool
clasohm@0
    34
  exception Unif
clasohm@0
    35
  exception MATCH
clasohm@0
    36
  exception Pattern
paulson@1501
    37
  end;
clasohm@0
    38
paulson@1501
    39
structure Pattern : PATTERN =
clasohm@0
    40
struct
clasohm@0
    41
clasohm@0
    42
type type_sig = Type.type_sig
clasohm@0
    43
type sg = Sign.sg
clasohm@0
    44
type env = Envir.env
clasohm@0
    45
clasohm@0
    46
exception Unif;
clasohm@0
    47
exception Pattern;
clasohm@0
    48
clasohm@0
    49
fun occurs(F,t,env) = 
clasohm@0
    50
    let fun occ(Var(G,_))   = (case Envir.lookup(env,G) of
clasohm@0
    51
                                 Some(t) => occ t
clasohm@0
    52
                               | None    => F=G)
clasohm@0
    53
          | occ(t1$t2)      = occ t1 orelse occ t2
clasohm@0
    54
          | occ(Abs(_,_,t)) = occ t
clasohm@0
    55
          | occ _           = false
clasohm@0
    56
    in occ t end;
clasohm@0
    57
clasohm@0
    58
clasohm@0
    59
fun mapbnd f =
clasohm@0
    60
    let fun mpb d (Bound(i))     = if i < d then Bound(i) else Bound(f(i-d)+d)
clasohm@0
    61
          | mpb d (Abs(s,T,t))   = Abs(s,T,mpb(d+1) t)
nipkow@678
    62
          | mpb d ((u1 $ u2))    = (mpb d u1)$(mpb d u2)
nipkow@678
    63
          | mpb _ atom           = atom
clasohm@0
    64
    in mpb 0 end;
clasohm@0
    65
clasohm@0
    66
fun idx [] j     = ~10000
clasohm@0
    67
  | idx(i::is) j = if i=j then length is else idx is j;
clasohm@0
    68
clasohm@0
    69
fun at xs i = nth_elem (i,xs);
clasohm@0
    70
clasohm@0
    71
fun mkabs (binders,is,t)  =
clasohm@0
    72
    let fun mk(i::is) = let val (x,T) = nth_elem(i,binders)
clasohm@0
    73
                        in Abs(x,T,mk is) end 
clasohm@0
    74
          | mk []     = t
clasohm@0
    75
    in mk is end;
clasohm@0
    76
clasohm@0
    77
val incr = mapbnd (fn i => i+1);
clasohm@0
    78
clasohm@0
    79
fun ints_of []             = []
clasohm@0
    80
  | ints_of (Bound i ::bs) = 
clasohm@0
    81
      let val is = ints_of bs
berghofe@1576
    82
      in if i mem_int is then raise Pattern else i::is end
clasohm@0
    83
  | ints_of _              = raise Pattern;
clasohm@0
    84
clasohm@0
    85
clasohm@0
    86
fun app (s,(i::is)) = app (s$Bound(i),is)
clasohm@0
    87
  | app (s,[])      = s;
clasohm@0
    88
clasohm@0
    89
fun red (Abs(_,_,s)) (i::is) js = red s is (i::js)
nipkow@678
    90
  | red t            []      [] = t
nipkow@678
    91
  | red t            is      jn = app (mapbnd (at jn) t,is);
nipkow@678
    92
clasohm@0
    93
clasohm@0
    94
(* split_type ([T1,....,Tn]---> T,n,[]) = ([Tn,...,T1],T) *)
clasohm@0
    95
fun split_type (T,0,Ts)                    = (Ts,T)
clasohm@0
    96
  | split_type (Type ("fun",[T1,T2]),n,Ts) = split_type (T2,n-1,T1::Ts)
nipkow@678
    97
  | split_type _                           = error("split_type");
clasohm@0
    98
clasohm@0
    99
fun type_of_G (T,n,is) =
clasohm@0
   100
  let val (Ts,U) = split_type(T,n,[]) in map(at Ts)is ---> U end;
clasohm@0
   101
clasohm@0
   102
fun mkhnf (binders,is,G,js) = mkabs (binders, is, app(G,js));
clasohm@0
   103
clasohm@0
   104
fun mknewhnf(env,binders,is,F as (a,_),T,js) =
clasohm@0
   105
  let val (env',G) = Envir.genvar a (env,type_of_G(T,length is,js))
clasohm@0
   106
  in Envir.update((F,mkhnf(binders,is,G,js)),env') end;
clasohm@0
   107
clasohm@0
   108
clasohm@0
   109
fun devar env t = case strip_comb t of
clasohm@0
   110
        (Var(F,_),ys) =>
clasohm@0
   111
            (case Envir.lookup(env,F) of
clasohm@0
   112
               Some(t) => devar env (red t (ints_of  ys) []) 
clasohm@0
   113
             | None    => t)
clasohm@0
   114
      |  _            => t;
clasohm@0
   115
clasohm@0
   116
clasohm@0
   117
(* mk_proj_list(is) = [ |is| - k | 1 <= k <= |is| and is[k] >= 0 ] *)
clasohm@0
   118
fun mk_proj_list is =
clasohm@0
   119
    let fun mk(i::is,j) = if i >= 0 then j :: mk(is,j-1) else mk(is,j-1)
clasohm@0
   120
          | mk([],_)    = []
clasohm@0
   121
    in mk(is,length is - 1) end;
clasohm@0
   122
clasohm@0
   123
fun proj(s,env,binders,is) =
clasohm@0
   124
    let fun trans d i = if i<d then i else (idx is (i-d))+d;
clasohm@0
   125
        fun pr(s,env,d,binders) = (case devar env s of
clasohm@0
   126
              Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders))
clasohm@0
   127
                            in (Abs(a,T,t'),env') end
clasohm@0
   128
            | t => (case strip_comb t of
clasohm@0
   129
                (c as Const _,ts) =>
clasohm@0
   130
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   131
                         in (list_comb(c,ts'),env') end
clasohm@0
   132
                 | (f as Free _,ts) =>
clasohm@0
   133
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   134
                         in (list_comb(f,ts'),env') end
clasohm@0
   135
                 | (Bound(i),ts) =>
clasohm@0
   136
                         let val j = trans d i
clasohm@0
   137
                         in if j < 0 then raise Unif
clasohm@0
   138
                            else let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   139
                                 in (list_comb(Bound j,ts'),env') end
clasohm@0
   140
                         end
clasohm@0
   141
                 | (Var(F as (a,_),Fty),ts) =>
clasohm@0
   142
                      let val js = ints_of ts;
clasohm@0
   143
                          val js' = map (trans d) js;
clasohm@0
   144
                          val ks = mk_proj_list js';
clasohm@0
   145
                          val ls = filter (fn i => i >= 0) js'
clasohm@0
   146
                          val Hty = type_of_G(Fty,length js,ks)
clasohm@0
   147
                          val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   148
                          val env'' =
clasohm@0
   149
                                Envir.update((F,mkhnf(binders,js,H,ks)),env')
clasohm@0
   150
                      in (app(H,ls),env'') end
clasohm@0
   151
                 | _  => raise Pattern))
clasohm@0
   152
        and prs(s::ss,env,d,binders) =
clasohm@0
   153
              let val (s',env1) = pr(s,env,d,binders)
clasohm@0
   154
                  val (ss',env2) = prs(ss,env1,d,binders)
clasohm@0
   155
              in (s'::ss',env2) end
clasohm@0
   156
          | prs([],env,_,_) = ([],env)
clasohm@0
   157
   in if downto0(is,length binders - 1) then (s,env)
clasohm@0
   158
      else pr(s,env,0,binders)
clasohm@0
   159
   end;
clasohm@0
   160
clasohm@0
   161
clasohm@0
   162
(* mk_ff_list(is,js) = [ length(is) - k | 1 <= k <= |is| and is[k] = js[k] ] *)
clasohm@0
   163
fun mk_ff_list(is,js) = 
clasohm@0
   164
    let fun mk([],[],_)        = [] 
clasohm@0
   165
          | mk(i::is,j::js, k) = if i=j then k :: mk(is,js,k-1)
clasohm@0
   166
                                        else mk(is,js,k-1)
nipkow@678
   167
          | mk _               = error"mk_ff_list"
clasohm@0
   168
    in mk(is,js,length is-1) end;
clasohm@0
   169
clasohm@0
   170
fun flexflex1(env,binders,F,Fty,is,js) =
clasohm@0
   171
  if is=js then env
clasohm@0
   172
  else let val ks = mk_ff_list(is,js)
clasohm@0
   173
       in mknewhnf(env,binders,is,F,Fty,ks) end;
clasohm@0
   174
clasohm@0
   175
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) =
clasohm@0
   176
  let fun ff(F,Fty,is,G as (a,_),Gty,js) =
berghofe@1576
   177
            if js subset_int is
clasohm@0
   178
            then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js))
clasohm@0
   179
                 in Envir.update((F,t),env) end
berghofe@1576
   180
            else let val ks = is inter_int js
clasohm@0
   181
                     val Hty = type_of_G(Fty,length is,map (idx is) ks)
clasohm@0
   182
                     val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   183
                     fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks));
clasohm@0
   184
                 in Envir.update((G,lam js), Envir.update((F,lam is),env'))
clasohm@0
   185
                 end;
clasohm@0
   186
  in if xless(G,F) then ff(F,Fty,is,G,Gty,js) else ff(G,Gty,js,F,Fty,is) end
clasohm@0
   187
clasohm@0
   188
val tsgr = ref(Type.tsig0);
clasohm@0
   189
clasohm@0
   190
fun unify_types(T,U, env as Envir.Envir{asol,iTs,maxidx}) =
clasohm@0
   191
  if T=U then env
nipkow@1435
   192
  else let val (iTs',maxidx') = Type.unify (!tsgr) maxidx iTs (U,T)
nipkow@1435
   193
       in Envir.Envir{asol=asol,maxidx=maxidx',iTs=iTs'} end
clasohm@0
   194
       handle Type.TUNIFY => raise Unif;
clasohm@0
   195
clasohm@0
   196
fun unif binders (env,(s,t)) = case (devar env s,devar env t) of
clasohm@0
   197
      (Abs(ns,Ts,ts),Abs(nt,Tt,tt)) =>
clasohm@0
   198
         let val name = if ns = "" then nt else ns
clasohm@0
   199
         in unif ((name,Ts)::binders) (env,(ts,tt)) end
clasohm@0
   200
    | (Abs(ns,Ts,ts),t) => unif ((ns,Ts)::binders) (env,(ts,(incr t)$Bound(0)))
clasohm@0
   201
    | (t,Abs(nt,Tt,tt)) => unif ((nt,Tt)::binders) (env,((incr t)$Bound(0),tt))
clasohm@0
   202
    | p => cases(binders,env,p)
clasohm@0
   203
clasohm@0
   204
and cases(binders,env,(s,t)) = case (strip_comb s,strip_comb t) of
clasohm@0
   205
       ((Var(F,Fty),ss),(Var(G,Gty),ts)) => 
clasohm@0
   206
         if F = G then flexflex1(env,binders,F,Fty,ints_of ss,ints_of ts)
clasohm@0
   207
                  else flexflex2(env,binders,F,Fty,ints_of ss,G,Gty,ints_of ts)
clasohm@0
   208
      | ((Var(F,_),ss),_)             => flexrigid(env,binders,F,ints_of ss,t)
clasohm@0
   209
      | (_,(Var(F,_),ts))             => flexrigid(env,binders,F,ints_of ts,s)
clasohm@0
   210
      | ((Const c,ss),(Const d,ts))   => rigidrigid(env,binders,c,d,ss,ts)
clasohm@0
   211
      | ((Free(f),ss),(Free(g),ts))   => rigidrigid(env,binders,f,g,ss,ts)
clasohm@0
   212
      | ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB (env,binders,i,j,ss,ts) 
clasohm@0
   213
      | ((Abs(_),_),_)                => raise Pattern
clasohm@0
   214
      | (_,(Abs(_),_))                => raise Pattern
clasohm@0
   215
      | _                             => raise Unif
clasohm@0
   216
clasohm@0
   217
and rigidrigid (env,binders,(a,Ta),(b,Tb),ss,ts) =
clasohm@0
   218
      if a<>b then raise Unif
clasohm@0
   219
      else foldl (unif binders) (unify_types(Ta,Tb,env), ss~~ts)
clasohm@0
   220
clasohm@0
   221
and rigidrigidB (env,binders,i,j,ss,ts) =
clasohm@0
   222
     if i <> j then raise Unif else foldl (unif binders) (env ,ss~~ts)
clasohm@0
   223
clasohm@0
   224
and flexrigid (env,binders,F,is,t) =
clasohm@0
   225
      if occurs(F,t,env) then raise Unif
clasohm@0
   226
      else let val (u,env') = proj(t,env,binders,is)
clasohm@0
   227
           in Envir.update((F,mkabs(binders,is,u)),env') end;
clasohm@0
   228
clasohm@0
   229
fun unify(sg,env,tus) = (tsgr := #tsig(Sign.rep_sg sg);
clasohm@0
   230
                         foldl (unif []) (env,tus));
clasohm@0
   231
clasohm@0
   232
paulson@2725
   233
(*Eta-contract a term (fully)*)
nipkow@2792
   234
nipkow@2792
   235
(* copying: *)
clasohm@0
   236
fun eta_contract (Abs(a,T,body)) = 
paulson@2616
   237
      (case  eta_contract body  of
paulson@2616
   238
        body' as (f $ Bound 0) => 
nipkow@2792
   239
	  if loose_bvar1(f,0) then Abs(a,T,body')
paulson@2616
   240
	  else incr_boundvars ~1 f 
clasohm@0
   241
      | body' => Abs(a,T,body'))
clasohm@0
   242
  | eta_contract(f$t) = eta_contract f $ eta_contract t
clasohm@0
   243
  | eta_contract t = t;
clasohm@0
   244
clasohm@0
   245
nipkow@2792
   246
(* sharing:
nipkow@2792
   247
local
nipkow@2792
   248
nipkow@2792
   249
fun eta(Abs(x,T,t)) =
nipkow@2792
   250
     (case eta t of
nipkow@2792
   251
        None => (case t of
nipkow@2792
   252
                   f $ Bound 0 => if loose_bvar1(f,0)
nipkow@2792
   253
                                  then None
nipkow@2792
   254
                                  else Some(incr_boundvars ~1 f)
nipkow@2792
   255
                 | _ => None)
nipkow@2792
   256
      | Some(t') => (case t' of
nipkow@2792
   257
                       f $ Bound 0 => if loose_bvar1(f,0)
nipkow@2792
   258
                                      then Some(Abs(x,T,t'))
nipkow@2792
   259
                                      else Some(incr_boundvars ~1 f)
nipkow@2792
   260
                     | _ => Some(Abs(x,T,t'))))
nipkow@2792
   261
  | eta(s$t) = (case (eta s,eta t) of
nipkow@2792
   262
                  (None,   None)    => None
nipkow@2792
   263
                | (None,   Some t') => Some(s  $ t')
nipkow@2792
   264
                | (Some s',None)    => Some(s' $ t)
nipkow@2792
   265
                | (Some s',Some t') => Some(s' $ t'))
nipkow@2792
   266
  | eta _ = None
nipkow@2792
   267
nipkow@2792
   268
in
nipkow@2792
   269
nipkow@2792
   270
fun eta_contract t = case eta t of None => t | Some(t') => t';
nipkow@2792
   271
nipkow@2792
   272
end; *)
nipkow@2792
   273
nipkow@6539
   274
(*Eta-contract a term from outside: just enough to reduce it to an atom
nipkow@6539
   275
DOESN'T QUITE WORK!
nipkow@6539
   276
*)
paulson@2725
   277
fun eta_contract_atom (t0 as Abs(a, T, body)) = 
paulson@2725
   278
      (case  eta_contract2 body  of
paulson@2725
   279
        body' as (f $ Bound 0) => 
nipkow@2792
   280
	    if loose_bvar1(f,0) then Abs(a,T,body')
paulson@2725
   281
	    else eta_contract_atom (incr_boundvars ~1 f)
paulson@2725
   282
      | _ => t0)
paulson@2725
   283
  | eta_contract_atom t = t
paulson@2725
   284
and eta_contract2 (f$t) = f $ eta_contract_atom t
paulson@2725
   285
  | eta_contract2 t     = eta_contract_atom t;
paulson@2725
   286
paulson@2725
   287
nipkow@678
   288
(*Tests whether 2 terms are alpha/eta-convertible and have same type.
nipkow@678
   289
  Note that Consts and Vars may have more than one type.*)
paulson@2751
   290
fun t aeconv u = aconv_aux (eta_contract_atom t, eta_contract_atom u)
paulson@2751
   291
and aconv_aux (Const(a,T), Const(b,U)) = a=b  andalso  T=U
paulson@2751
   292
  | aconv_aux (Free(a,T),  Free(b,U))  = a=b  andalso  T=U
paulson@2751
   293
  | aconv_aux (Var(v,T),   Var(w,U))   = eq_ix(v,w) andalso  T=U
paulson@2751
   294
  | aconv_aux (Bound i,	   Bound j)    = i=j
paulson@2751
   295
  | aconv_aux (Abs(_,T,t), Abs(_,U,u)) = (t aeconv u)  andalso  T=U
paulson@2751
   296
  | aconv_aux (f$t,	   g$u)        = (f aeconv g)  andalso (t aeconv u)
paulson@2751
   297
  | aconv_aux _ =  false;
nipkow@678
   298
nipkow@678
   299
nipkow@4820
   300
(*** Matching ***)
nipkow@4820
   301
nipkow@4820
   302
exception MATCH;
nipkow@4820
   303
nipkow@4820
   304
fun typ_match tsig args = (Type.typ_match tsig args)
nipkow@4820
   305
                          handle Type.TYPE_MATCH => raise MATCH;
nipkow@4820
   306
nipkow@4820
   307
(*First-order matching;
nipkow@4820
   308
  fomatch tsig (pattern, object) returns a (tyvar,typ)list and (var,term)list.
nipkow@4820
   309
  The pattern and object may have variables in common.
nipkow@4820
   310
  Instantiation does not affect the object, so matching ?a with ?a+1 works.
nipkow@4820
   311
  Object is eta-contracted on the fly (by eta-expanding the pattern).
nipkow@4820
   312
  Precondition: the pattern is already eta-contracted!
nipkow@4820
   313
  Note: types are matched on the fly *)
nipkow@4820
   314
fun fomatch tsig =
nipkow@4820
   315
  let
nipkow@4820
   316
    fun mtch (instsp as (tyinsts,insts)) = fn
nipkow@4820
   317
        (Var(ixn,T), t)  =>
nipkow@4820
   318
	  if loose_bvar(t,0) then raise MATCH
nipkow@4820
   319
	  else (case assoc_string_int(insts,ixn) of
nipkow@4820
   320
		  None => (typ_match tsig (tyinsts, (T, fastype_of t)), 
nipkow@4820
   321
			   (ixn,t)::insts)
nipkow@4820
   322
		| Some u => if t aeconv u then instsp else raise MATCH)
nipkow@4820
   323
      | (Free (a,T), Free (b,U)) =>
nipkow@4820
   324
	  if a=b then (typ_match tsig (tyinsts,(T,U)), insts) else raise MATCH
nipkow@4820
   325
      | (Const (a,T), Const (b,U))  =>
nipkow@4820
   326
	  if a=b then (typ_match tsig (tyinsts,(T,U)), insts) else raise MATCH
nipkow@4820
   327
      | (Bound i, Bound j)  =>  if  i=j  then  instsp  else raise MATCH
nipkow@4820
   328
      | (Abs(_,T,t), Abs(_,U,u))  =>
nipkow@4820
   329
	  mtch (typ_match tsig (tyinsts,(T,U)),insts) (t,u)
nipkow@4820
   330
      | (f$t, g$u) => mtch (mtch instsp (f,g)) (t, u)
nipkow@4820
   331
      | (t, Abs(_,U,u))  =>  mtch instsp ((incr t)$(Bound 0), u)
nipkow@4820
   332
      | _ => raise MATCH
nipkow@4820
   333
  in mtch end;
nipkow@4820
   334
berghofe@8406
   335
fun first_order_match tsig = apfst Vartab.dest o fomatch tsig (Vartab.empty, []);
berghofe@8406
   336
nipkow@4820
   337
(* Matching of higher-order patterns *)
nipkow@4820
   338
nipkow@4820
   339
fun match_bind(itms,binders,ixn,is,t) =
nipkow@4820
   340
  let val js = loose_bnos t
nipkow@4820
   341
  in if null is
nipkow@4820
   342
     then if null js then (ixn,t)::itms else raise MATCH
nipkow@4820
   343
     else if js subset_int is
nipkow@4820
   344
          then let val t' = if downto0(is,length binders - 1) then t
nipkow@4820
   345
                            else mapbnd (idx is) t
nipkow@4820
   346
               in (ixn, mkabs(binders,is,t')) :: itms end
nipkow@4820
   347
          else raise MATCH
nipkow@4820
   348
  end;
nipkow@4820
   349
nipkow@678
   350
fun match tsg (po as (pat,obj)) =
nipkow@678
   351
let
nipkow@4820
   352
  (* Pre: pat and obj have same type *)
nipkow@4820
   353
  fun mtch binders (env as (iTs,itms),(pat,obj)) =
nipkow@4820
   354
    case pat of
nipkow@4820
   355
      Abs(ns,Ts,ts) =>
nipkow@4820
   356
        (case obj of
nipkow@4820
   357
           Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (env,(ts,tt))
berghofe@8406
   358
         | _ => let val Tt = typ_subst_TVars_Vartab iTs Ts
nipkow@4820
   359
                in mtch((ns,Tt)::binders)(env,(ts,(incr obj)$Bound(0))) end)
nipkow@4820
   360
    | _ => (case obj of
nipkow@4820
   361
              Abs(nt,Tt,tt) =>
nipkow@4820
   362
                mtch((nt,Tt)::binders)(env,((incr pat)$Bound(0),tt))
nipkow@4820
   363
            | _ => cases(binders,env,pat,obj))
nipkow@678
   364
nipkow@4820
   365
  and cases(binders,env as (iTs,itms),pat,obj) =
nipkow@4820
   366
    let val (ph,pargs) = strip_comb pat
nipkow@4820
   367
        fun rigrig1(iTs,oargs) =
nipkow@4820
   368
              foldl (mtch binders) ((iTs,itms), pargs~~oargs)
nipkow@4820
   369
        fun rigrig2((a,Ta),(b,Tb),oargs) =
nipkow@4820
   370
              if a<> b then raise MATCH
nipkow@4820
   371
              else rigrig1(typ_match tsg (iTs,(Ta,Tb)), oargs)
nipkow@4820
   372
    in case ph of
nipkow@4820
   373
         Var(ixn,_) =>
nipkow@4820
   374
           let val is = ints_of pargs
nipkow@4820
   375
           in case assoc_string_int(itms,ixn) of
nipkow@4820
   376
                None => (iTs,match_bind(itms,binders,ixn,is,obj))
nipkow@4820
   377
              | Some u => if obj aeconv (red u is []) then env
nipkow@4820
   378
                          else raise MATCH
nipkow@4820
   379
           end
nipkow@4820
   380
       | _ =>
nipkow@4820
   381
           let val (oh,oargs) = strip_comb obj
nipkow@4820
   382
           in case (ph,oh) of
nipkow@4820
   383
                (Const c,Const d) => rigrig2(c,d,oargs)
nipkow@4820
   384
              | (Free f,Free g)   => rigrig2(f,g,oargs)
nipkow@4820
   385
              | (Bound i,Bound j) => if i<>j then raise MATCH
nipkow@4820
   386
                                     else rigrig1(iTs,oargs)
nipkow@4820
   387
              | (Abs _, _)        => raise Pattern
nipkow@4820
   388
              | (_, Abs _)        => raise Pattern
nipkow@4820
   389
              | _                 => raise MATCH
nipkow@4820
   390
           end
nipkow@4820
   391
    end;
nipkow@678
   392
nipkow@4820
   393
  val pT = fastype_of pat
nipkow@4820
   394
  and oT = fastype_of obj
berghofe@8406
   395
  val iTs = typ_match tsg (Vartab.empty, (pT,oT))
nipkow@4820
   396
  val insts2 = (iTs,[])
nipkow@678
   397
berghofe@8406
   398
in apfst Vartab.dest (mtch [] (insts2, po)
berghofe@8406
   399
   handle Pattern => fomatch tsg insts2 po)
nipkow@678
   400
end;
clasohm@0
   401
clasohm@0
   402
(*Predicate: does the pattern match the object?*)
nipkow@678
   403
fun matches tsig po = (match tsig po; true) handle MATCH => false;
clasohm@0
   404
nipkow@4667
   405
(* Does pat match a subterm of obj? *)
nipkow@4667
   406
fun matches_subterm tsig (pat,obj) =
nipkow@4667
   407
  let fun msub(bounds,obj) = matches tsig (pat,obj) orelse
nipkow@4667
   408
            case obj of
nipkow@4667
   409
              Abs(x,T,t) => let val y = variant bounds x
nipkow@4667
   410
                                val f = Free(":" ^ y,T)
nipkow@4667
   411
                            in msub(x::bounds,subst_bound(f,t)) end
nipkow@4667
   412
            | s$t => msub(bounds,s) orelse msub(bounds,t)
nipkow@4667
   413
            | _ => false
nipkow@4667
   414
  in msub([],obj) end;
nipkow@4667
   415
nipkow@4820
   416
fun first_order(Abs(_,_,t)) = first_order t
nipkow@4820
   417
  | first_order(t $ u) = first_order t andalso first_order u andalso
nipkow@4820
   418
                         not(is_Var t)
nipkow@4820
   419
  | first_order _ = true;
nipkow@4820
   420
nipkow@4820
   421
fun pattern(Abs(_,_,t)) = pattern t
nipkow@4820
   422
  | pattern(t) = let val (head,args) = strip_comb t
nipkow@4820
   423
                 in if is_Var head
nipkow@4820
   424
                    then let val _ = ints_of args in true end
nipkow@4820
   425
                         handle Pattern => false
nipkow@4820
   426
                    else forall pattern args
nipkow@4820
   427
                 end;
nipkow@4820
   428
clasohm@0
   429
end;