[Haskell-cafe] Can't Haskell catch up with Clean's uniqueness typing?
wolfgang at jeltsch.net
Wed Dec 7 09:58:37 EST 2005
Am Mittwoch, 7. Dezember 2005 14:21 schrieb Jan-Willem Maessen:
> The principle obstacles are the same as for any reference counting scheme:
> It imposes more run-time overhead than GC does, unless the data structures
> involved are large.
Why? I think the point with uniqueness typing/analysis is that this is done
More information about the Haskell-Cafe