Explore >> Select a destination
|
You are here 
|
zserge.com | ||
| | | | |
peiwen.lu
|
|
| | | | | Exploring functional programming in Sass with Clojure-inspired anonymous functions and threading macros. | |
| | | | |
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: | |
| | | | |
gilmi.me
|
|
| | | | | ?m.me - Compiling Lisp to JavaScript from scratch in 350 LOC | |
| | | | |
rachelcarmena.github.io
|
|
| | | Some characteristics of functional programming | ||
