id package:constrained-categories

id :: (Category k, Object k a) => k a a
constrained-categories Control.Category.Constrained Control.Category.Constrained.Prelude
pattern Id :: CRCategory k => (β ~ α, Object k α) => k α β
constrained-categories Control.Category.Constrained.Reified.PolyPattern
class (Functor f r t, Cartesian r, Cartesian t, Object t (f (UnitObject r))) => Monoidal f r t
constrained-categories Control.Applicative.Constrained Control.Category.Constrained.Prelude
class Semigroup a => Monoid a
constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following: The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.
CartesianId :: Object k α => ReCartesian k α α
constrained-categories Control.Category.Constrained.Reified
CategoryId :: Object k α => ReCategory k α α
constrained-categories Control.Category.Constrained.Reified
MorphismId :: Object k α => ReMorphism k α α
constrained-categories Control.Category.Constrained.Reified
PreArrowId :: Object k α => RePreArrow k α α
constrained-categories Control.Category.Constrained.Reified
WellPointedId :: Object k α => ReWellPointed k α α
constrained-categories Control.Category.Constrained.Reified
match_id :: CRCategory k => k α β -> IdPattern k α β
constrained-categories Control.Category.Constrained.Reified.PolyPattern
void :: (Monad m k, PreArrow k, Object k a, Object k (m a), ObjectPair k a u, u ~ UnitObject k) => m a `k` m (UnitObject k)
constrained-categories Control.Monad.Constrained