Combining Inclusion Polymorphism and Parametric Polymorphism

Simple item page
dc.creatorGlesner, Sabine
dc.creatorStroetmann, Karl
dc.date1999-06-14
dc.date.accessioned2026-07-07T03:24:08Z
dc.date.available2026-07-07T03:24:08Z
dc.descriptionWe 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/cs/9906013
dc.identifierhttp://arxiv.org/abs/cs/9906013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33213
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectD.3.3; F.3.3
dc.titleCombining Inclusion Polymorphism and Parametric Polymorphism
dc.typetext

Files

Collections

arXiv