ruary 2005 05:32
| To: haskell@haskell.org
| Cc: [EMAIL PROTECTED]
| Subject: [Haskell] Re: help with some basic code that doesn't work
|
| Malcolm Wallace <[EMAIL PROTECTED]> wrote:
| > Just a comment, since a couple of people have made similar
statements.
| > Haskell will derive
On Mon, Feb 14, 2005 at 12:36:22PM +0100, Remi Turk wrote:
> > Now that this topic is brought up...
> >
> > Occasionally I would need to define recursive datatypes
> > using an explicit fixed-point operator, such as:
> >
> > > data Fix f = In (f (Fix f)) deriving (Show, Eq)
> > > data L a x
On Mon, Feb 14, 2005 at 02:31:54PM +0900, Shin-Cheng Mu wrote:
> Malcolm Wallace <[EMAIL PROTECTED]> wrote:
> >Just a comment, since a couple of people have made similar statements.
> >Haskell will derive Eq for arbitrarily complex types - there is no
> >restriction to "simple" types, whatever they
Shin-Cheng Mu <[EMAIL PROTECTED]> wrote:
>
> Occasionally I would need to define recursive datatypes
> using an explicit fixed-point operator, such as:
>
> > data Fix f = In (f (Fix f)) deriving (Show, Eq)
> > data L a x = Nil | Cons a x deriving (Show, Eq)
>
> However, Haske
Malcolm Wallace <[EMAIL PROTECTED]> wrote:
Just a comment, since a couple of people have made similar statements.
Haskell will derive Eq for arbitrarily complex types - there is no
restriction to "simple" types, whatever they might be.
Now that this topic is brought up...
Occasionally I would need
