/explore
|
You are here 
|
dusty.phillips.codes | ||
| | | | |
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: | |
| | | | |
johnazariah.github.io
|
|
| | | | | The Y-Combinator. How to derive recursion in a purely functional context. | |
| | | | |
blog.drewolson.org
|
|
| | | | | I've spent the past several years working with functional programming languages in my free time - primarily Haskell and OCaml. I love both languages but also find aspects of each frustrating. Haskell is terse and elegant with type classes providing a powerful mechanism for ad-hoc polymorphism. However, it can also be confusingly implicit and I personally find lazy evaluation to have more downsides than upsides. OCaml is explicit and powerful with a best-in-class module system. However, I believe it is often exhaustingly explicit, especially when dealing with custom data types in generic containers. | |
| | | | |
relatedwork.blogspot.com
|
|
| | | WARNING: the following contains a whole lot of pedantry about proving theorems at a level of detail such that you could likely convince a co... | ||
