[Haskell-cafe] Comparison with Clean?

[Krasimir Angelov]

If you want to compare Haskell and Clean then take a look at Object
I/O library. It is ported to Haskell and you can learn a lot comparing
both implementations. I spent a lot of time translating Clean
functions to Haskell and my own impression is that Haskell's do
notation is much more easier that uniqueness typing. In Clean you have
to explicitly maintain the state while in Haskell it is hidden. In
order to preserve uniquenes property of state, quite often you have
write uggly functions like:

getXYZ :: State -> (XYZ, State)
getXYZ st = (f st, st)

while in Haskell the above function should be:

getXYZ :: State -> XYZ
getXYZ st = f st

It is more clean and from the type signature you can see that this is
readonly access to the state.

Cheers,
 Krasimir

On 5/4/05, Daniel Carrera <dcarrera at digitaldistribution.com> wrote:
> Hi all,
>
> Anyone here familiar with the Clean programming language?
>
> http://www.cs.ru.nl/~clean/
>
> It looks /very/ similar to Haskell, both in functionality and syntax.
>
> I would be grateful for any sort of comparison. I'm trying to decide
> which language I should try to learn.
>
> Cheers,
> Daniel.
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>