src/Pure/pattern.ML
author wenzelm
Fri May 28 20:41:23 2010 +0200 (2010-05-28)
changeset 37174 6feaab4fc27d
parent 35408 b48ab741683b
child 40617 4a1173d21ec4
permissions -rw-r--r--
assume given SCALA_HOME, e.g. from component settings or external setup;
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
paulson@2751
    13
infix aeconv;
paulson@2751
    14
clasohm@0
    15
signature PATTERN =
wenzelm@14787
    16
sig
wenzelm@32738
    17
  val trace_unify_fail: bool Unsynchronized.ref
wenzelm@17203
    18
  val aeconv: term * term -> bool
wenzelm@17203
    19
  val eta_long: typ list -> term -> term
wenzelm@18182
    20
  val match: theory -> term * term -> Type.tyenv * Envir.tenv -> Type.tyenv * Envir.tenv
wenzelm@18182
    21
  val first_order_match: theory -> term * term
wenzelm@18182
    22
    -> Type.tyenv * Envir.tenv -> Type.tyenv * Envir.tenv
wenzelm@17203
    23
  val matches: theory -> term * term -> bool
haftmann@28348
    24
  val matchess: theory -> term list * term list -> bool
wenzelm@19880
    25
  val equiv: theory -> term * term -> bool
wenzelm@17203
    26
  val matches_subterm: theory -> term * term -> bool
wenzelm@18182
    27
  val unify: theory -> term * term -> Envir.env -> Envir.env
wenzelm@17203
    28
  val first_order: term -> bool
wenzelm@17203
    29
  val pattern: term -> bool
wenzelm@30565
    30
  val match_rew: theory -> term -> term * term -> (term * term) option
wenzelm@17203
    31
  val rewrite_term: theory -> (term * term) list -> (term -> term option) list -> term -> term
berghofe@35210
    32
  val rewrite_term_top: theory -> (term * term) list -> (term -> term option) list -> term -> term
clasohm@0
    33
  exception Unif
clasohm@0
    34
  exception MATCH
clasohm@0
    35
  exception Pattern
wenzelm@14787
    36
end;
clasohm@0
    37
wenzelm@17203
    38
structure Pattern: PATTERN =
clasohm@0
    39
struct
clasohm@0
    40
clasohm@0
    41
exception Unif;
clasohm@0
    42
exception Pattern;
clasohm@0
    43
wenzelm@32738
    44
val trace_unify_fail = Unsynchronized.ref false;
nipkow@13642
    45
wenzelm@26939
    46
fun string_of_term thy env binders t =
wenzelm@26939
    47
  Syntax.string_of_term_global thy
wenzelm@26939
    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@26939
    55
  then let val t = Syntax.string_of_typ_global thy (Envir.norm_type tye T)
wenzelm@26939
    56
           and u = Syntax.string_of_typ_global 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
wenzelm@22678
    76
  then let val f = Term.string_of_vname F
nipkow@13642
    77
           val xs = bnames binders is
wenzelm@17203
    78
           val u = string_of_term thy env binders t
wenzelm@19300
    79
           val ys = bnames binders (subtract (op =) is (loose_bnos t))
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
wenzelm@22678
    88
  then let val f = Term.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
wenzelm@20672
   126
      in if member (op =) is i 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
wenzelm@32032
   145
fun type_of_G env (T, n, is) =
wenzelm@32032
   146
  let
wenzelm@32032
   147
    val tyenv = Envir.type_env env;
wenzelm@32032
   148
    val (Ts, U) = split_type (Envir.norm_type tyenv T, n, []);
haftmann@18011
   149
  in map (nth Ts) is ---> U end;
clasohm@0
   150
clasohm@0
   151
fun mkhnf (binders,is,G,js) = mkabs (binders, is, app(G,js));
clasohm@0
   152
clasohm@0
   153
