| Copyright | (c) Masahiro Sakai 2014 |
|---|---|
| License | BSD-style |
| Maintainer | masahiro.sakai@gmail.com |
| Stability | provisional |
| Portability | portable |
| Safe Haskell | None |
| Language | Haskell2010 |
ToySolver.Data.BoolExpr
Contents
Description
Boolean expression over a given type of atoms
BoolExpr type
Boolean expression over a given type of atoms
Constructors
| Atom a | |
| And [BoolExpr a] | |
| Or [BoolExpr a] | |
| Not (BoolExpr a) | |
| Imply (BoolExpr a) (BoolExpr a) | |
| Equiv (BoolExpr a) (BoolExpr a) | |
| ITE (BoolExpr a) (BoolExpr a) (BoolExpr a) |
Instances
| Monad BoolExpr | |
| Functor BoolExpr | |
| Applicative BoolExpr | |
| Foldable BoolExpr | |
| Traversable BoolExpr | |
| Eq a => Eq (BoolExpr a) | |
| Data a => Data (BoolExpr a) | |
| Ord a => Ord (BoolExpr a) | |
| Read a => Read (BoolExpr a) | |
| Show a => Show (BoolExpr a) | |
| NFData a => NFData (BoolExpr a) | |
| Hashable a => Hashable (BoolExpr a) | |
| Boolean (BoolExpr a) | |
| Complement (BoolExpr a) | |
| MonotoneBoolean (BoolExpr a) | |
| Variables a => Variables (BoolExpr a) | |
| IsArithRel (Expr Integer) QFFormula | |
| Typeable (* -> *) BoolExpr |