Copyright	(C) 2014 Richard Eisenberg
License	BSD-style (see LICENSE)
Maintainer	Richard Eisenberg (eir@cis.upenn.edu)
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Data.Singletons.TypeLits

Contents

Orphan instances

Description

Defines and exports singletons useful for the Nat and Symbol kinds. This exports the internal, unsafe constructors. Use Data.Singletons.TypeLits for a safe interface.

Synopsis

Documentation

data Nat :: * #

(Kind) This is the kind of type-level natural numbers.

Instances

SNum Nat #
Methods (%:+) :: Sing Nat t -> Sing Nat t -> Sing Nat (Apply Nat Nat (Apply Nat (TyFun Nat Nat -> Type) ((:+$) Nat) t) t) # (%:-) :: Sing Nat t -> Sing Nat t -> Sing Nat (Apply Nat Nat (Apply Nat (TyFun Nat Nat -> Type) ((:-$) Nat) t) t) # (%:) :: Sing Nat t -> Sing Nat t -> Sing Nat (Apply Nat Nat (Apply Nat (TyFun Nat Nat -> Type) ((:$) Nat) t) t) # sNegate :: Sing Nat t -> Sing Nat (Apply Nat Nat (NegateSym0 Nat) t) # sAbs :: Sing Nat t -> Sing Nat (Apply Nat Nat (AbsSym0 Nat) t) # sSignum :: Sing Nat t -> Sing Nat (Apply Nat Nat (SignumSym0 Nat) t) # sFromInteger :: Sing Nat t -> Sing Nat (Apply Nat Nat (FromIntegerSym0 Nat) t) #
SEnum Nat #
Methods sSucc :: Sing Nat t -> Sing Nat (Apply Nat Nat (SuccSym0 Nat) t) # sPred :: Sing Nat t -> Sing Nat (Apply Nat Nat (PredSym0 Nat) t) # sToEnum :: Sing Nat t -> Sing Nat (Apply Nat Nat (ToEnumSym0 Nat) t) # sFromEnum :: Sing Nat t -> Sing Nat (Apply Nat Nat (FromEnumSym0 Nat) t) # sEnumFromTo :: Sing Nat t -> Sing Nat t -> Sing [Nat] (Apply Nat [Nat] (Apply Nat (TyFun Nat [Nat] -> Type) (EnumFromToSym0 Nat) t) t) # sEnumFromThenTo :: Sing Nat t -> Sing Nat t -> Sing Nat t -> Sing [Nat] (Apply Nat [Nat] (Apply Nat (TyFun Nat [Nat] -> Type) (Apply Nat (TyFun Nat (TyFun Nat [Nat] -> Type) -> Type) (EnumFromThenToSym0 Nat) t) t) t) #
PNum Nat (Proxy * Nat) #
Associated Types type ((Proxy * Nat) :+ (arg :: Proxy * Nat)) (arg :: Proxy * Nat) :: a # type ((Proxy * Nat) :- (arg :: Proxy * Nat)) (arg :: Proxy * Nat) :: a # type ((Proxy * Nat) :* (arg :: Proxy * Nat)) (arg :: Proxy * Nat) :: a # type Negate (Proxy * Nat) (arg :: Proxy * Nat) :: a # type Abs (Proxy * Nat) (arg :: Proxy * Nat) :: a # type Signum (Proxy * Nat) (arg :: Proxy * Nat) :: a # type FromInteger (Proxy * Nat) (arg :: Nat) :: a #
PEnum Nat (Proxy * Nat) #
Associated Types type Succ (Proxy * Nat) (arg :: Proxy * Nat) :: a # type Pred (Proxy * Nat) (arg :: Proxy * Nat) :: a # type ToEnum (Proxy * Nat) (arg :: Nat) :: a # type FromEnum (Proxy * Nat) (arg :: Proxy * Nat) :: Nat # type EnumFromTo (Proxy * Nat) (arg :: Proxy * Nat) (arg :: Proxy * Nat) :: [a] # type EnumFromThenTo (Proxy * Nat) (arg :: Proxy * Nat) (arg :: Proxy * Nat) (arg :: Proxy * Nat) :: [a] #
SuppressUnusedWarnings (Nat -> TyFun Nat Nat -> *) (:^$$) #
Methods suppressUnusedWarnings :: Proxy (:^$$) t -> () #
SuppressUnusedWarnings (TyFun Nat (TyFun Nat Nat -> ) -> ) (:^$) #
Methods suppressUnusedWarnings :: Proxy (:^$) t -> () #
SuppressUnusedWarnings ((TyFun a6989586621679997031 Bool -> Type) -> TyFun [a6989586621679997031] (Maybe Nat) -> *) (FindIndexSym1 a6989586621679997031) #
Methods suppressUnusedWarnings :: Proxy (FindIndexSym1 a6989586621679997031) t -> () #
SuppressUnusedWarnings ((TyFun a6989586621679997030 Bool -> Type) -> TyFun [a6989586621679997030] [Nat] -> *) (FindIndicesSym1 a6989586621679997030) #
Methods suppressUnusedWarnings :: Proxy (FindIndicesSym1 a6989586621679997030) t -> () #
SuppressUnusedWarnings ([a6989586621679997004] -> TyFun Nat a6989586621679997004 -> *) ((:!!$$) a6989586621679997004) #
Methods suppressUnusedWarnings :: Proxy ((:!!$$) a6989586621679997004) t -> () #
SuppressUnusedWarnings (Nat -> TyFun [a6989586621679997020] ([a6989586621679997020], [a6989586621679997020]) -> *) (SplitAtSym1 a6989586621679997020) #
Methods suppressUnusedWarnings :: Proxy (SplitAtSym1 a6989586621679997020) t -> () #
SuppressUnusedWarnings (Nat -> TyFun [a6989586621679997022] [a6989586621679997022] -> *) (TakeSym1 a6989586621679997022) #
Methods suppressUnusedWarnings :: Proxy (TakeSym1 a6989586621679997022) t -> () #
SuppressUnusedWarnings (Nat -> TyFun [a6989586621679997021] [a6989586621679997021] -> *) (DropSym1 a6989586621679997021) #
Methods suppressUnusedWarnings :: Proxy (DropSym1 a6989586621679997021) t -> () #
SuppressUnusedWarnings (Nat -> TyFun a6989586621679997006 [a6989586621679997006] -> *) (ReplicateSym1 a6989586621679997006) #
Methods suppressUnusedWarnings :: Proxy (ReplicateSym1 a6989586621679997006) t -> () #
SuppressUnusedWarnings (a6989586621679997033 -> TyFun [a6989586621679997033] (Maybe Nat) -> *) (ElemIndexSym1 a6989586621679997033) #
Methods suppressUnusedWarnings :: Proxy (ElemIndexSym1 a6989586621679997033) t -> () #
SuppressUnusedWarnings (a6989586621679997032 -> TyFun [a6989586621679997032] [Nat] -> *) (ElemIndicesSym1 a6989586621679997032) #
Methods suppressUnusedWarnings :: Proxy (ElemIndicesSym1 a6989586621679997032) t -> () #
SuppressUnusedWarnings (TyFun (TyFun a6989586621679997031 Bool -> Type) (TyFun [a6989586621679997031] (Maybe Nat) -> Type) -> *) (FindIndexSym0 a6989586621679997031) #
Methods suppressUnusedWarnings :: Proxy (FindIndexSym0 a6989586621679997031) t -> () #
SuppressUnusedWarnings (TyFun (TyFun a6989586621679997030 Bool -> Type) (TyFun [a6989586621679997030] [Nat] -> Type) -> *) (FindIndicesSym0 a6989586621679997030) #
Methods suppressUnusedWarnings :: Proxy (FindIndicesSym0 a6989586621679997030) t -> () #
SuppressUnusedWarnings (TyFun [a6989586621679997007] Nat -> *) (LengthSym0 a6989586621679997007) #
Methods suppressUnusedWarnings :: Proxy (LengthSym0 a6989586621679997007) t -> () #
SuppressUnusedWarnings (TyFun [a6989586621679997004] (TyFun Nat a6989586621679997004 -> Type) -> *) ((:!!$) a6989586621679997004) #
Methods suppressUnusedWarnings :: Proxy ((:!!$) a6989586621679997004) t -> () #
SuppressUnusedWarnings (TyFun Nat (TyFun [a6989586621679997020] ([a6989586621679997020], [a6989586621679997020]) -> Type) -> *) (SplitAtSym0 a6989586621679997020) #
Methods suppressUnusedWarnings :: Proxy (SplitAtSym0 a6989586621679997020) t -> () #
SuppressUnusedWarnings (TyFun Nat (TyFun [a6989586621679997022] [a6989586621679997022] -> Type) -> *) (TakeSym0 a6989586621679997022) #
Methods suppressUnusedWarnings :: Proxy (TakeSym0 a6989586621679997022) t -> () #
SuppressUnusedWarnings (TyFun Nat (TyFun [a6989586621679997021] [a6989586621679997021] -> Type) -> *) (DropSym0 a6989586621679997021) #
Methods suppressUnusedWarnings :: Proxy (DropSym0 a6989586621679997021) t -> () #
SuppressUnusedWarnings (TyFun Nat (TyFun a6989586621679997006 [a6989586621679997006] -> Type) -> *) (ReplicateSym0 a6989586621679997006) #
Methods suppressUnusedWarnings :: Proxy (ReplicateSym0 a6989586621679997006) t -> () #
SuppressUnusedWarnings (TyFun Nat a6989586621679869121 -> *) (FromIntegerSym0 a6989586621679869121) #
Methods suppressUnusedWarnings :: Proxy (FromIntegerSym0 a6989586621679869121) t -> () #
SuppressUnusedWarnings (TyFun Nat a6989586621679883002 -> *) (ToEnumSym0 a6989586621679883002) #
Methods suppressUnusedWarnings :: Proxy (ToEnumSym0 a6989586621679883002) t -> () #
SuppressUnusedWarnings (TyFun a6989586621679883002 Nat -> *) (FromEnumSym0 a6989586621679883002) #
Methods suppressUnusedWarnings :: Proxy (FromEnumSym0 a6989586621679883002) t -> () #
SuppressUnusedWarnings (TyFun a6989586621679997033 (TyFun [a6989586621679997033] (Maybe Nat) -> Type) -> *) (ElemIndexSym0 a6989586621679997033) #
Methods suppressUnusedWarnings :: Proxy (ElemIndexSym0 a6989586621679997033) t -> () #
SuppressUnusedWarnings (TyFun a6989586621679997032 (TyFun [a6989586621679997032] [Nat] -> Type) -> *) (ElemIndicesSym0 a6989586621679997032) #
Methods suppressUnusedWarnings :: Proxy (ElemIndicesSym0 a6989586621679997032) t -> () #
type DemoteRep Nat #
type DemoteRep Nat = Integer
data Sing Nat #
data Sing Nat where SNat :: Sing Nat n
type Negate Nat a #
type Negate Nat a = Error Nat Symbol "Cannot negate a natural number"
type Abs Nat a #
type Abs Nat a = a
type Signum Nat a #
type Signum Nat a
type FromInteger Nat a #
type FromInteger Nat a = a
type Succ Nat a0 #
type Succ Nat a0
type Pred Nat a0 #
type Pred Nat a0
type ToEnum Nat a0 #
type ToEnum Nat a0
type FromEnum Nat a0 #
type FromEnum Nat a0
type (==) Nat a b
type (==) Nat a b = EqNat a b
type (:==) Nat a b #
type (:==) Nat a b = (==) Nat a b
type (:/=) Nat x y #
type (:/=) Nat x y = Not ((:==) Nat x y)
type Compare Nat a b #
type Compare Nat a b = CmpNat a b
type (:<) Nat arg0 arg1 #
type (:<) Nat arg0 arg1
type (:<=) Nat arg0 arg1 #
type (:<=) Nat arg0 arg1
type (:>) Nat arg0 arg1 #
type (:>) Nat arg0 arg1
type (:>=) Nat arg0 arg1 #
type (:>=) Nat arg0 arg1
type Max Nat arg0 arg1 #
type Max Nat arg0 arg1
type Min Nat arg0 arg1 #
type Min Nat arg0 arg1
type (:+) Nat a b #
type (:+) Nat a b = (+) a b
type (:-) Nat a b #
type (:-) Nat a b = (-) a b
type (:*) Nat a b #
type (:) Nat a b = a b
type EnumFromTo Nat a1 a0 #
type EnumFromTo Nat a1 a0
type EnumFromThenTo Nat a2 a1 a0 #
type EnumFromThenTo Nat a2 a1 a0
type Apply Nat Nat ((:^$$) l1) l0 #
type Apply Nat Nat ((:^$$) l1) l0 = (:^$$$) l1 l0
type Apply Nat k2 (FromIntegerSym0 k2) l0 #
type Apply Nat k2 (FromIntegerSym0 k2) l0 = FromIntegerSym1 k2 l0
type Apply Nat k2 (ToEnumSym0 k2) l0 #
type Apply Nat k2 (ToEnumSym0 k2) l0 = ToEnumSym1 k2 l0
type Apply a6989586621679883002 Nat (FromEnumSym0 a6989586621679883002) l0 #
type Apply a6989586621679883002 Nat (FromEnumSym0 a6989586621679883002) l0 = FromEnumSym1 a6989586621679883002 l0
type Apply Nat a6989586621679997004 ((:!!$$) a6989586621679997004 l0) l1 #
type Apply Nat a6989586621679997004 ((:!!$$) a6989586621679997004 l0) l1 = (:!!$$$) a6989586621679997004 l0 l1
type Apply Nat (TyFun Nat Nat -> *) (:^$) l0 #
type Apply Nat (TyFun Nat Nat -> *) (:^$) l0 = (:^$$) l0
type Apply Nat (TyFun [a6989586621679997020] ([a6989586621679997020], [a6989586621679997020]) -> Type) (SplitAtSym0 a6989586621679997020) l0 #
type Apply Nat (TyFun [a6989586621679997020] ([a6989586621679997020], [a6989586621679997020]) -> Type) (SplitAtSym0 a6989586621679997020) l0 = SplitAtSym1 a6989586621679997020 l0
type Apply Nat (TyFun [a6989586621679997022] [a6989586621679997022] -> Type) (TakeSym0 a6989586621679997022) l0 #
type Apply Nat (TyFun [a6989586621679997022] [a6989586621679997022] -> Type) (TakeSym0 a6989586621679997022) l0 = TakeSym1 a6989586621679997022 l0
type Apply Nat (TyFun [a6989586621679997021] [a6989586621679997021] -> Type) (DropSym0 a6989586621679997021) l0 #
type Apply Nat (TyFun [a6989586621679997021] [a6989586621679997021] -> Type) (DropSym0 a6989586621679997021) l0 = DropSym1 a6989586621679997021 l0
type Apply Nat (TyFun a6989586621679997006 [a6989586621679997006] -> Type) (ReplicateSym0 a6989586621679997006) l0 #
type Apply Nat (TyFun a6989586621679997006 [a6989586621679997006] -> Type) (ReplicateSym0 a6989586621679997006) l0 = ReplicateSym1 a6989586621679997006 l0
type Apply a6989586621679997033 (TyFun [a6989586621679997033] (Maybe Nat) -> Type) (ElemIndexSym0 a6989586621679997033) l0 #
type Apply a6989586621679997033 (TyFun [a6989586621679997033] (Maybe Nat) -> Type) (ElemIndexSym0 a6989586621679997033) l0 = ElemIndexSym1 a6989586621679997033 l0
type Apply a6989586621679997032 (TyFun [a6989586621679997032] [Nat] -> Type) (ElemIndicesSym0 a6989586621679997032) l0 #
type Apply a6989586621679997032 (TyFun [a6989586621679997032] [Nat] -> Type) (ElemIndicesSym0 a6989586621679997032) l0 = ElemIndicesSym1 a6989586621679997032 l0
type Apply [a6989586621679997007] Nat (LengthSym0 a6989586621679997007) l0 #
type Apply [a6989586621679997007] Nat (LengthSym0 a6989586621679997007) l0 = LengthSym1 a6989586621679997007 l0
type Apply [a6989586621679997033] (Maybe Nat) (ElemIndexSym1 a6989586621679997033 l0) l1 #
type Apply [a6989586621679997033] (Maybe Nat) (ElemIndexSym1 a6989586621679997033 l0) l1 = ElemIndexSym2 a6989586621679997033 l0 l1
type Apply [a6989586621679997031] (Maybe Nat) (FindIndexSym1 a6989586621679997031 l0) l1 #
type Apply [a6989586621679997031] (Maybe Nat) (FindIndexSym1 a6989586621679997031 l0) l1 = FindIndexSym2 a6989586621679997031 l0 l1
type Apply [a6989586621679997032] [Nat] (ElemIndicesSym1 a6989586621679997032 l0) l1 #
type Apply [a6989586621679997032] [Nat] (ElemIndicesSym1 a6989586621679997032 l0) l1 = ElemIndicesSym2 a6989586621679997032 l0 l1
type Apply [a6989586621679997030] [Nat] (FindIndicesSym1 a6989586621679997030 l0) l1 #
type Apply [a6989586621679997030] [Nat] (FindIndicesSym1 a6989586621679997030 l0) l1 = FindIndicesSym2 a6989586621679997030 l0 l1
type Apply [a6989586621679997004] (TyFun Nat a6989586621679997004 -> Type) ((:!!$) a6989586621679997004) l0 #
type Apply [a6989586621679997004] (TyFun Nat a6989586621679997004 -> Type) ((:!!$) a6989586621679997004) l0 = (:!!$$) a6989586621679997004 l0
type Apply (TyFun a6989586621679997031 Bool -> Type) (TyFun [a6989586621679997031] (Maybe Nat) -> Type) (FindIndexSym0 a6989586621679997031) l0 #
type Apply (TyFun a6989586621679997031 Bool -> Type) (TyFun [a6989586621679997031] (Maybe Nat) -> Type) (FindIndexSym0 a6989586621679997031) l0 = FindIndexSym1 a6989586621679997031 l0
type Apply (TyFun a6989586621679997030 Bool -> Type) (TyFun [a6989586621679997030] [Nat] -> Type) (FindIndicesSym0 a6989586621679997030) l0 #
type Apply (TyFun a6989586621679997030 Bool -> Type) (TyFun [a6989586621679997030] [Nat] -> Type) (FindIndicesSym0 a6989586621679997030) l0 = FindIndicesSym1 a6989586621679997030 l0

