src/Pure/pattern.ML
author wenzelm
Tue Nov 28 00:35:21 2006 +0100 (2006-11-28)
changeset 21566 af2932baf068
parent 20672 b96394d8c702
child 22255 8fcd11cb9be7
permissions -rw-r--r--
dest_term: strip_imp_concl;
wenzelm@12784
     1
(*  Title:      Pure/pattern.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@12784
     3
    Author:     Tobias Nipkow, Christine Heinzelmann, and Stefan Berghofer
clasohm@0
     4
clasohm@0
     5
Unification of Higher-Order Patterns.
clasohm@0
     6
clasohm@0
     7
See also:
clasohm@0
     8
Tobias Nipkow. Functional Unification of Higher-Order Patterns.
clasohm@0
     9
In Proceedings of the 8th IEEE Symposium Logic in Computer Science, 1993.
nipkow@678
    10
nipkow@678
    11
TODO: optimize red by special-casing it
clasohm@0
    12
*)
clasohm@0
    13
paulson@2751
    14
infix aeconv;
paulson@2751
    15
clasohm@0
    16
signature PATTERN =
wenzelm@14787
    17
sig
wenzelm@17203
    18
  val trace_unify_fail: bool ref
wenzelm@17203
    19
  val aeconv: term * term -> bool
wenzelm@17203
    20
  val eta_long: typ list -> term -> term
wenzelm@17203
    21
  val eta_contract_atom: term -> term
wenzelm@18182
    22
  val match: theory -> term * term -> Type.tyenv * Envir.tenv -> Type.tyenv * Envir.tenv
wenzelm@18182
    23
  val first_order_match: theory -> term * term
wenzelm@18182
    24
    -> Type.tyenv * Envir.tenv -> Type.tyenv * Envir.tenv
wenzelm@17203
    25
  val matches: theory -> term * term -> bool
wenzelm@19880
    26
  val equiv: theory -> term * term -> bool
wenzelm@17203
    27
  val matches_subterm: theory -> term * term -> bool
wenzelm@18182
    28
  val unify: theory -> term * term -> Envir.env -> Envir.env
wenzelm@17203
    29
  val first_order: term -> bool
wenzelm@17203
    30
  val pattern: term -> bool
wenzelm@17203
    31
  val rewrite_term: theory -> (term * term) list -> (term -> term option) list -> term -> term
clasohm@0
    32
  exception Unif
clasohm@0
    33
  exception MATCH
clasohm@0
    34
  exception Pattern
wenzelm@14787
    35
end;
clasohm@0
    36
wenzelm@17203
    37
structure Pattern: PATTERN =
clasohm@0
    38
struct
clasohm@0
    39
clasohm@0
    40
exception Unif;
clasohm@0
    41
exception Pattern;
clasohm@0
    42
nipkow@13642
    43
val trace_unify_fail = ref false;
nipkow@13642
    44
wenzelm@17203
    45
fun string_of_term thy env binders t = Sign.string_of_term thy
nipkow@13642
    46
  (Envir.norm_term env (subst_bounds(map Free binders,t)));
nipkow@13642
    47
haftmann@18011
    48
fun bname binders i = fst (nth binders i);
nipkow@13642
    49
fun bnames binders is = space_implode " " (map (bname binders) is);
nipkow@13642
    50
wenzelm@17203
    51
fun typ_clash thy (tye,T,U) =
nipkow@13642
    52
  if !trace_unify_fail
wenzelm@17203
    53
  then let val t = Sign.string_of_typ thy (Envir.norm_type tye T)
wenzelm@17203
    54
           and u = Sign.string_of_typ thy (Envir.norm_type tye U)
nipkow@13642
    55
       in tracing("The following types do not unify:\n" ^ t ^ "\n" ^ u) end
nipkow@13642
    56
  else ()
nipkow@13642
    57
nipkow@13642
    58
fun clash a b =
nipkow@13642
    59
  if !trace_unify_fail then tracing("Clash: " ^ a ^ " =/= " ^ b) else ()
nipkow@13642
    60
nipkow@13642
    61
fun boundVar binders i =
nipkow@13642
    62
  "bound variable " ^ bname binders i ^ " (depth " ^ string_of_int i ^ ")";
nipkow@13642
    63
nipkow@13642
    64
fun clashBB binders i j =
nipkow@13642
    65
  if !trace_unify_fail then clash (boundVar binders i) (boundVar binders j)
nipkow@13642
    66
  else ()
nipkow@13642
    67
nipkow@13642
    68
