Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
all occurrences of x by t. This gives us freedom to duplicate anything, anywhere! Here is an example of it in action: term = λf. λx. f x λt. t term term --------------- global copy λt. t (λf. λx. f x) (λf. λx. f x) That is, in order to copy the term λf. λx. f x, we simply gave it a name, then used