[Haskell-cafe] meaning of "referential transparency"

Edsko de Vries edskodevries at gmail.com
Sat Apr 6 20:27:11 CEST 2013


I have quite a detailed discussion of this concept, and related concepts,
in Section 2.8 of my PhD thesis (
https://www.cs.tcd.ie/Edsko.de.Vries/pub/MakingUniquenessTypingLessUnique-screen.pdf
).

-E


On Sat, Apr 6, 2013 at 7:13 PM, Kim-Ee Yeoh <ky3 at atamo.com> wrote:

> On Sun, Apr 7, 2013 at 12:43 AM, Henning Thielemann
> <lemming at henning-thielemann.de> wrote:
> > Can someone enlighten me about the origin of the term "referential
> > transparency"? I can lookup the definition of "referential transparency"
> in
> > the functional programming sense in the Haskell Wiki and I can lookup the
> > meaning of "reference" and "transparency" in a dictionary, but I don't
> know
> > why these words were chosen as name for this defined property.
>
> Instead of a immaculately precise definition, may I suggest going
> about it from the practical benefits POV? RT matters so much in
> Haskell because of the engineering leverage it gives us. Bird's Pearls
> are a good source of Why Equational Reasoning Matters.
>
> -- Kim-Ee
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130406/316d0e60/attachment.htm>


More information about the Haskell-Cafe mailing list