src/Pure/pattern.ML
author wenzelm
Thu Aug 15 16:02:47 2019 +0200 (9 months ago)
changeset 70533 031620901fcd
parent 70443 a21a96eda033
permissions -rw-r--r--
support for (fully reconstructed) proof terms in Scala;
proper cache_typs;
wenzelm@12784
     1
(*  Title:      Pure/pattern.ML
wenzelm@29269
     2
    Author:     Tobias Nipkow, Christine Heinzelmann, and Stefan Berghofer, TU Muenchen
clasohm@0
     3
clasohm@0
     4
Unification of Higher-Order Patterns.
clasohm@0
     5
clasohm@0
     6
See also:
clasohm@0
     7
Tobias Nipkow. Functional Unification of Higher-Order Patterns.
clasohm@0
     8
In Proceedings of the 8th IEEE Symposium Logic in Computer Science, 1993.
nipkow@678
     9
nipkow@678
    10
TODO: optimize red by special-casing it
clasohm@0
    11
*)
clasohm@0
    12
clasohm@0
    13
signature PATTERN =
wenzelm@14787
    14
sig
wenzelm@58950
    15
  exception Unif
wenzelm@58950
    16
  exception Pattern
wenzelm@52709
    17
  val unify_trace_failure: bool Config.T
wenzelm@58950
    18
  val unify_types: Context.generic -> typ * typ -> Envir.env -> Envir.env
wenzelm@58950
    19
  val unify: Context.generic -> term * term -> Envir.env -> Envir.env
wenzelm@58950
    20
  exception MATCH
wenzelm@18182
    21
  val match: theory -> term * term -> Type.tyenv * Envir.tenv -> Type.tyenv * Envir.tenv
wenzelm@18182
    22
  val first_order_match: theory -> term * term
wenzelm@18182
    23
    -> Type.tyenv * Envir.tenv -> Type.tyenv * Envir.tenv
wenzelm@70443
    24
  val pattern: term -> bool
wenzelm@14787
    25
end;
clasohm@0
    26
wenzelm@17203
    27
structure Pattern: PATTERN =
clasohm@0
    28
struct
clasohm@0
    29
clasohm@0
    30
exception Unif;
clasohm@0
    31
exception Pattern;
clasohm@0
    32
wenzelm@69575
    33
val unify_trace_failure = Config.declare_bool ("unify_trace_failure", \<^here>) (K false);
nipkow@13642
    34
wenzelm@58950
    35
fun string_of_term ctxt env binders t =
wenzelm@58950
    36
  Syntax.string_of_term ctxt (Envir.norm_term env (subst_bounds (map Free binders, t)));
nipkow@13642
    37
haftmann@18011
    38
fun bname binders i = fst (nth binders i);
nipkow@13642
    39
fun bnames binders is = space_implode " " (map (bname binders) is);
nipkow@13642
    40
wenzelm@58950
    41
fun typ_clash context (tye,T,U) =
wenzelm@58950
    42
  if Config.get_generic context unify_trace_failure then
wenzelm@58950
    43
    let
wenzelm@58950
    44
      val ctxt = Context.proof_of context;
wenzelm@58950
    45
      val t = Syntax.string_of_typ ctxt (Envir.norm_type tye T);
wenzelm@58950
    46
      val u = Syntax.string_of_typ ctxt (Envir.norm_type tye U);
wenzelm@58950
    47
    in tracing ("The following types do not unify:\n" ^ t ^ "\n" ^ u) end
wenzelm@58950
    48
  else ();
nipkow@13642
    49
wenzelm@58950
    50
fun clash context a b =
wenzelm@58950
    51
  if Config.get_generic context unify_trace_failure
wenzelm@58950
    52
  then tracing ("Clash: " ^ a ^ " =/= " ^ b) else ();
nipkow@13642
    53
nipkow@13642
    54
fun boundVar binders i =
nipkow@13642
    55
  "bound variable " ^ bname binders i ^ " (depth " ^ string_of_int i ^ ")";
nipkow@13642
    56
wenzelm@58950
    57
