Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
it as λf0 and λf1, move each copy to its target location, and then replace the variable f by f0 & f1, which means it is now linked to two lambdas at the same time. We also restrict x in a definition to occur at most twice, otherwise duplication wouldn’t be a constant-time operation anymore. Here’s