Explore >> Select a destination
|
You are here 
|
boxbase.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: | |
| | | | |
gilmi.me
|
|
| | | | | ?m.me - Giml's type inference engine | |
| | | | |
www.baturin.org
|
|
| | | | | ||
| | | | |
www.baturin.org
|
|
| | | |||
