We consider expressions that represent functional types where the main binary symbol is → and arbitrarily many constants are available. There are natural notions of rank and arity for such expressions that arise in the study of functional programs. We present an argument for undecidability of second-order unification in case solutions are restricted to expressions that have bounded rank, but unbounded arity.