Fcf.Data.Function

Simple combinators for functions.

Documentation

data (&) :: a -> (a -> Exp b) -> Exp b infixl 1

Reverse function application, argument first.

Example

>>> :kind! Eval ('(True, Nothing) & Fst)
Eval ('(True, Nothing) & Fst) :: Bool
= True

Instances

type Eval (x & f :: a2 -> Type)

Defined in Fcf.Data.Function

type Eval (x & f :: a2 -> Type) = Eval (f x)

data On :: (b -> b -> Exp c) -> (a -> Exp b) -> a -> a -> Exp c

Lift a binary function to the domain of a projection.

Example

>>> :kind! Eval (((&&) `On` Fst) '(True, Nothing) '(False, Just '()))
Eval (((&&) `On` Fst) '(True, Nothing) '(False, Just '())) :: Bool
= False

Instances

type Eval (On r f x y :: a2 -> Type)

Defined in Fcf.Data.Function

type Eval (On r f x y :: a2 -> Type) = Eval (r (Eval (f x)) (Eval (f y)))

data Bicomap :: (a -> Exp c) -> (b -> Exp d) -> (c -> d -> Exp e) -> a -> b -> Exp e

Pre-compose a binary function with a function for each argument.

Example

>>> :kind! Eval (Bicomap Fst Pure (||) '(False, Nothing) True)
Eval (Bicomap Fst Pure (||) '(False, Nothing) True) :: Bool
= True

Instances

type Eval (Bicomap f g r x y :: a4 -> Type)

Defined in Fcf.Data.Function

type Eval (Bicomap f g r x y :: a4 -> Type) = Eval (r (Eval (f x)) (Eval (g y)))