<div dir="ltr">I have quite a detailed discussion of this concept, and related concepts, in Section 2.8 of my PhD thesis (<a href="https://www.cs.tcd.ie/Edsko.de.Vries/pub/MakingUniquenessTypingLessUnique-screen.pdf">https://www.cs.tcd.ie/Edsko.de.Vries/pub/MakingUniquenessTypingLessUnique-screen.pdf</a>).<div>
<br></div><div style>-E</div></div><div class="gmail_extra"><br><br><div class="gmail_quote">On Sat, Apr 6, 2013 at 7:13 PM, Kim-Ee Yeoh <span dir="ltr"><<a href="mailto:ky3@atamo.com" target="_blank">ky3@atamo.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">On Sun, Apr 7, 2013 at 12:43 AM, Henning Thielemann<br>
<<a href="mailto:lemming@henning-thielemann.de">lemming@henning-thielemann.de</a>> wrote:<br>
> Can someone enlighten me about the origin of the term "referential<br>
> transparency"? I can lookup the definition of "referential transparency" in<br>
> the functional programming sense in the Haskell Wiki and I can lookup the<br>
> meaning of "reference" and "transparency" in a dictionary, but I don't know<br>
> why these words were chosen as name for this defined property.<br>
<br>
</div>Instead of a immaculately precise definition, may I suggest going<br>
about it from the practical benefits POV? RT matters so much in<br>
Haskell because of the engineering leverage it gives us. Bird's Pearls<br>
are a good source of Why Equational Reasoning Matters.<br>
<span class="HOEnZb"><font color="#888888"><br>
-- Kim-Ee<br>
</font></span><div class="HOEnZb"><div class="h5"><br>
_______________________________________________<br>
Haskell-Cafe mailing list<br>
<a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br>
</div></div></blockquote></div><br></div>