Combining Inclusion Polymorphism and Parametric Polymorphism release_pgoakgshira7niilr7gnzmvc7m

by Sabine Glesner, Karl Stroetmann

Released as a article .

1999  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  182.8 kB
file_a7yetserpzh3zfoko6xtpfjmlu
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   1999-06-14
Version   v1
Language   en ?
arXiv  cs/9906013v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f8272218-f300-47eb-aaac-4eb522821175
API URL: JSON