Copyright	(C) 2019 Oleg Grenrus
License	BSD-3-Clause (see the file LICENSE)
Maintainer	Oleg Grenrus <oleg.grenrus@iki.fi>
Safe Haskell	Safe
Language	Haskell2010

Algebra.Lattice.N5

Description

Synopsis

data N5
- = N5o
- | N5a
- | N5b
- | N5c
- | N5i

Documentation

data N5 Source #

\(N_5\) , is smallest non-modular (and non-distributive) lattice.

Constructors

N5o
N5a
N5b
N5c
N5i

Instances

Instances details

Bounded N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods minBound :: N5 Source # maxBound :: N5 Source #
Enum N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods succ :: N5 -> N5 Source # pred :: N5 -> N5 Source # toEnum :: Int -> N5 Source # fromEnum :: N5 -> Int Source # enumFrom :: N5 -> [ N5 ] Source # enumFromThen :: N5 -> N5 -> [ N5 ] Source # enumFromTo :: N5 -> N5 -> [ N5 ] Source # enumFromThenTo :: N5 -> N5 -> N5 -> [ N5 ] Source #
Eq N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods (==) :: N5 -> N5 -> Bool Source # (/=) :: N5 -> N5 -> Bool Source #
Data N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> N5 -> c N5 Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c N5 Source # toConstr :: N5 -> Constr Source # dataTypeOf :: N5 -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c N5 ) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c N5 ) Source # gmapT :: ( forall b. Data b => b -> b) -> N5 -> N5 Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> N5 -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> N5 -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> N5 -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> N5 -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> N5 -> m N5 Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> N5 -> m N5 Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> N5 -> m N5 Source #
Ord N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods compare :: N5 -> N5 -> Ordering Source # (<) :: N5 -> N5 -> Bool Source # (<=) :: N5 -> N5 -> Bool Source # (>) :: N5 -> N5 -> Bool Source # (>=) :: N5 -> N5 -> Bool Source # max :: N5 -> N5 -> N5 Source # min :: N5 -> N5 -> N5 Source #
Read N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods readsPrec :: Int -> ReadS N5 Source # readList :: ReadS [ N5 ] Source # readPrec :: ReadPrec N5 Source # readListPrec :: ReadPrec [ N5 ] Source #
Show N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods showsPrec :: Int -> N5 -> ShowS Source # show :: N5 -> String Source # showList :: [ N5 ] -> ShowS Source #
Generic N5 Source #
Instance details Defined in Algebra.Lattice.N5 Associated Types type Rep N5 :: Type -> Type Source # Methods from :: N5 -> Rep N5 x Source # to :: Rep N5 x -> N5 Source #
Function N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods function :: ( N5 -> b) -> N5 :-> b Source #
Arbitrary N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods arbitrary :: Gen N5 Source # shrink :: N5 -> [ N5 ] Source #
CoArbitrary N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods coarbitrary :: N5 -> Gen b -> Gen b Source #
NFData N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods rnf :: N5 -> () Source #
Hashable N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods hashWithSalt :: Int -> N5 -> Int Source # hash :: N5 -> Int Source #
Universe N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods universe :: [ N5 ] Source #
Finite N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods universeF :: [ N5 ] Source # cardinality :: Tagged N5 Natural Source #
PartialOrd N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods leq :: N5 -> N5 -> Bool Source # comparable :: N5 -> N5 -> Bool Source #
BoundedMeetSemiLattice N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods top :: N5 Source #
BoundedJoinSemiLattice N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods bottom :: N5 Source #
Lattice N5 Source #
Instance details Defined in Algebra.Lattice.N5 Methods (\/) :: N5 -> N5 -> N5 Source # (/\) :: N5 -> N5 -> N5 Source #
type Rep N5 Source #
Instance details Defined in Algebra.Lattice.N5 type Rep N5 = D1 (' MetaData "N5" "Algebra.Lattice.N5" "lattices-2.1-Aj77JapAM1ZIiO74F5gL5i" ' False ) (( C1 (' MetaCons "N5o" ' PrefixI ' False ) ( U1 :: Type -> Type ) :+: C1 (' MetaCons "N5a" ' PrefixI ' False ) ( U1 :: Type -> Type )) :+: ( C1 (' MetaCons "N5b" ' PrefixI ' False ) ( U1 :: Type -> Type ) :+: ( C1 (' MetaCons "N5c" ' PrefixI ' False ) ( U1 :: Type -> Type ) :+: C1 (' MetaCons "N5i" ' PrefixI ' False ) ( U1 :: Type -> Type ))))