Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
ignore the abstract algorithm and develop such calculus by itself. 1. Starting point: affine λ-calculus Let’s start by defining a syntax with functions, variables and function application: term = λx. term -- function | (term term) -- application | x -- variable And now let’s define a reduction rule