Data.Singletons.Prelude.Void

Defines functions and datatypes relating to the singleton for Void, including a singleton version of all the definitions in Data.Void.

Because many of these definitions are produced by Template Haskell, it is not possible to create proper Haddock documentation. Please look up the corresponding operation in Data.Void. Also, please excuse the apparent repeated variable names. This is due to an interaction between Template Haskell and Haddock.

The Void singleton

type family Sing :: k -> Type

The singleton kind-indexed type family.

Instances

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SBool

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SOrdering

type Sing

Defined in Data.Singletons.TypeLits.Internal

type Sing = SNat

type Sing

Defined in Data.Singletons.TypeLits.Internal

type Sing = SSymbol

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple0

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SVoid

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SAll

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SAny

type Sing

Defined in Data.Singletons.TypeError

type Sing = SErrorMessage

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SList :: [a] -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SMaybe :: Maybe a -> Type

type Sing

A choice of singleton for the kind TYPE rep (for some RuntimeRep rep), an instantiation of which is the famous kind Type.

Conceivably, one could generalize this instance to `Sing @k` for any kind k, and remove all other Sing instances. We don't adopt this design, however, since it is far more convenient in practice to work with explicit singleton values than TypeReps (for instance, TypeReps are more difficult to pattern match on, and require extra runtime checks).

We cannot produce explicit singleton values for everything in TYPE rep, however, since it is an open kind, so we reach for TypeRep in this one particular case.

Defined in Data.Singletons.TypeRepTYPE

type Sing = TypeRep :: TYPE rep -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SMin :: Min a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SMax :: Max a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SFirst :: First a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SLast :: Last a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SWrappedMonoid :: WrappedMonoid m -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SOption :: Option a -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SIdentity :: Identity a -> Type

type Sing

Defined in Data.Singletons.Prelude.Monoid

type Sing = SFirst :: First a -> Type

type Sing

Defined in Data.Singletons.Prelude.Monoid

type Sing = SLast :: Last a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SDual :: Dual a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SSum :: Sum a -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup.Internal

type Sing = SProduct :: Product a -> Type

type Sing

Defined in Data.Singletons.Prelude.Ord

type Sing = SDown :: Down a -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SNonEmpty :: NonEmpty a -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = SEither :: Either a b -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple2 :: (a, b) -> Type

type Sing

Defined in Data.Singletons.Prelude.Semigroup

type Sing = SArg :: Arg a b -> Type

type Sing

Defined in Data.Singletons.Internal

type Sing = SLambda :: (k1 ~> k2) -> Type

type Sing

Defined in Data.Singletons.Internal

type Sing = SWrappedSing :: WrappedSing a -> Type

type Sing

Defined in Data.Singletons.Sigma

type Sing = SSigma :: Sigma s t -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple3 :: (a, b, c) -> Type

type Sing

Defined in Data.Singletons.Prelude.Const

type Sing = SConst :: Const a b -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple4 :: (a, b, c, d) -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple5 :: (a, b, c, d, e) -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple6 :: (a, b, c, d, e, f) -> Type

type Sing

Defined in Data.Singletons.Prelude.Instances

type Sing = STuple7 :: (a, b, c, d, e, f, g) -> Type

Just as Void has no constructors, the Sing instance above also has no constructors.

data SVoid :: Void -> Type

Instances

TestCoercion SVoid

Defined in Data.Singletons.Prelude.Instances

Methods

testCoercion :: forall (a :: k) (b :: k). SVoid a -> SVoid b -> Maybe (Coercion a b)

TestEquality SVoid

Defined in Data.Singletons.Prelude.Instances

Methods

testEquality :: forall (a :: k) (b :: k). SVoid a -> SVoid b -> Maybe (a :~: b)

Show (SVoid z)

Defined in Data.Singletons.ShowSing

Methods

showsPrec :: Int -> SVoid z -> ShowS

show :: SVoid z -> String

showList :: [SVoid z] -> ShowS

SVoid is a kind-restricted synonym for Sing: type SVoid (a :: Void) = Sing a

Singletons from Data.Void

type family Absurd (a :: Void) :: a where ...

Equations

Absurd a = Case_6989586621679369450 a a

sAbsurd :: forall a (t :: Void). Sing t -> Sing (Apply AbsurdSym0 t :: a)

Defunctionalization symbols

data AbsurdSym0 :: forall a6989586621679369444. (~>) Void a6989586621679369444

Instances

SingI (AbsurdSym0 :: TyFun Void a -> Type)

Defined in Data.Singletons.Prelude.Void

Methods

sing :: Sing AbsurdSym0

SuppressUnusedWarnings (AbsurdSym0 :: TyFun Void a6989586621679369444 -> Type)

Defined in Data.Singletons.Prelude.Void

Methods

suppressUnusedWarnings :: ()

type Apply (AbsurdSym0 :: TyFun Void k2 -> Type) (a6989586621679369447 :: Void)

Defined in Data.Singletons.Prelude.Void

type Apply (AbsurdSym0 :: TyFun Void k2 -> Type) (a6989586621679369447 :: Void) = Absurd a6989586621679369447 :: k2

type AbsurdSym1 (a6989586621679369447 :: Void) = Absurd a6989586621679369447