example: unbound slot k bounded [k, t.k] In previous binding algorithm, there are 2 candidate bindings, in which bounded k is exactly matched unbound slot k, it has higher priority than that of t1.k
example: unbound slot k bounded [k, t.k] In previous binding algorithm, there are 2 candidate bindings, in which bounded k is exactly matched unbound slot k, it has higher priority than that of t1.k