data Symbol :: * #

(Kind) This is the kind of type-level symbols. Declared here because class IP needs it

Instances

KnownSymbol a => SingI Symbol a
Methods sing :: Sing a a
SingKind Symbol (KProxy Symbol)
Associated Types type DemoteRep (KProxy Symbol) (kparam :: KProxy (KProxy Symbol)) :: * Methods fromSing :: Sing (KProxy Symbol) a -> DemoteRep (KProxy Symbol) kparam
data Sing Symbol
data Sing Symbol where SSym :: Sing Symbol s
type DemoteRep Symbol #
type DemoteRep Symbol = String
data Sing Symbol #
data Sing Symbol where SSym :: Sing Symbol n
type (==) Symbol a b
type (==) Symbol a b = EqSymbol a b
type (:==) Symbol a b #
type (:==) Symbol a b = (==) Symbol a b
type (:/=) Symbol x y #
type (:/=) Symbol x y = Not ((:==) Symbol x y)
type Compare Symbol a b #
type Compare Symbol a b = CmpSymbol a b
type (:<) Symbol arg0 arg1 #
type (:<) Symbol arg0 arg1
type (:<=) Symbol arg0 arg1 #
type (:<=) Symbol arg0 arg1
type (:>) Symbol arg0 arg1 #
type (:>) Symbol arg0 arg1
type (:>=) Symbol arg0 arg1 #
type (:>=) Symbol arg0 arg1
type Max Symbol arg0 arg1 #
type Max Symbol arg0 arg1
type Min Symbol arg0 arg1 #
type Min Symbol arg0 arg1
type DemoteRep Symbol (KProxy Symbol)
type DemoteRep Symbol (KProxy Symbol) = String

