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

Brandon S. Allbery KF8NH allbery at ece.cmu.edu
Mon Sep 8 21:11:18 EDT 2008

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 at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university    KF8NH

More information about the Haskell-Cafe mailing list