boolean-normal-forms: Boolean normal form: NNF, DNF & CNF
The provided types that might be useful in symbolic manipulation of propositional logic expressions.
[Skip to Readme]
Modules
[Index] [Quick Jump]
Downloads
- boolean-normal-forms-0.0.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.0.0.1, 0.0.0.2, 0.0.1, 0.0.1.1 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.6 && <4.14), cond (>=0.4.1 && <0.5), containers (>=0.5 && <0.7), deepseq (>=1.1.0.0 && <1.5) [details] |
| Tested with | ghc ==7.6.3 || ==7.8.4 || ==7.10.3 || ==8.0.2 || ==8.2.2 || ==8.4.3 || ==8.6.5 || ==8.8.1 |
| License | MIT |
| Copyright | © Oleg Grenrus 2014 |
| Author | Oleg Grenrus |
| Maintainer | oleg.grenrus@iki.fi |
| Category | Data |
| Uploaded | by phadej at 2019-12-04T19:42:09Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 3381 total (5 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-12-04 [all 1 reports] |
Readme for boolean-normal-forms-0.0.1.1
[back to package description]Boolean normal forms
This library provides types that might be useful in symbolic manipulation of propositional logic expressions.
Features
- CNF (list and set)
- DNF (list and set)
- NNF (tree and set)
- FreeBoolean type useful in testing
Distributed under MIT license © Oleg Grenrus 2014