data family Sing (a :: k) #

The singleton kind-indexed data family.

Instances

data Sing Bool #
data Sing Bool where SFalse :: Sing Bool z STrue :: Sing Bool z
data Sing Ordering #
data Sing Ordering where SLT :: Sing Ordering z SEQ :: Sing Ordering z SGT :: Sing Ordering z
data Sing * #
data Sing * where STypeRep :: Sing * a
data Sing Nat #
data Sing Nat where SNat :: Sing Nat n
data Sing Symbol #
data Sing Symbol where SSym :: Sing Symbol n
data Sing () #
data Sing () where STuple0 :: Sing () z
data Sing [a0] #
data Sing [a0] where SNil :: Sing [a] z SCons :: Sing [a] z
data Sing (Maybe a0) #
data Sing (Maybe a0) where SNothing :: Sing (Maybe a) z SJust :: Sing (Maybe a) z
data Sing (NonEmpty a0) #
data Sing (NonEmpty a0) where (:%\|) :: Sing (NonEmpty a) z
data Sing (Either a0 b0) #
data Sing (Either a0 b0) where SLeft :: Sing (Either a b) z SRight :: Sing (Either a b) z
data Sing (a0, b0) #
data Sing (a0, b0) where STuple2 :: Sing (a, b) z
data Sing ((~>) k1 k2) #
data Sing ((~>) k1 k2) = SLambda { applySing :: forall t. Sing k1 t -> Sing k2 ((@@) k1 k2 f t) }
data Sing (a0, b0, c0) #
data Sing (a0, b0, c0) where STuple3 :: Sing (a, b, c) z
data Sing (a0, b0, c0, d0) #
data Sing (a0, b0, c0, d0) where STuple4 :: Sing (a, b, c, d) z
data Sing (a0, b0, c0, d0, e0) #
data Sing (a0, b0, c0, d0, e0) where STuple5 :: Sing (a, b, c, d, e) z
data Sing (a0, b0, c0, d0, e0, f0) #
data Sing (a0, b0, c0, d0, e0, f0) where STuple6 :: Sing (a, b, c, d, e, f) z
data Sing (a0, b0, c0, d0, e0, f0, g0) #
data Sing (a0, b0, c0, d0, e0, f0, g0) where STuple7 :: Sing (a, b, c, d, e, f, g) z

