Re: [Haskell-cafe] Designing DSL with explicit sharing [was: I love purity, but it's killing me]

15 Feb 2008


      On Feb 15, 2008, at 1:15 PM, Tony Finch wrote:
...
On Thu, 14 Feb 2008, oleg@okmij.org wrote:
...
As I understand the original problem had less to do with the number  
of
comparison but more to do with the cost of a single comparison. In an
impure language, we can use constant-time physical equality. It is
usually provided natively as pointer comparison, and can be trivially
emulated via mutation.
In Haskell you can (with care) use System.Mem.StableName.
http://research.microsoft.com/~simonpj/Papers/weak.htm
Extra points to anyone who can demonstrate this actually in use for  
caching.

-Jan-Willem Maessen