Is there a fundamental reason for not being able to use quantification in a type family? I'd very much like to be able to do it, obviously turning on RankNTypes if necessary.

I'm looking for things like this:

type family Foo (x :: Bool) where
  Foo True = forall a. [a]
  Foo False = ()