type SNat x = Sing x #

Kind-restricted synonym for Sing for Nats

type SSymbol x = Sing x #

Kind-restricted synonym for Sing for Symbols

withKnownNat :: Sing n -> (KnownNat n => r) -> r #

Given a singleton for Nat, call something requiring a KnownNat instance.

withKnownSymbol :: Sing n -> (KnownSymbol n => r) -> r #

Given a singleton for Symbol, call something requiring a KnownSymbol instance.

type family Error (str :: k0) :: k #

The promotion of error. This version is more poly-kinded for easier use.

data ErrorSym0 l #

Instances

SuppressUnusedWarnings (TyFun k06989586621679857097 k6989586621679857099 -> *) (ErrorSym0 k06989586621679857097 k6989586621679857099) #
Methods suppressUnusedWarnings :: Proxy (ErrorSym0 k06989586621679857097 k6989586621679857099) t -> () #
type Apply k06989586621679857097 k2 (ErrorSym0 k06989586621679857097 k2) l0 #
type Apply k06989586621679857097 k2 (ErrorSym0 k06989586621679857097 k2) l0 = ErrorSym1 k2 k06989586621679857097 l0

type ErrorSym1 t = Error t #

sError :: Sing (str :: Symbol) -> a #

The singleton for error

class KnownNat n #

