Combining Inclusion Polymorphism and Parametric Polymorphism

Details Combining Inclusion Polymorphism and Parametric Polymorphism Combining Inclusion Polymorphism and Parametric Polymorphism

1999-06-14

arxiv.org/abs/cs/9906013v1

Computer Science

Logic in Computer Science

14 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Combining Inclusion Polymorphism and Parametric Polymorphism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combining Inclusion Polymorphism and Parametric Polymorphism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combining Inclusion Polymorphism and Parametric Polymorphism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347700