Satisfying subtype inequalities in polynomial space

Alexandre Frey
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
more » ... cal interest that simpliÿes existing methods developed in the literature. Finally, we show how our polynomial space algorithm, although mainly theoretical, can lead to a slight practical improvement of existing implementations.
doi:10.1016/s0304-3975(00)00314-5 fatcat:mgxahpykqndmdc2l34rpgis4qq