Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- data Unary
- unary :: Proxy n -> Proxy (Un n)
- data Un x
- data Zero
- data Succ x
- zero :: Proxy Zero
- succ :: Proxy n -> Proxy (Succ n)
- data HeadSingleton n where
- Zero :: HeadSingleton Zero
- Succ :: Natural n => HeadSingleton (Succ n)
- headSingleton :: Natural n => HeadSingleton n
- newtype Singleton n = Singleton Integer
- singleton :: Natural n => Singleton n
- singletonFromProxy :: Natural n => Proxy n -> Singleton n
- integerFromSingleton :: Natural n => Singleton n -> Integer
- integralFromSingleton :: (Natural n, Num a) => Singleton n -> a
- integralFromProxy :: (Natural n, Num a) => Proxy n -> a
- class Natural n where
- class Natural n => Positive n where
- type family x :+: y
- type family x :*: y
- reifyNatural :: Integer -> (forall s. Natural s => Proxy s -> w) -> w
Documentation
Representation name for unary type level numbers.
Instances
data HeadSingleton n where Source #
Zero :: HeadSingleton Zero | |
Succ :: Natural n => HeadSingleton (Succ n) |
headSingleton :: Natural n => HeadSingleton n Source #