data TH_reifyDecl1.T = TH_reifyDecl1.A | TH_reifyDecl1.B
data TH_reifyDecl1.R (a_0 :: *)
    = TH_reifyDecl1.C a_0 | TH_reifyDecl1.D
data TH_reifyDecl1.List (a_0 :: *)
    = TH_reifyDecl1.Nil
    | TH_reifyDecl1.Cons a_0 (TH_reifyDecl1.List a_0)
data TH_reifyDecl1.Tree (a_0 :: k_1)
    = TH_reifyDecl1.Leaf
    | (TH_reifyDecl1.Tree a_0) TH_reifyDecl1.:+: (TH_reifyDecl1.Tree a_0)
type TH_reifyDecl1.IntList = [GHC.Types.Int]
newtype TH_reifyDecl1.Length = TH_reifyDecl1.Length GHC.Types.Int
Constructor from TH_reifyDecl1.Tree: TH_reifyDecl1.Leaf :: forall (k_0 :: *) (a_1 :: k_0) .
                                                           TH_reifyDecl1.Tree a_1
Class op from TH_reifyDecl1.C1: TH_reifyDecl1.m1 :: forall (a_0 :: *) . TH_reifyDecl1.C1 a_0 =>
                                                    a_0 -> GHC.Types.Int
class TH_reifyDecl1.C1 (a_0 :: *)
    where TH_reifyDecl1.m1 :: a_0 -> GHC.Types.Int
class TH_reifyDecl1.C2 (a_0 :: *)
    where TH_reifyDecl1.m2 :: a_0 -> GHC.Types.Int
instance TH_reifyDecl1.C2 GHC.Types.Int
class TH_reifyDecl1.C3 (a_0 :: k_1)
    where type TH_reifyDecl1.AT1 (a_0 :: k_1) :: *
          data TH_reifyDecl1.AT2 (a_0 :: k_1) :: *
instance TH_reifyDecl1.C3 GHC.Types.Int
type family TH_reifyDecl1.AT1 (a_0 :: k_1) :: *
type instance TH_reifyDecl1.AT1 GHC.Types.Int = GHC.Types.Bool
data family TH_reifyDecl1.AT2 (a_0 :: k_1) :: *
data instance TH_reifyDecl1.AT2 GHC.Types.Int
    = TH_reifyDecl1.AT2Int
type family TH_reifyDecl1.TF1 (a_0 :: *) :: *
type family TH_reifyDecl1.TF2 (a_0 :: *) :: *
type instance TH_reifyDecl1.TF2 GHC.Types.Bool = GHC.Types.Bool
data family TH_reifyDecl1.DF1 (a_0 :: *) :: *
data family TH_reifyDecl1.DF2 (a_0 :: *) :: *
data instance TH_reifyDecl1.DF2 GHC.Types.Bool
    = TH_reifyDecl1.DBool
data family TH_reifyDecl1.DF3 (a_0 :: k_1) :: *
data instance forall (a_2 :: *). TH_reifyDecl1.DF3 (a_2 :: *)
    = TH_reifyDecl1.DF3Bool
data instance forall (b_3 :: * ->
                             *). TH_reifyDecl1.DF3 (b_3 :: * -> *)
    = TH_reifyDecl1.DF3Char