/explore
|
You are here 
|
deniskyashif.com | ||
| | | | |
azdavis.net
|
|
| | | | | Various varieties of function in programming languages. | |
| | | | |
blog.klipse.tech
|
|
| | | | | Recursions without names. The y combinator in clojure. Lambda Calculus. | |
| | | | |
afnan.io
|
|
| | | | | In 1936, Alonzo Church invented a universal model of computation called "lambda calculus." This system expresses computation as reductions on lambda expressions, which are basically just functions and variables. The system is simple but incredibly expressive, and serves as the foundation for programming languages such as Haskell and Idris. The significance of having a universal model of computation is that it provides a way of solving any problem that can be expressed in the system, and changes the problem from "how can I calculate this" to "can I express this properly?" Lambda calculus is also Turing complete, and even more impressively, was invented in the 1930s independently of Turing. | |
| | | | |
www.github.com
|
|
| | | Julie Cogley Portfolio Site. Contribute to juliecogley/julie_portfolio development by creating an account on GitHub. | ||
