Re: referential transparency, definiteness, and unfoldability

From: <bbr_at_informatik.uni-kiel.de>
Date: Thu, 15 Jul 2010 11:50:30 +0200

Funny, though that there are no references in the definition of
"Referential Transparency".

> 1. Referential Transparency.
>
> A language is said to be referentially transparent if for all
> expressions e and contexts C
>
> [| e |] = [| e' |] ==> [| C[e] |] = [| C[e'] |]


I always thought that this property was called "Compositionality" rather.
_______________________________________________
curry mailing list
curry_at_lists.RWTH-Aachen.DE
http://MailMan.RWTH-Aachen.DE/mailman/listinfo/curry
Received on Thu Jul 15 2010 - 11:59:15 CEST

This archive was generated by hypermail 2.3.0 : Thu Sep 19 2019 - 07:15:08 CEST