src/Pure/pattern.ML
author berghofe
Tue Jun 01 15:02:05 2004 +0200 (2004-06-01)
changeset 14861 ca5cae7fb65a
parent 14787 724ce6e574e3
child 14875 c48d086264c4
permissions -rw-r--r--
Removed ~10000 hack in function idx that can lead to inconsistencies
when unifying terms with a large number of abstractions.
wenzelm@12784
     1
(*  Title:      Pure/pattern.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@12784
     3
    Author:     Tobias Nipkow, Christine Heinzelmann, and Stefan Berghofer
wenzelm@12784
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
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 =
wenzelm@14787
    18
sig
nipkow@13642
    19
  val trace_unify_fail  : bool ref
paulson@2751
    20
  val aeconv            : term * term -> bool
paulson@2725
    21
  val eta_contract      : term -> term
berghofe@13998
    22
  val eta_long          : typ list -> term -> term
wenzelm@12781
    23
  val beta_eta_contract : term -> term
paulson@2725
    24
  val eta_contract_atom : term -> term
wenzelm@14787
    25
  val match             : Type.tsig -> term * term
paulson@2725
    26
                          -> (indexname*typ)list * (indexname*term)list
wenzelm@14787
    27
  val first_order_match : Type.tsig -> term * term
nipkow@4820
    28
                          -> (indexname*typ)list * (indexname*term)list
wenzelm@14787
    29
  val matches           : Type.tsig -> term * term -> bool
wenzelm@14787
    30
  val matches_subterm   : Type.tsig -> term * term -> bool
wenzelm@14787
    31
  val unify             : Sign.sg * Envir.env * (term * term)list -> Envir.env
nipkow@4820
    32
  val first_order       : term -> bool
nipkow@4820
    33
  val pattern           : term -> bool
wenzelm@14787
    34
  val rewrite_term      : Type.tsig -> (term * term) list -> (term -> term option) list
berghofe@13195
    35
                          -> term -> term
clasohm@0
    36
  exception Unif
clasohm@0
    37
  exception MATCH
clasohm@0
    38
  exception Pattern
wenzelm@14787
    39
end;
clasohm@0
    40
paulson@1501
    41
structure Pattern : PATTERN =
clasohm@0
    42
struct
clasohm@0
    43
clasohm@0
    44
exception Unif;
clasohm@0
    45
exception Pattern;
clasohm@0
    46
nipkow@13642
    47
val trace_unify_fail = ref false;
nipkow@13642
    48
nipkow@13642
    49
(* Only for communication between unification and error message printing *)
nipkow@13642
    50
val sgr = ref Sign.pre_pure
nipkow@13642
    51
nipkow@13642
    52
fun string_of_term env binders t = Sign.string_of_term (!sgr)
nipkow@13642
    53
  (Envir.norm_term env (subst_bounds(map Free binders,t)));
nipkow@13642
    54
nipkow@13642
    55
fun bname binders i = fst(nth_elem(i,binders));
nipkow@13642
    56
fun bnames binders is = space_implode " " (map (bname binders) is);
nipkow@13642
    57
nipkow@13642
    58
fun typ_clash(tye,T,U) =
nipkow@13642
    59
  if !trace_unify_fail
berghofe@13645
    60
  then let val t = Sign.string_of_typ (!sgr) (Envir.norm_type tye T)
berghofe@13645
    61
           and u = Sign.string_of_typ (!sgr) (Envir.norm_type tye U)
nipkow@13642
    62
       in tracing("The following types do not unify:\n" ^ t ^ "\n" ^ u) end
nipkow@13642
    63
  else ()
nipkow@13642
    64
nipkow@13642
    65
fun clash a b =
nipkow@13642
    66
  if !trace_unify_fail then tracing("Clash: " ^ a ^ " =/= " ^ b) else ()
nipkow@13642
    67
nipkow@13642
    68
fun boundVar binders i =
nipkow@13642
    69
  "bound variable " ^ bname binders i ^ " (depth " ^ string_of_int i ^ ")";
nipkow@13642
    70
nipkow@13642
    71
fun clashBB binders i j =
nipkow@13642
    72
  if !trace_unify_fail then clash (boundVar binders i) (boundVar binders j)
nipkow@13642
    73
  else ()
nipkow@13642
    74
nipkow@13642
    75
fun clashB binders i s =
nipkow@13642
    76
  if !trace_unify_fail then clash (boundVar binders i) s
nipkow@13642
    77
  else ()
nipkow@13642
    78
nipkow@13642
    79
fun proj_fail(env,binders,F,is,t) =
nipkow@13642
    80
  if !trace_unify_fail
nipkow@13642
    81
  then let val f = Syntax.string_of_vname F
nipkow@13642
    82
           val xs = bnames binders is
nipkow@13642
    83
           val u = string_of_term env binders t
nipkow@13642
    84
           val ys = bnames binders (loose_bnos t \\ is)
nipkow@13642
    85
       in tracing("Cannot unify variable " ^ f ^
nipkow@13642
    86
               " (depending on bound variables " ^ xs ^ ")\nwith term " ^ u ^
nipkow@13642
    87
               "\nTerm contains additional bound variable(s) " ^ ys)
nipkow@13642
    88
       end
nipkow@13642
    89
  else ()
nipkow@13642
    90
nipkow@13642
    91
fun ocheck_fail(F,t,binders,env) =
nipkow@13642
    92
  if !trace_unify_fail
nipkow@13642
    93
  then let val f = Syntax.string_of_vname F
nipkow@13642
    94
           val u = string_of_term env binders t
nipkow@13642
    95
       in tracing("Variable " ^ f ^ " occurs in term\n" ^ u ^
nipkow@13642
    96
                  "\nCannot unify!\n")
nipkow@13642
    97
       end
nipkow@13642
    98
  else ()
nipkow@13642
    99
wenzelm@12784
   100
fun occurs(F,t,env) =
clasohm@0
   101
    let fun occ(Var(G,_))   = (case Envir.lookup(env,G) of
clasohm@0
   102
                                 Some(t) => occ t
clasohm@0
   103
                               | None    => F=G)
clasohm@0
   104
          | occ(t1$t2)      = occ t1 orelse occ t2
clasohm@0
   105
          | occ(Abs(_,_,t)) = occ t
clasohm@0
   106
          | occ _           = false
clasohm@0
   107
    in occ t end;
clasohm@0
   108
clasohm@0
   109
clasohm@0
   110
fun mapbnd f =
clasohm@0
   111
    let fun mpb d (Bound(i))     = if i < d then Bound(i) else Bound(f(i-d)+d)
clasohm@0
   112
          | mpb d (Abs(s,T,t))   = Abs(s,T,mpb(d+1) t)
nipkow@678
   113
          | mpb d ((u1 $ u2))    = (mpb d u1)$(mpb d u2)
nipkow@678
   114
          | mpb _ atom           = atom
clasohm@0
   115
    in mpb 0 end;
clasohm@0
   116
berghofe@14861
   117
fun idx [] j     = raise Unif
clasohm@0
   118
  | idx(i::is) j = if i=j then length is else idx is j;
clasohm@0
   119
clasohm@0
   120
fun at xs i = nth_elem (i,xs);
clasohm@0
   121
clasohm@0
   122
fun mkabs (binders,is,t)  =
clasohm@0
   123
    let fun mk(i::is) = let val (x,T) = nth_elem(i,binders)
wenzelm@12784
   124
                        in Abs(x,T,mk is) end
clasohm@0
   125
          | mk []     = t
clasohm@0
   126
    in mk is end;
clasohm@0
   127
clasohm@0
   128
val incr = mapbnd (fn i => i+1);
clasohm@0
   129
clasohm@0
   130
fun ints_of []             = []
wenzelm@12784
   131
  | ints_of (Bound i ::bs) =
clasohm@0
   132
      let val is = ints_of bs
berghofe@1576
   133
      in if i mem_int is then raise Pattern else i::is end
clasohm@0
   134
  | ints_of _              = raise Pattern;
clasohm@0
   135
berghofe@12232
   136
fun ints_of' env ts = ints_of (map (Envir.head_norm env) ts);
berghofe@12232
   137
clasohm@0
   138
clasohm@0
   139
fun app (s,(i::is)) = app (s$Bound(i),is)
clasohm@0
   140
  | app (s,[])      = s;
clasohm@0
   141
clasohm@0
   142
fun red (Abs(_,_,s)) (i::is) js = red s is (i::js)
nipkow@678
   143
  | red t            []      [] = t
nipkow@678
   144
  | red t            is      jn = app (mapbnd (at jn) t,is);
nipkow@678
   145
clasohm@0
   146
clasohm@0
   147
(* split_type ([T1,....,Tn]---> T,n,[]) = ([Tn,...,T1],T) *)
clasohm@0
   148
fun split_type (T,0,Ts)                    = (Ts,T)
clasohm@0
   149
  | split_type (Type ("fun",[T1,T2]),n,Ts) = split_type (T2,n-1,T1::Ts)
nipkow@678
   150
  | split_type _                           = error("split_type");
clasohm@0
   151
berghofe@13891
   152
fun type_of_G (env as Envir.Envir {iTs, ...}) (T,n,is) =
berghofe@13891
   153
  let val (Ts, U) = split_type (Envir.norm_type iTs T, n, [])
berghofe@13891
   154
  in map (at Ts) is ---> U end;
clasohm@0
   155
clasohm@0
   156
fun mkhnf (binders,is,G,js) = mkabs (binders, is, app(G,js));
clasohm@0
   157
clasohm@0
   158
fun mknewhnf(env,binders,is,F as (a,_),T,js) =
berghofe@13891
   159
  let val (env',G) = Envir.genvar a (env,type_of_G env (T,length is,js))
clasohm@0
   160
  in Envir.update((F,mkhnf(binders,is,G,js)),env') end;
clasohm@0
   161
clasohm@0
   162
clasohm@0
   163
(* mk_proj_list(is) = [ |is| - k | 1 <= k <= |is| and is[k] >= 0 ] *)
clasohm@0
   164
fun mk_proj_list is =
berghofe@14861
   165
    let fun mk(i::is,j) = if is_some i then j :: mk(is,j-1) else mk(is,j-1)
clasohm@0
   166
          | mk([],_)    = []
clasohm@0
   167
    in mk(is,length is - 1) end;
clasohm@0
   168
clasohm@0
   169
fun proj(s,env,binders,is) =
clasohm@0
   170
    let fun trans d i = if i<d then i else (idx is (i-d))+d;
berghofe@12232
   171
        fun pr(s,env,d,binders) = (case Envir.head_norm env s of
clasohm@0
   172
              Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders))
clasohm@0
   173
                            in (Abs(a,T,t'),env') end
clasohm@0
   174
            | t => (case strip_comb t of
clasohm@0
   175
                (c as Const _,ts) =>
clasohm@0
   176
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   177
                         in (list_comb(c,ts'),env') end
clasohm@0
   178
                 | (f as Free _,ts) =>
clasohm@0
   179
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   180
                         in (list_comb(f,ts'),env') end
clasohm@0
   181
                 | (Bound(i),ts) =>
clasohm@0
   182
                         let val j = trans d i
berghofe@14861
   183
                             val (ts',env') = prs(ts,env,d,binders)
berghofe@14861
   184
                         in (list_comb(Bound j,ts'),env') end
clasohm@0
   185
                 | (Var(F as (a,_),Fty),ts) =>
berghofe@12232
   186
                      let val js = ints_of' env ts;
berghofe@14861
   187
                          val js' = map (try (trans d)) js;
clasohm@0
   188
                          val ks = mk_proj_list js';
berghofe@14861
   189
                          val ls = mapfilter I js'
berghofe@13891
   190
                          val Hty = type_of_G env (Fty,length js,ks)
clasohm@0
   191
                          val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   192
                          val env'' =
clasohm@0
   193
                                Envir.update((F,mkhnf(binders,js,H,ks)),env')
clasohm@0
   194
                      in (app(H,ls),env'') end
clasohm@0
   195
                 | _  => raise Pattern))
clasohm@0
   196
        and prs(s::ss,env,d,binders) =
clasohm@0
   197
              let val (s',env1) = pr(s,env,d,binders)
clasohm@0
   198
                  val (ss',env2) = prs(ss,env1,d,binders)
clasohm@0
   199
              in (s'::ss',env2) end
clasohm@0
   200
          | prs([],env,_,_) = ([],env)
clasohm@0
   201
   in if downto0(is,length binders - 1) then (s,env)
clasohm@0
   202
      else pr(s,env,0,binders)
clasohm@0
   203
   end;
clasohm@0
   204
clasohm@0
   205
clasohm@0
   206
(* mk_ff_list(is,js) = [ length(is) - k | 1 <= k <= |is| and is[k] = js[k] ] *)
wenzelm@12784
   207
fun mk_ff_list(is,js) =
wenzelm@12784
   208
    let fun mk([],[],_)        = []
clasohm@0
   209
          | mk(i::is,j::js, k) = if i=j then k :: mk(is,js,k-1)
clasohm@0
   210
                                        else mk(is,js,k-1)
nipkow@678
   211
          | mk _               = error"mk_ff_list"
clasohm@0
   212
    in mk(is,js,length is-1) end;
clasohm@0
   213
clasohm@0
   214
fun flexflex1(env,binders,F,Fty,is,js) =
clasohm@0
   215
  if is=js then env
clasohm@0
   216
  else let val ks = mk_ff_list(is,js)
clasohm@0
   217
       in mknewhnf(env,binders,is,F,Fty,ks) end;
clasohm@0
   218
clasohm@0
   219
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) =
clasohm@0
   220
  let fun ff(F,Fty,is,G as (a,_),Gty,js) =
berghofe@1576
   221
            if js subset_int is
clasohm@0
   222
            then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js))
clasohm@0
   223
                 in Envir.update((F,t),env) end
berghofe@1576
   224
            else let val ks = is inter_int js
berghofe@13891
   225
                     val Hty = type_of_G env (Fty,length is,map (idx is) ks)
clasohm@0
   226
                     val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   227
                     fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks));
clasohm@0
   228
                 in Envir.update((G,lam js), Envir.update((F,lam is),env'))
clasohm@0
   229
                 end;
clasohm@0
   230
  in if xless(G,F) then ff(F,Fty,is,G,Gty,js) else ff(G,Gty,js,F,Fty,is) end
clasohm@0
   231
wenzelm@14787
   232
val tsgr = ref(Type.empty_tsig);
clasohm@0
   233
clasohm@0
   234
fun unify_types(T,U, env as Envir.Envir{asol,iTs,maxidx}) =
clasohm@0
   235
  if T=U then env
wenzelm@12527
   236
  else let val (iTs',maxidx') = Type.unify (!tsgr) (iTs, maxidx) (U, T)
nipkow@1435
   237
       in Envir.Envir{asol=asol,maxidx=maxidx',iTs=iTs'} end
nipkow@13642
   238
       handle Type.TUNIFY => (typ_clash(iTs,T,U); raise Unif);
clasohm@0
   239
berghofe@12232
   240
fun unif binders (env,(s,t)) = case (Envir.head_norm env s, Envir.head_norm env t) of
clasohm@0
   241
      (Abs(ns,Ts,ts),Abs(nt,Tt,tt)) =>
clasohm@0
   242
         let val name = if ns = "" then nt else ns
clasohm@0
   243
         in unif ((name,Ts)::binders) (env,(ts,tt)) end
clasohm@0
   244
    | (Abs(ns,Ts,ts),t) => unif ((ns,Ts)::binders) (env,(ts,(incr t)$Bound(0)))
clasohm@0
   245
    | (t,Abs(nt,Tt,tt)) => unif ((nt,Tt)::binders) (env,((incr t)$Bound(0),tt))
clasohm@0
   246
    | p => cases(binders,env,p)
clasohm@0
   247
clasohm@0
   248
and cases(binders,env,(s,t)) = case (strip_comb s,strip_comb t) of
wenzelm@12784
   249
       ((Var(F,Fty),ss),(Var(G,Gty),ts)) =>
berghofe@12232
   250
         if F = G then flexflex1(env,binders,F,Fty,ints_of' env ss,ints_of' env ts)
berghofe@12232
   251
                  else flexflex2(env,binders,F,Fty,ints_of' env ss,G,Gty,ints_of' env ts)
berghofe@12232
   252
      | ((Var(F,_),ss),_)             => flexrigid(env,binders,F,ints_of' env ss,t)
berghofe@12232
   253
      | (_,(Var(F,_),ts))             => flexrigid(env,binders,F,ints_of' env ts,s)
clasohm@0
   254
      | ((Const c,ss),(Const d,ts))   => rigidrigid(env,binders,c,d,ss,ts)
clasohm@0
   255
      | ((Free(f),ss),(Free(g),ts))   => rigidrigid(env,binders,f,g,ss,ts)
wenzelm@12784
   256
      | ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB (env,binders,i,j,ss,ts)
clasohm@0
   257
      | ((Abs(_),_),_)                => raise Pattern
clasohm@0
   258
      | (_,(Abs(_),_))                => raise Pattern
nipkow@13642
   259
      | ((Const(c,_),_),(Free(f,_),_)) => (clash c f; raise Unif)
nipkow@13642
   260
      | ((Const(c,_),_),(Bound i,_))   => (clashB binders i c; raise Unif)
nipkow@13642
   261
      | ((Free(f,_),_),(Const(c,_),_)) => (clash f c; raise Unif)
nipkow@13642
   262
      | ((Free(f,_),_),(Bound i,_))    => (clashB binders i f; raise Unif)
nipkow@13642
   263
      | ((Bound i,_),(Const(c,_),_))   => (clashB binders i c; raise Unif)
nipkow@13642
   264
      | ((Bound i,_),(Free(f,_),_))    => (clashB binders i f; raise Unif)
nipkow@13642
   265
clasohm@0
   266
clasohm@0
   267
and rigidrigid (env,binders,(a,Ta),(b,Tb),ss,ts) =
nipkow@13642
   268
      if a<>b then (clash a b; raise Unif)
clasohm@0
   269
      else foldl (unif binders) (unify_types(Ta,Tb,env), ss~~ts)
clasohm@0
   270
clasohm@0
   271
and rigidrigidB (env,binders,i,j,ss,ts) =
nipkow@13642
   272
     if i <> j then (clashBB binders i j; raise Unif)
nipkow@13642
   273
     else foldl (unif binders) (env ,ss~~ts)
clasohm@0
   274
nipkow@13642
   275
and flexrigid (params as (env,binders,F,is,t)) =
nipkow@13642
   276
      if occurs(F,t,env) then (ocheck_fail(F,t,binders,env); raise Unif)
nipkow@13642
   277
      else (let val (u,env') = proj(t,env,binders,is)
nipkow@13642
   278
            in Envir.update((F,mkabs(binders,is,u)),env') end
nipkow@13642
   279
            handle Unif => (proj_fail params; raise Unif));
clasohm@0
   280
wenzelm@14643
   281
fun unify(sg,env,tus) = (sgr := sg; tsgr := Sign.tsig_of sg;
clasohm@0
   282
                         foldl (unif []) (env,tus));
clasohm@0
   283
clasohm@0
   284
paulson@2725
   285
(*Eta-contract a term (fully)*)
nipkow@2792
   286
wenzelm@12797
   287
fun eta_contract t =
wenzelm@12797
   288
  let
wenzelm@12797
   289
    exception SAME;
wenzelm@14787
   290
    fun eta (Abs (a, T, body)) =
wenzelm@12797
   291
      ((case eta body of
wenzelm@14787
   292
          body' as (f $ Bound 0) =>
wenzelm@14787
   293
            if loose_bvar1 (f, 0) then Abs(a, T, body')
wenzelm@14787
   294
            else incr_boundvars ~1 f
wenzelm@12797
   295
        | body' => Abs (a, T, body')) handle SAME =>
wenzelm@12797
   296
       (case body of
wenzelm@14787
   297
          (f $ Bound 0) =>
wenzelm@14787
   298
            if loose_bvar1 (f, 0) then raise SAME
wenzelm@14787
   299
            else incr_boundvars ~1 f
wenzelm@12797
   300
        | _ => raise SAME))
wenzelm@12797
   301
      | eta (f $ t) =
wenzelm@12797
   302
          (let val f' = eta f
wenzelm@12797
   303
           in f' $ etah t end handle SAME => f $ eta t)
wenzelm@12797
   304
      | eta _ = raise SAME
wenzelm@12797
   305
    and etah t = (eta t handle SAME => t)
wenzelm@12797
   306
  in etah t end;
clasohm@0
   307
wenzelm@12781
   308
val beta_eta_contract = eta_contract o Envir.beta_norm;
wenzelm@12781
   309
nipkow@6539
   310
(*Eta-contract a term from outside: just enough to reduce it to an atom
nipkow@6539
   311
DOESN'T QUITE WORK!
nipkow@6539
   312
*)
wenzelm@12784
   313
fun eta_contract_atom (t0 as Abs(a, T, body)) =
paulson@2725
   314
      (case  eta_contract2 body  of
wenzelm@12784
   315
        body' as (f $ Bound 0) =>
wenzelm@12784
   316
            if loose_bvar1(f,0) then Abs(a,T,body')
wenzelm@12784
   317
            else eta_contract_atom (incr_boundvars ~1 f)
paulson@2725
   318
      | _ => t0)
paulson@2725
   319
  | eta_contract_atom t = t
paulson@2725
   320
and eta_contract2 (f$t) = f $ eta_contract_atom t
paulson@2725
   321
  | eta_contract2 t     = eta_contract_atom t;
paulson@2725
   322
berghofe@13998
   323
(* put a term into eta long beta normal form *)
berghofe@13998
   324
fun eta_long Ts (Abs (s, T, t)) = Abs (s, T, eta_long (T :: Ts) t)
berghofe@13998
   325
  | eta_long Ts t = (case strip_comb t of
berghofe@13998
   326
      (Abs _, _) => eta_long Ts (Envir.beta_norm t)
wenzelm@14787
   327
    | (u, ts) =>
berghofe@13998
   328
      let
berghofe@13998
   329
        val Us = binder_types (fastype_of1 (Ts, t));
berghofe@13998
   330
        val i = length Us
berghofe@13998
   331
      in list_abs (map (pair "x") Us,
berghofe@13998
   332
        list_comb (incr_boundvars i u, map (eta_long (rev Us @ Ts))
berghofe@13998
   333
          (map (incr_boundvars i) ts @ map Bound (i - 1 downto 0))))
berghofe@13998
   334
      end);
berghofe@13998
   335
paulson@2725
   336
nipkow@678
   337
(*Tests whether 2 terms are alpha/eta-convertible and have same type.
nipkow@678
   338
  Note that Consts and Vars may have more than one type.*)
paulson@2751
   339
fun t aeconv u = aconv_aux (eta_contract_atom t, eta_contract_atom u)
paulson@2751
   340
and aconv_aux (Const(a,T), Const(b,U)) = a=b  andalso  T=U
paulson@2751
   341
  | aconv_aux (Free(a,T),  Free(b,U))  = a=b  andalso  T=U
paulson@2751
   342
  | aconv_aux (Var(v,T),   Var(w,U))   = eq_ix(v,w) andalso  T=U
wenzelm@12784
   343
  | aconv_aux (Bound i,    Bound j)    = i=j
paulson@2751
   344
  | aconv_aux (Abs(_,T,t), Abs(_,U,u)) = (t aeconv u)  andalso  T=U
wenzelm@12784
   345
  | aconv_aux (f$t,        g$u)        = (f aeconv g)  andalso (t aeconv u)
paulson@2751
   346
  | aconv_aux _ =  false;
nipkow@678
   347
nipkow@678
   348
nipkow@4820
   349
(*** Matching ***)
nipkow@4820
   350
nipkow@4820
   351
exception MATCH;
nipkow@4820
   352
nipkow@4820
   353
fun typ_match tsig args = (Type.typ_match tsig args)
nipkow@4820
   354
                          handle Type.TYPE_MATCH => raise MATCH;
nipkow@4820
   355
nipkow@4820
   356
(*First-order matching;
nipkow@4820
   357
  fomatch tsig (pattern, object) returns a (tyvar,typ)list and (var,term)list.
nipkow@4820
   358
  The pattern and object may have variables in common.
nipkow@4820
   359
  Instantiation does not affect the object, so matching ?a with ?a+1 works.
nipkow@4820
   360
  Object is eta-contracted on the fly (by eta-expanding the pattern).
nipkow@4820
   361
  Precondition: the pattern is already eta-contracted!
nipkow@4820
   362
  Note: types are matched on the fly *)
nipkow@4820
   363
fun fomatch tsig =
nipkow@4820
   364
  let
nipkow@4820
   365
    fun mtch (instsp as (tyinsts,insts)) = fn
nipkow@4820
   366
        (Var(ixn,T), t)  =>
wenzelm@12784
   367
          if loose_bvar(t,0) then raise MATCH
wenzelm@12784
   368
          else (case assoc_string_int(insts,ixn) of
wenzelm@12784
   369
                  None => (typ_match tsig (tyinsts, (T, fastype_of t)),
wenzelm@12784
   370
                           (ixn,t)::insts)
wenzelm@12784
   371
                | Some u => if t aeconv u then instsp else raise MATCH)
nipkow@4820
   372
      | (Free (a,T), Free (b,U)) =>
wenzelm@12784
   373
          if a=b then (typ_match tsig (tyinsts,(T,U)), insts) else raise MATCH
nipkow@4820
   374
      | (Const (a,T), Const (b,U))  =>
wenzelm@12784
   375
          if a=b then (typ_match tsig (tyinsts,(T,U)), insts) else raise MATCH
nipkow@4820
   376
      | (Bound i, Bound j)  =>  if  i=j  then  instsp  else raise MATCH
nipkow@4820
   377
      | (Abs(_,T,t), Abs(_,U,u))  =>
wenzelm@12784
   378
          mtch (typ_match tsig (tyinsts,(T,U)),insts) (t,u)
nipkow@4820
   379
      | (f$t, g$u) => mtch (mtch instsp (f,g)) (t, u)
nipkow@4820
   380
      | (t, Abs(_,U,u))  =>  mtch instsp ((incr t)$(Bound 0), u)
nipkow@4820
   381
      | _ => raise MATCH
nipkow@4820
   382
  in mtch end;
nipkow@4820
   383
berghofe@8406
   384
fun first_order_match tsig = apfst Vartab.dest o fomatch tsig (Vartab.empty, []);
berghofe@8406
   385
nipkow@4820
   386
(* Matching of higher-order patterns *)
nipkow@4820
   387
nipkow@4820
   388
fun match_bind(itms,binders,ixn,is,t) =
nipkow@4820
   389
  let val js = loose_bnos t
nipkow@4820
   390
  in if null is
nipkow@4820
   391
     then if null js then (ixn,t)::itms else raise MATCH
nipkow@4820
   392
     else if js subset_int is
nipkow@4820
   393
          then let val t' = if downto0(is,length binders - 1) then t
nipkow@4820
   394
                            else mapbnd (idx is) t
nipkow@4820
   395
               in (ixn, mkabs(binders,is,t')) :: itms end
nipkow@4820
   396
          else raise MATCH
nipkow@4820
   397
  end;
nipkow@4820
   398
nipkow@678
   399
fun match tsg (po as (pat,obj)) =
nipkow@678
   400
let
nipkow@4820
   401
  (* Pre: pat and obj have same type *)
nipkow@4820
   402
  fun mtch binders (env as (iTs,itms),(pat,obj)) =
nipkow@4820
   403
    case pat of
nipkow@4820
   404
      Abs(ns,Ts,ts) =>
nipkow@4820
   405
        (case obj of
nipkow@4820
   406
           Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (env,(ts,tt))
berghofe@8406
   407
         | _ => let val Tt = typ_subst_TVars_Vartab iTs Ts
nipkow@4820
   408
                in mtch((ns,Tt)::binders)(env,(ts,(incr obj)$Bound(0))) end)
nipkow@4820
   409
    | _ => (case obj of
nipkow@4820
   410
              Abs(nt,Tt,tt) =>
nipkow@4820
   411
                mtch((nt,Tt)::binders)(env,((incr pat)$Bound(0),tt))
nipkow@4820
   412
            | _ => cases(binders,env,pat,obj))
nipkow@678
   413
nipkow@4820
   414
  and cases(binders,env as (iTs,itms),pat,obj) =
nipkow@4820
   415
    let val (ph,pargs) = strip_comb pat
nipkow@4820
   416
        fun rigrig1(iTs,oargs) =
nipkow@4820
   417
              foldl (mtch binders) ((iTs,itms), pargs~~oargs)
nipkow@4820
   418
        fun rigrig2((a,Ta),(b,Tb),oargs) =
nipkow@4820
   419
              if a<> b then raise MATCH
nipkow@4820
   420
              else rigrig1(typ_match tsg (iTs,(Ta,Tb)), oargs)
nipkow@4820
   421
    in case ph of
nipkow@4820
   422
         Var(ixn,_) =>
nipkow@4820
   423
           let val is = ints_of pargs
nipkow@4820
   424
           in case assoc_string_int(itms,ixn) of
nipkow@4820
   425
                None => (iTs,match_bind(itms,binders,ixn,is,obj))
nipkow@4820
   426
              | Some u => if obj aeconv (red u is []) then env
nipkow@4820
   427
                          else raise MATCH
nipkow@4820
   428
           end
nipkow@4820
   429
       | _ =>
nipkow@4820
   430
           let val (oh,oargs) = strip_comb obj
nipkow@4820
   431
           in case (ph,oh) of
nipkow@4820
   432
                (Const c,Const d) => rigrig2(c,d,oargs)
nipkow@4820
   433
              | (Free f,Free g)   => rigrig2(f,g,oargs)
nipkow@4820
   434
              | (Bound i,Bound j) => if i<>j then raise MATCH
nipkow@4820
   435
                                     else rigrig1(iTs,oargs)
nipkow@4820
   436
              | (Abs _, _)        => raise Pattern
nipkow@4820
   437
              | (_, Abs _)        => raise Pattern
nipkow@4820
   438
              | _                 => raise MATCH
nipkow@4820
   439
           end
nipkow@4820
   440
    end;
nipkow@678
   441
nipkow@4820
   442
  val pT = fastype_of pat
nipkow@4820
   443
  and oT = fastype_of obj
berghofe@8406
   444
  val iTs = typ_match tsg (Vartab.empty, (pT,oT))
nipkow@4820
   445
  val insts2 = (iTs,[])
nipkow@678
   446
berghofe@8406
   447
in apfst Vartab.dest (mtch [] (insts2, po)
berghofe@8406
   448
   handle Pattern => fomatch tsg insts2 po)
nipkow@678
   449
end;
clasohm@0
   450
clasohm@0
   451
(*Predicate: does the pattern match the object?*)
nipkow@678
   452
fun matches tsig po = (match tsig po; true) handle MATCH => false;
clasohm@0
   453
nipkow@4667
   454
(* Does pat match a subterm of obj? *)
nipkow@4667
   455
fun matches_subterm tsig (pat,obj) =
nipkow@4667
   456
  let fun msub(bounds,obj) = matches tsig (pat,obj) orelse
nipkow@4667
   457
            case obj of
nipkow@4667
   458
              Abs(x,T,t) => let val y = variant bounds x
nipkow@4667
   459
                                val f = Free(":" ^ y,T)
nipkow@4667
   460
                            in msub(x::bounds,subst_bound(f,t)) end
nipkow@4667
   461
            | s$t => msub(bounds,s) orelse msub(bounds,t)
nipkow@4667
   462
            | _ => false
nipkow@4667
   463
  in msub([],obj) end;
nipkow@4667
   464
nipkow@4820
   465
fun first_order(Abs(_,_,t)) = first_order t
nipkow@4820
   466
  | first_order(t $ u) = first_order t andalso first_order u andalso
nipkow@4820
   467
                         not(is_Var t)
nipkow@4820
   468
  | first_order _ = true;
nipkow@4820
   469
nipkow@4820
   470
fun pattern(Abs(_,_,t)) = pattern t
nipkow@4820
   471
  | pattern(t) = let val (head,args) = strip_comb t
nipkow@4820
   472
                 in if is_Var head
nipkow@4820
   473
                    then let val _ = ints_of args in true end
nipkow@4820
   474
                         handle Pattern => false
nipkow@4820
   475
                    else forall pattern args
nipkow@4820
   476
                 end;
nipkow@4820
   477
wenzelm@12784
   478
wenzelm@12784
   479
(* rewriting -- simple but fast *)
wenzelm@12784
   480
berghofe@13195
   481
fun rewrite_term tsig rules procs tm =
wenzelm@12784
   482
  let
berghofe@13195
   483
    val skel0 = Bound 0;
berghofe@13195
   484
wenzelm@12797
   485
    val rhs_names =
wenzelm@12797
   486
      foldr (fn ((_, rhs), names) => add_term_free_names (rhs, names)) (rules, []);
berghofe@13195
   487
wenzelm@12797
   488
    fun variant_absfree (x, T, t) =
wenzelm@12797
   489
      let
wenzelm@12797
   490
        val x' = variant (add_term_free_names (t, rhs_names)) x;
wenzelm@12797
   491
        val t' = subst_bound (Free (x', T), t);
wenzelm@12797
   492
      in (fn u => Abs (x, T, abstract_over (Free (x', T), u)), t') end;
wenzelm@12797
   493
wenzelm@12784
   494
    fun match_rew tm (tm1, tm2) =
berghofe@13195
   495
      let val rtm = if_none (Term.rename_abs tm1 tm tm2) tm2
berghofe@13195
   496
      in Some (subst_vars (match tsig (tm1, tm)) rtm, rtm)
berghofe@13195
   497
        handle MATCH => None
berghofe@13195
   498
      end;
wenzelm@12784
   499
berghofe@13195
   500
    fun rew (Abs (_, _, body) $ t) = Some (subst_bound (t, body), skel0)
berghofe@13195
   501
      | rew tm = (case get_first (match_rew tm) rules of
berghofe@13195
   502
          None => apsome (rpair skel0) (get_first (fn p => p tm) procs)
berghofe@13195
   503
        | x => x);
berghofe@13195
   504
berghofe@13195
   505
    fun rew1 (Var _) _ = None
berghofe@13195
   506
      | rew1 skel tm = (case rew2 skel tm of
wenzelm@12817
   507
          Some tm1 => (case rew tm1 of
berghofe@13195
   508
              Some (tm2, skel') => Some (if_none (rew1 skel' tm2) tm2)
wenzelm@12784
   509
            | None => Some tm1)
wenzelm@12817
   510
        | None => (case rew tm of
berghofe@13195
   511
              Some (tm1, skel') => Some (if_none (rew1 skel' tm1) tm1)
wenzelm@12784
   512
            | None => None))
wenzelm@12784
   513
berghofe@13195
   514
    and rew2 skel (tm1 $ tm2) = (case tm1 of
wenzelm@12784
   515
            Abs (_, _, body) =>
wenzelm@12784
   516
              let val tm' = subst_bound (tm2, body)
berghofe@13195
   517
              in Some (if_none (rew2 skel0 tm') tm') end
wenzelm@14787
   518
          | _ =>
berghofe@13195
   519
            let val (skel1, skel2) = (case skel of
berghofe@13195
   520
                skel1 $ skel2 => (skel1, skel2)
berghofe@13195
   521
              | _ => (skel0, skel0))
berghofe@13195
   522
            in case rew1 skel1 tm1 of
berghofe@13195
   523
                Some tm1' => (case rew1 skel2 tm2 of
berghofe@13195
   524
                    Some tm2' => Some (tm1' $ tm2')
berghofe@13195
   525
                  | None => Some (tm1' $ tm2))
berghofe@13195
   526
              | None => (case rew1 skel2 tm2 of
berghofe@13195
   527
                    Some tm2' => Some (tm1 $ tm2')
berghofe@13195
   528
                  | None => None)
berghofe@13195
   529
            end)
berghofe@13195
   530
      | rew2 skel (Abs (x, T, tm)) =
berghofe@13195
   531
          let
berghofe@13195
   532
            val (abs, tm') = variant_absfree (x, T, tm);
berghofe@13195
   533
            val skel' = (case skel of Abs (_, _, skel') => skel' | _ => skel0)
berghofe@13195
   534
          in case rew1 skel' tm' of
wenzelm@12797
   535
              Some tm'' => Some (abs tm'')
berghofe@13195
   536
            | None => None
wenzelm@12797
   537
          end
berghofe@13195
   538
      | rew2 _ _ = None
wenzelm@12784
   539
berghofe@13195
   540
  in if_none (rew1 skel0 tm) tm end;
wenzelm@12784
   541
clasohm@0
   542
end;
nipkow@13642
   543
nipkow@13642
   544
val trace_unify_fail = Pattern.trace_unify_fail;