Tomasz Zielonka schrieb:
On Fri, Dec 22, 2006 at 06:16:03PM +0100, Joachim Durchholz wrote:
* Forcing the expressions that get written out means that I cannot use
lazy evaluation freely. In particular, if some library code returns a
data structure that contains a lazy-infinite subexpression,
Joachim Durchholz wrote:
I'll move on to the alternatives - Alice ML and/or Clean. Both can
serialize without forcing lazy subexpressions.
I don't know about Clean, but with respect to Alice ML this is not
correct: Alice ML uniformly blocks on futures upon pickling, including
lazy ones.
In my text/graphics formatting work, I find myself doing a lot of
pipeline processing, where a data structure will undergo a number of
step-by-step transformations from input to output. For example, I have a
function that looks like this (the names have been changed to protect
the innocent--and to
Hi
(There's still no good introduction to Monads, for example. One that's
understandable for a programmer who knows his Dijkstra well but no
category theory. And a few other things.)
I grasped this one first time round:
http://haskell.org/haskellwiki/Monads_as_containers
No category theory.
Hello,
Alternatively, I can wrap all of the state up into a single universal
structure that holds everything I will ever need at every step, but
doing so seems to me to fly in the face of strong typing; at the early
stages of processing, the structure will have holes in it that don't
contain
On Sun, 24 Dec 2006 10:39:19 -0500, you wrote:
You might want to look at the following threads discussing how to make
variable-state monad like structures.
http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/17706
http://www.haskell.org/pipermail/haskell/2006-December/018917.html
Thanks. I
[EMAIL PROTECTED] schrieb:
Joachim Durchholz wrote:
I'll move on to the alternatives - Alice ML and/or Clean. Both can
serialize without forcing lazy subexpressions.
I don't know about Clean, but with respect to Alice ML this is not
correct: Alice ML uniformly blocks on futures upon
Joachim Durchholz wrote:
To adhere to uniformity, strong abstraction, and the Principle of
Least Surprise, we thus chose to force lazy futures in Alice ML.
Well, I wouldn't have expected that pickling has an effect (other than
wrapping the value up for transfer), so at least I would have
Neil Mitchell schrieb:
Hi
(There's still no good introduction to Monads, for example. One that's
understandable for a programmer who knows his Dijkstra well but no
category theory. And a few other things.)
I grasped this one first time round:
