Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
copy term = f0 x0 & f1 x1 λt. t (λf0. λx0. term) (λf1. λx1. term) --------------------------------------- superposed copy λt. t (λf0. λx0. f0 x0) (λf1. λx1. f1 x1) And now we’re done! The result is the same we got with the global copy , except now it was done incrementally with O(1) operations.  is