Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
that name twice on the main term. Obviously, we can’t actually do that, as we already agreed copying isn’t a constant-time operation. What now? 3.b. Incremental copy Here’s the plan: let’s instead copy incrementally. Mind this example: term = λf. λx. f x λt. t term term --------------- term = λx. f