Chans are basically linked lists with the next pointer wrapped in an
MVar. The source is actually very readable. So yes, it probably
is the same thing.
Best,
Leon
On Fri, Nov 11, 2011 at 11:37 AM, Nathan Howell
nathan.d.how...@gmail.com wrote:
We're hitting something that looks similar
On Wednesday 24 October 2001 12:32, Simon Peyton-Jones wrote:
The elimination of stupid existential wrapper constructors
is discussed in a bit more detail in the paper Mark and I wrote
recently:
First class modules for Haskell
On Friday 19 October 2001 11:02, George Russell wrote:
Recently I've been experimenting with a sort of OOP with GHC, [...]
I find your discussion rather intriguing, but I'm not sure I fully understand
what you are trying to do.
Existential typing allows for what I would call dynamic dispatch,
I can't think of a way to use unsafePtrCompare safely :-) The relative
ordering of objects isn't guaranteed to be stable under GC.
Cheers,
Simon
Doh, that would throw a monkey wrench into things, wouldn't it? I know of
compacting GC algorithms, but I didn't consider that GHC
I'm writing an atom table for a compiler/interpreter, and it would be really
nice to use unsafePtrLT to implement tree-based finite maps.
For clarification, my atom table consists of these three functions:
mkAtom :: String - IO Atom
show :: Atom - String
(==) :: Atom - Atom - Bool
such
I'm having problems running programs that use modules found in
the hslibs libraries. I've tried these with GHC 5.00.1 on both
a x86 Linux box on which I compiled GHC from source, and a Sparc
box where I installed the precompiled binaries.
If I simply try to load my program (which uses MArray),
