Notes Out of the Tar Pit

March 12, 2015, Tags: reading, paper


  • FP
  • Lambda calculus
  • combinatory logic
  • Von Neumann
  • the turning machine

Further reading

  • Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
  • E. W. Dijkstra Archive: A review of the 1977 Turing Award Lecture


They’re saying that if you have a method completely free of state management or side effects itself If that method invokes any other method , the ability to reason about our state free method is no longer simple You introduce a small thing (calling a function that changes state of some unrelated object, the nose of a camel into a tent) And it will quickly take over – your methods complexity is now significant and your tent is full of camel feces and spit Which actually reminds me : that ramda lib looks very interesting