This class gives the integer associated with a type-level natural. There are instances of the class for every concrete literal: 0, 1, 2, etc.

Since: 4.7.0.0

Minimal complete definition

natSing

natVal :: KnownNat n => proxy n -> Integer #

Since: 4.7.0.0

class KnownSymbol n #

This class gives the string associated with a type-level symbol. There are instances of the class for every concrete literal: "hello", etc.

Since: 4.7.0.0

Minimal complete definition

symbolSing

symbolVal :: KnownSymbol n => proxy n -> String #

Since: 4.7.0.0

type (:^) a b = a ^ b infixr 8 #

data (:^$) l #

Instances

SuppressUnusedWarnings (TyFun Nat (TyFun Nat Nat -> ) -> ) (:^$) #
Methods suppressUnusedWarnings :: Proxy (:^$) t -> () #
type Apply Nat (TyFun Nat Nat -> *) (:^$) l0 #
type Apply Nat (TyFun Nat Nat -> *) (:^$) l0 = (:^$$) l0

data l :^$$ l #

Instances

SuppressUnusedWarnings (Nat -> TyFun Nat Nat -> *) (:^$$) #
Methods suppressUnusedWarnings :: Proxy (:^$$) t -> () #
type Apply Nat Nat ((:^$$) l1) l0 #
type Apply Nat Nat ((:^$$) l1) l0 = (:^$$$) l1 l0

type (:^$$$) t t = (:^) t t #

Orphan instances

Num Nat #
Methods (+) :: Nat -> Nat -> Nat # (-) :: Nat -> Nat -> Nat # (*) :: Nat -> Nat -> Nat # negate :: Nat -> Nat # abs :: Nat -> Nat # signum :: Nat -> Nat # fromInteger :: Integer -> Nat #