“Lambda calculus depends on substitution rules that are simply stated but whose implications are difficult to comprehend. The true complexity of these rules is not widely recognized but is evidenced by the “proofs” of Church-Rosser that failed to account for these complexities.”
-
-
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Now that's a hot take! Does he also mention which language is functional programming? Because, to be sure, it's an extremely overloaded term, I'm just not sure anything at all is left if we exclude lambda calculus and its descendants

-
Yes, he explains the distinction in his Turing award speech. https://dl.acm.org/doi/10.1145/359576.359579 … He distinguishes functional programming as simpler than lambda calculus when you lose variable substitution. Instead, you just build from a primitive set of functions and combinators.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
cognitive psychology. PhD