profunctors-5.6: Profunctors

Copyright(C) 2015 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityexperimental
Portabilitynon-portable, MPTCs, fundeps
Safe HaskellSafe
LanguageHaskell2010

Data.Profunctor.Adjunction

Description

 
Synopsis

Documentation

class (ProfunctorFunctor f, ProfunctorFunctor u) => ProfunctorAdjunction f u | f -> u, u -> f where Source #

Laws:

unit . counitid
counit . unitid

Methods

unit :: Profunctor p => p :-> u (f p) Source #

counit :: Profunctor p => f (u p) :-> p Source #

Instances
ProfunctorAdjunction Copastro Cotambara Source # 
Instance details

Defined in Data.Profunctor.Strong

ProfunctorAdjunction Pastro Tambara Source # 
Instance details

Defined in Data.Profunctor.Strong

ProfunctorAdjunction Environment Closure Source # 
Instance details

Defined in Data.Profunctor.Closed

ProfunctorAdjunction CopastroSum CotambaraSum Source # 
Instance details

Defined in Data.Profunctor.Choice

ProfunctorAdjunction PastroSum TambaraSum Source # 
Instance details

Defined in Data.Profunctor.Choice

ProfunctorAdjunction (Procompose p :: (Type -> Type -> Type) -> Type -> Type -> Type) (Rift p :: (Type -> Type -> Type) -> Type -> Type -> Type) Source # 
Instance details

Defined in Data.Profunctor.Composition

Methods

unit :: Profunctor p0 => p0 :-> Rift p (Procompose p p0) Source #

counit :: Profunctor p0 => Procompose p (Rift p p0) :-> p0 Source #