Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
for λ-application: Lambda application: ((λx. body) arg) ~> body[x <~ arg] a ~> b means a reduces to b a[b <~ c] means all occurrences of b in a are replaced by c And, well, that’s it. We invented the λ-calculus. Damn, that was easy. But that doesn’t complete our mission. Application, as defined, is