Explore >> Select a destination


You are here

text.marvinborner.de
| | deniskyashif.com
1.2 parsecs away

Travel
| | How to define a recursive function in a language which doesn't support recursion using the Y combinator.
| | sookocheff.com
1.7 parsecs away

Travel
| | 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:
| | afnan.io
1.5 parsecs away

Travel
| |
| | mvanier.livejournal.com
29.1 parsecs away

Travel
| or: How to Succeed at Recursion Without Really Recursing Tiger got to hunt, Bird got to fly; Lisper got to sit and wonder, (Y (Y Y))? Tiger got to sleep, Bird got to land; Lisper got to tell himself he understand. Kurt Vonnegut, modified by Darius Bacon Introduction...