Le 07/01/11 18:21, Alain Frisch a écrit :
> On 01/07/2011 04:35 PM, Dario Teixeira wrote:
>> that is, I don't see why purity would require lazyness.
lazyness implies eta equivalence :
  (fun x -> f x) is not observationally equivalent to f in a strict
language.

I don't think this is a major problem of strict language over lazy ones
... Especially
compared to the problem of complexity prediction which is harder in lazy
languages ...

And by the way : PML is strict, pure with exceptions ... And I consider
exceptions to be pure because they enjoy reference transparency ... But
the PML compiler is not yet there ...

Cheers,
Christophe
 

-- 
Christophe Raffalli
Universite de Savoie
Batiment Le Chablais, bureau 21
73376 Le Bourget-du-Lac Cedex

tel: (33) 4 79 75 81 03
fax: (33) 4 79 75 87 42
mail: Christophe.Raffalli@univ-savoie.fr
www: http://www.lama.univ-savoie.fr/~RAFFALLI
---------------------------------------------
IMPORTANT: this mail is signed using PGP/MIME
At least Enigmail/Mozilla, mutt or evolution 
can check this signature. The public key is
stored on www.keyserver.net
---------------------------------------------