Optimizing Compilation of Polymorphic Effectful Computations with Explicit Subtyping Coercions

This paper presents an algorithm that soundly reduces and often completely eliminates redundant type and effect coercion parameters in the compilation of polymorphic effectful computations, leading to performance comparable to monomorphic code.