pandora-0.5.1: A box of patterns and paradigms
Safe HaskellSafe-Inferred
LanguageHaskell2010

Pandora.Core.Functor

Synopsis
  • type (#) t a = t a
  • type (:=) t a = t a
  • type (:.) t u a = t (u a)
  • type (.:) t u a = u (t a)
  • type (:=>) a t = a -> t a
  • type (:=:=>) a t = a -> t a -> t a
  • type (<:=) a t = t a -> a
  • type (~>) t u = forall a. t a -> u a
  • type (~~>) t u = forall a b. t a b -> u a b
  • type (::|:.) p a b = p (p a b) b
  • type (::|.:) p a b = p a (p a b)
  • type (::|::) p a b = p (p a b) (p a b)
  • data t ::: u :: k -> k' -> *

Documentation

type (#) t a = t a infixl 2 Source #

Arguments consuming

type (:=) t a = t a infixr 0 Source #

Parameter application

type (:.) t u a = t (u a) infixr 1 Source #

Functors composition

type (.:) t u a = u (t a) infixr 1 Source #

Flipped functors composition

type (:=>) a t = a -> t a infixr 0 Source #

Coalgebra's type operator

type (:=:=>) a t = a -> t a -> t a infixr 0 Source #

type (<:=) a t = t a -> a infixr 0 Source #

Algebra's type operator

type (~>) t u = forall a. t a -> u a infixr 0 Source #

Natural transformation

type (~~>) t u = forall a b. t a b -> u a b Source #

type (::|:.) p a b = p (p a b) b infixr 2 Source #

type (::|.:) p a b = p a (p a b) infixr 2 Source #

type (::|::) p a b = p (p a b) (p a b) infixr 2 Source #

data t ::: u :: k -> k' -> * infixr 9 Source #