Over on the F# team blog we've announced Updates to the August 2011 F# 2.0 Compiler Code Drop   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 in the F# PowerPack. These changes allow you to compile the F# compiler as a browser-hosted (Silverlight 4.0) component. This can then be hosted inside a browse[...]

Regular readers of my blog will know that from time to time I post pointers to technologies that work with F#, as a service to the F# community. I've blogged in the past about other maths and stats libraries that work with F#, and am adding another one today! StatFactory have released FCore, a .NET/native numerical library that is "specifically designed for those who want to use F# in their quantitative development". Here's a snippet from their website: Our product "FCore" is a .NET numerical library which[...]

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,  London (map) In recent years we have seen great progress made in the area of  automatic source-level static analysis tools. However, most of today’s program verification tools are limited to properties that guarantee the absence of bad events (safety pr[...]

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 of partial values of continued fractions for square roots provide the [...]