2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/33213We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the typability problem to the problem of solving a system of type inequations. The result is then obtained by showing that the solvability of the resulting system of type inequations is decidable.14 pagesLogic in Computer ScienceProgramming LanguagesD.3.3; F.3.3text