fun clashB binders i s =
nipkow@13642
    69
  if !trace_unify_fail then clash (boundVar binders i) s
nipkow@13642
    70
  else ()
nipkow@13642
    71
wenzelm@17203
    72
fun proj_fail thy (env,binders,F,_,is,t) =
nipkow@13642
    73
  if !trace_unify_fail
nipkow@13642
    74
  then let val f = Syntax.string_of_vname F
nipkow@13642
    75
           val xs = bnames binders is
wenzelm@17203
    76
           val u = string_of_term thy env binders t
wenzelm@19300
    77
           val ys = bnames binders (subtract (op =) is (loose_bnos t))
nipkow@13642
    78
       in tracing("Cannot unify variable " ^ f ^
nipkow@13642
    79
               " (depending on bound variables " ^ xs ^ ")\nwith term " ^ u ^
nipkow@13642
    80
               "\nTerm contains additional bound variable(s) " ^ ys)
nipkow@13642
    81
       end
nipkow@13642
    82
  else ()
nipkow@13642
    83
wenzelm@17203
    84
fun ocheck_fail thy (F,t,binders,env) =
nipkow@13642
    85
  if !trace_unify_fail
nipkow@13642
    86
  then let val f = Syntax.string_of_vname F
wenzelm@17203
    87
           val u = string_of_term thy env binders t
nipkow@13642
    88
       in tracing("Variable " ^ f ^ " occurs in term\n" ^ u ^
nipkow@13642
    89
                  "\nCannot unify!\n")
nipkow@13642
    90
       end
nipkow@13642
    91
  else ()
nipkow@13642
    92
wenzelm@12784
    93
fun occurs(F,t,env) =
berghofe@15797
    94
    let fun occ(Var (G, T))   = (case Envir.lookup (env, (G, T)) of
skalberg@15531
    95
                                 SOME(t) => occ t
skalberg@15531
    96
                               | NONE    => F=G)
clasohm@0
    97
          | occ(t1$t2)      = occ t1 orelse occ t2
clasohm@0
    98
          | occ(Abs(_,_,t)) = occ t
clasohm@0
    99
          | occ _           = false
clasohm@0
   100
    in occ t end;
clasohm@0
   101
clasohm@0
   102
clasohm@0
   103
fun mapbnd f =
clasohm@0
   104
    let fun mpb d (Bound(i))     = if i < d then Bound(i) else Bound(f(i-d)+d)
clasohm@0
   105
          | mpb d (Abs(s,T,t))   = Abs(s,T,mpb(d+1) t)
nipkow@678
   106
          | mpb d ((u1 $ u2))    = (mpb d u1)$(mpb d u2)
nipkow@678
   107
          | mpb _ atom           = atom
clasohm@0
   108
    in mpb 0 end;
clasohm@0
   109
berghofe@14861
   110
fun idx [] j     = raise Unif
wenzelm@16668
   111
  | idx(i::is) j = if (i:int) =j then length is else idx is j;
clasohm@0
   112
clasohm@0
   113
fun mkabs (binders,is,t)  =
haftmann@18011
   114
    let fun mk(i::is) = let val (x,T) = nth binders i
wenzelm@12784
   115
                        in Abs(x,T,mk is) end
clasohm@0
   116
          | mk []     = t
clasohm@0
   117
    in mk is end;
clasohm@0
   118
clasohm@0
   119
val incr = mapbnd (fn i => i+1);
clasohm@0
   120
clasohm@0
   121
fun ints_of []             = []
wenzelm@12784
   122
  | ints_of (Bound i ::bs) =
clasohm@0
   123
      let val is = ints_of bs
wenzelm@20672
   124
      in if member (op =) is i then raise Pattern else i::is end
clasohm@0
   125
  | ints_of _              = raise Pattern;
clasohm@0
   126
berghofe@12232
   127
fun ints_of' env ts = ints_of (map (Envir.head_norm env) ts);
berghofe@12232
   128
clasohm@0
   129
clasohm@0
   130
fun app (s,(i::is)) = app (s$Bound(i),is)
clasohm@0
   131
  | app (s,[])      = s;
clasohm@0
   132
clasohm@0
   133
fun red (Abs(_,_,s)) (i::is) js = red s is (i::js)
nipkow@678
   134
  | red t            []      [] = t
haftmann@18011
   135
  | red t            is      jn = app (mapbnd (nth jn) t,is);
nipkow@678
   136
clasohm@0
   137
clasohm@0
   138
(* split_type ([T1,....,Tn]---> T,n,[]) = ([Tn,...,T1],T) *)
clasohm@0
   139