fun clashBB context binders i j =
wenzelm@58950
    58
  if Config.get_generic context unify_trace_failure
wenzelm@58950
    59
  then clash context (boundVar binders i) (boundVar binders j) else ();
nipkow@13642
    60
wenzelm@58950
    61
fun clashB context binders i s =
wenzelm@58950
    62
  if Config.get_generic context unify_trace_failure
wenzelm@58950
    63
  then clash context (boundVar binders i) s else ();
nipkow@13642
    64
wenzelm@58950
    65
fun proj_fail context (env,binders,F,_,is,t) =
wenzelm@58950
    66
  if Config.get_generic context unify_trace_failure then
wenzelm@58950
    67
    let
wenzelm@58950
    68
      val ctxt = Context.proof_of context
wenzelm@58950
    69
      val f = Term.string_of_vname F
wenzelm@58950
    70
      val xs = bnames binders is
wenzelm@58950
    71
      val u = string_of_term ctxt env binders t
wenzelm@58950
    72
      val ys = bnames binders (subtract (op =) is (loose_bnos t))
wenzelm@58950
    73
    in
wenzelm@58950
    74
      tracing ("Cannot unify variable " ^ f ^
wenzelm@58950
    75
        " (depending on bound variables " ^ xs ^ ")\nwith term " ^ u ^
wenzelm@58950
    76
        "\nTerm contains additional bound variable(s) " ^ ys)
wenzelm@58950
    77
    end
wenzelm@58950
    78
  else ();
nipkow@13642
    79
wenzelm@58950
    80
fun ocheck_fail context (F,t,binders,env) =
wenzelm@58950
    81
  if Config.get_generic context unify_trace_failure then
wenzelm@58950
    82
    let
wenzelm@58950
    83
      val ctxt = Context.proof_of context
wenzelm@58950
    84
      val f = Term.string_of_vname F
wenzelm@58950
    85
      val u = string_of_term ctxt env binders t
wenzelm@58950
    86
    in tracing ("Variable " ^ f ^ " occurs in term\n" ^ u ^ "\nCannot unify!\n") end
wenzelm@58950
    87
  else ();
nipkow@13642
    88
wenzelm@12784
    89
fun occurs(F,t,env) =
wenzelm@51700
    90
    let fun occ(Var (G, T))   = (case Envir.lookup env (G, T) of
skalberg@15531
    91
                                 SOME(t) => occ t
skalberg@15531
    92
                               | NONE    => F=G)
clasohm@0
    93
          | occ(t1$t2)      = occ t1 orelse occ t2
clasohm@0
    94
          | occ(Abs(_,_,t)) = occ t
clasohm@0
    95
          | occ _           = false
clasohm@0
    96
    in occ t end;
clasohm@0
    97
clasohm@0
    98
clasohm@0
    99
fun mapbnd f =
clasohm@0
   100
    let fun mpb d (Bound(i))     = if i < d then Bound(i) else Bound(f(i-d)+d)
clasohm@0
   101
          | mpb d (Abs(s,T,t))   = Abs(s,T,mpb(d+1) t)
nipkow@678
   102
          | mpb d ((u1 $ u2))    = (mpb d u1)$(mpb d u2)
nipkow@678
   103
          | mpb _ atom           = atom
clasohm@0
   104
    in mpb 0 end;
clasohm@0
   105
berghofe@14861
   106
fun idx [] j     = raise Unif
wenzelm@16668
   107
  | idx(i::is) j = if (i:int) =j then length is else idx is j;
clasohm@0
   108
clasohm@0
   109
fun mkabs (binders,is,t)  =
haftmann@18011
   110
    let fun mk(i::is) = let val (x,T) = nth binders i
wenzelm@12784
   111
                        in Abs(x,T,mk is) end
clasohm@0
   112
          | mk []     = t
clasohm@0
   113
    in mk is end;
clasohm@0
   114
clasohm@0
   115
val incr = mapbnd (fn i => i+1);
clasohm@0
   116
clasohm@0
   117
