[Haskell-cafe] Wrong Answer Computing Graph Dominators
a.biurvOir4 at asuhan.com
Fri Apr 18 01:04:42 EDT 2008
Dan Weston wrote:
> Here, "any path" means all paths, a logical conjunction:
> and [True, True] = True
> and [True ] = True
> and [ ] = True
Hate to nitpick, but what appears to be some kind of a
limit in the opposite direction is a curious way of arguing
that: and  = True.
Surely one can also write
and [False, False] = False
and [False ] = False
and [ ] = False ???
View this message in context: http://www.nabble.com/Wrong-Answer-Computing-Graph-Dominators-tp16714477p16760156.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
More information about the Haskell-Cafe