I hope to do a series covering some theory and implementation of the RSA algorithm in F# in the near future – and one of it’s main ingredients (for simplifying the hard calculations) is the Chinese remainder theorem – so … Continue reading →

after enjoying my winter-holidays for 2011 I’m finally back in action – man it’s good to spent 2 weeks without any productive keyboard-play So prepare for new content in the next few days …

I recently watched this great cast from Graham Hutton on Channel 9: How to be more productive. Right at the beginning he shows us another application of the fixed-point combinator and this got me into the “Haskell/Lazy love”-mode again. So … Weiterlesen →

In this short article I want to show how to implement a simple polynomial type in F# over a generic field. For this I will use the technique introduced in this great article: Writing generic numeric code So you will … Weiterlesen →

In this post I will introduce the concept of textures (and apply it to our plane-primitive) and explain why I choose to add a fog effect. This is the texture we are going to tile to our “floor”: What is … Weiterlesen →