nameless Term.bound;
authorwenzelm
Mon, 01 Aug 2005 19:20:40 +0200
changeset 16986 68bc6dbea7d6
parent 16985 7df8abe926c3
child 16987 9ed901d738ba
nameless Term.bound;
src/Pure/net.ML
src/Pure/pattern.ML
--- a/src/Pure/net.ML	Mon Aug 01 19:20:39 2005 +0200
+++ b/src/Pure/net.ML	Mon Aug 01 19:20:40 2005 +0200
@@ -48,7 +48,7 @@
   let fun rands (f$t, cs) = CombK :: rands (f, add_key_of_terms(t, cs))
         | rands (Const(c,_), cs) = AtomK c :: cs
         | rands (Free(c,_),  cs) = AtomK c :: cs
-        | rands (Bound i,  cs)   = AtomK (Term.bound i "") :: cs
+        | rands (Bound i,  cs)   = AtomK (Term.bound i) :: cs
   in case (head_of t) of
       Var _ => VarK :: cs
     | Abs _ => VarK :: cs
@@ -181,7 +181,7 @@
                 f$t => foldr (matching unif t) nets (rands f (comb,[]))
               | Const(c,_) => look1 (atoms, c) nets
               | Free(c,_)  => look1 (atoms, c) nets
-              | Bound i    => look1 (atoms, Term.bound i "") nets
+              | Bound i    => look1 (atoms, Term.bound i) nets
               | _          => nets
   in
      case net of
--- a/src/Pure/pattern.ML	Mon Aug 01 19:20:39 2005 +0200
+++ b/src/Pure/pattern.ML	Mon Aug 01 19:20:40 2005 +0200
@@ -477,7 +477,7 @@
 
     fun variant_absfree bounds (x, T, t) =
       let
-        val (x', t') = Term.dest_abs (Term.bound bounds x, T, t);
+        val (x', t') = Term.dest_abs (Term.bound bounds, T, t);
         fun abs u = Abs (x, T, abstract_over (Free (x', T), u));
       in (abs, t') end;