ToySolver.Data.Boolean

Type classes for lattices and boolean algebras.

Boolean algebra

class Complement a where

types that can be negated.

Methods

notB :: a -> a

Instances

Complement Bool

Complement Lit

Complement QFFormula

Complement Lit

Complement lit => Complement (DNF lit)

Complement (Formula a)

Complement (Rel c)

class Complement a => Boolean a where

types that can be combined with boolean operations.

Minimal complete definition

true, false, (.&&.), (.||.)

Methods

true, false :: a

(.&&.) :: a -> a -> a infixr 3

(.||.) :: a -> a -> a infixr 2

(.=>.), (.<=>.) :: a -> a -> a infix 1 .=>., .<=>.

Instances

Boolean Bool

Boolean QFFormula

Complement lit => Boolean (DNF lit)

Boolean (Formula c)

andB :: Boolean a => [a] -> a

orB :: Boolean a => [a] -> a