[Haskell] Data.Tree.drawTree more spacefilling?

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Dear all, I'm looking for a Data.Tree.drawTree that is a bit more "spacefilling" (put some subtrees side by side). Thanks - Johannes Waldmann, Leipzig. -BEGIN PGP SIGNATURE- Version: GnuPG v2.0.4-svn0 (GNU/Linux) Comment: Using GnuPG with Mozil

RE: [Haskell] garbage collection of Concurrent Haskell threads?

Hello Simon, For the record: I assume that by "Boehm's article on finalisers" you mean: @inproceedings{DBLP :conf/popl/Boehm03, author= {Hans-Juergen Boehm}, title = {Destructors, finalizers, and synchronization}, book

Re: [Haskell] Empty instance declaration

[EMAIL PROTECTED] wrote: > One thing that hasn't come up yet is that empty instance declarations > are the only decent option (that I know of) that we have in the > absence of real class aliases. It does seem to me that compilers could reasonably distinguish between incomplete definition: > > cl

RE: [Haskell] garbage collection of Concurrent Haskell threads?

The GC discards an MVar when there are only blocked readers on it. But there can be any number of blocked readers. So long as the read remains in the future, however, the GC doesn't recover it, because it has no way to know that the thread will only read it and not write it. Your idea of spl