Making (:>) of kind p -> q -> Type instead of k -> Type -> Type

[bruderj15]

When looking at layers of an API I need to store or match against prefix :> (sym :: Symbol) which is not possible due to:

type (:>) :: k -> Type -> Type

whereas I would need

type (:>) :: k -> p -> Type

Currently I rewrite all APIs wrapping every Symbol with data Sym (sym :: Symbol).
Is there a reason why we cannot do type (:>) :: k -> p -> Type?