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]
Downloads
- boolean-normal-forms-0.0.0.2.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 |
|---|---|
| Dependencies | base (>=4.6 && <4.11), cond (>=0.4.1 && <0.5), containers (>=0.5 && <0.6) [details] |
| License | MIT |
| Copyright | © Oleg Grenrus 2014 |
| Author | Oleg Grenrus |
| Maintainer | oleg.grenrus@iki.fi |
| Category | Data |
| Source repo | head: git clone https://github.com/phadej/boolean-normal-forms.git |
| Uploaded | by phadej at 2017-11-24T12:00:07Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 3298 total (12 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2017-11-24 [all 1 reports] |
Readme for boolean-normal-forms-0.0.0.2
[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