This paper introduces a higher-order control flow analysis for System FC, a language used as a compilation target for high-level languages such as Haskell. We extend existing analysis strategies to support FC’s type equalities and witnesses, thus broadening the applicability of type- and flow-analyses. Source languages with generalized algebraic datatypes, typeclasses with associated types, and functional dependencies can now be analyzed with higher precision than by previous monovariant analyses.