fun ints_of []             = []
wenzelm@12784
   118
  | ints_of (Bound i ::bs) =
clasohm@0
   119
      let val is = ints_of bs
wenzelm@20672
   120
      in if member (op =) is i then raise Pattern else i::is end
clasohm@0
   121
  | ints_of _              = raise Pattern;
clasohm@0
   122
berghofe@12232
   123
fun ints_of' env ts = ints_of (map (Envir.head_norm env) ts);
berghofe@12232
   124
clasohm@0
   125
clasohm@0
   126
fun app (s,(i::is)) = app (s$Bound(i),is)
clasohm@0
   127
  | app (s,[])      = s;
clasohm@0
   128
clasohm@0
   129
fun red (Abs(_,_,s)) (i::is) js = red s is (i::js)
nipkow@678
   130
  | red t            []      [] = t
haftmann@18011
   131
  | red t            is      jn = app (mapbnd (nth jn) t,is);
nipkow@678
   132
clasohm@0
   133
clasohm@0
   134
(* split_type ([T1,....,Tn]---> T,n,[]) = ([Tn,...,T1],T) *)
clasohm@0
   135
fun split_type (T,0,Ts)                    = (Ts,T)
clasohm@0
   136
  | split_type (Type ("fun",[T1,T2]),n,Ts) = split_type (T2,n-1,T1::Ts)
wenzelm@52133
   137
  | split_type _                           = raise Fail "split_type";
clasohm@0
   138
wenzelm@32032
   139
fun type_of_G env (T, n, is) =
wenzelm@32032
   140
  let
wenzelm@32032
   141
    val tyenv = Envir.type_env env;
wenzelm@32032
   142
    val (Ts, U) = split_type (Envir.norm_type tyenv T, n, []);
haftmann@18011
   143
  in map (nth Ts) is ---> U end;
clasohm@0
   144
wenzelm@52130
   145
fun mk_hnf (binders,is,G,js) = mkabs (binders, is, app(G,js));
clasohm@0
   146
wenzelm@52130
   147
fun mk_new_hnf(env,binders,is,F as (a,_),T,js) =
berghofe@13891
   148
  let val (env',G) = Envir.genvar a (env,type_of_G env (T,length is,js))
wenzelm@52130
   149
  in Envir.update ((F, T), mk_hnf (binders, is, G, js)) env' end;
clasohm@0
   150
clasohm@0
   151
wenzelm@23222
   152
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
wenzelm@23222
   153
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
wenzelm@23222
   154
  | downto0 ([], n) = n = ~1;
wenzelm@23222
   155
wenzelm@23222
   156
(*mk_proj_list(is) = [ |is| - k | 1 <= k <= |is| and is[k] >= 0 ]*)
clasohm@0
   157
fun mk_proj_list is =
wenzelm@19502
   158
    let fun mk(i::is,j) = if is_some i then j :: mk(is,j-1) else mk(is,j-1)
clasohm@0
   159
          | mk([],_)    = []
clasohm@0
   160
    in mk(is,length is - 1) end;
clasohm@0
   161
clasohm@0
   162
fun proj(s,env,binders,is) =
clasohm@0
   163
    let fun trans d i = if i<d then i else (idx is (i-d))+d;
berghofe@12232
   164
        fun pr(s,env,d,binders) = (case Envir.head_norm env s of
clasohm@0
   165
              Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders))
