I'm more of a Python person, and Python doesn't really use blocks. I like the duality mentioned this post: http://journal.stuffwithstuff.com/2013/01/13/iteration-insid... (In summary it's for item in L: f(item) vs L.each(|item| ...)
I don't really think of C++ algorithm.h as LINQ ? I guess I don't use it that much. To me that is more "functional in the small", e.g. map or filter with lambdas, vs. "functional in the large". But I'd be interested to hear more details on this analogy.
http://stephane.ducasse.free.fr/FreeBooks.html
The best free implementations to play around are Squeak and Pharo.
Or if you want to avoid installing anything, Amber gives some taste of it.
Now, regarding the LINQ like stuff, in Smalltalk doing this type of stuff was already possible back in those days.
|a|
vec := #(1 2 3 4 5 6).
sumPairs := (vec select: [:x | (x \\ 2) = 0]) inject: 0 into: [:l :r | l + r].
Yes, that is what I was thinking of. The other part, immutable data and such, isn't that possible to practice in large teams. But I do make use of it in personal projects.
Thanks to support for blocks (lambda), Smalltalk collections already had LINQ style programming, aka algorithm.h support, for example.
Nice link.