[Haskell-cafe] Functional progr., images,
laziness and all the rest
u.stenzel at web.de
Thu Jun 22 06:22:41 EDT 2006
jerzy.karczmarczuk at info.unicaen.fr wrote:
> apparently - Clean has better handling of strictness
> issues [saying at the same time that he/she doesn't use Clean...]
Uhm... well... and does it? From what I've heard, Clean has the same
mechanism as Haskell, which is the 'seq' primitive. Clean just adds
some syntactic sugar to make functions strict in some arguments. If
that's the only difference, I'm quite happy with the False-guard idiom
(and may be even more happy with !-patterns).
> And here apparently I am one of rare people - I am not proud of it,
> rather quite sad, who defends laziness as an *algorithmisation tool*,
> which makes it easy and elegant to construct co-recursive codes. Circular
> programs, run-away infinite streams, hidden backtracking etc.
And don't forget the Most Unreliable Method to Compute Pi! That would
be plain impossible without lazy evaluation. (Nice blend of humor and
insight in that paper, by the way.)
> In this context, I found Clean more helpful than Haskell, for ONE reason.
> Clean has a primitive datatype: unboxed, spine-lazy but head-strict lists.
If I understand correctly, you'd get the same in GHC by defining
*> data IntList = Nil | Cons I# IntList
though it is monomorphic, and you'd get the same semantics from
*> data List a = Nil | Cons !a (List a)
Now it is polymorphic and it may even get unpacked.
If your life was a horse, you'd have to shoot it.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org//pipermail/haskell-cafe/attachments/20060622/db5b7714/attachment.bin
More information about the Haskell-Cafe