The obdd package

[Tags:gpl, library, test]

Construct, combine and query OBDDs; an efficient representation for formulas in propositional logic.

This is mostly educational. The BDDs do not share nodes (there is no persistent BDD base) and this might introduce inefficiencies.

An important (for me, in teaching) feature is that I can immediately draw the BDD to an X11 window (via graphviz). For example, to show the effect of different variable orderings, try this in ghci:

 import qualified Prelude as P
 import OBDD
 let f [] = false; f (x:y:zs) = x && y || f zs
 display P.$ f P.$ variable [1,2,3,4,5,6]
 display P.$ f P.$ variable [1,4,2,5,3,6]

If you want better performance, use CUDD Haskell bindings, see this example.


Versions 0.2, 0.2.3, 0.2.5, 0.2.7, 0.3.1, 0.3.2, 0.3.3, 0.4.0, 0.5.0, 0.6.0, 0.6.1, 0.8.1
Dependencies array, base (==4.*), containers (>=0.5), ersatz, mtl, process-extras, random, text [details]
License GPL
Author Johannes Waldmann
Maintainer Johannes Waldmann
Stability Unknown
Category Logic
Home page
Source repository head: git clone git://
Uploaded Thu Dec 29 21:44:40 UTC 2016 by JohannesWaldmann
Distributions NixOS:0.8.1
Downloads 1466 total (10 in the last 30 days)
0 []
Status Docs available [build log]
Last success reported on 2016-12-29 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees