Explore >> Select a destination
|
You are here 
|
alexn.org | ||
| | | | |
abhinavomprakash.com
|
|
| | | | | Defining recursion in terms of itself is an old joke among programmers. Despite the fact that it frustrates a lot of new-comers, we don't change it. I like to define recursion as "Iteration for the cool kids". I don't mean this in a snobbish, let-us-exclude-the-for-loopers kinda way, but rather in a tone of appreciation. Recursion is an elegant way of doing things. Recursive alogrithms are concise, have less noise and have immutability baked in (always a plus). | |
| | | | |
volgarev.me
|
|
| | | | | ||
| | | | |
danielpecos.com
|
|
| | | | | Purpose of this post is to providea glimpse of the new features included in Java 8 that shiftthis language towards a more Functional Programming paradigm. But before, let's define what we understand for Functional Programming (FP). Functional programming key characteristics include: Higher Order Functions Pure Functions and Immutability Tail Call Recursion Higher Order Functions for a FP language means that functions are considered first class citizens, allowing the programmer to use them as any other value the language defines, for example, a Function value: | |
| | | | |
www.parsonsmatt.org
|
|
| | | (this post is part of a series on Object Oriented Programming in Haskell - see tutorials for a table of contents) | ||
