src/Pure/pattern.ML
author wenzelm
Mon, 09 Nov 1998 15:42:08 +0100
changeset 5840 e2d2b896c717
parent 4820 8f6dbbd8d497
child 6539 2e7d2fba9f6c
permissions -rw-r--r--
Object logic specific operations.
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
     1
(*  Title: 	pattern
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
     3
    Author: 	Tobias Nipkow and Christine Heinzelmann, TU Muenchen
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1993  TU Muenchen
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
Unification of Higher-Order Patterns.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     7
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
See also:
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
Tobias Nipkow. Functional Unification of Higher-Order Patterns.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
In Proceedings of the 8th IEEE Symposium Logic in Computer Science, 1993.
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    11
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    12
TODO: optimize red by special-casing it
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    13
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    14
2751
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
    15
infix aeconv;
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
    16
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    17
signature PATTERN =
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    18
  sig
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    19
  type type_sig
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    20
  type sg
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    21
  type env
2751
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
    22
  val aeconv            : term * term -> bool
2725
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
    23
  val eta_contract      : term -> term
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
    24
  val eta_contract_atom : term -> term
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
    25
  val match             : type_sig -> term * term
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
    26
                          -> (indexname*typ)list * (indexname*term)list
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
    27
  val first_order_match : type_sig -> term * term
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
    28
                          -> (indexname*typ)list * (indexname*term)list
2725
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
    29
  val matches           : type_sig -> term * term -> bool
4667
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
    30
  val matches_subterm   : type_sig -> term * term -> bool
2725
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
    31
  val unify             : sg * env * (term * term)list -> env
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
    32
  val first_order       : term -> bool
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
    33
  val pattern           : term -> bool
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    34
  exception Unif
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    35
  exception MATCH
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    36
  exception Pattern
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    37
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    38
1501
bb7f99a0a6f0 Elimination of fully-functorial style.
paulson
parents: 1460
diff changeset
    39
structure Pattern : PATTERN =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    40
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    41
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    42
type type_sig = Type.type_sig
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    43
type sg = Sign.sg
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    44
type env = Envir.env
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    45
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    46
exception Unif;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    47
exception Pattern;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    48
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    49
fun occurs(F,t,env) = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
    let fun occ(Var(G,_))   = (case Envir.lookup(env,G) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    51
                                 Some(t) => occ t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
                               | None    => F=G)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    53
          | occ(t1$t2)      = occ t1 orelse occ t2
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    54
          | occ(Abs(_,_,t)) = occ t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    55
          | occ _           = false
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    56
    in occ t end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    57
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    58
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    59
fun mapbnd f =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    60
    let fun mpb d (Bound(i))     = if i < d then Bound(i) else Bound(f(i-d)+d)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    61
          | mpb d (Abs(s,T,t))   = Abs(s,T,mpb(d+1) t)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    62
          | mpb d ((u1 $ u2))    = (mpb d u1)$(mpb d u2)
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    63
          | mpb _ atom           = atom
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    64
    in mpb 0 end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    65
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    66
fun idx [] j     = ~10000
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    67
  | idx(i::is) j = if i=j then length is else idx is j;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    68
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    69
fun at xs i = nth_elem (i,xs);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    70
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    71
fun mkabs (binders,is,t)  =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    72
    let fun mk(i::is) = let val (x,T) = nth_elem(i,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    73
                        in Abs(x,T,mk is) end 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    74
          | mk []     = t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    75
    in mk is end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    76
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    77
val incr = mapbnd (fn i => i+1);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    78
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    79
fun ints_of []             = []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    80
  | ints_of (Bound i ::bs) = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    81
      let val is = ints_of bs
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1501
diff changeset
    82
      in if i mem_int is then raise Pattern else i::is end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    83
  | ints_of _              = raise Pattern;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    84
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    85
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    86
fun app (s,(i::is)) = app (s$Bound(i),is)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    87
  | app (s,[])      = s;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    88
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    89
fun red (Abs(_,_,s)) (i::is) js = red s is (i::js)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    90
  | red t            []      [] = t
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    91
  | red t            is      jn = app (mapbnd (at jn) t,is);
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    92
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    93
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    94
(* split_type ([T1,....,Tn]---> T,n,[]) = ([Tn,...,T1],T) *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    95
fun split_type (T,0,Ts)                    = (Ts,T)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    96
  | split_type (Type ("fun",[T1,T2]),n,Ts) = split_type (T2,n-1,T1::Ts)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
    97
  | split_type _                           = error("split_type");
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    98
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    99
fun type_of_G (T,n,is) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   100
  let val (Ts,U) = split_type(T,n,[]) in map(at Ts)is ---> U end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   101
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   102
fun mkhnf (binders,is,G,js) = mkabs (binders, is, app(G,js));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   103
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   104
fun mknewhnf(env,binders,is,F as (a,_),T,js) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   105
  let val (env',G) = Envir.genvar a (env,type_of_G(T,length is,js))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   106
  in Envir.update((F,mkhnf(binders,is,G,js)),env') end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   107
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   108
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   109
fun devar env t = case strip_comb t of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   110
        (Var(F,_),ys) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   111
            (case Envir.lookup(env,F) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   112
               Some(t) => devar env (red t (ints_of  ys) []) 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   113
             | None    => t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   114
      |  _            => t;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   115
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   116
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   117
(* mk_proj_list(is) = [ |is| - k | 1 <= k <= |is| and is[k] >= 0 ] *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   118
fun mk_proj_list is =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   119
    let fun mk(i::is,j) = if i >= 0 then j :: mk(is,j-1) else mk(is,j-1)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   120
          | mk([],_)    = []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   121
    in mk(is,length is - 1) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   122
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   123
fun proj(s,env,binders,is) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   124
    let fun trans d i = if i<d then i else (idx is (i-d))+d;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   125
        fun pr(s,env,d,binders) = (case devar env s of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   126
              Abs(a,T,t) => let val (t',env') = pr(t,env,d+1,((a,T)::binders))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   127
                            in (Abs(a,T,t'),env') end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   128
            | t => (case strip_comb t of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   129
                (c as Const _,ts) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   130
                         let val (ts',env') = prs(ts,env,d,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   131
                         in (list_comb(c,ts'),env') end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   132
                 | (f as Free _,ts) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   133
                         let val (ts',env') = prs(ts,env,d,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   134
                         in (list_comb(f,ts'),env') end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   135
                 | (Bound(i),ts) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   136
                         let val j = trans d i
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   137
                         in if j < 0 then raise Unif
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   138
                            else let val (ts',env') = prs(ts,env,d,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   139
                                 in (list_comb(Bound j,ts'),env') end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   140
                         end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   141
                 | (Var(F as (a,_),Fty),ts) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   142
                      let val js = ints_of ts;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   143
                          val js' = map (trans d) js;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   144
                          val ks = mk_proj_list js';
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   145
                          val ls = filter (fn i => i >= 0) js'
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   146
                          val Hty = type_of_G(Fty,length js,ks)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   147
                          val (env',H) = Envir.genvar a (env,Hty)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   148
                          val env'' =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   149
                                Envir.update((F,mkhnf(binders,js,H,ks)),env')
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   150
                      in (app(H,ls),env'') end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   151
                 | _  => raise Pattern))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   152
        and prs(s::ss,env,d,binders) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   153
              let val (s',env1) = pr(s,env,d,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   154
                  val (ss',env2) = prs(ss,env1,d,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   155
              in (s'::ss',env2) end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   156
          | prs([],env,_,_) = ([],env)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   157
   in if downto0(is,length binders - 1) then (s,env)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   158
      else pr(s,env,0,binders)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   159
   end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   160
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   161
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   162
(* mk_ff_list(is,js) = [ length(is) - k | 1 <= k <= |is| and is[k] = js[k] ] *)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   163
fun mk_ff_list(is,js) = 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   164
    let fun mk([],[],_)        = [] 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   165
          | mk(i::is,j::js, k) = if i=j then k :: mk(is,js,k-1)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   166
                                        else mk(is,js,k-1)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   167
          | mk _               = error"mk_ff_list"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   168
    in mk(is,js,length is-1) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   169
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   170
fun flexflex1(env,binders,F,Fty,is,js) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   171
  if is=js then env
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   172
  else let val ks = mk_ff_list(is,js)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   173
       in mknewhnf(env,binders,is,F,Fty,ks) end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   174
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   175
fun flexflex2(env,binders,F,Fty,is,G,Gty,js) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   176
  let fun ff(F,Fty,is,G as (a,_),Gty,js) =
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1501
diff changeset
   177
            if js subset_int is
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   178
            then let val t= mkabs(binders,is,app(Var(G,Gty),map (idx is) js))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   179
                 in Envir.update((F,t),env) end
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1501
diff changeset
   180
            else let val ks = is inter_int js
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   181
                     val Hty = type_of_G(Fty,length is,map (idx is) ks)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   182
                     val (env',H) = Envir.genvar a (env,Hty)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   183
                     fun lam(is) = mkabs(binders,is,app(H,map (idx is) ks));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   184
                 in Envir.update((G,lam js), Envir.update((F,lam is),env'))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   185
                 end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   186
  in if xless(G,F) then ff(F,Fty,is,G,Gty,js) else ff(G,Gty,js,F,Fty,is) end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   187
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   188
val tsgr = ref(Type.tsig0);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   189
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   190
fun unify_types(T,U, env as Envir.Envir{asol,iTs,maxidx}) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   191
  if T=U then env
1435
aefcd255ed4a Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents: 1029
diff changeset
   192
  else let val (iTs',maxidx') = Type.unify (!tsgr) maxidx iTs (U,T)
aefcd255ed4a Removed bug in type unification. Negative indexes are not used any longer.
nipkow
parents: 1029
diff changeset
   193
       in Envir.Envir{asol=asol,maxidx=maxidx',iTs=iTs'} end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   194
       handle Type.TUNIFY => raise Unif;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   195
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   196
fun unif binders (env,(s,t)) = case (devar env s,devar env t) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   197
      (Abs(ns,Ts,ts),Abs(nt,Tt,tt)) =>
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   198
         let val name = if ns = "" then nt else ns
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   199
         in unif ((name,Ts)::binders) (env,(ts,tt)) end
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   200
    | (Abs(ns,Ts,ts),t) => unif ((ns,Ts)::binders) (env,(ts,(incr t)$Bound(0)))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   201
    | (t,Abs(nt,Tt,tt)) => unif ((nt,Tt)::binders) (env,((incr t)$Bound(0),tt))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   202
    | p => cases(binders,env,p)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   203
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   204
and cases(binders,env,(s,t)) = case (strip_comb s,strip_comb t) of
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   205
       ((Var(F,Fty),ss),(Var(G,Gty),ts)) => 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   206
         if F = G then flexflex1(env,binders,F,Fty,ints_of ss,ints_of ts)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   207
                  else flexflex2(env,binders,F,Fty,ints_of ss,G,Gty,ints_of ts)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   208
      | ((Var(F,_),ss),_)             => flexrigid(env,binders,F,ints_of ss,t)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   209
      | (_,(Var(F,_),ts))             => flexrigid(env,binders,F,ints_of ts,s)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   210
      | ((Const c,ss),(Const d,ts))   => rigidrigid(env,binders,c,d,ss,ts)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   211
      | ((Free(f),ss),(Free(g),ts))   => rigidrigid(env,binders,f,g,ss,ts)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   212
      | ((Bound(i),ss),(Bound(j),ts)) => rigidrigidB (env,binders,i,j,ss,ts) 
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   213
      | ((Abs(_),_),_)                => raise Pattern
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   214
      | (_,(Abs(_),_))                => raise Pattern
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   215
      | _                             => raise Unif
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   216
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   217
and rigidrigid (env,binders,(a,Ta),(b,Tb),ss,ts) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   218
      if a<>b then raise Unif
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   219
      else foldl (unif binders) (unify_types(Ta,Tb,env), ss~~ts)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   220
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   221
and rigidrigidB (env,binders,i,j,ss,ts) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   222
     if i <> j then raise Unif else foldl (unif binders) (env ,ss~~ts)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   223
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   224
and flexrigid (env,binders,F,is,t) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   225
      if occurs(F,t,env) then raise Unif
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   226
      else let val (u,env') = proj(t,env,binders,is)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   227
           in Envir.update((F,mkabs(binders,is,u)),env') end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   228
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   229
fun unify(sg,env,tus) = (tsgr := #tsig(Sign.rep_sg sg);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   230
                         foldl (unif []) (env,tus));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   231
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   232
2725
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   233
(*Eta-contract a term (fully)*)
2792
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   234
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   235
(* copying: *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   236
fun eta_contract (Abs(a,T,body)) = 
2616
704b6c7432cf A bit more pattern-matching in eta_contract
paulson
parents: 2227
diff changeset
   237
      (case  eta_contract body  of
704b6c7432cf A bit more pattern-matching in eta_contract
paulson
parents: 2227
diff changeset
   238
        body' as (f $ Bound 0) => 
2792
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   239
	  if loose_bvar1(f,0) then Abs(a,T,body')
2616
704b6c7432cf A bit more pattern-matching in eta_contract
paulson
parents: 2227
diff changeset
   240
	  else incr_boundvars ~1 f 
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   241
      | body' => Abs(a,T,body'))
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   242
  | eta_contract(f$t) = eta_contract f $ eta_contract t
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   243
  | eta_contract t = t;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   244
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   245
2792
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   246
(* sharing:
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   247
local
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   248
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   249
fun eta(Abs(x,T,t)) =
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   250
     (case eta t of
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   251
        None => (case t of
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   252
                   f $ Bound 0 => if loose_bvar1(f,0)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   253
                                  then None
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   254
                                  else Some(incr_boundvars ~1 f)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   255
                 | _ => None)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   256
      | Some(t') => (case t' of
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   257
                       f $ Bound 0 => if loose_bvar1(f,0)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   258
                                      then Some(Abs(x,T,t'))
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   259
                                      else Some(incr_boundvars ~1 f)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   260
                     | _ => Some(Abs(x,T,t'))))
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   261
  | eta(s$t) = (case (eta s,eta t) of
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   262
                  (None,   None)    => None
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   263
                | (None,   Some t') => Some(s  $ t')
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   264
                | (Some s',None)    => Some(s' $ t)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   265
                | (Some s',Some t') => Some(s' $ t'))
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   266
  | eta _ = None
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   267
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   268
in
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   269
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   270
fun eta_contract t = case eta t of None => t | Some(t') => t';
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   271
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   272
end; *)
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   273
2725
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   274
(*Eta-contract a term from outside: just enough to reduce it to an atom*)
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   275
fun eta_contract_atom (t0 as Abs(a, T, body)) = 
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   276
      (case  eta_contract2 body  of
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   277
        body' as (f $ Bound 0) => 
2792
6c17c5ec3d8b Avoid eta-contraction in the simplifier.
nipkow
parents: 2751
diff changeset
   278
	    if loose_bvar1(f,0) then Abs(a,T,body')
2725
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   279
	    else eta_contract_atom (incr_boundvars ~1 f)
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   280
      | _ => t0)
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   281
  | eta_contract_atom t = t
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   282
and eta_contract2 (f$t) = f $ eta_contract_atom t
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   283
  | eta_contract2 t     = eta_contract_atom t;
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   284
9453616d4b80 Declares eta_contract_atom; fixed comment; some tidying
paulson
parents: 2616
diff changeset
   285
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   286
(*Tests whether 2 terms are alpha/eta-convertible and have same type.
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   287
  Note that Consts and Vars may have more than one type.*)
2751
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   288
fun t aeconv u = aconv_aux (eta_contract_atom t, eta_contract_atom u)
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   289
and aconv_aux (Const(a,T), Const(b,U)) = a=b  andalso  T=U
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   290
  | aconv_aux (Free(a,T),  Free(b,U))  = a=b  andalso  T=U
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   291
  | aconv_aux (Var(v,T),   Var(w,U))   = eq_ix(v,w) andalso  T=U
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   292
  | aconv_aux (Bound i,	   Bound j)    = i=j
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   293
  | aconv_aux (Abs(_,T,t), Abs(_,U,u)) = (t aeconv u)  andalso  T=U
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   294
  | aconv_aux (f$t,	   g$u)        = (f aeconv g)  andalso (t aeconv u)
673c4eefd2e1 Corrected aeconv and exported it
paulson
parents: 2725
diff changeset
   295
  | aconv_aux _ =  false;
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   296
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   297
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   298
(*** Matching ***)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   299
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   300
exception MATCH;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   301
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   302
fun typ_match tsig args = (Type.typ_match tsig args)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   303
                          handle Type.TYPE_MATCH => raise MATCH;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   304
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   305
(*First-order matching;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   306
  fomatch tsig (pattern, object) returns a (tyvar,typ)list and (var,term)list.
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   307
  The pattern and object may have variables in common.
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   308
  Instantiation does not affect the object, so matching ?a with ?a+1 works.
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   309
  Object is eta-contracted on the fly (by eta-expanding the pattern).
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   310
  Precondition: the pattern is already eta-contracted!
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   311
  Note: types are matched on the fly *)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   312
fun fomatch tsig =
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   313
  let
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   314
    fun mtch (instsp as (tyinsts,insts)) = fn
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   315
        (Var(ixn,T), t)  =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   316
	  if loose_bvar(t,0) then raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   317
	  else (case assoc_string_int(insts,ixn) of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   318
		  None => (typ_match tsig (tyinsts, (T, fastype_of t)), 
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   319
			   (ixn,t)::insts)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   320
		| Some u => if t aeconv u then instsp else raise MATCH)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   321
      | (Free (a,T), Free (b,U)) =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   322
	  if a=b then (typ_match tsig (tyinsts,(T,U)), insts) else raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   323
      | (Const (a,T), Const (b,U))  =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   324
	  if a=b then (typ_match tsig (tyinsts,(T,U)), insts) else raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   325
      | (Bound i, Bound j)  =>  if  i=j  then  instsp  else raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   326
      | (Abs(_,T,t), Abs(_,U,u))  =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   327
	  mtch (typ_match tsig (tyinsts,(T,U)),insts) (t,u)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   328
      | (f$t, g$u) => mtch (mtch instsp (f,g)) (t, u)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   329
      | (t, Abs(_,U,u))  =>  mtch instsp ((incr t)$(Bound 0), u)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   330
      | _ => raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   331
  in mtch end;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   332
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   333
fun first_order_match tsig = fomatch tsig ([],[]);
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   334
 
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   335
(* Matching of higher-order patterns *)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   336
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   337
fun match_bind(itms,binders,ixn,is,t) =
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   338
  let val js = loose_bnos t
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   339
  in if null is
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   340
     then if null js then (ixn,t)::itms else raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   341
     else if js subset_int is
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   342
          then let val t' = if downto0(is,length binders - 1) then t
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   343
                            else mapbnd (idx is) t
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   344
               in (ixn, mkabs(binders,is,t')) :: itms end
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   345
          else raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   346
  end;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   347
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   348
fun match tsg (po as (pat,obj)) =
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   349
let
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   350
  (* Pre: pat and obj have same type *)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   351
  fun mtch binders (env as (iTs,itms),(pat,obj)) =
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   352
    case pat of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   353
      Abs(ns,Ts,ts) =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   354
        (case obj of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   355
           Abs(nt,Tt,tt) => mtch ((nt,Tt)::binders) (env,(ts,tt))
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   356
         | _ => let val Tt = typ_subst_TVars iTs Ts
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   357
                in mtch((ns,Tt)::binders)(env,(ts,(incr obj)$Bound(0))) end)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   358
    | _ => (case obj of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   359
              Abs(nt,Tt,tt) =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   360
                mtch((nt,Tt)::binders)(env,((incr pat)$Bound(0),tt))
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   361
            | _ => cases(binders,env,pat,obj))
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   362
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   363
  and cases(binders,env as (iTs,itms),pat,obj) =
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   364
    let val (ph,pargs) = strip_comb pat
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   365
        fun rigrig1(iTs,oargs) =
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   366
              foldl (mtch binders) ((iTs,itms), pargs~~oargs)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   367
        fun rigrig2((a,Ta),(b,Tb),oargs) =
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   368
              if a<> b then raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   369
              else rigrig1(typ_match tsg (iTs,(Ta,Tb)), oargs)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   370
    in case ph of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   371
         Var(ixn,_) =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   372
           let val is = ints_of pargs
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   373
           in case assoc_string_int(itms,ixn) of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   374
                None => (iTs,match_bind(itms,binders,ixn,is,obj))
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   375
              | Some u => if obj aeconv (red u is []) then env
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   376
                          else raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   377
           end
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   378
       | _ =>
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   379
           let val (oh,oargs) = strip_comb obj
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   380
           in case (ph,oh) of
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   381
                (Const c,Const d) => rigrig2(c,d,oargs)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   382
              | (Free f,Free g)   => rigrig2(f,g,oargs)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   383
              | (Bound i,Bound j) => if i<>j then raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   384
                                     else rigrig1(iTs,oargs)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   385
              | (Abs _, _)        => raise Pattern
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   386
              | (_, Abs _)        => raise Pattern
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   387
              | _                 => raise MATCH
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   388
           end
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   389
    end;
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   390
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   391
  val pT = fastype_of pat
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   392
  and oT = fastype_of obj
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   393
  val iTs = typ_match tsg ([],(pT,oT))
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   394
  val insts2 = (iTs,[])
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   395
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   396
in mtch [] (insts2, po)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   397
   handle Pattern => fomatch tsg insts2 po
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   398
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   399
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   400
(*Predicate: does the pattern match the object?*)
678
6151b7f3b606 Modified pattern.ML to perform proper matching of Higher-Order Patterns.
nipkow
parents: 63
diff changeset
   401
fun matches tsig po = (match tsig po; true) handle MATCH => false;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   402
4667
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   403
(* Does pat match a subterm of obj? *)
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   404
fun matches_subterm tsig (pat,obj) =
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   405
  let fun msub(bounds,obj) = matches tsig (pat,obj) orelse
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   406
            case obj of
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   407
              Abs(x,T,t) => let val y = variant bounds x
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   408
                                val f = Free(":" ^ y,T)
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   409
                            in msub(x::bounds,subst_bound(f,t)) end
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   410
            | s$t => msub(bounds,s) orelse msub(bounds,t)
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   411
            | _ => false
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   412
  in msub([],obj) end;
6328d427a339 Tried to reorganize rewriter a little. More to be done.
nipkow
parents: 2792
diff changeset
   413
4820
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   414
fun first_order(Abs(_,_,t)) = first_order t
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   415
  | first_order(t $ u) = first_order t andalso first_order u andalso
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   416
                         not(is_Var t)
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   417
  | first_order _ = true;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   418
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   419
fun pattern(Abs(_,_,t)) = pattern t
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   420
  | pattern(t) = let val (head,args) = strip_comb t
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   421
                 in if is_Var head
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   422
                    then let val _ = ints_of args in true end
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   423
                         handle Pattern => false
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   424
                    else forall pattern args
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   425
                 end;
8f6dbbd8d497 Tried to speed up the rewriter by eta-contracting all patterns beforehand and
nipkow
parents: 4667
diff changeset
   426
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   427
end;