Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
superposition, moving each superposed value to each target location. For now, that’s what we’ll do: Superposed copy: (v = x0 & x1) ~> v <~ x0 v <~ x1 With this, we can further proceed: term = λf. λx. f x λt. t term term --------------- lambda copy term = λx. (f0 & f1) x λt. t (λf0. term) (λf1.