[Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?

haskell-cafe.mail.zooloo at xoxy.net haskell-cafe.mail.zooloo at xoxy.net
Wed Dec 7 14:53:05 EST 2005

On Wed, Dec 07, 2005 at 05:59:55PM +0100, haskell-cafe.mail.zooloo at xoxy.net wrote:
> > I liked the concept of UT in Clean, but I haven't ever got comfortable
> > with using it to write real programs.
> Clean-like _explicit_ uniqueness typing is not what I'm asking for in Haskell.

So you want implicit, automatically inferred uniqueness typing -
something that would be even more fragile and sensitive then current
Haskell's space problems arising from laziness? ;-)

> It might be possible to get extremely fast code out of ghc, but as an
> overall impression, it's not easy, whilst Clean sort of gives it for
> granted (well, struggeling with wrongly assigned uniqueness attributes
> aside).

Well, C sort of gives it for granted too, because it is very difficult
to write inefficient, simple, specification-like code. I want to be able
to write simple and elegant code, even if it is inefficient!

Best regards

I am searching for a programmer who is good at least in some of
[Haskell, ML, C++, Linux, FreeBSD, math] for work in Warsaw, Poland

More information about the Haskell-Cafe mailing list