On Mon, Sep 22, 2014 at 2:26 AM, Holden Lee <holdenlee@alum.mit.edu> wrote:
What is the best way to implement data structures that use pointers in Haskell?

Think at a higher level. Those structures are used to solve what problem? How could that problem be solved haskell-y?

But if you just want some simulation, there's the state monad. You could simulate a malloc-ish memory heap using vanilla Data.Map.

-- Kim-Ee