Explore >> Select a destination
|
You are here 
|
programmingmadecomplicated.wordpress.com | ||
| | | | |
kuruczgy.com
|
|
| | | | | ||
| | | | |
rakhim.org
|
|
| | | | | ||
| | | | |
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: | |
| | | | |
bartoszmilewski.com
|
|
| | | In the previous installment of Categories for Programmers, Categories Great and Small, I gave a few examples of simple categories. In this installment we'll work through a more advanced example. If you're new to the series, here's the Table of Contents. Composition of Logs You've seen how to model types and pure functions as a... | ||
