D<: subtyping and typing are undecidable, but removing the bad-bounds rule and restricting comparison of function types yields decidable fragments with complete algorithms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Undecidability of $D_{<:}$ and Its Decidable Fragments
D<: subtyping and typing are undecidable, but removing the bad-bounds rule and restricting comparison of function types yields decidable fragments with complete algorithms.