fun split_type (T,0,Ts)                    = (Ts,T)
clasohm@0
   140
  | split_type (Type ("fun",[T1,T2]),n,Ts) = split_type (T2,n-1,T1::Ts)
nipkow@678
   141
  | split_type _                           = error("split_type");
clasohm@0
   142
berghofe@13891
   143
fun type_of_G (env as Envir.Envir {iTs, ...}) (T,n,is) =
berghofe@13891
   144
  let val (Ts, U) = split_type (Envir.norm_type iTs T, n, [])
haftmann@18011
   145
  in map (nth Ts) is ---> U end;
clasohm@0
   146
clasohm@0
   147
fun mkhnf (binders,is,G,js) = mkabs (binders, is, app(G,js));
clasohm@0
   148
clasohm@0
   149
fun mknewhnf(env,binders,is,F as (a,_),T,js) =
berghofe@13891
   150
  let val (env',G) = Envir.genvar a (env,type_of_G env (T,length is,js))
berghofe@15797
   151
  in Envir.update (((F, T), mkhnf (binders, is, G, js)), env') end;
clasohm@0
   152
clasohm@0
   153
clasohm@0
   154
(* mk_proj_list(is) = [ |is| - k | 1 <= k <= |is| and is[k] >= 0 ] *)
clasohm@0
   155
fun mk_proj_list is =
wenzelm@19502
   156
    let fun mk(i::is,j) = if is_some i then j :: mk(is,j-1) else mk(is,j-1)
clasohm@0
   157
          | mk([],_)    = []
clasohm@0
   158
    in mk(is,length is - 1) end;
clasohm@0
   159
clasohm@0
   160
fun proj(s,env,binders,is) =
clasohm@0
   161
    let fun trans d i = if i<d then i else (idx is (i-d))+d;
berghofe@12232
   162
        fun pr(s,env,d,binders) = (case Envir.head_norm env s of
clasohm@0
   163
              Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders))
clasohm@0
   164
                            in (Abs(a,T,t'),env') end
clasohm@0
   165
            | t => (case strip_comb t of
clasohm@0
   166
                (c as Const _,ts) =>
clasohm@0
   167
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   168
                         in (list_comb(c,ts'),env') end
clasohm@0
   169
                 | (f as Free _,ts) =>
clasohm@0
   170
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   171
                         in (list_comb(f,ts'),env') end
clasohm@0
   172
                 | (Bound(i),ts) =>
clasohm@0
   173
                         let val j = trans d i
berghofe@14861
   174
                             val (ts',env') = prs(ts,env,d,binders)
berghofe@14861
   175
                         in (list_comb(Bound j,ts'),env') end
clasohm@0
   176
                 | (Var(F as (a,_),Fty),ts) =>
berghofe@12232
   177
                      let val js = ints_of' env ts;
berghofe@14861
   178
                          val js' = map (try (trans d)) js;
clasohm@0
   179
                          val ks = mk_proj_list js';
wenzelm@19482
   180
                          val ls = map_filter I js'
berghofe@13891
   181
                          val Hty = type_of_G env (Fty,length js,ks)
clasohm@0
   182
                          val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   183
                          val env'' =
berghofe@15797
   184
                            Envir.update (((F, Fty), mkhnf (binders, js, H, ks)), env')
clasohm@0
   185
                      in (app(H,ls),env'') end
clasohm@0
   186
                 | _  => raise Pattern))
clasohm@0
   187
        and prs(s::ss,env,d,binders) =
clasohm@0
   188
              let val (s',env1) = pr(s,env,d,binders)
clasohm@0
   189
                  val (ss',env2) = prs(ss,env1,d,binders)
clasohm@0
   190
              in (s'::ss',env2) end
clasohm@0
   191
          | prs([],env,_,_) = ([],env)
clasohm@0
   192
   in if downto0(is,length binders - 1) then (s,env)
clasohm@0
   193
      else pr(s,env,0,binders)
clasohm@0
   194
   end;
clasohm@0
   195
clasohm@0
   196
clasohm@0
   197
(* mk_ff_list(is,js) = [ length(is) - k | 1 <= k <= |is| and is[k] = js[k] ] *)
wenzelm@12784
   198
fun mk_ff_list(is,js) =
wenzelm@12784
   199
    let fun mk([],[],_)        = []
wenzelm@16668
   200
          | mk(i::is,j::js, k) = if (i:int) = j then k :: mk(is,js,k-1)
clasohm@0
   201
                                        else mk(is,js,k-1)
nipkow@678
   202
          | mk _               = error"mk_ff_list"
clasohm@0
   203
    in mk(is,js,length is-1) end;
clasohm@0
   204
clasohm@0
   205
fun flexflex1(env,binders,F,Fty,is,js) =
clasohm@0
   206
  if is=js then env
clasohm@0
   207
  else let val ks = mk_ff_list(is,js)
clasohm@0
   208
       in mknewhnf(env,binders,is,F,Fty,ks) end;
clasohm@0
   209
clasohm@0
   210
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) =
clasohm@0
   211
  let fun ff(F,Fty,is,G as (a,_),Gty,js) =
berghofe@1576
   212
            if js subset_int is
clasohm@0
   213
            then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js))
berghofe@15797
   214
                 in Envir.update (((F, Fty), t), env) end
berghofe@1576
   215
            else let val ks = is inter_int js
berghofe@13891
   216
                     val Hty = type_of_G env (Fty,length is,map (idx is) ks)
clasohm@0
   217
                     val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   218
                     fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks));
berghofe@15797
   219
                 in Envir.update (((G, Gty), lam js), Envir.update (((F, Fty), lam is), env'))
clasohm@0
   220
                 end;
wenzelm@20098
   221
  in if Term.indexname_ord (G,F) = LESS then ff(F,Fty,is,G,Gty,js) else ff(G,Gty,js,F,Fty,is) end
clasohm@0
   222
wenzelm@18182
   223
fun unify_types thy (T,U) (env as Envir.Envir{asol,iTs,maxidx}) =
clasohm@0
   224
  if T=U then env
wenzelm@17203
   225
  else let val (iTs',maxidx') = Sign.typ_unify thy (U, T) (iTs, maxidx)
nipkow@1435
   226
       in Envir.Envir{asol=asol,maxidx=maxidx',iTs=iTs'} end
wenzelm@17203
   227
       handle Type.TUNIFY => (typ_clash thy (iTs,T,U); raise Unif);
clasohm@0
   228
wenzelm@18182
   229
fun unif thy binders (s,t) env = case (Envir.head_norm env s, Envir.head_norm env t) of
clasohm@0
   230
      (Abs(ns,Ts,ts),Abs(nt,Tt,tt)) =>
clasohm@0
   231
         let val name = if ns = "" then nt else ns
wenzelm@18182
   232
         in unif thy ((name,Ts)::binders) (ts,tt) env end
wenzelm@18182
   233
    | (Abs(ns,Ts,ts),t) => unif thy ((ns,Ts)::binders) (ts,(incr t)$Bound(0)) env
wenzelm@18182
   234
    | (t,Abs(nt,Tt,tt)) => unif thy ((nt,Tt)::binders) ((incr t)$Bound(0),tt) env
wenzelm@17203
   235
    | p => cases thy (binders,env,p)
clasohm@0
   236
wenzelm@17203
   237
and cases thy (binders,env,(s,t)) = case (strip_comb s,strip_comb t) of
wenzelm@12784
   238
       ((Var(F,Fty),ss),(Var(G,Gty),ts)) =>
berghofe@12232
   239
         if F = G then flexflex1(env,binders,F,Fty,ints_of' env ss,ints_of' env ts)
berghofe@12232
   240
                  else flexflex2(env,binders,F,Fty,ints_of' env ss,G,Gty,ints_of' env ts)
wenzelm@17203
   241
      | ((Var(F,Fty),ss),_)           => flexrigid thy (env,binders,F,Fty,ints_of' env ss,t)
wenzelm@17203
   242
      | (_,(Var(F,Fty),ts))           => flexrigid thy (env,binders,F,Fty,ints_of' env ts,s)
wenzelm@17203
   243
      | ((Const c,ss),(Const d,ts))   => rigidrigid thy (env,binders,c,d,ss,ts)
wenzelm@17203
   244
      | ((Free(f),ss),(Free(g),ts))   => rigidrigid thy (env,binders,f,g,ss,ts)
wenzelm@17203
   245
      | ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB thy (env,binders,i,j,ss,ts)
clasohm@0
   246
      | ((Abs(_),_),_)                => raise Pattern
clasohm@0
   247
      | (_,(Abs(_),_))                => raise Pattern
nipkow@13642
   248
      | ((Const(c,_),_),(Free(f,_),_)) => (clash c f; raise Unif)
nipkow@13642
   249
      | ((Const(c,_),_),(Bound i,_))   => (clashB binders i c; raise Unif)
nipkow@13642
   250
      | ((Free(f,_),_),(Const(c,_),_)) => (clash f c; raise Unif)
nipkow@13642
   251
      | ((Free(f,_),_),(Bound i,_))    => (clashB binders i f; raise Unif)
nipkow@13642
   252
      | ((Bound i,_),(Const(c,_),_))   => (clashB binders i c; raise Unif)
nipkow@13642
   253
      | ((Bound i,_),(Free(f,_),_))    => (clashB binders i f; raise Unif)
nipkow@13642
   254
clasohm@0
   255
wenzelm@17203
   256
and rigidrigid thy (env,binders,(a,Ta),(b,Tb),ss,ts) =
nipkow@13642
   257
      if a<>b then (clash a b; raise Unif)
wenzelm@18182
   258
      else env |> unify_types thy (Ta,Tb) |> fold (unif thy binders) (ss~~ts)
clasohm@0
   259
wenzelm@17203
   260
and rigidrigidB thy (env,binders,i,j,ss,ts) =
nipkow@13642
   261
     if i <> j then (clashBB binders i j; raise Unif)
wenzelm@18182
   262
     else fold (unif thy binders) (ss~~ts) env
clasohm@0
   263
wenzelm@17203
   264
and flexrigid thy (params as (env,binders,F,Fty,is,t)) =
wenzelm@17203
   265
      if occurs(F,t,env) then (ocheck_fail thy (F,t,binders,env); raise Unif)
nipkow@13642
   266
      else (let val (u,env') = proj(t,env,binders,is)
berghofe@15797
   267
            in Envir.update (((F, Fty), mkabs (binders, is, u)), env') end
wenzelm@17203
   268
            handle Unif => (proj_fail thy params; raise Unif));
clasohm@0
   269
wenzelm@18182
   270
fun unify thy = unif thy [];
clasohm@0
   271
clasohm@0
   272
nipkow@6539
   273
(*Eta-contract a term from outside: just enough to reduce it to an atom
nipkow@6539
   274
DOESN'T QUITE WORK!
nipkow@6539
   275
*)
wenzelm@12784
   276
fun eta_contract_atom (t0 as Abs(a, T, body)) =
paulson@2725
   277
      (case  eta_contract2 body  of
wenzelm@12784
   278
        body' as (f $ Bound 0) =>
wenzelm@12784
   279
            if loose_bvar1(f,0) then Abs(a,T,body')
wenzelm@12784
   280
            else eta_contract_atom (incr_boundvars ~1 f)
paulson@2725
   281
      | _ => t0)
paulson@2725
   282
  | eta_contract_atom t = t
paulson@2725
   283
and eta_contract2 (f$t) = f $ eta_contract_atom t
paulson@2725
   284
  | eta_contract2 t     = eta_contract_atom t;
paulson@2725
   285
berghofe@13998
   286
(* put a term into eta long beta normal form *)
berghofe@13998
   287
fun eta_long Ts (Abs (s, T, t)) = Abs (s, T, eta_long (T :: Ts) t)
berghofe@13998
   288
  | eta_long Ts t = (case strip_comb t of
berghofe@13998
   289
      (Abs _, _) => eta_long Ts (Envir.beta_norm t)
wenzelm@14787
   290
    | (u, ts) =>
berghofe@13998
   291
      let
berghofe@13998
   292
        val Us = binder_types (fastype_of1 (Ts, t));
berghofe@13998
   293
        val i = length Us
berghofe@13998
   294
      in list_abs (map (pair "x") Us,
berghofe@13998
   295
        list_comb (incr_boundvars i u, map (eta_long (rev Us @ Ts))
berghofe@13998
   296
          (map (incr_boundvars i) ts @ map Bound (i - 1 downto 0))))
berghofe@13998
   297
      end);
berghofe@13998
   298
paulson@2725
   299
nipkow@678
   300
(*Tests whether 2 terms are alpha/eta-convertible and have same type.
nipkow@678
   301
  Note that Consts and Vars may have more than one type.*)
paulson@2751
   302
fun t aeconv u = aconv_aux (eta_contract_atom t, eta_contract_atom u)
paulson@2751
   303
and aconv_aux (Const(a,T), Const(b,U)) = a=b  andalso  T=U
paulson@2751
   304
  | aconv_aux (Free(a,T),  Free(b,U))  = a=b  andalso  T=U
paulson@2751
   305
  | aconv_aux (Var(v,T),   Var(w,U))   = eq_ix(v,w) andalso  T=U
wenzelm@12784
   306
  | aconv_aux (Bound i,    Bound j)    = i=j
paulson@2751
   307
  | aconv_aux (Abs(_,T,t), Abs(_,U,u)) = (t aeconv u)  andalso  T=U
wenzelm@12784
   308
  | aconv_aux (f$t,        g$u)        = (f aeconv g)  andalso (t aeconv u)
paulson@2751
   309
  | aconv_aux _ =  false;
nipkow@678
   310
nipkow@678
   311
nipkow@4820
   312
(*** Matching ***)
nipkow@4820
   313
nipkow@4820
   314
exception MATCH;
nipkow@4820
   315
wenzelm@18182
   316
fun typ_match thy TU tyenv = Sign.typ_match thy TU tyenv
wenzelm@16939
   317
  handle Type.TYPE_MATCH => raise MATCH;
nipkow@4820
   318
nipkow@4820
   319
(*First-order matching;
nipkow@4820
   320
  The pattern and object may have variables in common.
nipkow@4820
   321
  Instantiation does not affect the object, so matching ?a with ?a+1 works.
nipkow@4820
   322
  Object is eta-contracted on the fly (by eta-expanding the pattern).
nipkow@4820
   323
  Precondition: the pattern is already eta-contracted!
wenzelm@18182
   324
  Types are matched on the fly*)
wenzelm@18182
   325
fun first_order_match thy =
nipkow@4820
   326
  let
nipkow@4820
   327
    fun mtch (instsp as (tyinsts,insts)) = fn
nipkow@4820
   328
        (Var(ixn,T), t)  =>
wenzelm@12784
   329
          if loose_bvar(t,0) then raise MATCH
berghofe@16651
   330
          else (case Envir.lookup' (insts, (ixn, T)) of
wenzelm@18182
   331
                  NONE => (typ_match thy (T, fastype_of t) tyinsts,
wenzelm@17412
   332
                           Vartab.update_new (ixn, (T, t)) insts)
skalberg@15531
   333
                | SOME u => if t aeconv u then instsp else raise MATCH)
nipkow@4820
   334
      | (Free (a,T), Free (b,U)) =>
wenzelm@18182
   335
          if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH
nipkow@4820
   336
      | (Const (a,T), Const (b,U))  =>
wenzelm@18182
   337
          if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH
nipkow@4820
   338
      | (Bound i, Bound j)  =>  if  i=j  then  instsp  else raise MATCH
nipkow@4820
   339
      | (Abs(_,T,t), Abs(_,U,u))  =>
wenzelm@18182
   340
          mtch (typ_match thy (T,U) tyinsts, insts) (t,u)
nipkow@4820
   341
      | (f$t, g$u) => mtch (mtch instsp (f,g)) (t, u)
nipkow@4820
   342
      | (t, Abs(_,U,u))  =>  mtch instsp ((incr t)$(Bound 0), u)
nipkow@4820
   343
      | _ => raise MATCH
wenzelm@18182
   344
  in fn tu => fn env => mtch env tu end;
nipkow@4820
   345
berghofe@8406
   346
nipkow@4820
   347
(* Matching of higher-order patterns *)
nipkow@4820
   348
berghofe@15797
   349
fun match_bind(itms,binders,ixn,T,is,t) =
nipkow@4820
   350
  let val js = loose_bnos t
nipkow@4820
   351
  in if null is
wenzelm@17412
   352
     then if null js then Vartab.update_new (ixn, (T, t)) itms else raise MATCH
nipkow@4820
   353
     else if js subset_int is
nipkow@4820
   354
          then let val t' = if downto0(is,length binders - 1) then t
nipkow@4820
   355
                            else mapbnd (idx is) t
wenzelm@17412
   356
               in Vartab.update_new (ixn, (T, mkabs (binders, is, t'))) itms end
nipkow@4820
   357
          else raise MATCH
nipkow@4820
   358
  end;
nipkow@4820
   359
wenzelm@18182
   360
fun match thy (po as (pat,obj)) envir =
nipkow@678
   361
let
nipkow@4820
   362
  (* Pre: pat and obj have same type *)
wenzelm@18182
   363
  fun mtch binders (pat,obj) (env as (iTs,itms)) =
nipkow@4820
   364
    case pat of
nipkow@4820
   365
      Abs(ns,Ts,ts) =>
nipkow@4820
   366
        (case obj of
wenzelm@18182
   367
           Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (ts,tt) env
berghofe@15797
   368
         | _ => let val Tt = Envir.typ_subst_TVars iTs Ts
wenzelm@18182
   369
                in mtch((ns,Tt)::binders) (ts,(incr obj)$Bound(0)) env end)
nipkow@4820
   370
    | _ => (case obj of
nipkow@4820
   371
              Abs(nt,Tt,tt) =>
wenzelm@18182
   372
                mtch((nt,Tt)::binders) ((incr pat)$Bound(0),tt) env
nipkow@4820
   373
            | _ => cases(binders,env,pat,obj))
nipkow@678
   374
nipkow@4820
   375
  and cases(binders,env as (iTs,itms),pat,obj) =
nipkow@4820
   376
    let val (ph,pargs) = strip_comb pat
wenzelm@18182
   377
        fun rigrig1(iTs,oargs) = fold (mtch binders) (pargs~~oargs) (iTs,itms)
wenzelm@16668
   378
        fun rigrig2((a:string,Ta),(b,Tb),oargs) =
wenzelm@16668
   379
              if a <> b then raise MATCH
wenzelm@18182
   380
              else rigrig1(typ_match thy (Ta,Tb) iTs, oargs)
nipkow@4820
   381
    in case ph of
berghofe@15797
   382
         Var(ixn,T) =>
nipkow@4820
   383
           let val is = ints_of pargs
berghofe@16651
   384
           in case Envir.lookup' (itms, (ixn, T)) of
berghofe@15797
   385
                NONE => (iTs,match_bind(itms,binders,ixn,T,is,obj))
skalberg@15531
   386
              | SOME u => if obj aeconv (red u is []) then env
nipkow@4820
   387
                          else raise MATCH
nipkow@4820
   388
           end
nipkow@4820
   389
       | _ =>
nipkow@4820
   390
           let val (oh,oargs) = strip_comb obj
nipkow@4820
   391
           in case (ph,oh) of
nipkow@4820
   392
                (Const c,Const d) => rigrig2(c,d,oargs)
nipkow@4820
   393
              | (Free f,Free g)   => rigrig2(f,g,oargs)
nipkow@4820
   394
              | (Bound i,Bound j) => if i<>j then raise MATCH
nipkow@4820
   395
                                     else rigrig1(iTs,oargs)
nipkow@4820
   396
              | (Abs _, _)        => raise Pattern
nipkow@4820
   397
              | (_, Abs _)        => raise Pattern
nipkow@4820
   398
              | _                 => raise MATCH
nipkow@4820
   399
           end
nipkow@4820
   400
    end;
nipkow@678
   401
nipkow@4820
   402
  val pT = fastype_of pat
nipkow@4820
   403
  and oT = fastype_of obj
wenzelm@18182
   404
  val envir' = apfst (typ_match thy (pT, oT)) envir;
wenzelm@18182
   405
in mtch [] po envir' handle Pattern => first_order_match thy po envir' end;
clasohm@0
   406
wenzelm@18182
   407
fun matches thy po = (match thy po (Vartab.empty, Vartab.empty); true) handle MATCH => false;
wenzelm@18182
   408
wenzelm@19880
   409
fun equiv thy (t, u) = matches thy (t, u) andalso matches thy (u, t);
wenzelm@19880
   410
clasohm@0
   411
nipkow@4667
   412
(* Does pat match a subterm of obj? *)
wenzelm@17203
   413
fun matches_subterm thy (pat,obj) =
wenzelm@17203
   414
  let fun msub(bounds,obj) = matches thy (pat,obj) orelse
wenzelm@17756
   415
            (case obj of
wenzelm@20079
   416
              Abs(x,T,t) => let val y = Name.variant bounds x
nipkow@4667
   417
                                val f = Free(":" ^ y,T)
nipkow@4667
   418
                            in msub(x::bounds,subst_bound(f,t)) end
nipkow@4667
   419
            | s$t => msub(bounds,s) orelse msub(bounds,t)
wenzelm@17756
   420
            | _ => false)
nipkow@4667
   421
  in msub([],obj) end;
nipkow@4667
   422
nipkow@4820
   423
fun first_order(Abs(_,_,t)) = first_order t
nipkow@4820
   424
  | first_order(t $ u) = first_order t andalso first_order u andalso
nipkow@4820
   425
                         not(is_Var t)
nipkow@4820
   426
  | first_order _ = true;
nipkow@4820
   427
wenzelm@20672
   428
fun pattern (Abs (_, _, t)) = pattern t
wenzelm@20672
   429
  | pattern t =
wenzelm@20672
   430
      let val (head, args) = strip_comb t in
wenzelm@20672
   431
        if is_Var head then
wenzelm@20672
   432
          forall is_Bound args andalso not (has_duplicates (op aconv) args)
wenzelm@20672
   433
        else forall pattern args
wenzelm@20672
   434
      end;
nipkow@4820
   435
wenzelm@12784
   436
wenzelm@12784
   437
(* rewriting -- simple but fast *)
wenzelm@12784
   438
wenzelm@17203
   439
fun rewrite_term thy rules procs tm =
wenzelm@12784
   440
  let
berghofe@13195
   441
    val skel0 = Bound 0;
berghofe@13195
   442
wenzelm@16939
   443
    fun variant_absfree bounds (x, T, t) =
wenzelm@12797
   444
      let
wenzelm@20079
   445
        val (x', t') = Term.dest_abs (Name.bound bounds, T, t);
wenzelm@16939
   446
        fun abs u = Abs (x, T, abstract_over (Free (x', T), u));
wenzelm@16939
   447
      in (abs, t') end;
wenzelm@12797
   448
wenzelm@12784
   449
    fun match_rew tm (tm1, tm2) =
wenzelm@18940
   450
      let val rtm = the_default tm2 (Term.rename_abs tm1 tm tm2) in
wenzelm@18182
   451
        SOME (Envir.subst_vars (match thy (tm1, tm) (Vartab.empty, Vartab.empty)) rtm, rtm)
wenzelm@16939
   452
          handle MATCH => NONE
berghofe@13195
   453
      end;
wenzelm@12784
   454
skalberg@15531
   455
    fun rew (Abs (_, _, body) $ t) = SOME (subst_bound (t, body), skel0)
berghofe@13195
   456
      | rew tm = (case get_first (match_rew tm) rules of
skalberg@15570
   457
          NONE => Option.map (rpair skel0) (get_first (fn p => p tm) procs)
berghofe@13195
   458
        | x => x);
berghofe@13195
   459
wenzelm@16939
   460
    fun rew1 bounds (Var _) _ = NONE
wenzelm@16939
   461
      | rew1 bounds skel tm = (case rew2 bounds skel tm of
skalberg@15531
   462
          SOME tm1 => (case rew tm1 of
wenzelm@18940
   463
              SOME (tm2, skel') => SOME (the_default tm2 (rew1 bounds skel' tm2))
skalberg@15531
   464
            | NONE => SOME tm1)
skalberg@15531
   465
        | NONE => (case rew tm of
wenzelm@18940
   466
              SOME (tm1, skel') => SOME (the_default tm1 (rew1 bounds skel' tm1))
skalberg@15531
   467
            | NONE => NONE))
wenzelm@12784
   468
wenzelm@16939
   469
    and rew2 bounds skel (tm1 $ tm2) = (case tm1 of
wenzelm@12784
   470
            Abs (_, _, body) =>
wenzelm@12784
   471
              let val tm' = subst_bound (tm2, body)
wenzelm@18940
   472
              in SOME (the_default tm' (rew2 bounds skel0 tm')) end
wenzelm@14787
   473
          | _ =>
berghofe@13195
   474
            let val (skel1, skel2) = (case skel of
berghofe@13195
   475
                skel1 $ skel2 => (skel1, skel2)
berghofe@13195
   476
              | _ => (skel0, skel0))
wenzelm@16939
   477
            in case rew1 bounds skel1 tm1 of
wenzelm@16939
   478
                SOME tm1' => (case rew1 bounds skel2 tm2 of
skalberg@15531
   479
                    SOME tm2' => SOME (tm1' $ tm2')
skalberg@15531
   480
                  | NONE => SOME (tm1' $ tm2))
wenzelm@16939
   481
              | NONE => (case rew1 bounds skel2 tm2 of
skalberg@15531
   482
                    SOME tm2' => SOME (tm1 $ tm2')
skalberg@15531
   483
                  | NONE => NONE)
berghofe@13195
   484
            end)
wenzelm@16939
   485
      | rew2 bounds skel (Abs body) =
berghofe@13195
   486
          let
wenzelm@16939
   487
            val (abs, tm') = variant_absfree bounds body;
berghofe@13195
   488
            val skel' = (case skel of Abs (_, _, skel') => skel' | _ => skel0)
wenzelm@16939
   489
          in case rew1 (bounds + 1) skel' tm' of
skalberg@15531
   490
              SOME tm'' => SOME (abs tm'')
skalberg@15531
   491
            | NONE => NONE
wenzelm@12797
   492
          end
wenzelm@16939
   493
      | rew2 _ _ _ = NONE;
wenzelm@12784
   494
wenzelm@18940
   495
  in the_default tm (rew1 0 skel0 tm) end;
wenzelm@12784
   496
clasohm@0
   497
end;
nipkow@13642
   498
nipkow@13642
   499
val trace_unify_fail = Pattern.trace_unify_fail;