> * I find it difficult to understand how the code I write translates
> into actual algorithms, memory management, etc. Haskell is such a
> nice language that it hides all this detail from me :-). So, I'd be
> grateful for a reference or two on this area.
Manuel pointed out Simon's paper on the
Ian Jackson <[EMAIL PROTECTED]> wrote,
> I'm probably being dense here and not seeing the wood for the trees,
> and I've included lots of tedious junk below, but here goes.
>
> I have a program which runs too slowly. I knew when I wrote it that I
> was taking a `naive' approach to the program -
On 30-Apr-2000, Ian Jackson <[EMAIL PROTECTED]> wrote:
> I've been using GHC's profiling support. This gives me information
> about numbers of `allocations' (which I presume refers to memory
> allocations) and does indeed point the finger at the part of the
> program that I most suspected anyway.
