In a previous paper, we have investigated unification extended with regular types restricted to an Herbrand interpretation of term functors. Here we extend this investigation allowing arbitrary interpretations for functors. This new approach leads to a new typed unification algorithm which returns most general unifiers, failure or a wrong value denoting a type error during the unification process.