Referential Transparency

Referential Transparency is a property of expressions in a functional programming language whereby an expression can be replaced with its corresponding value without changing the program's behavior, distinguishing it from non-referentially transparent constructs that depend on or alter state.

30

Publications

2K

Citations

64

Authors

33

Institutions

Publications per year

2017–2026

4

Authors

64

  1. MR
    M. R. Sleep

    University of East Anglia, United Kingdom

    2 publications · 48 citations

    2

    h-index

  2. CE
    Cosmin E. Oancea

    University of Copenhagen, Denmark

    2 publications · 141 citations

    2

    h-index

  3. FH
    Fritz Henglein

    University of Copenhagen, Denmark

    2 publications · 141 citations

    2

    h-index

  4. TH
    Troels Henriksen

    University of Copenhagen, Denmark

    2 publications · 141 citations

    2

    h-index

  5. HD
    Harlan D. Mills

    IBM (United States), United States

    2 publications · 88 citations

    2

    h-index

1–5 of 64

Venues

  1. IBM Systems Journal

    2 publications · 88 citations

    2

    h-index

  2. Journal of Functional Programming

    2 publications · 147 citations

    2

    h-index

  3. 2

    h-index

  4. Semantics and Pragmatics

    1 publications · 21 citations

    1

    h-index

  5. Choice Reviews Online

    CRO · 1 publications · 40 citations

    1

    h-index

1–5