Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
primitive to our language, superposition, which is represented by A & B. term = λx. term -- function | (term term) -- application | x -- variable | x = term -- definition | term & term -- superposition Then, in order to incrementally copy a lambda λf, we first rename its bound variables, duplicate