| I need some expert help on a program of mine. The program benchmarks
| several implementations of functional priority queues. Basically, it
| evaluates different expressions using different implementations of
| priority queues: binary heaps, Braun heaps, pairing heap, leftist heaps
| etc. I thought it possible to do this in one round. Unfortunately, it
| appears that the heap space a particular implementation requires is
| never freed. Consequently, after a few tests the heap space is
| exhausted. I *suspect* this to be a compiler bug. Here is what
| happens:
I too suspect space leaks arising from CAFs. I really think I must squash
the CAF thing once and for all over the summer.
But maybe it's something else. Have you done a space profile?
Once you have some data, do pls send it to me with the program. Thanks
Simon
