Hmm, your BDD implementation claims (in the comment at the top) that
Equality is fast and accurate. But you don't do sharing
optimizations, and use derived Eq (rather than object identity), so
it's exponential in the number of nodes. Consider:
A
/ \
B |
\ /
On Apr 16, 2007, at 9:07 AM, Neil Mitchell wrote:
Hi,
I am now releasing Data.Proposition. This library handles
propositions, logical formulae consisting of literals without
quantification. It automatically simplifies a proposition as it is
constructed using simple rules provided by the
Hi
Hmm, your BDD implementation claims (in the comment at the top) that
Equality is fast and accurate. But you don't do sharing
optimizations, and use derived Eq (rather than object identity), so
it's exponential in the number of nodes. Consider:
Its accurate and pretty fast - indeed I
