| Copyright | © Oleg Grenrus 2014 |
|---|---|
| License | MIT |
| Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |
| Stability | experimental |
| Portability | non-portable |
| Safe Haskell | None |
| Language | Haskell2010 |
Data.Algebra.Boolean.CNF.List
Description
- newtype CNF a = CNF {
- unCNF :: [[a]]
- fromDoubleList :: [[a]] -> CNF a
- toDoubleList :: CNF a -> [[a]]
- fromNNF :: Negable a => NNF a -> CNF a
- module Data.Algebra.Boolean.NormalForm
Documentation
Boolean formula in Conjunction Normal Form
Instances
| Functor CNF Source # | |
| Foldable CNF Source # | |
| CoBoolean1 CNF Source # | |
| NormalForm CNF Source # | |
| Eq a => Eq (CNF a) Source # | |
| Ord a => Ord (CNF a) Source # | |
| Read a => Read (CNF a) Source # | |
| Show a => Show (CNF a) Source # | |
| Negable a => Boolean (CNF a) Source # | |
| NFData a => NFData (CNF a) Source # | |
| CoBoolean a => CoBoolean (CNF a) Source # | |
| Negable a => Negable (CNF a) Source # | |
| type NFConstraint CNF a Source # | |
fromDoubleList :: [[a]] -> CNF a Source #
toDoubleList :: CNF a -> [[a]] Source #