Singletons/Maybe.hs:0:0: Splicing declarations
    singletons
      [d| data Maybe a
            = Nothing | Just a
            deriving (Eq, Show) |]
  ======>
    Singletons/Maybe.hs:(0,0)-(0,0)
    data Maybe a
      = Nothing | Just a
      deriving (Eq, Show)
    type instance (:==) Nothing Nothing = TrueSym0
    type instance (:==) Nothing (Just b) = FalseSym0
    type instance (:==) (Just a) Nothing = FalseSym0
    type instance (:==) (Just a) (Just b) = :== a b
    type MaybeTyCtor = Maybe
    data MaybeTyCtorSym0 (k :: TyFun * *)
    type instance Apply MaybeTyCtorSym0 a = MaybeTyCtor a
    type NothingSym0 = Nothing
    data JustSym0 (k :: TyFun a (Maybe a))
    type instance Apply JustSym0 a = Just a
    data instance Sing (z :: Maybe a)
      = z ~ Nothing => SNothing |
        forall (n :: a). z ~ Just n => SJust (Sing n)
    type SMaybe (z :: Maybe a) = Sing z
    instance SingKind (KProxy :: KProxy a) =>
             SingKind (KProxy :: KProxy (Maybe a)) where
      type instance DemoteRep (KProxy :: KProxy (Maybe a)) =
          Maybe (DemoteRep (KProxy :: KProxy a))
      fromSing SNothing = Nothing
      fromSing (SJust b) = Just (fromSing b)
      toSing Nothing = SomeSing SNothing
      toSing (Just b)
        = case toSing b :: SomeSing (KProxy :: KProxy a) of {
            SomeSing c -> SomeSing (SJust c) }
    instance SEq (KProxy :: KProxy a) =>
             SEq (KProxy :: KProxy (Maybe a)) where
      %:== SNothing SNothing = STrue
      %:== SNothing (SJust _) = SFalse
      %:== (SJust _) SNothing = SFalse
      %:== (SJust a) (SJust b) = (%:==) a b
    instance SDecide (KProxy :: KProxy a) =>
             SDecide (KProxy :: KProxy (Maybe a)) where
      %~ SNothing SNothing = Proved Refl
      %~ SNothing (SJust _)
        = Disproved
            (\case {
               _ -> error "Empty case reached -- this should be impossible" })
      %~ (SJust _) SNothing
        = Disproved
            (\case {
               _ -> error "Empty case reached -- this should be impossible" })
      %~ (SJust a) (SJust b)
        = case (%~) a b of {
            Proved Refl -> Proved Refl
            Disproved contra -> Disproved (\ Refl -> contra Refl) }
    instance SingI Nothing where
      sing = SNothing
    instance SingI n => SingI (Just (n :: a)) where
      sing = SJust sing