Data.Algebra.Boolean.NNF.Tree

Documentation

data NNF a

Boolean formula in Negation Normal Form

Boolean operations will perform transformations as below:

Constructors

NNFTrue

NNFFalse

NNFValue a

NNFOr (NNF a) (NNF a)

NNFAnd (NNF a) (NNF a)

Instances

Functor NNF

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

fmap :: (a -> b) -> NNF a -> NNF b

(<$) :: a -> NNF b -> NNF a

Foldable NNF

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

fold :: Monoid m => NNF m -> m

foldMap :: Monoid m => (a -> m) -> NNF a -> m

foldr :: (a -> b -> b) -> b -> NNF a -> b

foldr' :: (a -> b -> b) -> b -> NNF a -> b

foldl :: (b -> a -> b) -> b -> NNF a -> b

foldl' :: (b -> a -> b) -> b -> NNF a -> b

foldr1 :: (a -> a -> a) -> NNF a -> a

foldl1 :: (a -> a -> a) -> NNF a -> a

toList :: NNF a -> [a]

null :: NNF a -> Bool

length :: NNF a -> Int

elem :: Eq a => a -> NNF a -> Bool

maximum :: Ord a => NNF a -> a

minimum :: Ord a => NNF a -> a

sum :: Num a => NNF a -> a

product :: Num a => NNF a -> a

CoBoolean1 NNF

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

toBooleanWith :: Boolean c => (a -> c) -> NNF a -> c

NormalForm NNF

Defined in Data.Algebra.Boolean.NNF.Tree

Associated Types

type NFConstraint NNF a :: Constraint

Methods

toNormalForm :: a -> NNF a

simplify :: NFConstraint NNF a => (a -> Maybe Bool) -> NNF a -> NNF a

fromFreeBoolean :: NFConstraint NNF a => FreeBoolean a -> NNF a

Eq a => Eq (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

(==) :: NNF a -> NNF a -> Bool

(/=) :: NNF a -> NNF a -> Bool

Ord a => Ord (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

compare :: NNF a -> NNF a -> Ordering

(<) :: NNF a -> NNF a -> Bool

(<=) :: NNF a -> NNF a -> Bool

(>) :: NNF a -> NNF a -> Bool

(>=) :: NNF a -> NNF a -> Bool

max :: NNF a -> NNF a -> NNF a

min :: NNF a -> NNF a -> NNF a

Read a => Read (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

readsPrec :: Int -> ReadS (NNF a)

readList :: ReadS [NNF a]

readPrec :: ReadPrec (NNF a)

readListPrec :: ReadPrec [NNF a]

Show a => Show (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

showsPrec :: Int -> NNF a -> ShowS

show :: NNF a -> String

showList :: [NNF a] -> ShowS

Negable a => Boolean (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

true :: NNF a

false :: NNF a

not :: NNF a -> NNF a

(&&) :: NNF a -> NNF a -> NNF a

(||) :: NNF a -> NNF a -> NNF a

xor :: NNF a -> NNF a -> NNF a

(-->) :: NNF a -> NNF a -> NNF a

(<-->) :: NNF a -> NNF a -> NNF a

and :: Foldable t => t (NNF a) -> NNF a

or :: Foldable t => t (NNF a) -> NNF a

nand :: Foldable t => t (NNF a) -> NNF a

all :: Foldable t => (a0 -> NNF a) -> t a0 -> NNF a

any :: Foldable t => (a0 -> NNF a) -> t a0 -> NNF a

nor :: Foldable t => t (NNF a) -> NNF a

NFData a => NFData (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

rnf :: NNF a -> ()

CoBoolean a => CoBoolean (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

toBoolean :: Boolean b => NNF a -> b

Negable a => Negable (NNF a)

Defined in Data.Algebra.Boolean.NNF.Tree

Methods

not :: NNF a -> NNF a

type NFConstraint NNF a

Defined in Data.Algebra.Boolean.NNF.Tree

type NFConstraint NNF a = Negable a

module Data.Algebra.Boolean.NormalForm