Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
application | x -- variable | x = term -- definition Lambda application: ((λx. body) arg) ~> body x <~ arg Copy: x = t ~> all x <~ t a ~> b means a reduces to b a <~ b means a is replaced by b That is, we now have an additional syntax, x = t, which, in the same “scopeless” vibe, globally replaces