/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

isocpp.org
| | azdavis.net
6.4 parsecs away

Travel
| | Various varieties of function in programming languages.
| | without.boats
6.3 parsecs away

Travel
| |
| | sookocheff.com
9.1 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:
| | text.marvinborner.de
9.0 parsecs away

Travel
| This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus).