Hi lists,
I recently read Simon Peyton Jones' proposal:
http://hackage.haskell.org/trac/ghc/wiki/GhcPackages
and disagreed with some of the design decisions. (To be fair, the
aspects I disagree with are shared with most or all of the other
proposals) So I've put an alternative proposal here:
ht
Quick comments below
Cyril Schmidt wrote:
> Working on a Monte-Carlo simulation where I have to
> calculate the values of a certain function on the given set of inputs,
> I noticed that some of the input variables change for every iteration,
> while others do not.
>
> To give a simple example, le
Lajos,
Point taken, thanks.
My question, though, is not as much about how I speed up my program,
as it is about the behaviour of the ReaderT monad transformer. There
is something I do not understand about it, namely, why does such a
small change in the code change the behaviour so much.
Regards,
Working on a Monte-Carlo simulation where I have to
calculate the values of a certain function on the given set of inputs,
I noticed that some of the input variables change for every iteration,
while others do not.
To give a simple example, let's suppose I have a function
f a1 a2 p = a1*a2 + p
a
