A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Optimal representations of polymorphic types with subtyping (Extended abstract)
[chapter]
1997
Lecture Notes in Computer Science
Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpli ed by eliminating quanti ed variables. Eliminating variables both improves the readability of types and the performance of algorithms whose complexity depends on the number of type variables. We present an algorithm for simplifying quanti ed types in the presence of subtyping and prove it is sound and
doi:10.1007/bfb0014547
fatcat:m3unkvrjhvd2rctuektuvrmjqq