> > Miranda has something called diagonalizing list
> comprehensions if I recall
> > correctly. I think you would write:
> >
> > [(a,b) // a <- [1..], b <-[1..]]
> >
> > and the resulting list would be
> >
> > [(1,1), (1,2), (2,1) ...]
>
> Haskell has this too. :) The syntax is almost the sa
On Fri, 9 Jul 1999, Fergus Henderson wrote:
> > > And for other constructor kind, like say, Pair, List ...
> > > "deriving" does not seem to make much sense.
> > > Because there exist too many equally good ways to `enum' these
> > > types. Hence, it is better to leave this for the possible separa
Fergus Henderson wrote:
> On 08-Jul-1999, I stupidly typed:
> > P.S.: The only response was from Ferguson,
> Who's this "Ferguson" dude? ;-)
I hoped that this would be obvious, it's
echo "Fergus Henderson" | sed 's/ ...//' => Ferguson
It even works well with other people's names:
On 08-Jul-1999, Keith Wansbrough <[EMAIL PROTECTED]> wrote:
>
> > And for other constructor kind, like say, Pair, List ...
> > "deriving" does not seem to make much sense.
> > Because there exist too many equally good ways to `enum' these
> > types. Hence, it is better to leave this for the poss
Hello!
On Thu, Jul 08, 1999 at 02:56:57PM -0300, Tamara Rezk wrote:
> Do anyone know where can I get any implementation of TCP/IP for haskell?
> Thanks.
> Tamara Rezk
Have you got my mail?
Date: Sun, 4 Jul 1999 11:46:48 +0200
From: Hannah Schroeter <[EMAIL PROTECTED]>
Subject: Re: TCP/IP Impl
