The device of intersection types and type constants representing
unsolvability and singleton sets of $\lambda$-terms are incorporated
into Curry version of simple type assignment system.  A restricted
typability of the system so obtained turns out to be equivalent to
finiteness of B\"ohm-trees.