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
.
Satisfying subtype inequalities in polynomial space
2002
Theoretical Computer Science
This paper studies the complexity of type inference in -calculus with subtyping. Infering types is equivalent to solving systems of subtype inequalities. These inequalities are solved over simple types ordered structurally from an arbitrary set of base subtype assumptions. In this case, we give a new PSPACE upper bound. Together with the previously known lower bound, this result settles completely the complexity of the problem, which is PSPACE-complete. We use a technique of independent
doi:10.1016/s0304-3975(00)00314-5
fatcat:mgxahpykqndmdc2l34rpgis4qq