[Haskell-cafe] Question on leazy evaluation

[Pierre Barbier de Reuille]

Hello,

I'm very new to Haskell and I'm learning it in my spare time (ie. just 
for fun ;) ). I already had a quick look through tutorials, some 
articles, the Wiki, ...

My question is: is there some (simple?) rule/criteria to ensure leazy 
evaluation will be efficient ? Typically, I process a list and I know 
each list item can be processed as it come. But I'm not sure my code 
uses correctly this property ! Is there some way to be sure leazy 
evaluation is correctly used by my code ? And are there coding rules 
that will "ensure" correct leazy evaluation ?

Thanks,

Pierre

-- 
Pierre Barbier de Reuille

INRA - UMR Cirad/Inra/Cnrs/Univ.MontpellierII AMAP
Botanique et Bio-informatique de l'Architecture des Plantes
TA40/PSII, Boulevard de la Lironde
34398 MONTPELLIER CEDEX 5, France

tel   : (33) 4 67 61 65 77    fax   : (33) 4 67 61 56 68