Re: [Haskell-cafe] Can you do everything without shared-memory concurrency?

On 2008 Sep 8, at 21:00, Timothy Goddard wrote:

I am not a mathematician, I can't prove it, but I can't think of circumstances where I would need to put mutable references in a data structure except where the language and compiler can't handle immutable structures efficiently.

The status registers of memory-mapped devices come to mind. -- brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@kf8nh.com system administrator [openafs,heimdal,too many hats] allbery@ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH