Perhaps the description was unclear;
F1;f1 gives result r1;r2 (not the same)
F1;f2 gives r1;r2
F2,f1 gives r1;r2
-------------------------------------------
> -----Original Message-----
> From: Felipe Almeida Lessa [mailto:felipe.le...@gmail.com]
> Sent: Tuesday, April 19, 2011 2:26 PM
> To: Gregory Guthrie
> Cc: haskell-cafe@haskell.org
> Subject: Re: [Haskell-cafe] Haskell from SML - referrential Transparency?!
>
> On Tue, Apr 19, 2011 at 4:10 PM, Gregory Guthrie <guth...@mum.edu> wrote:
> > and I get different results from the two executions (f1,f2), even
> > though they have exactly the same definition. Reversing their order,
> > gives the exact same results (i.e. the results are still different,
> > and in the same original order as f2;f1). Even doing (f1;f1) gives two
> > different results.
>
> This shows that referential transparency is working nicely.
>
> --
> Felipe.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
