cond-0.4: Basic conditional and boolean operators with monadic variants.

Safe HaskellNone

Data.Algebra.Boolean

Synopsis

Documentation

class Boolean b whereSource

A class for boolean algebras. Instances of this class are expected to obey all the laws of boolean algebra.

Minimal complete definition: true or false, not or <-->, || or &&.

Methods

true :: bSource

Truth value, defined as the top of the bounded lattice

false :: bSource

False value, defined as the bottom of the bounded lattice.

not :: b -> bSource

Logical negation.

(&&) :: b -> b -> bSource

Logical conjunction. (infxr 3)

(||) :: b -> b -> bSource

Logical inclusive disjunction. (infixr 2)

xor :: b -> b -> bSource

Logical exclusive disjunction. (infixr 1)

(-->) :: b -> b -> bSource

Logical implication. (infixr 1)

(<-->) :: b -> b -> bSource

Logical biconditional. (infixr 1)

Instances

fromBool :: Boolean b => Bool -> bSource

Injection from Bool into a boolean algebra.

newtype Bitwise a Source

Constructors

Bitwise 

Fields

getBits :: a
 

Instances

Typeable1 Bitwise 
Bounded a => Bounded (Bitwise a) 
Enum a => Enum (Bitwise a) 
Eq a => Eq (Bitwise a) 
Integral a => Integral (Bitwise a) 
Data a => Data (Bitwise a) 
Num a => Num (Bitwise a) 
Ord a => Ord (Bitwise a) 
Read a => Read (Bitwise a) 
Real a => Real (Bitwise a) 
Show a => Show (Bitwise a) 
Ix a => Ix (Bitwise a) 
PrintfArg a => PrintfArg (Bitwise a) 
Storable a => Storable (Bitwise a) 
Bits a => Bits (Bitwise a) 
Bits a => Boolean (Bitwise a)