Microsoft.Owin, a.k.a. Katana, provides a number of very useful abstractions for working with OWIN. These types are optional but greatly ease the construction of applications and middleware, especially security middleware. The Katana team did a great job [...]

This weekend Evelina, Yan an I had the pleasure of speaking at f(by) the first dedicated functional conference in Belarus. It was a short hop by train from Vilnius to Minsk, where we had been attending Build Stuff. Sergey Tihon, of F# Weekly fame, was wai[...]

Welcome to F# Weekly, A roundup of F# content from this past week: News Thank you everybody who helped to raise an initial budget of FSSF! Join F# Advent Calendar 2014 & F# Advent Calendar in English 2014! Check out a brand-new Visual F# Power Tools FAQ. [...]

I’m having some FUN with FP101x by Erik Meijer on the edX plattform and watched the lectures on the countdown problem yesterday. Now I think Erik has very strong opinions and I really like this – most of the time – but there he once again told us about hi[...]

Our friends from Japan have a beautiful event called “F# Advent Calendar“. Every day from December 1 to December 24, one awesome volunteer publish a new post about F#. What an amazing way to celebrate Christmas, isn’t it? Lets support this initiative and [...]

Wearable computing is undeniably a hot topic currently, what with all the major mobile players (Apple, Google and Microsoft) having entered the market. There is also a plethora of smaller players such as Timex, Nike, Pebble, etc. Cheap, ubiquitous wearabl[...]

Wearable computing is undeniably a hot topic currently, what with all the major mobile players (Apple, Google and Microsoft) having entered the market. There is also a plethora of smaller players such as Timex, Nike, Pebble, etc. Cheap, ubiquitous wearabl[...]

A while back I came upon a seemingly not-too-difficult programming exercise: Define a recurrence  by Compute . This isn't too hard to code up, using perhaps a recursive function to represent . With normal double-precision floats, as increases, the result [...]

A while back I came upon a seemingly not-too-difficult programming exercise: Define a recurrence \(x_n\) by $$f(y, z) = 108 - \frac{815 - 1500/z}{y}$$ $$x_0 = 4$$ $$x_1 = 4.25$$ $$x_i = f(x_{i-1}, x_{i-2})$$ Compute \(x_{30}\). This isn’t too hard t[...]