Orthologic Type Systems

We propose to use orthologic as the basis for designing type systems supporting intersection, union, and negation types in the presence of subtyping assumptions. We show how to extend orthologic to support monotonic and antimonotonic functions, supporting the use of type constructors in such type systems. We present a proof system for orthologic with function symbols, showing that it admits partial cut elimination. Using these insights, we present an O(n²(1+m)) algorithm for deciding the subtyping relation under m assumptions. We also show O(n²) polynomial-time normalization algorithm, allowing simplification of types to their minimal canonical form.