📝 字数：working on
Lambda Calculus¶
Estimated time to read: 1 minute
$\lambda$-calculus is a formal mathematical system introduced by logician Alonzo Church in the 1930s to investigate computation, function definition, and recursion.
In pure lambda-calculus, there are no primitive data types. There are no integers, strings, booleans, or if/else statements. The only entities that exist are functions, and every function takes another function as its argument and returns a function as its output.
The syntax of $\lambda$-calculus consists of only three valid expressions (called $\lambda$-terms):