On Wed 06 Oct, Johan Nordlander wrote: > Just to avoid any unfortunate misconceptions: O'Haskell definitely > preserves the property we commonly refer to as referential transparency, > and so does Concurrent Haskell, or any other sound monadic extension of > the language. Hmm, I obviously don't understand what 'referential transparency' means. I must say I'm puzzled by statements like this. If the presence of mutable variables (and MVars in Concurrent Haskell) preserve referential transparency, then why _don't_ we have referential transparency in C? Does it have something to do with denotational semantics and world models containing infinite trees of random numbers? Regards -- Adrian Hey
- Re: OO in Haskell Andreas Rossberg
- Re: OO in Haskell Johan Nordlander
- RE: OO in Haskell Kevin Atkinson
- Re: OO in Haskell Clifford Beshers
- Re: Re: OO in Haskell Juergen Pfitzenmaier
- Re: Re: OO in Haskell Juergen Pfitzenmaier
- Re: OO in Haskell Juergen Pfitzenmaier
- Re: OO in Haskell Adrian Hey
- Re: OO in Haskell trb
- Re: OO in Haskell Manuel M. T. Chakravarty
- Re: OO in Haskell Adrian Hey
- Re: OO in Haskell Marcin 'Qrczak' Kowalczyk
- Re: OO in Haskell Adrian Hey
- Re: OO in Haskell Michael T. Richter
- Re: OO in Haskell Kevin Atkinson
- Re: OO in Haskell Fergus Henderson
- Re: OO in Haskell Lars Lundgren
- RE: OO in Haskell R.S. Nikhil
- Re: OO in Haskell Adrian Hey
- Re: OO in Haskell Marcin 'Qrczak' Kowalczyk
- Re: OO in Haskell Lars Lundgren