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