Sciweavers

Share
2 search results - page 1 / 1
» Non-structural Subtype Entailment in Automata Theory
Sort
View
TACS
2001
Springer
10 years 11 days ago
Non-structural Subtype Entailment in Automata Theory
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...
Joachim Niehren, Tim Priesnitz
POPL
2002
ACM
10 years 8 months ago
The first-order theory of subtyping constraints
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...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
books