Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
(v = λx. body) ~> v = body v <~ (λx0. v) v <~ (λx1. v) x <~ (x0 & x1) Superposed copy: (v = x0 & x1) ~> v <~ x0 v <~ x1 a ~> b means a reduces to b a <~ b means a is replaced by b As you can see, this calculus was developed independently, with no relationship to the abstract algorithm at all. Each