Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
same thing, and leaves a hanging λf with no matching occurrence. That’s a bug. To fix that, let’s rename the introduced variables: term = λf. λx. f x λt. t term term --------------- lambda copy term = λx. f x λt. t (λf0. term) (λf1. term) That’s better, but what about the occurrence of f? Now it is