Explore >> Select a destination
|
You are here 
|
mathspp.com | ||
| | | | |
hookrace.net
|
|
| | | | | ||
| | | | |
postmodern.github.io
|
|
| | | | | [AI summary] A Ruby developer explains how to implement list comprehensions inspired by Haskell's syntax using a custom extension in Ruby 1.9. | |
| | | | |
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: | |
| | | | |
aartaka.me
|
|
| | | 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. | ||
