Implementing Generic Algorithms in Functional Languages

Haskell has the status like Hebrew ,Latin ,or Greek in the natural languages. Knowledge of Haskell will help you understand concepts of functional programming. I am profiting very much Haskell lectures which gave by Erick Meijer.
http://channel9.msdn.com/shows/Going+Deep/C9-Lectures-Dr-Erik-Meijer-Functional-Programming-Fundamentals-Chapter-4-of-13/
Generic functions increase reusability and composability . Let us start with the small example and we want write a function that gives biggest element of a given tuple. Well, if we implement this function Haskell.
Please read more: http://www.paul-abraham.com/GenericAlgorithms.doc

Is It An Interpretation or Revelation?

In my Life, I heard many times "Coriolan" Overture " (Beethoven), but this interpretation is a magic . Here comes maestro Carlos Kleiber to conduct :
http://www.youtube.com/watch?v=KB_-zFcy-hM&feature=related
Enjoy

State Monad in F#

I watched Brain Beckman's Web Cast "The Zen of Stateless State"
http://channel9.msdn.com/shows/Going+Deep/Brian-Beckman-The-Zen-of-Expressing-State-The-State-Monad/
and wrote example code for State Monad in F#. Please Check
http://www.paul-abraham.com/MonadsInFSharp.doc

iPod=Horse

Now, I know, why I don't have an iPod. Thank you Maestro Riccardo Mutti for valuable Insights:)
http://www.youtube.com/watch?v=2fyUGY5i9aQ

Enjoy
http://www.youtube.com/watch?v=-AgfCW4r82A

http://www.youtube.com/watch?v=Xvdig4N0bpk :)

Concurrent Quicksort in Erlang and F#

Moore’s Law is no more applicable ( http://en.wikipedia.org/wiki/Moore's_law ) since processors are not getting faster and faster. We have now multicore-processors and developers are confronted with new reality. There are dedicated frameworks like Parallel Extension ,Task Parallel Library(by-product of Microsoft Robotics) for Microsoft.net or dedicated programming languages such as Erlang, but the crucial ingredient for success is to modify algorithms to work parallel as possible. We can gauge achieved improvements by applying Amdahls Law(http://en.wikipedia.org/wiki/Amdahl). I am going to implement these algorithms in F# and Erlang.
Please read  more www.paul-abraham.com/ConcurrentProgramming.doc

A Giant Rock

Do I need to use synchronize primitives in F# MailboxProcessor ?

We don’t need any synchronizing primitives or additional synchronizing efforts to use F# Mailboxprocessor. I like to share a simple program which demonstrates that you don’t need care about synchronizing issues. Read more ....
www.paul-abraham.com/FSharpMailboxProcessor.doc