fun mknewhnf(env,binders,is,F as (a,_),T,js) =
berghofe@13891
   154
  let val (env',G) = Envir.genvar a (env,type_of_G env (T,length is,js))
berghofe@15797
   155
  in Envir.update (((F, T), mkhnf (binders, is, G, js)), env') end;
clasohm@0
   156
clasohm@0
   157
wenzelm@23222
   158
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
wenzelm@23222
   159
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
wenzelm@23222
   160
  | downto0 ([], n) = n = ~1;
wenzelm@23222
   161
wenzelm@23222
   162
(*mk_proj_list(is) = [ |is| - k | 1 <= k <= |is| and is[k] >= 0 ]*)
clasohm@0
   163
fun mk_proj_list is =
wenzelm@19502
   164
    let fun mk(i::is,j) = if is_some i then j :: mk(is,j-1) else mk(is,j-1)
clasohm@0
   165
          | mk([],_)    = []
clasohm@0
   166
    in mk(is,length is - 1) end;
clasohm@0
   167
clasohm@0
   168
fun proj(s,env,binders,is) =
clasohm@0
   169
    let fun trans d i = if i<d then i else (idx is (i-d))+d;
berghofe@12232
   170
        fun pr(s,env,d,binders) = (case Envir.head_norm env s of
clasohm@0
   171
              Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders))
clasohm@0
   172
                            in (Abs(a,T,t'),env') end
clasohm@0
   173
            | t => (case strip_comb t of
clasohm@0
   174
                (c as Const _,ts) =>
clasohm@0
   175
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   176
                         in (list_comb(c,ts'),env') end
clasohm@0
   177
                 | (f as Free _,ts) =>
clasohm@0
   178
                         let val (ts',env') = prs(ts,env,d,binders)
clasohm@0
   179
                         in (list_comb(f,ts'),env') end
clasohm@0
   180
                 | (Bound(i),ts) =>
clasohm@0
   181
                         let val j = trans d i
berghofe@14861
   182
                             val (ts',env') = prs(ts,env,d,binders)
berghofe@14861
   183
                         in (list_comb(Bound j,ts'),env') end
clasohm@0
   184
                 | (Var(F as (a,_),Fty),ts) =>
berghofe@12232
   185
                      let val js = ints_of' env ts;
berghofe@14861
   186
                          val js' = map (try (trans d)) js;
clasohm@0
   187
                          val ks = mk_proj_list js';
wenzelm@19482
   188
                          val ls = map_filter I js'
berghofe@13891
   189
                          val Hty = type_of_G env (Fty,length js,ks)
clasohm@0
   190
                          val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   191
                          val env'' =
berghofe@15797
   192
                            Envir.update (((F, Fty), mkhnf (binders, js, H, ks)), env')
clasohm@0
   193
                      in (app(H,ls),env'') end
clasohm@0
   194
                 | _  => raise Pattern))
clasohm@0
   195
        and prs(s::ss,env,d,binders) =
clasohm@0
   196
              let val (s',env1) = pr(s,env,d,binders)
clasohm@0
   197
                  val (ss',env2) = prs(ss,env1,d,binders)
clasohm@0
   198
              in (s'::ss',env2) end
clasohm@0
   199
          | prs([],env,_,_) = ([],env)
clasohm@0
   200
   in if downto0(is,length binders - 1) then (s,env)
clasohm@0
   201
      else pr(s,env,0,binders)
clasohm@0
   202
   end;
clasohm@0
   203
clasohm@0
   204
clasohm@0
   205
(* mk_ff_list(is,js) = [ length(is) - k | 1 <= k <= |is| and is[k] = js[k] ] *)
wenzelm@12784
   206
fun mk_ff_list(is,js) =
wenzelm@12784
   207
    let fun mk([],[],_)        = []
wenzelm@16668
   208
          | mk(i::is,j::js, k) = if (i:int) = j then k :: mk(is,js,k-1)
clasohm@0
   209
                                        else mk(is,js,k-1)
nipkow@678
   210
          | mk _               = error"mk_ff_list"
clasohm@0
   211
    in mk(is,js,length is-1) end;
clasohm@0
   212
clasohm@0
   213
fun flexflex1(env,binders,F,Fty,is,js) =
clasohm@0
   214
  if is=js then env
clasohm@0
   215
  else let val ks = mk_ff_list(is,js)
clasohm@0
   216
       in mknewhnf(env,binders,is,F,Fty,ks) end;
clasohm@0
   217
clasohm@0
   218
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) =
clasohm@0
   219
  let fun ff(F,Fty,is,G as (a,_),Gty,js) =
haftmann@33038
   220
            if subset (op =) (js, is)
clasohm@0
   221
            then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js))
berghofe@15797
   222
                 in Envir.update (((F, Fty), t), env) end
haftmann@33049
   223
            else let val ks = inter (op =) js is
berghofe@13891
   224
                     val Hty = type_of_G env (Fty,length is,map (idx is) ks)
clasohm@0
   225
                     val (env',H) = Envir.genvar a (env,Hty)
clasohm@0
   226
                     fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks));
berghofe@15797
   227
                 in Envir.update (((G, Gty), lam js), Envir.update (((F, Fty), lam is), env'))
clasohm@0
   228
                 end;
wenzelm@35408
   229
  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
   230
wenzelm@32032
   231
fun unify_types thy (T, U) (env as Envir.Envir {maxidx, tenv, tyenv}) =
wenzelm@32032
   232
  if T = U then env
wenzelm@32032
   233
  else
wenzelm@32032
   234
    let val (tyenv', maxidx') = Sign.typ_unify thy (U, T) (tyenv, maxidx)
wenzelm@32032
   235
    in Envir.Envir {maxidx = maxidx', tenv = tenv, tyenv = tyenv'} end
wenzelm@32032
   236
    handle Type.TUNIFY => (typ_clash thy (tyenv, T, U); raise Unif);
clasohm@0
   237
wenzelm@18182
   238
fun unif thy binders (s,t) env = case (Envir.head_norm env s, Envir.head_norm env t) of
clasohm@0
   239
      (Abs(ns,Ts,ts),Abs(nt,Tt,tt)) =>
clasohm@0
   240
         let val name = if ns = "" then nt else ns
wenzelm@18182
   241
         in unif thy ((name,Ts)::binders) (ts,tt) env end
wenzelm@18182
   242
    | (Abs(ns,Ts,ts),t) => unif thy ((ns,Ts)::binders) (ts,(incr t)$Bound(0)) env
wenzelm@18182
   243
    | (t,Abs(nt,Tt,tt)) => unif thy ((nt,Tt)::binders) ((incr t)$Bound(0),tt) env
wenzelm@17203
   244
    | p => cases thy (binders,env,p)
clasohm@0
   245
wenzelm@17203
   246
and cases thy (binders,env,(s,t)) = case (strip_comb s,strip_comb t) of
wenzelm@12784
   247
       ((Var(F,Fty),ss),(Var(G,Gty),ts)) =>
berghofe@12232
   248
         if F = G then flexflex1(env,binders,F,Fty,ints_of' env ss,ints_of' env ts)
berghofe@12232
   249
                  else flexflex2(env,binders,F,Fty,ints_of' env ss,G,Gty,ints_of' env ts)
wenzelm@17203
   250
      | ((Var(F,Fty),ss),_)           => flexrigid thy (env,binders,F,Fty,ints_of' env ss,t)
wenzelm@17203
   251
      | (_,(Var(F,Fty),ts))           => flexrigid thy (env,binders,F,Fty,ints_of' env ts,s)
wenzelm@17203
   252
      | ((Const c,ss),(Const d,ts))   => rigidrigid thy (env,binders,c,d,ss,ts)
wenzelm@17203
   253
      | ((Free(f),ss),(Free(g),ts))   => rigidrigid thy (env,binders,f,g,ss,ts)
wenzelm@17203
   254
      | ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB thy (env,binders,i,j,ss,ts)
clasohm@0
   255
      | ((Abs(_),_),_)                => raise Pattern
clasohm@0
   256
      | (_,(Abs(_),_))                => raise Pattern
nipkow@13642
   257
      | ((Const(c,_),_),(Free(f,_),_)) => (clash c f; raise Unif)
nipkow@13642
   258
      | ((Const(c,_),_),(Bound i,_))   => (clashB binders i c; raise Unif)
nipkow@13642
   259
      | ((Free(f,_),_),(Const(c,_),_)) => (clash f c; raise Unif)
nipkow@13642
   260
      | ((Free(f,_),_),(Bound i,_))    => (clashB binders i f; raise Unif)
nipkow@13642
   261
      | ((Bound i,_),(Const(c,_),_))   => (clashB binders i c; raise Unif)
nipkow@13642
   262
      | ((Bound i,_),(Free(f,_),_))    => (clashB binders i f; raise Unif)
nipkow@13642
   263
clasohm@0
   264
wenzelm@17203
   265
and rigidrigid thy (env,binders,(a,Ta),(b,Tb),ss,ts) =
nipkow@13642
   266
      if a<>b then (clash a b; raise Unif)
wenzelm@18182
   267
      else env |> unify_types thy (Ta,Tb) |> fold (unif thy binders) (ss~~ts)
clasohm@0
   268
wenzelm@17203
   269
and rigidrigidB thy (env,binders,i,j,ss,ts) =
nipkow@13642
   270
     if i <> j then (clashBB binders i j; raise Unif)
wenzelm@18182
   271
     else fold (unif thy binders) (ss~~ts) env
clasohm@0
   272
wenzelm@17203
   273
and flexrigid thy (params as (env,binders,F,Fty,is,t)) =
wenzelm@17203
   274
      if occurs(F,t,env) then (ocheck_fail thy (F,t,binders,env); raise Unif)
nipkow@13642
   275
      else (let val (u,env') = proj(t,env,binders,is)
berghofe@15797
   276
            in Envir.update (((F, Fty), mkabs (binders, is, u)), env') end
wenzelm@17203
   277
            handle Unif => (proj_fail thy params; raise Unif));
clasohm@0
   278
wenzelm@18182
   279
fun unify thy = unif thy [];
clasohm@0
   280
clasohm@0
   281
berghofe@13998
   282
(* put a term into eta long beta normal form *)
berghofe@13998
   283
fun eta_long Ts (Abs (s, T, t)) = Abs (s, T, eta_long (T :: Ts) t)
berghofe@13998
   284
  | eta_long Ts t = (case strip_comb t of
berghofe@13998
   285
      (Abs _, _) => eta_long Ts (Envir.beta_norm t)
wenzelm@14787
   286
    | (u, ts) =>
berghofe@13998
   287
      let
berghofe@13998
   288
        val Us = binder_types (fastype_of1 (Ts, t));
berghofe@13998
   289
        val i = length Us
berghofe@13998
   290
      in list_abs (map (pair "x") Us,
berghofe@13998
   291
        list_comb (incr_boundvars i u, map (eta_long (rev Us @ Ts))
berghofe@13998
   292
          (map (incr_boundvars i) ts @ map Bound (i - 1 downto 0))))
berghofe@13998
   293
      end);
berghofe@13998
   294
paulson@2725
   295
nipkow@678
   296
(*Tests whether 2 terms are alpha/eta-convertible and have same type.
nipkow@678
   297
  Note that Consts and Vars may have more than one type.*)
wenzelm@30555
   298
fun t aeconv u = t aconv u orelse
wenzelm@30555
   299
  Envir.eta_contract t aconv Envir.eta_contract u;
nipkow@678
   300
nipkow@678
   301
nipkow@4820
   302
(*** Matching ***)
nipkow@4820
   303
nipkow@4820
   304
exception MATCH;
nipkow@4820
   305
wenzelm@18182
   306
fun typ_match thy TU tyenv = Sign.typ_match thy TU tyenv
wenzelm@16939
   307
  handle Type.TYPE_MATCH => raise MATCH;
nipkow@4820
   308
nipkow@4820
   309
(*First-order matching;
nipkow@4820
   310
  The pattern and object may have variables in common.
nipkow@4820
   311
  Instantiation does not affect the object, so matching ?a with ?a+1 works.
nipkow@4820
   312
  Object is eta-contracted on the fly (by eta-expanding the pattern).
nipkow@4820
   313
  Precondition: the pattern is already eta-contracted!
wenzelm@18182
   314
  Types are matched on the fly*)
wenzelm@18182
   315
fun first_order_match thy =
nipkow@4820
   316
  let
berghofe@25473
   317
    fun mtch k (instsp as (tyinsts,insts)) = fn
nipkow@4820
   318
        (Var(ixn,T), t)  =>
berghofe@25473
   319
          if k > 0 andalso loose_bvar(t,0) then raise MATCH
berghofe@16651
   320
          else (case Envir.lookup' (insts, (ixn, T)) of
wenzelm@18182
   321
                  NONE => (typ_match thy (T, fastype_of t) tyinsts,
wenzelm@17412
   322
                           Vartab.update_new (ixn, (T, t)) insts)
skalberg@15531
   323
                | SOME u => if t aeconv u then instsp else raise MATCH)
nipkow@4820
   324
      | (Free (a,T), Free (b,U)) =>
wenzelm@18182
   325
          if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH
nipkow@4820
   326
      | (Const (a,T), Const (b,U))  =>
wenzelm@18182
   327
          if a=b then (typ_match thy (T,U) tyinsts, insts) else raise MATCH
nipkow@4820
   328
      | (Bound i, Bound j)  =>  if  i=j  then  instsp  else raise MATCH
nipkow@4820
   329
      | (Abs(_,T,t), Abs(_,U,u))  =>
berghofe@25473
   330
          mtch (k + 1) (typ_match thy (T,U) tyinsts, insts) (t,u)
berghofe@25473
   331
      | (f$t, g$u) => mtch k (mtch k instsp (f,g)) (t, u)
berghofe@25473
   332
      | (t, Abs(_,U,u))  =>  mtch (k + 1) instsp ((incr t)$(Bound 0), u)
nipkow@4820
   333
      | _ => raise MATCH
berghofe@25473
   334
  in fn tu => fn env => mtch 0 env tu end;
nipkow@4820
   335
berghofe@8406
   336
nipkow@4820
   337
(* Matching of higher-order patterns *)
nipkow@4820
   338
berghofe@15797
   339
fun match_bind(itms,binders,ixn,T,is,t) =
nipkow@4820
   340
  let val js = loose_bnos t
nipkow@4820
   341
  in if null is
wenzelm@17412
   342
     then if null js then Vartab.update_new (ixn, (T, t)) itms else raise MATCH
haftmann@33038
   343
     else if subset (op =) (js, is)
nipkow@4820
   344
          then let val t' = if downto0(is,length binders - 1) then t
nipkow@4820
   345
                            else mapbnd (idx is) t
wenzelm@17412
   346
               in Vartab.update_new (ixn, (T, mkabs (binders, is, t'))) itms end
nipkow@4820
   347
          else raise MATCH
nipkow@4820
   348
  end;
nipkow@4820
   349
wenzelm@18182
   350
fun match thy (po as (pat,obj)) envir =
nipkow@678
   351
let
nipkow@4820
   352
  (* Pre: pat and obj have same type *)
wenzelm@18182
   353
  fun mtch binders (pat,obj) (env as (iTs,itms)) =
nipkow@4820
   354
    case pat of
nipkow@4820
   355
      Abs(ns,Ts,ts) =>
nipkow@4820
   356
        (case obj of
wenzelm@18182
   357
           Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (ts,tt) env
wenzelm@32035
   358
         | _ => let val Tt = Envir.subst_type iTs Ts
wenzelm@18182
   359
                in mtch((ns,Tt)::binders) (ts,(incr obj)$Bound(0)) env end)
nipkow@4820
   360
    | _ => (case obj of
nipkow@4820
   361
              Abs(nt,Tt,tt) =>
wenzelm@18182
   362
                mtch((nt,Tt)::binders) ((incr pat)$Bound(0),tt) env
nipkow@4820
   363
            | _ => cases(binders,env,pat,obj))
nipkow@678
   364
nipkow@4820
   365
  and cases(binders,env as (iTs,itms),pat,obj) =
nipkow@4820
   366
    let val (ph,pargs) = strip_comb pat
wenzelm@18182
   367
        fun rigrig1(iTs,oargs) = fold (mtch binders) (pargs~~oargs) (iTs,itms)
wenzelm@16668
   368
        fun rigrig2((a:string,Ta),(b,Tb),oargs) =
wenzelm@16668
   369
              if a <> b then raise MATCH
wenzelm@18182
   370
              else rigrig1(typ_match thy (Ta,Tb) iTs, oargs)
nipkow@4820
   371
    in case ph of
berghofe@15797
   372
         Var(ixn,T) =>
nipkow@4820
   373
           let val is = ints_of pargs
berghofe@16651
   374
           in case Envir.lookup' (itms, (ixn, T)) of
berghofe@15797
   375
                NONE => (iTs,match_bind(itms,binders,ixn,T,is,obj))
skalberg@15531
   376
              | SOME u => if obj aeconv (red u is []) then env
nipkow@4820
   377
                          else raise MATCH
nipkow@4820
   378
           end
nipkow@4820
   379
       | _ =>
nipkow@4820
   380
           let val (oh,oargs) = strip_comb obj
nipkow@4820
   381
           in case (ph,oh) of
nipkow@4820
   382
                (Const c,Const d) => rigrig2(c,d,oargs)
nipkow@4820
   383
              | (Free f,Free g)   => rigrig2(f,g,oargs)
nipkow@4820
   384
              | (Bound i,Bound j) => if i<>j then raise MATCH
nipkow@4820
   385
                                     else rigrig1(iTs,oargs)
nipkow@4820
   386
              | (Abs _, _)        => raise Pattern
nipkow@4820
   387
              | (_, Abs _)        => raise Pattern
nipkow@4820
   388
              | _                 => raise MATCH
nipkow@4820
   389
           end
nipkow@4820
   390
    end;
nipkow@678
   391
nipkow@4820
   392
  val pT = fastype_of pat
nipkow@4820
   393
  and oT = fastype_of obj
wenzelm@18182
   394
  val envir' = apfst (typ_match thy (pT, oT)) envir;
wenzelm@18182
   395
in mtch [] po envir' handle Pattern => first_order_match thy po envir' end;
clasohm@0
   396
wenzelm@18182
   397
fun matches thy po = (match thy po (Vartab.empty, Vartab.empty); true) handle MATCH => false;
wenzelm@18182
   398
haftmann@28348
   399
fun matchess thy pos = (fold (match thy) (op ~~ pos) (Vartab.empty, Vartab.empty); true) handle MATCH => false;
haftmann@28348
   400
wenzelm@19880
   401
fun equiv thy (t, u) = matches thy (t, u) andalso matches thy (u, t);
wenzelm@19880
   402
clasohm@0
   403
nipkow@4667
   404
(* Does pat match a subterm of obj? *)
wenzelm@22255
   405
fun matches_subterm thy (pat, obj) =
wenzelm@22255
   406
  let
wenzelm@22255
   407
    fun msub bounds obj = matches thy (pat, obj) orelse
wenzelm@22255
   408
      (case obj of
wenzelm@22255
   409
        Abs (x, T, t) => msub (bounds + 1) (snd (Term.dest_abs (Name.bound bounds, T, t)))
wenzelm@22255
   410
      | t $ u => msub bounds t orelse msub bounds u
wenzelm@22255
   411
      | _ => false)
wenzelm@22255
   412
  in msub 0 obj end;
nipkow@4667
   413
nipkow@4820
   414
fun first_order(Abs(_,_,t)) = first_order t
nipkow@4820
   415
  | first_order(t $ u) = first_order t andalso first_order u andalso
nipkow@4820
   416
                         not(is_Var t)
nipkow@4820
   417
  | first_order _ = true;
nipkow@4820
   418
wenzelm@20672
   419
fun pattern (Abs (_, _, t)) = pattern t
wenzelm@20672
   420
  | pattern t =
wenzelm@20672
   421
      let val (head, args) = strip_comb t in
wenzelm@20672
   422
        if is_Var head then
wenzelm@20672
   423
          forall is_Bound args andalso not (has_duplicates (op aconv) args)
wenzelm@20672
   424
        else forall pattern args
wenzelm@20672
   425
      end;
nipkow@4820
   426
wenzelm@12784
   427
wenzelm@12784
   428
(* rewriting -- simple but fast *)
wenzelm@12784
   429
wenzelm@30565
   430
fun match_rew thy tm (tm1, tm2) =
wenzelm@30565
   431
  let val rtm = the_default tm2 (Term.rename_abs tm1 tm tm2) in
wenzelm@32035
   432
    SOME (Envir.subst_term (match thy (tm1, tm) (Vartab.empty, Vartab.empty)) rtm, rtm)
wenzelm@30565
   433
      handle MATCH => NONE
wenzelm@30565
   434
  end;
wenzelm@30565
   435
berghofe@35210
   436
fun gen_rewrite_term bot thy rules procs tm =
wenzelm@12784
   437
  let
berghofe@13195
   438
    val skel0 = Bound 0;
berghofe@13195
   439
wenzelm@16939
   440
    fun variant_absfree bounds (x, T, t) =
wenzelm@12797
   441
      let
wenzelm@20079
   442
        val (x', t') = Term.dest_abs (Name.bound bounds, T, t);
wenzelm@16939
   443
        fun abs u = Abs (x, T, abstract_over (Free (x', T), u));
wenzelm@16939
   444
      in (abs, t') end;
wenzelm@12797
   445
skalberg@15531
   446
    fun rew (Abs (_, _, body) $ t) = SOME (subst_bound (t, body), skel0)
wenzelm@30565
   447
      | rew tm =
wenzelm@30565
   448
          (case get_first (match_rew thy tm) rules of
wenzelm@30565
   449
            NONE => Option.map (rpair skel0) (get_first (fn p => p tm) procs)
wenzelm@30565
   450
          | x => x);
berghofe@13195
   451
berghofe@35210
   452
    fun rew_sub r bounds skel (tm1 $ tm2) = (case tm1 of
wenzelm@12784
   453
            Abs (_, _, body) =>
wenzelm@12784
   454
              let val tm' = subst_bound (tm2, body)
berghofe@35210
   455
              in SOME (the_default tm' (rew_sub r bounds skel0 tm')) end
wenzelm@14787
   456
          | _ =>
berghofe@13195
   457
            let val (skel1, skel2) = (case skel of
berghofe@13195
   458
                skel1 $ skel2 => (skel1, skel2)
berghofe@13195
   459
              | _ => (skel0, skel0))
berghofe@35210
   460
            in case r bounds skel1 tm1 of
berghofe@35210
   461
                SOME tm1' => (case r bounds skel2 tm2 of
skalberg@15531
   462
                    SOME tm2' => SOME (tm1' $ tm2')
skalberg@15531
   463
                  | NONE => SOME (tm1' $ tm2))
berghofe@35210
   464
              | NONE => (case r bounds skel2 tm2 of
skalberg@15531
   465
                    SOME tm2' => SOME (tm1 $ tm2')
skalberg@15531
   466
                  | NONE => NONE)
berghofe@13195
   467
            end)
berghofe@35210
   468
      | rew_sub r bounds skel (Abs body) =
berghofe@13195
   469
          let
wenzelm@16939
   470
            val (abs, tm') = variant_absfree bounds body;
berghofe@13195
   471
            val skel' = (case skel of Abs (_, _, skel') => skel' | _ => skel0)
berghofe@35210
   472
          in case r (bounds + 1) skel' tm' of
skalberg@15531
   473
              SOME tm'' => SOME (abs tm'')
skalberg@15531
   474
            | NONE => NONE
wenzelm@12797
   475
          end
berghofe@35210
   476
      | rew_sub _ _ _ _ = NONE;
berghofe@35210
   477
berghofe@35210
   478
    fun rew_bot bounds (Var _) _ = NONE
berghofe@35210
   479
      | rew_bot bounds skel tm = (case rew_sub rew_bot bounds skel tm of
berghofe@35210
   480
          SOME tm1 => (case rew tm1 of
berghofe@35210
   481
              SOME (tm2, skel') => SOME (the_default tm2 (rew_bot bounds skel' tm2))
berghofe@35210
   482
            | NONE => SOME tm1)
berghofe@35210
   483
        | NONE => (case rew tm of
berghofe@35210
   484
              SOME (tm1, skel') => SOME (the_default tm1 (rew_bot bounds skel' tm1))
berghofe@35210
   485
            | NONE => NONE));
wenzelm@12784
   486
berghofe@35210
   487
    fun rew_top bounds _ tm = (case rew tm of
berghofe@35210
   488
          SOME (tm1, _) => (case rew_sub rew_top bounds skel0 tm1 of
berghofe@35210
   489
              SOME tm2 => SOME (the_default tm2 (rew_top bounds skel0 tm2))
berghofe@35210
   490
            | NONE => SOME tm1)
berghofe@35210
   491
        | NONE => (case rew_sub rew_top bounds skel0 tm of
berghofe@35210
   492
              SOME tm1 => SOME (the_default tm1 (rew_top bounds skel0 tm1))
berghofe@35210
   493
            | NONE => NONE));
berghofe@35210
   494
berghofe@35210
   495
  in the_default tm ((if bot then rew_bot else rew_top) 0 skel0 tm) end;
berghofe@35210
   496
berghofe@35210
   497
val rewrite_term = gen_rewrite_term true;
berghofe@35210
   498
val rewrite_term_top = gen_rewrite_term false;
wenzelm@12784
   499
clasohm@0
   500
end;
nipkow@13642
   501
nipkow@13642
   502
val trace_unify_fail = Pattern.trace_unify_fail;