toysolver-0.1.0: Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

Copyright(c) Masahiro Sakai 2012-2014
LicenseBSD-style
Maintainermasahiro.sakai@gmail.com
Stabilityprovisional
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell2010

ToySolver.Data.Boolean

Contents

Description

Type classes for lattices and boolean algebras.

Synopsis

Boolean algebra

class Complement a where Source

types that can be negated.

Methods

notB :: a -> a Source

Instances

class Complement a => Boolean a where Source

types that can be combined with boolean operations.

Minimal complete definition

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

Methods

true, false :: a Source

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

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

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

Instances

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

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