/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

 byorgey.wordpress.com
Dynamic programming in Haskell: lazy immutable arrays | blog :: Brent -> [String]
| | eli.thegreenplace.net
Right and left folds, primitive recursion patterns in Python and Haskell - Eli Bendersky's website
3.2 parsecs away

Travel
| |
| | qsantos.fr
Dynamic Programming is not Black Magic | Quentin Santos
2.7 parsecs away

Travel
| |
| | blog.dhsdevelopments.com
An imperative introduction to array programming - Elias Mårtenson
3.1 parsecs away

Travel
| | You may have heard about how array programming languages such as APL, J or K. If you have, you've probably heard that code written in the...
| | danielpecos.com
Java 8 and Functional Programming
18.4 parsecs away

Travel
| 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: