Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
of application to: Lambda application: ((λx. body) arg) ~> body x <~ arg a ~> b means a reduces to b a <~ b means a is replaced by b Does that break the world? Not really. It is still a computing model with unambiguous reduction rules. We just removed the notion of scope. As soon as a function is