clasohm@0
   166
                            in (Abs(a,T,t'),env') end
clasohm@0
   167
            | t => (case strip_comb t of
clasohm@0
   168
                (c as Const _,ts) =>
clasohm@0
   169
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   170
                         in (list_comb(c,ts'),env') end
clasohm@0
   171
                 | (f as Free _,ts) =>
clasohm@0
   172
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   173
                         in (list_comb(f,ts'),env') end
clasohm@0
   174
                 | (Bound(i),ts) =>
clasohm@0
   175
                         let val j = trans d i
berghofe@14861
   176
                             val (ts',env') = prs(ts,env,d,binders)
berghofe@14861
   177
                         in (list_comb(Bound j,ts'),env') end
clasohm@0
   178
                 | (Var(F as (a,_),Fty),ts) =>
berghofe@12232
   179
                      let val js = ints_of' env ts;
berghofe@14861
   180
                          val js' = map (try (trans d)) js;
clasohm@0
   181
                          val ks = mk_proj_list js';
wenzelm@19482
   182
                          val ls = map_filter I js'
berghofe@13891
   183
                          val Hty = type_of_G env (Fty,length js,ks)
clasohm@0
   184
                          val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   185
                          val env'' =
wenzelm@52130
   186
                            Envir.update ((F, Fty), mk_hnf (binders, js, H, ks)) env'
clasohm@0
   187
                      in (app(H,ls),env'') end
clasohm@0
   188
                 | _  => raise Pattern))
clasohm@0
   189
        and prs(s::ss,env,d,binders) =
clasohm@0
   190
              let val (s',env1) = pr(s,env,d,binders)
clasohm@0
   191
                  val (ss',env2) = prs(ss,env1,d,binders)
clasohm@0
   192
              in (s'::ss',env2) end
clasohm@0
   193
          | prs([],env,_,_) = ([],env)
clasohm@0
   194
   in if downto0(is,length binders - 1) then (s,env)
clasohm@0
   195
      else pr(s,env,0,binders)
clasohm@0
   196
   end;
clasohm@0
   197
clasohm@0
   198
clasohm@0
   199
(* mk_ff_list(is,js) = [ length(is) - k | 1 <= k <= |is| and is[k] = js[k] ] *)
wenzelm@12784
   200
fun mk_ff_list(is,js) =
wenzelm@12784
   201
    let fun mk([],[],_)        = []
wenzelm@16668
   202
          | mk(i::is,j::js, k) = if (i:int) = j then k :: mk(is,js,k-1)
clasohm@0
   203
                                        else mk(is,js,k-1)
wenzelm@52133
   204
          | mk _               = raise Fail "mk_ff_list"
clasohm@0
   205
    in mk(is,js,length is-1) end;
clasohm@0
   206
clasohm@0
   207
fun flexflex1(env,binders,F,Fty,is,js) =
clasohm@0
   208
  if is=js then env
clasohm@0
   209
  else let val ks = mk_ff_list(is,js)
wenzelm@52130
   210
       in mk_new_hnf(env,binders,is,F,Fty,ks) end;
clasohm@0
   211
clasohm@0
   212
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) =
clasohm@0
   213
  let fun ff(F,Fty,is,G as (a,_),Gty,js) =
haftmann@33038
   214
            if subset (op =) (js, is)
clasohm@0
   215
            then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js))
wenzelm@51700
   216
                 in Envir.update ((F, Fty), t) env end
haftmann@33049
   217
            else let val ks = inter (op =) js is
berghofe@13891
   218
                     val Hty = type_of_G env (Fty,length is,map (idx is) ks)
clasohm@0
   219
                     val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   220
                     fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks));
