Explore >> Select a destination
|
You are here 
|
lucasfcosta.com | ||
| | | | |
mvanier.livejournal.com
|
|
| | | | | 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... | |
| | | | |
github.com
|
|
| | | | | Playing around with different Y Combinator implementations - calincru/Y-Combinator | |
| | | | |
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: | |
| | | | |
mmhaskell.com
|
|
| | | [AI summary] This article compares Functional Programming and Object Oriented Programming paradigms, discussing their key differences, strengths, weaknesses, and how Haskell fits into the functional paradigm. | ||
