What about having the order by diagonals, like: 0 1 3 2 4 5 and have none of the pair be bounded? -- Markus Läll On 4 Mar 2011, at 01:10, Daniel Fischer <daniel.is.fischer@googlemail.com
wrote:
On Thursday 03 March 2011 23:25:48, Alexander Solla wrote:
On Thu, Mar 3, 2011 at 1:58 PM, Richard O'Keefe <ok@cs.otago.ac.nz> wrote:
I can't think of an approach that doesn't require all but one of the tuple elements to have Bounded types.
It's not possible.
Meaning: It's not possible while respecting the order. Ignoring the order, it's of course possible (finite products of countable sets are countable).
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe