[Haskell-cafe] Learn You a Haskell for Great Good - a few doubts
daniel.is.fischer at googlemail.com
Fri Mar 4 00:10:43 CET 2011
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 countable
sets are countable).
More information about the Haskell-Cafe