Subtyping with union, intersection, negation, and monotone type constructors under assumptions is decidable in O(n^2(1+m)) time, and every type has a quadratic-time computable minimal normal form.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Orthologic Type Systems
Subtyping with union, intersection, negation, and monotone type constructors under assumptions is decidable in O(n^2(1+m)) time, and every type has a quadratic-time computable minimal normal form.