Processing math: 100%

connections-0.0.2.1: Partial orders & Galois connections.

Safe HaskellSafe
LanguageHaskell2010

Data.Connection.Property

Synopsis

Documentation

connection :: Prd a => Prd b => Conn a b -> a -> b -> Bool Source #

x,y:fgf(x)yxg(y)

A monotone Galois connection.

closed :: Prd a => Prd b => Conn a b -> a -> Bool Source #

x:fgxgf(x)

This is a required property.

closed' :: Prd a => Prd b => Trip a b -> a -> Bool Source #

x:fgxgf(x)

This is a required property.

kernel :: Prd a => Prd b => Conn a b -> b -> Bool Source #

x:fgfg(x)x

This is a required property.

kernel' :: Prd a => Prd b => Trip a b -> b -> Bool Source #

x:fgxgf(x)

This is a required property.

monotone :: Prd a => Prd b => Conn a b -> b -> b -> Bool Source #

x,y:xyg(x)g(y)

This is a required property.

monotone' :: Prd a => Prd b => Conn a b -> a -> a -> Bool Source #

x,y:xyf(x)f(y)

This is a required property.

idempotent_unit :: Prd a => Prd b => Conn a b -> a -> Bool Source #

x:fgunitunit(x)unit(x)

idempotent_counit :: Prd a => Prd b => Conn a b -> b -> Bool Source #

x:fgcounitcounit(x)counit(x)

projective_l :: Prd a => Prd b => Conn a b -> a -> Bool Source #

x:fgcounitf(x)f(x)

See https://ncatlab.org/nlab/show/idempotent+adjunction

projective_r :: Prd a => Prd b => Conn a b -> b -> Bool Source #

x:fgunitg(x)g(x)

See https://ncatlab.org/nlab/show/idempotent+adjunction