2 search results - page 1 / 1 » Non-structural Subtype Entailment in Automata Theory |
TACS
2001
Springer
13 years 9 months ago
2001
Springer
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...
POPL
2002
ACM
14 years 4 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...