Complexity of subtype satisfiability over posets

Authors:
Joachim Niehren;Tim Priesnitz;Zhendong Su
Affiliations:
INRIA Futurs, Lille, France;Programming Systems Lab, Saarland University, Saarbrücken, Germany;Department of Computer Science, University of California, Davis, CA
Venue:
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Year:
2005

Citing 23
Cited 1

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Type inference with subtypes

Proceedings of the Second European Symposium on Programming
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient inference of partial types

Journal of Computer and System Sciences
Haskell overloading is DEXPTIME-complete

Information Processing Letters
Lower bounds on type inference with subtypes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sound polymorphic type inference for objects

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
Simplifying subtyping constraints

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Satisfiability of inequalities in a poset

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Componential set-based analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
The first-order theory of subtyping constraints

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic Logic

Dynamic Logic
Satisfying subtype inequalities in polynomial space

Theoretical Computer Science
Inessential Features

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Entailment of Non-structural Subtype Constraints

ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Constraint Automata and the Complexity of Recursive Subtype Entailment

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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
Subtyping Constrained Types

SAS '96 Proceedings of the Third International Symposium on Static Analysis
The complexity of subtype entailment for simple types

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Structural Subtyping of Non-Recursive Types is Decidable

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Non-structural subtype entailment in automata theory

Information and Computation - TACS 2001
Complexity of subtype satisfiability over posets

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Complexity of subtype satisfiability over posets

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subtype satisfiability is an important problem for designing advanced subtype systems and subtype-based program analysis algorithms. The problem is well understood if the atomic types form a lattice. However, little is known about subtype satisfiability over posets. In this paper, we investigate algorithms for and the complexity of subtype satisfiability over general posets.We present a uniform treatment of different flavors of subtyping: simple versus recursive types and structural versus non-structural subtype orders.Our results are established through a new connection of subtype constraints and modal logic. As a consequence, we settle a problem left open by Tiuryn and Wand in 1993.