Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
proceed with our reduction: term = λf. λx. f x λt. t term term --------------- lambda copy term = λx. (f0 & f1) x λt. t (λf0. term) (λf1. term) ----------------------------- lambda copy term = (f0 & f1) (x0 & x1) λt. t (λf0. λx0. term) (λf1. λx1. term) Except now we are already stuck. There is now