/explore
|
You are here 
|
backdrifting.net | ||
| | | | |
jacksongl.github.io
online lambda calculus interpreter |
|
| | | | | ||
| | | | |
aartaka.me
Lambda Calculus is a fascinating idea, but it's not immediately obvious. In this post, I'm trying to understand and explain the basic terms used in 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.baturin.org
[AI summary] This blog post tutorial explains advanced OCaml programming concepts including parametric polymorphism, higher-order functions like combinators and composition, and algebraic data types with pattern matching. |
|
| | | |||
