Functional Programming, Haskell, Computer Science, Lambda Calculus, Algorithms.
let’s forget the Abstract Algorithm altogether and try an exercise. Imagine you took a time machine all the way to 1928 and was in charge of inventing λ-calculus, but, this time, with one constraint: reduction rules must be constant-time operations. How would you do it? Developing a new λ-calculus