Tonight my colleague Byron Cook from MSR Cambridge will be speaking at the F#unctional Londoners meetup group Byron Cook: Proving program termination with F# Wednesday, November 16, 2011, 6:30 PM The Skills Matter eXchange 116-120 Goswell Road,  L[...]

As announced at the Microsoft Research 20th Anniversary event in Cambridge UK, we have updated the F# 2.0 compiler source code drop to include changes related to the www.tryfsharp.org web application. The code drop is the compiler\2.0\Aug2011.1 directory [...]

If you google for methods of detecting the cpu architecture, you’ll find lots of pages about how to use WMI and ManagementObjectSearcher. This is an immensely slow operation which takes more than a second to complete (at least when I’ve timed it on a 2.8 [...]

Problem The square root of 2 can be written as an infinite continued fraction. The infinite continued fraction can be written, ?2 = [1;(2)], (2) indicates that 2 repeats ad infinitum. In a similar way, ?23 = [4;(1,3,1,8)]. It turns out that the sequence o[...]

Problem Consider the fraction, n/d, where n and d are positive integers. If n < d and HCF(n,d)=1, it is called a reduced proper fraction. If we list the set of reduced proper fractions for d <= 8 in ascending order of size, we get: 1/8, 1/7, 1/6, 1/5, 1/4[...]

As part of the WebSharper web server effort, I have been writing an HTTP request parser. Tuning the parser for performance for the common simple case (small, correct HTTP request) has improved performance 8-fold, from 30K to 250K sample requests parsed e[...]

Ages ago when I wrote my previous Eduasync post, I said we'd look at a pipeline model of coroutines. I've decided to skip that, as I do want to cover the topic of this post, and I've got some more "normal" async ideas to write about too. If you want to lo[...]