On Sun, 30 Nov 2008, Neil Mitchell wrote:
http://www.cs.york.ac.uk/fp/darcs/proposition/
Unreleased, but might be of interest. It simplifies propositional
formulae, and can do so using algebraic laws, custom simplifications
or BDDs. I don't really use this library, so if it is of interest to
you, its all yours :-)
Thanks, but I don't think a propositional library is a good starting point
for a predicate library - the problems are too different. Sadly my
predicates are over infinite domains, otherwise BDDs would have been
really nice :-(
Cheers,
Ganesh
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
