boolean-normal-forms

Boolean normal form: NNF, DNF & CNF

Version on this page:0.0.1@rev:1
LTS Haskell 16.31:0.0.1.1
Stackage Nightly 2020-06-16:0.0.1.1
Latest on Hackage:0.0.1.1

See all snapshots boolean-normal-forms appears in

MIT licensed by Oleg Grenrus
Maintained by [email protected]
This version can be pinned in stack with:boolean-normal-forms-0.0.1@sha256:d5f99a06641414171d06211598b5da03a1db1ffeb6defbf584ad9f733b9e61dc,2839

Module documentation for 0.0.1

  • Data
    • Data.Algebra
      • Data.Algebra.Boolean
        • Data.Algebra.Boolean.CNF
          • Data.Algebra.Boolean.CNF.List
          • Data.Algebra.Boolean.CNF.Set
        • Data.Algebra.Boolean.CoBoolean
        • Data.Algebra.Boolean.DNF
          • Data.Algebra.Boolean.DNF.List
          • Data.Algebra.Boolean.DNF.Set
        • Data.Algebra.Boolean.FreeBoolean
        • Data.Algebra.Boolean.NNF
          • Data.Algebra.Boolean.NNF.Set
          • Data.Algebra.Boolean.NNF.Tree
        • Data.Algebra.Boolean.Negable
        • Data.Algebra.Boolean.NormalForm

Boolean normal forms

Build Status

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

Changes

0.0.1

  • Add NFData instances