{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"The Eric Normand Podcast","title":"What is referential transparency?","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/7d4dc84f\"></iframe>","width":"100%","height":180,"duration":1063,"description":"Referential transparency is a term you’ll hear a lot in functional programming. It means that an expression can be replaced by its result. That is, 5+4 can be replaced by 9, without changing the behavior of the program. You can extend the definition also to functions. So you can say + is referentially transparent, because if you call it with the same values, it will give you the same answer.","thumbnail_url":"https://img.transistorcdn.com/WbyB3L00271RX0nwX_O6wfvG-9-GVuhuQNa4JxI1IvI/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQzMzgvMTU2ODQ4/NjQ0MC1hcnR3b3Jr/LmpwZw.webp","thumbnail_width":300,"thumbnail_height":300}