/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

www.reasoning.page
| | sookocheff.com
35.0 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:
| | nick.zoic.org
27.0 parsecs away

Travel
| |
| | deniskyashif.com
31.4 parsecs away

Travel
| | In this article, we'll define a basic regular expression language using a context-free grammar and learn how to parse its strings in linear time using the recursive descent method.
| | aartaka.me
44.4 parsecs away

Travel
| Lambda Calculus is a fascinating idea, but it's not immediately obvious. In this post, I'm trying to understand and explain the basic terms used in Lambda Calculus.