/explore
|
You are here 
|
nguyenhuythanh.com | ||
| | | | |
sookocheff.com
In a purely functional language - like lambda calculus - programs are expressed as nested function calls. Repetition in such an environment requires that nesting of function calls continues until some condition is met. During the repetition, each function passes its result to the next function in the nested chain and this repetition is completed when a test for some condition passes. The repetitive behaviour I've just described is recursion: |
|
| | | | | ||
| | | | |
deniskyashif.com
How to define a recursive function in a language which doesn't support recursion using the Y combinator. |
|
| | | | | ||
| | | | |
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. |
|
| | | |||
