Learning Functional Programming in Go

Haskell Curry - 1927

Haskell Curry introduced Combinatory Logic in 1927 that eliminated the use of variables that change. It is based on combinators. A combinator is a higher order function that uses function application and previously defined combinators to produce a result from its arguments. Alonzo Church later devised a similar formalism called The Lambda Calculus, where lambda expressions represent functional abstractions are replaced by a limited set of combinators. For details, see The Lambda Calculus section later in this chapter.