wenzelm@51700
   221
                 in Envir.update ((G, Gty), lam js) (Envir.update ((F, Fty), lam is) env')
clasohm@0
   222
                 end;
wenzelm@35408
   223
  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
clasohm@0
   224
wenzelm@58950
   225
fun unify_types context (T, U) (env as Envir.Envir {maxidx, tenv, tyenv}) =
wenzelm@32032
   226
  if T = U then env
wenzelm@32032
   227
  else
wenzelm@58950
   228
    let
wenzelm@58950
   229
      val thy = Context.theory_of context
wenzelm@58950
   230
      val (tyenv', maxidx') = Sign.typ_unify thy (U, T) (tyenv, maxidx)
wenzelm@32032
   231
    in Envir.Envir {maxidx = maxidx', tenv = tenv, tyenv = tyenv'} end
wenzelm@58950
   232
    handle Type.TUNIFY => (typ_clash context (tyenv, T, U); raise Unif);
clasohm@0
   233
wenzelm@58950
   234
fun unif context binders (s,t) env = case (Envir.head_norm env s, Envir.head_norm env t) of
clasohm@0
   235
      (Abs(ns,Ts,ts),Abs(nt,Tt,tt)) =>
clasohm@0
   236
         let val name = if ns = "" then nt else ns
wenzelm@58950
   237
         in unif context ((name,Ts)::binders) (ts,tt) (unify_types context (Ts, Tt) env) end
wenzelm@58950
   238
    | (Abs(ns,Ts,ts),t) => unif context ((ns,Ts)::binders) (ts,(incr t)$Bound(0)) env
wenzelm@58950
   239
    | (t,Abs(nt,Tt,tt)) => unif context ((nt,Tt)::binders) ((incr t)$Bound(0),tt) env
wenzelm@58950
   240
    | p => cases context (binders,env,p)
clasohm@0
   241
wenzelm@58950
   242
and cases context (binders,env,(s,t)) = case (strip_comb s,strip_comb t) of
wenzelm@12784
   243
       ((Var(F,Fty),ss),(Var(G,Gty),ts)) =>
wenzelm@52220
   244
         if F = G then flexflex1(env,binders,F,Fty,ints_of' env ss,ints_of' env ts)
wenzelm@52220
   245
                  else flexflex2(env,binders,F,Fty,ints_of' env ss,G,Gty,ints_of' env ts)
wenzelm@58950
   246
      | ((Var(F,Fty),ss),_)           => flexrigid context (env,binders,F,Fty,ints_of' env ss,t)
wenzelm@58950
   247
      | (_,(Var(F,Fty),ts))           => flexrigid context (env,binders,F,Fty,ints_of' env ts,s)
wenzelm@58950
   248
      | ((Const c,ss),(Const d,ts))   => rigidrigid context (env,binders,c,d,ss,ts)
wenzelm@58950
   249
      | ((Free(f),ss),(Free(g),ts))   => rigidrigid context (env,binders,f,g,ss,ts)
wenzelm@58950
   250
      | ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB context (env,binders,i,j,ss,ts)
clasohm@0
   251
      | ((Abs(_),_),_)                => raise Pattern
clasohm@0
   252
      | (_,(Abs(_),_))                => raise Pattern
wenzelm@58950
   253
      | ((Const(c,_),_),(Free(f,_),_)) => (clash context c f; raise Unif)
wenzelm@58950
   254
      | ((Const(c,_),_),(Bound i,_))   => (clashB context binders i c; raise Unif)
wenzelm@58950
   255
      | ((Free(f,_),_),(Const(c,_),_)) => (clash context f c; raise Unif)
wenzelm@58950
   256
      | ((Free(f,_),_),(Bound i,_))    => (clashB context binders i f; raise Unif)
wenzelm@58950
   257
      | ((Bound i,_),(Const(c,_),_))   => (clashB context binders i c; raise Unif)
wenzelm@58950
   258
      | ((Bound i,_),(Free(f,_),_))    => (clashB context binders i f; raise Unif)
nipkow@13642
   259
clasohm@0
   260
wenzelm@58950
   261
and rigidrigid context (env,binders,(a,Ta),(b,Tb),ss,ts) =
wenzelm@58950
   262
      if a<>b then (clash context a b; raise Unif)
wenzelm@58950
   263
      else env |> unify_types context (Ta,Tb) |> fold (unif context binders) (ss~~ts)
clasohm@0
   264
wenzelm@58950
   265
and rigidrigidB context (env,binders,i,j,ss,ts) =
wenzelm@58950
   266
     if i <> j then (clashBB context binders i j; raise Unif)
wenzelm@58950
   267
     else fold (unif context binders) (ss~~ts) env
clasohm@0
   268
wenzelm@58950
   269
and flexrigid context (params as (env,binders,F,Fty,is,t)) =
wenzelm@58950
   270
      if occurs(F,t,env) then (ocheck_fail context (F,t,binders,env); raise Unif)
nipkow@13642
   271
      else (let val (u,env') = proj(t,env,binders,is)
wenzelm@51700
   272
            in Envir.update ((F, Fty), mkabs (binders, is, u)) env' end
wenzelm@58950
   273
            handle Unif => (proj_fail context params; raise Unif));
clasohm@0
   274
wenzelm@58950
   275
fun unify context = unif context [];
clasohm@0
   276
clasohm@0
   277
nipkow@678
   278
nipkow@4820
   279
(*** Matching ***)
nipkow@4820
   280
nipkow@4820
   281
exception MATCH;
nipkow@4820
   282
wenzelm@18182
   283
fun typ_match thy TU tyenv = Sign.typ_match thy TU tyenv
wenzelm@16939
   284
  handle Type.TYPE_MATCH => raise MATCH;
nipkow@4820
   285
nipkow@4820
   286
(*First-order matching;
nipkow@4820
   287
  The pattern and object may have variables in common.
nipkow@4820
   288
  Instantiation does not affect the object, so matching ?a with ?a+1 works.
nipkow@4820
   289
  Object is eta-contracted on the fly (by eta-expanding the pattern).
nipkow@4820
   290
  Precondition: the pattern is already eta-contracted!
nipkow@63718
   291
  Types are matched on the fly.
nipkow@63718
   292
  The parameter inAbs is an optimization to avoid calling is_open;
nipkow@63718
   293
  it has the funny consequence that outside abstractions
nipkow@63718
   294
  ?x matches terms containing loose Bounds.
nipkow@63718
   295
*)
wenzelm@18182
   296
fun first_order_match thy =
nipkow@4820
   297
  let
nipkow@63718
   298
    fun mtch inAbs (instsp as (tyinsts,insts)) = fn
nipkow@4820
   299
        (Var(ixn,T), t)  =>
nipkow@63718
   300
          if inAbs andalso Term.is_open t then raise MATCH
wenzelm@51700
   301
          else (case Envir.lookup1 insts (ixn, T) of
wenzelm@18182
   302
                  NONE => (typ_match thy (T, fastype_of t) tyinsts,
wenzelm@17412
   303
                           Vartab.update_new (ixn, (T, t)) insts)
wenzelm@52131
   304
                | SOME u => if Envir.aeconv (t, u) then instsp else raise MATCH)
nipkow@4820
   305
      | (Free (a,T), Free (b,U)) =>
wenzelm@18182
   306
          if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH
nipkow@4820
   307
      | (Const (a,T), Const (b,U))  =>
wenzelm@18182
   308
          if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH
nipkow@4820
   309
      | (Bound i, Bound j)  =>  if  i=j  then  instsp  else raise MATCH
nipkow@4820
   310
      | (Abs(_,T,t), Abs(_,U,u))  =>
nipkow@63718
   311
          mtch true (typ_match thy (T,U) tyinsts, insts) (t,u)
nipkow@63718
   312
      | (f$t, g$u) => mtch inAbs (mtch inAbs instsp (f,g)) (t, u)
nipkow@63718
   313
      | (t, Abs(_,U,u))  =>  mtch true instsp ((incr t)$(Bound 0), u)
nipkow@4820
   314
      | _ => raise MATCH
nipkow@63718
   315
  in fn tu => fn env => mtch false env tu end;
nipkow@4820
   316
berghofe@8406
   317
nipkow@4820
   318
(* Matching of higher-order patterns *)
nipkow@4820
   319
berghofe@15797
   320
fun match_bind(itms,binders,ixn,T,is,t) =
nipkow@4820
   321
  let val js = loose_bnos t
nipkow@4820
   322
  in if null is
wenzelm@17412
   323
     then if null js then Vartab.update_new (ixn, (T, t)) itms else raise MATCH
haftmann@33038
   324
     else if subset (op =) (js, is)
nipkow@4820
   325
          then let val t' = if downto0(is,length binders - 1) then t
nipkow@4820
   326
                            else mapbnd (idx is) t
wenzelm@17412
   327
               in Vartab.update_new (ixn, (T, mkabs (binders, is, t'))) itms end
nipkow@4820
   328
          else raise MATCH
nipkow@4820
   329
  end;
nipkow@4820
   330
wenzelm@18182
   331
fun match thy (po as (pat,obj)) envir =
nipkow@678
   332
let
nipkow@4820
   333
  (* Pre: pat and obj have same type *)
wenzelm@18182
   334
  fun mtch binders (pat,obj) (env as (iTs,itms)) =
nipkow@4820
   335
    case pat of
nipkow@4820
   336
      Abs(ns,Ts,ts) =>
nipkow@4820
   337
        (case obj of
wenzelm@18182
   338
           Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (ts,tt) env
wenzelm@32035
   339
         | _ => let val Tt = Envir.subst_type iTs Ts
wenzelm@18182
   340
                in mtch((ns,Tt)::binders) (ts,(incr obj)$Bound(0)) env end)
nipkow@4820
   341
    | _ => (case obj of
nipkow@4820
   342
              Abs(nt,Tt,tt) =>
wenzelm@18182
   343
                mtch((nt,Tt)::binders) ((incr pat)$Bound(0),tt) env
nipkow@4820
   344
            | _ => cases(binders,env,pat,obj))
nipkow@678
   345
nipkow@4820
   346
  and cases(binders,env as (iTs,itms),pat,obj) =
nipkow@4820
   347
    let val (ph,pargs) = strip_comb pat
wenzelm@18182
   348
        fun rigrig1(iTs,oargs) = fold (mtch binders) (pargs~~oargs) (iTs,itms)
wenzelm@41067
   349
          handle ListPair.UnequalLengths => raise MATCH
wenzelm@16668
   350
        fun rigrig2((a:string,Ta),(b,Tb),oargs) =
wenzelm@16668
   351
              if a <> b then raise MATCH
wenzelm@18182
   352
              else rigrig1(typ_match thy (Ta,Tb) iTs, oargs)
nipkow@4820
   353
    in case ph of
berghofe@15797
   354
         Var(ixn,T) =>
nipkow@4820
   355
           let val is = ints_of pargs
wenzelm@51700
   356
           in case Envir.lookup1 itms (ixn, T) of
berghofe@15797
   357
                NONE => (iTs,match_bind(itms,binders,ixn,T,is,obj))
wenzelm@52131
   358
              | SOME u => if Envir.aeconv (obj, red u is []) then env
nipkow@4820
   359
                          else raise MATCH
nipkow@4820
   360
           end
nipkow@4820
   361
       | _ =>
nipkow@4820
   362
           let val (oh,oargs) = strip_comb obj
nipkow@4820
   363
           in case (ph,oh) of
nipkow@4820
   364
                (Const c,Const d) => rigrig2(c,d,oargs)
nipkow@4820
   365
              | (Free f,Free g)   => rigrig2(f,g,oargs)
nipkow@4820
   366
              | (Bound i,Bound j) => if i<>j then raise MATCH
nipkow@4820
   367
                                     else rigrig1(iTs,oargs)
nipkow@4820
   368
              | (Abs _, _)        => raise Pattern
nipkow@4820
   369
              | (_, Abs _)        => raise Pattern
nipkow@4820
   370
              | _                 => raise MATCH
nipkow@4820
   371
           end
nipkow@4820
   372
    end;
nipkow@678
   373
nipkow@4820
   374
  val pT = fastype_of pat
nipkow@4820
   375
  and oT = fastype_of obj
wenzelm@18182
   376
  val envir' = apfst (typ_match thy (pT, oT)) envir;
wenzelm@18182
   377
in mtch [] po envir' handle Pattern => first_order_match thy po envir' end;
clasohm@0
   378
wenzelm@70443
   379
wenzelm@70443
   380
fun pattern (Abs (_, _, t)) = pattern t
wenzelm@70443
   381
  | pattern t =
wenzelm@70443
   382
      let val (head, args) = strip_comb t in
wenzelm@70443
   383
        if is_Var head then
wenzelm@70443
   384
          forall is_Bound args andalso not (has_duplicates (op aconv) args)
wenzelm@70443
   385
        else forall pattern args
wenzelm@70443
   386
      end;
clasohm@0
   387
end;