Intersection and union type assignment systems are powerful tools for reasoning programs that completely characterise many semantic properties such as strong normalisation. At the same time, they are known to be subtle, particularly in the presence of computational effect. To address the difficulty, this paper develops an approach based on polarities and refinement intersection type systems. We...
