Re: [Haskell] What makes a functional language functional?

2007-08-09 Thread C.M.Brown
three x /= 3 > > The equation then requires a side condition: > >three x = 3, for well-defined x > > which complicates equational reasoning, but it doesn't break > referential transparency. > > Jeremy > > > On 9 Aug 2007, at 10:30, C.M.Brown wrote: &g

[Haskell] What makes a functional language functional?

2007-08-09 Thread C.M.Brown
Hi, Is lazy evaluation necessary for a functional language to remain functional? The reason I ask is that because it violates beta-reduction, and also referential transparency (I think). In haskell, we can transform: g x + f x into: f x + g x as both f and g do not change the parameter x. If

Re: [Haskell] refactoring, catamorphism, termination of programs

2007-05-02 Thread C.M.Brown
Hi Jahannes, > I don't want to make a big research project out of this, > rather I think of quickly putting together a prototype > that proves the concept. > > I figure it could be distilled from some existing refactoring suite, > or be manufactured from existing building blocks. Well, HaRe -- th

Re: [Haskell] Re: [Haskell-cafe] SimonPJ and Tim Harris explain STM - video

2006-11-24 Thread C.M.Brown
Hi, I got this working on Mac OS X. I had to download media player 9: http://www.microsoft.com/windows/windowsmedia/software/Macintosh/osx/default.aspx This contains the WMV3 codec. Cheers, Chris. On Fri, 24 Nov 2006, James William Pye wrote: > On Fri, Nov 24, 2006 at 10:26:38AM +0100, Tomas