Proceedings of the Second European Symposium on Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient inference of partial types
Journal of Computer and System Sciences
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
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Minimal typings in atomic subtyping
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for type inference with subtyping
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
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
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
The complexity of subtype entailment for simple types
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The First-Order Theory of Ordering Constraints over Feature Trees
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Entailment of Atomic Set Constraints is PSPACE-Complete
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The first-order theory of subtyping constraints
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simplifying subtyping constraints: a theory
Information and Computation
Non-structural subtype entailment in automata theory
Information and Computation - TACS 2001
Hi-index | 0.00 |
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize the problem equivalently by using regular expressions and word equations. This characterization induces new results on non-structural subtype entailment, constitutes a promising starting point for further investigations on decidability, and explains for the first time why the problem is so difficult. The difficulty is caused by implicit word equations that we make explicit.