Singletons/Contains.hs:(0,0)-(0,0): Splicing declarations
    singletons
      [d| contains :: Eq a => a -> [a] -> Bool
          contains _ [] = False
          contains elt (h : t) = (elt == h) || (contains elt t) |]
  ======>
    contains :: Eq a => a -> [a] -> Bool
    contains _ [] = False
    contains elt (h : t) = ((elt == h) || (contains elt) t)
    type ContainsSym2 (a0123456789876543210 :: a0123456789876543210) (a0123456789876543210 :: [a0123456789876543210]) =
        Contains a0123456789876543210 a0123456789876543210
    instance SuppressUnusedWarnings (ContainsSym1 a0123456789876543210) where
      suppressUnusedWarnings = snd (((,) ContainsSym1KindInference) ())
    data ContainsSym1 (a0123456789876543210 :: a0123456789876543210) :: (~>) [a0123456789876543210] Bool
      where
        ContainsSym1KindInference :: forall a0123456789876543210
                                            a0123456789876543210
                                            arg. SameKind (Apply (ContainsSym1 a0123456789876543210) arg) (ContainsSym2 a0123456789876543210 arg) =>
                                     ContainsSym1 a0123456789876543210 a0123456789876543210
    type instance Apply (ContainsSym1 a0123456789876543210) a0123456789876543210 = Contains a0123456789876543210 a0123456789876543210
    instance SuppressUnusedWarnings ContainsSym0 where
      suppressUnusedWarnings = snd (((,) ContainsSym0KindInference) ())
    data ContainsSym0 :: forall a0123456789876543210.
                         (~>) a0123456789876543210 ((~>) [a0123456789876543210] Bool)
      where
        ContainsSym0KindInference :: forall a0123456789876543210
                                            arg. SameKind (Apply ContainsSym0 arg) (ContainsSym1 arg) =>
                                     ContainsSym0 a0123456789876543210
    type instance Apply ContainsSym0 a0123456789876543210 = ContainsSym1 a0123456789876543210
    type family Contains (a :: a) (a :: [a]) :: Bool where
      Contains _ '[] = FalseSym0
      Contains elt ('(:) h t) = Apply (Apply (||@#@$) (Apply (Apply (==@#@$) elt) h)) (Apply (Apply ContainsSym0 elt) t)
    sContains ::
      forall a (t :: a) (t :: [a]).
      SEq a =>
      Sing t -> Sing t -> Sing (Apply (Apply ContainsSym0 t) t :: Bool)
    sContains _ SNil = SFalse
    sContains (sElt :: Sing elt) (SCons (sH :: Sing h) (sT :: Sing t))
      = (applySing
           ((applySing ((singFun2 @(||@#@$)) (%||)))
              ((applySing ((applySing ((singFun2 @(==@#@$)) (%==))) sElt)) sH)))
          ((applySing
              ((applySing ((singFun2 @ContainsSym0) sContains)) sElt))
             sT)
    instance SEq a =>
             SingI (ContainsSym0 :: (~>) a ((~>) [a] Bool)) where
      sing = (singFun2 @ContainsSym0) sContains
    instance (SEq a, SingI d) =>
             SingI (ContainsSym1 (d :: a) :: (~>) [a] Bool) where
      sing = (singFun1 @(ContainsSym1 (d :: a))) (sContains (sing @d))