I hava a pure BDD library that provides a traversal function https://github.com/jwaldmann/haskell-obdd/blob/master/src/OBDD/Data.hs#L102
This can be used for all sorts of processing, e.g.,
Can we have such a traversal (fold) for this Haskell API for CUDD?
E.g., for the linear programming application, it is certainly possible to code this on the CUDD side (in C)
but I much prefer to do this in Haskell land (and re-use the code I linked above)
Also, for the exact model count, we have the CUDD APA functions, but we wouldn't need them if we could walk the tree with CUDD but do the additions on the Haskell side.
I hava a pure BDD library that provides a traversal function https://github.com/jwaldmann/haskell-obdd/blob/master/src/OBDD/Data.hs#L102
This can be used for all sorts of processing, e.g.,
full_fold vars (bool 0 1) ( const (+) ) o,Can we have such a traversal (
fold) for this Haskell API for CUDD?E.g., for the linear programming application, it is certainly possible to code this on the CUDD side (in C)
but I much prefer to do this in Haskell land (and re-use the code I linked above)
Also, for the exact model count, we have the CUDD APA functions, but we wouldn't need them if we could walk the tree with CUDD but do the additions on the Haskell side.