|
You are here |
aartaka.me | ||
| | | | |
afnan.io
|
|
| | | | | [AI summary] The author explains the basics of lambda calculus, a theoretical model of computation invented by Alonzo Church that serves as the foundation for functional programming languages. | |
| | | | |
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. | |
| | | | |
blog.josephwilk.net
|
|
| | | Isolating external dependencies helps make testing easier. We can focus on a specific unit of code and we can avoid slow tests calling real services ... | ||