haskell-obdd
pure Haskell implementation of reduced ordered binary decision diagrams
GPL-2.0 License
Ecosystems:
Haskell
A pure Haskell implementation of Reduced Orderded Binary Decision Diagrams.
This is mostly educational. The BDDs do not share nodes 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.$ P.map variable [1,2,3,4,5,6]
display P.$ f P.$ P.map variable [1,4,2,5,3,6]
If you want better performance, use CUDD Haskell bindings (low level, high level).
Package Rankings
Top 22.16% on Hackage.haskell.org
Badges
Extracted from project README
