caa a22 4500 467989710 CHVBK 20180323112541.0 cr unu---uuuuu 170328e19900501xx s 000 0 eng 10.1007/BF00277387 doi (NATIONALLICENCE)springer-10.1007/BF00277387 Referential transparency, definiteness and unfoldability [Elektronische Daten] [Harald Søndergaard, Peter Sestoft] Summary: The term "referential transparency” is frequently used to indicate that a programming language has certain useful substitution properties. We observe, however, that the formal and informal definitions given in the literature are not equivalent and we investigate their relationships. To this end, we study the definitions in the context of a simple expression language and show that in the presence of non-determinism, the differences between the definitions are manifest. We propose a definition of "referential transparency”, based on Quine's, as well as of the related notions: definiteness and unfoldability. We demonstrate that these notions are useful to characterize programming languages. Springer-Verlag, 1990 Søndergaard Harald Department of Computer Science, University of Melbourne, 3052, Parkville, Vic., Australia aut Sestoft Peter DIKU, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen Ø, Denmark aut Acta Informatica Springer-Verlag 27/6(1990-05-01), 505-517 0001-5903 27:6<505 1990 27 236 https://doi.org/10.1007/BF00277387 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00277387 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Søndergaard Harald Department of Computer Science, University of Melbourne, 3052, Parkville, Vic., Australia aut NATIONALLICENCE 700 1- Sestoft Peter DIKU, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen Ø, Denmark aut NATIONALLICENCE 773 0- Acta Informatica Springer-Verlag 27/6(1990-05-01), 505-517 0001-5903 27:6<505 1990 27 236 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer