We present an extension of the Hindley/Milner polymorphic type system that deals with overloading. The system uses a kind of bounded polymorphic type to describe the nonuniform polymorphism resulting from the use of overloaded identifiers. We consider the type inference problem for our system and show that it is undecidable. Restrictions are proposed to cope with this limitation.