Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
not capable of. Recall our definition of application: Lambda application: ((λx. body) arg) ~> body[x <~ arg] a ~> b means a reduces to b a[b <~ c] means all occurrences of a in b are replaced by c Previously, it meant that every occurrence of x was replaced by arg inside body. But since now there