Hoeveel regels heb je nodig om een simpele WCF service te starten die onder Linux draait? Antwoord: circa 30 regels. Sterker, je kunt die WCF zelfs draaien zonder te compileren, want het werkt gewoon in de F# Interactive! Je moet wel de wereld en zijn moeder installeren om dit voor elkaar te krijgen. Oorspronkelijk was het mijn doel om eens wat meer te zien van Hadoop. Maar zover is het nog niet echt gekomen. Mijn installatie, onder Windows 7 (maar wel laptop met Bang en Olufsen boxen!): [...]

A few months ago, some coworkers sent around a Ruby challenge. It appears simple, but we can sometimes learn a lot from simple problems. Write a Ruby program that determines the smallest three digit number such that when said number is divided by the sum of its digits the answer is 20. In case that’s not clear, [...]

I am very excited to finally share the first version of my latest type provider, the Mixin Provider!  This post is quite long but you should read it all, this only scratches the surface really. Background   Code Generation in F# Code generation in any language is a double edged sword.  It is an extremely powerful technique used all over the place, often to great effect.  It can also turn into a complete nightmare with millions of often unnecessary and bloated lines of code, hard to find bugs, and hard to m[...]

This is the first part of an intermittent series of articles about calculating Fibonacci numbers in F#. Each article will present a different kind of implementation. Where available, I will also show a corresponding implementation in C#. Step 1: Specification To be truly infite, the sequence has to satisfy three conditions: it has to be lazy, i.e., the numbers are not cached, but continually generated, the type of number must not have an upper boundary, and the algorithm must never cause a stack overflow.[...]

This is the first part of an intermittent series of articles about calculating Fibonacci numbers in F#. Each article will present a different kind of implementation. Where available, I will also show a corresponding implementation in C#. Step 1: Specification To be truly infite, the sequence has to satisfy three conditions: it has to be lazy, i.e., the numbers are not cached, but continually generated, the type of number must not have an upper boundary, and the algorithm must never cause a[...]