Sunday, May 16, 2010
Sierpinski‘s Triangle
I am enjoying reading the book The Haskell School of Expression. This book teaches Haskell using graphics, multimedia, and so forth. Indeed, it is an interesting approach to teach a functional programming language than Fibonacci series and factorial numbers. After reading the chapter 2 “ Simple Graphics “, I tried to transcript the source code in F#. Boy, I must tell you, I ran into problems. I tried with WPF and F# and it seems to be not a happy marriage. After trying out several things, I chose DirectX and Winforms...Please read more www.paul-abraham.com/Sierpinski.doc
Thursday, December 24, 2009
Caesar Cipher in F# and Haskell
The roman empire Julius Caesar (100 B.C - 44 B.C) used very simple encipher method to communicate with troops. This method substitutes each alphabet of a word with an alphabet from certain position further in alphabet system. If we use displacement-length 2 for the word “apple”,we will get “crrng”. This cipher method is very easy to crack because we have to check only 25 combinations and every language has characteristic distribution for its alphabets, just like finger print.
please read more www.paul-abraham.com/CaesarCipher.doc
please read more www.paul-abraham.com/CaesarCipher.doc
Monday, October 26, 2009
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
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
Sunday, June 28, 2009
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
http://www.youtube.com/watch?v=KB_-zFcy-hM&feature=related
Enjoy
Tuesday, June 2, 2009
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
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
Tuesday, April 28, 2009
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 :)
http://www.youtube.com/watch?v=2fyUGY5i9aQ
Enjoy
http://www.youtube.com/watch?v=-AgfCW4r82A
http://www.youtube.com/watch?v=Xvdig4N0bpk :)
Thursday, April 9, 2009
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
Please read more www.paul-abraham.com/ConcurrentProgramming.doc
Subscribe to:
Posts (Atom)