Combining Inclusion Polymorphism and Parametric Polymorphism

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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 pages

Keywords

Logic in Computer Science, Programming Languages, D.3.3; F.3.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/33213

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9906013
 http://arxiv.org/abs/cs/9906013

Collections

arXiv