Timeline for How do I enforce 'referential transparency' in this program?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2017 at 7:31 | history | edited | CommunityBot |
replaced http://programmers.stackexchange.com/ with https://softwareengineering.stackexchange.com/
|
|
| Feb 10, 2015 at 15:08 | history | edited | overexchange | CC BY-SA 3.0 |
deleted 16 characters in body
|
| Feb 10, 2015 at 13:58 | comment | added | Andres F. | @ziggystar True, but note that the definition (and the question) is about referential transparency for every subexpression. What you describe is referentially transparent from outside, but not from inside (if you use a mutable cache, there are inner subexpressions which you cannot freely replace). | |
| Feb 10, 2015 at 12:28 | answer | added | Jörg W Mittag | timeline score: 5 | |
| Feb 10, 2015 at 10:38 | comment | added | jonrsharpe | The title asks how to enforce, the question how to assess. Please clarify what you actually want to know. | |
| Feb 10, 2015 at 8:16 | comment | added | ziggystar | You can have mutable state while retaining referential transparency. Caching results uses mutable state, but is referential transparent. | |
| Feb 10, 2015 at 5:44 | comment | added | overexchange | @WinstonEwert This query is amidst functional programming course exercises. | |
| Feb 10, 2015 at 4:52 | comment | added | Winston Ewert | why do you want to? Are you doing it as an excersize, or is there some practical goal you have mind? | |
| Feb 10, 2015 at 4:29 | history | edited | overexchange |
edited tags
|
|
| Feb 10, 2015 at 4:16 | history | asked | overexchange | CC BY-SA 3.0 |