Satisfying subtype inequalities in polynomial space

Authors:
Alexandre Frey
Affiliations:
École des Mines de Paris, Paris, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 11
Cited 2

Type inference with subtypes

Proceedings of the Second European Symposium on Programming
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient recursive subtyping

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unification theory

Handbook of logic in artificial intelligence and logic programming
Lower bounds on type inference with subtypes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system equivalent to flow analysis

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type checking higher-order polymorphic multi-methods

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type Reconstruction with Recursive Types and Atomic Subtyping

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Polymorphic Subtype Inference: Closing the Theory-Practice Gap

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Subtyping Constrained Types

SAS '96 Proceedings of the Third International Symposium on Static Analysis
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Complexity of subtype satisfiability over posets

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Extending hindley-milner type inference with coercive structural subtyping

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper studies the complexity of type inference in &lgr;-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 theoretical interest that simplifies 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. Copyright 2002 Elsevier Science B.V.