Abstract

This paper studies the complexity of type inference in lambda-calculus with subtyping. Type inference is equivalent to solving systems of subtype inequalities. We consider simple types ordered structurally from an arbitrary set of base subtype assumptions. In this case, we give a PSPACE upper bound. Together with the known lower bound, this result settles completely the complexity of type inference over simple types, which is PSPACE-complete. We use a technique of independent theoretical interest that simplifies existing methods developed in the literature. Finally the algorithm, although mainly theoretical, can lead to a slight practical improvement of existing implementations.

Citations

1950	Computational complexity - Papadimitriou - 1994
874	A theory of type polymorphism in programming - Milner - 1978
84	A type system equivalent to flow analysis - Palsberg, O’Keefe - 1995
60	Subtyping constrained types - Trifonov, Smith - 1996
49	Type checking higher-order polymorphic multi-methods - Bourdoncle, Merz - 1997
37	Coercion and type inference (summary - Mitchell - 1984
34	Subtype inequalities - Tiuryn - 1992
29	Lower bounds on type inference with subtypes - Hoang, Mitchell - 1995
19	Fundamental properties of infinite trees. Theoretical Computer Science 25(2):95–169 - Courcelle - 1983
4	Some complexity bounds for subtype inequalities - Benke - 1995