[Haskell-cafe] Designing DSL with explicit sharing [was: I love
purity, but it's killing me]
dot at dotat.at
Fri Feb 15 13:15:15 EST 2008
On Thu, 14 Feb 2008, oleg at 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.
f.a.n.finch <dot at dotat.at> http://dotat.at/
VIKING NORTH UTSIRE: SOUTHERLY 5 OR 6, OCCASIONALLY 7 LATER IN NORTH. MODERATE
OR ROUGH. FAIR. GOOD.
More information about the Haskell-Cafe