Combining Inclusion Polymorphism and Parametric Polymorphism
计算机科学中的逻辑
2007-05-23 v1 编程语言
摘要
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.
引用
@article{arxiv.cs/9906013,
title = {Combining Inclusion Polymorphism and Parametric Polymorphism},
author = {Sabine Glesner and Karl Stroetmann},
journal= {arXiv preprint arXiv:cs/9906013},
year = {2007}
}
备注
14 pages