Safe Haskell	None
Language	Haskell2010

Ouroboros.Consensus.HardFork.Combinator.Util.Tails

Contents

Synopsis

data Tails (f :: k -> k -> Type) (xs :: [k]) where
- TNil :: Tails f '[]
- TCons :: NP (f x) xs -> Tails f xs -> Tails f (x ': xs)
mk1 :: Tails f '[x]
mk2 :: f x y -> Tails f '[x, y]
mk3 :: f x y -> f x z -> f y z -> Tails f '[x, y, z]
hmap :: SListI xs => (forall x y. f x y -> g x y) -> Tails f xs -> Tails g xs
hcmap :: forall proxy c f g xs. All c xs => proxy c -> (forall x y. (c x, c y) => f x y -> g x y) -> Tails f xs -> Tails g xs
hpure :: SListI xs => (forall x y. f x y) -> Tails f xs
hcpure :: forall proxy f c xs. All c xs => proxy c -> (forall x y. (c x, c y) => f x y) -> Tails f xs

Documentation

data Tails (f :: k -> k -> Type) (xs :: [k]) where Source #

For every tail (x ': xs) of the list, an f x y for every y in xs

Constructors

TNil :: Tails f '[]
TCons :: NP (f x) xs -> Tails f xs -> Tails f (x ': xs)

Convenience constructors

mk2 :: f x y -> Tails f '[x, y] Source #

mk3 :: f x y -> f x z -> f y z -> Tails f '[x, y, z] Source #

hmap :: SListI xs => (forall x y. f x y -> g x y) -> Tails f xs -> Tails g xs Source #

hcmap :: forall proxy c f g xs. All c xs => proxy c -> (forall x y. (c x, c y) => f x y -> g x y) -> Tails f xs -> Tails g xs Source #

hpure :: SListI xs => (forall x y. f x y) -> Tails f xs Source #

hcpure :: forall proxy f c xs. All c xs => proxy c -> (forall x y. (c x, c y) => f x y) -> Tails f xs Source #