Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. module Data.Bin.Pos

   No documentation available.

2. data Pos (b :: Bin)

   bin	Data.Bin.Pos

   Pos is to Bin is what Fin is to Nat. The name is picked, as the lack of better alternatives.

3. Pos :: forall (b1 :: BinP) . PosP b1 -> Pos ('BP b1)

   bin	Data.Bin.Pos

   No documentation available.

4. data PosP (b :: BinP)

   bin	Data.Bin.Pos

   PosP is to BinP is what Fin is to Nat, when n is Z.

5. module Data.BinP.PosP

   No documentation available.

6. newtype PosP (b :: BinP)

   bin	Data.BinP.PosP

   PosP is to BinP is what Fin is to Nat, when n is Z.

7. PosP :: PosP' 'Z b -> PosP (b :: BinP)

   bin	Data.BinP.PosP

   No documentation available.

8. data PosP' (n :: Nat) (b :: BinP)

   bin	Data.BinP.PosP

   PosP' is a structure inside PosP.

9. type family Plus (a :: Bin) (b :: Bin) :: Bin

   bin	Data.Type.Bin

   Addition.

   >>> :kind! Plus Bin3 Bin3 == Bin6
   Plus Bin3 Bin3 == Bin6 :: Bool
   = 'True
   

   >>> :kind! Mult2 Bin3 == Bin6
   Mult2 Bin3 == Bin6 :: Bool
   = 'True
   

10. type family Pred (b :: BinP) :: Bin

    bin	Data.Type.Bin

    Predecessor type family..

    >>> :kind! Pred BP.BinP1
    Pred BP.BinP1 :: Bin
    = 'BZ
    

    >>> :kind! Pred BP.BinP5 == Bin4
    Pred BP.BinP5 == Bin4 :: Bool
    = 'True
    

    >>> :kind! Pred BP.BinP8 == Bin7
    Pred BP.BinP8 == Bin7 :: Bool
    = 'True
    

    >>> :kind! Pred BP.BinP6 == Bin5
    Pred BP.BinP6 == Bin5 :: Bool
    = 'True
    

Page 1219 of many | Previous | Next