[Haskell-cafe] Learn You a Haskell for Great Good - a few doubts
markus.l2ll at gmail.com
Fri Mar 4 03:24:34 CET 2011
What about having the order by diagonals, like:
0 1 3
and have none of the pair be bounded?
On 4 Mar 2011, at 01:10, Daniel Fischer <daniel.is.fischer at googlemail.com
> On Thursday 03 March 2011 23:25:48, Alexander Solla wrote:
>> On Thu, Mar 3, 2011 at 1:58 PM, Richard O'Keefe <ok at cs.otago.ac.nz>
>>> 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
> sets are countable).
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
More information about the Haskell-Cafe