在Haskell中，如何对多类型类型进行重新排序

{-# LANGUAGE TypeFamilies #-}

type family List (xs :: [*]) :: *
type instance List '[] = ()
type instance List (x ': xs) = (x, List xs)

{-# LANGUAGE TypeApplications #-}

type family Reorder (xs :: [*]) (t :: *) :: [*]
type instance Reorder '[] t = '[]
type instance Reorder (x ': xs) t = Reorder' (FindIndex x xs) (x ': xs) t

type family Reorder' (n :: Maybe Nat) (xs :: [*]) (t :: *) :: [*]
type instance Reorder' Nothing xs t = xs
type instance Reorder' (Just n) xs t = Reorder'' n xs t

type family Reorder'' (n :: Nat) (xs :: [*]) (t :: *) :: [*]
type instance Reorder'' 0 (x ': xs) t = t ': xs
type instance Reorder'' n (x ': xs) t = x ': Reorder'' (n - 1) xs t

type family FindIndex (x :: *) (xs :: [*]) :: Maybe Nat
type instance FindIndex x '[] = Nothing
type instance FindIndex x (x ': xs) = Just 0
type instance FindIndex x (y ': xs) = AddMaybeOne (FindIndex x xs)

type family AddMaybeOne (n :: Maybe Nat) :: Maybe Nat
type instance AddMaybeOne Nothing = Nothing
type instance AddMaybeOne (Just n) = Just (n + 1)

type ReorderedList = Reorder '[Int, Bool, Char] Bool