Re: [Haskell-cafe] Wrong Answer Computing Graph Dominators

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 ??? -- Kim-Ee -- View this message in context: http://www.nabble.com/Wrong-Answer-Computing-Graph-Dominators-tp16714477p167... Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.